oj.uz

Submission #146558

# Submission time Handle Problem Language Result Execution time Memory
146558 2019-08-24T11:49:54 Z Sorting Vision Program (IOI19_vision) C++14
0 / 100
 16 ms 1756 KB 
#include "vision.h"
#include <bits/stdc++.h>

using namespace std;

int add_not(int N);
int add_and(vector<int> Ns);
int add_or(vector<int> Ns);
int add_xor(vector<int> Ns);

vector<int> mv(int a, int b = -1, int c = -1){
	vector<int> v;

	v.push_back(a);
	if(b != -1){
		v.push_back(b);
	}
	if(c != -1){
		v.push_back(c);
	}

	return v;
}

vector<int> num;

void add(int x){
	for(int i = 0; i < (int)num.size(); ++i){
		int pr = num[i];

		num[i] = add_xor(mv(num[i], x));
		x = add_and(mv(pr, x));
	}
}

void construct_network(int H, int W, int K) {
	vector<int> row, col;
	int zero = add_and(mv(add_not(0), 0));

	for(int i = 0; i < H; ++i){
		vector<int> v;
		for(int j = 0; j < W; ++j){
			v.push_back(i * W + j);
		}

		row.push_back(add_or(v));
	}

	for(int j = 0; j < W; ++j){
		vector<int> v;
		for(int i = 0; i < H; ++i){
			v.push_back(i * W + j);
		}

		col.push_back(add_or(v));
	}

	for(int i = 0; i < 10; ++i){
		num.push_back(zero);
	}

	int curr = zero;
	for(int i = 0; i < H; ++i){
		curr = add_xor(mv(curr, row[i]));
		add(curr);
	}
	curr = zero;
	for(int i = 0; i < W; ++i){
		curr = add_xor(mv(curr, col[i]));
		add(curr);
	}

	vector<int> t;
	for(int i = 0; i < 10; ++i){
		if(K & (1 << i)){
			t.push_back(add_not(num[i]));
		}
		else{
			t.push_back(num[i]);
		}
	}

	int ans = add_not(add_or(t));
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:83:6: warning: unused variable 'ans' [-Wunused-variable]
  int ans = add_not(add_or(t));
      ^~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 760 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 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

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 1756 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -