답안 #147883

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
147883	2019-08-31T04:13:23 Z	willi19	친구 (IOI14_friend)	C++14	8 / 100	3 ms	404 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 with[100100],without[100100];
int findSample(int n,int confidence[],int host[],int protocol[]){
    s.insert(confidence[0]);
    with[0]=confidence[0];
    for(int i=1;i<n;i++)
    {
        without[i]=max(with[i-1],without[i-1]);
        if(protocol[i]==0)
        {
            with[i]=max(with[host[i]]-confidence[host[i]]+confidence[i],without[i-1]);
        }
        if(protocol[i]==1)
            with[i]=with[host[i]]+confidence[i];
        if(protocol[i]==2)
            with[i]=with[host[i]]+confidence[i]-confidence[host[i]];
        s.insert(confidence[i]);
        //cout<<i<<" "<<ans[i]<<"\n";
    }
    return max(with[n-1],without[n-1]);
}

Subtask #1
0 / 11.0

#	결과	실행 시간	메모리	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	-

Subtask #2
0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	2 ms	376 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 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	2 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	3 ms	376 KB	Output is correct