QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#111035 | #1429. Hit | Kostlin | WA | 51ms | 11736kb | C++14 | 3.3kb | 2023-06-05 16:25:46 | 2023-06-05 16:25:50 |
Judging History
answer
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
#define fi first
#define sc second
#define mkp make_pair
#define pii pair<int,int>
typedef long long ll;
const int N=1e5+5,oo=1e9+5;
inline int read() {
int x=0,flag=0;char ch=getchar();
while(ch<'0'||ch>'9') {flag|=(ch=='-');ch=getchar();}
while('0'<=ch&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return flag?-x:x;
}
inline int mx(int x,int y) {return x>y?x:y;}
inline int mn(int x,int y) {return x<y?x:y;}
inline void swp(int &x,int &y) {x^=y^=x^=y;}
inline int as(int x) {return x>0?x:-x;}
int n,b[N<<1],val[N<<1],Val[N<<1],lim[N<<1],vc[N],Vc[N],ans;
int f[N<<1][20],to[N<<1],cnt,ok[N];
struct Node {
int l,r;
bool operator <(const Node &w) {
return r<w.r;
}
}a[N],c[N];
int main() {
int TT=read();
while(TT--) {
n=read();vc[0]=Vc[0]=b[0]=0;
for(int i=1;i<=n;++i) a[i].l=read(),a[i].r=read(),b[++b[0]]=a[i].l,b[++b[0]]=a[i].r;
sort(b+1,b+b[0]+1);b[0]=unique(b+1,b+b[0]+1)-b-1;
b[b[0]+1]=oo;
for(int i=1;i<=n;++i) a[i].l=lower_bound(b+1,b+b[0]+1,a[i].l)-b,a[i].r=lower_bound(b+1,b+b[0]+1,a[i].r)-b;
sort(a+1,a+n+1);
int vmax=-oo;cnt=0;
for(int i=1;i<=n;++i)
if(a[i].l>vmax) {
vmax=a[i].l;
c[++cnt]=a[i];
}
int pre=-oo;
for(int i=1;i<=n;++i) if(pre<a[i].l) {
pre=a[i].r;
vc[++vc[0]]=pre;
}
ans=0;
for(int i=1,p1,p2;i<=n;++i) {
p1=lower_bound(vc+1,vc+vc[0]+1,a[i].l)-vc;
p2=upper_bound(vc+1,vc+vc[0]+1,a[i].r)-vc-1;
ans=mx(ans,p2-p1+1);
}
for(int i=1;i<=b[0]+1;++i) val[i]=Val[i]=b[0]+1,lim[i]=0;
for(int i=1;i<=cnt;++i) val[c[i].l]=mn(val[c[i].l],c[i].r),Val[c[i].l]=c[i].l;
for(int i=1;i<=n;++i) lim[a[i].l]=mx(lim[a[i].l],a[i].r);
for(int i=b[0];i>=1;--i) val[i]=mn(val[i],val[i+1]),Val[i]=mn(Val[i],Val[i+1]);
for(int i=2;i<=b[0];++i) lim[i]=mx(lim[i-1],lim[i]);
for(int i=1;i<=b[0]+1;++i) f[i][0]=val[i+1];
f[b[0]+1][0]=b[0]+1;
for(int j=1;j<=17;++j)
for(int i=1;i<=b[0]+1;++i)
f[i][j]=f[f[i][j-1]][j-1];
for(int i=1;i<=b[0];++i) {
int now=i;
for(int j=17;j>=0;--j)
if(((ans-1)>>j)&1) now=f[now][j];
to[i]=now;
}
bool fl=1;
for(int i=1;i<=b[0];++i) ok[i]=(lim[i]>=to[i]?ok[i-1]:i);
pre=0; int Pre=pre;
for(int i=1;i<=n;++i) if(pre<a[i].l) {
pre=ok[a[i].r];
if(pre<=Pre||(Vc[0]>=ans-1&&lim[Vc[Vc[0]-(ans-1)+1]]>=pre)) {fl=0;break;}
Vc[++Vc[0]]=pre;Pre=pre;
}
for(int i=1,p1,p2;i<=n&&fl;++i) {
p1=lower_bound(Vc+1,Vc+Vc[0]+1,a[i].l)-Vc;
p2=upper_bound(Vc+1,Vc+Vc[0]+1,a[i].r)-Vc-1;
if(p2-p1+1==0) fl=0;
}
if(fl) {
printf("%d %d ",ans-1,Vc[0]);
for(int i=1;i<=Vc[0];++i) printf("%d ",b[Vc[i]]);
printf("\n");
} else {
printf("%d %d ",ans,vc[0]);
for(int i=1;i<=vc[0];++i) printf("%d ",b[vc[i]]);
printf("\n");
}
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 11736kb
input:
4 4 0 1 2 3 4 5 3 5 5 0 70 0 10 20 30 40 50 60 70 8 -1 7 -2 -1 -9 -7 -8 9 -9 -7 -2 4 -7 4 3 9 5 0 1 0 2 2 3 3 5 4 5
output:
1 3 1 2 5 4 4 10 30 50 70 2 3 -9 -1 9 2 3 1 3 5
result:
ok ok, tt = 4
Test #2:
score: 0
Accepted
time: 4ms
memory: 11656kb
input:
1 1 0 1
output:
1 1 1
result:
ok ok, tt = 1
Test #3:
score: 0
Accepted
time: 2ms
memory: 7564kb
input:
3 1 -1000000000 1000000000 1 -1000000000 -999999999 1 999999999 1000000000
output:
1 1 1000000000 1 1 -999999999 1 1 1000000000
result:
ok ok, tt = 3
Test #4:
score: 0
Accepted
time: 51ms
memory: 9660kb
input:
100000 1 -755794993 -744839313 1 638832683 645984490 1 333736843 342792055 1 -412526164 -400411740 1 193156287 205856204 1 266085745 268256106 1 789502967 806620391 1 85305828 86560242 1 -655573585 -644094805 1 517734490 518776542 1 -966001098 -958188900 1 -780504491 -762439365 1 -896592598 -8804653...
output:
1 1 -744839313 1 1 645984490 1 1 342792055 1 1 -400411740 1 1 205856204 1 1 268256106 1 1 806620391 1 1 86560242 1 1 -644094805 1 1 518776542 1 1 -958188900 1 1 -762439365 1 1 -880465378 1 1 -545603970 1 1 674193870 1 1 -613177432 1 1 -189815796 1 1 -636284766 1 1 -212256845 1 1 -...
result:
ok ok, tt = 100000
Test #5:
score: 0
Accepted
time: 48ms
memory: 9700kb
input:
100000 1 -392749917 -319069731 1 761382535 804248178 1 -858764838 -819815600 1 -87503649 -20800126 1 -69252318 64456029 1 -848092983 -666742404 1 -659061625 -620054847 1 -982031817 -883932130 1 -47104919 97672798 1 -494834028 -456770262 1 496748206 692802903 1 572757539 669651153 1 -484466016 -41314...
output:
1 1 -319069731 1 1 804248178 1 1 -819815600 1 1 -20800126 1 1 64456029 1 1 -666742404 1 1 -620054847 1 1 -883932130 1 1 97672798 1 1 -456770262 1 1 692802903 1 1 669651153 1 1 -413146928 1 1 912121104 1 1 -402000624 1 1 310772000 1 1 -329279769 1 1 888975125 1 1 -505832802 1 1 310...
result:
ok ok, tt = 100000
Test #6:
score: 0
Accepted
time: 51ms
memory: 9628kb
input:
100000 1 -422738609 -95619025 1 496655203 761501973 1 -253341552 895113150 1 -213934938 560617332 1 257193179 510136024 1 -684784337 -650911183 1 -999254900 62633326 1 -627557633 641989470 1 -682383675 66116491 1 -859630523 340664034 1 -422590930 433070710 1 259879968 316877801 1 -90014752 991378355...
output:
1 1 -95619025 1 1 761501973 1 1 895113150 1 1 560617332 1 1 510136024 1 1 -650911183 1 1 62633326 1 1 641989470 1 1 66116491 1 1 340664034 1 1 433070710 1 1 316877801 1 1 991378355 1 1 351139472 1 1 643790197 1 1 899761936 1 1 -713126923 1 1 358738130 1 1 502116510 1 1 647513652 ...
result:
ok ok, tt = 100000
Test #7:
score: 0
Accepted
time: 39ms
memory: 9744kb
input:
100000 1 -146170891 -135832850 1 -758721094 -739814745 1 434418655 436843128 1 584625787 597671579 1 -54920782 -48746711 1 -890924962 -874340357 1 -955254050 -945006677 1 276114326 279390556 1 -291805472 -288200984 1 673823575 685514644 1 -43237398 -31640268 1 -239622315 -224829882 1 -596965402 -595...
output:
1 1 -135832850 1 1 -739814745 1 1 436843128 1 1 597671579 1 1 -48746711 1 1 -874340357 1 1 -945006677 1 1 279390556 1 1 -288200984 1 1 685514644 1 1 -31640268 1 1 -224829882 1 1 -595948258 1 1 -886772435 1 1 281278372 1 1 -154122163 1 1 302173751 1 1 117393731 1 1 -725867793 1 1 -...
result:
ok ok, tt = 100000
Test #8:
score: 0
Accepted
time: 41ms
memory: 9904kb
input:
100000 1 -938525664 -817076126 1 -932701889 -823854498 1 -198817321 -90954343 1 852989237 895167117 1 -657597128 -592296022 1 -189337058 -60845257 1 -308394755 -143079067 1 -798793040 -658589397 1 587269730 632505978 1 463959892 651681553 1 210139744 354710208 1 -738322653 -579254528 1 -473167271 -4...
output:
1 1 -817076126 1 1 -823854498 1 1 -90954343 1 1 895167117 1 1 -592296022 1 1 -60845257 1 1 -143079067 1 1 -658589397 1 1 632505978 1 1 651681553 1 1 354710208 1 1 -579254528 1 1 -415805150 1 1 -620402885 1 1 -80905695 1 1 866571582 1 1 884604855 1 1 888448333 1 1 -97223882 1 1 791...
result:
ok ok, tt = 100000
Test #9:
score: 0
Accepted
time: 40ms
memory: 9780kb
input:
100000 1 -124550996 175843021 1 -993480749 369513273 1 -472345946 866834459 1 51146719 619481540 1 -953985291 -388861986 1 30060232 86153621 1 397966610 670657620 1 228037899 527397835 1 -328812046 777147616 1 528770087 999819348 1 -443642177 430027557 1 -985366041 937429463 1 286165886 375753871 1 ...
output:
1 1 175843021 1 1 369513273 1 1 866834459 1 1 619481540 1 1 -388861986 1 1 86153621 1 1 670657620 1 1 527397835 1 1 777147616 1 1 999819348 1 1 430027557 1 1 937429463 1 1 375753871 1 1 -241036764 1 1 253849507 1 1 904700981 1 1 875953108 1 1 121979058 1 1 465863397 1 1 901461978 ...
result:
ok ok, tt = 100000
Test #10:
score: 0
Accepted
time: 33ms
memory: 9736kb
input:
18139 4 -336270587 -330557331 -252002330 -239258910 -186846904 -186440987 848243159 868102416 3 -195461235 -180651308 -250893512 -232183484 741194405 748153230 1 -583374820 -573301094 2 -289487516 -278362438 -617984192 -600701104 3 361103576 377771047 -629713150 -625261223 760487909 765234419 2 -789...
output:
1 4 -330557331 -239258910 -186440987 868102416 1 3 -232183484 -180651308 748153230 1 1 -573301094 1 2 -600701104 -278362438 1 3 -625261223 377771047 765234419 1 2 -772865937 -84556628 1 1 770021135 1 4 -426773202 -230063854 446840121 522239063 1 3 -817483854 -666548915 382548322 1 6 -869109...
result:
ok ok, tt = 18139
Test #11:
score: -100
Wrong Answer
time: 37ms
memory: 9820kb
input:
18100 8 598403417 795720309 -373919856 -307381953 199626892 235156246 -217973856 -203235401 516184634 548146965 556458253 612829986 -686678416 -587302321 -251190508 -105682769 6 -526414856 -462880667 -734369052 -596753646 114814523 150451126 -10532542 21149560 -892168032 -828869761 -663573167 -62124...
output:
1 6 -587302321 -307381953 -203235401 235156246 548146965 612829986 1 5 -828869761 -621240147 -462880667 21149560 150451126 1 1 342776419 1 5 -964969612 -855582387 -649355822 -35329612 188035491 1 6 -798024093 -606741869 430693526 567632562 803810143 964101989 1 3 -767627849 -495398605 400486568...
result:
wrong answer test 447: expected 1, found 2