oj.uz

답안 #201607

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201607 2020-02-11T12:09:02 Z khulegub Vision Program (IOI19_vision) C++14
0 / 100
 20 ms 1776 KB 
#include "vision.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define rr first
#define cc second

using namespace std;

typedef pair<int, int> pii;

int hh, ww, kk;

pii to_pair(int x){
	return mp(x / ww, x % ww);
}
int to_linear(pii x){
	return x.rr * ww + x.cc; 
}

void construct_network(int H, int W, int K) {

	// proj y
	hh = H, ww = W, kk = K;
	int carry;

	int one = add_or( {0, 1} ), zero = add_not(one);

	vector<int> proj_y;

	for (int i = 0; i < ww; i++){
		vector<int> send;
		for (int j = 0; j < hh; j++){
			send.pb(to_linear(mp(i, j)));
		}
		proj_y.pb(add_xor(send));
	}

	carry = zero;

	for (int i = 0; i < ww; i++){
		carry = add_xor({carry, proj_y[i]});
		proj_y[i] = carry;
	}

	vector<int> proj_x;

	for (int i = 0; i < hh; i++){
		vector<int> send;
		for (int j = 0; j < ww; j++){
			send.pb(to_linear(mp(j, i)));
		}
		proj_x.pb(add_xor(send));
	}

	carry = zero;

	for (int i = 0; i < hh; i++){
		carry = add_xor({carry, proj_x[i]});
		proj_x[i] = carry;
	}

	// // max val = h + w
	// // log_2 (400) + 1 = 9

	int bitlen = 10;

	vector<int> counter;

	for (int i = 0; i < bitlen; i++){
		counter.pb(add_and({zero, 0}));
	}


	for (int j = 0; j < ww; j++){
		

		int adder = proj_y[j];

		for (int i = 0; i < bitlen; i++){
			int tmp = counter[i];
			counter[i] = add_xor({counter[i], adder});
			adder = add_and({tmp, adder});
		}

	}
	for (int j = 0; j < hh; j++){
		

		int adder = proj_x[j];

		for (int i = 0; i < bitlen; i++){
			int tmp = counter[i];
			counter[i] = add_xor({counter[i], adder});
			adder = add_and({tmp, adder});
		}
	}

	kk = kk + 2;
	int last = one;
	vector<int> kkbits;

	for (int i = 0; i < bitlen; i++){
		kkbits.pb((kk & 1) ? (1) : (0));
		kk >>= 1;
	}

	for (int i = bitlen - 1; i >= 0; i--){
		if (kkbits[i]){
			last = add_and({last, counter[i]});
		}
		else{
			last = add_and({last, add_not(counter[i]) });
		}
	}
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 376 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 20 ms 1776 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 256 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -