oj.uz

Submission #620819

# Submission time Handle Problem Language Result Execution time Memory
620819 2022-08-03T09:30:42 Z beaconmc Vision Program (IOI19_vision) C++14
12 / 100
 93 ms 7288 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];
}


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

	set<ll> x;
	set<ll> y;


	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]);
	}
	vector<int> fx, fy, sx, sy;

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

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

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

	vector<int> ffx, ffy, ssx, ssy;
	while (fx.size()){
		ll temp1,temp2;
		temp1 = fx[fx.size()-1];
		temp2 = fx[fx.size()-2];
		ffx.push_back(add_and({temp1, temp2}));
		fx.pop_back();
		fx.pop_back();
	}
	while (fy.size()){
		ll temp1,temp2;
		temp1 = fy[fy.size()-1];
		temp2 = fy[fy.size()-2];
		ffy.push_back(add_not(add_and({temp1, temp2})));
		fy.pop_back();
		fy.pop_back();
	}
	while (sx.size()){
		ll temp1,temp2;
		temp1 = sx[sx.size()-1];
		temp2 = sx[sx.size()-2];
		ssx.push_back(add_not(add_and({temp1, temp2})));
		sx.pop_back();
		sx.pop_back();
	}
	while (sy.size()){
		ll temp1,temp2;
		temp1 = sy[sy.size()-1];
		temp2 = sy[sy.size()-2];
		ssy.push_back(add_and({temp1, temp2}));
		sy.pop_back();
		sy.pop_back();
	}

	ll a,b,c,d;
	a = add_or(ffx);
	b = add_or(ffy);
	c = add_or(ssx);
	d = add_or(ssy);

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

}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 296 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 296 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 296 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 296 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1108 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 4 ms 724 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 11 ms 1108 KB Output is correct
6 Correct 9 ms 844 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 11 ms 1108 KB Output is correct
10 Correct 7 ms 852 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 2 ms 556 KB Output is correct
15 Correct 12 ms 1160 KB Output is correct
16 Correct 8 ms 852 KB Output is correct
17 Correct 5 ms 724 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 2 ms 552 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 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 212 KB Output is correct
3 Correct 93 ms 7288 KB Output is correct
4 Correct 53 ms 4460 KB Output is correct
5 Correct 23 ms 2076 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 4 ms 596 KB Output is correct
8 Incorrect 43 ms 4644 KB WA in grader: Too many inputs
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 6980 KB WA in grader: Too many inputs
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 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 0 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Incorrect 1 ms 296 KB on inputs (0, 2), (1, 0), expected 0, but computed 1
8 Halted 0 ms 0 KB -