oj.uz

Submission #1092243

# Submission time Handle Problem Language Result Execution time Memory
1092243 2024-09-23T15:55:20 Z TlenekWodoru Fountain Parks (IOI21_parks) C++17
55 / 100
 962 ms 126632 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++){g[i]=i;}
    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);
        }
    }
    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);
            }
        }
    }
    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;
    }
    return 0;
    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 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct
17 Correct 9 ms 30044 KB Output is correct
18 Correct 9 ms 30044 KB Output is correct
19 Correct 10 ms 30044 KB Output is correct
20 Correct 10 ms 30044 KB Output is correct
21 Correct 9 ms 30044 KB Output is correct
22 Correct 10 ms 30268 KB Output is correct
23 Correct 962 ms 126632 KB Output is correct
24 Correct 10 ms 30044 KB Output is correct
25 Correct 11 ms 30812 KB Output is correct
26 Correct 11 ms 30552 KB Output is correct
27 Correct 12 ms 30812 KB Output is correct
28 Correct 295 ms 68528 KB Output is correct
29 Correct 474 ms 88280 KB Output is correct
30 Correct 673 ms 107588 KB Output is correct
31 Correct 884 ms 126272 KB Output is correct
32 Correct 9 ms 30044 KB Output is correct
33 Correct 9 ms 30164 KB Output is correct
34 Correct 8 ms 30136 KB Output is correct
35 Correct 8 ms 30044 KB Output is correct
36 Correct 8 ms 30092 KB Output is correct
37 Correct 8 ms 30452 KB Output is correct
38 Correct 8 ms 30044 KB Output is correct
39 Correct 8 ms 30044 KB Output is correct
40 Correct 9 ms 30044 KB Output is correct
41 Correct 8 ms 30044 KB Output is correct
42 Correct 9 ms 30044 KB Output is correct
43 Correct 10 ms 30296 KB Output is correct
44 Correct 11 ms 30556 KB Output is correct
45 Correct 289 ms 69024 KB Output is correct
46 Correct 441 ms 86604 KB Output is correct
47 Correct 445 ms 86536 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct
17 Correct 9 ms 30044 KB Output is correct
18 Correct 9 ms 30044 KB Output is correct
19 Correct 10 ms 30044 KB Output is correct
20 Correct 10 ms 30044 KB Output is correct
21 Correct 9 ms 30044 KB Output is correct
22 Correct 10 ms 30268 KB Output is correct
23 Correct 962 ms 126632 KB Output is correct
24 Correct 10 ms 30044 KB Output is correct
25 Correct 11 ms 30812 KB Output is correct
26 Correct 11 ms 30552 KB Output is correct
27 Correct 12 ms 30812 KB Output is correct
28 Correct 295 ms 68528 KB Output is correct
29 Correct 474 ms 88280 KB Output is correct
30 Correct 673 ms 107588 KB Output is correct
31 Correct 884 ms 126272 KB Output is correct
32 Correct 9 ms 30044 KB Output is correct
33 Correct 9 ms 30164 KB Output is correct
34 Correct 8 ms 30136 KB Output is correct
35 Correct 8 ms 30044 KB Output is correct
36 Correct 8 ms 30092 KB Output is correct
37 Correct 8 ms 30452 KB Output is correct
38 Correct 8 ms 30044 KB Output is correct
39 Correct 8 ms 30044 KB Output is correct
40 Correct 9 ms 30044 KB Output is correct
41 Correct 8 ms 30044 KB Output is correct
42 Correct 9 ms 30044 KB Output is correct
43 Correct 10 ms 30296 KB Output is correct
44 Correct 11 ms 30556 KB Output is correct
45 Correct 289 ms 69024 KB Output is correct
46 Correct 441 ms 86604 KB Output is correct
47 Correct 445 ms 86536 KB Output is correct
48 Correct 8 ms 30044 KB Output is correct
49 Correct 8 ms 30044 KB Output is correct
50 Correct 9 ms 30040 KB Output is correct
51 Correct 9 ms 30044 KB Output is correct
52 Correct 8 ms 30088 KB Output is correct
53 Correct 8 ms 30044 KB Output is correct
54 Correct 12 ms 30240 KB Output is correct
55 Incorrect 958 ms 118424 KB Given structure is not connected: There is no path between vertices 0 and 3236
56 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct
17 Correct 8 ms 30044 KB Output is correct
18 Correct 8 ms 30200 KB Output is correct
19 Correct 8 ms 30044 KB Output is correct
20 Correct 689 ms 107848 KB Output is correct
21 Correct 765 ms 101444 KB Output is correct
22 Correct 641 ms 100928 KB Output is correct
23 Correct 591 ms 107348 KB Output is correct
24 Correct 168 ms 45800 KB Output is correct
25 Correct 286 ms 52300 KB Output is correct
26 Correct 244 ms 52304 KB Output is correct
27 Correct 692 ms 116904 KB Output is correct
28 Correct 739 ms 116900 KB Output is correct
29 Correct 727 ms 116908 KB Output is correct
30 Correct 735 ms 117164 KB Output is correct
31 Correct 8 ms 30044 KB Output is correct
32 Correct 38 ms 35668 KB Output is correct
33 Correct 81 ms 38076 KB Output is correct
34 Correct 731 ms 106304 KB Output is correct
35 Correct 22 ms 31320 KB Output is correct
36 Correct 66 ms 35764 KB Output is correct
37 Correct 135 ms 41556 KB Output is correct
38 Correct 253 ms 62916 KB Output is correct
39 Correct 398 ms 68632 KB Output is correct
40 Correct 525 ms 79708 KB Output is correct
41 Correct 646 ms 89400 KB Output is correct
42 Correct 700 ms 100008 KB Output is correct
43 Correct 10 ms 30044 KB Output is correct
44 Correct 8 ms 30044 KB Output is correct
45 Correct 9 ms 30184 KB Output is correct
46 Correct 9 ms 30044 KB Output is correct
47 Correct 9 ms 30092 KB Output is correct
48 Correct 9 ms 30040 KB Output is correct
49 Correct 9 ms 30200 KB Output is correct
50 Correct 8 ms 30044 KB Output is correct
51 Correct 9 ms 30252 KB Output is correct
52 Correct 8 ms 30044 KB Output is correct
53 Correct 8 ms 30036 KB Output is correct
54 Correct 10 ms 30296 KB Output is correct
55 Correct 11 ms 30556 KB Output is correct
56 Correct 289 ms 69000 KB Output is correct
57 Correct 433 ms 86556 KB Output is correct
58 Correct 494 ms 86444 KB Output is correct
59 Correct 10 ms 30044 KB Output is correct
60 Correct 10 ms 30176 KB Output is correct
61 Correct 9 ms 30044 KB Output is correct
62 Correct 738 ms 121508 KB Output is correct
63 Correct 763 ms 121768 KB Output is correct
64 Correct 757 ms 121772 KB Output is correct
65 Correct 10 ms 30556 KB Output is correct
66 Correct 13 ms 31064 KB Output is correct
67 Correct 323 ms 68792 KB Output is correct
68 Correct 568 ms 87116 KB Output is correct
69 Correct 839 ms 105124 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct
17 Correct 852 ms 123236 KB Output is correct
18 Correct 795 ms 122740 KB Output is correct
19 Correct 830 ms 101596 KB Output is correct
20 Correct 909 ms 111568 KB Output is correct
21 Correct 751 ms 105744 KB Output is correct
22 Correct 13 ms 30044 KB Output is correct
23 Correct 117 ms 42128 KB Output is correct
24 Correct 29 ms 32604 KB Output is correct
25 Correct 97 ms 38568 KB Output is correct
26 Correct 203 ms 44628 KB Output is correct
27 Correct 389 ms 72640 KB Output is correct
28 Correct 487 ms 79564 KB Output is correct
29 Correct 596 ms 90796 KB Output is correct
30 Correct 755 ms 99040 KB Output is correct
31 Correct 928 ms 108648 KB Output is correct
32 Correct 962 ms 116900 KB Output is correct
33 Correct 825 ms 123200 KB Output is correct
34 Correct 14 ms 30812 KB Output is correct
35 Correct 17 ms 31272 KB Output is correct
36 Correct 348 ms 70320 KB Output is correct
37 Correct 596 ms 92240 KB Output is correct
38 Correct 856 ms 110404 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 30044 KB Output is correct
2 Correct 9 ms 30064 KB Output is correct
3 Correct 9 ms 30040 KB Output is correct
4 Correct 10 ms 30244 KB Output is correct
5 Correct 11 ms 30044 KB Output is correct
6 Correct 10 ms 30044 KB Output is correct
7 Correct 11 ms 30068 KB Output is correct
8 Correct 9 ms 30044 KB Output is correct
9 Correct 291 ms 76472 KB Output is correct
10 Correct 25 ms 35160 KB Output is correct
11 Correct 110 ms 55240 KB Output is correct
12 Correct 32 ms 37464 KB Output is correct
13 Correct 33 ms 35924 KB Output is correct
14 Correct 9 ms 30296 KB Output is correct
15 Correct 11 ms 30300 KB Output is correct
16 Correct 305 ms 75448 KB Output is correct
17 Correct 9 ms 30044 KB Output is correct
18 Correct 9 ms 30044 KB Output is correct
19 Correct 10 ms 30044 KB Output is correct
20 Correct 10 ms 30044 KB Output is correct
21 Correct 9 ms 30044 KB Output is correct
22 Correct 10 ms 30268 KB Output is correct
23 Correct 962 ms 126632 KB Output is correct
24 Correct 10 ms 30044 KB Output is correct
25 Correct 11 ms 30812 KB Output is correct
26 Correct 11 ms 30552 KB Output is correct
27 Correct 12 ms 30812 KB Output is correct
28 Correct 295 ms 68528 KB Output is correct
29 Correct 474 ms 88280 KB Output is correct
30 Correct 673 ms 107588 KB Output is correct
31 Correct 884 ms 126272 KB Output is correct
32 Correct 9 ms 30044 KB Output is correct
33 Correct 9 ms 30164 KB Output is correct
34 Correct 8 ms 30136 KB Output is correct
35 Correct 8 ms 30044 KB Output is correct
36 Correct 8 ms 30092 KB Output is correct
37 Correct 8 ms 30452 KB Output is correct
38 Correct 8 ms 30044 KB Output is correct
39 Correct 8 ms 30044 KB Output is correct
40 Correct 9 ms 30044 KB Output is correct
41 Correct 8 ms 30044 KB Output is correct
42 Correct 9 ms 30044 KB Output is correct
43 Correct 10 ms 30296 KB Output is correct
44 Correct 11 ms 30556 KB Output is correct
45 Correct 289 ms 69024 KB Output is correct
46 Correct 441 ms 86604 KB Output is correct
47 Correct 445 ms 86536 KB Output is correct
48 Correct 8 ms 30044 KB Output is correct
49 Correct 8 ms 30044 KB Output is correct
50 Correct 9 ms 30040 KB Output is correct
51 Correct 9 ms 30044 KB Output is correct
52 Correct 8 ms 30088 KB Output is correct
53 Correct 8 ms 30044 KB Output is correct
54 Correct 12 ms 30240 KB Output is correct
55 Incorrect 958 ms 118424 KB Given structure is not connected: There is no path between vertices 0 and 3236
56 Halted 0 ms 0 KB -