Submission #821586

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
821586	2023-08-11T11:52:06 Z	prvocislo	Vision Program (IOI19_vision)	C++17	44 / 100	17 ms	4444 KB

vision

#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

int h, w;
int withdist(int x, int y, int k) // mame aspon jeden ktory ma vzdialenost najviac k od policka x
{
	vector<int> v;
	for (int xi = 0; xi < h; xi++) for (int yi = 0; yi < w; yi++) if (abs(x - xi) + abs(y - yi) <= k) v.push_back(xi * w + yi);
	return add_or(v);
}
int more(int k) // je to aspon k
{
	vector<int> a; // tie andy tych regionov
	for (int i = 0; i + k <= h + w - 2; i++)
	{
		vector<int> o1 = { withdist(0, 0, i), withdist(h - 1, w - 1, h - 1 + w - 1 - (i + k)) };
		a.push_back(add_and(o1));

		vector<int> o2 = { withdist(0, w - 1, i), withdist(h - 1, 0, h - 1 + w - 1 - (i + k)) };
		a.push_back(add_and(o2));
	}
	return add_or(a);
}
void construct_network(int H, int W, int k)
{
	h = H, w = W;
	if (k >= h + w - 2) more(k);
	else add_xor({ more(k), more(k + 1) });
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct

Subtask #2
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 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	1 ms	212 KB	Output is correct
20	Correct	0 ms	304 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct

Subtask #3
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 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	1 ms	212 KB	Output is correct
20	Correct	0 ms	304 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	9 ms	1200 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	6 ms	852 KB	Output is correct
33	Correct	17 ms	1980 KB	Output is correct
34	Correct	9 ms	1192 KB	Output is correct
35	Correct	4 ms	596 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct

Subtask #4
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 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	1 ms	212 KB	Output is correct
20	Correct	0 ms	304 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	9 ms	1200 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	6 ms	852 KB	Output is correct
33	Correct	17 ms	1980 KB	Output is correct
34	Correct	9 ms	1192 KB	Output is correct
35	Correct	4 ms	596 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Incorrect	6 ms	4308 KB	WA in grader: Too many inputs
39	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	1580 KB	Output is correct
2	Correct	4 ms	596 KB	Output is correct
3	Correct	4 ms	568 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	14 ms	1620 KB	Output is correct
6	Correct	7 ms	816 KB	Output is correct
7	Correct	2 ms	468 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	13 ms	1620 KB	Output is correct
10	Correct	8 ms	1064 KB	Output is correct
11	Correct	4 ms	680 KB	Output is correct
12	Correct	4 ms	560 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	15 ms	1596 KB	Output is correct
16	Correct	8 ms	980 KB	Output is correct
17	Correct	4 ms	596 KB	Output is correct
18	Correct	4 ms	596 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct

Subtask #6
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	296 KB	Output is correct
3	Incorrect	6 ms	4308 KB	WA in grader: Too many inputs
4	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	5 ms	4444 KB	WA in grader: Too many inputs
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	308 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	296 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 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	1 ms	304 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 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	1 ms	212 KB	Output is correct
20	Correct	0 ms	304 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	300 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	304 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	9 ms	1200 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	6 ms	852 KB	Output is correct
33	Correct	17 ms	1980 KB	Output is correct
34	Correct	9 ms	1192 KB	Output is correct
35	Correct	4 ms	596 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Incorrect	6 ms	4308 KB	WA in grader: Too many inputs
39	Halted	0 ms	0 KB	-

Submission #821586

Compilation message