oj.uz

답안 #293800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
293800 2020-09-08T12:16:57 Z PeppaPig Vision Program (IOI19_vision) C++14
34 / 100
 59 ms 5364 KB 
#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

int n, m, k;
vector<int> Aor, Axor, Bor, Bxor;

int get(int i, int j) { return m * i + j; }

int add_and(int a, int b) { return add_and({a, b}); }

int add_and_not(int a, int b) { return add_and(a, add_not(b)); }

void gen_diag(vector<int> &ovec, vector<int> &xvec, bool flip) {
	for(int sum = 0; sum < n + m - 1; sum++) {
		vector<int> now;
		for(int i = 0; i < n; i++) {
			int j = flip ? m - sum + i - 1 : sum - i;
			if(j < 0 || j > m - 1) continue;
			now.emplace_back(get(i, j));
		}
		ovec.emplace_back(add_or(now));
		xvec.emplace_back(add_xor(now));
	}		
}

int count(vector<int> &ovec, vector<int> &xvec, int dist) {
	vector<int> lo, lx, ret;

	++dist;
	for(int i = 0; i < (int)ovec.size(); i++) {
		lo.emplace_back(ovec[i]), lx.emplace_back(xvec[i]);
		if((int)lo.size() > dist)
			lo.erase(lo.begin()), lx.erase(lx.begin());

		if((int)lo.size() == dist)
			ret.emplace_back(add_and_not(add_or(lo), add_xor(lx)));
	}
	return add_or(ret);
}

void construct_network(int _n, int _m, int _k) {
	n = _n, m = _m, k = _k;

	gen_diag(Aor, Axor, false);
	gen_diag(Bor, Bxor, true);
	
	add_and_not(add_and(count(Aor, Axor, k), count(Bor, Bxor, k)),
		add_and(count(Aor, Axor, k - 1), count(Aor, Axor, k - 1)));
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

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

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 4 ms 640 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 6 ms 800 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 10 ms 1152 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 9 ms 1024 KB Output is correct
12 Correct 4 ms 544 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 9 ms 1024 KB Output is correct
15 Correct 9 ms 1152 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 640 KB Output is correct
18 Correct 11 ms 1152 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 14 ms 1532 KB Output is correct
21 Correct 29 ms 2932 KB Output is correct
22 Correct 28 ms 2808 KB Output is correct
23 Correct 13 ms 1152 KB Output is correct
24 Correct 13 ms 1532 KB Output is correct
25 Correct 31 ms 3064 KB Output is correct
26 Correct 11 ms 1152 KB Output is correct
27 Correct 24 ms 2428 KB Output is correct
28 Correct 53 ms 4724 KB Output is correct
29 Correct 59 ms 5364 KB Output is correct
30 Correct 52 ms 4472 KB Output is correct
31 Correct 21 ms 2040 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 2520 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 5 ms 768 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 13 ms 1532 KB Output is correct
8 Correct 13 ms 1532 KB Output is correct
9 Correct 24 ms 2428 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Incorrect 0 ms 256 KB on inputs (0, 1), (1, 0), expected 1, but computed 0
7 Halted 0 ms 0 KB -