# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296868 | Lawliet | Pipes (BOI13_pipes) | C++17 | 399 ms | 29816 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 int lli;
const int MAXN = 100010;
const int MAXM = 500010;
int n, m;
int v[MAXN];
int degree[MAXN];
lli ans[MAXM];
lli curSum[MAXN];
bool mark[MAXN];
vector<int> adj[MAXN];
vector<int> indEdge[MAXN];
queue<int> q;
void add(int cur)
{
q.push(cur);
mark[cur] = true;
}
int nextIndEdge(int cur)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |