oj.uz

Submission #719749

# Submission time Handle Problem Language Result Execution time Memory
719749 2023-04-06T15:33:40 Z baojiaopisu Vision Program (IOI19_vision) C++14
59 / 100
 15 ms 2128 KB 
#include "vision.h"
#include <vector>
#include <iostream>
using namespace std;
#define pb push_back
const int N = 500 + 10;
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

int id[N][N], row[N], col[N], drow[N], dcol[N], not_dist_col[N], not_dist_row[N];
int dist_col[N], dist_row[N];

void construct_network(int n, int m, int k) {
	int iter = -1;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			id[i][j] = ++iter;
		}
	}

	for(int i = 0; i < n; i++) {
		vector<int> q;
		for(int j = 0; j < m; j++) q.pb(id[i][j]);
		row[i] = ++iter;
		add_or(q);
	}

	int d = max(n, m);
	for(int i = 1; i <= d; i++) {
		int cnt = 0;
		int ii = 2, x = i;
		while(x > 1) {
			if(x % ii == 0) {
				++cnt;
				while(x % ii == 0) x /= ii;
			}
			++ii;
		}
		if(cnt > 1 || i >= n) continue;
		vector<int> t;
		for(int j = 0; j < i; j++) {
			vector<int> q;
			for(int x = j; x < n; x += i) q.pb(row[x]);
			t.pb(++iter);
			add_xor(q);
		}

		++iter;
		add_or(t);
		drow[i] = ++iter;
		add_not(iter - 1);
	}

	for(int i = n - 1; i >= 0; i--) {
		int x = i;
		vector<int> q;
		int ii = 2;
		if(i) q.pb(drow[1]);
		while(x > 1) {
			int curr = 1;
			if(x % ii == 0) {
				while(x % ii == 0) x /= ii, curr *= ii;
			}
			q.pb(drow[curr]);
			++ii;
		}

		for(int j = i + 1; j < n; j++) q.pb(not_dist_row[j]);
		if(n == 1) q.pb(row[0]);
		dist_row[i] = ++iter;
		add_and(q);
		not_dist_row[i] = ++iter;
		add_not(iter - 1);
	}

	for(int i = 0; i < m; i++) {
		vector<int> q;
		for(int j = 0; j < n; j++) q.pb(id[j][i]);
		col[i] = ++iter;
		add_or(q);
	}

	for(int i = 1; i <= d; i++) {
		int cnt = 0;
		int ii = 2, x = i;
		while(x > 1) {
			if(x % ii == 0) {
				++cnt;
				while(x % ii == 0) x /= ii;
			}
			++ii;
		}
		if(cnt > 1 || i >= m) continue;
		vector<int> t;
		for(int j = 0; j < i; j++) {
			vector<int> q;
			for(int x = j; x < m; x += i) q.pb(col[x]);
			t.pb(++iter);
			add_xor(q);
		}

		++iter;
		add_or(t);
		dcol[i] = ++iter;
		add_not(iter - 1);
	}

	for(int i = m - 1; i >= 0; i--) {
		int x = i;
		vector<int> q;
		int ii = 2;
		if(i) q.pb(dcol[1]);
		while(x > 1) {
			int curr = 1;
			if(x % ii == 0) {
				while(x % ii == 0) x /= ii, curr *= ii;
			}
			q.pb(dcol[curr]);
			++ii;
		}

		for(int j = i + 1; j < m; j++) q.pb(not_dist_col[j]);
		if(m == 1) q.pb(col[0]);
		dist_col[i] = ++iter;
		add_and(q);
		not_dist_col[i] = ++iter;
		add_not(iter - 1);
	}

	vector<int> q;
	for(int i = 0; i <= k; i++) {
		if(i > n - 1) break;
		if(k - i > m - 1) continue;
		++iter;
		add_and({dist_row[i], dist_col[k - i]});
		q.pb(iter);
	}

	add_or(q);
}

Subtask #1
10.0 / 10.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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 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 308 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct

Subtask #2
11.0 / 11.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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 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 308 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 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 308 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 436 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct

