Submission #725890

#TimeUsernameProblemLanguageResultExecution timeMemory
725890Darren0724Vision Program (IOI19_vision)C++17
0 / 100
11 ms1532 KiB
#include "vision.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; const int B=20; void construct_network(int n, int m, int K) { int N=n+m-1; vector<int> num_a(N),num_b(N); vector<vector<int>> a(N),b(N); int idx=n*m; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ a[i+j].push_back(i*n+j); b[j+n-1-i].push_back(i*n+j); } } for(int i=0;i<N;i++){ num_a[i]=idx++; add_or(a[i]); } for(int i=0;i<N;i++){ num_b[i]=idx++; add_or(b[i]); } }
#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...