Submission #567544

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
567544	2022-05-23 16:57:44	PiejanVDC	Fountain Parks (IOI21_parks)	C++17	5 / 100	593 ms	36892 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> xx, std::vector<int> yy) {
  const int n = (int)xx.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({xx[i], yy[i]}), id[{xx[i], yy[i]}] = i;
  int F,S;
  for(int i = 0 ; i < n ; i++) {
    if(!s.count({xx[i]-2, yy[i]}))
      F = xx[i], S = yy[i];
  }
  queue<pair<pair<int,int>, int>>st;
  st.push({{F, S}, 0});
  
  s.erase(s.find({F, S}));
  vector<int>u,v,a,b;
  auto process = [&] (int X, int Y, int T) -> void {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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