oj.uz

답안 #824926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824926 2023-08-14T11:58:33 Z andrei_boaca 분수 공원 (IOI21_parks) C++17
70 / 100
 1231 ms 135508 KB 
#include "parks.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
using namespace std;

typedef pair<int,int> pii;
map<pii,int> ind;
map<pii,int> ocup;
map<pii,int> match;
struct point
{
    int x,y;
} v[200005];
int k;
vector<int> myy[200005];
vector<int> muchii[200005];
vector<pii> edges;
bool have[11][200005];
bool use[200005];
void dfs(int nod)
{
    use[nod]=1;
    for(int i:muchii[nod])
        if(!use[i])
            dfs(i);
}
int c[11][200005];
vector<int> U,V,A,B;
void addedge(int xa,int ya,int xb,int yb,int xc,int yc)
{
    int a=ind[{xa,ya}];
    int b=ind[{xb,yb}];
    U.push_back(a);
    V.push_back(b);
    muchii[a].push_back(b);
    muchii[b].push_back(a);
    A.push_back(xc);
    B.push_back(yc);
}
int diri[5]={-2,2,0,0};
int dirj[5]={0,0,-2,2};
int nr;
vector<int> cedge[800005];
int l[800005],r[800005];
vector<pii> who;
bool pairup(int nod)
{
    if(use[nod])
        return 0;
    use[nod]=1;
    for(int i:cedge[nod])
        if(r[i]==0)
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    for(int i:cedge[nod])
        if(pairup(r[i]))
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    return 0;
}
int comp[700005];
vector<int> dsu[700005];
void dsu_merge(int c1,int c2)
{
    if(dsu[c1].size()<dsu[c2].size())
        swap(c1,c2);
    for(int i:dsu[c2])
    {
        comp[i]=c1;
        dsu[c1].push_back(i);
    }
    dsu[c2].clear();
}
int construct_roads(std::vector<int> X, std::vector<int> Y)
{
    k=X.size();
    int xmax=0;
    for(int i=0;i<k;i++)
    {
        v[i]={X[i],Y[i]};
        ind[{X[i],Y[i]}]=i;
        xmax=max(xmax,X[i]);
        if(X[i]<=6)
        {
            myy[X[i]].push_back(Y[i]);
            have[X[i]][Y[i]]=1;
        }
    }
    if(xmax<=2)
    {
        sort(myy[2].begin(),myy[2].end());
        vector<int> U,V,a,b;
        for(int i=1;i<myy[2].size();i++)
        {
            if(myy[2][i]-myy[2][i-1]!=2)
                return 0;
            int x=2;
            int yu=myy[2][i-1];
            int yv=myy[2][i];
            U.push_back(ind[{x,yu}]);
            V.push_back(ind[{x,yv}]);
            a.push_back(x-1);
            b.push_back(yv-1);
        }
        build(U,V,a,b);
        return 1;
    }
    if(xmax<=4)
    {
        sort(myy[2].begin(),myy[2].end());
        sort(myy[4].begin(),myy[4].end());
        vector<int> U,V,A,B;
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[2][i-2])
            {
                int a=ind[{2,i}];
                int b=ind[{2,i-2}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(1);
                B.push_back(i-1);
            }
        for(int i=2;i<=200000;i+=2)
            if(have[4][i]&&have[4][i-2])
            {
                int a=ind[{4,i}];
                int b=ind[{4,i-2}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(5);
                B.push_back(i-1);
            }
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[4][i])
            {
                int a=ind[{2,i}];
                int b=ind[{4,i}];
                U.push_back(a);
                V.push_back(b);
                muchii[a].push_back(b);
                muchii[b].push_back(a);
                A.push_back(3);
                B.push_back(i+1);
            }
        dfs(0);
        for(int i=0;i<k;i++)
            if(!use[i])
                return 0;
        build(U,V,A,B);
        return 1;
    }
    if(xmax<=6)
    {
        sort(myy[2].begin(),myy[2].end());
        sort(myy[4].begin(),myy[4].end());
        sort(myy[6].begin(),myy[6].end());
        int nr=0;
        for(int i=2;i<=200000;i+=2)
            if(have[2][i])
            {
                if(have[2][i-2])
                {
                    addedge(2,i,2,i-2,1,i-1);
                    c[2][i]=c[2][i-2];
                }
                else
                {
                    nr++;
                    c[2][i]=nr;
                }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[6][i])
            {
                if(have[6][i-2])
                {
                    addedge(6,i,6,i-2,7,i-1);
                    c[6][i]=c[6][i-2];
                }
                else
                {
                    nr++;
                    c[6][i]=nr;
                }
            }
        int lft=1;
        for(int i=2;i<=200000;i+=2)
            if(have[4][i])
            {
                if(have[4][i-2])
                {
                    if(lft==1)
                    {
                        addedge(4,i,4,i-2,3,i-1);
                        ocup[{3,i-1}]=1;
                    }
                    else
                    {
                        addedge(4,i,4,i-2,5,i-1);
                        ocup[{5,i-1}]=1;
                    }
                    lft^=1;
                    c[4][i]=c[4][i-2];
                }
                else
                {
                    lft=1;
                    nr++;
                    c[4][i]=nr;
                }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[2][i]&&have[4][i])
            {
                int a=c[2][i];
                int b=c[4][i];
                if(match[{a,b}]==0)
                    {
                        match[{a,b}]=1;
                        if(!ocup[{3,i-1}])
                            {
                                addedge(2,i,4,i,3,i-1);
                                ocup[{3,i-1}]=1;
                            }
                        else
                        {
                            addedge(2,i,4,i,3,i+1);
                            ocup[{3,i+1}]=1;
                        }
                    }
            }
        for(int i=2;i<=200000;i+=2)
            if(have[4][i]&&have[6][i])
            {
                int a=c[4][i];
                int b=c[6][i];
                if(match[{a,b}]==0)
                    {
                        match[{a,b}]=1;
                        if(!ocup[{5,i-1}])
                            {
                                addedge(4,i,6,i,5,i-1);
                                ocup[{5,i-1}]=1;
                            }
                        else
                        {
                            addedge(4,i,6,i,5,i+1);
                            ocup[{5,i+1}]=1;
                        }
                    }
            }
        dfs(0);
        for(int i=0;i<k;i++)
            if(!use[i])
                return 0;
        build(U,V,A,B);
        return 1;
    }
    vector<int> nodes;
    for(int i=0;i<k;i++)
    {
        nodes.push_back(i);
        comp[i]=i;
        dsu[i].push_back(i);
    }
    random_shuffle(nodes.begin(),nodes.end());
    for(auto p:nodes)
    {
        int nod=p;
        int x=X[nod],y=Y[nod];
        for(int z=0;z<4;z++)
        {
            int lin=x+diri[z];
            int col=y+dirj[z];
            if(ind.count({lin,col})!=0)
                {
                    int w=ind[{lin,col}];
                    if(comp[nod]!=comp[w])
                    {
                        dsu_merge(comp[nod],comp[w]);
                        muchii[nod].push_back(w);
                        muchii[w].push_back(nod);
                        edges.push_back({nod,w});
                    }
                }
        }
    }
    dfs(0);
    for(int i=0;i<k;i++)
        if(!use[i])
            return 0;
    nr=0;
    who.push_back({0,0});
    for(int i=0;i<edges.size();i++)
    {
        int a=edges[i].first;
        int b=edges[i].second;
        int xa=X[a],ya=Y[a],xb=X[b],yb=Y[b];
        if(xa==xb)
        {
            int x=xa+1;
            int y=(ya+yb)/2;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            int nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);

            x=xa-1;
            y=(ya+yb)/2;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);
        }
        else
        {
            int x=(xa+xb)/2;
            int y=ya-1;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            int nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);

            x=(xa+xb)/2;
            y=ya+1;
            if(ind[{x,y}]==0)
                {
                    nr++;
                    ind[{x,y}]=nr;
                    who.push_back({x,y});
                }
            nrm=ind[{x,y}];
            cedge[i+1].push_back(nrm);
        }
    }
    bool ok=0;
    do
    {
        ok=0;
        for(int i=1;i<=edges.size();i++)
            use[i]=0;
        for(int i=1;i<=edges.size();i++)
            if(l[i]==0)
                ok|=pairup(i);
    }while(ok);
    for(int i=1;i<=edges.size();i++)
        if(l[i]==0)
            return 0;
    for(int i=1;i<=edges.size();i++)
    {
        U.push_back(edges[i-1].first);
        V.push_back(edges[i-1].second);
        A.push_back(who[l[i]].first);
        B.push_back(who[l[i]].second);
    }
    build(U,V,A,B);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         for(int i=1;i<myy[2].size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:304:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  304 |     for(int i=0;i<edges.size();i++)
      |                 ~^~~~~~~~~~~~~
parks.cpp:362:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  362 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:364:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  364 |         for(int i=1;i<=edges.size();i++)
      |                     ~^~~~~~~~~~~~~~
parks.cpp:368:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  368 |     for(int i=1;i<=edges.size();i++)
      |                 ~^~~~~~~~~~~~~~
parks.cpp:371:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  371 |     for(int i=1;i<=edges.size();i++)
      |                 ~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct
17 Correct 21 ms 44940 KB Output is correct
18 Correct 26 ms 44884 KB Output is correct
19 Correct 26 ms 44884 KB Output is correct
20 Correct 22 ms 44884 KB Output is correct
21 Correct 22 ms 44944 KB Output is correct
22 Correct 28 ms 44884 KB Output is correct
23 Correct 349 ms 87296 KB Output is correct
24 Correct 23 ms 44972 KB Output is correct
25 Correct 24 ms 45216 KB Output is correct
26 Correct 25 ms 45472 KB Output is correct
27 Correct 27 ms 45532 KB Output is correct
28 Correct 127 ms 61924 KB Output is correct
29 Correct 215 ms 70432 KB Output is correct
30 Correct 292 ms 78840 KB Output is correct
31 Correct 350 ms 87300 KB Output is correct
32 Correct 26 ms 44924 KB Output is correct
33 Correct 24 ms 44904 KB Output is correct
34 Correct 26 ms 44892 KB Output is correct
35 Correct 22 ms 44876 KB Output is correct
36 Correct 28 ms 44848 KB Output is correct
37 Correct 26 ms 44876 KB Output is correct
38 Correct 24 ms 44884 KB Output is correct
39 Correct 24 ms 44964 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 23 ms 44884 KB Output is correct
42 Correct 26 ms 44940 KB Output is correct
43 Correct 25 ms 45248 KB Output is correct
44 Correct 25 ms 45408 KB Output is correct
45 Correct 153 ms 63156 KB Output is correct
46 Correct 239 ms 71748 KB Output is correct
47 Correct 221 ms 71600 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct
17 Correct 21 ms 44940 KB Output is correct
18 Correct 26 ms 44884 KB Output is correct
19 Correct 26 ms 44884 KB Output is correct
20 Correct 22 ms 44884 KB Output is correct
21 Correct 22 ms 44944 KB Output is correct
22 Correct 28 ms 44884 KB Output is correct
23 Correct 349 ms 87296 KB Output is correct
24 Correct 23 ms 44972 KB Output is correct
25 Correct 24 ms 45216 KB Output is correct
26 Correct 25 ms 45472 KB Output is correct
27 Correct 27 ms 45532 KB Output is correct
28 Correct 127 ms 61924 KB Output is correct
29 Correct 215 ms 70432 KB Output is correct
30 Correct 292 ms 78840 KB Output is correct
31 Correct 350 ms 87300 KB Output is correct
32 Correct 26 ms 44924 KB Output is correct
33 Correct 24 ms 44904 KB Output is correct
34 Correct 26 ms 44892 KB Output is correct
35 Correct 22 ms 44876 KB Output is correct
36 Correct 28 ms 44848 KB Output is correct
37 Correct 26 ms 44876 KB Output is correct
38 Correct 24 ms 44884 KB Output is correct
39 Correct 24 ms 44964 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 23 ms 44884 KB Output is correct
42 Correct 26 ms 44940 KB Output is correct
43 Correct 25 ms 45248 KB Output is correct
44 Correct 25 ms 45408 KB Output is correct
45 Correct 153 ms 63156 KB Output is correct
46 Correct 239 ms 71748 KB Output is correct
47 Correct 221 ms 71600 KB Output is correct
48 Correct 27 ms 44916 KB Output is correct
49 Correct 24 ms 44880 KB Output is correct
50 Correct 25 ms 44984 KB Output is correct
51 Correct 28 ms 44884 KB Output is correct
52 Correct 27 ms 44880 KB Output is correct
53 Correct 24 ms 44900 KB Output is correct
54 Correct 29 ms 44940 KB Output is correct
55 Correct 299 ms 86912 KB Output is correct
56 Correct 23 ms 44864 KB Output is correct
57 Correct 25 ms 45296 KB Output is correct
58 Correct 33 ms 46348 KB Output is correct
59 Correct 34 ms 46816 KB Output is correct
60 Correct 136 ms 65620 KB Output is correct
61 Correct 219 ms 74252 KB Output is correct
62 Correct 244 ms 79712 KB Output is correct
63 Correct 343 ms 86544 KB Output is correct
64 Correct 26 ms 44888 KB Output is correct
65 Correct 23 ms 44880 KB Output is correct
66 Correct 23 ms 44992 KB Output is correct
67 Correct 318 ms 83240 KB Output is correct
68 Correct 305 ms 83248 KB Output is correct
69 Correct 285 ms 83528 KB Output is correct
70 Correct 27 ms 45748 KB Output is correct
71 Correct 31 ms 46756 KB Output is correct
72 Correct 190 ms 69276 KB Output is correct
73 Correct 257 ms 81960 KB Output is correct
74 Correct 439 ms 93784 KB Output is correct
75 Correct 409 ms 95900 KB Output is correct
76 Correct 344 ms 84304 KB Output is correct
77 Correct 28 ms 46040 KB Output is correct
78 Correct 31 ms 47004 KB Output is correct
79 Correct 193 ms 70248 KB Output is correct
80 Correct 282 ms 82976 KB Output is correct
81 Correct 404 ms 95888 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct
17 Correct 27 ms 44928 KB Output is correct
18 Correct 27 ms 44912 KB Output is correct
19 Correct 23 ms 44884 KB Output is correct
20 Correct 1042 ms 122104 KB Output is correct
21 Correct 1224 ms 121644 KB Output is correct
22 Correct 1116 ms 120668 KB Output is correct
23 Correct 983 ms 122128 KB Output is correct
24 Correct 402 ms 70024 KB Output is correct
25 Correct 792 ms 81160 KB Output is correct
26 Correct 628 ms 80856 KB Output is correct
27 Correct 1128 ms 130284 KB Output is correct
28 Correct 1130 ms 130644 KB Output is correct
29 Correct 1223 ms 130468 KB Output is correct
30 Correct 1199 ms 130556 KB Output is correct
31 Correct 24 ms 44856 KB Output is correct
32 Correct 60 ms 50492 KB Output is correct
33 Correct 153 ms 57436 KB Output is correct
34 Correct 1231 ms 121244 KB Output is correct
35 Correct 38 ms 46796 KB Output is correct
36 Correct 141 ms 54112 KB Output is correct
37 Correct 303 ms 63284 KB Output is correct
38 Correct 357 ms 75180 KB Output is correct
39 Correct 527 ms 85580 KB Output is correct
40 Correct 750 ms 98148 KB Output is correct
41 Correct 976 ms 108984 KB Output is correct
42 Correct 1169 ms 119892 KB Output is correct
43 Correct 26 ms 44944 KB Output is correct
44 Correct 23 ms 44884 KB Output is correct
45 Correct 27 ms 44900 KB Output is correct
46 Correct 25 ms 44884 KB Output is correct
47 Correct 23 ms 44908 KB Output is correct
48 Correct 23 ms 44956 KB Output is correct
49 Correct 25 ms 44884 KB Output is correct
50 Correct 22 ms 44968 KB Output is correct
51 Correct 29 ms 44888 KB Output is correct
52 Correct 28 ms 44876 KB Output is correct
53 Correct 23 ms 44932 KB Output is correct
54 Correct 23 ms 45156 KB Output is correct
55 Correct 26 ms 45420 KB Output is correct
56 Correct 176 ms 63264 KB Output is correct
57 Correct 195 ms 71816 KB Output is correct
58 Correct 227 ms 71616 KB Output is correct
59 Correct 24 ms 44884 KB Output is correct
60 Correct 24 ms 44900 KB Output is correct
61 Correct 26 ms 44852 KB Output is correct
62 Correct 270 ms 83220 KB Output is correct
63 Correct 303 ms 83344 KB Output is correct
64 Correct 254 ms 83480 KB Output is correct
65 Correct 27 ms 45828 KB Output is correct
66 Correct 31 ms 46676 KB Output is correct
67 Correct 187 ms 69364 KB Output is correct
68 Correct 270 ms 81916 KB Output is correct
69 Correct 377 ms 93820 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct
17 Correct 1008 ms 135508 KB Output is correct
18 Correct 961 ms 134968 KB Output is correct
19 Correct 1018 ms 122296 KB Output is correct
20 Correct 970 ms 117000 KB Output is correct
21 Correct 961 ms 115524 KB Output is correct
22 Correct 22 ms 44936 KB Output is correct
23 Correct 130 ms 56792 KB Output is correct
24 Correct 52 ms 48520 KB Output is correct
25 Correct 195 ms 57812 KB Output is correct
26 Correct 354 ms 66392 KB Output is correct
27 Correct 517 ms 82128 KB Output is correct
28 Correct 611 ms 91412 KB Output is correct
29 Correct 765 ms 101868 KB Output is correct
30 Correct 971 ms 110424 KB Output is correct
31 Correct 1071 ms 119736 KB Output is correct
32 Correct 432 ms 95888 KB Output is correct
33 Correct 302 ms 84312 KB Output is correct
34 Correct 27 ms 46000 KB Output is correct
35 Correct 37 ms 46956 KB Output is correct
36 Correct 188 ms 70268 KB Output is correct
37 Correct 298 ms 82980 KB Output is correct
38 Correct 421 ms 95660 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44932 KB Output is correct
3 Correct 20 ms 44884 KB Output is correct
4 Correct 21 ms 44840 KB Output is correct
5 Correct 21 ms 44884 KB Output is correct
6 Correct 24 ms 44968 KB Output is correct
7 Correct 23 ms 44876 KB Output is correct
8 Correct 21 ms 44884 KB Output is correct
9 Correct 117 ms 59160 KB Output is correct
10 Correct 27 ms 46548 KB Output is correct
11 Correct 64 ms 52664 KB Output is correct
12 Correct 31 ms 47304 KB Output is correct
13 Correct 46 ms 49752 KB Output is correct
14 Correct 24 ms 45064 KB Output is correct
15 Correct 26 ms 45104 KB Output is correct
16 Correct 120 ms 59172 KB Output is correct
17 Correct 21 ms 44940 KB Output is correct
18 Correct 26 ms 44884 KB Output is correct
19 Correct 26 ms 44884 KB Output is correct
20 Correct 22 ms 44884 KB Output is correct
21 Correct 22 ms 44944 KB Output is correct
22 Correct 28 ms 44884 KB Output is correct
23 Correct 349 ms 87296 KB Output is correct
24 Correct 23 ms 44972 KB Output is correct
25 Correct 24 ms 45216 KB Output is correct
26 Correct 25 ms 45472 KB Output is correct
27 Correct 27 ms 45532 KB Output is correct
28 Correct 127 ms 61924 KB Output is correct
29 Correct 215 ms 70432 KB Output is correct
30 Correct 292 ms 78840 KB Output is correct
31 Correct 350 ms 87300 KB Output is correct
32 Correct 26 ms 44924 KB Output is correct
33 Correct 24 ms 44904 KB Output is correct
34 Correct 26 ms 44892 KB Output is correct
35 Correct 22 ms 44876 KB Output is correct
36 Correct 28 ms 44848 KB Output is correct
37 Correct 26 ms 44876 KB Output is correct
38 Correct 24 ms 44884 KB Output is correct
39 Correct 24 ms 44964 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 23 ms 44884 KB Output is correct
42 Correct 26 ms 44940 KB Output is correct
43 Correct 25 ms 45248 KB Output is correct
44 Correct 25 ms 45408 KB Output is correct
45 Correct 153 ms 63156 KB Output is correct
46 Correct 239 ms 71748 KB Output is correct
47 Correct 221 ms 71600 KB Output is correct
48 Correct 27 ms 44916 KB Output is correct
49 Correct 24 ms 44880 KB Output is correct
50 Correct 25 ms 44984 KB Output is correct
51 Correct 28 ms 44884 KB Output is correct
52 Correct 27 ms 44880 KB Output is correct
53 Correct 24 ms 44900 KB Output is correct
54 Correct 29 ms 44940 KB Output is correct
55 Correct 299 ms 86912 KB Output is correct
56 Correct 23 ms 44864 KB Output is correct
57 Correct 25 ms 45296 KB Output is correct
58 Correct 33 ms 46348 KB Output is correct
59 Correct 34 ms 46816 KB Output is correct
60 Correct 136 ms 65620 KB Output is correct
61 Correct 219 ms 74252 KB Output is correct
62 Correct 244 ms 79712 KB Output is correct
63 Correct 343 ms 86544 KB Output is correct
64 Correct 26 ms 44888 KB Output is correct
65 Correct 23 ms 44880 KB Output is correct
66 Correct 23 ms 44992 KB Output is correct
67 Correct 318 ms 83240 KB Output is correct
68 Correct 305 ms 83248 KB Output is correct
69 Correct 285 ms 83528 KB Output is correct
70 Correct 27 ms 45748 KB Output is correct
71 Correct 31 ms 46756 KB Output is correct
72 Correct 190 ms 69276 KB Output is correct
73 Correct 257 ms 81960 KB Output is correct
74 Correct 439 ms 93784 KB Output is correct
75 Correct 409 ms 95900 KB Output is correct
76 Correct 344 ms 84304 KB Output is correct
77 Correct 28 ms 46040 KB Output is correct
78 Correct 31 ms 47004 KB Output is correct
79 Correct 193 ms 70248 KB Output is correct
80 Correct 282 ms 82976 KB Output is correct
81 Correct 404 ms 95888 KB Output is correct
82 Correct 27 ms 44928 KB Output is correct
83 Correct 27 ms 44912 KB Output is correct
84 Correct 23 ms 44884 KB Output is correct
85 Correct 1042 ms 122104 KB Output is correct
86 Correct 1224 ms 121644 KB Output is correct
87 Correct 1116 ms 120668 KB Output is correct
88 Correct 983 ms 122128 KB Output is correct
89 Correct 402 ms 70024 KB Output is correct
90 Correct 792 ms 81160 KB Output is correct
91 Correct 628 ms 80856 KB Output is correct
92 Correct 1128 ms 130284 KB Output is correct
93 Correct 1130 ms 130644 KB Output is correct
94 Correct 1223 ms 130468 KB Output is correct
95 Correct 1199 ms 130556 KB Output is correct
96 Correct 24 ms 44856 KB Output is correct
97 Correct 60 ms 50492 KB Output is correct
98 Correct 153 ms 57436 KB Output is correct
99 Correct 1231 ms 121244 KB Output is correct
100 Correct 38 ms 46796 KB Output is correct
101 Correct 141 ms 54112 KB Output is correct
102 Correct 303 ms 63284 KB Output is correct
103 Correct 357 ms 75180 KB Output is correct
104 Correct 527 ms 85580 KB Output is correct
105 Correct 750 ms 98148 KB Output is correct
106 Correct 976 ms 108984 KB Output is correct
107 Correct 1169 ms 119892 KB Output is correct
108 Correct 26 ms 44944 KB Output is correct
109 Correct 23 ms 44884 KB Output is correct
110 Correct 27 ms 44900 KB Output is correct
111 Correct 25 ms 44884 KB Output is correct
112 Correct 23 ms 44908 KB Output is correct
113 Correct 23 ms 44956 KB Output is correct
114 Correct 25 ms 44884 KB Output is correct
115 Correct 22 ms 44968 KB Output is correct
116 Correct 29 ms 44888 KB Output is correct
117 Correct 28 ms 44876 KB Output is correct
118 Correct 23 ms 44932 KB Output is correct
119 Correct 23 ms 45156 KB Output is correct
120 Correct 26 ms 45420 KB Output is correct
121 Correct 176 ms 63264 KB Output is correct
122 Correct 195 ms 71816 KB Output is correct
123 Correct 227 ms 71616 KB Output is correct
124 Correct 24 ms 44884 KB Output is correct
125 Correct 24 ms 44900 KB Output is correct
126 Correct 26 ms 44852 KB Output is correct
127 Correct 270 ms 83220 KB Output is correct
128 Correct 303 ms 83344 KB Output is correct
129 Correct 254 ms 83480 KB Output is correct
130 Correct 27 ms 45828 KB Output is correct
131 Correct 31 ms 46676 KB Output is correct
132 Correct 187 ms 69364 KB Output is correct
133 Correct 270 ms 81916 KB Output is correct
134 Correct 377 ms 93820 KB Output is correct
135 Correct 1008 ms 135508 KB Output is correct
136 Correct 961 ms 134968 KB Output is correct
137 Correct 1018 ms 122296 KB Output is correct
138 Correct 970 ms 117000 KB Output is correct
139 Correct 961 ms 115524 KB Output is correct
140 Correct 22 ms 44936 KB Output is correct
141 Correct 130 ms 56792 KB Output is correct
142 Correct 52 ms 48520 KB Output is correct
143 Correct 195 ms 57812 KB Output is correct
144 Correct 354 ms 66392 KB Output is correct
145 Correct 517 ms 82128 KB Output is correct
146 Correct 611 ms 91412 KB Output is correct
147 Correct 765 ms 101868 KB Output is correct
148 Correct 971 ms 110424 KB Output is correct
149 Correct 1071 ms 119736 KB Output is correct
150 Correct 432 ms 95888 KB Output is correct
151 Correct 302 ms 84312 KB Output is correct
152 Correct 27 ms 46000 KB Output is correct
153 Correct 37 ms 46956 KB Output is correct
154 Correct 188 ms 70268 KB Output is correct
155 Correct 298 ms 82980 KB Output is correct
156 Correct 421 ms 95660 KB Output is correct
157 Correct 24 ms 44908 KB Output is correct
158 Correct 24 ms 44944 KB Output is correct
159 Correct 26 ms 44912 KB Output is correct
160 Correct 25 ms 44964 KB Output is correct
161 Incorrect 1083 ms 102036 KB Solution announced impossible, but it is possible.
162 Halted 0 ms 0 KB -