제출 #818027

#제출 시각아이디문제언어결과실행 시간메모리
818027LoboVision Program (IOI19_vision)C++17
12 / 100
14 ms1976 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) { // std::vector<int> Ns; // Ns = {0, 1}; // int a = add_and(Ns); // Ns = {0, a}; // int b = add_or(Ns); // Ns = {0, 1, b}; // int c = add_xor(Ns); // add_not(c); // vector<pair<int,int>> wtf = {{1,1},{1,-1},{-1,1},{-1,-1}}; // vector<int> checks; // for(int i = 0; i < n; i++) { // if(max(n,m) > 30 && min(n,m) != 1 && i != 0) continue; // for(int j = 0; j < m; j++) { // if(max(n,m) > 30 && min(n,m) != 1 && j != 0) continue; // vector<int> valid_pos; // for(int d1 = 0; d1 <= k; d1++) { // for(auto X : wtf) { // int ii = i+d1*X.fr; // if(d1 == 0 && X.fr == -1) continue; // int jj = j+(k-d1)*X.sc; // if((k-d1) == 0 && X.sc == -1) continue; // if(ii >= 0 && ii < n && jj >= 0 && jj < m && i*m+j < ii*m+jj) { // valid_pos.pb(ii*m+jj); // } // } // } // if(valid_pos.size() == 0) continue; // int or_valid_pos = add_or(valid_pos); // checks.pb(add_and(vector<int>{i*m+j,or_valid_pos})); // } // } // add_or(checks); 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; while(i0 <= n-1) { if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0); i0++; j0++; } while(i1 <= n-1) { if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1); i1++; j1++; } if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)})); diag0.clear(); diag1.clear(); i0 = i-i; j0 = j+i; i1 = i-i; j1 = j+k+i; while(i0 <= n-1) { if(i0 >= 0 && i0 <= n-1 && j0 >= 0 && j0 <= m-1) diag0.pb(i0*m+j0); i0++; j0--; } while(i1 <= n-1) { if(i1 >= 0 && i1 <= n-1 && j1 >= 0 && j1 <= m-1) diag1.pb(i1*m+j1); i1++; j1--; } if(diag0.size() && diag1.size()) checks.pb(add_and(vector<int>{add_or(diag0),add_or(diag1)})); } add_or(checks); }
#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...