oj.uz

Submission #1092274

# Submission time Handle Problem Language Result Execution time Memory
1092274 2024-09-23T16:37:17 Z TlenekWodoru Fountain Parks (IOI21_parks) C++17
55 / 100
 2463 ms 126652 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++)
    {
        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])
        {
            if(match[ind]==-1){continue;}
            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);
            }
        }
    }
    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 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct
17 Correct 10 ms 28508 KB Output is correct
18 Correct 10 ms 28448 KB Output is correct
19 Correct 10 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 13 ms 28508 KB Output is correct
22 Correct 11 ms 28508 KB Output is correct
23 Correct 973 ms 126652 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 14 ms 29020 KB Output is correct
26 Correct 14 ms 29020 KB Output is correct
27 Correct 15 ms 29020 KB Output is correct
28 Correct 303 ms 67556 KB Output is correct
29 Correct 547 ms 87624 KB Output is correct
30 Correct 743 ms 107344 KB Output is correct
31 Correct 974 ms 125808 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28664 KB Output is correct
34 Correct 12 ms 28632 KB Output is correct
35 Correct 11 ms 28432 KB Output is correct
36 Correct 11 ms 28508 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 11 ms 28656 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 11 ms 28508 KB Output is correct
42 Correct 10 ms 28508 KB Output is correct
43 Correct 12 ms 28764 KB Output is correct
44 Correct 13 ms 28920 KB Output is correct
45 Correct 292 ms 68280 KB Output is correct
46 Correct 442 ms 86372 KB Output is correct
47 Correct 452 ms 86184 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct
17 Correct 10 ms 28508 KB Output is correct
18 Correct 10 ms 28448 KB Output is correct
19 Correct 10 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 13 ms 28508 KB Output is correct
22 Correct 11 ms 28508 KB Output is correct
23 Correct 973 ms 126652 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 14 ms 29020 KB Output is correct
26 Correct 14 ms 29020 KB Output is correct
27 Correct 15 ms 29020 KB Output is correct
28 Correct 303 ms 67556 KB Output is correct
29 Correct 547 ms 87624 KB Output is correct
30 Correct 743 ms 107344 KB Output is correct
31 Correct 974 ms 125808 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28664 KB Output is correct
34 Correct 12 ms 28632 KB Output is correct
35 Correct 11 ms 28432 KB Output is correct
36 Correct 11 ms 28508 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 11 ms 28656 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 11 ms 28508 KB Output is correct
42 Correct 10 ms 28508 KB Output is correct
43 Correct 12 ms 28764 KB Output is correct
44 Correct 13 ms 28920 KB Output is correct
45 Correct 292 ms 68280 KB Output is correct
46 Correct 442 ms 86372 KB Output is correct
47 Correct 452 ms 86184 KB Output is correct
48 Correct 12 ms 28508 KB Output is correct
49 Correct 12 ms 28508 KB Output is correct
50 Correct 10 ms 28508 KB Output is correct
51 Correct 11 ms 28508 KB Output is correct
52 Correct 11 ms 28508 KB Output is correct
53 Correct 12 ms 28588 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 2463 ms 105812 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct
17 Correct 11 ms 28508 KB Output is correct
18 Correct 10 ms 28504 KB Output is correct
19 Correct 10 ms 28432 KB Output is correct
20 Correct 689 ms 108616 KB Output is correct
21 Correct 759 ms 101684 KB Output is correct
22 Correct 690 ms 101300 KB Output is correct
23 Correct 575 ms 107332 KB Output is correct
24 Correct 160 ms 45740 KB Output is correct
25 Correct 299 ms 52052 KB Output is correct
26 Correct 291 ms 52052 KB Output is correct
27 Correct 772 ms 116908 KB Output is correct
28 Correct 725 ms 116908 KB Output is correct
29 Correct 738 ms 116756 KB Output is correct
30 Correct 686 ms 116908 KB Output is correct
31 Correct 10 ms 28508 KB Output is correct
32 Correct 40 ms 34388 KB Output is correct
33 Correct 79 ms 37712 KB Output is correct
34 Correct 690 ms 107072 KB Output is correct
35 Correct 18 ms 29788 KB Output is correct
36 Correct 76 ms 34980 KB Output is correct
37 Correct 148 ms 41136 KB Output is correct
38 Correct 252 ms 57532 KB Output is correct
39 Correct 407 ms 68448 KB Output is correct
40 Correct 521 ms 78988 KB Output is correct
41 Correct 685 ms 89816 KB Output is correct
42 Correct 838 ms 100524 KB Output is correct
43 Correct 12 ms 28508 KB Output is correct
44 Correct 15 ms 28508 KB Output is correct
45 Correct 11 ms 28504 KB Output is correct
46 Correct 11 ms 28464 KB Output is correct
47 Correct 11 ms 28508 KB Output is correct
48 Correct 10 ms 28508 KB Output is correct
49 Correct 11 ms 28508 KB Output is correct
50 Correct 13 ms 28508 KB Output is correct
51 Correct 15 ms 28620 KB Output is correct
52 Correct 11 ms 28520 KB Output is correct
53 Correct 11 ms 28588 KB Output is correct
54 Correct 12 ms 28760 KB Output is correct
55 Correct 12 ms 28988 KB Output is correct
56 Correct 327 ms 68160 KB Output is correct
57 Correct 520 ms 86184 KB Output is correct
58 Correct 504 ms 85932 KB Output is correct
59 Correct 16 ms 28508 KB Output is correct
60 Correct 12 ms 28584 KB Output is correct
61 Correct 11 ms 28504 KB Output is correct
62 Correct 684 ms 121440 KB Output is correct
63 Correct 685 ms 121768 KB Output is correct
64 Correct 695 ms 121776 KB Output is correct
65 Correct 13 ms 29020 KB Output is correct
66 Correct 17 ms 29532 KB Output is correct
67 Correct 298 ms 66848 KB Output is correct
68 Correct 472 ms 86696 KB Output is correct
69 Correct 737 ms 104920 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct
17 Correct 723 ms 122792 KB Output is correct
18 Correct 748 ms 122536 KB Output is correct
19 Correct 723 ms 101468 KB Output is correct
20 Correct 790 ms 109792 KB Output is correct
21 Correct 667 ms 105240 KB Output is correct
22 Correct 11 ms 28508 KB Output is correct
23 Correct 95 ms 40756 KB Output is correct
24 Correct 31 ms 31316 KB Output is correct
25 Correct 106 ms 37628 KB Output is correct
26 Correct 175 ms 44116 KB Output is correct
27 Correct 368 ms 68796 KB Output is correct
28 Correct 454 ms 79036 KB Output is correct
29 Correct 568 ms 89000 KB Output is correct
30 Correct 653 ms 98732 KB Output is correct
31 Correct 758 ms 108816 KB Output is correct
32 Correct 776 ms 116656 KB Output is correct
33 Correct 729 ms 122792 KB Output is correct
34 Correct 14 ms 29276 KB Output is correct
35 Correct 19 ms 29788 KB Output is correct
36 Correct 321 ms 69272 KB Output is correct
37 Correct 538 ms 90108 KB Output is correct
38 Correct 769 ms 110248 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 28508 KB Output is correct
2 Correct 10 ms 28628 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 14 ms 28664 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 11 ms 28500 KB Output is correct
8 Correct 11 ms 28528 KB Output is correct
9 Correct 324 ms 75708 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 113 ms 54220 KB Output is correct
12 Correct 33 ms 35932 KB Output is correct
13 Correct 35 ms 34776 KB Output is correct
14 Correct 11 ms 28760 KB Output is correct
15 Correct 11 ms 28760 KB Output is correct
16 Correct 297 ms 74420 KB Output is correct
17 Correct 10 ms 28508 KB Output is correct
18 Correct 10 ms 28448 KB Output is correct
19 Correct 10 ms 28508 KB Output is correct
20 Correct 14 ms 28508 KB Output is correct
21 Correct 13 ms 28508 KB Output is correct
22 Correct 11 ms 28508 KB Output is correct
23 Correct 973 ms 126652 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 14 ms 29020 KB Output is correct
26 Correct 14 ms 29020 KB Output is correct
27 Correct 15 ms 29020 KB Output is correct
28 Correct 303 ms 67556 KB Output is correct
29 Correct 547 ms 87624 KB Output is correct
30 Correct 743 ms 107344 KB Output is correct
31 Correct 974 ms 125808 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28664 KB Output is correct
34 Correct 12 ms 28632 KB Output is correct
35 Correct 11 ms 28432 KB Output is correct
36 Correct 11 ms 28508 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 11 ms 28656 KB Output is correct
40 Correct 12 ms 28508 KB Output is correct
41 Correct 11 ms 28508 KB Output is correct
42 Correct 10 ms 28508 KB Output is correct
43 Correct 12 ms 28764 KB Output is correct
44 Correct 13 ms 28920 KB Output is correct
45 Correct 292 ms 68280 KB Output is correct
46 Correct 442 ms 86372 KB Output is correct
47 Correct 452 ms 86184 KB Output is correct
48 Correct 12 ms 28508 KB Output is correct
49 Correct 12 ms 28508 KB Output is correct
50 Correct 10 ms 28508 KB Output is correct
51 Correct 11 ms 28508 KB Output is correct
52 Correct 11 ms 28508 KB Output is correct
53 Correct 12 ms 28588 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 2463 ms 105812 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -