제출 #1042128

#제출 시각아이디문제언어결과실행 시간메모리
1042128LaMatematica14Vision Program (IOI19_vision)C++17
8 / 100
1 ms600 KiB
#include <vector> #include <string> using namespace std; 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); void construct_network(int H, int W, int K) { int t = 0; for (int r = 0; r <= K; r++) { int c = K - r; if (r >= H) break; if (c >= W) continue; t++; vector<int> pr = {0, r*W+c}; add_and(pr); } vector<int > ans; for (int i = 0; i < t; i++) ans.push_back(W*H+i); add_or(ans); }
#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...