Submission #551102

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
551102	2022-04-19 21:52:27	1ne	Fountain Parks (IOI21_parks)	C++17	15 / 100	1029 ms	116396 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;
struct edges{
  int x,y,x1,y1;
};
int construct_roads(std::vector<int> x, std::vector<int> y) {
   map<pair<int,int>,bool>mp,got,have;
   map<pair<int,int>,int>index;
   int n = (int)x.size();
   for (int i = 0;i<n;++i){
     mp[{x[i],y[i]}] = true;
     got[{x[i],y[i]}] = false;
     index[{x[i],y[i]}] = i;
   }
   auto comp = [&](int a,int b,int c,int d){
    if (a<c){
      return (edges){a,b,c,d};
    }
    else if (c < a){
        return (edges){c,d,a,b};
    }
    else if ( b < d){
      return (edges){a,b,c,d};
    }
    return (edges){c,d,a,b};
   };
   vector<edges>ans;
   vector<int>dx = {2,0,-2,0};
   vector<int>dy = {0,2,0,-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