Submission #147864

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
147864	2019-08-31T03:24:28 Z	willi19	Friend (IOI14_friend)	C++14	8 / 100	3 ms	504 KB

friend

#include <cstdio>
#include <cassert>
#define __MAXSIZE__ 100002
#include "friend.h"
#include<bits/stdc++.h>
using namespace std;
set<int,greater<int> > s;
int ans[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
    int ret=0;
    s.insert(confidence[0]);
    for(int i=1;i<n;i++)
    {
        if(protocol[i]==0)
        {
            if(s.find(confidence[host[i]])==s.begin())
            {
                if(s.size()==1)
                    continue;
                else
                {
                    set<int> ::iterator it=s.begin();
                    it++;
                    ans[i]=*it;
                }
            }
            else
                ans[i]=*(s.begin());
        }
        if(protocol[i]==1)
            ans[i]=max(confidence[host[i]],ans[host[i]]);
        if(protocol[i]==2)
            ans[i]=ans[host[i]];
        s.insert(confidence[i]);
        ret=max(ret,confidence[i]+ans[i]);
        //cout<<i<<" "<<ans[i]<<"\n";
    }
    return ret;
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 8.0

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

Subtask #3
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 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	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	380 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct