oj.uz

Submission #808960

# Submission time Handle Problem Language Result Execution time Memory
808960 2023-08-05T12:52:20 Z OrazB Friend (IOI14_friend) C++14
8 / 100
 555 ms 12376 KB 
#include <bits/stdc++.h>
#include "friend.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

const int N = 1e3+5;
int c[N], dp[N][2], vis[N][N][2];
ll mx = 0;
vector<int> E[N];

void bit(int x, int n, int A[]){
	if (x == n){
		ll sum = 0;
		for (int i = 0; i < n; i++){
			if (c[i]){
				for (auto j : E[i]) if (c[j]) return;
				sum += A[i];
			}
		}
		mx = max(mx, sum);
		return;
	}
	for (int i = 0; i < 2; i++){
		c[x] = i;
		bit(x+1, n, A);
	}
}
void dfs(int nd, int pr, int A[]){
	int a = 0;
	for (auto i : E[nd]){
		if (i == pr) continue;
		dfs(i, nd, A);
		a += dp[i][0];
		dp[nd][0] += max(dp[i][1], dp[i][0]);
	}
	dp[nd][1] = a+A[nd];
}

int findSample(int n, int A[], int u[], int v[]){
	int sub0 = 0, sub1 = 0, sub2 = 0;
	int sum = 0;
	for (int i = 0; i < n; i++) sum += A[i];
	dp[0][1] = A[1];
	vis[0][0][1] = 1; 
	for (int i = 1; i < n; i++){
		if (v[i] == 2) sub2 = 1;
		if (v[i] == 0) sub0 = 1;
		if (v[i] == 1) sub1 = 1;
 		
 		if (v[i] == 1 or v[i] == 2){
			int a = 0;
			for (auto j : E[u[i]]){
				E[i].pb(j);
				E[j].pb(i);
				if (dp[j][0] > dp[j][1]){
					for (int k = 0; k < n; k++){
						vis[i][k][0] |= vis[j][k][0];
					}
				}else{
					for (int k = 0; k < n; k++){
						vis[i][k][0] |= vis[j][k][1];
					}
				}
				dp[i][0] += max(dp[j][1], dp[j][0]);
				for (int k = 0; k < n; k++){
					vis[i][k][1] |= vis[j][k][0];
				}
				a += dp[j][0];
			}
			dp[i][1] = a+A[i];
			if (vis[i][u[i]][1] == 0){
				dp[i][1] += A[u[i]];
				vis[i][u[i]][1] = 1;
			}
		}
		if (v[i] == 0 or v[i] == 2){
			E[i].pb(u[i]);
			E[u[i]].pb(i);
			if (dp[u[i]][0] > dp[u[i]][1]){
				for (int k = 0; k < n; k++){
					vis[i][k][0] |= vis[u[i]][k][0];
				}
			}else{
				for (int k = 0; k < n; k++){
					vis[i][k][0] |= vis[u[i]][k][1];
				}
			}
			dp[i][0] = max(dp[u[i]][1], dp[u[i]][0]);
			for (int k = 0; k < n; k++){
				vis[i][k][1] |= vis[u[i]][k][0];
			}
			dp[i][1] = dp[u[i]][0]+A[i];
		}
	}
	if (!sub2) return max(dp[n-1][0], dp[n-1][1]);
	if (!sub0 and !sub2) return sum;
	if (!sub0 and !sub1) return *max_element(A, A+n);
	if (!sub1 and !sub2){
		for (int i = 0; i < n; i++) dp[i][0] = dp[i][1] = 0;
		dfs(0, -1, A);
		return max(dp[0][1], dp[0][0]);
	}
	bit(0, n, A);
	return mx;
}


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	int n;
// 	cin >> n;
// 	int A[n], a[n], b[n];
// 	for (int i = 0; i < n; i++) cin >> A[i];
// 	for (int i = 1; i < n; i++) cin >> a[i] >> b[i];
// 	cout << findSample(n, A, a, b);
// }

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 4352 KB Output is correct
2 Correct 486 ms 11540 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 185 ms 8356 KB Output is correct
5 Correct 462 ms 11468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 12 ms 2496 KB Output is correct
8 Correct 35 ms 3652 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 555 ms 12376 KB Output is correct

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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