oj.uz

Submission #1092288

# Submission time Handle Problem Language Result Execution time Memory
1092288 2024-09-23T17:19:50 Z TlenekWodoru Fountain Parks (IOI21_parks) C++17
55 / 100
 1014 ms 127048 KB 
#include<bits/stdc++.h>
#include "parks.h"
using namespace std;
struct Edge
{
    int som,ind;
};
map<pair<int,int>,int>M,M2;
vector<Edge>Graf[200009];
vector<int>D[1000009];
pair<int,int>KimJest[1000009];
bool zaj[1000009];
vector<int>Sprz;
int g[1000009];
int match[1000009];
int n,m=0,k=0,N,IleVert=0;
int f[200009],ilosc[200009];
int F(int v)
{
    if(f[v]==v){return v;}
    return f[v]=F(f[v]);
}
void Polacz(int a, int b)
{
    a=F(a);
    b=F(b);
    if(a==b){return;}
    if(ilosc[a]<ilosc[b]){swap(a,b);}
    ilosc[a]+=ilosc[b];
    f[b]=a;
}
bool DFS(int v)
{
    if(zaj[v]){return 0;}
    zaj[v]=1;
    Sprz.push_back(v);
    for(int som : D[v])
    {
        if(match[som]==-1||DFS(match[som]))
        {
            match[v]=som;
            match[som]=v;
            return 1;
        }
    }
    return 0;
}
void SKOJ()
{
    random_shuffle(g,g+N);
    for(int i=0;i<N;i++)
    {
        zaj[i]=0;
    }
    for(int i=0;i<N;i++)
    {break;
        int a=g[i];
        for(int b : D[a])
        {
            if(match[a]==-1&&match[b]==-1)
            {
                match[a]=b;
                match[b]=a;
            }
        }
    }
    random_shuffle(g,g+N);
    for(int i=0;i<N;i++)
    {
        int u=g[i];
        if(match[u]==-1)
        {
            DFS(u);
        }
        for(int temp : Sprz)
        {
            zaj[temp]=0;
        }
        Sprz.clear();
    }
}
void CzySpojna(int v)
{
    zaj[v]=1;
    IleVert++;
    for(auto[som,ind] : Graf[v])
    {
        if(zaj[som]){continue;}
        CzySpojna(som);
    }
}
int construct_roads(vector<int>X, vector<int>Y)
{
    srand(2137);
    n=(int)X.size();
    for(int i=0;i<n;i++)
    {
        M[{X[i],Y[i]}]=i;
    }
    for(int i=0;i<n;i++)
    {
        if(M.find({X[i]-2,Y[i]})!=M.end())
        {
            Graf[i].push_back({M[{X[i]-2,Y[i]}],m});
            Graf[M[{X[i]-2,Y[i]}]].push_back({i,m});
            m++;
        }
        if(M.find({X[i],Y[i]-2})!=M.end())
        {
            Graf[i].push_back({M[{X[i],Y[i]-2}],m});
            Graf[M[{X[i],Y[i]-2}]].push_back({i,m});
            m++;
        }
    }
    CzySpojna(0);
    if(IleVert!=n){return 0;}
    vector<pair<int,int>>E(m);
    for(int i=0;i<n;i++)
    {
        for(auto[som,ind] : Graf[i])
        {
            int a=i,b=som;
            if(pair<int,int>{X[a],Y[a]}>pair<int,int>{X[b],Y[b]}){continue;}
            E[ind]={a,b};
        }
    }
    for(int i=0;i<(int)E.size();i++)
    {
        const int a=E[i].first,b=E[i].second;
        vector<pair<int,int>>Som;
        if(Y[a]+2==Y[b])
        {
            Som.push_back({X[a]-1,Y[a]+1});
            Som.push_back({X[a]+1,Y[a]+1});
        }
        else if(X[a]+2==X[b])
        {
            Som.push_back({X[a]+1,Y[a]+1});
            Som.push_back({X[a]+1,Y[a]-1});
        }
        for(pair<int,int>som : Som)
        {
            if(M2.find(som)==M2.end())
            {
                KimJest[k]=som;
                M2[som]=k++;
            }
            int u=m+M2[som];
            D[i].push_back(u);
            D[u].push_back(i);
        }
    }
    N=m+k;
    for(int i=0;i<N;i++){match[i]=-1;}
for(int I=1;I<=10;I++)
{
    for(int i=0;i<N;i++){g[i]=i;}
    SKOJ();
    for(int i=0;i<n;i++)
    {
        f[i]=i;
        ilosc[i]=1;
    }
    for(int i=0;i<n;i++)
    {
        for(auto[som,ind] : Graf[i])
        {
            Polacz(i,som);
        }
    }
    if(ilosc[F(0)]==n)
    {
        vector<int>O1,O2,O3,O4;
        for(int j=0;j<m;j++)
        {
            const int a=E[j].first,b=E[j].second;
            if(match[j]!=-1)
            {
                pair<int,int>xd=KimJest[match[j]-m];
                O1.push_back(a);
                O2.push_back(b);
                O3.push_back(xd.first);
                O4.push_back(xd.second);
            }
        }
        build(O1,O2,O3,O4);
        return 1;
    }
    vector<int>U;
    for(int i=0;i<n;i++){g[i]=i;}
    random_shuffle(g,g+n);
    for(int i=0;i<n;i++)
    {
        const int u=g[i];
        for(auto[som,ind] : Graf[u])
        {
            if(match[ind]==-1&&F(u)!=F(som))
            {
                U.push_back(ind);
                Polacz(u,som);
            }
        }
    }
    build({(int)U.size()},{(int)U.size()},{69},{69});
    if(1==1)return 1;
    for(int i=0;i<N;i++){match[i]=-1;}
    for(int u : U)
    {
        for(int som : D[u])
        {
            if(match[u]==-1&&match[som]==-1)
            {
                match[u]=som;
                match[som]=u;
            }
        }
    }
}
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 10 ms 28508 KB Output is correct
19 Correct 11 ms 28632 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 11 ms 28404 KB Output is correct
22 Correct 11 ms 28504 KB Output is correct
23 Correct 970 ms 126688 KB Output is correct
24 Correct 15 ms 28504 KB Output is correct
25 Correct 13 ms 29160 KB Output is correct
26 Correct 13 ms 29020 KB Output is correct
27 Correct 14 ms 29216 KB Output is correct
28 Correct 297 ms 67664 KB Output is correct
29 Correct 507 ms 87504 KB Output is correct
30 Correct 774 ms 106248 KB Output is correct
31 Correct 1014 ms 127048 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 12 ms 28504 KB Output is correct
34 Correct 12 ms 28508 KB Output is correct
35 Correct 11 ms 28504 KB Output is correct
36 Correct 12 ms 28508 KB Output is correct
37 Correct 13 ms 28624 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 12 ms 28508 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 13 ms 28764 KB Output is correct
42 Correct 12 ms 28508 KB Output is correct
43 Correct 13 ms 28764 KB Output is correct
44 Correct 18 ms 29276 KB Output is correct
45 Correct 299 ms 68284 KB Output is correct
46 Correct 468 ms 86184 KB Output is correct
47 Correct 456 ms 86096 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 10 ms 28508 KB Output is correct
19 Correct 11 ms 28632 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 11 ms 28404 KB Output is correct
22 Correct 11 ms 28504 KB Output is correct
23 Correct 970 ms 126688 KB Output is correct
24 Correct 15 ms 28504 KB Output is correct
25 Correct 13 ms 29160 KB Output is correct
26 Correct 13 ms 29020 KB Output is correct
27 Correct 14 ms 29216 KB Output is correct
28 Correct 297 ms 67664 KB Output is correct
29 Correct 507 ms 87504 KB Output is correct
30 Correct 774 ms 106248 KB Output is correct
31 Correct 1014 ms 127048 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 12 ms 28504 KB Output is correct
34 Correct 12 ms 28508 KB Output is correct
35 Correct 11 ms 28504 KB Output is correct
36 Correct 12 ms 28508 KB Output is correct
37 Correct 13 ms 28624 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 12 ms 28508 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 13 ms 28764 KB Output is correct
42 Correct 12 ms 28508 KB Output is correct
43 Correct 13 ms 28764 KB Output is correct
44 Correct 18 ms 29276 KB Output is correct
45 Correct 299 ms 68284 KB Output is correct
46 Correct 468 ms 86184 KB Output is correct
47 Correct 456 ms 86096 KB Output is correct
48 Correct 10 ms 28508 KB Output is correct
49 Correct 10 ms 28484 KB Output is correct
50 Correct 11 ms 28508 KB Output is correct
51 Correct 11 ms 28508 KB Output is correct
52 Correct 11 ms 28504 KB Output is correct
53 Correct 12 ms 28472 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 1000 ms 118556 KB Given structure is not connected: There is no path between vertices 0 and 239
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct
17 Correct 11 ms 28508 KB Output is correct
18 Correct 12 ms 28508 KB Output is correct
19 Correct 12 ms 28504 KB Output is correct
20 Correct 741 ms 105808 KB Output is correct
21 Correct 795 ms 102108 KB Output is correct
22 Correct 705 ms 102188 KB Output is correct
23 Correct 582 ms 107616 KB Output is correct
24 Correct 175 ms 45904 KB Output is correct
25 Correct 311 ms 52304 KB Output is correct
26 Correct 301 ms 52316 KB Output is correct
27 Correct 756 ms 117064 KB Output is correct
28 Correct 737 ms 116908 KB Output is correct
29 Correct 706 ms 117028 KB Output is correct
30 Correct 728 ms 117048 KB Output is correct
31 Correct 13 ms 28640 KB Output is correct
32 Correct 43 ms 34268 KB Output is correct
33 Correct 92 ms 37716 KB Output is correct
34 Correct 804 ms 107336 KB Output is correct
35 Correct 20 ms 29784 KB Output is correct
36 Correct 64 ms 34896 KB Output is correct
37 Correct 127 ms 41300 KB Output is correct
38 Correct 244 ms 57528 KB Output is correct
39 Correct 346 ms 68384 KB Output is correct
40 Correct 484 ms 79212 KB Output is correct
41 Correct 626 ms 90080 KB Output is correct
42 Correct 767 ms 100744 KB Output is correct
43 Correct 11 ms 28508 KB Output is correct
44 Correct 12 ms 28508 KB Output is correct
45 Correct 14 ms 28528 KB Output is correct
46 Correct 11 ms 28508 KB Output is correct
47 Correct 11 ms 28584 KB Output is correct
48 Correct 12 ms 28564 KB Output is correct
49 Correct 11 ms 28508 KB Output is correct
50 Correct 11 ms 28508 KB Output is correct
51 Correct 13 ms 28508 KB Output is correct
52 Correct 13 ms 28428 KB Output is correct
53 Correct 12 ms 28508 KB Output is correct
54 Correct 13 ms 28756 KB Output is correct
55 Correct 13 ms 28764 KB Output is correct
56 Correct 306 ms 68252 KB Output is correct
57 Correct 456 ms 86184 KB Output is correct
58 Correct 474 ms 86180 KB Output is correct
59 Correct 12 ms 28508 KB Output is correct
60 Correct 12 ms 28508 KB Output is correct
61 Correct 12 ms 28508 KB Output is correct
62 Correct 674 ms 121516 KB Output is correct
63 Correct 678 ms 121516 KB Output is correct
64 Correct 667 ms 121880 KB Output is correct
65 Correct 13 ms 29020 KB Output is correct
66 Correct 16 ms 29532 KB Output is correct
67 Correct 284 ms 66748 KB Output is correct
68 Correct 494 ms 86700 KB Output is correct
69 Correct 743 ms 105132 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct
17 Correct 694 ms 123564 KB Output is correct
18 Correct 696 ms 123192 KB Output is correct
19 Correct 777 ms 105160 KB Output is correct
20 Correct 844 ms 109240 KB Output is correct
21 Correct 699 ms 105528 KB Output is correct
22 Correct 12 ms 28508 KB Output is correct
23 Correct 91 ms 40868 KB Output is correct
24 Correct 31 ms 31312 KB Output is correct
25 Correct 98 ms 37876 KB Output is correct
26 Correct 168 ms 44356 KB Output is correct
27 Correct 338 ms 69052 KB Output is correct
28 Correct 450 ms 79532 KB Output is correct
29 Correct 557 ms 89512 KB Output is correct
30 Correct 694 ms 99460 KB Output is correct
31 Correct 894 ms 109728 KB Output is correct
32 Correct 900 ms 116820 KB Output is correct
33 Correct 787 ms 122692 KB Output is correct
34 Correct 18 ms 29276 KB Output is correct
35 Correct 19 ms 29796 KB Output is correct
36 Correct 347 ms 69308 KB Output is correct
37 Correct 556 ms 90156 KB Output is correct
38 Correct 732 ms 110504 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28488 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 11 ms 28636 KB Output is correct
5 Correct 12 ms 28492 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28640 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 321 ms 75692 KB Output is correct
10 Correct 27 ms 33576 KB Output is correct
11 Correct 133 ms 54220 KB Output is correct
12 Correct 35 ms 35920 KB Output is correct
13 Correct 36 ms 34640 KB Output is correct
14 Correct 12 ms 28504 KB Output is correct
15 Correct 14 ms 28764 KB Output is correct
16 Correct 298 ms 74348 KB Output is correct
17 Correct 12 ms 28508 KB Output is correct
18 Correct 10 ms 28508 KB Output is correct
19 Correct 11 ms 28632 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 11 ms 28404 KB Output is correct
22 Correct 11 ms 28504 KB Output is correct
23 Correct 970 ms 126688 KB Output is correct
24 Correct 15 ms 28504 KB Output is correct
25 Correct 13 ms 29160 KB Output is correct
26 Correct 13 ms 29020 KB Output is correct
27 Correct 14 ms 29216 KB Output is correct
28 Correct 297 ms 67664 KB Output is correct
29 Correct 507 ms 87504 KB Output is correct
30 Correct 774 ms 106248 KB Output is correct
31 Correct 1014 ms 127048 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 12 ms 28504 KB Output is correct
34 Correct 12 ms 28508 KB Output is correct
35 Correct 11 ms 28504 KB Output is correct
36 Correct 12 ms 28508 KB Output is correct
37 Correct 13 ms 28624 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 12 ms 28508 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 13 ms 28764 KB Output is correct
42 Correct 12 ms 28508 KB Output is correct
43 Correct 13 ms 28764 KB Output is correct
44 Correct 18 ms 29276 KB Output is correct
45 Correct 299 ms 68284 KB Output is correct
46 Correct 468 ms 86184 KB Output is correct
47 Correct 456 ms 86096 KB Output is correct
48 Correct 10 ms 28508 KB Output is correct
49 Correct 10 ms 28484 KB Output is correct
50 Correct 11 ms 28508 KB Output is correct
51 Correct 11 ms 28508 KB Output is correct
52 Correct 11 ms 28504 KB Output is correct
53 Correct 12 ms 28472 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 1000 ms 118556 KB Given structure is not connected: There is no path between vertices 0 and 239
56 Halted 0 ms 0 KB -