Submission #147374

#	Time	Username	Problem	Language	Result	Execution time	Memory
147374		Nucleist	Vision Program (IOI19_vision)	C++14	0 / 100	5 ms	1140 KiB

vision

#include <bits/stdc++.h> 
#include "vision.h"
using namespace std; 
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define INF 1000000000
#define pb push_back
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
void construct_network(int H,int W,int K)
{
  for (int i = 0; i < H; ++i)
  {
  	for (int j = 0; j < W; ++j)
  	{
  		for (int k = i+1; k < H; ++k)
  		{
  			for (int c = j+1; c < W; ++c)
  			{
  				vector<int>now;
  				int cell1 = i*W+j;
  				int cell2 = k*W+c;
  				now.pb(cell1),now.pb(cell2);
  				int kol = add_and(now);
  				if(kol==1)
  				{
  					if(abs(i-k)+abs(j-c)==k)
  						return;
  					else 
  					{
  						now.clear();
  						now.pb(0);
  						now.pb(1);
  						int yo = add_and(now);
  						if(yo==0)return;
  						now.clear();
  						now.pb(0);
  						now.pb(W);
  						add_and(now);
  					}
  					return;
  				}
  			}
  		}
  	}
  }
  return ;
}
//code the AC sol !
// BS/queue/map

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