oj.uz

Submission #126873

# Submission time Handle Problem Language Result Execution time Memory
126873 2019-07-08T14:37:34 Z ekrem Friend (IOI14_friend) C++
16 / 100
 3 ms 504 KB 
#include "friend.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define sol (k+k)
#define sag (k+k+1)
#define orta ((bas+son)/2)
#define coc g[node][i]
#define mod 1000000007
#define inf 1000000009
#define N 1000005
using namespace std;

typedef long long ll;
typedef pair < int , int > ii;

int n, al[N], alma[N];

int findSample(int n,int c[],int h[],int p[]){
	for(int i = 0; i < n; i++){
		al[i] = c[i];
		alma[i] = 0;
	}
	for(int y = n - 1; y >= 1; y--){
		int x = h[x];
		if(p[y] == 2){
			alma[x] = alma[x] + alma[y];
			al[x] = max(al[y] + alma[x], alma[y] + al[x]);
		} else if(p[y] == 1){
			alma[x] = alma[x] + alma[y];
			al[x] = max(max(al[x] + alma[y], alma[x] + al[y]), al[x] + al[y]);
		} else{
			alma[x] = alma[x] + max(al[y], alma[y]);
			al[x] = al[x] + alma[y];
		}
	}
	return max(al[0], alma[0]);
}






// #define __MAXSIZE__ 100002
// using namespace std;
// int confidence[__MAXSIZE__];
// int host[__MAXSIZE__];
// int protocol[__MAXSIZE__];
// int main(void){
// 	freopen("in.txt", "r", stdin);
// 	freopen("outt.txt", "w", stdout);
// 	int n,i;
// 	assert(scanf("%d",&n)==1);
// 	for(i=0;i<n;i++)
// 		assert(scanf("%d",&confidence[i])==1);
// 	for(i=1;i<n;i++)
// 		assert(scanf("%d %d",&host[i],&protocol[i])==2);
// 	printf("%d\n",findSample(n,confidence,host,protocol));
// 	return 0;
// }

Compilation message

friend.cpp: In function 'int findSample(int, int*, int*, int*)':
friend.cpp:27:14: warning: 'x' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int x = h[x];
              ^

Subtask #1
0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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