oj.uz

답안 #824889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824889 2023-08-14T11:42:44 Z andrei_boaca 분수 공원 (IOI21_parks) C++17
70 / 100
 578 ms 131640 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;
    }
    for(int i=0;i<k;i++)
    {
        comp[i]=i;
        dsu[i].push_back(i);
    }
    for(auto p:ind)
    {
        int x=p.first.first;
        int y=p.first.second;
        int nod=p.second;
        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:302: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]
  302 |     for(int i=0;i<edges.size();i++)
      |                 ~^~~~~~~~~~~~~
parks.cpp:360: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]
  360 |         for(int i=1;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:366: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]
  366 |     for(int i=1;i<=edges.size();i++)
      |                 ~^~~~~~~~~~~~~~
parks.cpp:369: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]
  369 |     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 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 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 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 KB Output is correct
17 Correct 23 ms 44848 KB Output is correct
18 Correct 25 ms 44952 KB Output is correct
19 Correct 21 ms 44864 KB Output is correct
20 Correct 25 ms 44904 KB Output is correct
21 Correct 23 ms 44904 KB Output is correct
22 Correct 24 ms 44856 KB Output is correct
23 Correct 380 ms 87352 KB Output is correct
24 Correct 29 ms 44920 KB Output is correct
25 Correct 24 ms 45256 KB Output is correct
26 Correct 31 ms 45396 KB Output is correct
27 Correct 32 ms 45564 KB Output is correct
28 Correct 151 ms 61916 KB Output is correct
29 Correct 188 ms 70432 KB Output is correct
30 Correct 261 ms 78868 KB Output is correct
31 Correct 383 ms 87296 KB Output is correct
32 Correct 23 ms 44896 KB Output is correct
33 Correct 23 ms 44924 KB Output is correct
34 Correct 23 ms 44868 KB Output is correct
35 Correct 27 ms 44884 KB Output is correct
36 Correct 27 ms 44888 KB Output is correct
37 Correct 23 ms 44848 KB Output is correct
38 Correct 23 ms 44884 KB Output is correct
39 Correct 23 ms 44884 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 22 ms 44900 KB Output is correct
42 Correct 26 ms 44912 KB Output is correct
43 Correct 26 ms 45140 KB Output is correct
44 Correct 26 ms 45316 KB Output is correct
45 Correct 145 ms 63236 KB Output is correct
46 Correct 195 ms 71688 KB Output is correct
47 Correct 227 ms 71648 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 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 KB Output is correct
17 Correct 23 ms 44848 KB Output is correct
18 Correct 25 ms 44952 KB Output is correct
19 Correct 21 ms 44864 KB Output is correct
20 Correct 25 ms 44904 KB Output is correct
21 Correct 23 ms 44904 KB Output is correct
22 Correct 24 ms 44856 KB Output is correct
23 Correct 380 ms 87352 KB Output is correct
24 Correct 29 ms 44920 KB Output is correct
25 Correct 24 ms 45256 KB Output is correct
26 Correct 31 ms 45396 KB Output is correct
27 Correct 32 ms 45564 KB Output is correct
28 Correct 151 ms 61916 KB Output is correct
29 Correct 188 ms 70432 KB Output is correct
30 Correct 261 ms 78868 KB Output is correct
31 Correct 383 ms 87296 KB Output is correct
32 Correct 23 ms 44896 KB Output is correct
33 Correct 23 ms 44924 KB Output is correct
34 Correct 23 ms 44868 KB Output is correct
35 Correct 27 ms 44884 KB Output is correct
36 Correct 27 ms 44888 KB Output is correct
37 Correct 23 ms 44848 KB Output is correct
38 Correct 23 ms 44884 KB Output is correct
39 Correct 23 ms 44884 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 22 ms 44900 KB Output is correct
42 Correct 26 ms 44912 KB Output is correct
43 Correct 26 ms 45140 KB Output is correct
44 Correct 26 ms 45316 KB Output is correct
45 Correct 145 ms 63236 KB Output is correct
46 Correct 195 ms 71688 KB Output is correct
47 Correct 227 ms 71648 KB Output is correct
48 Correct 23 ms 44884 KB Output is correct
49 Correct 24 ms 44864 KB Output is correct
50 Correct 23 ms 44884 KB Output is correct
51 Correct 25 ms 44884 KB Output is correct
52 Correct 23 ms 44864 KB Output is correct
53 Correct 23 ms 44924 KB Output is correct
54 Correct 23 ms 44984 KB Output is correct
55 Correct 292 ms 86996 KB Output is correct
56 Correct 22 ms 44848 KB Output is correct
57 Correct 25 ms 45396 KB Output is correct
58 Correct 30 ms 46284 KB Output is correct
59 Correct 31 ms 46740 KB Output is correct
60 Correct 156 ms 65636 KB Output is correct
61 Correct 183 ms 74240 KB Output is correct
62 Correct 230 ms 79740 KB Output is correct
63 Correct 287 ms 86444 KB Output is correct
64 Correct 28 ms 44884 KB Output is correct
65 Correct 27 ms 44884 KB Output is correct
66 Correct 23 ms 44944 KB Output is correct
67 Correct 270 ms 83296 KB Output is correct
68 Correct 298 ms 83248 KB Output is correct
69 Correct 282 ms 83468 KB Output is correct
70 Correct 33 ms 45780 KB Output is correct
71 Correct 33 ms 46716 KB Output is correct
72 Correct 176 ms 69292 KB Output is correct
73 Correct 283 ms 81932 KB Output is correct
74 Correct 390 ms 93704 KB Output is correct
75 Correct 404 ms 95832 KB Output is correct
76 Correct 261 ms 84312 KB Output is correct
77 Correct 27 ms 46036 KB Output is correct
78 Correct 32 ms 47060 KB Output is correct
79 Correct 165 ms 70228 KB Output is correct
80 Correct 258 ms 82980 KB Output is correct
81 Correct 364 ms 95632 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 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 KB Output is correct
17 Correct 24 ms 44960 KB Output is correct
18 Correct 23 ms 44860 KB Output is correct
19 Correct 23 ms 44872 KB Output is correct
20 Correct 483 ms 117088 KB Output is correct
21 Correct 500 ms 116120 KB Output is correct
22 Correct 531 ms 116168 KB Output is correct
23 Correct 466 ms 118260 KB Output is correct
24 Correct 181 ms 69240 KB Output is correct
25 Correct 336 ms 78252 KB Output is correct
26 Correct 268 ms 77948 KB Output is correct
27 Correct 488 ms 127620 KB Output is correct
28 Correct 504 ms 128336 KB Output is correct
29 Correct 578 ms 127684 KB Output is correct
30 Correct 536 ms 128464 KB Output is correct
31 Correct 22 ms 44884 KB Output is correct
32 Correct 50 ms 50320 KB Output is correct
33 Correct 98 ms 57036 KB Output is correct
34 Correct 514 ms 116592 KB Output is correct
35 Correct 33 ms 46676 KB Output is correct
36 Correct 82 ms 53488 KB Output is correct
37 Correct 164 ms 62116 KB Output is correct
38 Correct 188 ms 74356 KB Output is correct
39 Correct 267 ms 84812 KB Output is correct
40 Correct 350 ms 96984 KB Output is correct
41 Correct 428 ms 107516 KB Output is correct
42 Correct 520 ms 118096 KB Output is correct
43 Correct 23 ms 44944 KB Output is correct
44 Correct 23 ms 44884 KB Output is correct
45 Correct 22 ms 44884 KB Output is correct
46 Correct 23 ms 44884 KB Output is correct
47 Correct 23 ms 44928 KB Output is correct
48 Correct 23 ms 44852 KB Output is correct
49 Correct 23 ms 44900 KB Output is correct
50 Correct 24 ms 44848 KB Output is correct
51 Correct 22 ms 44924 KB Output is correct
52 Correct 23 ms 44920 KB Output is correct
53 Correct 23 ms 44872 KB Output is correct
54 Correct 24 ms 45236 KB Output is correct
55 Correct 26 ms 45388 KB Output is correct
56 Correct 142 ms 63244 KB Output is correct
57 Correct 193 ms 71820 KB Output is correct
58 Correct 195 ms 71604 KB Output is correct
59 Correct 26 ms 44968 KB Output is correct
60 Correct 22 ms 44884 KB Output is correct
61 Correct 23 ms 44908 KB Output is correct
62 Correct 259 ms 83212 KB Output is correct
63 Correct 281 ms 83264 KB Output is correct
64 Correct 260 ms 83508 KB Output is correct
65 Correct 27 ms 45780 KB Output is correct
66 Correct 35 ms 46736 KB Output is correct
67 Correct 161 ms 69316 KB Output is correct
68 Correct 283 ms 81904 KB Output is correct
69 Correct 346 ms 93784 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 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 KB Output is correct
17 Correct 538 ms 131640 KB Output is correct
18 Correct 545 ms 129672 KB Output is correct
19 Correct 521 ms 116016 KB Output is correct
20 Correct 497 ms 116316 KB Output is correct
21 Correct 463 ms 115008 KB Output is correct
22 Correct 23 ms 44884 KB Output is correct
23 Correct 85 ms 56580 KB Output is correct
24 Correct 43 ms 48280 KB Output is correct
25 Correct 110 ms 56872 KB Output is correct
26 Correct 178 ms 64832 KB Output is correct
27 Correct 241 ms 81332 KB Output is correct
28 Correct 313 ms 90352 KB Output is correct
29 Correct 374 ms 100636 KB Output is correct
30 Correct 456 ms 109156 KB Output is correct
31 Correct 513 ms 118084 KB Output is correct
32 Correct 374 ms 95892 KB Output is correct
33 Correct 263 ms 84292 KB Output is correct
34 Correct 28 ms 46000 KB Output is correct
35 Correct 31 ms 46952 KB Output is correct
36 Correct 173 ms 70208 KB Output is correct
37 Correct 274 ms 83048 KB Output is correct
38 Correct 368 ms 95592 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 44884 KB Output is correct
2 Correct 20 ms 44884 KB Output is correct
3 Correct 21 ms 44860 KB Output is correct
4 Correct 20 ms 44896 KB Output is correct
5 Correct 25 ms 44940 KB Output is correct
6 Correct 22 ms 44912 KB Output is correct
7 Correct 23 ms 44936 KB Output is correct
8 Correct 21 ms 44856 KB Output is correct
9 Correct 113 ms 59200 KB Output is correct
10 Correct 35 ms 46552 KB Output is correct
11 Correct 60 ms 52600 KB Output is correct
12 Correct 30 ms 47312 KB Output is correct
13 Correct 39 ms 49804 KB Output is correct
14 Correct 22 ms 45112 KB Output is correct
15 Correct 21 ms 45132 KB Output is correct
16 Correct 119 ms 59144 KB Output is correct
17 Correct 23 ms 44848 KB Output is correct
18 Correct 25 ms 44952 KB Output is correct
19 Correct 21 ms 44864 KB Output is correct
20 Correct 25 ms 44904 KB Output is correct
21 Correct 23 ms 44904 KB Output is correct
22 Correct 24 ms 44856 KB Output is correct
23 Correct 380 ms 87352 KB Output is correct
24 Correct 29 ms 44920 KB Output is correct
25 Correct 24 ms 45256 KB Output is correct
26 Correct 31 ms 45396 KB Output is correct
27 Correct 32 ms 45564 KB Output is correct
28 Correct 151 ms 61916 KB Output is correct
29 Correct 188 ms 70432 KB Output is correct
30 Correct 261 ms 78868 KB Output is correct
31 Correct 383 ms 87296 KB Output is correct
32 Correct 23 ms 44896 KB Output is correct
33 Correct 23 ms 44924 KB Output is correct
34 Correct 23 ms 44868 KB Output is correct
35 Correct 27 ms 44884 KB Output is correct
36 Correct 27 ms 44888 KB Output is correct
37 Correct 23 ms 44848 KB Output is correct
38 Correct 23 ms 44884 KB Output is correct
39 Correct 23 ms 44884 KB Output is correct
40 Correct 23 ms 44884 KB Output is correct
41 Correct 22 ms 44900 KB Output is correct
42 Correct 26 ms 44912 KB Output is correct
43 Correct 26 ms 45140 KB Output is correct
44 Correct 26 ms 45316 KB Output is correct
45 Correct 145 ms 63236 KB Output is correct
46 Correct 195 ms 71688 KB Output is correct
47 Correct 227 ms 71648 KB Output is correct
48 Correct 23 ms 44884 KB Output is correct
49 Correct 24 ms 44864 KB Output is correct
50 Correct 23 ms 44884 KB Output is correct
51 Correct 25 ms 44884 KB Output is correct
52 Correct 23 ms 44864 KB Output is correct
53 Correct 23 ms 44924 KB Output is correct
54 Correct 23 ms 44984 KB Output is correct
55 Correct 292 ms 86996 KB Output is correct
56 Correct 22 ms 44848 KB Output is correct
57 Correct 25 ms 45396 KB Output is correct
58 Correct 30 ms 46284 KB Output is correct
59 Correct 31 ms 46740 KB Output is correct
60 Correct 156 ms 65636 KB Output is correct
61 Correct 183 ms 74240 KB Output is correct
62 Correct 230 ms 79740 KB Output is correct
63 Correct 287 ms 86444 KB Output is correct
64 Correct 28 ms 44884 KB Output is correct
65 Correct 27 ms 44884 KB Output is correct
66 Correct 23 ms 44944 KB Output is correct
67 Correct 270 ms 83296 KB Output is correct
68 Correct 298 ms 83248 KB Output is correct
69 Correct 282 ms 83468 KB Output is correct
70 Correct 33 ms 45780 KB Output is correct
71 Correct 33 ms 46716 KB Output is correct
72 Correct 176 ms 69292 KB Output is correct
73 Correct 283 ms 81932 KB Output is correct
74 Correct 390 ms 93704 KB Output is correct
75 Correct 404 ms 95832 KB Output is correct
76 Correct 261 ms 84312 KB Output is correct
77 Correct 27 ms 46036 KB Output is correct
78 Correct 32 ms 47060 KB Output is correct
79 Correct 165 ms 70228 KB Output is correct
80 Correct 258 ms 82980 KB Output is correct
81 Correct 364 ms 95632 KB Output is correct
82 Correct 24 ms 44960 KB Output is correct
83 Correct 23 ms 44860 KB Output is correct
84 Correct 23 ms 44872 KB Output is correct
85 Correct 483 ms 117088 KB Output is correct
86 Correct 500 ms 116120 KB Output is correct
87 Correct 531 ms 116168 KB Output is correct
88 Correct 466 ms 118260 KB Output is correct
89 Correct 181 ms 69240 KB Output is correct
90 Correct 336 ms 78252 KB Output is correct
91 Correct 268 ms 77948 KB Output is correct
92 Correct 488 ms 127620 KB Output is correct
93 Correct 504 ms 128336 KB Output is correct
94 Correct 578 ms 127684 KB Output is correct
95 Correct 536 ms 128464 KB Output is correct
96 Correct 22 ms 44884 KB Output is correct
97 Correct 50 ms 50320 KB Output is correct
98 Correct 98 ms 57036 KB Output is correct
99 Correct 514 ms 116592 KB Output is correct
100 Correct 33 ms 46676 KB Output is correct
101 Correct 82 ms 53488 KB Output is correct
102 Correct 164 ms 62116 KB Output is correct
103 Correct 188 ms 74356 KB Output is correct
104 Correct 267 ms 84812 KB Output is correct
105 Correct 350 ms 96984 KB Output is correct
106 Correct 428 ms 107516 KB Output is correct
107 Correct 520 ms 118096 KB Output is correct
108 Correct 23 ms 44944 KB Output is correct
109 Correct 23 ms 44884 KB Output is correct
110 Correct 22 ms 44884 KB Output is correct
111 Correct 23 ms 44884 KB Output is correct
112 Correct 23 ms 44928 KB Output is correct
113 Correct 23 ms 44852 KB Output is correct
114 Correct 23 ms 44900 KB Output is correct
115 Correct 24 ms 44848 KB Output is correct
116 Correct 22 ms 44924 KB Output is correct
117 Correct 23 ms 44920 KB Output is correct
118 Correct 23 ms 44872 KB Output is correct
119 Correct 24 ms 45236 KB Output is correct
120 Correct 26 ms 45388 KB Output is correct
121 Correct 142 ms 63244 KB Output is correct
122 Correct 193 ms 71820 KB Output is correct
123 Correct 195 ms 71604 KB Output is correct
124 Correct 26 ms 44968 KB Output is correct
125 Correct 22 ms 44884 KB Output is correct
126 Correct 23 ms 44908 KB Output is correct
127 Correct 259 ms 83212 KB Output is correct
128 Correct 281 ms 83264 KB Output is correct
129 Correct 260 ms 83508 KB Output is correct
130 Correct 27 ms 45780 KB Output is correct
131 Correct 35 ms 46736 KB Output is correct
132 Correct 161 ms 69316 KB Output is correct
133 Correct 283 ms 81904 KB Output is correct
134 Correct 346 ms 93784 KB Output is correct
135 Correct 538 ms 131640 KB Output is correct
136 Correct 545 ms 129672 KB Output is correct
137 Correct 521 ms 116016 KB Output is correct
138 Correct 497 ms 116316 KB Output is correct
139 Correct 463 ms 115008 KB Output is correct
140 Correct 23 ms 44884 KB Output is correct
141 Correct 85 ms 56580 KB Output is correct
142 Correct 43 ms 48280 KB Output is correct
143 Correct 110 ms 56872 KB Output is correct
144 Correct 178 ms 64832 KB Output is correct
145 Correct 241 ms 81332 KB Output is correct
146 Correct 313 ms 90352 KB Output is correct
147 Correct 374 ms 100636 KB Output is correct
148 Correct 456 ms 109156 KB Output is correct
149 Correct 513 ms 118084 KB Output is correct
150 Correct 374 ms 95892 KB Output is correct
151 Correct 263 ms 84292 KB Output is correct
152 Correct 28 ms 46000 KB Output is correct
153 Correct 31 ms 46952 KB Output is correct
154 Correct 173 ms 70208 KB Output is correct
155 Correct 274 ms 83048 KB Output is correct
156 Correct 368 ms 95592 KB Output is correct
157 Correct 23 ms 44884 KB Output is correct
158 Correct 23 ms 44872 KB Output is correct
159 Correct 23 ms 44844 KB Output is correct
160 Correct 23 ms 44908 KB Output is correct
161 Correct 504 ms 113212 KB Output is correct
162 Correct 518 ms 118484 KB Output is correct
163 Correct 498 ms 117392 KB Output is correct
164 Correct 546 ms 117260 KB Output is correct
165 Correct 523 ms 116328 KB Output is correct
166 Correct 524 ms 115248 KB Output is correct
167 Incorrect 101 ms 58616 KB Solution announced impossible, but it is possible.
168 Halted 0 ms 0 KB -