Submission #819788

#TimeUsernameProblemLanguageResultExecution timeMemory
819788LoboVision Program (IOI19_vision)C++17
12 / 100
59 ms7156 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; #define pb push_back #define fr first #define sc second #define mp make_pair #define all(x) x.begin(),x.end() void construct_network(int n, int m, int K) { map<int,int> diagdw,diagup; for(int it = 0; it <= n+m-2; it++) { int i,j; if(it <= n-1) { i = n-1-it; j = 0; } else { i = 0; j = it-n+1; } int i0,j0; vector<int> diag; i0 = i-i; j0 = j-i; while(i0 <= n-1) { if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag.pb(i0*m+j0); i0++; j0++; } diagdw[i-j] = add_or(diag); if(it <= n-1) { i = it; j = 0; } else { i = n-1; j = it-n+1; } diag.clear(); i0 = i-i; j0 = j+i; while(i0 <= n-1) { if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag.pb(i0*m+j0); i0++; j0--; } diagup[i] = add_or(diag); } vector<int> checks0; for(int add = 0; K+add <= n+m-2 && add <= 1; add+= 1) { int k = K+add; vector<int> checks; for(int it = 0; it <= n+m-2; it++) { int i,j; if(it <= n-1) { i = n-1-it; j = 0; } else { i = 0; j = it-n+1; } vector<int> diag0,diag1; int i0,j0,i1,j1; i0 = i-i; j0 = j-i; i1 = i-i; j1 = j+k-i; if(diagdw.count(i0-j0) && diagdw.count(i1-j1)) checks.pb(add_and(vector<int>{diagdw[i0-j0],diagdw[i1-j1]})); // while(i0 <= n-1) { // // if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0); // for(int jj = 0; jj <= j0; jj++) { // if(i0 >= 0 && i0 <= n-1 && jj >= 0 && jj <= m-1) diag0.pb(i0*m+jj); // } // i0++; // j0++; // } // while(i1 <= n-1) { // // if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1); // for(int jj = j1; jj <= m-1; jj++) { // if(i1 >= 0 && i1 <= n-1 && jj >= 0 && jj <= m-1) diag1.pb(i1*m+jj); // } // i1++; // j1++; // } // if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)})); // for(auto x : diag0) { // cout << " ++ " << x/m << " " << x%m << endl; // } // for(auto x : diag1) { // cout << " -- " << x/m << " " << x%m << endl; // } diag0.clear(); diag1.clear(); if(it <= n-1) { i = it; j = 0; } else { i = n-1; j = it-n+1; } i0 = i-i; j0 = j+i; i1 = i-i; j1 = j+k+i; // cout << i << " " << j << endl; while(i0 <= n-1) { // if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0); for(int jj = 0; jj <= j0; jj++) { if(i0 >= 0 && i0 <= n-1 && jj >= 0 && jj <= m-1) diag0.pb(i0*m+jj); } i0++; j0--; } while(i1 <= n-1) { // if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1); for(int jj = j1; jj <= m-1; jj++) { if(i1 >= 0 && i1 <= n-1 && jj >= 0 && jj <= m-1) diag1.pb(i1*m+jj); } i1++; j1--; } if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)})); } if(add == 0) checks0.pb(add_or(checks)); else checks0.pb(add_not(add_or(checks))); } add_and(checks0); }
#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...