Submission #1044579

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1044579	2024-08-05 11:01:49	Unforgettablepl	Fountain Parks (IOI21_parks)	C++17	15 / 100	584 ms	75940 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 "parks.h"
#include <bits/stdc++.h>
using namespace std;
int construct_roads(vector<int> x,vector<int> y){
  int n = x.size();
  map<pair<int,int>,int> lookup;
  for(int i=0;i<n;i++)lookup[{x[i],y[i]}]=i;
  vector<int> u,v,a,b;
  vector<vector<int>> adj(n);
  for(int i=0;i<n;i++){
    if(lookup[{x[i]+2,y[i]}]>i){
      u.emplace_back(i);
      v.emplace_back(lookup[{x[i]+2,y[i]}]);
      adj[i].emplace_back(lookup[{x[i]+2,y[i]}]);
      adj[lookup[{x[i]+2,y[i]}]].emplace_back(i);
      a.emplace_back(x[i]+1);
      b.emplace_back(y[i]-1);
    }
    if(lookup[{x[i]-2,y[i]}]>i){
      u.emplace_back(i);
      v.emplace_back(lookup[{x[i]-2,y[i]}]);
      adj[i].emplace_back(lookup[{x[i]-2,y[i]}]);
      adj[lookup[{x[i]-2,y[i]}]].emplace_back(i);
      a.emplace_back(x[i]-1);
      b.emplace_back(y[i]-1);
    }
    if(lookup[{x[i],y[i]+2}]>i){
      u.emplace_back(i);
      v.emplace_back(lookup[{x[i],y[i]+2}]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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