oj.uz

Submission #798262

# Submission time Handle Problem Language Result Execution time Memory
798262 2023-07-30T14:27:24 Z QwertyPi Friend (IOI14_friend) C++14
0 / 100
 1 ms 340 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;
struct state{
	int p, q;
};

state st[100011];

state f(int ptc, state s, state t){
	if(ptc == 1) return {s.p + t.q, max(s.q + t.p, s.q + t.q)};
	else if(ptc == 2) return {max(s.p + t.p, max(s.p + t.q, s.q + t.p)), s.q + t.q};
	else return {max(s.p + t.q, s.q + t.p), s.q + t.q};
}

int findSample(int n, int confidence[], int host[], int protocol[]){
	for(int i = 0; i < n; i++) st[i] = {confidence[i], 0};
	for(int i = n - 1; i >= 1; i--){
		st[host[i]] = f(protocol[i], st[i], st[host[i]]);
	}
	return max(st[0].p, st[0].q);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

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