QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #548637 | #9221. Missing Boundaries | wangsiyuanZP# | WA | 37ms | 6840kb | C++14 | 784b | 2024-09-05 19:40:45 | 2024-09-05 19:40:46 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long ll;
#define MAXN 200005
struct Node{
ll l,r;
friend bool operator<(Node a,Node b){
return ((a.l?a.l:a.r)<(b.l?b.l:b.r));
}
};
ll n,l,cnt;
Node p[MAXN];
void run(){
cnt=0;
std::cin>>n>>l;
for(ll i=1;i<=n;i++){
std::cin>>p[i].l>>p[i].r;
p[i].l=std::max(p[i].l,0ll);
p[i].r=std::max(p[i].r,0ll);
}
std::sort(p+1,p+n+1);
for(ll i=1;i<=n;i++){
if(p[i].l&&p[i].r){
l-=p[i].r-p[i].l+1;
}else if(p[i].l+p[i].r){
l--;
}else{
cnt++;
}
}
if(cnt>l){
std::cout<<"NIE"<<std::endl;
}else{
std::cout<<"TAK"<<std::endl;
}
return;
}
int T;
int main(){
std::ios::sync_with_stdio(false);
std::cin>>T;
for(int i=1;i<=T;i++){
run();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
3 4 51 1 -1 11 50 -1 -1 -1 10 3 2 -1 -1 -1 -1 -1 -1 2 3 1 2 2 3
output:
TAK NIE NIE
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 37ms
memory: 6840kb
input:
1 200000 1000000000 490669427 -1 224278942 224287156 821104480 -1 861696576 861702036 807438935 807440055 574078002 574083717 465630141 -1 195378188 -1 -1 13500961 -1 977536179 92893115 -1 -1 661145418 -1 215804863 -1 685338515 544348999 -1 465532902 -1 130346949 -1 -1 526666304 635604584 635605404 ...
output:
TAK
result:
ok single line: 'TAK'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
3 4 51 1 -1 11 50 -1 -1 -1 10 3 2 -1 -1 -1 -1 -1 -1 2 3 1 2 2 3
output:
TAK NIE NIE
result:
ok 3 lines
Test #4:
score: 0
Accepted
time: 36ms
memory: 6760kb
input:
1 197838 400000 34167 34169 352180 -1 235963 -1 -1 -1 160401 160405 347288 -1 270353 270354 214502 214504 183243 183245 -1 -1 -1 36193 -1 -1 -1 17557 273498 273500 269137 -1 395099 395100 285515 285518 -1 -1 71041 71042 324060 -1 -1 385151 -1 379645 -1 -1 -1 185142 -1 191584 89259 89261 328347 32834...
output:
TAK
result:
ok single line: 'TAK'
Test #5:
score: -100
Wrong Answer
time: 26ms
memory: 5236kb
input:
2 97340 150000 -1 101927 105937 -1 -1 107253 -1 47307 110550 -1 84061 84062 125176 125177 -1 15915 29617 -1 -1 -1 -1 43147 115958 -1 101807 101808 24866 -1 66826 66828 -1 31640 -1 5610 1281 1284 -1 -1 -1 -1 -1 73973 -1 2945 29064 -1 30653 -1 -1 63714 -1 -1 141389 141390 -1 27465 57358 -1 47388 47389...
output:
TAK TAK
result:
wrong answer 1st lines differ - expected: 'NIE', found: 'TAK'