oj.uz

Submission #201621

# Submission time Handle Problem Language Result Execution time Memory
201621 2020-02-11T12:42:06 Z khulegub Vision Program (IOI19_vision) C++14
0 / 100
 39 ms 2668 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 one = add_or( {0, add_not(0)} ), zero = add_not(one);

	vector<int> proj_hor;
	vector<int> proj_ver;

	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_hor.pb(add_or(send));
	}
	for (int i = 0; i < ww; i++){
		vector<int> send_pre, send_suf;
		for (int j = 0; j <= i; j++){
			send_pre.pb(proj_hor[j]);
		}
		for (int j = i; j < ww; j++){
			send_suf.pb(proj_hor[j]);
		}
		proj_hor[i] = add_and({add_or(send_pre), add_or(send_suf)});
	}
	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_ver.pb(add_or(send));
	}

	for (int i = 0; i < hh; i++){
		vector<int> send_pre, send_suf;
		for (int j = 0; j <= i; j++){
			send_pre.pb(proj_ver[j]);
		}
		for (int j = i; j < hh; j++){
			send_suf.pb(proj_ver[j]);
		}
		proj_ver[i] = add_and({add_or(send_pre), add_or(send_suf)});
	}

	int bitlen = 10;

	vector<int> counter;

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

	for (int j = 0; j < ww; j++){
		int adder = proj_hor[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_ver[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 % 2);
		kk /= 2;
	}

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

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 376 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 5 ms 376 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 5 ms 376 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 5 ms 376 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 376 KB WA in grader: Invalid index
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Incorrect 9 ms 760 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 2668 KB Output is correct
2 Correct 5 ms 360 KB Output is correct
3 Incorrect 9 ms 760 KB on inputs (96, 18), (96, 19), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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