oj.uz

답안 #431884

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
431884 2021-06-17T16:41:30 Z cfalas 친구 (IOI14_friend) C++14
35 / 100
 1 ms 460 KB 
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef pair<int, int> ii;
#define FORi(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define FOR(i,n) FORi(i,0,n)
#include "friend.h"
typedef vector<int> vi;
// Find out best sample

vector<vi> adj;
vi vis;

int a[10000];
int dp[100000][2];
int dfs(int s, int p=-1, int cp=0){
	if(dp[s][cp]) return dp[s][cp];
	vis[s] = true;
	int ans1 = 0;
	int ans2=0;
	if(cp){
		for(auto v : adj[s]) if(v!=p) ans1+=dfs(v, s, 0);
	}
	else{
		for(auto v : adj[s]) if(v!=p) ans1+=dfs(v, s, 0);
		ans2 = a[s];
		for(auto v : adj[s]) if(v!=p) ans2+=dfs(v, s, 1);
	}
	//cout<<s<<" "<<cp<<" "<<ans1<<" "<<ans2<<endl;
	dp[s][cp] = max(ans1, ans2);
	return max(ans1, ans2);
}

int findSample(int n,int confidence[],int host[],int protocol[]){
	int ans=0;
	if(protocol[1]==1) FOR(i,n) ans+=confidence[i];
	else if(protocol[1]==2) FOR(i,n) ans=max(ans, confidence[i]);
	else{
		FOR(i,n) a[i] = confidence[i];
		adj.assign(n+1, vi());
		vis.assign(n+1, false);
		FORi(i,1,n){
			adj[host[i]].push_back(i);
			adj[i].push_back(host[i]);
		}
		FOR(i,n) if(!vis[i]) ans+=dfs(i);
	}
	return ans;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 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 320 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 332 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -