# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
129511 | antimirage | Friend (IOI14_friend) | C++14 | 38 ms | 2808 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 <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 15;
vector <int> g[N], vec;
int u[N], dp[1 << 15], ans, sum;
int findSample(int n, int val[], int batya[], int type[]) {
for (int i = 1; i < n; i++) {
if (type[i] == 0) {
g[batya[i]].pb(i);
g[i].pb(batya[i]);
}
else if (type[i] == 1) {
for (auto it: g[batya[i]]) {
g[i].pb(it);
g[it].pb(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |