Submission #294864

#TimeUsernameProblemLanguageResultExecution timeMemory
294864egekabasVision Program (IOI19_vision)C++14
44 / 100
197 ms2340 KiB
    #include "vision.h"
    #include <bits/stdc++.h>
    #define all(x) (x).begin(), (x).end()
    #define ff first
    #define ss second
    #define pb push_back
    #define mp make_pair
    using namespace std;
    typedef long long ll;
    typedef unsigned long long ull;
    typedef long double ld;
    typedef pair<ll, ll> pll;
    typedef pair<ull, ull> pull;
    typedef pair<int, int> pii;
    typedef pair<ld, ld> pld;
    void construct_network(int H, int W, int K){
    	vector<int> finalcomp;
    	for(int i = 0; i < H; ++i)
    		for(int j = 0; j < W; ++j){
    			vector<int> fr;
    			for(int i1 = 0; i1 < H; ++i1)
    				for(int j1 = 0; j1 < W; ++j1)
    					if(abs(i1-i)+abs(j1-j) == K && i1*W+j1 > i*W+j)
    						fr.pb(i1*W+j1);
    			if(fr.size())
    				finalcomp.pb(add_and({i*W+j, add_or(fr)}));
    		}
    	add_or(finalcomp);
    }
#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...