# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916878 | MateiKing80 | Shell (info1cup18_shell) | C++14 | 330 ms | 36740 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;
vector<int> o, ptop, top, nrt, dp;
vector<vector<int>> v, vi;
void maketop()
{
queue<int> q;
for(int i = 1; i <= n; i ++)
if(!nrt[i])
q.push(i);
while(!q.empty())
{
int x = q.front();
q.pop();
for(auto i : v[x])
{
nrt[i] --;
if(!nrt[i])
q.push(i);
}
top.push_back(x);
}
for(int i = 1; i <= n; 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |