oj.uz

Submission #617904

# Submission time Handle Problem Language Result Execution time Memory
617904 2022-08-01T16:45:58 Z Minindu2006 Vision Program (IOI19_vision) C++14
8 / 100
 1 ms 304 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

// int h, w, k;
// void solve()
// {
// 	vector<int> allops;
// 	for (int i = 0; i < H; i++)
// 	{
// 		for (int j = 0; j < W; j++)
// 		{
// 			vector<int> kDis;
// 			for (int x = 0; x < H; x++)
// 			{
// 				for (int y = 0; y < W; y++)
// 				{
// 					if (abs(x - i) + abs(y - j) == K)
// 						kDis.push_back(x * W + y);
// 				}
// 			}
// 			allops.push_back(add_and({i * W + j, add_or(kDis)}));
// 		}
// 	}
// 	add_or(allops);
// }

// void solve6()
// {
// 	vector<int> kDis;
// 	for (int x = 0; x < h; x++)
// 	{
// 		for (int y = 0; y < w; y++)
// 		{
// 			if (abs(x - 0) + abs(y - 0) == k)
// 				kDis.push_back(x * w + y);
// 		}
// 	}qqq
// 	add_and({0, add_or(kDis)})
// }
void construct_network(int H, int W, int K)
{
	vector<int> kDis;
	for (int x = 0; x < H; x++)
	{
		for (int y = 0; y < W; y++)
		{
			if (abs(x - 0) + abs(y - 0) == K)
				kDis.push_back(x * W + y);
		}
	}
	add_and({0, add_or(kDis)});
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
8.0 / 8.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 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 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 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 296 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 300 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 304 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 1 ms 300 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 288 KB Output is correct

Subtask #7
0 / 14.0

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