oj.uz

답안 #705672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705672 2023-03-05T00:12:13 Z new_acc Split the Attractions (IOI19_split) C++14
100 / 100
 148 ms 30320 KB 
#include "split.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define pitem item*
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
const int N=2e5+10;
const int SS=1<<19;
const int INFi=2e9;
const ll INFl=1e16;
const ll mod2=998244353;
const ll mod=1e9+7;
const ll mod3=1000696969;
const ll p=70032301;
const ull p2=913;
const int L=20;
int pod[N],o[N];
pair<int,int> t[3];
vi graf[N],drzewo[N],cr,res;
bool vis[N],vis2[N];
void dfs(int v){
    vis[v]=1;
    pod[v]=1;
    for(auto u:graf[v]){
        if(vis[u]) continue;
        drzewo[v].push_back(u);
        dfs(u);
        o[u]=v;
        pod[v]+=pod[u];
    }
}
void dfs2(int v){
    vis[v]=1;
    cr.push_back(v);
    for(auto u:drzewo[v]){
        dfs2(u);
    }
}
void dfs4(int v){
    vis[v]=1;
    cr.push_back(v);
    for(auto u:graf[v]){
        if(vis[u]) continue;
        dfs4(u);
    }
}
int dfs3(int v,int zos){
    if(zos==0) return 0; 
    vis[v]=1;
    if(!vis2[v]){
        zos--;
        res[v-1]=t[0].se;
    }
    for(auto u:graf[v]){
        if(vis[u] or (!vis2[v] and vis2[u])) continue;
        zos=dfs3(u,zos);
    }
    return zos;
}
int centroid(int v,int n){
    for(auto u:drzewo[v]){
        if(pod[u]*2>n)
            return centroid(u,n);
    }
    return v;
}
vi find_split(int n,int a,int b,int cc,vi p,vi q){
    for(int i=0;i<n;i++) res.push_back(0);
    t[0]={a,1},t[1]={b,2},t[2]={cc,3};
    sort(t,t+3);
    for(int i=0;i<p.size();i++){
        int u=p[i],v=q[i];
        u++,v++;
        graf[u].push_back(v),graf[v].push_back(u);
    } 
    dfs(1);
    /*cout<<"\n";
    for(int i=1;i<=n;i++){
        for(auto u:drzewo[i]) cout<<i-1<<" "<<u-1<<"\n";
    }
    exit(0);*/
    for(int i=1;i<=n;i++) vis[i]=0;
    int c=centroid(1,n);
    vector<vi> niz;
    for(auto u:drzewo[c]){
        dfs2(u);
        niz.push_back(cr);
        cr.clear();
    }
    vi ost;
    vis[c]=1;
    if(c!=1){
        dfs4(o[c]);
        niz.push_back(cr);
    }
    for(int i=1;i<=n;i++) vis[i]=0;
    int g=-1;
    for(int i=0;i<niz.size();i++){
        if(niz[i].size()>=t[0].fi){
            g=i;
            for(int i2=0;i2<t[0].fi;i2++)
                res[niz[i][i2]-1]=t[0].se;
            break;
        }
    }
    if(g!=-1){
        res[c-1]=t[1].se;
        t[1].fi--;
        for(int i=0;i<niz.size();i++){
            if(i==g) continue;
            for(int i2=0;i2<niz[i].size() and t[1].fi>0;t[1].fi--,i2++)
                res[niz[i][i2]-1]=t[1].se;
        }
        for(int i=0;i<n;i++)
            if(res[i]==0) res[i]=t[2].se;
        return res;
    }
    if(c==1) return res;
    int sum=t[0].fi;
    for(auto u:niz[niz.size()-1]) res[u-1]=t[0].se,vis2[u]=1,sum--;
    vis[c]=1;
    if(dfs3(o[c],sum)){
        for(auto &u:res) u=0;
        return res;
    }
    res[c-1]=t[1].se;
    t[1].fi--;
    for(auto u:niz){
        bool ok=1;
        for(int i=0;i<u.size();i++){
            if(vis[u[i]]) ok=0;
        }
        if(!ok) continue;
        for(int i=0;i<u.size() and t[1].fi>0;t[1].fi--,i++){
            res[u[i]-1]=t[1].se;
        }
    }
    for(int i=0;i<n;i++) 
        if(!res[i]) res[i]=t[2].se;
    return res;
}
/*int main(){
    int n,a,b,c,m;
    cin>>n>>m>>a>>b>>c;
    vi p,q;
    for(int a,b,i=1;i<=m;i++){
        cin>>a>>b;
        p.push_back(a),q.push_back(b);
    }
    vi ans=find_split(n,a,b,c,p,q);
    return 0;
    for(auto u:ans) cout<<u<<" ";
    cout<<"\n";
}*/

