Submission #892881

#TimeUsernameProblemLanguageResultExecution timeMemory
892881Sir_Ahmed_ImranVision Program (IOI19_vision)C++17
0 / 100
1 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(); for(int k=i;k<n;k++){ if(k-i>o) continue; if(j+o-k+i<m) u.append(k*m+j+o-k+i); if(j-o+k-i>=0 && k>i) u.append(k*m+j-o+k-i); } if(i==n-1 && j==m-1) continue; if(n*m<=10000) u.append(i*m+j); v.append(add_or(u)); if(n*m>10000) return; } } add_xor(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...