oj.uz

Submission #15689

# Submission time Handle Problem Language Result Execution time Memory
15689 2015-07-15T11:17:23 Z ainta Friend (IOI14_friend) C++
35 / 100
 1 ms 3044 KB 
#include "friend.h"
#include<algorithm>
using namespace std;

// Find out best sample

int Gap[101000][2];

int findSample(int n,int confidence[],int host[],int protocol[]){
    int i;
    for(i=0;i<n;i++)Gap[i][0]=confidence[i];
    for(i=n-1;i>0;i--){
        Gap[i][0] = max(Gap[i][0],Gap[i][1]);
        if(protocol[i] == 1){
            Gap[host[i]][0] += Gap[i][0];
            Gap[host[i]][1] += Gap[i][1];
            continue;
        }
        if(protocol[i] == 2){
            Gap[host[i]][0] = max(Gap[i][0] + Gap[host[i]][1], Gap[host[i]][0] + Gap[i][1]);
            Gap[host[i]][1] = Gap[host[i]][1] += Gap[i][1];
        }
        if(protocol[i] == 0){
            Gap[host[i]][0] += Gap[i][1];
            Gap[host[i]][1] += Gap[i][0];
        }
    }
    return max(Gap[0][0],Gap[0][1]);
}

Subtask #1
0.0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
19.0 / 19.0

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

Subtask #5
0.0 / 23.0

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

Subtask #6
0.0 / 31.0

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