# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
551072 | PiejanVDC | Fountain Parks (IOI21_parks) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
//#include "parks.h"
using namespace std;
int dx[4] = {2,0,-2,0};
int dy[4] = {0,2,0,-2};
struct S {
int x,y;
int dir;
}s_;
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);
const int mxN = (int)2e5 + 5;
int construct_roads(std::vector<int> x, std::vector<int> y) {
const int n = (int)x.size();
map<pair<int,int>,int>mp;
for(int i = 0 ; i < n ; i++)
mp[{x[i],y[i]}] = i;
vector<int>u(n-1),v(n-1),a(n-1),b(n-1);
set<pair<int,int>>processed;
stack<S>s;
s_.x = x[0], s_.y = y[0], s_.dir = 0;
processed.insert({x[0], y[0]});
s.push(s_);