oj.uz

Submission #28923

# Submission time Handle Problem Language Result Execution time Memory
28923 2017-07-17T19:29:30 Z noobprogrammer Friend (IOI14_friend) C++14
100 / 100
 36 ms 3972 KB 
#include "friend.h"
#include <bits/stdc++.h>
using namespace std ;

int p[100010] , q[100010] ;

int findSample(int n,int confi[],int host[],int prt[]){
	int ans = 0;
	for(int i = 0 ; i< n; i++) p[i] = confi[i] ; 
	for(int i=n-1;i>0;i--){
		int x = host[i] ; int y = i ; 
		int u = 0 , nu = 0 ; 
		if(prt[i] == 0){
			u = p[x] + q[y] ; nu = max(p[y] + q[x] , q[x] + q[y]) ;
		}
		else if(prt[i] == 1){
			u = max(max(p[x] + p[y] , p[x] + q[y]) , p[y] + q[x]) ;
			nu = q[x] + q[y] ; 
		}
		else{
			u = max(p[x] + q[y] , p[y] + q[x]) ;
			nu = q[x] + q[y] ; 
		}
		p[x] = u ; q[x] = nu ; 
		ans = max(ans , max(u  , nu )) ;

	}
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Correct 0 ms 3972 KB Output is correct
3 Correct 0 ms 3972 KB Output is correct
4 Correct 0 ms 3972 KB Output is correct
5 Correct 0 ms 3972 KB Output is correct
6 Correct 0 ms 3972 KB Output is correct
7 Correct 0 ms 3972 KB Output is correct
8 Correct 0 ms 3972 KB Output is correct
9 Correct 0 ms 3972 KB Output is correct
10 Correct 0 ms 3972 KB Output is correct
11 Correct 0 ms 3972 KB Output is correct
12 Correct 0 ms 3972 KB Output is correct
13 Correct 0 ms 3972 KB Output is correct
14 Correct 0 ms 3972 KB Output is correct
15 Correct 0 ms 3972 KB Output is correct
16 Correct 0 ms 3972 KB Output is correct
17 Correct 0 ms 3972 KB Output is correct
18 Correct 0 ms 3972 KB Output is correct
19 Correct 0 ms 3972 KB Output is correct
20 Correct 0 ms 3972 KB Output is correct
21 Correct 0 ms 3972 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3972 KB Output is correct
2 Correct 0 ms 3972 KB Output is correct
3 Correct 0 ms 3972 KB Output is correct
4 Correct 0 ms 3972 KB Output is correct
5 Correct 0 ms 3972 KB Output is correct
6 Correct 0 ms 3972 KB Output is correct
7 Correct 0 ms 3972 KB Output is correct
8 Correct 0 ms 3972 KB Output is correct
9 Correct 0 ms 3972 KB Output is correct
10 Correct 0 ms 3972 KB Output is correct
11 Correct 0 ms 3972 KB Output is correct
12 Correct 36 ms 3972 KB Output is correct
13 Correct 16 ms 3972 KB Output is correct
14 Correct 23 ms 3972 KB Output is correct
15 Correct 29 ms 3972 KB Output is correct