Submission #1011766

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1011766	2024-07-01 08:09:46	bachhoangxuan	Fountain Parks (IOI21_parks)	C++17	100 / 100	470 ms	29908 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 dx[]={0,0,2,-2},
    dy[]={2,-2,0,0};
int construct_roads(std::vector<int> X, std::vector<int> Y) {
    int N=(int)X.size();
    vector<int> U,V,A,B;
    map<pair<int,int>,int> mp;
    for(int i=0;i<N;i++) mp[{X[i],Y[i]}]=i;
    int cnt=0;
    vector<bool> vis(N);
    queue<int> q;
    q.push(0);vis[0]=1;
    while(!q.empty()){
        int u=q.front();q.pop();cnt++;
        for(int t=0;t<4;t++){
            int xt=X[u]+dx[t],yt=Y[u]+dy[t];
            if(mp.count({xt,yt})){
                int v=mp[{xt,yt}];
                if(!vis[v]) q.push(v),vis[v]=1;
            }
        }
    }
    if(cnt!=N) return 0;
    for(int i=0;i<N;i++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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