oj.uz

Submission #886944

# Submission time Handle Problem Language Result Execution time Memory
886944 2023-12-13T08:28:10 Z JakobZorz Friend (IOI14_friend) C++17
16 / 100
 1 ms 600 KB 
#include"friend.h"
#include<vector>
using namespace std;

// Find out best sample
int findSample(int n,int confidence[],int host[],int protocol[]){
    vector<int>yes(n),no(n);
    for(int i=0;i<n;i++)
        yes[i]=confidence[i];
    
    for(int i=n-1;i>=0;i--){
        int j=host[i]; // eliminate i
        switch(protocol[i]){
            case 0: { // I am your friend
                yes[j]=max(yes[i]+no[j],no[i]+yes[j]);
                no[j]=no[i]+no[j];
                break;
            }
            case 1: { // My friends are your friends
                yes[j]=max(yes[i]+yes[j],max(yes[i]+no[j],no[i]+yes[j]));
                no[j]=no[i]+no[j];
                break;
            }
            case 2: { // We are your friends
                yes[j]=max(yes[i]+no[j],no[i]+yes[j]);
                no[j]=no[i]+no[j];
                break;
            }
        }
    }
    
    return max(yes[0],no[0]);
}

Subtask #1
0 / 11.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
8.0 / 8.0

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

Subtask #4
0 / 19.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 31.0

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