Submission #429013

#	Time	Username	Problem	Language	Result	Execution time	Memory
429013		Ahmadsm2005	Vision Program (IOI19_vision)	C++14	33 / 100	1103 ms	179152 KiB

vision

#include "vision.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
void construct_network(int H,int W,int K){
/*std::vector<int>Ns;
Ns = {0, 1};
int a = add_and(Ns);
Ns = {0, a};
int b = add_or(Ns);
Ns = {0, 1, b};
int c = add_xor(Ns);
add_not(c);*/
vector<int>ADD;
int Z=0;
set<pair<pair<int,int>,pair<int,int>>>lol;
for(int i=0;i<W;i++){
for(int l=0;l<H;l++){
for(int x=0;x<W;x++){
for(int z=0;z<H;z++){
pair<int,int>F={i,l},S={x,z};
if(S>F)
swap(S,F);
if(lol.find({F,S})!=lol.end())
continue;
lol.insert({F,S});
if(abs(i-x)+abs(l-z)==K){
ADD.push_back(i+l*W);
ADD.push_back(x+z*W);
add_and(ADD);
ADD.clear();
Z++;
}
}
}
}
}
for(int i=W*H;i<W*H+Z;i++){
ADD.push_back(i);
}
add_or(ADD);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 15
• Subtask 5: 12 / 12
• Subtask 6: 0 / 8
• Subtask 7: 0 / 14
• Subtask 8: 0 / 19