Subtask #4
15.0 / 15.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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 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 308 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 436 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 2 ms 440 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 4 ms 852 KB Output is correct
42 Correct 4 ms 828 KB Output is correct
43 Correct 6 ms 1108 KB Output is correct
44 Correct 6 ms 1108 KB Output is correct
45 Correct 7 ms 1108 KB Output is correct
46 Correct 6 ms 1108 KB Output is correct
47 Correct 6 ms 1108 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 976 KB Output is correct
2 Correct 6 ms 976 KB Output is correct
3 Correct 8 ms 976 KB Output is correct
4 Correct 7 ms 976 KB Output is correct
5 Correct 7 ms 1360 KB Output is correct
6 Correct 8 ms 1416 KB Output is correct
7 Correct 8 ms 1452 KB Output is correct
8 Correct 8 ms 1360 KB Output is correct
9 Correct 7 ms 976 KB Output is correct
10 Correct 7 ms 1072 KB Output is correct
11 Correct 6 ms 976 KB Output is correct
12 Correct 7 ms 976 KB Output is correct
13 Correct 8 ms 1072 KB Output is correct
14 Correct 7 ms 1104 KB Output is correct
15 Correct 11 ms 1360 KB Output is correct
16 Correct 7 ms 1360 KB Output is correct
17 Correct 8 ms 1452 KB Output is correct
18 Correct 7 ms 1380 KB Output is correct
19 Correct 7 ms 1488 KB Output is correct
20 Correct 8 ms 1360 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 304 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 1 ms 308 KB Output is correct
3 Correct 4 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 3 ms 852 KB Output is correct
6 Correct 3 ms 852 KB Output is correct
7 Correct 4 ms 816 KB Output is correct
8 Correct 6 ms 852 KB Output is correct
9 Correct 5 ms 948 KB Output is correct
10 Correct 6 ms 948 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 6 ms 852 KB Output is correct
13 Correct 7 ms 944 KB Output is correct
14 Correct 8 ms 976 KB Output is correct
15 Correct 7 ms 940 KB Output is correct
16 Correct 7 ms 948 KB Output is correct
17 Correct 6 ms 1400 KB Output is correct
18 Correct 7 ms 1360 KB Output is correct
19 Correct 8 ms 1340 KB Output is correct
20 Correct 12 ms 2028 KB Output is correct
21 Correct 12 ms 2128 KB Output is correct
22 Correct 13 ms 2128 KB Output is correct
23 Correct 12 ms 2128 KB Output is correct
24 Correct 14 ms 1832 KB Output is correct
25 Correct 15 ms 1920 KB Output is correct
26 Correct 15 ms 1840 KB Output is correct
27 Incorrect 3 ms 1872 KB WA in grader: Too many instructions
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1872 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.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 1 ms 212 KB Output is correct
5 Correct 1 ms 312 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 308 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 304 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 2 ms 436 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 6 ms 1108 KB Output is correct
39 Correct 2 ms 440 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 4 ms 852 KB Output is correct
42 Correct 4 ms 828 KB Output is correct
43 Correct 6 ms 1108 KB Output is correct
44 Correct 6 ms 1108 KB Output is correct
45 Correct 7 ms 1108 KB Output is correct
46 Correct 6 ms 1108 KB Output is correct
47 Correct 6 ms 1108 KB Output is correct
48 Correct 7 ms 976 KB Output is correct
49 Correct 6 ms 976 KB Output is correct
50 Correct 8 ms 976 KB Output is correct
51 Correct 7 ms 976 KB Output is correct
52 Correct 7 ms 1360 KB Output is correct
53 Correct 8 ms 1416 KB Output is correct
54 Correct 8 ms 1452 KB Output is correct
55 Correct 8 ms 1360 KB Output is correct
56 Correct 7 ms 976 KB Output is correct
57 Correct 7 ms 1072 KB Output is correct
58 Correct 6 ms 976 KB Output is correct
59 Correct 7 ms 976 KB Output is correct
60 Correct 8 ms 1072 KB Output is correct
61 Correct 7 ms 1104 KB Output is correct
62 Correct 11 ms 1360 KB Output is correct
63 Correct 7 ms 1360 KB Output is correct
64 Correct 8 ms 1452 KB Output is correct
65 Correct 7 ms 1380 KB Output is correct
66 Correct 7 ms 1488 KB Output is correct
67 Correct 8 ms 1360 KB Output is correct
68 Correct 1 ms 212 KB Output is correct
69 Correct 1 ms 304 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 308 KB Output is correct
72 Correct 4 ms 852 KB Output is correct
73 Correct 4 ms 852 KB Output is correct
74 Correct 3 ms 852 KB Output is correct
75 Correct 3 ms 852 KB Output is correct
76 Correct 4 ms 816 KB Output is correct
77 Correct 6 ms 852 KB Output is correct
78 Correct 5 ms 948 KB Output is correct
79 Correct 6 ms 948 KB Output is correct
80 Correct 5 ms 852 KB Output is correct
81 Correct 6 ms 852 KB Output is correct
82 Correct 7 ms 944 KB Output is correct
83 Correct 8 ms 976 KB Output is correct
84 Correct 7 ms 940 KB Output is correct
85 Correct 7 ms 948 KB Output is correct
86 Correct 6 ms 1400 KB Output is correct
87 Correct 7 ms 1360 KB Output is correct
88 Correct 8 ms 1340 KB Output is correct
89 Correct 12 ms 2028 KB Output is correct
90 Correct 12 ms 2128 KB Output is correct
91 Correct 13 ms 2128 KB Output is correct
92 Correct 12 ms 2128 KB Output is correct
93 Correct 14 ms 1832 KB Output is correct
94 Correct 15 ms 1920 KB Output is correct
95 Correct 15 ms 1840 KB Output is correct
96 Incorrect 3 ms 1872 KB WA in grader: Too many instructions
97 Halted 0 ms 0 KB -