제출 #429171

#제출 시각아이디문제언어결과실행 시간메모리
429171Ahmadsm2005Vision Program (IOI19_vision)C++14
0 / 100
4 ms968 KiB
#include "vision.h"
//#include "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
int h,w;
void HELP(vector<int>&TEMP,int i,int l){
if(i>=0&&i<w&&l>=0&&l<h)
TEMP.push_back(i+l*w);
}
int query(int i,int l){
vector<int>TEMP;
HELP(TEMP,i,l),HELP(TEMP,i+1,l),HELP(TEMP,i+1,l+1),HELP(TEMP,i,l+1);
if(TEMP.size()){
add_or(TEMP);
return 1;
}
return 0;
}
void construct_network(int H,int W,int K){
h=H,w=W;
if(K==1){
vector<int>ADD;
int Z=0;
set<pair<pair<int,int>,pair<int,int>>>lol;
for(int i=0;i<200;i+=2){
for(int l=0;l<200;l+=2){
Z+=query(i,l);
}
}
for(int i=W*H;i<W*H+Z;i++){
ADD.push_back(i);
}
add_xor(ADD);
}
}
#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...