oj.uz

답안 #276850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
276850 2020-08-20T17:30:07 Z Mercenary Vision Program (IOI19_vision) C++14
100 / 100
 65 ms 6004 KB 
#ifndef LOCAl
#include "vision.h"
#endif // LOCAl

#include<bits/stdc++.h>
#define pb push_back
using namespace std;
const int maxn = 500;

int L_atleastone[maxn];
int L_two;
int R_atleastone[maxn];
int R_two;
vector<int> L[maxn] , R[maxn];

int askconsucutive(int H , int W , int K){
    vector<int> L_val , R_val;
    for(int i = 0 ; i + K - 1 < H + W - 1; ++i){
        vector<int> L_tmp , R_tmp;
        for(int j = i ; j < i + K ; ++j){
            L_tmp.pb(L_atleastone[j]);
            R_tmp.pb(R_atleastone[j]);
        }
        L_val.pb(add_xor({add_or(L_tmp),add_xor(L_tmp)}));
        R_val.pb(add_xor({add_or(R_tmp),add_xor(R_tmp)}));
    }
    L_val.pb(L_two);
    R_val.pb(R_two);
    return add_and({add_or(L_val) , add_or(R_val)});
}

void construct_network(int H, int W, int K) {
    for(int i = 0 ; i < H ; ++i){
        for(int j = 0 ; j < W ; ++j){
            L[i + j].pb(i * W + j);
            R[i - j + W - 1].pb(i * W + j);
        }
    }
    vector<int> L_val,R_val;
    for(int i = 0 ; i < H + W - 1 ; ++i){
        L_atleastone[i] = add_or(L[i]);
        R_atleastone[i] = add_or(R[i]);
        L_val.pb(add_xor({L_atleastone[i],add_xor(L[i])}));
        R_val.pb(add_xor({R_atleastone[i],add_xor(R[i])}));
    }
    L_two = add_or(L_val);
    R_two = add_or(R_val);
    add_and({askconsucutive(H , W ,K + 1) , add_not({askconsucutive(H , W , K)})});

}

#ifdef LOCAL

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;
		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);

		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 // LOCAL

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 640 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 640 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 17 ms 1664 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 5 ms 768 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 7 ms 1056 KB Output is correct
44 Correct 14 ms 1792 KB Output is correct
45 Correct 16 ms 1784 KB Output is correct
46 Correct 13 ms 1536 KB Output is correct
47 Correct 6 ms 896 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 11 ms 1152 KB Output is correct
3 Correct 11 ms 1152 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 10 ms 1152 KB Output is correct
7 Correct 10 ms 1056 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 9 ms 1024 KB Output is correct
11 Correct 13 ms 1280 KB Output is correct
12 Correct 14 ms 1280 KB Output is correct
13 Correct 10 ms 1056 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 4 ms 768 KB Output is correct
16 Correct 11 ms 1152 KB Output is correct
17 Correct 11 ms 1152 KB Output is correct
18 Correct 12 ms 1152 KB Output is correct
19 Correct 11 ms 1024 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 7 ms 896 KB Output is correct
6 Correct 5 ms 768 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 11 ms 1280 KB Output is correct
10 Correct 12 ms 1408 KB Output is correct
11 Correct 10 ms 1152 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 12 ms 1152 KB Output is correct
15 Correct 9 ms 1152 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 3 ms 680 KB Output is correct
18 Correct 11 ms 1152 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 13 ms 1788 KB Output is correct
21 Correct 32 ms 3188 KB Output is correct
22 Correct 30 ms 3064 KB Output is correct
23 Correct 12 ms 1536 KB Output is correct
24 Correct 13 ms 1788 KB Output is correct
25 Correct 41 ms 3320 KB Output is correct
26 Correct 14 ms 1536 KB Output is correct
27 Correct 26 ms 2972 KB Output is correct
28 Correct 53 ms 5108 KB Output is correct
29 Correct 59 ms 5876 KB Output is correct
30 Correct 49 ms 4984 KB Output is correct
31 Correct 22 ms 2552 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 2932 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 13 ms 1788 KB Output is correct
8 Correct 13 ms 1788 KB Output is correct
9 Correct 29 ms 2932 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #8
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 416 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 640 KB Output is correct
36 Correct 2 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 17 ms 1664 KB Output is correct
39 Correct 3 ms 512 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 5 ms 768 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 7 ms 1056 KB Output is correct
44 Correct 14 ms 1792 KB Output is correct
45 Correct 16 ms 1784 KB Output is correct
46 Correct 13 ms 1536 KB Output is correct
47 Correct 6 ms 896 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 11 ms 1152 KB Output is correct
50 Correct 11 ms 1152 KB Output is correct
51 Correct 2 ms 512 KB Output is correct
52 Correct 3 ms 640 KB Output is correct
53 Correct 10 ms 1152 KB Output is correct
54 Correct 10 ms 1056 KB Output is correct
55 Correct 2 ms 512 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 9 ms 1024 KB Output is correct
58 Correct 13 ms 1280 KB Output is correct
59 Correct 14 ms 1280 KB Output is correct
60 Correct 10 ms 1056 KB Output is correct
61 Correct 2 ms 512 KB Output is correct
62 Correct 4 ms 768 KB Output is correct
63 Correct 11 ms 1152 KB Output is correct
64 Correct 11 ms 1152 KB Output is correct
65 Correct 12 ms 1152 KB Output is correct
66 Correct 11 ms 1024 KB Output is correct
67 Correct 2 ms 512 KB Output is correct
68 Correct 0 ms 384 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 3 ms 640 KB Output is correct
73 Correct 6 ms 888 KB Output is correct
74 Correct 7 ms 896 KB Output is correct
75 Correct 5 ms 768 KB Output is correct
76 Correct 3 ms 512 KB Output is correct
77 Correct 5 ms 896 KB Output is correct
78 Correct 11 ms 1280 KB Output is correct
79 Correct 12 ms 1408 KB Output is correct
80 Correct 10 ms 1152 KB Output is correct
81 Correct 4 ms 768 KB Output is correct
82 Correct 3 ms 640 KB Output is correct
83 Correct 12 ms 1152 KB Output is correct
84 Correct 9 ms 1152 KB Output is correct
85 Correct 1 ms 512 KB Output is correct
86 Correct 3 ms 680 KB Output is correct
87 Correct 11 ms 1152 KB Output is correct
88 Correct 2 ms 512 KB Output is correct
89 Correct 13 ms 1788 KB Output is correct
90 Correct 32 ms 3188 KB Output is correct
91 Correct 30 ms 3064 KB Output is correct
92 Correct 12 ms 1536 KB Output is correct
93 Correct 13 ms 1788 KB Output is correct
94 Correct 41 ms 3320 KB Output is correct
95 Correct 14 ms 1536 KB Output is correct
96 Correct 26 ms 2972 KB Output is correct
97 Correct 53 ms 5108 KB Output is correct
98 Correct 59 ms 5876 KB Output is correct
99 Correct 49 ms 4984 KB Output is correct
100 Correct 22 ms 2552 KB Output is correct
101 Correct 1 ms 384 KB Output is correct
102 Correct 1 ms 384 KB Output is correct
103 Correct 27 ms 2932 KB Output is correct
104 Correct 1 ms 384 KB Output is correct
105 Correct 3 ms 640 KB Output is correct
106 Correct 6 ms 896 KB Output is correct
107 Correct 3 ms 640 KB Output is correct
108 Correct 3 ms 640 KB Output is correct
109 Correct 13 ms 1788 KB Output is correct
110 Correct 13 ms 1788 KB Output is correct
111 Correct 29 ms 2932 KB Output is correct
112 Correct 1 ms 384 KB Output is correct
113 Correct 1 ms 384 KB Output is correct
114 Correct 51 ms 5108 KB Output is correct
115 Correct 2 ms 512 KB Output is correct
116 Correct 3 ms 640 KB Output is correct
117 Correct 23 ms 2432 KB Output is correct
118 Correct 26 ms 2684 KB Output is correct
119 Correct 58 ms 5748 KB Output is correct
120 Correct 58 ms 5872 KB Output is correct
121 Correct 59 ms 5876 KB Output is correct
122 Correct 58 ms 5876 KB Output is correct
123 Correct 25 ms 2932 KB Output is correct
124 Correct 51 ms 5112 KB Output is correct
125 Correct 65 ms 6004 KB Output is correct
126 Correct 59 ms 5876 KB Output is correct
127 Correct 49 ms 4996 KB Output is correct
128 Correct 25 ms 2552 KB Output is correct