# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
293099 | Saboon | Simurgh (IOI17_simurgh) | C++17 | 5 ms | 2816 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 "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500 + 10;
vector<pair<int,int>> g[maxn];
int par[maxn], parindex[maxn], h[maxn];
bool visited[maxn];
int Cost, c[maxn*maxn];
void dfs(int v){
visited[v] = 1;
for (auto [u,idx] : g[v]){
if (!visited[u]){
h[u] = h[v]+1;
par[u] = v;
parindex[u] = idx;
dfs(u);
}
}
}
bool eq[maxn];
vector<int> Q;
vector<int> Dw[maxn];
vector<int> Ed[maxn];
int sz[maxn];
void solve(int l, int r, int x){
Compilation message (stderr)
# | 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... |