Submission #17307

# Submission time Handle Problem Language Result Execution time Memory
17307 2015-11-19T12:54:19 Z gs14004 지도 색칠하기 (GA3_map) C++14
120 / 120
1114 ms 1084 KB
#include <algorithm>
using namespace std;

bool adj[20][20];
int col[20];

int bits, n;
bool bad;

void dfs(int x, int p){
	if(col[x]){
		bad |= (col[x] != p);
		return;
	}
	col[x] = p;
	for(int i=0; i<n; i++){
		if(adj[x][i] && (bits >> i) % 2 == (bits >> x) % 2){
			dfs(i, 3-p);
		}
	}
}

long long NumberOfMaps (int N, int M, int *A, int *B){
	n = N;
	for(int i=0; i<M; i++){
		adj[A[i]-1][B[i]-1] = 1;
		adj[B[i]-1][A[i]-1] = 1;
	}
	long long sum = 0;
	for(int i=0; i<(1<<(N-1)); i++){
		fill(col, col + N, 0);
		bits = i;
		bad = 0;
		int cnt = 0;
		for(int i=0; i<N; i++){
			if(col[i]) continue;
			dfs(i, 1);
			if(bad) break;
			cnt++;
		}
		if(bad) continue;
		sum += (2 << cnt);
	}
	return sum;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 1 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 1 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct
10 Correct 0 ms 1084 KB Output is correct
11 Correct 0 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 0 ms 1084 KB Output is correct
14 Correct 0 ms 1084 KB Output is correct
15 Correct 0 ms 1084 KB Output is correct
16 Correct 0 ms 1084 KB Output is correct
17 Correct 1 ms 1084 KB Output is correct
18 Correct 0 ms 1084 KB Output is correct
19 Correct 0 ms 1084 KB Output is correct
20 Correct 0 ms 1084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 2 ms 1084 KB Output is correct
4 Correct 2 ms 1084 KB Output is correct
5 Correct 4 ms 1084 KB Output is correct
6 Correct 5 ms 1084 KB Output is correct
7 Correct 3 ms 1084 KB Output is correct
8 Correct 3 ms 1084 KB Output is correct
9 Correct 2 ms 1084 KB Output is correct
10 Correct 6 ms 1084 KB Output is correct
11 Correct 7 ms 1084 KB Output is correct
12 Correct 0 ms 1084 KB Output is correct
13 Correct 5 ms 1084 KB Output is correct
14 Correct 8 ms 1084 KB Output is correct
15 Correct 8 ms 1084 KB Output is correct
16 Correct 10 ms 1084 KB Output is correct
17 Correct 4 ms 1084 KB Output is correct
18 Correct 8 ms 1084 KB Output is correct
19 Correct 4 ms 1084 KB Output is correct
20 Correct 2 ms 1084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 1084 KB Output is correct
2 Correct 37 ms 1084 KB Output is correct
3 Correct 17 ms 1084 KB Output is correct
4 Correct 20 ms 1084 KB Output is correct
5 Correct 40 ms 1084 KB Output is correct
6 Correct 19 ms 1084 KB Output is correct
7 Correct 46 ms 1084 KB Output is correct
8 Correct 26 ms 1084 KB Output is correct
9 Correct 53 ms 1084 KB Output is correct
10 Correct 49 ms 1084 KB Output is correct
11 Correct 32 ms 1084 KB Output is correct
12 Correct 34 ms 1084 KB Output is correct
13 Correct 85 ms 1084 KB Output is correct
14 Correct 88 ms 1084 KB Output is correct
15 Correct 39 ms 1084 KB Output is correct
16 Correct 105 ms 1084 KB Output is correct
17 Correct 111 ms 1084 KB Output is correct
18 Correct 36 ms 1084 KB Output is correct
19 Correct 84 ms 1084 KB Output is correct
20 Correct 37 ms 1084 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 171 ms 1084 KB Output is correct
2 Correct 173 ms 1084 KB Output is correct
3 Correct 178 ms 1084 KB Output is correct
4 Correct 186 ms 1084 KB Output is correct
5 Correct 225 ms 1084 KB Output is correct
6 Correct 214 ms 1084 KB Output is correct
7 Correct 202 ms 1084 KB Output is correct
8 Correct 206 ms 1084 KB Output is correct
9 Correct 265 ms 1084 KB Output is correct
10 Correct 188 ms 1084 KB Output is correct
11 Correct 428 ms 1084 KB Output is correct
12 Correct 382 ms 1084 KB Output is correct
13 Correct 306 ms 1084 KB Output is correct
14 Correct 407 ms 1084 KB Output is correct
15 Correct 426 ms 1084 KB Output is correct
16 Correct 505 ms 1084 KB Output is correct
17 Correct 509 ms 1084 KB Output is correct
18 Correct 357 ms 1084 KB Output is correct
19 Correct 388 ms 1084 KB Output is correct
20 Correct 364 ms 1084 KB Output is correct
21 Correct 1094 ms 1084 KB Output is correct
22 Correct 1114 ms 1084 KB Output is correct
23 Correct 729 ms 1084 KB Output is correct
24 Correct 864 ms 1084 KB Output is correct
25 Correct 854 ms 1084 KB Output is correct
26 Correct 474 ms 1084 KB Output is correct
27 Correct 505 ms 1084 KB Output is correct
28 Correct 504 ms 1084 KB Output is correct
29 Correct 491 ms 1084 KB Output is correct
30 Correct 495 ms 1084 KB Output is correct