# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
286902 | tmwilliamlin168 | 고대 책들 (IOI17_books) | C++14 | 45 ms | 71032 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 "books.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int mxN=1e6;
int n, a, b, who[mxN];
vector<int> adj[mxN], adj2[mxN], st, adj3[mxN];
bool vis[mxN];
ar<int, 3> dp[mxN];
void dfs1(int u) {
vis[u]=1;
for(int v : adj[u])
if(!vis[v])
dfs1(v);
st.push_back(u);
}
void dfs2(int u, int r) {
vis[u]=0;
who[u]=r;
for(int v : adj2[u])
if(vis[v])
dfs2(v, r);
}
ll minimum_walk(vector<int> p, int s) {
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |