oj.uz

Submission #906297

# Submission time Handle Problem Language Result Execution time Memory
906297 2024-01-14T00:02:00 Z vjudge1 Vision Program (IOI19_vision) C++17
59 / 100
 9 ms 1592 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int one,zero;

// vi add(vi src, int v){
// 	vi res;
// 	int cin = zero;
// 	rep(i,0,sz(src)){
// 		vi inp = {src[i], cin};
// 		if(v&(1<<i)) inp.pb(one);
// 		// cout<<"inps:";
// 		// for(int x: inp)cout<<' '<<x;
// 		// cout<<endl;

// 		res.pb(add_xor(inp));

// 		if(sz(inp)==3){
// 			vi outs = {add_and({inp[0],inp[1]}),add_and({inp[1],inp[2]}),add_and({inp[0],inp[2]})};
// 			cin=add_or(outs);
// 		}else{
// 			cin=add_and(inp);
// 		}
// 	}
// 	return res;
// }

// vi negate(vi src){
// 	vi res;
// 	rep(i,0,sz(src)) res.pb(add_not(src[i]));
// 	return add(res,1);
// }

vi add(vi a, vi b){
	vi res;
	int cin = zero;
	rep(i,0,max(sz(a),sz(b))){
		vi inp = {cin};
		if(i<sz(a)) inp.pb(a[i]);
		if(i<sz(b)) inp.pb(b[i]);

		res.pb(add_xor(inp));

		if(sz(inp)==3){
			vi outs = {add_and({inp[0],inp[1]}),add_and({inp[1],inp[2]}),add_and({inp[0],inp[2]})};
			cin=add_or(outs);
		}else{
			cin=add_and(inp);
		}
	}
	return res;
}

