제출 #317142

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
317142		VROOM_VARUN	친구 (IOI14_friend)	C++14	100 / 100	39 ms	2680 KiB

friend

/*
ID: varunra2
LANG: C++
TASK: friend
*/

#include<bits/stdc++.h>
#include "friend.h"
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions

int findSample(int n, int *conf, int *host, int *type) {
  ll ret = 0;
  for(int i = n; i > 0; i--) {
    if(type[i] == 0) {
      //merge you with host
      ret += conf[i];
      conf[host[i]] = max(0, conf[host[i]] - conf[i]);
    }
    else if(type[i] == 1) {
      conf[host[i]] += conf[i];
    }
    else if(type[i] == 2) {
      conf[host[i]] = max(conf[host[i]], conf[i]);
    }
  }
  return ret + conf[0];
}

// int main() {
// #ifndef ONLINE_JUDGE
//   freopen("friend.in", "r", stdin);
//   freopen("friend.out", "w", stdout);
// #endif
//   cin.sync_with_stdio(0); cin.tie(0);



//   return 0;
// }

• Subtask 1: 11 / 11
• Subtask 2: 8 / 8
• Subtask 3: 8 / 8
• Subtask 4: 19 / 19
• Subtask 5: 23 / 23
• Subtask 6: 31 / 31