oj.uz

Submission #394194

# Submission time Handle Problem Language Result Execution time Memory
394194 2021-04-26T05:07:45 Z BJoozz Fun Tour (APIO20_fun) C++14
100 / 100
 411 ms 20580 KB 
#include<bits/stdc++.h>
using namespace std;
#include "fun.h"
#define X first
#define Y second
#define pb push_back
#define getdis hoursRequired
#define getsz attractionsBehind
const int MAX=100005,mod=1e9+7,M=2000,inf=1e9;
void maxx(int &a,int b){if(b>a) a=b;}
using ii = pair < int ,int > ;
void minn(int &a,int b){if(b<a) a=b;}
void maxp(ii &a,ii b){if(b>a) a=b;}
void minp(ii &a,ii b){if(b<a) a=b;}
bool cp(ii &a,ii b){if(b>a) {a=b;return 1;}else return 0;}
void PL(int &a,int b){a+=b;if(a>=mod) a-=mod;}


///+++++++++++++++++++++++++++++
int a[MAX],sz[4],h[MAX];
bool vs[MAX];
int D[4];
short bel[MAX];
int L[4][MAX];
int getdeep(int v){
    ii u = ii (0,0);
    int r;
    for(int i=1;i<=3;i++) if(i!=v && sz[i]!=0)
        if( cp(u,ii(h[L[i][sz[i]]],sz[i])) ) r=i;
    return r;
}
bool cmp(int u,int v){
return h[u]<h[v];}
std::vector<int> createFunTour(int n,int Q){
    vector < int > vec;
    a[0]=n;
    if(n==2){
        vec.pb(0);vec.pb(1);return vec;
    }
    int r=0;
    for(int i=1;i<n;i++){
        a[i]=getsz(0,i);
        if(a[i]>n/2 && a[i]<a[r]) {
            r=i;
        }
    }
    int cn=0;
    for(int i=0;i<n;i++)if(r!=i){
        h[i]=getdis(r,i);
        if(h[i]==1) D[++cn]=i;
    }
    vs[r]=1;
    for(int i=1,u;i<=cn;i++){
        u=D[i];
        bel[u]=i;
        L[i][1]=u;
        vs[u]=1;
        sz[i]=getsz(r,u);
        ///co the toi uu
    }
    int top[4]={1,1,1,1};
    for(int i=0;i<n;i++) if(!vs[i]){
        if(getdis(D[1],i)==h[i]-1){
            bel[i]=1;
        }
        else{
            if(getdis(D[2],i)==h[i]-1)
            bel[i]=2;
            else bel[i]=3;
        }
        L[bel[i]][++top[bel[i]]]=i;
        //cout<<i<<' '<<bel[i]<<'\n';
    }

    for(int i=1;i<=cn;i++){
        sort(L[i]+1,L[i]+1+sz[i],cmp);
    }
    int las=0;
    int allsz=n;
    bool okk=1;
    for(int i=1;i<n && okk;i++){
        int z=getdeep(las);
        int v=L[z][sz[z]];
        vec.pb(v);
        sz[z]--;
        allsz--;
        las=z;

        for(int i=1;i<=cn;i++)
            if(sz[i]>=allsz/2){
                okk=0;break;
            }
    }
    if(!okk && allsz>1){
        int sp;
        for(int i=1;i<=cn;i++)
            if(sz[i]>=allsz/2){
                sp=i;break;
            }
            int z=getdeep(0);
            if(z!=las && z!=sp){
                int v=L[z][sz[z]];
                vec.pb(v);
                sz[z]--;
                allsz--;
                las=z;
            }
        bool turn=(las!=sp);
        //for ( int u:vec) cout<<u<<' ';cout<<'\n';
        //cout<<las<<' '<<sp<<'\n';
        //cout<<allsz;return vec;
        //cout<<sz[sp]<<' '<<allsz<<'\n';
        while(allsz>1){
            if(turn){
                int z=sp;
                if(sz[z]==0) {turn^=1;continue;}
                int v=L[z][sz[z]];
                vec.pb(v);
                sz[z]--;
                allsz--;
                las=z;
            }
            else{
                int z=getdeep(sp);
                if(sz[z]==0) {turn^=1;continue;}
                int v=L[z][sz[z]];
                vec.pb(v);
                sz[z]--;
                allsz--;
                las=z;
            }
            turn^=1;
        }
    }
    vec.pb(r);
    //cout<<allsz<<'\n';
    return vec;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:96:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   96 |         for(int i=1;i<=cn;i++)
      |         ^~~
fun.cpp:100:13: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  100 |             int z=getdeep(0);
      |             ^~~
fun.cpp: In function 'int getdeep(int)':
fun.cpp:30:12: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |     return r;
      |            ^
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:104:22: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
  104 |                 sz[z]--;
      |                 ~~~~~^~
fun.cpp:28:27: warning: 'r' may be used uninitialized in this function [-Wmaybe-uninitialized]
   28 |     for(int i=1;i<=3;i++) if(i!=v && sz[i]!=0)
      |                           ^~
fun.cpp:27:9: note: 'r' was declared here
   27 |     int r;
      |         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 141 ms 15492 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 2 ms 588 KB Output is correct
21 Correct 4 ms 716 KB Output is correct
22 Correct 7 ms 1228 KB Output is correct
23 Correct 13 ms 2252 KB Output is correct
24 Correct 17 ms 2892 KB Output is correct
25 Correct 75 ms 8924 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 11 ms 1740 KB Output is correct
15 Correct 143 ms 15464 KB Output is correct
16 Correct 154 ms 15360 KB Output is correct
17 Correct 27 ms 3960 KB Output is correct
18 Correct 64 ms 7172 KB Output is correct
19 Correct 129 ms 12196 KB Output is correct
20 Correct 5 ms 844 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 141 ms 15492 KB Output is correct
45 Correct 1 ms 448 KB Output is correct
46 Correct 2 ms 588 KB Output is correct
47 Correct 4 ms 716 KB Output is correct
48 Correct 7 ms 1228 KB Output is correct
49 Correct 13 ms 2252 KB Output is correct
50 Correct 17 ms 2892 KB Output is correct
51 Correct 75 ms 8924 KB Output is correct
52 Correct 1 ms 460 KB Output is correct
53 Correct 11 ms 1740 KB Output is correct
54 Correct 143 ms 15464 KB Output is correct
55 Correct 154 ms 15360 KB Output is correct
56 Correct 27 ms 3960 KB Output is correct
57 Correct 64 ms 7172 KB Output is correct
58 Correct 129 ms 12196 KB Output is correct
59 Correct 5 ms 844 KB Output is correct
60 Correct 189 ms 15624 KB Output is correct
61 Correct 237 ms 17928 KB Output is correct
62 Correct 177 ms 15468 KB Output is correct
63 Correct 230 ms 19364 KB Output is correct
64 Correct 228 ms 19388 KB Output is correct
65 Correct 208 ms 15444 KB Output is correct
66 Correct 240 ms 17736 KB Output is correct
67 Correct 268 ms 19420 KB Output is correct
68 Correct 240 ms 18588 KB Output is correct
69 Correct 375 ms 20028 KB Output is correct
70 Correct 179 ms 15548 KB Output is correct
71 Correct 233 ms 19728 KB Output is correct
72 Correct 259 ms 18268 KB Output is correct
73 Correct 253 ms 18780 KB Output is correct
74 Correct 411 ms 20444 KB Output is correct
75 Correct 224 ms 15728 KB Output is correct
76 Correct 279 ms 19684 KB Output is correct
77 Correct 251 ms 19648 KB Output is correct
78 Correct 234 ms 19000 KB Output is correct
79 Correct 328 ms 20252 KB Output is correct
80 Correct 381 ms 20580 KB Output is correct
81 Correct 227 ms 15620 KB Output is correct
82 Correct 197 ms 15616 KB Output is correct
83 Correct 248 ms 15760 KB Output is correct
84 Correct 75 ms 6904 KB Output is correct