QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#132392#5522. F*** 3-Colorable GraphshanoTL 484ms5460kbC++17824b2023-07-29 19:37:432023-07-29 19:37:47

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-29 19:37:47]
  • 评测
  • 测评结果:TL
  • 用时:484ms
  • 内存:5460kb
  • [2023-07-29 19:37:43]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int N = 10004;
int n,m;
vector<int> adj[N];
int kh[2*N];
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin>>n>>m;
	int ans=3;
	/*vector<int> v;
	for(int i=1;i<=n;i++){
		v.push_back(i);
	}
	random_shuffle(v.begin(),v.end());
	*/
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		//x = v[x-1];
		adj[x].emplace_back(y);
		//adj[y].push_back(x);
	}
	for(int i=1;i<=n;++i){
		for(int x:adj[i]){
			kh[x] = i;
		}
		int cnt = 0;
		for(int j=i+1;j<=n;++j){
			for(int x:adj[j]){
				cnt += kh[x] == i?1:0;
			}
			if(cnt > 1){
				ans = 2;
				i = n+1;
				break;
			}
			cnt=0;
		}
	}
	cout<<ans<<endl;
	
	return 0;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3816kb

input:

2 4
1 3
1 4
2 3
2 4

output:

2

result:

ok 1 number(s): "2"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3716kb

input:

3 5
1 4
2 4
2 5
3 5
3 6

output:

3

result:

ok 1 number(s): "3"

Test #3:

score: 0
Accepted
time: 223ms
memory: 4072kb

input:

10000 20000
4570 11730
8803 16440
4257 15381
4455 17636
5256 13543
2172 18421
7735 17847
8537 16010
6175 12263
1079 13410
335 15901
3272 16233
7435 11454
4469 13374
1564 13416
1264 13446
7484 14510
8193 12267
628 15585
1388 11398
5444 19958
2059 18140
8947 13188
6214 17707
7940 12253
6726 11508
1839...

output:

3

result:

ok 1 number(s): "3"

Test #4:

score: 0
Accepted
time: 484ms
memory: 5460kb

input:

9999 199986
8408 17344
1353 16706
3364 17274
9410 10006
9387 19375
9169 18239
3930 12759
4728 11328
5192 17935
7616 19485
3138 12714
8595 18490
6020 15039
9319 17097
7842 16814
7644 18723
2190 10117
3971 13350
232 15408
6984 12842
6988 17196
9744 18905
6759 13371
4115 18937
1842 13513
6245 18736
207...

output:

2

result:

ok 1 number(s): "2"

Test #5:

score: -100
Time Limit Exceeded

input:

9999 199986
1284 14140
5071 12232
7015 15577
4211 14089
3764 14645
4634 19044
1944 18455
5249 19603
1607 10182
9986 19929
1132 18778
3848 10147
636 10961
1994 14118
5084 18986
4067 19483
2288 17337
3108 15530
2258 12709
9809 14997
4860 11548
1779 13012
5062 16123
7418 10293
7726 11733
1145 14062
369...

output:


result: