oj.uz

답안 #753444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753444 2023-06-05T08:28:09 Z GrindMachine Vision Program (IOI19_vision) C++17
100 / 100
 28 ms 1740 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "vision.h"

const int LOG = 9;

void construct_network(int n, int m, int k) {
    // does row i contain guy?
    rep(i,n){
    	vector<int> v;
    	rep(j,m){
    		v.pb(i*m+j);
    	}

    	add_or(v);
    }

    // does col j contain guy?
    rep(j,m){
    	vector<int> v;
    	rep(i,n){
    		v.pb(i*m+j);
    	}

    	add_or(v);
    }

    int pos_0 = add_and({0, add_not(0)});
    int pos_1 = add_or({0, add_not(0)});

    auto add = [&](vector<int> sum, int b){
    	vector<int> res;
    	int carry = pos_0;

    	res.pb(add_xor({sum[0], b}));
    	carry = add_and({sum[0], b});

    	rep1(j,LOG-1){
    		res.pb(add_xor({sum[j], carry}));
    		carry = add_and({sum[j], carry});
    	}

    	return res;
    };

    vector<int> sum;
    rep(j,LOG) sum.pb(pos_0);

    int curr_xor = pos_0;
    vector<int> toadd;

    rep(i,n){
    	// sum += curr_xor
    	toadd.pb(curr_xor);
    	
    	// curr_xor ^= val[i]
    	curr_xor = add_xor({curr_xor, n*m+i});
    }

    // note: if curr_xor = 1 at the end, then we dont add anything to sum (because both black cells are in the same row)
    curr_xor = add_not(curr_xor);

    trav(val,toadd){
    	val = add_and({val,curr_xor});
    	sum = add(sum,val);
    }

    curr_xor = pos_0;
    toadd.clear();

    rep(j,m){
    	// sum += curr_xor
    	toadd.pb(curr_xor);
    	
    	// curr_xor ^= val[i]
    	curr_xor = add_xor({curr_xor, n*m+n+j});
    }

    // note: if curr_xor = 1 at the end, then we dont add anything to sum (because both black cells are in the same col)
    curr_xor = add_not(curr_xor);

    trav(val,toadd){
    	val = add_and({val,curr_xor});
    	sum = add(sum,val);
    }

    // check if sum = k
    int eq = pos_1;

    rep(bit,LOG){
    	int val = 0;
    	if(k & (1 << bit)){
    		val = pos_1;
    	}
    	else{
    		val = pos_0;
    	}

    	int xo = add_xor({sum[bit], val});
    	int curr_eq = add_not(xo);
    	eq = add_and({eq, curr_eq});
    }
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 212 KB Output is correct
12 Correct 1 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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 212 KB Output is correct
12 Correct 1 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 212 KB Output is correct
20 Correct 1 ms 212 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 340 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 212 KB Output is correct
12 Correct 1 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 212 KB Output is correct
20 Correct 1 ms 212 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 424 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 296 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 212 KB Output is correct
12 Correct 1 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 212 KB Output is correct
20 Correct 1 ms 212 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 424 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 296 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct
38 Correct 4 ms 852 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 5 ms 852 KB Output is correct
46 Correct 5 ms 940 KB Output is correct
47 Correct 5 ms 852 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 3 ms 680 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 3 ms 596 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 644 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 608 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 3 ms 600 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 3 ms 596 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 3 ms 596 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 3 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 8 ms 1180 KB Output is correct
21 Correct 7 ms 1140 KB Output is correct
22 Correct 7 ms 1164 KB Output is correct
23 Correct 8 ms 1104 KB Output is correct
24 Correct 8 ms 1172 KB Output is correct
25 Correct 7 ms 1104 KB Output is correct
26 Correct 10 ms 1172 KB Output is correct
27 Correct 12 ms 1740 KB Output is correct
28 Correct 13 ms 1740 KB Output is correct
29 Correct 16 ms 1716 KB Output is correct
30 Correct 13 ms 1644 KB Output is correct
31 Correct 12 ms 1696 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1624 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 7 ms 1104 KB Output is correct
8 Correct 12 ms 1104 KB Output is correct
9 Correct 12 ms 1664 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 312 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 212 KB Output is correct
8 Correct 1 ms 300 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 212 KB Output is correct
12 Correct 1 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 212 KB Output is correct
20 Correct 1 ms 212 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 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 300 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 424 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 296 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 428 KB Output is correct
38 Correct 4 ms 852 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 4 ms 852 KB Output is correct
44 Correct 4 ms 852 KB Output is correct
45 Correct 5 ms 852 KB Output is correct
46 Correct 5 ms 940 KB Output is correct
47 Correct 5 ms 852 KB Output is correct
48 Correct 3 ms 596 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 4 ms 596 KB Output is correct
51 Correct 3 ms 596 KB Output is correct
52 Correct 3 ms 596 KB Output is correct
53 Correct 3 ms 596 KB Output is correct
54 Correct 3 ms 596 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 3 ms 596 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 3 ms 680 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 2 ms 596 KB Output is correct
62 Correct 3 ms 596 KB Output is correct
63 Correct 3 ms 596 KB Output is correct
64 Correct 3 ms 596 KB Output is correct
65 Correct 3 ms 644 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 3 ms 596 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 596 KB Output is correct
73 Correct 2 ms 608 KB Output is correct
74 Correct 3 ms 596 KB Output is correct
75 Correct 3 ms 596 KB Output is correct
76 Correct 3 ms 600 KB Output is correct
77 Correct 4 ms 596 KB Output is correct
78 Correct 3 ms 596 KB Output is correct
79 Correct 3 ms 596 KB Output is correct
80 Correct 4 ms 596 KB Output is correct
81 Correct 3 ms 596 KB Output is correct
82 Correct 3 ms 596 KB Output is correct
83 Correct 3 ms 596 KB Output is correct
84 Correct 3 ms 596 KB Output is correct
85 Correct 2 ms 596 KB Output is correct
86 Correct 3 ms 596 KB Output is correct
87 Correct 3 ms 596 KB Output is correct
88 Correct 3 ms 596 KB Output is correct
89 Correct 8 ms 1180 KB Output is correct
90 Correct 7 ms 1140 KB Output is correct
91 Correct 7 ms 1164 KB Output is correct
92 Correct 8 ms 1104 KB Output is correct
93 Correct 8 ms 1172 KB Output is correct
94 Correct 7 ms 1104 KB Output is correct
95 Correct 10 ms 1172 KB Output is correct
96 Correct 12 ms 1740 KB Output is correct
97 Correct 13 ms 1740 KB Output is correct
98 Correct 16 ms 1716 KB Output is correct
99 Correct 13 ms 1644 KB Output is correct
100 Correct 12 ms 1696 KB Output is correct
101 Correct 1 ms 212 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 13 ms 1624 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 3 ms 596 KB Output is correct
106 Correct 3 ms 596 KB Output is correct
107 Correct 3 ms 596 KB Output is correct
108 Correct 3 ms 596 KB Output is correct
109 Correct 7 ms 1104 KB Output is correct
110 Correct 12 ms 1104 KB Output is correct
111 Correct 12 ms 1664 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 312 KB Output is correct
114 Correct 15 ms 1740 KB Output is correct
115 Correct 3 ms 680 KB Output is correct
116 Correct 3 ms 596 KB Output is correct
117 Correct 12 ms 1064 KB Output is correct
118 Correct 9 ms 1104 KB Output is correct
119 Correct 13 ms 1612 KB Output is correct
120 Correct 12 ms 1612 KB Output is correct
121 Correct 12 ms 1612 KB Output is correct
122 Correct 13 ms 1656 KB Output is correct
123 Correct 28 ms 1740 KB Output is correct
124 Correct 12 ms 1740 KB Output is correct
125 Correct 13 ms 1696 KB Output is correct
126 Correct 15 ms 1720 KB Output is correct
127 Correct 12 ms 1704 KB Output is correct
128 Correct 14 ms 1692 KB Output is correct