# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1106963 | TrendBattles | Bitaro’s Party (JOI18_bitaro) | C++14 | 3 ms | 5712 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.
//https://oj.uz/problem/view/JOI18_bitaro
#include <bits/stdc++.h>
using namespace std;
using lli = int64_t;
#define INFILE "JOI18_bitaro.inp"
#define OUTFILE "JOI18_bitaro.out"
const int MAX_N = (int) 1e5;
vector <int> graph[MAX_N], rev_graph[MAX_N];
int appear[MAX_N];
int dp[MAX_N];
int Brute_Force(int s) {
int ans = -1;
memset(dp, -1, sizeof (int) * (s + 1));
dp[s] = 0;
for (int u = s; u >= 0; --u) {
if (appear[u]) ans = max(ans, dp[u]);
for (int v : rev_graph[u]) {
dp[v] = max(dp[v], dp[u] + 1);
}
}
return ans;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
if (fopen(INFILE, "r")) {
freopen(INFILE, "r", stdin);
freopen(OUTFILE, "w", stdout);
}
int N, M, Q; cin >> N >> M >> Q;
for (int i = 0; i < M; ++i) {
int u, v; cin >> u >> v;
u -= 1; v -= 1;
graph[u].push_back(v);
rev_graph[v].push_back(u);
}
// Init(N);
for (int i = 0; i < N; ++i) appear[i] = true;
for (int qu = 0; qu < Q; ++qu) {
int dest, num_busy; cin >> dest >> num_busy;
dest -= 1;
vector <int> L(num_busy);
for (int& x : L) {
cin >> x;
x -= 1;
appear[x] = false;
}
cout << Brute_Force(dest) << '\n';
// if (num_busy >= BLOCK_SIZE) {
// cout << Brute_Force(dest) << '\n';
// } else {
// cout << Check_Store(dest) << '\n';
// }
for (int x : L) {
appear[x] = true;
}
}
return 0;
}
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... |