Submission #153075

#TimeUsernameProblemLanguageResultExecution timeMemory
153075oolimryVision Program (IOI19_vision)C++14
26 / 100
44 ms4340 KiB
#include "vision.h" #include <bits/stdc++.h> using namespace std; void construct_network(int H, int W, int K) { map<int, vector<int> > a; ///down left (/) map<int, vector<int> > b; ///down right (\) for(int r = 0;r < H;r++){ for(int c = 0;c < W;c++){ a[r+c].push_back(r * W + c); b[r-c].push_back(r * W + c); } } int s = a.size(); int cnt = H*W; for(map<int, vector<int> >::iterator it = a.begin();it != a.end();it++){ //cout << it->first << ": "; //for(int x : it->second){ // cout << x << " "; //} //cout << "\n"; add_or(it->second); cnt++; } for(map<int, vector<int> >::iterator it = b.begin();it != b.end();it++){ //cout << it->first << ": "; //for(int x : it->second){ // cout << x << " "; //} //cout << "\n"; add_or(it->second); cnt++; } for(int i = 0;i < s - K;i++){ vector<int> Ns = {H*W+i,H*W+i+K}; add_and(Ns); cnt++; } for(int i = 0;i < s - K;i++){ vector<int> Ns = {H*W+i+s,H*W+i+K+s}; add_and(Ns); cnt++; } vector<int> Ns; for(int i = H*W+2*s;i < cnt;i++){ Ns.push_back(i); } int impt = add_or(Ns); for(int r = 0;r < H;r++){ vector<int> Ds; for(int c = 0;c < W;c++){ Ds.push_back(r * W + c); } add_or(Ds); } for(int c = 0;c < W;c++){ vector<int> Ds; for(int r = 0;r < H;r++){ Ds.push_back(r * W + c); } add_or(Ds); } vector<int> hh; vector<int> vv; for(int r = 0;r < H - K;r++){ vector<int> Ds; for(int i = 0;i <= K;i++){ Ds.push_back(impt + 1 + i + r); } int x = add_xor(Ds); int y = add_or(Ds); int z = add_not(x); int zz = add_and({z,y}); hh.push_back(zz); } for(int r = 0;r < W - K;r++){ vector<int> Ds; for(int i = 0;i <= K;i++){ Ds.push_back(impt + 1 + i + r + H); } int x = add_xor(Ds); int y = add_or(Ds); int z = add_not(x); int zz = add_and({z,y}); vv.push_back(zz); } vector<int> st; st.push_back(impt); vector<int> k1; vector<int> k2; for(int r = 0;r < H;r++){ vector<int> Ds; for(int c = 0;c < W;c++){ Ds.push_back(r * W + c); } k1.push_back(add_xor(Ds)); } for(int c = 0;c < W;c++){ vector<int> Ds; for(int r = 0;r < H;r++){ Ds.push_back(r * W + c); } k1.push_back(add_xor(Ds)); } for(int r = 0;r < H;r++){ vector<int> Ds; for(int c = 0;c < W;c++){ Ds.push_back(r * W + c); } k2.push_back(add_or(Ds)); } for(int c = 0;c < W;c++){ vector<int> Ds; for(int r = 0;r < H;r++){ Ds.push_back(r * W + c); } k2.push_back(add_or(Ds)); } vector<int> k3; for(int i = 0;i < k1.size();i++){ k3.push_back(add_not(k1[i])); } vector<int> k4; for(int i = 0;i < k3.size();i++){ k4.push_back(add_and({k2[i],k3[i]})); } int k5 = add_or(k4); vv.push_back(k5); hh.push_back(k5); if(!vv.empty()) {int b1 = add_or(vv); st.push_back(b1);} if(!hh.empty()) {int b2 = add_or(hh); st.push_back(b2);} add_and(st); }

Compilation message (stderr)

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:130:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < k1.size();i++){
                   ~~^~~~~~~~~~~
vision.cpp:135:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i < k3.size();i++){
                   ~~^~~~~~~~~~~
#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...