# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1147379 | dobri_oke | Commuter Pass (JOI18_commuter_pass) | C++20 | 131 ms | 57484 KiB |
//#pragma GCC target ("avx2")
//#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define pb push_back
const int N = 1e6, NN=10;
const int mod=1e9+7;
vector < pair < int, int > > vr[N], vr2[N];
vector < int > top;
bool was[N], was2[N];
int n, m, s, t, u, v;
int d1[N], d2[N], dp[3][N], d[N];
void dfs(int x){
was[x]=1;
for(auto to : vr2[x]){
if(was[to.F]) continue;
dfs(to.F);
}
top.pb(x);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |