답안 #590428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590428	2022-07-05T23:36:33 Z	farhan132	Vision Program (IOI19_vision)	C++17	12 / 100	179 ms	2460 KB

vision

#include "vision.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef pair<ll , ll> ii;
 
#define ff first
#define ss second
#define pb push_back
#define in insert

ii num(ll m, ll x){
	return {x/m, x%m};
}
ll N,M;
ll convo(ll x, ll y){
	return x * (M) + y;
}
#define mem(a , b) memset(a, b ,sizeof(a))


mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
bool check[204][204];

void construct_network(int H, int W, int K) {
	N = H, M = W;
	ll n = H * W - 1;
	
	vector < ll > a(n, 0);
	mem(check, 0);
	ll tmp1 = K; ll mod = 2;
	while(tmp1%2 == 0) tmp1/=2, mod *= 2;
	vector < ll > cnt(mod, 0);
	vector < ll > good(mod, 0);
	for(ll i = 0; i < H; i++){
		for(ll j = 0; j < W; j++){
			cnt[(i + j)%(mod)]++;
		}
	}
	for(ll i = 0; i < mod; i++){
		if(cnt[i] <= cnt[(i + K)%(mod)]) good[i] = 1, good[(i + K)%(mod)] = 0;
	}
	//ll tot = 0;
	vector < ll > v;
	vector < ii > tmp;
	for(ll i = 0; i < H; i++){

		for(ll j = 0; j < W; j++){
			if(good[(i + j)%(mod)] == 0) continue;
			check[i][j] = 1;
			vector < ll > can;
			for(ll x = 0; x < H; x++){
				for(ll y = 0; y < W; y++){
					if((abs(x - i) + abs(y - j)) != K || check[x][y]) continue;
					can.pb(convo(x, y));
					//cout << i << ' ' << j << ' ' << x << " " << y << '\n';
				}
			}
			if(can.size()){
				ll k = add_or(can);
				v.pb(add_and({k, convo(i, j)}));
			}
		}
	}

	add_or(v);

}
// 1,2,5,6

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	308 KB	Output is correct
6	Incorrect	0 ms	340 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #2
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	308 KB	Output is correct
6	Incorrect	0 ms	340 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	308 KB	Output is correct
6	Incorrect	0 ms	340 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #4
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	308 KB	Output is correct
6	Incorrect	0 ms	340 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

Subtask #5
12.0 / 12.0

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

Subtask #6
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	10 ms	584 KB	Output is correct
4	Correct	13 ms	1108 KB	Output is correct
5	Correct	8 ms	792 KB	Output is correct
6	Correct	7 ms	468 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	20 ms	848 KB	Output is correct
9	Correct	42 ms	2460 KB	Output is correct
10	Correct	30 ms	1700 KB	Output is correct
11	Correct	21 ms	816 KB	Output is correct
12	Correct	19 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Incorrect	97 ms	1172 KB	WA in grader: Too many instructions
21	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

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

Subtask #8
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	308 KB	Output is correct
6	Incorrect	0 ms	340 KB	on inputs (0, 1), (1, 0), expected 1, but computed 0
7	Halted	0 ms	0 KB	-

답안 #590428

Compilation message