oj.uz

Submission #969613

# Submission time Handle Problem Language Result Execution time Memory
969613 2024-04-25T11:05:40 Z GrindMachine Friend (IOI14_friend) C++17
19 / 100
 5 ms 9564 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "friend.h"

vector<int> adj[N];
int dp[N][2];
vector<int> a(N);

void dfs1(int u){
	dp[u][0] = 0, dp[u][1] = a[u];
	trav(v,adj[u]){
		dfs1(v);
		dp[u][1] += dp[v][0];
		dp[u][0] += max(dp[v][0],dp[v][1]);
	}
}

int findSample(int n, int A[], int host[], int protocol[]){
	rep(i,n) a[i] = A[i];
	rep1(i,n-1){
		assert(protocol[i] == 0);
		int p = host[i];
		adj[p].pb(i);
	}

	dfs1(0);
	int ans = max(dp[0][0],dp[0][1]);
	return ans;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Runtime error 5 ms 9564 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9564 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9564 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 2 ms 4784 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4700 KB Output is correct
15 Correct 1 ms 5208 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 9560 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Runtime error 5 ms 9564 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -