Submission #892908

#TimeUsernameProblemLanguageResultExecution timeMemory
892908Sir_Ahmed_ImranVision Program (IOI19_vision)C++17
0 / 100
0 ms348 KiB
///~~~LOTA~~~/// #include "vision.h" #include <bits/stdc++.h> using namespace std; #define nl '\n' #define ff first #define ss second #define ll long long #define append push_back #define pii pair<int,int> #define all(x) (x).begin(),(x).end() #define N 100001 void construct_network(int n,int m,int o){ vector<int> u,v; for(int i=0;i<n;i++){ for(int j=0;j<m;j++){ u.clear(); if(i==0 && j==m-1) continue; if(i==n-1 && j==0) continue; if(i==n-1 && j==m-1) continue; for(int k=0;k<n;k++){ if(abs(k-i)>o) break; if(abs(k-i)==o) u.append(k*m+j); else{ if(j+o-abs(k-i)<m) u.append(i*m+j+o-abs(k-i)); if(j-o+abs(k-i)>=0) u.append(i*m+j-o+abs(k-i)); } } if(n*m<=10000) u.append(i*m+j); v.append(add_xor(u)); if(n*m>10000) return; } } add_not(add_or(v)); }
#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...