Submission #1048230

#TimeUsernameProblemLanguageResultExecution timeMemory
1048230mychecksedadVision Program (IOI19_vision)C++17
0 / 100
64 ms1048 KiB
#include "vision.h" #include<bits/stdc++.h> using namespace std; #define ll long long int #define pb push_back #define vi vector<int> int n, m; int last; vector<int> D; int c(int x, int y){ return x * m + y; } void construct_network(int H, int W, int K) { n = H, m = W; last = n*m; for(int i = 0; i < n; ++i){ for(int j = 0; j < m; ++j){ for(int l = 0; l < n; ++l){ for(int y = 0; y < m; ++y){ // cout << i << ' ' << j << ' ' << l<< ' ' << y << '\n'; if(abs(i-l) + abs(j - y) == K){ D.pb(add_and(vi{c(i, j), c(l, y)})); } } } } } int c = add_xor(D); add_not(c); }
#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...