oj.uz

Submission #535158

# Submission time Handle Problem Language Result Execution time Memory
535158 2022-03-09T14:23:33 Z Icebear16 Keys (IOI21_keys) C++17
20 / 100
 3000 ms 21628 KB 
#include <bits/stdc++.h>
std::vector<int> adj[2000];
std::vector<bool> visited(2000,false);
int k=0;
std::set<int> s;
void dfs(int n, std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c){
	if(visited[n]){
		return;
	}else{
		visited[n]=true;
		s.insert(r[n]);
		k+=1;
	}
	for(int i=0;i<adj[n].size();i++){
		int y=adj[n][i];
		for(int j=0;j<u.size();j++){
			if((u[j]==n && v[j]==y) || (v[j]==n && u[j]==y)){
				if(s.count(c[j])==1){
					dfs(y,r,u,v,c);
				}
			}
		}
	}
}

std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
	std::vector<int> ans(r.size(), 1);
	for(int i=0;i<u.size();i++){
		adj[u[i]].push_back(v[i]);
		adj[v[i]].push_back(u[i]);
	}
	for(int i=0;i<r.size();i++){
		for(int j=0;j<r.size();j++){
			s.erase(j);
		}
		s.insert(r[i]);
		dfs(i,r,u,v,c);
		ans[i]=k;
		k=0;
		for(int j=0;j<r.size();j++){
			visited[j]=false;
		}
	}
	int m=1000000;
	for(int i=0;i<r.size();i++){
		m=std::min(m,ans[i]);
	}
	for(int i=0;i<r.size();i++){
		if(ans[i]==m){
			ans[i]=1;
		}else{
			ans[i]=0;
		}
	}
	return ans;
}

Compilation message

keys.cpp: In function 'void dfs(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:14:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |  for(int i=0;i<adj[n].size();i++){
      |              ~^~~~~~~~~~~~~~
keys.cpp:16:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for(int j=0;j<u.size();j++){
      |               ~^~~~~~~~~
keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:28:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  for(int i=0;i<u.size();i++){
      |              ~^~~~~~~~~
keys.cpp:32:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~
keys.cpp:33:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   for(int j=0;j<r.size();j++){
      |               ~^~~~~~~~~
keys.cpp:40:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |   for(int j=0;j<r.size();j++){
      |               ~^~~~~~~~~
keys.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~
keys.cpp:48:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  for(int i=0;i<r.size();i++){
      |              ~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 31 ms 740 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 31 ms 740 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 28 ms 548 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 46 ms 1020 KB Output is correct
22 Correct 7 ms 460 KB Output is correct
23 Correct 35 ms 716 KB Output is correct
24 Correct 35 ms 716 KB Output is correct
25 Correct 50 ms 980 KB Output is correct
26 Correct 48 ms 972 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 31 ms 740 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 28 ms 548 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 46 ms 1020 KB Output is correct
22 Correct 7 ms 460 KB Output is correct
23 Correct 35 ms 716 KB Output is correct
24 Correct 35 ms 716 KB Output is correct
25 Correct 50 ms 980 KB Output is correct
26 Correct 48 ms 972 KB Output is correct
27 Correct 53 ms 852 KB Output is correct
28 Correct 56 ms 948 KB Output is correct
29 Correct 49 ms 788 KB Output is correct
30 Execution timed out 3021 ms 6164 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 31 ms 740 KB Output is correct
10 Runtime error 145 ms 21628 KB Execution killed with signal 11
11 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 27 ms 596 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 16 ms 460 KB Output is correct
9 Correct 31 ms 740 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 28 ms 548 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 46 ms 1020 KB Output is correct
22 Correct 7 ms 460 KB Output is correct
23 Correct 35 ms 716 KB Output is correct
24 Correct 35 ms 716 KB Output is correct
25 Correct 50 ms 980 KB Output is correct
26 Correct 48 ms 972 KB Output is correct
27 Correct 53 ms 852 KB Output is correct
28 Correct 56 ms 948 KB Output is correct
29 Correct 49 ms 788 KB Output is correct
30 Execution timed out 3021 ms 6164 KB Time limit exceeded
31 Halted 0 ms 0 KB -