Submission #316419

#	Time	Username	Problem	Language	Result	Execution time	Memory
316419		juggernaut	Vision Program (IOI19_vision)	C++14	33 / 100	1091 ms	1572 KiB

vision

#include"vision.h"
#include<bits/stdc++.h>
#ifdef EVAL
#else
#include"grader.cpp"
#endif
using namespace std;
void construct_network(int H,int W,int K){
	vector<int>total;
	vector<pair<int,int>>v;
	for(int i1=0;i1<H;i1++)
	for(int i2=0;i2<H;i2++)
	for(int j1=0;j1<W;j1++)
	for(int j2=0;j2<W;j2++)
    if(abs(i1-i2)+abs(j1-j2)==K)v.push_back({i1*W+j1,i2*W+j2});
    sort(v.begin(),v.end());
    int n=unique(v.begin(),v.end())-v.begin();
    for(int i=0;i<n;i++)total.push_back(add_and({v[i].first,v[i].second}));
	add_or(total);
}

• 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