QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #532476 | #9221. Missing Boundaries | ucup-team2000# | WA | 37ms | 10148kb | C++20 | 2.0kb | 2024-08-25 04:19:08 | 2024-08-25 04:19:08 |
Judging History
answer
#include <bits/stdc++.h>
#define int long long
signed main() {
int T; scanf("%lld", &T); while (T--) {
int N, L;
scanf("%lld%lld", &N, &L);
int cnt = 0;
std::vector<std::tuple<int, int, int>> vec;
int len = 0;
for (int i = 0; i < N; ++i) {
int l, r;
scanf("%lld%lld", &l, &r);
if (l == -1 && r == -1) ++cnt;
else {
if (l == -1) {
vec.push_back({r, l, r});
} else {
vec.push_back({l, l, r});
}
}
if (l > 0 && r > 0) len += (r - l + 1);
else ++len;
}
int lst = 0, flag = 0;
if (len > L) {
puts("NIE");
goto end;
}
std::sort(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); ++i) {
// printf("%d %d\n", lst, flag);
int u, l, r; std::tie(u, l, r) = vec[i];
// printf("%d %d %d\n", u, l, r);
if (l != -1 && lst >= l) {
puts("NIE");
goto end;
}
if (r != -1 && lst >= r) {
puts("NIE");
goto end;
}
if (l == -1) {
// r != -1
lst = r;
continue;
}
if (flag == 1) {
if (r > 0) lst = r, flag = 0;
else lst = l, flag = 1;
continue;
}
if (lst + 1 == l) {
if (r > 0) lst = r, flag = 0;
else lst = l, flag = 1;
continue;
}
if (cnt > 0) {
--cnt;
if (r > 0) lst = r, flag = 0;
else lst = l, flag = 1;
} else {
puts("NIE");
goto end;
}
}
if (lst < L && cnt == 0 && flag == 0) {
puts("NIE");
goto end;
}
puts("TAK");
end:;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3724kb
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: 9900kb
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: 3916kb
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: 33ms
memory: 10148kb
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: 0
Accepted
time: 32ms
memory: 8456kb
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:
NIE NIE
result:
ok 2 lines
Test #6:
score: -100
Wrong Answer
time: 28ms
memory: 5792kb
input:
4 50000 50000 11702 -1 -1 3148 30364 -1 48876 -1 -1 10739 -1 44459 11634 -1 39348 -1 38829 -1 16182 -1 37933 -1 35295 -1 43280 -1 37745 -1 -1 40076 358 -1 14043 -1 13975 -1 41942 -1 -1 13182 14780 -1 -1 14663 3998 -1 -1 24474 -1 6583 -1 9620 -1 37944 12103 -1 8307 -1 45760 -1 -1 2924 25441 -1 -1 194...
output:
TAK NIE NIE TAK
result:
wrong answer 4th lines differ - expected: 'NIE', found: 'TAK'