제출 #425177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425177		schse	Vision Program (IOI19_vision)	C++17	26 / 100	10 ms	1100 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)
{

	if (H == 1 || W == 1)
	{
		vector<int> lr;
		for (int i = 0; i < H * W - K; i++)
			lr.push_back(add_and({i, i + K}));
		int N = add_or(lr);
		return;
	}

	vector<int> orrows;
	for (int r = 0; r < H; r++)
	{
		vector<int> v(W);
		iota(v.begin(), v.end(), r * W);
		orrows.push_back(add_or(v));
	}

	vector<int> hdis;
	hdis.push_back(add_xor(orrows));
	for (int dis = 1; dis < K + 1; dis++)
	{
		vector<int> c;
		for (int r = dis; r < H; r++)
			c.push_back(add_and({orrows[r], orrows[r - dis]}));
		hdis.push_back(add_or(c));
	}

	vector<int> orcols;
	for (int c = 0; c < W; c++)
	{
		vector<int> v;
		for (int r = 0; r < H; r++)
			v.push_back(c + r * W);
		orcols.push_back(add_or(v));
	}

	vector<int> vdis;
	vdis.push_back(add_xor(orcols));
	for (int dis = 1; dis < K + 1; dis++)
	{
		vector<int> c;
		for (int r = dis; r < W; r++)
			c.push_back(add_and({orcols[r], orcols[r - dis]}));
		vdis.push_back(add_or(c));
	}
	vector<int> v;
	for (int i = 0; i <= K; i++)
	{
		if (vdis.size() > i && hdis.size() > K - i)
			v.push_back(add_and({vdis[i], hdis[K - i]}));
	}
	add_or(v);
	return;
}

컴파일 시 표준 에러 (stderr) 메시지

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:16:7: warning: unused variable 'N' [-Wunused-variable]
   16 |   int N = add_or(lr);
      |       ^
vision.cpp:59:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |   if (vdis.size() > i && hdis.size() > K - i)
      |       ~~~~~~~~~~~~^~~
vision.cpp:59:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |   if (vdis.size() > i && hdis.size() > K - i)
      |                          ~~~~~~~~~~~~^~~~~~~

• 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: 14 / 14
• Subtask 8: 0 / 19