oj.uz

Submission #363629

# Submission time Handle Problem Language Result Execution time Memory
363629 2021-02-06T17:19:55 Z silverfish Friend (IOI14_friend) C++14
46 / 100
 35 ms 5100 KB 
#include "friend.h"
#include <bits/stdc++.h>
using namespace std;
 
const int N = 1e5+1;
 
vector<int> adj[N];
long long dp[N][2];
int vis[N], d[N], on[N];
 
void dfs(int u, int p, int *conf){
 
	for(int v : adj[u]){
		if(v != p) dfs(v, u, conf);
	}
 
	for(int v : adj[u]){
		if(v != p){
			dp[u][0] += max(dp[v][1], dp[v][0]);
			dp[u][1] += dp[v][0];
		}
	}
	dp[u][1] += 1LL*conf[u];
}
 
int findSample(int n, int conf[],int host[],int protocol[]){
	bool subtask2 = 1, subtask3 = 1, subtask4 = 1, subtask5 = 1, subtask1 = (n<=10);
	for(int i = 1; i < n; ++i){
		if(protocol[i] != 1) subtask2 = 0;
		if(protocol[i] != 2) subtask3 = 0;
		if(protocol[i] != 0) subtask4 = 0;
		if(conf[i] != 1) subtask5 = 0;
	}

	if(subtask1){
		for(int i = 1; i < n; ++i){
			if(protocol[i] != 0){
				for(int j : adj[host[i]]){
					adj[i].push_back(j);
					adj[j].push_back(i);
				}
			}

			if(protocol[i] != 1){
				adj[host[i]].push_back(i);
				adj[i].push_back(host[i]);
			}
		}

		int ans = 0;

		/*
		for(int i = 0; i < n; ++i){
			cerr << i << " : ";
			for(int v : adj[i]){
				cerr << v << ' ';
			}
			cerr << endl;
		}
		*/

		for(int i = 0; i < (1<<(n+1)); ++i){
			int cur = 0;

			for(int j = 0; j < n; ++j){
				if(i&(1<<j)){
					cur += conf[j];
					on[j] = 1;
				}else on[j] = 0;
			}

			for(int u = 0; u < n; ++u){
				for(int v : adj[u]){
					if(on[v] && on[u]) cur = 0;
				}
			}
			ans = max(ans, cur);
		}
		return ans;

	}

	if(subtask2){
		long long ans = 0;
		for(int i = 0; i < n; ++i) ans += 1LL*conf[i];
		return ans;
	}
	if(subtask3){
		return *max_element(conf, conf+n);
	}
 
	if(subtask4){
		//build tree
		for(int i = 1; i < n; ++i){
			adj[host[i]].push_back(i);
			adj[i].push_back(host[i]);
		}
 
		dfs(0, 0, conf);
		return max(dp[0][1], dp[0][0]);
	}
 
	if(subtask5){
 
		for(int i = 1; i < n; ++i){
			if(protocol[i] == 0){
				adj[host[i]].push_back(i);
				adj[i].push_back(host[i]);
			}else{
				for(int j : adj[host[i]]){
					adj[i].push_back(j);
					adj[j].push_back(i);
				}
			}
		}
 
 
		memset(vis, 0, sizeof vis);
		int ans = 0;

		for(int i = 0; i < n; ++i){
			if(vis[i]) continue;
			assert(!vis[i]);

			array<int,2> curans = {0LL, 0LL};

			queue<int> q;
			q.push(i);
			d[i] = 0;
			vis[i] = 1;
			// node, depth

			while(q.size()){
				int u = q.front(); q.pop();

				++curans[(d[u]%2)];

				for(int v : adj[u]){
					if(!vis[v]){
						vis[v] = 1;
						d[v] = d[u]+1;
						q.push(v);
					}else{
						assert(d[v]%2 != d[u]%2);
					}
				}
			}
			assert(q.empty());
			assert(max(curans[0], curans[1]) > 0);
			ans += max(curans[0], curans[1]);
		}
		return ans;
	}
 
	return -1;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 2 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2796 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Incorrect 3 ms 3052 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 2 ms 2668 KB Output is correct
5 Correct 3 ms 2668 KB Output is correct
6 Correct 3 ms 2668 KB Output is correct
7 Correct 2 ms 2668 KB Output is correct
8 Correct 2 ms 2668 KB Output is correct
9 Correct 2 ms 2668 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 2 ms 2668 KB Output is correct
12 Incorrect 35 ms 5100 KB Output isn't correct
13 Halted 0 ms 0 KB -