oj.uz

Submission #854148

# Submission time Handle Problem Language Result Execution time Memory
854148 2023-09-26T08:51:46 Z 8pete8 Village (BOI20_village) C++14
56 / 100
 59 ms 21804 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mxn=1e5,mod=1000000007,lg=25,root=1000,inf=1e18;
vector<int>adj[mxn+10];
int subsize[mxn+10],n;
int ansmn[mxn+10],ansmx[mxn+10],up[mxn+10][lg+10],h[mxn+10];
stack<int>sub;
int ans2=0,ans1=0;
bool cmp(int a,int b){return subsize[a]>subsize[b];}
void build(int cur,int p){
    subsize[cur]=1;
    for(auto i:adj[cur]){
        if(i==p)continue;
        build(i,cur);
        ans2+=min(subsize[i],n-subsize[i]);//we claim we can achive this
        subsize[cur]+=subsize[i];
    }
}
int getcen(int cur,int p){
    for(auto i:adj[cur]){
        if(i==p)continue;
        if(subsize[i]*2>n)return getcen(i,cur);
    }
    return cur;
}
void dfs(int cur,int p){
    sub.push(cur);
    for(auto i:adj[cur]){
        if(i==p)continue;
        dfs(i,cur);
    }
}
int solvemn(int cur,int p){
    vector<int>v;
    for(auto i:adj[cur]){
        if(i==p)continue;
        if(solvemn(i,cur))v.pb(i);
    }
    if(v.size()){
        ans1++;
        ansmn[cur]=v[0];
        for(int i=0;i<v.size()-1;i++)ansmn[v[i]]=v[i+1],ans1+=2;
        ansmn[v[v.size()-1]]=cur;
        ans1++;
    }
    else return 1;
    return 0;
}
void solvemx(){
    int node=getcen(1,-1);
    stack<int>st;
    sort(all(adj[node]),cmp);
    for(auto i:adj[node]){
        dfs(i,node);
        int k=st.size();
        k=min(k,subsize[i]);
        for(int j=0;j<k;j++){
            ansmx[sub.top()]=st.top();
            ansmx[st.top()]=sub.top();
            sub.pop();
            st.pop();
        }
        while(!sub.empty()){
            st.push(sub.top());
            sub.pop();
        }
    }
    if(st.size()){
        ansmx[node]=st.top();
        ansmx[st.top()]=node;
        return;
    }
    int g=1;
    if(node==1)g=2;
    ansmx[node]=g;
    ansmx[ansmx[g]]=node;
    //for(auto i:sub)cout<<i<<"\n";
}
int32_t main(){
    fastio
    cin>>n;
    for(int i=0;i<n-1;i++){
        int u,v;cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    fill(ansmn,ansmn+1+n,1);
    fill(ansmx,ansmx+n+1,1);
    build(1,-1);
    solvemx();
    if(solvemn(1,-1)){
        int node=adj[1][0];
        ansmn[1]=node;
        int next=ansmn[node];
        while(ansmn[next]!=node)next=ansmn[next];
        ansmn[next]=1;
        ans1+=2;
    }
    cout<<ans1<<' '<<ans2*2<<'\n';
    for(int i=1;i<=n;i++)cout<<ansmn[i]<<" ";
    cout<<'\n';
    for(int i=1;i<=n;i++)cout<<ansmx[i]<<" ";
}

Compilation message

Village.cpp: In function 'long long int solvemn(long long int, long long int)':
Village.cpp:69:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i=0;i<v.size()-1;i++)ansmn[v[i]]=v[i+1],ans1+=2;
      |                     ~^~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6236 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6324 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 2 ms 6236 KB Output is correct
12 Correct 1 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 1 ms 6236 KB Output is correct
15 Correct 2 ms 6232 KB Output is correct
16 Correct 1 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 6492 KB Partially correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Partially correct 2 ms 6492 KB Partially correct
5 Partially correct 2 ms 6488 KB Partially correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6488 KB Output is correct
8 Correct 2 ms 6484 KB Output is correct
9 Partially correct 2 ms 6492 KB Partially correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Partially correct 2 ms 6492 KB Partially correct
15 Correct 2 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6488 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6304 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 2 ms 6492 KB Output is correct
26 Partially correct 2 ms 6744 KB Partially correct
27 Correct 2 ms 6492 KB Output is correct
28 Partially correct 2 ms 6488 KB Partially correct
29 Partially correct 2 ms 6492 KB Partially correct
30 Correct 2 ms 6484 KB Output is correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6232 KB Output is correct
2 Correct 2 ms 6236 KB Output is correct
3 Correct 3 ms 6492 KB Output is correct
4 Correct 2 ms 6236 KB Output is correct
5 Correct 2 ms 6324 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 2 ms 6236 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 2 ms 6236 KB Output is correct
12 Correct 1 ms 6236 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 1 ms 6236 KB Output is correct
15 Correct 2 ms 6232 KB Output is correct
16 Correct 1 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Partially correct 2 ms 6492 KB Partially correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Partially correct 2 ms 6492 KB Partially correct
22 Partially correct 2 ms 6488 KB Partially correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6488 KB Output is correct
25 Correct 2 ms 6484 KB Output is correct
26 Partially correct 2 ms 6492 KB Partially correct
27 Correct 2 ms 6492 KB Output is correct
28 Correct 2 ms 6488 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Partially correct 2 ms 6492 KB Partially correct
32 Correct 2 ms 6492 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 2 ms 6488 KB Output is correct
36 Correct 2 ms 6492 KB Output is correct
37 Correct 2 ms 6492 KB Output is correct
38 Correct 2 ms 6304 KB Output is correct
39 Correct 2 ms 6492 KB Output is correct
40 Correct 2 ms 6492 KB Output is correct
41 Correct 2 ms 6492 KB Output is correct
42 Correct 2 ms 6492 KB Output is correct
43 Partially correct 2 ms 6744 KB Partially correct
44 Correct 2 ms 6492 KB Output is correct
45 Partially correct 2 ms 6488 KB Partially correct
46 Partially correct 2 ms 6492 KB Partially correct
47 Correct 2 ms 6484 KB Output is correct
48 Partially correct 42 ms 12216 KB Partially correct
49 Correct 47 ms 12856 KB Output is correct
50 Correct 57 ms 13052 KB Output is correct
51 Correct 34 ms 11524 KB Output is correct
52 Partially correct 43 ms 12628 KB Partially correct
53 Partially correct 39 ms 12372 KB Partially correct
54 Correct 28 ms 13648 KB Output is correct
55 Correct 59 ms 21804 KB Output is correct
56 Correct 59 ms 17488 KB Output is correct
57 Partially correct 52 ms 15956 KB Partially correct
58 Correct 53 ms 14712 KB Output is correct
59 Partially correct 55 ms 13084 KB Partially correct
60 Correct 37 ms 13004 KB Output is correct
61 Correct 34 ms 13064 KB Output is correct
62 Correct 40 ms 13164 KB Output is correct
63 Correct 35 ms 12900 KB Output is correct
64 Correct 41 ms 13104 KB Output is correct
65 Correct 45 ms 13504 KB Output is correct
66 Correct 34 ms 12664 KB Output is correct
67 Correct 27 ms 11312 KB Output is correct
68 Correct 30 ms 12028 KB Output is correct
69 Correct 37 ms 13404 KB Output is correct
70 Correct 35 ms 12884 KB Output is correct
71 Correct 28 ms 11216 KB Output is correct
72 Correct 28 ms 11780 KB Output is correct
73 Correct 37 ms 13480 KB Output is correct
74 Correct 33 ms 12884 KB Output is correct
75 Partially correct 45 ms 13236 KB Partially correct
76 Partially correct 43 ms 12676 KB Partially correct
77 Partially correct 42 ms 13140 KB Partially correct
78 Partially correct 29 ms 10844 KB Partially correct
79 Partially correct 31 ms 11520 KB Partially correct
80 Partially correct 46 ms 13280 KB Partially correct
81 Partially correct 38 ms 13140 KB Partially correct
82 Partially correct 36 ms 12880 KB Partially correct