# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1031165 | belgianbot | Bitaro’s Party (JOI18_bitaro) | C++14 | 91 ms | 24400 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;
int N, M, Q;
vector<vector<int>> adj, revAdj;
vector<int> memo;
int goal;
int dp(int pos) {
if (pos > goal) return INT_MIN;
if (pos == goal) return 0;
if (memo[pos] != -1) return memo[pos];
int ans = INT_MIN;
for (int x : adj[pos]) {
ans = max(ans, dp(x) + 1);
}
return memo[pos] = ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> N >> M >> Q;
adj.resize(N); revAdj.resize(N);
for (int i = 0; i < M; i++) {
int a, b; cin >> a >> b; a--; b--;
adj[a].push_back(b);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |