Submission #147385

#	Time	Username	Problem	Language	Result	Execution time	Memory
147385		Nucleist	Vision Program (IOI19_vision)	C++14	0 / 100	4 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)
{
  vector<int>zeros;
  pair<int,int>firsti;
  pair<int,int>secondi;
  bool ka=true;
  for (int i = 0; i < H; ++i)
  {
  	for (int j = 0; j < W; ++j)
  	{
  		int cell = i*W+j;
  		zeros.pb(cell);
  		int yo = add_not(cell);
  		if(yo==0){firsti={i,j};ka=false;}
  		else if(!ka && yo==0){secondi={i,j};}
  	}
  }
  if((abs(firsti.first-secondi.first)+abs(firsti.second+secondi.second)) == K)
  {
  	add_or(zeros);
  	return;
  }
  else
  {
  	add_and(zeros);
  	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