Submission #427725

#TimeUsernameProblemLanguageResultExecution timeMemory
427725MDarioVision Program (IOI19_vision)C++17
44 / 100
110 ms2120 KiB
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
void construct_network(int n, int m, int K) {
	vector<int> ns, r;
	ll c=n*m;
	for(int i=0; i<n; i++){
        for(int t=0; t<m; t++){
            //cout << i << " " << t << "\n";
            ns.clear();
            for(int i1=0; i1<n; i1++){
                for(int t1=0; t1<m; t1++){
                    if(abs(i-i1)+abs(t-t1)==K){
                        ns.push_back(i1*m+t1);
                        //cout << i1 << " " << t1 << "\n";
                    }
                }
            }
            //cout << "///////\n";
            if(ns.size()==0)continue;
            add_or(ns);
            ns.clear();
            ns.push_back(i*m+t);
            add_and(ns);
            ns.clear();
            c++;
            ns.push_back(c-1);
            ns.push_back(c);
            c++;
            add_and(ns);
            r.push_back(c);
            c++;
        }
	}
	add_or(r);
	return;
}
//add_and(ns);
//add_or(ns);
//add_xor(ns);
//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...