oj.uz

Submission #622443

# Submission time Handle Problem Language Result Execution time Memory
622443 2022-08-04T09:38:12 Z TimDee Vision Program (IOI19_vision) C++17
0 / 100
 1 ms 212 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

void _p7(int h, int w) {

	for (int i=0; i<h; ++i) {
		for (int j=0; j<w; ++j) {

		}
	}

}

void _p3(int h, int w, int k) {

	vector<int> use;
	for (int i=0; i<h; ++i) {
		for (int j=0; j<w; ++j) {
			//if (i+k>=h && j+k>=w) continue;
			vector<int> xored;
			for (int x=0; x<=k; ++x) {
				int y=k-x;
				if (j+y<w && i+x<h) xored.push_back((i+x)*w+j+y);
				if (j-y>=0 && i+x<h) xored.push_back((i+x)*w+j-y);
			}
			if (!xored.size()) continue;
			int xorpos=add_xor(xored);
			int andpos=add_and({i*w+j,xorpos});
			use.push_back(andpos);
		}
	}
	add_or(use);

}

void construct_network(int h, int w, int k) {

	if (max(h,w)<=30) {
		_p3(h,w,k);
		return;
	}
	if (min(h,w)==1) {
		vector<int> use;
		for (int i=0; i+k<h*w; ++i) {
			int pos=add_and({i,i+k});
			use.push_back(pos);
		}
		add_or(use);
		return;
	}
	vector<int> use;
	for (int x=0; x<=k; ++x) use.push_back(x*w+k-x);
	add_xor(use);

}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
23 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 0 ms 212 KB on inputs (0, 0), (1, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -