• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            #include? < iostream >
            #include?
            < algorithm >

            using ? namespace ?std;

            #define ?N?10010

            struct ?Node{
            ????
            int ?x,?y;
            ????Node(?
            int ?a = ? 0 ,? int ?b = ? 0 ?):x(a),?y(b)?{}
            };

            int ??n,?idx[N * 2 ],?data[N * 2 ],?pos;
            Node?d[N];

            int ?bfind(? int ?v?){
            ????
            int ?left = ? 0 ,?right = ?n * ? 2 ;
            ????
            while (?left + ? 1 < ?right?){
            ????????
            int ?m = ?(left + ?right) >> ? 1 ;
            ????????
            if (?data[m] < ?v?)?left = ?m;
            ????????
            else ? if (?data[m] > ?v?)?right = ?m;
            ????????
            else ? return ?idx[m];
            ????}
            ????
            return ?idx[left];
            }

            int ?tb[N * 8 ],?flag[N];
            void ?insert(? int ?l,? int ?r,? int ?a,? int ?b,? int ?rt,? int ?c?){
            ????
            if (?l == ?a? && ?r == ?b?){
            ????????tb[rt]
            = ?c;? return ;?}
            ????
            int ?m = ?(l + ?r) >> ? 1 ;
            ????
            if (?tb[rt] > ? 0 ?){
            ????????tb[rt
            << 1 ] = ?tb[rt],?tb[(rt << 1 ) + 1 ] = ?tb[rt],?tb[rt] = ? 0 ;?}
            ????
            if (?b <= ?m?)?insert(?l,?m,?a,?b,?rt << ? 1 ,?c?);
            ????
            else ? if (?a > ?m?)?insert(?m + ? 1 ,?r,?a,?b,?(rt << 1 ) + ? 1 ,?c?);
            ????
            else {
            ????????insert(?l,?m,?a,?m,?rt
            << ? 1 ,?c?);
            ????????insert(?m
            + ? 1 ,?r,?m + ? 1 ,?b,?(rt << 1 ) + ? 1 ,?c?);?}
            }
            void ?calc(? int ?l,? int ?r,? int ?rt?){
            ????
            if (?tb[rt] > ? 0 ?)?{?flag[?tb[rt]?] = ? 1 ;? return ;?}
            ????
            else {
            ????????
            if (?l == ?r?)? return ;
            ????????
            int ?m = ?(l + ?r) >> ? 1 ;
            ????????calc(?l,?m,?rt
            << ? 1 ?);
            ????????calc(?m
            + ? 1 ,?r,?(rt << 1 ) + ? 1 ?);
            ????}
            }

            int ?main(){
            ????
            int ?test;
            ????scanf(
            " %d " , & test);
            ????
            while (?test -- ?){
            ????????scanf(
            " %d " , & n?);
            ????????
            int ?u,?v;
            ????????
            for (? int ?i = ? 0 ;?i < ?n;? ++ i?){
            ????????????scanf(
            " %d%d " , & u, & v?);
            ????????????d[i]
            = ?Node(?u,?v?);
            ????????????data[i
            << 1 ] = ?u,?data[(i << 1 ) + 1 ] = ?v;
            ????????}
            ????????sort(?data,?data
            + ?n * ? 2 ?);
            ????????pos
            = ? 1 ;?idx[ 0 ] = ? 1 ;
            ????????
            for (? int ?i = ? 1 ;?i < ?n * ? 2 ;? ++ i?)
            ????????
            if (?data[i] != ?data[i - 1 ]?)?idx[i] = ? ++ pos;
            ????????
            else ??idx[i] = ?pos;
            ????????
            ????????memset(?tb,?
            0 ,? sizeof (tb)?);?
            ????????memset(?flag,?
            0 ,? sizeof (flag)?);
            ????????
            for (? int ?i = ? 0 ;?i < ?n;? ++ i?){
            ????????????u
            = ?bfind(?d[i].x?),?v = ?bfind(?d[i].y?);
            ????????????insert(?
            1 ,?pos,?u,?v,? 1 ,?i + ? 1 ?);
            ????????}
            ????????calc(?
            1 ,?pos,? 1 ?);
            ????????
            int ?ans = ? 0 ;
            ????????
            for (? int ?i = ? 1 ;?i <= ?n;? ++ i?)
            ????????
            if (?flag[i]?)?ans ++ ;
            ????????printf(
            " %d\n " ,?ans?);
            ????}
            ????
            return ? 0 ;
            }
            posted on 2009-07-14 20:19 Darren 閱讀(369) 評(píng)論(0)  編輯 收藏 引用 所屬分類: 數(shù)據(jù)結(jié)構(gòu)
            久久久久人妻一区精品果冻| av无码久久久久不卡免费网站| 国产精品久久久久9999高清| 久久综合色区| 无码AV波多野结衣久久| 久久亚洲国产午夜精品理论片| www亚洲欲色成人久久精品| 欧美亚洲日本久久精品| 性做久久久久久久| 国产亚洲成人久久| 久久久久久久人妻无码中文字幕爆 | 亚洲人成无码www久久久| 久久成人国产精品免费软件| 青青青伊人色综合久久| 久久婷婷色综合一区二区| 99久久伊人精品综合观看| 久久久久久午夜成人影院| 精品免费久久久久国产一区| 久久无码人妻一区二区三区午夜| 精品久久久久一区二区三区| 久久99精品久久久久久动态图| 欧美麻豆久久久久久中文| 亚洲精品乱码久久久久久中文字幕| 亚洲国产精品综合久久一线| 99精品国产在热久久无毒不卡 | 久久99精品国产自在现线小黄鸭 | 亚洲AV无码一区东京热久久| 女同久久| 亚洲国产成人久久精品99| 久久精品国产一区二区| 99热成人精品免费久久| 国产成人久久激情91| 久久久国产乱子伦精品作者| 亚洲国产精品久久久天堂| 亚洲中文字幕无码久久综合网| 亚洲欧美日韩久久精品第一区| 欧美亚洲日本久久精品| 国内精品久久久久久久影视麻豆| 欧美伊香蕉久久综合类网站| 99久久99久久精品免费看蜜桃| 久久久久人妻一区精品色|