oj.uz

답안 #198765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
198765 2020-01-27T14:29:20 Z Akashi Vision Program (IOI19_vision) C++14
44 / 100
 21 ms 3136 KB 
#include <bits/stdc++.h>
#include "vision.h"
 
using namespace std;
 
bool viz[205][205];
int wh[205][205];
int Last, H, W, K;
void do_it(int i, int j){
	if(viz[i][j]) return ;
	vector <int> v;
	viz[i][j] = 1;

	for(int x = -K; x <= K ; ++x){
		int y = K - abs(x);
		int l = i + x, c = j + y; 

		if(l >= 0 && c >= 0 && l < H && c < W){
			if(!viz[l][c]) v.push_back(l * W + c);
		}
		
		y = -y;
		l = i + x, c = j + y; 

		if(l >= 0 && c >= 0 && l < H && c < W){
			if(!viz[l][c]) v.push_back(l * W + c);
		}
	}

	if(v.size() == 0) return ;
	wh[i][j] = add_or(v);
	Last = wh[i][j];
}
 
void construct_network(int n, int m, int k) {
	H = n; W = m; K = k;
	
	int mi = H / 2, mj = W / 2;
	for(int d = 0; d <= max(H, W) ; ++d){
		for(int i = max(0, mi - d); i <= max(H - 1, mi + d) ; ++i){
			if(mj - d >= 0) do_it(i, mj - d);
			if(mj + d < W) do_it(i, mj + d);
		}
		
		for(int j = max(0, mj - d); j <= max(W - 1, mj + d) ; ++j){
			if(mi - d >= 0) do_it(mi - d, j);
			if(mi + d < H) do_it(mi + d, j);
		}
	}
	
	int st = Last + 1, dr = 0;
	for(int i = 0; i < H ; ++i){
		for(int j = 0; j < W ; ++j){
			if(wh[i][j]){
				vector <int> v;
				v.push_back(i * W + j);
				v.push_back(wh[i][j]);
				dr = add_and(v);
			}
		}
	}
	

	vector <int> v;
	for(int i = st; i <= dr ; ++i) v.push_back(i);
	add_or(v);
 
	return ;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 504 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 5 ms 256 KB Output is correct

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 504 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 5 ms 256 KB Output is correct
38 Incorrect 21 ms 3136 KB WA in grader: Too many instructions
39 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 11 ms 504 KB Output is correct
3 Correct 9 ms 376 KB Output is correct
4 Correct 13 ms 504 KB Output is correct
5 Correct 6 ms 632 KB Output is correct
6 Correct 10 ms 760 KB Output is correct
7 Correct 15 ms 504 KB Output is correct
8 Correct 15 ms 504 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 9 ms 632 KB Output is correct
11 Correct 10 ms 504 KB Output is correct
12 Correct 10 ms 504 KB Output is correct
13 Correct 12 ms 504 KB Output is correct
14 Correct 13 ms 504 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 9 ms 760 KB Output is correct
17 Correct 11 ms 632 KB Output is correct
18 Correct 10 ms 632 KB Output is correct
19 Correct 13 ms 504 KB Output is correct
20 Correct 17 ms 504 KB Output is correct
21 Correct 5 ms 256 KB Output is correct
22 Correct 6 ms 256 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 9 ms 884 KB Output is correct
4 Correct 18 ms 1524 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 11 ms 632 KB Output is correct
7 Correct 8 ms 376 KB Output is correct
8 Incorrect 8 ms 1140 KB WA in grader: Too many instructions
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 9 ms 1140 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 256 KB Output is correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 256 KB Output is correct
23 Correct 6 ms 376 KB Output is correct
24 Correct 6 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 376 KB Output is correct
28 Correct 8 ms 632 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 6 ms 376 KB Output is correct
33 Correct 6 ms 504 KB Output is correct
34 Correct 8 ms 504 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 6 ms 376 KB Output is correct
37 Correct 5 ms 256 KB Output is correct
38 Incorrect 21 ms 3136 KB WA in grader: Too many instructions
39 Halted 0 ms 0 KB -