oj.uz

Submission #1020507

# Submission time Handle Problem Language Result Execution time Memory
1020507 2024-07-12T06:12:38 Z vjudge1 Tree Rotations (POI11_rot) C++17
100 / 100
 195 ms 65536 KB 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define pb push_back
 
#define endl '\n'
#define fastIO ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define setmin(x,y) x=min((x),(y))
#define setmax(x,y) x=max((x),(y))
#define sqr(x) (x)*(x)
#define fi first
#define se second
 
mt19937 hdp(chrono::high_resolution_clock::now().time_since_epoch().count());
int rand(int l,int r){return l+((hdp()%(r-l+1))+r-l+1)%(r-l+1);}
 
const int N = 4e5 + 5;
const int mod = 998244353;
const int SQ = 450;
const int inf = 1e9;
const int bound = 1e7;
 
vector<int> g[N];
int n,m,c[N],sz[N],par[N];
vector<int> V[N];
stack<int> st;
long long dp[N];
 
int bit[N];
void upd(int i)
{
    for(;i<=n;i+=i&-i) 
    {
        st.push(i);
        bit[i]++;
    }
}
int get(int i)
{
    int res=0;
    for(;i;i-=i&-i) res+=bit[i];
    return res;
}
 
void dfs(int u=1,int p=0,bool keep=0)
{
    int bc=0;
    for(int v:g[u]) if(v!=p&&sz[v]>sz[bc]) bc=v;
    for(int v:g[u]) if(v!=p&&v!=bc) dfs(v,u,0);
    if(bc)
    {
        dfs(bc,u,1);
        swap(V[u],V[bc]);
        dp[u]=dp[bc];
    }
    for(int v:g[u]) if(v!=p&&v!=bc) dp[u]+=dp[v];
    long long sum1=0,sum2=0,xx=V[u].size();
    for(int v:g[u]) if(v!=bc) for(auto t:V[v])
    {
        V[u].pb(t);
        int x=get(t);
        sum1+=x;
        sum2+=xx-x;
    }
    dp[u]+=min(sum1,sum2);
    for(int v:g[u]) if(v!=bc) for(auto t:V[v]) upd(t);
    if(c[u])
    {
        V[u].pb(c[u]);
        upd(c[u]);
    }
    if(!keep) 
    {
        while(!st.empty())
        {
            bit[st.top()]=0;
            st.pop();
        }
    }
}
 
void dfs_sz(int u=1,int p=0)
{
    sz[u]=1;
    for(auto v:g[u]) if(v!=p)
    {
        dfs_sz(v,u);
        sz[u]+=sz[v];
    }
}
 
signed main()
{
    if (fopen("in.txt", "r")) {
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    }
    fastIO
    cin>>n;
    int u=0,v=0;
    for(int m=1;m<2*n;m++)
    {
        cin>>c[m];
        g[u].pb(m);
        par[m]=u;
        if(c[m]) 
        {
            while(g[u].size()==2) u=par[u];
        }
        else u=m;
    }
    dfs_sz();
    dfs();
    cout<<dp[1];
}

Compilation message

rot.cpp: In function 'int main()':
rot.cpp:103:13: warning: unused variable 'v' [-Wunused-variable]
  103 |     int u=0,v=0;
      |             ^
rot.cpp:98:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         freopen("in.txt","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~
rot.cpp:99:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |         freopen("out.txt","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19292 KB Output is correct
2 Correct 12 ms 19036 KB Output is correct
3 Correct 11 ms 19240 KB Output is correct
4 Correct 13 ms 19272 KB Output is correct
5 Correct 11 ms 19032 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19292 KB Output is correct
2 Correct 12 ms 19292 KB Output is correct
3 Correct 11 ms 19292 KB Output is correct
4 Correct 13 ms 19288 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19292 KB Output is correct
2 Correct 12 ms 19292 KB Output is correct
3 Correct 16 ms 19288 KB Output is correct
4 Correct 11 ms 19292 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 20128 KB Output is correct
2 Correct 13 ms 19912 KB Output is correct
3 Correct 12 ms 20316 KB Output is correct
4 Correct 14 ms 20304 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 22364 KB Output is correct
2 Correct 18 ms 21124 KB Output is correct
3 Correct 31 ms 24408 KB Output is correct
4 Correct 21 ms 22364 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 27596 KB Output is correct
2 Correct 37 ms 29900 KB Output is correct
3 Correct 39 ms 32828 KB Output is correct
4 Correct 40 ms 32976 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 43564 KB Output is correct
2 Correct 55 ms 39116 KB Output is correct
3 Correct 60 ms 36044 KB Output is correct
4 Correct 49 ms 33772 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 37576 KB Output is correct
2 Correct 65 ms 40904 KB Output is correct
3 Correct 76 ms 47052 KB Output is correct
4 Correct 68 ms 46536 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 56008 KB Output is correct
2 Correct 112 ms 51764 KB Output is correct
3 Correct 114 ms 50912 KB Output is correct
4 Correct 111 ms 50324 KB Output is correct
5 Correct 164 ms 50888 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 52084 KB Output is correct
2 Correct 124 ms 63952 KB Output is correct
3 Correct 127 ms 60100 KB Output is correct
4 Correct 112 ms 65264 KB Output is correct
5 Correct 195 ms 55772 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 52312 KB Output is correct
2 Correct 109 ms 55156 KB Output is correct
3 Correct 159 ms 54080 KB Output is correct
4 Correct 128 ms 53724 KB Output is correct
5 Correct 129 ms 65536 KB Output is correct
6 Correct 192 ms 57028 KB Output is correct