oj.uz

답안 #778413

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
778413 2023-07-10T09:44:46 Z Elias Vision Program (IOI19_vision) C++17
0 / 100
 16 ms 2556 KB 
#ifndef _DEBUG
#include "vision.h"
#endif

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

void construct_network(int H, int W, int K)
{

	int def_zero = add_and({0, 1, 2});
	int def_one = add_not(def_zero);

	vector<int> xor_single;
	for (int i = 0; i < H; i++)
	{
		vector<int> indices;
		for (int j = 0; j < W; j++)
		{
			indices.push_back(i * W + j);
		}
		xor_single.push_back(add_xor(indices));
	}

	for (int j = 0; j < W; j++)
	{
		vector<int> indices;
		for (int i = 0; i < H; i++)
		{
			indices.push_back(i * W + j);
		}
		xor_single.push_back(add_xor(indices));
	}

	assert(xor_single.size() == W + H);

	vector<int> xor_prefix;
	vector<int> indices;
	for (int i = 0; i < W + H; i++)
	{
		indices.push_back(xor_single[i]);
		xor_prefix.push_back(add_xor(indices));
	}

	assert(xor_prefix.size() == W + H);

	vector<int> bits;
	for (int k = 0; k <= 8; k++)
	{
		int carry = def_zero;

		if (K & (1 << k))
			bits.push_back(add_xor(xor_prefix));
		else
			bits.push_back(add_not(add_xor(xor_prefix)));

		vector<int> new_xor_prefix;
		for (int i = 0; i < W + H; i++)
		{
			new_xor_prefix.push_back(add_and({carry, xor_prefix[i]}));
			carry = add_xor({carry, xor_prefix[i]});
		}
		xor_prefix = new_xor_prefix;
	}
	cout << "bits: ";
	for (int i = 0; i < bits.size(); i++)
		cout << bits[i] << " ";
	cout << "\n";

	add_and(bits);
}

#ifdef _DEBUG

static const int MAX_INSTRUCTIONS = 10000;
static const int MAX_INPUTS = 1000000;

static const int _AND = 0;
static const int _OR = 1;
static const int _XOR = 2;
static const int _NOT = 3;

static inline bool increasing(int a, int b, int c)
{
	return a <= b && b <= c;
}

[[noreturn]] static inline void error(string message)
{
	printf("%s\n", message.c_str());
	exit(0);
}

class InstructionNetwork
{

	struct Instruction
	{
		int type;
		vector<int> input_indexes;

		inline Instruction(int _type, const vector<int> &_input_indexes) : type(_type), input_indexes(_input_indexes)
		{
		}

		inline int apply(int a, int b) const
		{
			switch (type)
			{
			case _AND:
				return a & b;
			case _OR:
				return a | b;
			case _XOR:
				return a ^ b;
			default:
				return 0;
			}
		}

		inline int compute(const vector<int> &memory_cells) const
		{
			int r = memory_cells[input_indexes[0]];
			if (type == _NOT)
				return 1 - r;
			for (int j = 1; j < (int)input_indexes.size(); j++)
				r = apply(r, memory_cells[input_indexes[j]]);
			return r;
		}
	};

	int input_size;
	int total_inputs;
	vector<Instruction> instructions;

public:
	inline void init(int _input_size)
	{
		this->input_size = _input_size;
		this->total_inputs = 0;
		this->instructions.clear();
	}

	inline int add_instruction(int type, const vector<int> &input_indexes)
	{
		if (input_indexes.size() == 0)
			error("Instruction with no inputs");

		if (instructions.size() + 1 > MAX_INSTRUCTIONS)
			error("Too many instructions");

		if (total_inputs + input_indexes.size() > MAX_INPUTS)
			error("Too many inputs");

		instructions.emplace_back(type, input_indexes);
		total_inputs += input_indexes.size();
		int new_index = input_size + (int)instructions.size() - 1;

		for (int input_index : input_indexes)
			if (!increasing(0, input_index, new_index - 1))
				error("Invalid index");

		return new_index;
	}

	inline int compute(vector<int> &memory_cells) const
	{
		for (auto &instruction : instructions)
			memory_cells.push_back(instruction.compute(memory_cells));
		return memory_cells.back();
	}
};

static InstructionNetwork instructionNetwork;

int main()
{
	int H, W, K;
	assert(3 == scanf("%d%d%d", &H, &W, &K));

	FILE *log_file = fopen("log.txt", "w");

	instructionNetwork.init(H * W);
	construct_network(H, W, K);

	// while (true)
	// {
	int rowA, colA, rowB, colB;
	for (rowA = 0; rowA < H; rowA++)
		for (colA = 0; colA < W; colA++)
			for (rowB = 0; rowB < H; rowB++)
				for (colB = 0; colB < W; colB++)
				{
					if (rowA == rowB && colA == colB)
						continue;

					// assert(1 == scanf("%d", &rowA));
					// if (rowA == -1)
					// 	break;
					// assert(3 == scanf("%d%d%d", &colA, &rowB, &colB));

					if ((!increasing(0, rowA, H - 1)) ||
						(!increasing(0, colA, W - 1)) ||
						(!increasing(0, rowB, H - 1)) ||
						(!increasing(0, colB, W - 1)) ||
						(rowA == rowB && colA == colB))
					{
						printf("-1\n");
						fprintf(log_file, "-1\n");
						fflush(stdout);
						fflush(log_file);
						continue;
					}

					vector<int> memory_cells;
					for (int row = 0; row < H; row++)
						for (int col = 0; col < W; col++)
						{
							bool active = (row == rowA && col == colA) || (row == rowB && col == colB);
							memory_cells.push_back(active ? 1 : 0);
						}
					int computation_result = instructionNetwork.compute(memory_cells);

					cout << rowA << " " << colA << " " << rowB << " " << colB << "\n";

					bool should_be = bool((abs(rowA - rowB) + abs(colA - colB)) == K);
					cout << computation_result << " " << should_be << "\n";

					assert(computation_result == should_be);

					printf("%d\n", computation_result);
					fflush(stdout);

					for (int i = 0; i < (int)memory_cells.size(); i++)
						fprintf(log_file, (i ? " %d" : "%d"), memory_cells[i]);
					fprintf(log_file, "\n");
					fflush(log_file);
				}
	fclose(stdin);
}

int add_and(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_AND, Ns);
}

int add_or(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_OR, Ns);
}

int add_xor(vector<int> Ns)
{
	return instructionNetwork.add_instruction(_XOR, Ns);
}

int add_not(int N)
{
	vector<int> Ns = {N};
	return instructionNetwork.add_instruction(_NOT, Ns);
}

#endif

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from vision.cpp:5:
vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:35:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |  assert(xor_single.size() == W + H);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~
vision.cpp:45:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |  assert(xor_prefix.size() == W + H);
      |         ~~~~~~~~~~~~~~~~~~^~~~~~~~
vision.cpp:66:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  for (int i = 0; i < bits.size(); i++)
      |                  ~~^~~~~~~~~~~~~
vision.cpp:12:6: warning: unused variable 'def_one' [-Wunused-variable]
   12 |  int def_one = add_not(def_zero);
      |      ^~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 724 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 2556 KB secret mismatch
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB secret mismatch
2 Halted 0 ms 0 KB -