# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698544 | _martynas | Pipes (BOI13_pipes) | C++11 | 185 ms | 18760 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 F first
#define S second
#define PB push_back
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
const int MXN = 1e5+5;
int n, m;
ll C[MXN];
vector<pii> adj[MXN];
int degree[MXN];
ll E[5*MXN];
bool visited[MXN];
void dfs(int u, vi &comp) {
visited[u] = true;
comp.PB(u);
for(auto p : adj[u]) {
int v = p.F;
if(visited[v] || !degree[v]) continue;
dfs(v, comp);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |