Submission #645000

#TimeUsernameProblemLanguageResultExecution timeMemory
645000a_aguiloVision Program (IOI19_vision)C++14
0 / 100
2 ms1064 KiB
#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

void construct_network(int H, int W, int K) {
	vector<int> possibilities;
	for(int i = 0; i < W-1; ++i){
        for(int j = 0; j < H-1; ++j){
            int PosAct = i + j*W;
            int hasTwoOnes = add_and({add_or({PosAct+1, PosAct+W}), add_and({PosAct})});
            possibilities.push_back(hasTwoOnes);
            //cout << memory[hasTwoOnes] << endl;
            //print(AtDistanceK);
        }
	}
	add_or(possibilities);
}
#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...