제출 #297599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297599		_7_7_	Vision Program (IOI19_vision)	C++14	44 / 100	12 ms	3192 KiB

vision

#include "vision.h"
#include <bits/stdc++.h>                                           
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;  
typedef unsigned long long ull;         
typedef vector < pii > vpii;                                   	
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 2e5 + 48, mod = 998244353, N = 212;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

int h, w, k, a[N][N], b[N][N];
vi tmp;


bool in (int x, int y) {
	return x >= 0 && y >= 0 && x < h && y < w;
}

void construct_network(int H, int W, int K) {
	h = H, w = W, k = K;
	for (int i = 0; i < h; ++i)
		for (int j = 0; j < w; ++j) {
			tmp.clear();
			int x = min(h - 1, i + k);
			int y = i + j + k - x;
			while (in(x, y) && x != i) {
				tmp.pb(x*w + y);
				--x, ++y;
			}

			x = max(0, i - k);
			y = x + j + k - i;

			while (in(x, y)) {
				tmp.pb(x*w + y);
				if (x == i)
					break;
				++x, ++y;
			}

			if (sz(tmp))
				a[i][j] = add_or(tmp);
		}

	tmp.clear();
	for (int i = 0; i < h; ++i)
		for (int j = 0; j < w; ++j)
			if (a[i][j]) {
				tmp.clear();
				tmp.pb(i*w + j);
				tmp.pb(a[i][j]);
				b[i][j] = add_and(tmp);
			}


	tmp.clear();
	for (int i = 0; i < h; ++i)
		for (int j = 0; j < w; ++j)
			if (a[i][j])
				tmp.pb(b[i][j]);
	
	add_or(tmp);
}
                    	

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 11 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19