oj.uz

답안 #146906

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146906 2019-08-26T14:37:15 Z Bodo171 Split the Attractions (IOI19_split) C++14
100 / 100
 230 ms 28516 KB 
#include "split.h"
#include <vector>
#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
const int nmax=100005;
pair<int,int> col[5];
vector<int> res;
vector<int> v[nmax],ad[nmax],arb[nmax];
int l[nmax],r[nmax],rep[nmax],w[nmax],pond[nmax],big[nmax],q[nmax],viz[nmax],valid[nmax],tt[nmax];
int nr,x,sum,p,u,i,j,k,nod,A,act,gasit,n,cen;
void dfs(int x)
{
    rep[++nr]=x;l[x]=nr;
    w[x]=1;
    for(int i=0;i<arb[x].size();i++)
        if(!w[arb[x][i]])
    {
        tt[arb[x][i]]=x;
        dfs(arb[x][i]);
        w[x]+=w[arb[x][i]];
        big[x]=max(big[x],w[arb[x][i]]);
    }
    r[x]=nr;
}
void bfs(int x)
{
    q[u=1]=x;sum=pond[x];viz[x]=1;
    for(p=1;p<=u;p++)
    {
        x=q[p];
        for(i=0;i<ad[x].size();i++)
        {
            nod=ad[x][i];
            if(!viz[nod])
            {
                viz[nod]=1;
                sum+=pond[nod];
                q[++u]=nod;
                if(sum>=A)
                {
                    for(j=1;j<=u;j++)
                    {
                        act=q[j];
                        for(k=l[act];k<=r[act];k++)
                            valid[rep[k]]=1;
                    }
                    gasit=1;
                    return;
                }
            }
        }
    }
}
void coloreaza(int cate,int C)
{
    int start=0;
    for(i=0;i<n;i++)
    {
        if(valid[i])
            start=i;
        viz[i]=0;
    }
    q[u=1]=start;viz[start]=1;
    for(p=1;p<=u;p++)
    {
        x=q[p];
        res[x]=C;
        if(p==cate) return;
        for(i=0;i<v[x].size();i++)
            if(valid[v[x][i]]&&(!viz[v[x][i]]))
            {
                q[++u]=v[x][i];
                viz[v[x][i]]=1;
            }
    }
}
vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q) {
    n=N;
    res.resize(n);
    for(i=0;i<n;i++)
        res[i]=0;
    col[0]={a,1};
    col[1]={b,2};
    col[2]={c,3};
    sort(col,col+3);
    A=col[0].first;
    int m=p.size();
    for(i=0;i<m;i++)
    {
        v[p[i]].push_back(q[i]);
        v[q[i]].push_back(p[i]);
    }
    for(i=0;i<n;i++)
        arb[i]=v[i];
    dfs(0);
    for(i=0;i<n;i++)
      arb[i].clear();
    for(i=1;i<n;i++)
    {
        arb[tt[i]].push_back(i);
        arb[i].push_back(tt[i]);
    }
    for(i=0;i<n;i++)
        if(n-w[i]<=n/2&&big[i]<=n/2)
           cen=i;
    for(i=0;i<n;i++)
        w[i]=0;
    nr=0;
    dfs(cen);
    for(i=0;i<arb[cen].size();i++)
    {
        x=arb[cen][i];
        for(j=l[x];j<=r[x];j++)
        {
            nod=rep[j];
            tt[nod]=x;
        }
        pond[x]=w[x];
        if(pond[x]>=A&&(!gasit))
        {
            gasit=1;
            for(j=l[x];j<=r[x];j++)
            {
                valid[rep[j]]=1;
            }
        }
    }
    for(i=0;i<m;i++)
        if(p[i]!=cen&&q[i]!=cen)
    {
        ad[tt[p[i]]].push_back(tt[q[i]]);
        ad[tt[q[i]]].push_back(tt[p[i]]);
    }
    for(int it=0;it<v[cen].size()&&(!gasit);it++)
    {
        if(!viz[v[cen][it]])
            bfs(v[cen][it]);
    }
    if(!gasit) return res;
    coloreaza(col[0].first,col[0].second);
    for(i=0;i<n;i++)
        valid[i]^=1;
    coloreaza(col[1].first,col[1].second);
    for(i=0;i<n;i++)
        if(!res[i])
          res[i]=col[2].second;
	return res;
}

Compilation message

