oj.uz

Submission #381105

# Submission time Handle Problem Language Result Execution time Memory
381105 2021-03-24T13:48:06 Z AmineWeslati Vision Program (IOI19_vision) C++14
100 / 100
 149 ms 8168 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}

/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

#ifndef LOCAL
#include "vision.h"
#endif

#define OR add_or
#define AND add_and
#define XOR add_xor
#define NOT add_not

int N,M;
unordered_map<int,int>one[2],two[2];

int dist(int x, int y, int xx, int yy){
	return abs(x-xx)+abs(y-yy);
}
int f(int x, int y){
	return x*M+y;
}

#ifdef LOCAL
int add_or(vi v){return 1;}
int add_xor(vi v){return 1;}
int add_and(vi v){return 1;}
int add_not(int x){return 1;}
#endif

int check_right(int K){
	vi global;
	FOR(i,0,N+M) if(i+K-1<=N+M-2){
		vi vec,vec2;
		FOR(j,i,i+K) 
			vec.pb(one[0][j]),vec2.pb(two[0][j]);
		/*int x=XOR(vi{OR(vec),XOR(vec)}),y=OR(vec2);
		global.pb(OR(vi{x,y}));*/
		int x=XOR(vi{OR(vec),XOR(vec)}); 
		vec2.pb(x);
		global.pb(OR(vec2));
	}
	return OR(global);
}

int check_left(int K){
	vi global;
	FOR(i,-(M-1),N) if(i+K-1<=N-1){
		vi vec,vec2;
		FOR(j,i,i+K) 
			vec.pb(one[1][j]),vec2.pb(two[1][j]);
		/*int x=XOR(vi{OR(vec),XOR(vec)}),y=OR(vec2);
		global.pb(OR(vi{x,y}));*/
		int x=XOR(vi{OR(vec),XOR(vec)}); 
		vec2.pb(x);
		global.pb(OR(vec2));
	}
	return OR(global);
}

int check(int k){
	return AND(vi{check_right(k),check_left(k)});
}

void construct_network(int H, int W, int K){
	N=H; M=W;

	FOR(i,0,N+M){
		vi vec;
		FOR(x,0,N) FOR(y,0,M) if(x+y==i) vec.pb(f(x,y));
		if(!sz(vec)) continue;

		one[0][i]=OR(vec);
		two[0][i]=XOR(vi{OR(vec),XOR(vec)});
	}
	FOR(i,-(N+M),N+M){
		vi vec;
		FOR(x,0,N) FOR(y,0,M) if(x-y==i) vec.pb(f(x,y));
		if(!sz(vec)) continue;

		one[1][i]=OR(vec);
		two[1][i]=XOR(vi{OR(vec),XOR(vec)});
	}

	int ans=AND(vi{check(K+1),NOT(check(K))});
}

#ifdef LOCAL
int main() {
    boost; IO();
    

    return 0;
}
#endif
//Change your approach

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:136:6: warning: unused variable 'ans' [-Wunused-variable]
  136 |  int ans=AND(vi{check(K+1),NOT(check(K))});
      |      ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 492 KB Output is correct