void construct_network(int H, int W, int K) {

	// setup
	vi allcells;
	rep(i,0,H)rep(j,0,W)allcells.pb(i*W+j);
	one = add_or(allcells);
	zero = add_not(one);

	// vi inds= add({one,zero,one,zero},{one,one});
	// cout<<"at:";for(int x : inds) cout<<' '<<x;
	// cout<<endl;

	// return;

	vi counter(10,zero);

	int active = zero;
	rep(i,0,H){
		vi onrow;
		rep(j,0,W) onrow.pb(i*W+j);
		active = add_xor({active, add_xor(onrow)});
		// cout<<"active row "<<i<<": "<<active<<endl;
		counter = add(counter,{active});
	}

	active = zero;
	rep(j,0,W){
		vi oncol;
		rep(i,0,H) oncol.pb(i*W+j);
		active = add_xor({active, add_xor(oncol)});
		// cout<<"active col "<<j<<": "<<active<<endl;
		counter = add(counter,{active});
	}

	// cout<<"result:";
	// for(int x : counter) cout<<' '<<x;
	// cout<<endl;
	rep(i,0,sz(counter)){
		if(K&(1<<i)){
			counter[i]=add_not(counter[i]);
		}
	}

	add_not(add_or(counter));
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 548 KB Output is correct
27 Correct 1 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 548 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 548 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 5 ms 984 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 3 ms 696 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 5 ms 984 KB Output is correct
44 Correct 5 ms 984 KB Output is correct
45 Correct 5 ms 984 KB Output is correct
46 Correct 5 ms 1076 KB Output is correct
47 Correct 5 ms 984 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 728 KB Output is correct
2 Correct 3 ms 728 KB Output is correct
3 Correct 3 ms 728 KB Output is correct
4 Correct 3 ms 728 KB Output is correct
5 Correct 3 ms 728 KB Output is correct
6 Correct 3 ms 728 KB Output is correct
7 Correct 3 ms 728 KB Output is correct
8 Correct 3 ms 728 KB Output is correct
9 Correct 3 ms 728 KB Output is correct
10 Correct 3 ms 728 KB Output is correct
11 Correct 3 ms 728 KB Output is correct
12 Correct 3 ms 728 KB Output is correct
13 Correct 3 ms 728 KB Output is correct
14 Correct 3 ms 728 KB Output is correct
15 Correct 3 ms 728 KB Output is correct
16 Correct 3 ms 728 KB Output is correct
17 Correct 3 ms 728 KB Output is correct
18 Correct 3 ms 728 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 728 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 2 ms 684 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 5 ms 812 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 3 ms 728 KB Output is correct
14 Correct 3 ms 816 KB Output is correct
15 Correct 3 ms 728 KB Output is correct
16 Correct 3 ms 816 KB Output is correct
17 Correct 3 ms 880 KB Output is correct
18 Correct 3 ms 728 KB Output is correct
19 Correct 4 ms 728 KB Output is correct
20 Correct 9 ms 1416 KB Output is correct
21 Correct 9 ms 1416 KB Output is correct
22 Correct 9 ms 1416 KB Output is correct
23 Correct 9 ms 1416 KB Output is correct
24 Correct 9 ms 1416 KB Output is correct
25 Correct 9 ms 1416 KB Output is correct
26 Correct 9 ms 1512 KB Output is correct
27 Incorrect 2 ms 1592 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 2 ms 1592 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 500 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 548 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 2 ms 348 KB Output is correct
35 Correct 2 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 5 ms 984 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 3 ms 696 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 5 ms 984 KB Output is correct
44 Correct 5 ms 984 KB Output is correct
45 Correct 5 ms 984 KB Output is correct
46 Correct 5 ms 1076 KB Output is correct
47 Correct 5 ms 984 KB Output is correct
48 Correct 3 ms 728 KB Output is correct
49 Correct 3 ms 728 KB Output is correct
50 Correct 3 ms 728 KB Output is correct
51 Correct 3 ms 728 KB Output is correct
52 Correct 3 ms 728 KB Output is correct
53 Correct 3 ms 728 KB Output is correct
54 Correct 3 ms 728 KB Output is correct
55 Correct 3 ms 728 KB Output is correct
56 Correct 3 ms 728 KB Output is correct
57 Correct 3 ms 728 KB Output is correct
58 Correct 3 ms 728 KB Output is correct
59 Correct 3 ms 728 KB Output is correct
60 Correct 3 ms 728 KB Output is correct
61 Correct 3 ms 728 KB Output is correct
62 Correct 3 ms 728 KB Output is correct
63 Correct 3 ms 728 KB Output is correct
64 Correct 3 ms 728 KB Output is correct
65 Correct 3 ms 728 KB Output is correct
66 Correct 3 ms 724 KB Output is correct
67 Correct 3 ms 728 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 2 ms 684 KB Output is correct
74 Correct 3 ms 604 KB Output is correct
75 Correct 3 ms 604 KB Output is correct
76 Correct 3 ms 604 KB Output is correct
77 Correct 5 ms 812 KB Output is correct
78 Correct 4 ms 860 KB Output is correct
79 Correct 4 ms 860 KB Output is correct
80 Correct 4 ms 860 KB Output is correct
81 Correct 4 ms 860 KB Output is correct
82 Correct 3 ms 728 KB Output is correct
83 Correct 3 ms 816 KB Output is correct
84 Correct 3 ms 728 KB Output is correct
85 Correct 3 ms 816 KB Output is correct
86 Correct 3 ms 880 KB Output is correct
87 Correct 3 ms 728 KB Output is correct
88 Correct 4 ms 728 KB Output is correct
89 Correct 9 ms 1416 KB Output is correct
90 Correct 9 ms 1416 KB Output is correct
91 Correct 9 ms 1416 KB Output is correct
92 Correct 9 ms 1416 KB Output is correct
93 Correct 9 ms 1416 KB Output is correct
94 Correct 9 ms 1416 KB Output is correct
95 Correct 9 ms 1512 KB Output is correct
96 Incorrect 2 ms 1592 KB WA in grader: Too many instructions
97 Halted 0 ms 0 KB -