제출 #424889

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
424889		schse	Vision Program (IOI19_vision)	C++17	12 / 100	2 ms	1096 KiB

vision

#include "vision.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;

void construct_network(int H, int W, int K)
{
	vector<int> lr;
	for (int r = 0; r < H; r++)
	{
		for (int c = 0; c < W; c++)
		{
			for (int rn, cn, i = 0; i <= K; i++)
			{
				rn = r + i;
				cn = c + K - i;
				if (0 <= cn && cn < W && 0 <= rn && rn < H)
					lr.push_back(add_and({r * W + c, cn + rn * W}));
				rn = r - i;
				cn = c - (K - i);
				if (0 <= cn && cn < W && 0 <= rn && rn < H)
					lr.push_back(add_and({r * W + c, cn + rn * W}));
				rn = r - i;
				cn = c + K - i;
				if (0 <= cn && cn < W && 0 <= rn && rn < H)
					lr.push_back(add_and({r * W + c, cn + rn * W}));
				rn = r + i;
				cn = c - K - i;
				if (0 <= cn && cn < W && 0 <= rn && rn < H)
					lr.push_back(add_and({r * W + c, cn + rn * W}));
			}
		}
	}
	add_or(lr);
	return;
}

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