split.cpp: In function 'void dfs(int)':
split.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<arb[x].size();i++)
                 ~^~~~~~~~~~~~~~
split.cpp: In function 'void bfs(int)':
split.cpp:33:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(i=0;i<ad[x].size();i++)
                 ~^~~~~~~~~~~~~
split.cpp: In function 'void coloreaza(int, int)':
split.cpp:71:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(i=0;i<v[x].size();i++)
                 ~^~~~~~~~~~~~
split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:112:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<arb[cen].size();i++)
             ~^~~~~~~~~~~~~~~~
split.cpp:136:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int it=0;it<v[cen].size()&&(!gasit);it++)
                  ~~^~~~~~~~~~~~~~
split.cpp:146:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for(i=0;i<n;i++)
     ^~~
split.cpp:149:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  return res;
  ^~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 9 ms 7416 KB ok, correct split
4 Correct 9 ms 7416 KB ok, correct split
5 Correct 8 ms 7416 KB ok, correct split
6 Correct 9 ms 7416 KB ok, correct split
7 Correct 172 ms 24780 KB ok, correct split
8 Correct 167 ms 23276 KB ok, correct split
9 Correct 164 ms 22988 KB ok, correct split
10 Correct 156 ms 24812 KB ok, correct split
11 Correct 157 ms 24992 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 9 ms 7360 KB ok, correct split
4 Correct 173 ms 23568 KB ok, correct split
5 Correct 136 ms 20728 KB ok, correct split
6 Correct 137 ms 24812 KB ok, correct split
7 Correct 151 ms 23236 KB ok, correct split
8 Correct 189 ms 24184 KB ok, correct split
9 Correct 142 ms 20324 KB ok, correct split
10 Correct 97 ms 20236 KB ok, correct split
11 Correct 97 ms 20236 KB ok, correct split
12 Correct 100 ms 20300 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 131 ms 20700 KB ok, correct split
3 Correct 49 ms 12664 KB ok, correct split
4 Correct 8 ms 7416 KB ok, correct split
5 Correct 147 ms 21828 KB ok, correct split
6 Correct 150 ms 21740 KB ok, correct split
7 Correct 160 ms 21868 KB ok, correct split
8 Correct 157 ms 22444 KB ok, correct split
9 Correct 152 ms 21724 KB ok, correct split
10 Correct 43 ms 11768 KB ok, no valid answer
11 Correct 62 ms 13944 KB ok, no valid answer
12 Correct 116 ms 20088 KB ok, no valid answer
13 Correct 139 ms 20472 KB ok, no valid answer
14 Correct 96 ms 19572 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, no valid answer
3 Correct 9 ms 7416 KB ok, correct split
4 Correct 9 ms 7416 KB ok, correct split
5 Correct 8 ms 7416 KB ok, correct split
6 Correct 8 ms 7416 KB ok, correct split
7 Correct 9 ms 7416 KB ok, correct split
8 Correct 9 ms 7364 KB ok, correct split
9 Correct 12 ms 7800 KB ok, correct split
10 Correct 12 ms 7800 KB ok, correct split
11 Correct 9 ms 7416 KB ok, correct split
12 Correct 11 ms 7880 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 8 ms 7416 KB ok, correct split
15 Correct 8 ms 7416 KB ok, correct split
16 Correct 9 ms 7464 KB ok, correct split
17 Correct 8 ms 7416 KB ok, correct split
18 Correct 9 ms 7416 KB ok, correct split
19 Correct 8 ms 7416 KB ok, correct split
20 Correct 10 ms 7544 KB ok, correct split
21 Correct 11 ms 7800 KB ok, correct split
22 Correct 11 ms 7800 KB ok, correct split
23 Correct 11 ms 7800 KB ok, correct split
24 Correct 11 ms 7804 KB ok, correct split
25 Correct 11 ms 7800 KB ok, correct split
26 Correct 12 ms 7928 KB ok, correct split
27 Correct 11 ms 7928 KB ok, correct split
28 Correct 12 ms 7928 KB ok, correct split
29 Correct 9 ms 7544 KB ok, correct split
30 Correct 12 ms 7932 KB ok, correct split
31 Correct 11 ms 7544 KB ok, correct split
32 Correct 9 ms 7420 KB ok, correct split
33 Correct 9 ms 7544 KB ok, correct split
34 Correct 12 ms 7800 KB ok, correct split
35 Correct 11 ms 7800 KB ok, correct split
36 Correct 11 ms 7800 KB ok, correct split
37 Correct 12 ms 7928 KB ok, correct split
38 Correct 12 ms 7928 KB ok, correct split
39 Correct 12 ms 7928 KB ok, correct split
40 Correct 12 ms 7928 KB ok, correct split
41 Correct 10 ms 7672 KB ok, correct split
42 Correct 10 ms 7672 KB ok, correct split
43 Correct 12 ms 7928 KB ok, correct split
44 Correct 12 ms 7928 KB ok, correct split
45 Correct 12 ms 7804 KB ok, correct split
46 Correct 11 ms 7800 KB ok, correct split
47 Correct 11 ms 7800 KB ok, no valid answer
48 Correct 11 ms 7800 KB ok, correct split
49 Correct 11 ms 7800 KB ok, correct split
50 Correct 9 ms 7420 KB ok, no valid answer
51 Correct 9 ms 7416 KB ok, no valid answer
52 Correct 11 ms 7800 KB ok, no valid answer
53 Correct 12 ms 7928 KB ok, no valid answer
54 Correct 11 ms 7672 KB ok, no valid answer
55 Correct 11 ms 7800 KB ok, no valid answer
56 Correct 13 ms 7804 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7416 KB ok, correct split
2 Correct 8 ms 7416 KB ok, correct split
3 Correct 9 ms 7416 KB ok, correct split
4 Correct 9 ms 7416 KB ok, correct split
5 Correct 8 ms 7416 KB ok, correct split
6 Correct 9 ms 7416 KB ok, correct split
7 Correct 172 ms 24780 KB ok, correct split
8 Correct 167 ms 23276 KB ok, correct split
9 Correct 164 ms 22988 KB ok, correct split
10 Correct 156 ms 24812 KB ok, correct split
11 Correct 157 ms 24992 KB ok, correct split
12 Correct 8 ms 7416 KB ok, correct split
13 Correct 8 ms 7416 KB ok, correct split
14 Correct 9 ms 7360 KB ok, correct split
15 Correct 173 ms 23568 KB ok, correct split
16 Correct 136 ms 20728 KB ok, correct split
17 Correct 137 ms 24812 KB ok, correct split
18 Correct 151 ms 23236 KB ok, correct split
19 Correct 189 ms 24184 KB ok, correct split
20 Correct 142 ms 20324 KB ok, correct split
21 Correct 97 ms 20236 KB ok, correct split
22 Correct 97 ms 20236 KB ok, correct split
23 Correct 100 ms 20300 KB ok, correct split
24 Correct 8 ms 7416 KB ok, correct split
25 Correct 131 ms 20700 KB ok, correct split
26 Correct 49 ms 12664 KB ok, correct split
27 Correct 8 ms 7416 KB ok, correct split
28 Correct 147 ms 21828 KB ok, correct split
29 Correct 150 ms 21740 KB ok, correct split
30 Correct 160 ms 21868 KB ok, correct split
31 Correct 157 ms 22444 KB ok, correct split
32 Correct 152 ms 21724 KB ok, correct split
33 Correct 43 ms 11768 KB ok, no valid answer
34 Correct 62 ms 13944 KB ok, no valid answer
35 Correct 116 ms 20088 KB ok, no valid answer
36 Correct 139 ms 20472 KB ok, no valid answer
37 Correct 96 ms 19572 KB ok, no valid answer
38 Correct 8 ms 7416 KB ok, correct split
39 Correct 8 ms 7416 KB ok, no valid answer
40 Correct 9 ms 7416 KB ok, correct split
41 Correct 9 ms 7416 KB ok, correct split
42 Correct 8 ms 7416 KB ok, correct split
43 Correct 8 ms 7416 KB ok, correct split
44 Correct 9 ms 7416 KB ok, correct split
45 Correct 9 ms 7364 KB ok, correct split
46 Correct 12 ms 7800 KB ok, correct split
47 Correct 12 ms 7800 KB ok, correct split
48 Correct 9 ms 7416 KB ok, correct split
49 Correct 11 ms 7880 KB ok, correct split
50 Correct 8 ms 7416 KB ok, correct split
51 Correct 8 ms 7416 KB ok, correct split
52 Correct 8 ms 7416 KB ok, correct split
53 Correct 9 ms 7464 KB ok, correct split
54 Correct 8 ms 7416 KB ok, correct split
55 Correct 9 ms 7416 KB ok, correct split
56 Correct 8 ms 7416 KB ok, correct split
57 Correct 10 ms 7544 KB ok, correct split
58 Correct 11 ms 7800 KB ok, correct split
59 Correct 11 ms 7800 KB ok, correct split
60 Correct 11 ms 7800 KB ok, correct split
61 Correct 11 ms 7804 KB ok, correct split
62 Correct 11 ms 7800 KB ok, correct split
63 Correct 12 ms 7928 KB ok, correct split
64 Correct 11 ms 7928 KB ok, correct split
65 Correct 12 ms 7928 KB ok, correct split
66 Correct 9 ms 7544 KB ok, correct split
67 Correct 12 ms 7932 KB ok, correct split
68 Correct 11 ms 7544 KB ok, correct split
69 Correct 9 ms 7420 KB ok, correct split
70 Correct 9 ms 7544 KB ok, correct split
71 Correct 12 ms 7800 KB ok, correct split
72 Correct 11 ms 7800 KB ok, correct split
73 Correct 11 ms 7800 KB ok, correct split
74 Correct 12 ms 7928 KB ok, correct split
75 Correct 12 ms 7928 KB ok, correct split
76 Correct 12 ms 7928 KB ok, correct split
77 Correct 12 ms 7928 KB ok, correct split
78 Correct 10 ms 7672 KB ok, correct split
79 Correct 10 ms 7672 KB ok, correct split
80 Correct 12 ms 7928 KB ok, correct split
81 Correct 12 ms 7928 KB ok, correct split
82 Correct 12 ms 7804 KB ok, correct split
83 Correct 11 ms 7800 KB ok, correct split
84 Correct 11 ms 7800 KB ok, no valid answer
85 Correct 11 ms 7800 KB ok, correct split
86 Correct 11 ms 7800 KB ok, correct split
87 Correct 9 ms 7420 KB ok, no valid answer
88 Correct 9 ms 7416 KB ok, no valid answer
89 Correct 11 ms 7800 KB ok, no valid answer
90 Correct 12 ms 7928 KB ok, no valid answer
91 Correct 11 ms 7672 KB ok, no valid answer
92 Correct 11 ms 7800 KB ok, no valid answer
93 Correct 13 ms 7804 KB ok, no valid answer
94 Correct 186 ms 23804 KB ok, correct split
95 Correct 230 ms 28516 KB ok, correct split
96 Correct 205 ms 26768 KB ok, correct split
97 Correct 52 ms 13432 KB ok, correct split
98 Correct 53 ms 13436 KB ok, correct split
99 Correct 77 ms 15604 KB ok, correct split
100 Correct 210 ms 26644 KB ok, correct split
101 Correct 188 ms 24952 KB ok, correct split
102 Correct 174 ms 25000 KB ok, correct split
103 Correct 163 ms 24944 KB ok, correct split
104 Correct 158 ms 25804 KB ok, correct split
105 Correct 91 ms 17040 KB ok, correct split
106 Correct 181 ms 28308 KB ok, correct split
107 Correct 147 ms 22136 KB ok, correct split
108 Correct 138 ms 21752 KB ok, correct split
109 Correct 209 ms 26360 KB ok, correct split
110 Correct 204 ms 26864 KB ok, correct split
111 Correct 196 ms 26480 KB ok, correct split
112 Correct 194 ms 27248 KB ok, correct split
113 Correct 183 ms 26736 KB ok, correct split
114 Correct 24 ms 9592 KB ok, correct split
115 Correct 23 ms 9464 KB ok, correct split
116 Correct 206 ms 26864 KB ok, correct split
117 Correct 184 ms 26008 KB ok, correct split
118 Correct 153 ms 21352 KB ok, correct split
119 Correct 152 ms 21624 KB ok, correct split
120 Correct 177 ms 24044 KB ok, correct split
121 Correct 127 ms 21496 KB ok, no valid answer
122 Correct 125 ms 21284 KB ok, no valid answer
123 Correct 201 ms 26036 KB ok, no valid answer
124 Correct 206 ms 26332 KB ok, no valid answer
125 Correct 139 ms 22460 KB ok, no valid answer
126 Correct 87 ms 19312 KB ok, no valid answer
127 Correct 154 ms 23920 KB ok, no valid answer