36 Correct 3 ms 492 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 29 ms 2096 KB Output is correct
39 Correct 5 ms 640 KB Output is correct
40 Correct 4 ms 620 KB Output is correct
41 Correct 9 ms 876 KB Output is correct
42 Correct 7 ms 748 KB Output is correct
43 Correct 15 ms 1276 KB Output is correct
44 Correct 26 ms 2028 KB Output is correct
45 Correct 28 ms 2284 KB Output is correct
46 Correct 25 ms 1900 KB Output is correct
47 Correct 14 ms 1004 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 748 KB Output is correct
2 Correct 17 ms 1644 KB Output is correct
3 Correct 16 ms 1644 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 15 ms 1516 KB Output is correct
7 Correct 14 ms 1388 KB Output is correct
8 Correct 3 ms 492 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 14 ms 1388 KB Output is correct
11 Correct 16 ms 1644 KB Output is correct
12 Correct 16 ms 1644 KB Output is correct
13 Correct 13 ms 1408 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 4 ms 748 KB Output is correct
16 Correct 14 ms 1388 KB Output is correct
17 Correct 17 ms 1644 KB Output is correct
18 Correct 18 ms 1644 KB Output is correct
19 Correct 13 ms 1260 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 12 ms 1132 KB Output is correct
5 Correct 11 ms 1132 KB Output is correct
6 Correct 9 ms 1004 KB Output is correct
7 Correct 5 ms 620 KB Output is correct
8 Correct 10 ms 1000 KB Output is correct
9 Correct 18 ms 1604 KB Output is correct
10 Correct 20 ms 1772 KB Output is correct
11 Correct 17 ms 1516 KB Output is correct
12 Correct 8 ms 748 KB Output is correct
13 Correct 4 ms 748 KB Output is correct
14 Correct 15 ms 1516 KB Output is correct
15 Correct 14 ms 1388 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 4 ms 748 KB Output is correct
18 Correct 16 ms 1644 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 34 ms 2024 KB Output is correct
21 Correct 61 ms 4200 KB Output is correct
22 Correct 60 ms 4204 KB Output is correct
23 Correct 32 ms 1772 KB Output is correct
24 Correct 33 ms 2024 KB Output is correct
25 Correct 65 ms 4480 KB Output is correct
26 Correct 41 ms 1772 KB Output is correct
27 Correct 73 ms 3428 KB Output is correct
28 Correct 112 ms 6888 KB Output is correct
29 Correct 126 ms 7912 KB Output is correct
30 Correct 120 ms 6632 KB Output is correct
31 Correct 67 ms 3052 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 3428 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 6 ms 748 KB Output is correct
4 Correct 10 ms 1000 KB Output is correct
5 Correct 4 ms 748 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 34 ms 2024 KB Output is correct
8 Correct 32 ms 2024 KB Output is correct
9 Correct 70 ms 3428 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #8
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 3 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 2 ms 364 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 492 KB Output is correct
36 Correct 3 ms 492 KB Output is correct
37 Correct 2 ms 364 KB Output is correct
38 Correct 29 ms 2096 KB Output is correct
39 Correct 5 ms 640 KB Output is correct
40 Correct 4 ms 620 KB Output is correct
41 Correct 9 ms 876 KB Output is correct
42 Correct 7 ms 748 KB Output is correct
43 Correct 15 ms 1276 KB Output is correct
44 Correct 26 ms 2028 KB Output is correct
45 Correct 28 ms 2284 KB Output is correct
46 Correct 25 ms 1900 KB Output is correct
47 Correct 14 ms 1004 KB Output is correct
48 Correct 4 ms 748 KB Output is correct
49 Correct 17 ms 1644 KB Output is correct
50 Correct 16 ms 1644 KB Output is correct
51 Correct 2 ms 492 KB Output is correct
52 Correct 4 ms 748 KB Output is correct
53 Correct 15 ms 1516 KB Output is correct
54 Correct 14 ms 1388 KB Output is correct
55 Correct 3 ms 492 KB Output is correct
56 Correct 4 ms 748 KB Output is correct
57 Correct 14 ms 1388 KB Output is correct
58 Correct 16 ms 1644 KB Output is correct
59 Correct 16 ms 1644 KB Output is correct
60 Correct 13 ms 1408 KB Output is correct
61 Correct 2 ms 492 KB Output is correct
62 Correct 4 ms 748 KB Output is correct
63 Correct 14 ms 1388 KB Output is correct
64 Correct 17 ms 1644 KB Output is correct
65 Correct 18 ms 1644 KB Output is correct
66 Correct 13 ms 1260 KB Output is correct
67 Correct 4 ms 492 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 6 ms 748 KB Output is correct
73 Correct 12 ms 1132 KB Output is correct
74 Correct 11 ms 1132 KB Output is correct
75 Correct 9 ms 1004 KB Output is correct
76 Correct 5 ms 620 KB Output is correct
77 Correct 10 ms 1000 KB Output is correct
78 Correct 18 ms 1604 KB Output is correct
79 Correct 20 ms 1772 KB Output is correct
80 Correct 17 ms 1516 KB Output is correct
81 Correct 8 ms 748 KB Output is correct
82 Correct 4 ms 748 KB Output is correct
83 Correct 15 ms 1516 KB Output is correct
84 Correct 14 ms 1388 KB Output is correct
85 Correct 2 ms 492 KB Output is correct
86 Correct 4 ms 748 KB Output is correct
87 Correct 16 ms 1644 KB Output is correct
88 Correct 2 ms 492 KB Output is correct
89 Correct 34 ms 2024 KB Output is correct
90 Correct 61 ms 4200 KB Output is correct
91 Correct 60 ms 4204 KB Output is correct
92 Correct 32 ms 1772 KB Output is correct
93 Correct 33 ms 2024 KB Output is correct
94 Correct 65 ms 4480 KB Output is correct
95 Correct 41 ms 1772 KB Output is correct
96 Correct 73 ms 3428 KB Output is correct
97 Correct 112 ms 6888 KB Output is correct
98 Correct 126 ms 7912 KB Output is correct
99 Correct 120 ms 6632 KB Output is correct
100 Correct 67 ms 3052 KB Output is correct
101 Correct 1 ms 364 KB Output is correct
102 Correct 1 ms 364 KB Output is correct
103 Correct 75 ms 3428 KB Output is correct
104 Correct 1 ms 364 KB Output is correct
105 Correct 6 ms 748 KB Output is correct
106 Correct 10 ms 1000 KB Output is correct
107 Correct 4 ms 748 KB Output is correct
108 Correct 4 ms 748 KB Output is correct
109 Correct 34 ms 2024 KB Output is correct
110 Correct 32 ms 2024 KB Output is correct
111 Correct 70 ms 3428 KB Output is correct
112 Correct 1 ms 364 KB Output is correct
113 Correct 1 ms 364 KB Output is correct
114 Correct 112 ms 6888 KB Output is correct
115 Correct 2 ms 492 KB Output is correct
116 Correct 4 ms 748 KB Output is correct
117 Correct 48 ms 3140 KB Output is correct
118 Correct 50 ms 3432 KB Output is correct
119 Correct 127 ms 7912 KB Output is correct
120 Correct 125 ms 7800 KB Output is correct
121 Correct 149 ms 8168 KB Output is correct
122 Correct 130 ms 7912 KB Output is correct
123 Correct 71 ms 3428 KB Output is correct
124 Correct 114 ms 6888 KB Output is correct
125 Correct 126 ms 7932 KB Output is correct
126 Correct 130 ms 7912 KB Output is correct
127 Correct 110 ms 6632 KB Output is correct
128 Correct 68 ms 3052 KB Output is correct