oj.uz

답안 #147132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
147132 2019-08-27T22:16:44 Z Mamnoon_Siam Vision Program (IOI19_vision) C++17
32 / 100
 69 ms 7416 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

const int maxn = 202;

int H, W, K;
int one, zero;

int cell(int i, int j) {
	return i * W + j;
}

vector<int> binary_addition(vector<int> A, vector<int> B) {
	int carry = zero;
	vector<int> ret;
	int len = max(A.size(), B.size()) + 1;
	while(A.size() < len) A.emplace_back(zero);
	while(B.size() < len) B.emplace_back(zero);
	for(int i = 0; i < len - 1; i++) {
		ret.emplace_back(add_xor({carry, A[i], B[i]}));
		int ab = add_and({carry, A[i]});
		int bc = add_and({A[i], B[i]});
		int ca = add_and({carry, B[i]});
		carry = add_or({ab, bc, ca});
	} ret.emplace_back(carry);
	return ret;
}

void construct_network(int _H, int _W, int _K) {
	H = _H, W = _W, K = _K;
	if(H * W == 2) {
		one = 0;
		zero = add_not(one);
	} else {
		zero = add_and({0, 1, 2});
		one = add_not(zero);
	}
	vector<int> R_prefix, C_prefix;
	{
		vector<int> tmp;
		for(int i = 0; i < H - 1; i++) {
			for(int j = 0; j < W; j++) {
				tmp.emplace_back(cell(i, j));
			}
			assert(tmp.size());
			R_prefix.emplace_back(add_xor(tmp));
		}
		R_prefix.emplace_back(zero);
	}
	{
		vector<int> tmp;
		for(int j = 0; j < W - 1; j++) {
			for(int i = 0; i < H; i++) {
				tmp.emplace_back(cell(i, j));
			}
			assert(tmp.size());
			C_prefix.emplace_back(add_xor(tmp));
		}
		C_prefix.emplace_back(zero);
	}
	vector<int> R_sum;
	for(int i = 0; i < H; i++) {
		vector<int> tmp;
		int carry = R_prefix[i];
		for(int j = 0; j < R_sum.size(); j++) {
			tmp.emplace_back(add_xor({carry, R_sum[j]}));
			carry = add_and({carry, R_sum[j]});
		}
		if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
			tmp.emplace_back(carry);
		}
		R_sum = tmp;
	}
	vector<int> C_sum;
	for(int i = 0; i < W; i++) {
		vector<int> tmp;
		int carry = C_prefix[i];
		for(int j = 0; j < C_sum.size(); j++) {
			tmp.emplace_back(add_xor({carry, C_sum[j]}));
			carry = add_and({carry, C_sum[j]});
		}
		if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
			tmp.emplace_back(carry);
		}
		C_sum = tmp;
	}
	
	vector<int> tot = binary_addition(R_sum, C_sum);

	vector<int> allzero, allone;
	for(int i = 0; i < tot.size(); i++) {
		if(K & (1 << i)) {
			allzero.emplace_back(add_xor({one, tot[i]}));
		} else {
			allzero.emplace_back(add_xor({zero, tot[i]}));
		}
	}
	for(int i = 0; i < allzero.size(); i++) {
		allone.emplace_back(add_not(allzero[i]));
	}
	add_and(allone);
}

Compilation message

vision.cpp: In function 'std::vector<int> binary_addition(std::vector<int>, std::vector<int>)':
vision.cpp:18:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(A.size() < len) A.emplace_back(zero);
        ~~~~~~~~~^~~~~
vision.cpp:19:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(B.size() < len) B.emplace_back(zero);
        ~~~~~~~~~^~~~~
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < R_sum.size(); j++) {
                  ~~^~~~~~~~~~~~~~
vision.cpp:70:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:79:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < C_sum.size(); j++) {
                  ~~^~~~~~~~~~~~~~
vision.cpp:83:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
      ~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
vision.cpp:92:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < tot.size(); i++) {
                 ~~^~~~~~~~~~~~
vision.cpp:99:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < allzero.size(); i++) {
                 ~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 24 ms 2704 KB Output is correct
4 Correct 25 ms 2620 KB Output is correct
5 Correct 25 ms 2712 KB Output is correct
6 Correct 25 ms 2584 KB Output is correct
7 Correct 23 ms 2584 KB Output is correct
8 Correct 59 ms 6896 KB Output is correct
9 Correct 58 ms 6896 KB Output is correct
10 Correct 59 ms 6892 KB Output is correct
11 Correct 58 ms 6896 KB Output is correct
12 Correct 69 ms 6900 KB Output is correct
13 Incorrect 4 ms 1132 KB WA in grader: Too many instructions
14 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

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