oj.uz

답안 #155457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155457 2019-09-28T12:20:53 Z wilwxk Vision Program (IOI19_vision) C++14
14 / 100
 12 ms 1144 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

const int MAXN=203;
int h, w, x;
int linha[MAXN], coluna[MAXN];
int final, final2;

void construct_network(int H, int W, int K) {
	// std::vector<int> Ns;
	// Ns = {0, 1};
	// int a = add_and(Ns);
	// Ns = {0, a};
	// int b = add_or(Ns);
	// Ns = {0, 1, b};
	// int c = add_xor(Ns);
	// add_not(c);

	h=H; w=W; x=K;

	//or
	for(int i=0; i<h; i++) {
		vector<int> aux;
		for(int j=0; j<w; j++) {
			int cur=i*w+j;
			aux.push_back(cur);
		}
		linha[i]=add_or(aux);
	}
	for(int j=0; j<w; j++) {
		vector<int> aux;
		for(int i=0; i<h; i++) {
			int cur=i*w+j;
			aux.push_back(cur);
		}
		coluna[j]=add_or(aux);
	}

	//pair
	vector<int> pares;
	for(int i=1; i<h; i++) pares.push_back(add_and({linha[i-1], linha[i]}));
	for(int i=1; i<w; i++) pares.push_back(add_and({coluna[i-1], coluna[i]}));
	final=add_or(pares);

	//xor
	vector<int> paridade;
	for(int i=0; i<h; i++) paridade.push_back(linha[i]);
	for(int i=0; i<w; i++) paridade.push_back(coluna[i]);
	final2=add_xor(paridade);
	
	add_and({final, final2});
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1144 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 6 ms 760 KB Output is correct
8 Correct 12 ms 764 KB Output is correct
9 Correct 11 ms 1144 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct

Subtask #8
0 / 19.0

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