Submission #565833

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
565833	2022-05-21 11:52:34	PiejanVDC	Fountain Parks (IOI21_parks)	C++17	15 / 100	677 ms	36368 KiB

parks

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
void build(vector<int>u, vector<int>v, vector<int>a, vector<int>b);
int construct_roads(std::vector<int> x, std::vector<int> y) {
  const int n = (int)x.size();
  set<pair<int,int>>s;
  set<pair<int,int>>t;
  map<pair<int,int>,int>id;
  for(int i = 0 ; i < n ; i++)
    s.insert({x[i], y[i]}), id[{x[i], y[i]}] = i;
  stack<pair<pair<int,int>, int>>st;
  st.push({{x[0], y[0]}, 0});
  s.erase(s.find({x[0], y[0]}));
  vector<int>u,v,a,b;
  auto process = [&] (int X, int Y, int T) -> void {
    s.erase(s.find({X,Y}));
    u.push_back(id[{X,Y}]);
    st.push({{X, Y}, T&1});
    if(T == 0) {
      v.push_back(id[{X-2,Y}]);
      if(t.count({X-1, Y+1}))
        t.insert({X-1, Y-1}), a.push_back(X-1), b.push_back(Y-1);
      else
        t.insert({X-1, Y+1}), a.push_back(X-1), b.push_back(Y+1);
    } else if(T == 1) {
      v.push_back(id[{X,Y+2}]);
      if(t.count({X+1, Y+1}))
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30