# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200108 | Saboon | Dostavljač (COCI18_dostavljac) | C++14 | 660 ms | 3292 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;
typedef long long ll;
const int maxn = 500 + 37;
int a[maxn];
vector<int> t[maxn];
short Time = 1, st[maxn], pos[maxn];
short dis[maxn][maxn];
int dp[maxn][maxn], pd[maxn][maxn];
void dfsdis(int v, int src, int par = -1){
for (auto u : t[v]){
if (u == par)
continue;
dis[src][u] = dis[src][v] + 1;
dfsdis(u, src, v);
}
}
void dfs(int v, int par = -1){
pos[Time] = v;
st[v] = Time ++;
for (auto u : t[v])
if (u != par)
dfs(u, v);
}
int main(){
# | 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... |
# | 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... |