oj.uz

답안 #428323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
428323 2021-06-15T10:30:57 Z Dakto 친구 (IOI14_friend) C++17
35 / 100
 2 ms 460 KB 
#include "friend.h"
#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> me,friends,we;
vector<long long> conf;
using dp= pair<pair<long long,long long>,pair<long long, long long>>;
vector<dp> res;

template<class T>
void remax(T& a, T b){if(b>a) a=b;}

void dfs(int u){
    long long tr=0, nu=0, uu=0;
    for(auto i:me[u]){
        dfs(i);
        uu+=res[i].first.first;
        nu+=res[i].second.first;
    }
    for(auto i:friends[u]){
        dfs(i);
        uu+=res[i].first.second;
        nu+=res[i].second.first;
    }
    for(auto i:we[u]){
        dfs(i);
        uu+=res[i].first.first;
        nu+=res[i].second.first;
    }
    for(auto i:me[u]){
        tr+=res[i].second.second-res[i].second.first;
    }
    dp r={{nu,uu+conf[u]},{nu,uu+conf[u]}};
    remax(r.first.first,tr+nu);
    long long mf=0;
    for(auto i:friends[u]){
        remax(r.second.first,res[i].second.second+tr+nu-res[i].second.first);
        remax(r.second.second,conf[u]+res[i].first.second+nu-res[i].second.first);
    }
    for(auto i:we[u]){
        remax(r.second.second,res[i].second.second+nu-res[i].second.first);
    }
    remax(r.first.second,r.first.first);
    remax(r.second.first, r.first.first);
    remax(r.second.second,max(r.first.second,r.second.first));
    res[u]=r;
}

int findSample(int n,int confidence[],int host[],int protocol[]){
    me.resize(n);
    friends.resize(n);
    we.resize(n);
    conf.resize(n);
    res.resize(n);
    for(int i=0; i<n; i++){
        conf[i]=confidence[i];
    }
    for(int i=1; i<n; i++){
        if(protocol[i]==0) me[host[i]].push_back(i);
        if(protocol[i]==1) friends[host[i]].push_back(i);
        if(protocol[i]==2) we[host[i]].push_back(i);
    }
    dfs(0);
    return res[0].second.second;
}

Compilation message

friend.cpp: In function 'void dfs(int)':
friend.cpp:36:15: warning: unused variable 'mf' [-Wunused-variable]
   36 |     long long mf=0;
      |               ^~

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 304 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -