제출 #1031398

#제출 시각아이디문제언어결과실행 시간메모리
1031398vjudge1Vision Program (IOI19_vision)C++17
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> using namespace std; #pragma GCC optimize("O3") #define endl '\n' #define db double #define ll __int128 #define pb push_back #define fs first #define sd second #define Mod long(1e9 + 7) #define all(x) x.begin(), x.end() #define unvisited long(-1) #define Eps double(1e-9) #define _for(i, n) for(int i = 0; i < (n); i++) #define dbg(x) cout << #x ": " << x << endl; const int Max = 1e6 + 7, Inf = 1e9 + 7; 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; void construct_network(int H, int W, int K); int add_and(std::vector<int> Ns); int add_or(std::vector<int> Ns); int add_xor(std::vector<int> Ns); int add_not(int N); 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); } int pos(int i, int j, int w){ return i * w + j; } void construct_network(int h, int w, int k) { int ini = h*w, last = h*w-1; //cerr << h << " " << w << " " << k << endl; map <int, int> mp; for(int i = 0; i < h; i++) { for(int j = 0; j < w; j++) if(mp[pos(i, j, w)] == 0) { for(int l = 0; l < h; l++) { for(int m = 0; m < w; m++) { if(abs(l - i) + abs(m - j) == k){ int b = pos(l, m, w); mp[b] = 1; add_and({ pos(l, m, w), pos(i, j, w) }); //cerr << pos(l, m, w) << " " << pos(i, j, w) << endl; last++; } } } } } if(ini > last) return; vector <int> s; for(int i = ini; i <= last; i++){ s.push_back(i); } add_or(s); }

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

/usr/bin/ld: /tmp/ccJmpWA5.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccQoSP48.o:vision.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccJmpWA5.o: in function `add_and(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0x150): multiple definition of `add_and(std::vector<int, std::allocator<int> >)'; /tmp/ccQoSP48.o:vision.cpp:(.text+0x430): first defined here
/usr/bin/ld: /tmp/ccJmpWA5.o: in function `add_or(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0x170): multiple definition of `add_or(std::vector<int, std::allocator<int> >)'; /tmp/ccQoSP48.o:vision.cpp:(.text+0x650): first defined here
/usr/bin/ld: /tmp/ccJmpWA5.o: in function `add_xor(std::vector<int, std::allocator<int> >)':
grader.cpp:(.text+0x190): multiple definition of `add_xor(std::vector<int, std::allocator<int> >)'; /tmp/ccQoSP48.o:vision.cpp:(.text+0x210): first defined here
/usr/bin/ld: /tmp/ccJmpWA5.o: in function `add_not(int)':
grader.cpp:(.text+0x1b0): multiple definition of `add_not(int)'; /tmp/ccQoSP48.o:vision.cpp:(.text+0x870): first defined here
collect2: error: ld returned 1 exit status