oj.uz

Submission #843231

# Submission time Handle Problem Language Result Execution time Memory
843231 2023-09-03T19:55:59 Z Dat160601 Vision Program (IOI19_vision) C++17
0 / 100
 9 ms 1168 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int N = 207;

vector <int> sv;
int r[N], c[N];
pair <int, int> ar, ac, case1, case2, case3, tmp, tp;

void construct_network(int H, int W, int K) {
	if(H * W == 2){
		if(K == 1) add_not(0);
		else{
			sv.pb(1);
			add_and(sv);
		}
		return;
	}
	for(int i = 0; i < H; i++){
		sv.clear();
		for(int j = 0; j < W; j++){
			sv.pb(i * H + j);
		}
		r[i] = add_and(sv);
	}
	for(int i = 0; i < W; i++){
		sv.clear();
		for(int j = 0; j < H; j++){
			sv.pb(j * H + i);
		}
		c[i] = add_and(sv);
	}
	sv.clear();
	for(int i = 0; i < H; i++){
		sv.pb(H * W + i);
	}
	ar = mp(add_xor(sv), H * W + H + W);
	sv.clear();
	for(int i = 0; i < W; i++){
		sv.pb(H * W + H + i);
	}
	ac = mp(add_xor(sv), H * W + H + W + 1);
	int now = H * W + H + W + 2;
	tmp = mp(add_not(ar.se), now++);
	int st = now;
	for(int i = 0; i + K - 1 < W; i++){
		sv.clear();
		sv.pb(H * W + H + i);
		sv.pb(H * W + H + i + K - 1);
		add_and(sv);
		now++;
	}
	if(now == st) tp = mp(add_not(tmp.se), now++);
	else{
		sv.clear();
		for(int i = st; i < now; i++){
			sv.pb(i);
		}
		tp = mp(add_or(sv), now++);
	}
	sv.clear();
	sv.pb(tmp.se), sv.pb(tp.se), sv.pb(ac.se);
	case1 = mp(add_and(sv), now++);
	tmp = mp(add_not(ac.se), now++);
	st = now;
	for(int i = 0; i + K - 1 < H; i++){
		sv.clear();
		sv.pb(H * W + i);
		sv.pb(H * W + i + K - 1);
		add_and(sv);
		now++;
	}
	if(now == st) tp = mp(add_not(tmp.se), now++);
	else{
		sv.clear();
		for(int i = st; i < now; i++){
			sv.pb(i);
		}
		tp = mp(add_or(sv), now++);
	}
	sv.clear();
	sv.pb(tmp.se), sv.pb(tp.se), sv.pb(ac.se);
	case1 = mp(add_and(sv), now++);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 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 0 ms 348 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 0 ms 348 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 0 ms 348 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 1 ms 348 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 0 ms 348 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 9 ms 1168 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 0 ms 348 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
2 Halted 0 ms 0 KB -