Submission #147891

# Submission time Handle Problem Language Result Execution time Memory
147891 2019-08-31T05:41:17 Z willi19 Friend (IOI14_friend) C++14
8 / 100
3 ms 380 KB
#include <cstdio>
#include <cassert>
#define __MAXSIZE__ 100002
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
set<int,greater<int> > s;
int with[100100],without[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
    for(int i=n-1;i>0;i--)
    {
        with[i]+=confidence[i];
        if(protocol[i]==0)
            without[host[i]]+=max(with[i],without[i]);
        if(protocol[i]==1)
            with[host[i]]+=with[i];
        if(protocol[i]==2)
            with[host[i]]+=max(0,confidence[i]-confidence[host[i]]);
    }
    return max(with[0]+confidence[0],without[0]);
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 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 3 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 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 380 KB Output isn't correct
3 Halted 0 ms 0 KB -
# 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 Incorrect 2 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -