oj.uz

Submission #582729

# Submission time Handle Problem Language Result Execution time Memory
582729 2022-06-24T11:03:17 Z jasmin Friend (IOI14_friend) C++14
69 / 100
 1000 ms 48160 KB 
#include<bits/stdc++.h>
#include "friend.h"
using namespace std;

int subtask1(int n, int c[], int h[], int p[]){
    vector<set<int> > adi(n);
    for(int i=1; i<n; i++){
        if(p[i]==0){
            adi[h[i]].insert(i);
            adi[i].insert(h[i]);
        }
        else if(p[i]==1){
            for(auto u: adi[h[i]]){
                adi[u].insert(i);
                adi[i].insert(u);
            }
        }
        else{
            for(auto u: adi[h[i]]){
                adi[u].insert(i);
                adi[i].insert(u);
            }
            adi[h[i]].insert(i);
            adi[i].insert(h[i]);
        }
    }

    int ans=0;
    for(int i=0; i<(1<<n); i++){
        vector<int> active;
        int mom=0;
        for(int j=0; j<n; j++){
            if((i>>j)%2==1){
                mom+=c[j];
                active.push_back(j);
            }
        }

        for(auto v: active){
            for(auto u: active){
                if(adi[v].find(u)!=adi[v].end()) mom=0;
            }
        }
        ans=max(ans, mom);
    }
    return ans;
}

bool issubtask2(int n, int protocol[]){
    for(int i=1; i<n; i++){
        if(protocol[i]!=1) return false;
    }
    return true;
}
int subtask2(int n, int confidence[]){
    int ans=0;
    for(int i=0; i<n; i++){
        ans+=confidence[i];
    }
    return ans;
}

bool issubtask3(int n, int protocol[]){
    for(int i=1; i<n; i++){
        if(protocol[i]!=2) return false;
    }
    return true;
}
int subtask3(int n, int confidence[]){
    int ans=0;
    for(int i=0; i<n; i++){
        ans=max(ans, confidence[i]);
    }
    return ans;
}

bool issubtask4(int n, int protocol[]){
    for(int i=1; i<n; i++){
        if(protocol[i]!=0) return false;
    }
    return true;
}
void dfs(int v, vector<vector<int> >& adi, vector<vector<int> >& dp, int c[]){
    dp[v][0]=0;
    dp[v][1]=c[v];

    for(auto u: adi[v]){
        dfs(u, adi, dp, c);
        dp[v][0]+=max(dp[u][0], dp[u][1]);
        dp[v][1]+=dp[u][0];
    }
}
int subtask4(int n, int c[], int h[], int p[]){
    vector<vector<int> > adi(n);
    for(int i=1; i<n; i++){
        adi[h[i]].push_back(i);
    }

    vector<vector<int> > dp(n, vector<int> (2, -1));
    dfs(0, adi, dp, c);
    return max(dp[0][0], dp[0][1]);
}

bool improveMatching(int v, vector<vector<int> >& adi, vector<bool>& vis, vector<int>& m){
    if(vis[v]) return false;
    vis[v]=true;

    for(auto u: adi[v]){
        if(m[u]==-1 || improveMatching(m[u], adi, vis, m)){
            m[u]=v;
            return true;
        }
    }
    return false;
}

int matching(int n, vector<vector<int> >& adi, vector<bool>& left){
    vector<int> m(n, -1);
    vector<bool> vis(n);
    int s=0;
    for(int i=0; i<n; i++){
        if(!left[i]) continue;
        int v=i;
        if(improveMatching(v, adi, vis, m)){
            vis.assign(n, false);
            s++;
        }
    }
    return s;
}

int subtask5(int n, int c[], int h[], int p[]){
    vector<vector<int> > adi(n);
    vector<bool> left(n, false);
    left[0]=true;
    for(int i=1; i<n; i++){
        if(p[i]==0){
            adi[h[i]].push_back(i);
            adi[i].push_back(h[i]);
            left[i]=!left[h[i]];
        }
        else{
            for(auto u: adi[h[i]]){
                adi[u].push_back(i);
                adi[i].push_back(u);
            }
            left[i]=left[h[i]];
        }
    }

    int ans=n-matching(n, adi, left);
    return ans;
}

int findSample(int n,int confidence[],int host[],int protocol[]){
    if(n<=10){
        return subtask1(n, confidence, host, protocol);
    }
    if(issubtask2(n, protocol)){
        return subtask2(n, confidence);
    }
    if(issubtask3(n, protocol)){
        return subtask3(n, confidence);
    }
    if(issubtask4(n, protocol)){
        return subtask4(n, confidence, host, protocol);
    }
    return subtask5(n, confidence, host, protocol);
}

/*signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);


    int n;
    cin >> n;
    int c[n];
    for(int i=0; i<n; i++){
        cin >> c[i];
    }
    int p[n];
    int h[n];
    for(int i=1; i<n; i++){
        cin >> p[i] >> h[i];
    }

    cout << subtask5(n, c, h, p) << "\n";
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 0 ms 308 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 320 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 1061 ms 48160 KB Time limit exceeded
13 Halted 0 ms 0 KB -