# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314864 | model_code | Papričice (COCI20_papricice) | C++17 | 278 ms | 20088 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 <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10, INF = 1e9;
int n, sz[MAXN];
vector<int> e[MAXN];
set<int> A, B;
int calc_sz(int x, int p) {
sz[x] = 1;
for (auto y : e[x]) {
if (y != p) sz[x] += calc_sz(y, x);
}
return sz[x];
}
vector<int> closest(const set<int>& S, int val) {
vector<int> result;
auto it = S.upper_bound(val);
if (it != S.end()) result.push_back(*it);
if (it != S.begin()) {
--it;
result.push_back(*it);
}
return result;
}
int balance(int a, int b, int c) {
return max({a, b, c}) - min({a, b, c});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |