# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
233787 | jungsnow | Džumbus (COCI19_dzumbus) | C++14 | 808 ms | 19320 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;
#define TRACE(x) cerr << #x << " = " << x << endl
#define _ << " _ " <<
typedef long long ll;
typedef long double ld;
const int N = 1010, MAXQ = 2e5 + 10;
const ll INF = 1e15;
const int dummy = 0;
int n, m, q;
ll dp[N][N][2], D[N];
int numChild[N] ;
bool vis[N];
vector<int> adj[N];
void con(int par, int i) {
vis[i] = 1;
for (int v : adj[i]) if (v != par) {
if (!vis[v]) {
vis[v] = 1;
con(i, v);
}
}
}
void dfs(int par, int u) {
# | 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... |