Compilation message

split.cpp: In function 'vi find_split(int, int, int, int, vi, vi)':
split.cpp:75:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int i=0;i<p.size();i++){
      |                 ~^~~~~~~~~
split.cpp:102:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for(int i=0;i<niz.size();i++){
      |                 ~^~~~~~~~~~~
split.cpp:103:25: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  103 |         if(niz[i].size()>=t[0].fi){
      |                         ^
split.cpp:113:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |         for(int i=0;i<niz.size();i++){
      |                     ~^~~~~~~~~~~
split.cpp:115:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             for(int i2=0;i2<niz[i].size() and t[1].fi>0;t[1].fi--,i2++)
      |                          ~~^~~~~~~~~~~~~~
split.cpp:134:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |         for(int i=0;i<u.size();i++){
      |                     ~^~~~~~~~~
split.cpp:138:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |         for(int i=0;i<u.size() and t[1].fi>0;t[1].fi--,i++){
      |                     ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9616 KB ok, correct split
2 Correct 5 ms 9648 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 5 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 85 ms 29916 KB ok, correct split
8 Correct 89 ms 27204 KB ok, correct split
9 Correct 90 ms 26356 KB ok, correct split
10 Correct 85 ms 30296 KB ok, correct split
11 Correct 92 ms 30320 KB ok, correct split

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 6 ms 9684 KB ok, correct split
3 Correct 6 ms 9684 KB ok, correct split
4 Correct 108 ms 24148 KB ok, correct split
5 Correct 75 ms 18148 KB ok, correct split
6 Correct 109 ms 29260 KB ok, correct split
7 Correct 81 ms 25756 KB ok, correct split
8 Correct 118 ms 23068 KB ok, correct split
9 Correct 79 ms 20940 KB ok, correct split
10 Correct 61 ms 23104 KB ok, correct split
11 Correct 56 ms 22996 KB ok, correct split
12 Correct 77 ms 23388 KB ok, correct split

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB ok, correct split
2 Correct 79 ms 18280 KB ok, correct split
3 Correct 28 ms 13492 KB ok, correct split
4 Correct 5 ms 9704 KB ok, correct split
5 Correct 90 ms 24024 KB ok, correct split
6 Correct 75 ms 23656 KB ok, correct split
7 Correct 84 ms 23452 KB ok, correct split
8 Correct 83 ms 25068 KB ok, correct split
9 Correct 99 ms 23192 KB ok, correct split
10 Correct 25 ms 12880 KB ok, no valid answer
11 Correct 38 ms 14536 KB ok, no valid answer
12 Correct 69 ms 21844 KB ok, no valid answer
13 Correct 64 ms 19908 KB ok, no valid answer
14 Correct 68 ms 23436 KB ok, no valid answer

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 9684 KB ok, correct split
2 Correct 5 ms 9684 KB ok, no valid answer
3 Correct 6 ms 9684 KB ok, correct split
4 Correct 7 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 5 ms 9684 KB ok, correct split
8 Correct 5 ms 9684 KB ok, correct split
9 Correct 7 ms 10036 KB ok, correct split
10 Correct 7 ms 9948 KB ok, correct split
11 Correct 6 ms 9704 KB ok, correct split
12 Correct 9 ms 9940 KB ok, correct split
13 Correct 6 ms 9684 KB ok, correct split
14 Correct 6 ms 9684 KB ok, correct split
15 Correct 7 ms 9684 KB ok, correct split
16 Correct 5 ms 9684 KB ok, correct split
17 Correct 5 ms 9684 KB ok, correct split
18 Correct 5 ms 9684 KB ok, correct split
19 Correct 7 ms 9704 KB ok, correct split
20 Correct 5 ms 9764 KB ok, correct split
21 Correct 6 ms 10068 KB ok, correct split
22 Correct 7 ms 9980 KB ok, correct split
23 Correct 8 ms 10100 KB ok, correct split
24 Correct 6 ms 9968 KB ok, correct split
25 Correct 6 ms 9976 KB ok, correct split
26 Correct 8 ms 10100 KB ok, correct split
27 Correct 9 ms 10068 KB ok, correct split
28 Correct 7 ms 10036 KB ok, correct split
29 Correct 5 ms 9684 KB ok, correct split
30 Correct 7 ms 10068 KB ok, correct split
31 Correct 8 ms 9716 KB ok, correct split
32 Correct 6 ms 9684 KB ok, correct split
33 Correct 7 ms 9684 KB ok, correct split
34 Correct 7 ms 9940 KB ok, correct split
35 Correct 7 ms 9892 KB ok, correct split
36 Correct 8 ms 9844 KB ok, correct split
37 Correct 7 ms 9996 KB ok, correct split
38 Correct 8 ms 10068 KB ok, correct split
39 Correct 7 ms 9916 KB ok, correct split
40 Correct 7 ms 10040 KB ok, correct split
41 Correct 9 ms 9812 KB ok, correct split
42 Correct 7 ms 9812 KB ok, correct split
43 Correct 8 ms 10068 KB ok, correct split
44 Correct 7 ms 9976 KB ok, correct split
45 Correct 9 ms 9968 KB ok, correct split
46 Correct 7 ms 9992 KB ok, correct split
47 Correct 6 ms 10068 KB ok, no valid answer
48 Correct 9 ms 9996 KB ok, correct split
49 Correct 6 ms 10104 KB ok, correct split
50 Correct 6 ms 9684 KB ok, no valid answer
51 Correct 6 ms 9684 KB ok, no valid answer
52 Correct 6 ms 9868 KB ok, no valid answer
53 Correct 10 ms 9940 KB ok, no valid answer
54 Correct 7 ms 10108 KB ok, no valid answer
55 Correct 7 ms 9972 KB ok, no valid answer
56 Correct 8 ms 9992 KB ok, no valid answer

Subtask #5
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9616 KB ok, correct split
2 Correct 5 ms 9648 KB ok, correct split
3 Correct 5 ms 9684 KB ok, correct split
4 Correct 5 ms 9684 KB ok, correct split
5 Correct 6 ms 9684 KB ok, correct split
6 Correct 5 ms 9684 KB ok, correct split
7 Correct 85 ms 29916 KB ok, correct split
8 Correct 89 ms 27204 KB ok, correct split
9 Correct 90 ms 26356 KB ok, correct split
10 Correct 85 ms 30296 KB ok, correct split
11 Correct 92 ms 30320 KB ok, correct split
12 Correct 5 ms 9684 KB ok, correct split
13 Correct 6 ms 9684 KB ok, correct split
14 Correct 6 ms 9684 KB ok, correct split
15 Correct 108 ms 24148 KB ok, correct split
16 Correct 75 ms 18148 KB ok, correct split
17 Correct 109 ms 29260 KB ok, correct split
18 Correct 81 ms 25756 KB ok, correct split
19 Correct 118 ms 23068 KB ok, correct split
20 Correct 79 ms 20940 KB ok, correct split
21 Correct 61 ms 23104 KB ok, correct split
22 Correct 56 ms 22996 KB ok, correct split
23 Correct 77 ms 23388 KB ok, correct split
24 Correct 5 ms 9684 KB ok, correct split
25 Correct 79 ms 18280 KB ok, correct split
26 Correct 28 ms 13492 KB ok, correct split
27 Correct 5 ms 9704 KB ok, correct split
28 Correct 90 ms 24024 KB ok, correct split
29 Correct 75 ms 23656 KB ok, correct split
30 Correct 84 ms 23452 KB ok, correct split
31 Correct 83 ms 25068 KB ok, correct split
32 Correct 99 ms 23192 KB ok, correct split
33 Correct 25 ms 12880 KB ok, no valid answer
34 Correct 38 ms 14536 KB ok, no valid answer
35 Correct 69 ms 21844 KB ok, no valid answer
36 Correct 64 ms 19908 KB ok, no valid answer
37 Correct 68 ms 23436 KB ok, no valid answer
38 Correct 8 ms 9684 KB ok, correct split
39 Correct 5 ms 9684 KB ok, no valid answer
40 Correct 6 ms 9684 KB ok, correct split
41 Correct 7 ms 9684 KB ok, correct split
42 Correct 6 ms 9684 KB ok, correct split
43 Correct 5 ms 9684 KB ok, correct split
44 Correct 5 ms 9684 KB ok, correct split
45 Correct 5 ms 9684 KB ok, correct split
46 Correct 7 ms 10036 KB ok, correct split
47 Correct 7 ms 9948 KB ok, correct split
48 Correct 6 ms 9704 KB ok, correct split
49 Correct 9 ms 9940 KB ok, correct split
50 Correct 6 ms 9684 KB ok, correct split
51 Correct 6 ms 9684 KB ok, correct split
52 Correct 7 ms 9684 KB ok, correct split
53 Correct 5 ms 9684 KB ok, correct split
54 Correct 5 ms 9684 KB ok, correct split
55 Correct 5 ms 9684 KB ok, correct split
56 Correct 7 ms 9704 KB ok, correct split
57 Correct 5 ms 9764 KB ok, correct split
58 Correct 6 ms 10068 KB ok, correct split
59 Correct 7 ms 9980 KB ok, correct split
60 Correct 8 ms 10100 KB ok, correct split
61 Correct 6 ms 9968 KB ok, correct split
62 Correct 6 ms 9976 KB ok, correct split
63 Correct 8 ms 10100 KB ok, correct split
64 Correct 9 ms 10068 KB ok, correct split
65 Correct 7 ms 10036 KB ok, correct split
66 Correct 5 ms 9684 KB ok, correct split
67 Correct 7 ms 10068 KB ok, correct split
68 Correct 8 ms 9716 KB ok, correct split
69 Correct 6 ms 9684 KB ok, correct split
70 Correct 7 ms 9684 KB ok, correct split
71 Correct 7 ms 9940 KB ok, correct split
72 Correct 7 ms 9892 KB ok, correct split
73 Correct 8 ms 9844 KB ok, correct split
74 Correct 7 ms 9996 KB ok, correct split
75 Correct 8 ms 10068 KB ok, correct split
76 Correct 7 ms 9916 KB ok, correct split
77 Correct 7 ms 10040 KB ok, correct split
78 Correct 9 ms 9812 KB ok, correct split
79 Correct 7 ms 9812 KB ok, correct split
80 Correct 8 ms 10068 KB ok, correct split
81 Correct 7 ms 9976 KB ok, correct split
82 Correct 9 ms 9968 KB ok, correct split
83 Correct 7 ms 9992 KB ok, correct split
84 Correct 6 ms 10068 KB ok, no valid answer
85 Correct 9 ms 9996 KB ok, correct split
86 Correct 6 ms 10104 KB ok, correct split
87 Correct 6 ms 9684 KB ok, no valid answer
88 Correct 6 ms 9684 KB ok, no valid answer
89 Correct 6 ms 9868 KB ok, no valid answer
90 Correct 10 ms 9940 KB ok, no valid answer
91 Correct 7 ms 10108 KB ok, no valid answer
92 Correct 7 ms 9972 KB ok, no valid answer
93 Correct 8 ms 9992 KB ok, no valid answer
94 Correct 85 ms 23084 KB ok, correct split
95 Correct 148 ms 29208 KB ok, correct split
96 Correct 98 ms 27280 KB ok, correct split
97 Correct 26 ms 13536 KB ok, correct split
98 Correct 28 ms 13700 KB ok, correct split
99 Correct 41 ms 16476 KB ok, correct split
100 Correct 104 ms 24004 KB ok, correct split
101 Correct 91 ms 22632 KB ok, correct split
102 Correct 83 ms 23048 KB ok, correct split
103 Correct 89 ms 23292 KB ok, correct split
104 Correct 73 ms 22256 KB ok, correct split
105 Correct 45 ms 15920 KB ok, correct split
106 Correct 83 ms 26468 KB ok, correct split
107 Correct 67 ms 19396 KB ok, correct split
108 Correct 68 ms 19424 KB ok, correct split
109 Correct 108 ms 23044 KB ok, correct split
110 Correct 98 ms 23904 KB ok, correct split
111 Correct 98 ms 24048 KB ok, correct split
112 Correct 97 ms 22792 KB ok, correct split
113 Correct 91 ms 22660 KB ok, correct split
114 Correct 14 ms 11420 KB ok, correct split
115 Correct 13 ms 11176 KB ok, correct split
116 Correct 94 ms 23884 KB ok, correct split
117 Correct 96 ms 23876 KB ok, correct split
118 Correct 76 ms 21080 KB ok, correct split
119 Correct 76 ms 20808 KB ok, correct split
120 Correct 86 ms 25936 KB ok, correct split
121 Correct 72 ms 19488 KB ok, no valid answer
122 Correct 71 ms 20204 KB ok, no valid answer
123 Correct 99 ms 24032 KB ok, no valid answer
124 Correct 99 ms 24004 KB ok, no valid answer
125 Correct 71 ms 24200 KB ok, no valid answer
126 Correct 47 ms 22028 KB ok, no valid answer
127 Correct 73 ms 23392 KB ok, no valid answer