oj.uz

답안 #540368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
540368 2022-03-20T06:50:07 Z BadPenalty Logičari (COCI21_logicari) C++14
110 / 110
 193 ms 37104 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
const int N = 2e5,mod = 1e9+7;

vector<int>adj[N];
int head[N],par[N];
int root,special;
int dp[N][2][2][2][2];
int st(int x)
{
    if (x == head[x]) return x;
    return head[x] = st(head[x]);
}

void dfs(int x,int pr)
{
    par[x] = pr;
    for(auto u:adj[x])
    {
        if(u == pr)continue;
        dfs(u,x);
    }
}

int calc(int nd,int me,int up,int rt,int sp)
{
    if(dp[nd][me][up][rt][sp]!=-1)
        return dp[nd][me][up][rt][sp];
    bool tr = 1;
    if(nd==special&&rt&&up)tr = 0;
    if(nd==root&&me!=rt)tr = 0;
    if(nd==special&&me!=sp)tr = 0;
    if(!tr)
        return dp[nd][me][up][rt][sp] = 1e9;
    ll sum = me;
    for(auto u:adj[nd])
    {
        if(u==par[nd])continue;
        sum+=calc(u,0,me,rt,sp);
    }
    bool cmp = 0;
    if(up)cmp = 1;
    if(nd==root&&sp)cmp = 1;
    if(nd==special&&rt)cmp = 1;

    ll res = 1e9;
    if(cmp)
    {
        res = min(res,sum);
    }
    else
    {
        for(auto u:adj[nd])
        {
            if(u==par[nd])continue;
            ll val = sum-calc(u,0,me,rt,sp)+calc(u,1,me,rt,sp);
            res = min(res,val);;
        }
    }
    return dp[nd][me][up][rt][sp] = res;


}


int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;

    for(int i = 0;i<=n;i++)
        head[i] = i;
    for(int i = 0;i<n;i++)
    {
        int a,b;
        cin>>a>>b;

        int pa = st(a);
        int pb = st(b);

        if(pa==pb)
        {
            root = a;
            special = b;
        }
        else
        {
            head[pa] = pb;
            adj[a].pb(b);
            adj[b].pb(a);
        }
    }
    dfs(root,0);
    int ans = 1e9;
//    cout<<root<<' '<<special<<endl;
    memset(dp,-1,sizeof dp);
    for(int rt = 0;rt<=1;rt++)
    {
        for(int sp = 0;sp<=1;sp++)
        {
//            cout<<calc(root,rt,0,rt,sp)<<' '<<endl;
//            cout<<rt<<' '<<sp<<endl;
            ans = min(ans,calc(root,rt,0,rt,sp));
        }
    }
    if(ans==1e9)
        cout<<-1<<endl;
    else
        cout<<ans<<endl;
    return 0;
}
/*

*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17492 KB Output is correct
2 Correct 8 ms 17492 KB Output is correct
3 Correct 8 ms 17492 KB Output is correct
4 Correct 8 ms 17492 KB Output is correct
5 Correct 193 ms 37032 KB Output is correct
6 Correct 180 ms 37068 KB Output is correct
7 Correct 182 ms 37100 KB Output is correct
8 Correct 181 ms 37016 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 17488 KB Output is correct
2 Correct 9 ms 17492 KB Output is correct
3 Correct 10 ms 17452 KB Output is correct
4 Correct 8 ms 17492 KB Output is correct
5 Correct 8 ms 17552 KB Output is correct
6 Correct 8 ms 17492 KB Output is correct
7 Correct 8 ms 17560 KB Output is correct
8 Correct 8 ms 17492 KB Output is correct
9 Correct 9 ms 17436 KB Output is correct
10 Correct 8 ms 17492 KB Output is correct
11 Correct 12 ms 17492 KB Output is correct
12 Correct 8 ms 17492 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 17488 KB Output is correct
2 Correct 9 ms 17492 KB Output is correct
3 Correct 10 ms 17452 KB Output is correct
4 Correct 8 ms 17492 KB Output is correct
5 Correct 8 ms 17552 KB Output is correct
6 Correct 8 ms 17492 KB Output is correct
7 Correct 8 ms 17560 KB Output is correct
8 Correct 8 ms 17492 KB Output is correct
9 Correct 9 ms 17436 KB Output is correct
10 Correct 8 ms 17492 KB Output is correct
11 Correct 12 ms 17492 KB Output is correct
12 Correct 8 ms 17492 KB Output is correct
13 Correct 8 ms 17480 KB Output is correct
14 Correct 9 ms 17492 KB Output is correct
15 Correct 9 ms 17600 KB Output is correct
16 Correct 8 ms 17492 KB Output is correct
17 Correct 8 ms 17492 KB Output is correct
18 Correct 10 ms 17492 KB Output is correct
19 Correct 8 ms 17492 KB Output is correct
20 Correct 9 ms 17596 KB Output is correct
21 Correct 8 ms 17532 KB Output is correct
22 Correct 10 ms 17604 KB Output is correct
23 Correct 9 ms 17748 KB Output is correct
24 Correct 9 ms 17652 KB Output is correct

Subtask #4
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17492 KB Output is correct
2 Correct 8 ms 17492 KB Output is correct
3 Correct 8 ms 17492 KB Output is correct
4 Correct 8 ms 17492 KB Output is correct
5 Correct 193 ms 37032 KB Output is correct
6 Correct 180 ms 37068 KB Output is correct
7 Correct 182 ms 37100 KB Output is correct
8 Correct 181 ms 37016 KB Output is correct
9 Correct 9 ms 17488 KB Output is correct
10 Correct 9 ms 17492 KB Output is correct
11 Correct 10 ms 17452 KB Output is correct
12 Correct 8 ms 17492 KB Output is correct
13 Correct 8 ms 17552 KB Output is correct
14 Correct 8 ms 17492 KB Output is correct
15 Correct 8 ms 17560 KB Output is correct
16 Correct 8 ms 17492 KB Output is correct
17 Correct 9 ms 17436 KB Output is correct
18 Correct 8 ms 17492 KB Output is correct
19 Correct 12 ms 17492 KB Output is correct
20 Correct 8 ms 17492 KB Output is correct
21 Correct 8 ms 17480 KB Output is correct
22 Correct 9 ms 17492 KB Output is correct
23 Correct 9 ms 17600 KB Output is correct
24 Correct 8 ms 17492 KB Output is correct
25 Correct 8 ms 17492 KB Output is correct
26 Correct 10 ms 17492 KB Output is correct
27 Correct 8 ms 17492 KB Output is correct
28 Correct 9 ms 17596 KB Output is correct
29 Correct 8 ms 17532 KB Output is correct
30 Correct 10 ms 17604 KB Output is correct
31 Correct 9 ms 17748 KB Output is correct
32 Correct 9 ms 17652 KB Output is correct
33 Correct 105 ms 20956 KB Output is correct
34 Correct 116 ms 21004 KB Output is correct
35 Correct 113 ms 21080 KB Output is correct
36 Correct 104 ms 20948 KB Output is correct
37 Correct 28 ms 18448 KB Output is correct
38 Correct 116 ms 21068 KB Output is correct
39 Correct 15 ms 17868 KB Output is correct
40 Correct 113 ms 21172 KB Output is correct
41 Correct 66 ms 22004 KB Output is correct
42 Correct 87 ms 21796 KB Output is correct
43 Correct 142 ms 37104 KB Output is correct
44 Correct 126 ms 29424 KB Output is correct