제출 #1020916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1020916		pawned	Vision Program (IOI19_vision)	C++17	8 / 100	1 ms	348 KiB

vision

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

#include "vision.h"

int H, W, K;

ii conv(int x) {
	return {x / W, x % W};
}

int dist(int x, int y) {
	ii r1 = conv(x);
	ii r2 = conv(y);
	int res = abs(r1.fi - r2.fi) + abs(r1.se - r2.se);
	return res;
}

void construct_network(int h, int w, int k) {
	H = h; W = w; K = k;
/*	vi Ns;
	Ns = {0, 5};
	int a = add_and(Ns);
	Ns = {2, 3};
	int b = add_and(Ns);
	Ns = {6, 7};
	add_or(Ns);*/
	int ctr = 0;
	for (int i = 0; i < 1; i++) {
		for (int j = i + 1; j < H * W; j++) {
			if (dist(i, j) == K) {
				add_and({i, j});
				ctr++;
			}
		}
	}
	vi tq;
	for (int i = H * W; i < H * W + ctr; i++) {
		tq.pb(i);
	}
	add_or(tq);
}

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