Submission #316383

#TimeUsernameProblemLanguageResultExecution timeMemory
316383kylych03Vision Program (IOI19_vision)C++14
0 / 100
194 ms1140 KiB
#include "vision.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
void construct_network(int H, int W, int K) {
    vector<int> vec;
	for(int i  = 0 ; i < H; i++ ){
        for(int j = 0 ; j < W; j++){
            vector <int> v,v1;
            for(int t = i; t< H; t++)
                for(int p = 0 ; p < W; p++)
                    if(abs (t - i) + abs(p - j) == K){
                        int p2 = t*W + p;
                        v.push_back(p2);
                    }
            int p1 = i*W + j;
            v1.push_back(p1);
            if(v.size()== 0)
                continue;
            vec.push_back( add_or(v) );
            v1.push_back(vec[vec.size()-1]);
            vec.push_back( add_and(v1) );
        }
	}


	add_or(vec);

	//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...