# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363231 | Tenis0206 | Shell (info1cup18_shell) | C++11 | 592 ms | 81512 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 Mod = 1e9+7;
int n,m,p,spc[1000005];
long long lvl[1000005],cnt[1000005];
bool sel[1000005];
vector<int> G[1000005],IN[1000005],d;
void dfs(int x)
{
sel[x]=true;
for(auto it : G[x])
{
if(!sel[it])
{
dfs(it);
}
}
d.push_back(x);
}
void topsort()
{
dfs(1);
reverse(d.begin(),d.end());
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m>>p;
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... |