# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
220886 | rama_pang | Bitaro’s Party (JOI18_bitaro) | C++14 | 1741 ms | 418552 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;
const int MAXN = 100005;
const int BLOCK = 305;
int N, M, Q;
vector<int> radj[MAXN];
int vis[MAXN], mark = 0;
int dp[MAXN];
bool cannot_visit[MAXN];
int in_ans[MAXN];
vector<pair<int, int>> ans[MAXN]; // BLOCK longest paths from a vertex (city, length)
void Read() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> N >> M >> Q;
for (int i = 0; i < M; i++) {
int S, E;
cin >> S >> E;
radj[E].emplace_back(S);
}
}
void Preprocess(int n) {
if (vis[n] == mark) return;
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... |