# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
30081 | tlwpdus | Untitled (POI11_smi) | C++11 | 1309 ms | 94520 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;
typedef pair<int,int> pii;
int n, m, p;
vector<pii> lis[100100];
bool chk[1000100], visit[100100];
int idx[100100];
vector<int> ans[1000100];
stack<int> st;
void dfs(int here) {
visit[here] = 1;
for (;idx[here]<lis[here].size();) {
pii tmp = lis[here][idx[here]]; idx[here]++;
int there = tmp.second;
if (chk[tmp.first]) continue;
chk[tmp.first] = 1;
dfs(there);
}
st.push(here);
}
bool good[100100];
stack<int> tt;
void add() {
while(!st.empty()) {
int here = st.top(); st.pop();
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |