# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383390 | Leonardo_Paes | Bitaro’s Party (JOI18_bitaro) | C++17 | 3 ms | 3052 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 = 1e5+10;
int ans[maxn];
bool chegay[maxn];
vector<int> grafo[maxn];
void dfs(int u, int x){
if(u == x){
ans[u] = 0;
chegay[u] = 1;
return;
}
bool ok = 0;
for(int v : grafo[u]){
if(chegay[v]) ans[u] = max(ans[u], ans[v]);
if(v <= x) ok = 1;
if(ans[v] != -1 or v > x) continue;
dfs(v, x);
chegay[u] |= chegay[v];
if(chegay[v]) ans[u] = max(ans[u], ans[v]);
}
if(ok) ++ans[u];
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n, m, q;
cin >> n >> m >> q;
for(int i=1; i<=m; i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |