oj.uz

Submission #1092268

# Submission time Handle Problem Language Result Execution time Memory
1092268 2024-09-23T16:19:32 Z TlenekWodoru Fountain Parks (IOI21_parks) C++17
55 / 100
 1161 ms 123656 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++)
    {
        match[i]=-1;
        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 Upgrade(int v)
{
    zaj[v]=1;
    Sprz.push_back(v);
    for(int som : D[v])
    {
        if(zaj[match[som]]==0)
        {
            Upgrade(match[som]);
            match[v]=som;
            match[som]=v;
            return;
        }
        else if(match[som]!=v)
        {
            break;
        }
    }
    for(int u : Sprz){zaj[u]=0;}
    Sprz.clear();
    match[v]=-1;
}
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++)
    {
        random_shuffle(Graf[i].begin(),Graf[i].end());
    }
    for(int i=0;i<N;i++)
    {
        random_shuffle(D[i].begin(),D[i].end());
    }
    SKOJ();
for(int I=1;I<=10;I++)
{
    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 u : U)
    {
        if(match[u]!=-1){continue;}
        Upgrade(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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 KB Output is correct
17 Correct 13 ms 28504 KB Output is correct
18 Correct 11 ms 28508 KB Output is correct
19 Correct 12 ms 28508 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 12 ms 28508 KB Output is correct
22 Correct 12 ms 28508 KB Output is correct
23 Correct 925 ms 118348 KB Output is correct
24 Correct 13 ms 28508 KB Output is correct
25 Correct 14 ms 29040 KB Output is correct
26 Correct 14 ms 29016 KB Output is correct
27 Correct 22 ms 29016 KB Output is correct
28 Correct 297 ms 64832 KB Output is correct
29 Correct 481 ms 81600 KB Output is correct
30 Correct 669 ms 100888 KB Output is correct
31 Correct 932 ms 118072 KB Output is correct
32 Correct 13 ms 28508 KB Output is correct
33 Correct 12 ms 28436 KB Output is correct
34 Correct 19 ms 28504 KB Output is correct
35 Correct 12 ms 28504 KB Output is correct
36 Correct 12 ms 28436 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 13 ms 28460 KB Output is correct
40 Correct 11 ms 28540 KB Output is correct
41 Correct 13 ms 28504 KB Output is correct
42 Correct 12 ms 28488 KB Output is correct
43 Correct 14 ms 28760 KB Output is correct
44 Correct 15 ms 28760 KB Output is correct
45 Correct 329 ms 68364 KB Output is correct
46 Correct 475 ms 86952 KB Output is correct
47 Correct 467 ms 86952 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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 KB Output is correct
17 Correct 13 ms 28504 KB Output is correct
18 Correct 11 ms 28508 KB Output is correct
19 Correct 12 ms 28508 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 12 ms 28508 KB Output is correct
22 Correct 12 ms 28508 KB Output is correct
23 Correct 925 ms 118348 KB Output is correct
24 Correct 13 ms 28508 KB Output is correct
25 Correct 14 ms 29040 KB Output is correct
26 Correct 14 ms 29016 KB Output is correct
27 Correct 22 ms 29016 KB Output is correct
28 Correct 297 ms 64832 KB Output is correct
29 Correct 481 ms 81600 KB Output is correct
30 Correct 669 ms 100888 KB Output is correct
31 Correct 932 ms 118072 KB Output is correct
32 Correct 13 ms 28508 KB Output is correct
33 Correct 12 ms 28436 KB Output is correct
34 Correct 19 ms 28504 KB Output is correct
35 Correct 12 ms 28504 KB Output is correct
36 Correct 12 ms 28436 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 13 ms 28460 KB Output is correct
40 Correct 11 ms 28540 KB Output is correct
41 Correct 13 ms 28504 KB Output is correct
42 Correct 12 ms 28488 KB Output is correct
43 Correct 14 ms 28760 KB Output is correct
44 Correct 15 ms 28760 KB Output is correct
45 Correct 329 ms 68364 KB Output is correct
46 Correct 475 ms 86952 KB Output is correct
47 Correct 467 ms 86952 KB Output is correct
48 Correct 11 ms 28504 KB Output is correct
49 Correct 11 ms 28508 KB Output is correct
50 Correct 11 ms 28508 KB Output is correct
51 Correct 11 ms 28472 KB Output is correct
52 Correct 11 ms 28504 KB Output is correct
53 Correct 11 ms 28508 KB Output is correct
54 Correct 11 ms 28544 KB Output is correct
55 Incorrect 1161 ms 105392 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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 KB Output is correct
17 Correct 12 ms 28504 KB Output is correct
18 Correct 13 ms 28508 KB Output is correct
19 Correct 12 ms 28504 KB Output is correct
20 Correct 724 ms 103804 KB Output is correct
21 Correct 958 ms 100576 KB Output is correct
22 Correct 876 ms 99956 KB Output is correct
23 Correct 614 ms 107900 KB Output is correct
24 Correct 182 ms 44112 KB Output is correct
25 Correct 317 ms 50520 KB Output is correct
26 Correct 323 ms 52588 KB Output is correct
27 Correct 791 ms 116968 KB Output is correct
28 Correct 837 ms 117112 KB Output is correct
29 Correct 808 ms 116956 KB Output is correct
30 Correct 832 ms 117084 KB Output is correct
31 Correct 12 ms 28504 KB Output is correct
32 Correct 47 ms 34160 KB Output is correct
33 Correct 88 ms 36220 KB Output is correct
34 Correct 863 ms 101612 KB Output is correct
35 Correct 25 ms 29784 KB Output is correct
36 Correct 71 ms 34388 KB Output is correct
37 Correct 139 ms 40020 KB Output is correct
38 Correct 266 ms 57764 KB Output is correct
39 Correct 367 ms 68192 KB Output is correct
40 Correct 500 ms 80120 KB Output is correct
41 Correct 583 ms 90504 KB Output is correct
42 Correct 697 ms 100976 KB Output is correct
43 Correct 12 ms 28508 KB Output is correct
44 Correct 11 ms 28508 KB Output is correct
45 Correct 11 ms 28508 KB Output is correct
46 Correct 11 ms 28524 KB Output is correct
47 Correct 11 ms 28508 KB Output is correct
48 Correct 11 ms 28508 KB Output is correct
49 Correct 11 ms 28504 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 28508 KB Output is correct
53 Correct 11 ms 28508 KB Output is correct
54 Correct 12 ms 28764 KB Output is correct
55 Correct 13 ms 28876 KB Output is correct
56 Correct 329 ms 68132 KB Output is correct
57 Correct 486 ms 87208 KB Output is correct
58 Correct 483 ms 86760 KB Output is correct
59 Correct 14 ms 28504 KB Output is correct
60 Correct 12 ms 28648 KB Output is correct
61 Correct 18 ms 28508 KB Output is correct
62 Correct 707 ms 121424 KB Output is correct
63 Correct 708 ms 121732 KB Output is correct
64 Correct 698 ms 121940 KB Output is correct
65 Correct 14 ms 29016 KB Output is correct
66 Correct 17 ms 29508 KB Output is correct
67 Correct 298 ms 66792 KB Output is correct
68 Correct 485 ms 87416 KB Output is correct
69 Correct 691 ms 105076 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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 KB Output is correct
17 Correct 757 ms 123656 KB Output is correct
18 Correct 786 ms 123252 KB Output is correct
19 Correct 756 ms 101920 KB Output is correct
20 Correct 835 ms 106572 KB Output is correct
21 Correct 669 ms 104888 KB Output is correct
22 Correct 11 ms 28504 KB Output is correct
23 Correct 93 ms 40212 KB Output is correct
24 Correct 31 ms 31056 KB Output is correct
25 Correct 93 ms 36948 KB Output is correct
26 Correct 188 ms 43092 KB Output is correct
27 Correct 375 ms 67988 KB Output is correct
28 Correct 468 ms 77680 KB Output is correct
29 Correct 618 ms 88552 KB Output is correct
30 Correct 716 ms 97820 KB Output is correct
31 Correct 888 ms 107512 KB Output is correct
32 Correct 834 ms 114916 KB Output is correct
33 Correct 690 ms 123424 KB Output is correct
34 Correct 16 ms 29016 KB Output is correct
35 Correct 18 ms 29628 KB Output is correct
36 Correct 315 ms 68820 KB Output is correct
37 Correct 516 ms 90088 KB Output is correct
38 Correct 791 ms 109524 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 11 ms 28508 KB Output is correct
3 Correct 11 ms 28420 KB Output is correct
4 Correct 11 ms 28556 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 11 ms 28508 KB Output is correct
7 Correct 11 ms 28508 KB Output is correct
8 Correct 11 ms 28520 KB Output is correct
9 Correct 301 ms 75500 KB Output is correct
10 Correct 27 ms 33372 KB Output is correct
11 Correct 114 ms 53876 KB Output is correct
12 Correct 44 ms 35664 KB Output is correct
13 Correct 40 ms 34384 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 14 ms 28676 KB Output is correct
16 Correct 305 ms 74304 KB Output is correct
17 Correct 13 ms 28504 KB Output is correct
18 Correct 11 ms 28508 KB Output is correct
19 Correct 12 ms 28508 KB Output is correct
20 Correct 12 ms 28508 KB Output is correct
21 Correct 12 ms 28508 KB Output is correct
22 Correct 12 ms 28508 KB Output is correct
23 Correct 925 ms 118348 KB Output is correct
24 Correct 13 ms 28508 KB Output is correct
25 Correct 14 ms 29040 KB Output is correct
26 Correct 14 ms 29016 KB Output is correct
27 Correct 22 ms 29016 KB Output is correct
28 Correct 297 ms 64832 KB Output is correct
29 Correct 481 ms 81600 KB Output is correct
30 Correct 669 ms 100888 KB Output is correct
31 Correct 932 ms 118072 KB Output is correct
32 Correct 13 ms 28508 KB Output is correct
33 Correct 12 ms 28436 KB Output is correct
34 Correct 19 ms 28504 KB Output is correct
35 Correct 12 ms 28504 KB Output is correct
36 Correct 12 ms 28436 KB Output is correct
37 Correct 12 ms 28508 KB Output is correct
38 Correct 12 ms 28508 KB Output is correct
39 Correct 13 ms 28460 KB Output is correct
40 Correct 11 ms 28540 KB Output is correct
41 Correct 13 ms 28504 KB Output is correct
42 Correct 12 ms 28488 KB Output is correct
43 Correct 14 ms 28760 KB Output is correct
44 Correct 15 ms 28760 KB Output is correct
45 Correct 329 ms 68364 KB Output is correct
46 Correct 475 ms 86952 KB Output is correct
47 Correct 467 ms 86952 KB Output is correct
48 Correct 11 ms 28504 KB Output is correct
49 Correct 11 ms 28508 KB Output is correct
50 Correct 11 ms 28508 KB Output is correct
51 Correct 11 ms 28472 KB Output is correct
52 Correct 11 ms 28504 KB Output is correct
53 Correct 11 ms 28508 KB Output is correct
54 Correct 11 ms 28544 KB Output is correct
55 Incorrect 1161 ms 105392 KB Solution announced impossible, but it is possible.
56 Halted 0 ms 0 KB -