Submission #293716

#TimeUsernameProblemLanguageResultExecution timeMemory
293716MoNsTeR_CuBeVision Program (IOI19_vision)C++17
44 / 100
227 ms2948 KiB
    #include "vision.h"
    #include <bits/stdc++.h>
    using namespace std;
    void construct_network(int H, int W, int K) {
    	
    	vector< int > finalCheck;
    	
    	int curr = H*W;
    	
    	for(int i = 0; i < H; i++){
    		for(int j = 0; j < W; j++){
    			vector< int > goodDist;
    			
    			for(int k = 0; k < H; k++){
    				for(int l = 0; l < W; l++){
    					if(abs(i-k)+abs(j-l) == K){
    						goodDist.push_back(k*W+l);
    					}
    				}
    			}
    			if(goodDist.empty()) continue;
    			add_xor(goodDist);
    			curr++;
    			add_and({i*W+j,curr-1});
    			finalCheck.push_back(curr);
    			curr++;
    		}
    	}
    	
    	add_or(finalCheck);
    }
#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...