oj.uz

Submission #621065

# Submission time Handle Problem Language Result Execution time Memory
621065 2022-08-03T11:41:00 Z beaconmc Vision Program (IOI19_vision) C++14
8 / 100
 46 ms 4700 KB 
#include "vision.h"

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

typedef int ll;
using namespace std;
using namespace __gnu_pbds;

#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
ll h,w,k;

vector<int> hashh(vector<int> a){
	return {a[0]+a[1], a[1]-a[0]};
}

int unhashh(vector<int> a){
	vector<int> temp =  {(a[0]-a[1])/2, (a[0]+a[1])/2};

	return w*temp[0]+temp[1];
}

// vector<int> arr = {1,1};

// int add_and(vector<int> a){
// 	FOR(i,0,a.size()){
// 		a[i] = arr[a[i]];
// 	}
// 	FOR(i,1,a.size()){
// 		a[0] &= a[i];
// 	}
// 	arr.push_back(a[0]);
// 	return arr.size()-1;
// }
// int add_xor(vector<int> a){
// 	FOR(i,0,a.size()){
// 		a[i] = arr[a[i]];
// 	}

// 	FOR(i,1,a.size()){
// 		a[0] ^= a[i];
// 	}
// 	arr.push_back(a[0]);
// 	return arr.size()-1;
// }
// int add_or(vector<int> a){
// 	FOR(i,0,a.size()){
// 		a[i] = arr[a[i]];
// 	}
// 	FOR(i,1,a.size()){
// 		a[0] |= a[i];
// 	}
// 	arr.push_back(a[0]);
// 	return arr.size()-1;
// }
// int add_not(int a){
// 	if(arr[a]) arr.push_back(0);
// 	else arr.push_back(1);
// 	return arr.size()-1;
// }



void construct_network(int H, int W, int K) {
	h=H; w=W; k=K;

	set<ll> x;
	set<ll> y;
	unordered_map<ll, vector<ll>> xs;
	unordered_map<ll, vector<ll>> ys;
	unordered_map<ll, ll> xx;
	unordered_map<ll, ll> yy;


	vector<vector<ll>> stuff;
	FOR(i,0,h){
		FOR(j,0,w){
			stuff.push_back(hashh({i,j}));
		}
	}

	for (auto&i : stuff){
		x.insert(i[0]);
		y.insert(i[1]);
		xs[i[0]].push_back(unhashh(i));
		ys[i[1]].push_back(unhashh(i));
	}
	for (auto&i : xs){
		xx[i.first] = add_xor(i.second);
	}
	for (auto&i : ys){
		yy[i.first] = add_xor(i.second);
	}

	vector<int> fx, fy, sx, sy;

	for (auto&i : x){

		vector<int> fir,sec;
		for (auto&j : y){
			if (j == i) fir.push_back(yy[j]);
			else if (j == i-k || j == i+k) sec.push_back(yy[j]);
		}
		if (!(fir.size() && sec.size())){
			fx.push_back(add_xor({0,0}));
			continue;
		}

		fx.push_back(add_and({add_or(fir),add_or(sec)}));

	}
	for (auto&i : y){
		vector<int> fir,sec;
		for (auto&j : x){

			if (j == i) fir.push_back(xx[j]);
			else if (j < i-k || j > i+k) sec.push_back(xx[j]);
		}

		if (!(fir.size() && sec.size())){

			fy.push_back(add_xor({0,0}));
			continue;
		}

		fy.push_back(add_and({add_or(fir),add_or(sec)}));
	}


	for (auto&i : y){
		vector<int> fir,sec;
		for (auto&j : x){
			if (j == i) fir.push_back(xx[j]);
			else if (j == i-k || j == i+k) sec.push_back(xx[j]);
		}
		if (!(fir.size() && sec.size())){
			sy.push_back(add_xor({0,0}));
			continue;
		}
		sy.push_back(add_and({add_or(fir),add_or(sec)}));
	}

	for (auto&i : x){
		vector<int> fir,sec;
		for (auto&j : y){
			if (j == i) fir.push_back(yy[j]);
			else if (j < i-k || j > i+k) sec.push_back(yy[j]);
		}
		if (!(fir.size() && sec.size())){
			sx.push_back(add_xor({0,0}));
			continue;
		}
		sx.push_back(add_and({add_or(fir),add_or(sec)}));
	}


	ll a,b,c,d;
	a = add_or(fx);
	b = add_not(add_or(fy));
	c = add_or(sy);
	d = add_not(add_or(sx));


	ll aa = add_and({a,b});
	ll bb = add_and({c,d});

	add_or({aa,bb});

}

// int main(){
// 	construct_network(1,2, 1);
// 	for (auto&i : arr) cout << i << " ";
// }

Subtask #1
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 Incorrect 0 ms 212 KB on inputs (1, 0), (2, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #2
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 Incorrect 0 ms 212 KB on inputs (1, 0), (2, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #3
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 Incorrect 0 ms 212 KB on inputs (1, 0), (2, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 0 ms 212 KB on inputs (1, 0), (2, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1108 KB Output is correct
2 Correct 5 ms 724 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Incorrect 3 ms 468 KB on inputs (1, 0), (3, 0), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.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 4 ms 724 KB Output is correct
4 Correct 6 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 2 ms 596 KB Output is correct
8 Correct 9 ms 1352 KB Output is correct
9 Correct 8 ms 1096 KB Output is correct
10 Correct 6 ms 1016 KB Output is correct
11 Correct 5 ms 852 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 11 ms 1096 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 3 ms 596 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 3 ms 468 KB Output is correct
19 Correct 3 ms 468 KB Output is correct
20 Correct 20 ms 2384 KB Output is correct
21 Correct 16 ms 2108 KB Output is correct
22 Correct 15 ms 2008 KB Output is correct
23 Correct 13 ms 1932 KB Output is correct
24 Correct 24 ms 2944 KB Output is correct
25 Correct 16 ms 2188 KB Output is correct
26 Correct 12 ms 1932 KB Output is correct
27 Correct 46 ms 4700 KB Output is correct
28 Correct 34 ms 4028 KB Output is correct
29 Correct 29 ms 3720 KB Output is correct
30 Correct 28 ms 3664 KB Output is correct
31 Correct 28 ms 3508 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 4676 KB on inputs (103, 46), (135, 15), expected 0, but computed 1
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 Incorrect 0 ms 212 KB on inputs (1, 0), (2, 0), expected 1, but computed 0
4 Halted 0 ms 0 KB -