제출 #1048515

#제출 시각아이디문제언어결과실행 시간메모리
1048515dozerVision Program (IOI19_vision)C++14
26 / 100
5 ms1140 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; #define sp " " #define endl "\n" #define pb push_back #define pii pair<int, int> #define st first #define nd second #define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout) #define fastio() cin.tie(0), ios_base::sync_with_stdio(0) #define LL node * 2 #define RR node * 2 + 1 #define ll long long void construct_network(int H, int W, int K) { auto ind = [&](int x, int y){ return x * W + y; }; map<int, int> hor, hor_dist, ver, ver_dist; for (int i = 0; i < H; i++){ vector<int> tmp; for (int j = 0; j < W; j++) tmp.pb(ind(i, j)); hor[i] = add_or(tmp); } for (int i = 0; i < W; i++){ vector<int> tmp; for (int j = 0; j < H; j++) tmp.pb(ind(j, i)); ver[i] = add_or(tmp); } vector<int> all; for (int i = 0; i < H; i++) all.pb(hor[i]); hor_dist[0] = add_xor(all); for (int i = 1; i < H; i++){ if (i != K) continue; hor_dist[i] = add_and({hor[0], hor[i]}); for (int j = 1; j + i < H; j++){ int curr = add_and({hor[j], hor[j + i]}); hor_dist[i] = add_or({hor_dist[i], curr}); } } all.clear(); for (int i = 0; i < W; i++) all.pb(ver[i]); ver_dist[0] = add_xor(all); for (int i = 1; i < W; i++){ if (i != K) continue; ver_dist[i] = add_and({ver[0], ver[i]}); for (int j = 1; j + i < W; j++){ int curr = add_and({ver[j], ver[j + i]}); ver_dist[i] = add_or({ver_dist[i], curr}); } } int res = -1; for (int i = 0; i <= K; i++){ if (i < H && K - i < W){ if (hor_dist[i] == 0 || ver_dist[K - i] == 0) continue; //cerr<<i<<sp<<K - i<<endl; int curr = add_and({hor_dist[i], ver_dist[K - i]}); if (res == -1) res = curr; else res = add_or({curr, res}); } } } /* 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() { fileio(); 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); } */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...