oj.uz

Submission #423445

# Submission time Handle Problem Language Result Execution time Memory
423445 2021-06-11T06:38:13 Z Theo830 Friend (IOI14_friend) C++17
19 / 100
 6 ms 2124 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<int,int>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
vector<vll>adj;
ll arr[1005];
ll dp[1005][2];
ll solve(ll idx,bool ep){
    if(dp[idx][ep] != -1){
        return dp[idx][ep];
    }
    ll sum = 0,sum2 = 0;
    for(auto x:adj[idx]){
        if(x > idx){
            sum += solve(x,0);
            sum2 += max(solve(x,0),arr[x] + solve(x,1));
        }
    }
    if(!ep){
        sum = sum2;
    }
    return dp[idx][ep] = sum;
}
int findSample(int n, int confidence[], int host[], int protocol[]){
    adj.assign(n+5,vll());
    f(i,0,n){
        arr[i] = confidence[i];
    }
    f(i,1,n){
        ll v = host[i];
        if(protocol[i] == 0){
            adj[v].pb(i);
            adj[i].pb(v);
        }
        else if(protocol[i] == 1){
            for(auto x:adj[v]){
                adj[i].pb(x);
                adj[x].pb(i);
            }
        }
        else{
            for(auto x:adj[v]){
                adj[i].pb(x);
                adj[x].pb(i);
            }
            adj[v].pb(i);
            adj[i].pb(v);
        }
    }
    memset(dp,-1,sizeof dp);
    return max(solve(0,0),arr[0] + solve(0,1));
}

Subtask #1
0 / 11.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 0 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 0 ms 332 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2124 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 460 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 312 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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -