Submission #1221651

#TimeUsernameProblemLanguageResultExecution timeMemory
1221651VMaksimoski008Vision Program (IOI19_vision)C++20
33 / 100
127 ms1336 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; int id[205][205], c = 0; void construct_network(int n, int m, int k) { for(int i=0; i<n; i++) for(int j=0; j<m; j++) id[i][j] = c++; vector<int> v; for(int r1=0; r1<n; r1++) { for(int c1=0; c1<m; c1++) { for(int r2=0; r2<n; r2++) { for(int c2=0; c2<m; c2++) { int d = abs(r1-r2) + abs(c1-c2); if(d == k && id[r1][c1] < id[r2][c2]) v.push_back(add_and({ id[r1][c1], id[r2][c2] })); } } } } 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...