oj.uz

답안 #621008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
621008 2022-08-03T11:02:48 Z beaconmc Vision Program (IOI19_vision) C++14
0 / 100
 95 ms 7168 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,0,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;


	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));
			else if (j[0] == i-k || j[0] == i+k) sec.push_back(unhashh(j));
		}
		if (!(fir.size() && sec.size())){
			fx.push_back(add_and({0,1,2}));
			continue;
		}

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

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

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

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

			fy.push_back(add_and({0,1,2}));
			continue;
		}

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


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

	for (auto&i : x){
		vector<int> fir,sec;
		for (auto&j : stuff){
			if (j[0] == i) fir.push_back(unhashh(j));
			else if (j[0] < i-k || j[0] > i+k) sec.push_back(unhashh(j));
		}
		if (!(fir.size() && sec.size())){
			sx.push_back(add_and({0,1,2}));
			continue;
		}
		sx.push_back(add_and({add_xor(fir),add_xor(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,3,1);
// 	for (auto&i : arr) cout << i << " ";
// }

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
18 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
18 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
18 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
18 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1076 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 4 ms 596 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 11 ms 980 KB Output is correct
6 Correct 7 ms 724 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 11 ms 980 KB Output is correct
10 Correct 7 ms 784 KB Output is correct
11 Correct 4 ms 596 KB Output is correct
12 Correct 5 ms 596 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 11 ms 1104 KB Output is correct
16 Correct 7 ms 724 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
22 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 95 ms 7168 KB Output is correct
4 Correct 53 ms 4520 KB Output is correct
5 Correct 24 ms 1992 KB Output is correct
6 Correct 7 ms 852 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Incorrect 40 ms 4584 KB WA in grader: Too many inputs
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 65 ms 6736 KB WA in grader: Too many inputs
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Incorrect 0 ms 212 KB on inputs (0, 0), (0, 1), expected 1, but computed 0
18 Halted 0 ms 0 KB -