oj.uz

Submission #589244

# Submission time Handle Problem Language Result Execution time Memory
589244 2022-07-04T10:56:13 Z FatihSolak Friend (IOI14_friend) C++17
46 / 100
 34 ms 4460 KB 
#include "friend.h"
#include <bits/stdc++.h>
#define N 1005
using namespace std;
vector<int> adj[N];
bool vis[N];
int C[N];
int dfs0(int v){
	vis[v] = 1;
	int ret = C[v];
	for(auto u:adj[v]){
		if(vis[u])continue;
		ret = max(ret,dfs0(u));
	}
	return ret;
}
pair<long long,long long> dfs1(int v){
	vis[v] = 1;
	pair<long long,long long> ret = {0,C[v]};
	for(auto u:adj[v]){
		if(vis[u])continue;
		auto tmp = dfs1(u);
		ret.first += tmp.second;
		ret.second += tmp.first;
	}
	ret.second = max(ret.second,ret.first);
	return ret;
}
// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
	for(int i = 0;i<n;i++){
		C[i] = confidence[i];
	}
	int SUBTASK = 1;
	set<int> s;
	for(int i = 1;i<n;i++){
		s.insert(protocol[i]);
	}
	if(n > 10 && s.size() == 2){
		SUBTASK = 5;
	}
	if(n > 10 && s.size() == 1){
		if(*s.begin() == 0){
			SUBTASK = 4;
		}
		if(*s.begin() == 1){
			SUBTASK = 2;
		}
		if(*s.begin() == 2){
			SUBTASK = 3;
		}
	}
	for(int i = 1;i<n;i++){
		if(protocol[i] == 0){
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
		}
		if(protocol[i] == 1){
			for(auto u:adj[host[i]]){
				adj[i].push_back(u);
				adj[u].push_back(i);
			}
		}
		if(protocol[i] == 2){
			for(auto u:adj[host[i]]){
				adj[i].push_back(u);
				adj[u].push_back(i);
			}
			adj[i].push_back(host[i]);
			adj[host[i]].push_back(i);
		}
	}
	if(SUBTASK == 1){
		long long ans = 0;
		for(int mask = 1;mask < (1<<n);mask++){
			long long sum = 0;
			bool ok = 1;
			for(int i = 0;i<n;i++){
				if(mask & (1<<i)){
					sum += confidence[i];
					for(auto u:adj[i]){
						if(mask & ( 1<<u))
							ok = 0;
					}
				}
			}
			if(ok){
				ans = max(ans,sum);
			}
		}
		return ans;
	}
	if(SUBTASK == 2){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			sum += confidence[i];
		}
		return sum;
	}
	if(SUBTASK == 3){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			if(!vis[i]){
				sum += dfs0(i);
			}
		}
		return sum;
	}
	if(SUBTASK == 4){
		long long sum = 0;
		for(int i = 0;i<n;i++){
			if(!vis[i]){
				sum += dfs1(i).second;
			}
		}
		return sum;
	}
	return 0;
}

Subtask #1
11.0 / 11.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 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 224 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1236 KB Output is correct
2 Correct 8 ms 4180 KB Output is correct
3 Correct 1 ms 284 KB Output is correct
4 Correct 6 ms 3156 KB Output is correct
5 Correct 9 ms 4180 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 1108 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 10 ms 4460 KB Output is correct

Subtask #4
19.0 / 19.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 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 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 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

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 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Incorrect 1 ms 336 KB Output isn't correct
12 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 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Runtime error 34 ms 3704 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -