| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 239636 | super_j6 | Friend (IOI14_friend) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "friend.h"
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
#define vi vector<int>
int findSample(int n, vi a, vi p, vi b){
int ret = 0;
for(int i = n - 1; i; i--){
switch(b[i]){
case 0:
ret += a[i];
a[p[i]] = max(a[p[i]] - a[i], 0);
break;
case 1:
a[p[i]] += a[i];
break;
case 2:
a[p[i]] = max(a[p[i]], a[i]);
break;
}
}
return ret + a[0];
}