oj.uz

답안 #1092296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092296 2024-09-23T17:50:38 Z TlenekWodoru 분수 공원 (IOI21_parks) C++17
55 / 100
 1071 ms 127004 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);
        //build({},{},{},{});
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct
17 Correct 11 ms 28504 KB Output is correct
18 Correct 15 ms 28692 KB Output is correct
19 Correct 11 ms 28508 KB Output is correct
20 Correct 11 ms 28508 KB Output is correct
21 Correct 12 ms 28504 KB Output is correct
22 Correct 12 ms 28572 KB Output is correct
23 Correct 1071 ms 126896 KB Output is correct
24 Correct 11 ms 28508 KB Output is correct
25 Correct 19 ms 29020 KB Output is correct
26 Correct 13 ms 29016 KB Output is correct
27 Correct 15 ms 29192 KB Output is correct
28 Correct 308 ms 67740 KB Output is correct
29 Correct 534 ms 87292 KB Output is correct
30 Correct 814 ms 106068 KB Output is correct
31 Correct 1049 ms 127004 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28508 KB Output is correct
34 Correct 10 ms 28444 KB Output is correct
35 Correct 10 ms 28504 KB Output is correct
36 Correct 10 ms 28508 KB Output is correct
37 Correct 11 ms 28428 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 10 ms 28656 KB Output is correct
40 Correct 11 ms 28508 KB Output is correct
41 Correct 12 ms 28412 KB Output is correct
42 Correct 10 ms 28632 KB Output is correct
43 Correct 12 ms 28760 KB Output is correct
44 Correct 13 ms 29016 KB Output is correct
45 Correct 296 ms 68284 KB Output is correct
46 Correct 460 ms 86188 KB Output is correct
47 Correct 474 ms 86344 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct
17 Correct 11 ms 28504 KB Output is correct
18 Correct 15 ms 28692 KB Output is correct
19 Correct 11 ms 28508 KB Output is correct
20 Correct 11 ms 28508 KB Output is correct
21 Correct 12 ms 28504 KB Output is correct
22 Correct 12 ms 28572 KB Output is correct
23 Correct 1071 ms 126896 KB Output is correct
24 Correct 11 ms 28508 KB Output is correct
25 Correct 19 ms 29020 KB Output is correct
26 Correct 13 ms 29016 KB Output is correct
27 Correct 15 ms 29192 KB Output is correct
28 Correct 308 ms 67740 KB Output is correct
29 Correct 534 ms 87292 KB Output is correct
30 Correct 814 ms 106068 KB Output is correct
31 Correct 1049 ms 127004 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28508 KB Output is correct
34 Correct 10 ms 28444 KB Output is correct
35 Correct 10 ms 28504 KB Output is correct
36 Correct 10 ms 28508 KB Output is correct
37 Correct 11 ms 28428 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 10 ms 28656 KB Output is correct
40 Correct 11 ms 28508 KB Output is correct
41 Correct 12 ms 28412 KB Output is correct
42 Correct 10 ms 28632 KB Output is correct
43 Correct 12 ms 28760 KB Output is correct
44 Correct 13 ms 29016 KB Output is correct
45 Correct 296 ms 68284 KB Output is correct
46 Correct 460 ms 86188 KB Output is correct
47 Correct 474 ms 86344 KB Output is correct
48 Correct 14 ms 28508 KB Output is correct
49 Correct 11 ms 28500 KB Output is correct
50 Correct 11 ms 28504 KB Output is correct
51 Correct 11 ms 28444 KB Output is correct
52 Correct 12 ms 28508 KB Output is correct
53 Correct 12 ms 28460 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 1004 ms 118652 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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct
17 Correct 11 ms 28508 KB Output is correct
18 Correct 11 ms 28464 KB Output is correct
19 Correct 11 ms 28508 KB Output is correct
20 Correct 785 ms 105796 KB Output is correct
21 Correct 862 ms 102224 KB Output is correct
22 Correct 752 ms 101952 KB Output is correct
23 Correct 649 ms 107528 KB Output is correct
24 Correct 197 ms 45812 KB Output is correct
25 Correct 316 ms 52268 KB Output is correct
26 Correct 290 ms 52360 KB Output is correct
27 Correct 756 ms 117012 KB Output is correct
28 Correct 754 ms 117028 KB Output is correct
29 Correct 739 ms 116912 KB Output is correct
30 Correct 815 ms 116904 KB Output is correct
31 Correct 12 ms 28508 KB Output is correct
32 Correct 47 ms 34232 KB Output is correct
33 Correct 86 ms 37712 KB Output is correct
34 Correct 864 ms 107344 KB Output is correct
35 Correct 20 ms 29788 KB Output is correct
36 Correct 67 ms 34900 KB Output is correct
37 Correct 145 ms 41304 KB Output is correct
38 Correct 240 ms 57528 KB Output is correct
39 Correct 354 ms 68284 KB Output is correct
40 Correct 475 ms 79056 KB Output is correct
41 Correct 590 ms 90080 KB Output is correct
42 Correct 745 ms 100780 KB Output is correct
43 Correct 11 ms 28504 KB Output is correct
44 Correct 12 ms 28508 KB Output is correct
45 Correct 12 ms 28512 KB Output is correct
46 Correct 11 ms 28508 KB Output is correct
47 Correct 12 ms 28508 KB Output is correct
48 Correct 14 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 13 ms 28508 KB Output is correct
52 Correct 13 ms 28628 KB Output is correct
53 Correct 11 ms 28508 KB Output is correct
54 Correct 14 ms 28752 KB Output is correct
55 Correct 15 ms 29020 KB Output is correct
56 Correct 320 ms 68284 KB Output is correct
57 Correct 481 ms 86188 KB Output is correct
58 Correct 488 ms 86184 KB Output is correct
59 Correct 12 ms 28504 KB Output is correct
60 Correct 11 ms 28508 KB Output is correct
61 Correct 11 ms 28468 KB Output is correct
62 Correct 763 ms 121516 KB Output is correct
63 Correct 736 ms 121600 KB Output is correct
64 Correct 725 ms 121796 KB Output is correct
65 Correct 16 ms 29156 KB Output is correct
66 Correct 18 ms 29532 KB Output is correct
67 Correct 324 ms 66748 KB Output is correct
68 Correct 500 ms 86716 KB Output is correct
69 Correct 730 ms 105132 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct
17 Correct 788 ms 123564 KB Output is correct
18 Correct 732 ms 123304 KB Output is correct
19 Correct 805 ms 105280 KB Output is correct
20 Correct 843 ms 108972 KB Output is correct
21 Correct 706 ms 105476 KB Output is correct
22 Correct 12 ms 28504 KB Output is correct
23 Correct 93 ms 40880 KB Output is correct
24 Correct 33 ms 31312 KB Output is correct
25 Correct 96 ms 37972 KB Output is correct
26 Correct 175 ms 44372 KB Output is correct
27 Correct 343 ms 69052 KB Output is correct
28 Correct 462 ms 79796 KB Output is correct
29 Correct 628 ms 89512 KB Output is correct
30 Correct 740 ms 99248 KB Output is correct
31 Correct 860 ms 109736 KB Output is correct
32 Correct 814 ms 116848 KB Output is correct
33 Correct 702 ms 122796 KB Output is correct
34 Correct 15 ms 29276 KB Output is correct
35 Correct 19 ms 29788 KB Output is correct
36 Correct 335 ms 69280 KB Output is correct
37 Correct 533 ms 90148 KB Output is correct
38 Correct 784 ms 110508 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 28504 KB Output is correct
2 Correct 11 ms 28508 KB Output is correct
3 Correct 15 ms 28508 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 11 ms 28508 KB Output is correct
6 Correct 12 ms 28504 KB Output is correct
7 Correct 11 ms 28504 KB Output is correct
8 Correct 11 ms 28508 KB Output is correct
9 Correct 315 ms 75744 KB Output is correct
10 Correct 26 ms 33616 KB Output is correct
11 Correct 120 ms 54220 KB Output is correct
12 Correct 38 ms 35928 KB Output is correct
13 Correct 45 ms 34716 KB Output is correct
14 Correct 11 ms 28764 KB Output is correct
15 Correct 12 ms 28764 KB Output is correct
16 Correct 297 ms 74348 KB Output is correct
17 Correct 11 ms 28504 KB Output is correct
18 Correct 15 ms 28692 KB Output is correct
19 Correct 11 ms 28508 KB Output is correct
20 Correct 11 ms 28508 KB Output is correct
21 Correct 12 ms 28504 KB Output is correct
22 Correct 12 ms 28572 KB Output is correct
23 Correct 1071 ms 126896 KB Output is correct
24 Correct 11 ms 28508 KB Output is correct
25 Correct 19 ms 29020 KB Output is correct
26 Correct 13 ms 29016 KB Output is correct
27 Correct 15 ms 29192 KB Output is correct
28 Correct 308 ms 67740 KB Output is correct
29 Correct 534 ms 87292 KB Output is correct
30 Correct 814 ms 106068 KB Output is correct
31 Correct 1049 ms 127004 KB Output is correct
32 Correct 11 ms 28508 KB Output is correct
33 Correct 11 ms 28508 KB Output is correct
34 Correct 10 ms 28444 KB Output is correct
35 Correct 10 ms 28504 KB Output is correct
36 Correct 10 ms 28508 KB Output is correct
37 Correct 11 ms 28428 KB Output is correct
38 Correct 11 ms 28508 KB Output is correct
39 Correct 10 ms 28656 KB Output is correct
40 Correct 11 ms 28508 KB Output is correct
41 Correct 12 ms 28412 KB Output is correct
42 Correct 10 ms 28632 KB Output is correct
43 Correct 12 ms 28760 KB Output is correct
44 Correct 13 ms 29016 KB Output is correct
45 Correct 296 ms 68284 KB Output is correct
46 Correct 460 ms 86188 KB Output is correct
47 Correct 474 ms 86344 KB Output is correct
48 Correct 14 ms 28508 KB Output is correct
49 Correct 11 ms 28500 KB Output is correct
50 Correct 11 ms 28504 KB Output is correct
51 Correct 11 ms 28444 KB Output is correct
52 Correct 12 ms 28508 KB Output is correct
53 Correct 12 ms 28460 KB Output is correct
54 Correct 11 ms 28508 KB Output is correct
55 Incorrect 1004 ms 118652 KB Given structure is not connected: There is no path between vertices 0 and 239
56 Halted 0 ms 0 KB -