oj.uz

Submission #519

# Submission time Handle Problem Language Result Execution time Memory
519 2013-02-28T07:54:28 Z tncks0121 지도 색칠하기 (GA3_map) C++
30 / 120
 1500 ms 916 KB 
typedef long long ll;

ll NumberOfMaps (int N, int M, int *A, int *B){
    int i, j, k; ll ret = 0;

	for(i = 0; i < M; i++) A[i] = 1 << (A[i] - 1);
	for(i = 0; i < M; i++) B[i] = 1 << (B[i] - 1);

	for (i = 0; i < (1 << N); i++){
		for(j = 0; j < (1 << N); j++){
			for(k = 0; k < M; k++){
				int uc = 0, vc = 0;
				if(i & A[k]) uc |= 2; if(j & A[k]) uc |= 1;
				if(i & B[k]) vc |= 2; if(j & B[k]) vc |= 1;
				if(uc == vc) break;
			}
			if(k >= M) ++ret;
		}
	}

	return ret;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 916 KB Output is correct
2 Correct 0 ms 916 KB Output is correct
3 Correct 0 ms 916 KB Output is correct
4 Correct 0 ms 916 KB Output is correct
5 Correct 1 ms 916 KB Output is correct
6 Correct 1 ms 916 KB Output is correct
7 Correct 1 ms 916 KB Output is correct
8 Correct 0 ms 916 KB Output is correct
9 Correct 1 ms 916 KB Output is correct
10 Correct 1 ms 916 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 916 KB Output is correct
2 Correct 26 ms 916 KB Output is correct
3 Correct 35 ms 916 KB Output is correct
4 Correct 69 ms 916 KB Output is correct
5 Correct 21 ms 916 KB Output is correct
6 Correct 23 ms 916 KB Output is correct
7 Correct 20 ms 916 KB Output is correct
8 Correct 95 ms 916 KB Output is correct
9 Correct 25 ms 916 KB Output is correct
10 Correct 91 ms 916 KB Output is correct
11 Correct 21 ms 916 KB Output is correct
12 Correct 88 ms 916 KB Output is correct
13 Correct 27 ms 916 KB Output is correct
14 Correct 98 ms 916 KB Output is correct
15 Correct 21 ms 916 KB Output is correct
16 Correct 90 ms 916 KB Output is correct
17 Correct 95 ms 916 KB Output is correct
18 Correct 92 ms 916 KB Output is correct
19 Correct 86 ms 916 KB Output is correct
20 Correct 85 ms 916 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 916 KB Output is correct
2 Correct 356 ms 916 KB Output is correct
3 Correct 603 ms 916 KB Output is correct
4 Correct 1172 ms 916 KB Output is correct
5 Execution timed out 1500 ms 0 KB Program timed out
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -
11 Halted 0 ms 0 KB -
12 Halted 0 ms 0 KB -
13 Halted 0 ms 0 KB -
14 Halted 0 ms 0 KB -
15 Halted 0 ms 0 KB -
16 Halted 0 ms 0 KB -
17 Halted 0 ms 0 KB -
18 Halted 0 ms 0 KB -
19 Halted 0 ms 0 KB -
20 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1500 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -
11 Halted 0 ms 0 KB -
12 Halted 0 ms 0 KB -
13 Halted 0 ms 0 KB -
14 Halted 0 ms 0 KB -
15 Halted 0 ms 0 KB -
16 Halted 0 ms 0 KB -
17 Halted 0 ms 0 KB -
18 Halted 0 ms 0 KB -
19 Halted 0 ms 0 KB -
20 Halted 0 ms 0 KB -

Subtask #5
0.0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1500 ms 0 KB Program timed out
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -
4 Halted 0 ms 0 KB -
5 Halted 0 ms 0 KB -
6 Halted 0 ms 0 KB -
7 Halted 0 ms 0 KB -
8 Halted 0 ms 0 KB -
9 Halted 0 ms 0 KB -
10 Halted 0 ms 0 KB -
11 Halted 0 ms 0 KB -
12 Halted 0 ms 0 KB -
13 Halted 0 ms 0 KB -
14 Halted 0 ms 0 KB -
15 Halted 0 ms 0 KB -
16 Halted 0 ms 0 KB -
17 Halted 0 ms 0 KB -
18 Halted 0 ms 0 KB -
19 Halted 0 ms 0 KB -
20 Halted 0 ms 0 KB -
21 Halted 0 ms 0 KB -
22 Halted 0 ms 0 KB -
23 Halted 0 ms 0 KB -
24 Halted 0 ms 0 KB -
25 Halted 0 ms 0 KB -
26 Halted 0 ms 0 KB -
27 Halted 0 ms 0 KB -
28 Halted 0 ms 0 KB -
29 Halted 0 ms 0 KB -
30 Halted 0 ms 0 KB -