QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#673328#9221. Missing Boundariesucup-team191#WA 39ms7160kbC++231.1kb2024-10-24 21:45:142024-10-24 21:45:14

Judging History

你现在查看的是最新测评结果

  • [2024-10-24 21:45:14]
  • 评测
  • 测评结果:WA
  • 用时:39ms
  • 内存:7160kb
  • [2024-10-24 21:45:14]
  • 提交

answer

#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=300010,MOD=1e9+7;
const char en='\n';
const ll LLINF=1ll<<60;

int t,n,c;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		cin>>n>>c;
		vector<pair<int,pii>> v;
		int cm=0,ma=c;
		while (n--)
		{
			int l,r;
			cin>>l>>r;
			if (l==-1 && r==-1)
			{
				++cm;
				continue;
			}
			if (l==-1)
			{
				v.pb({r,{l,r}});
				--ma;
				continue;
			}
			if (r==-1)
			{
				v.pb({l,{l,r}});
				--ma;
				continue;
			}
			ma-=r-l+1;
			v.pb({l,{l,r}});
		}
		sort(all(v));
		bool ok=1;
		int mi=0;
		for (int i=0;i<(int)v.size()-1;++i)
		{
			if (max(v[i].y.x,v[i].y.y)>=v[i+1].x)
			{
				ok=0;
				break;
			}
			if (v[i].y.y!=-1 && v[i+1].y.x!=-1 && v[i+1].y.x!=v[i].y.y+1) ++mi;
		}
		if (cm<mi || cm>ma) ok=0;
		if (ok) cout<<"TAK\n";
		else cout<<"NIE\n";
	}
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3532kb

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: 39ms
memory: 7096kb

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: 3532kb

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: 30ms
memory: 7160kb

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: 30ms
memory: 5548kb

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: 0
Accepted
time: 29ms
memory: 4484kb

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
NIE

result:

ok 4 lines

Test #7:

score: -100
Wrong Answer
time: 30ms
memory: 6192kb

input:

1
197884 400000
299276 299281
340251 -1
-1 350350
315166 -1
103436 103438
164740 164742
237539 -1
383864 -1
205194 -1
-1 -1
69029 69030
-1 -1
231837 231838
35835 35837
387743 -1
125024 -1
-1 -1
-1 -1
-1 -1
-1 283202
94212 94213
219223 219224
-1 -1
-1 139549
260062 -1
387170 387173
-1 328548
-1 -1
-1...

output:

TAK

result:

wrong answer 1st lines differ - expected: 'NIE', found: 'TAK'