# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301249 | marius7122 | Shell (info1cup18_shell) | C++14 | 1056 ms | 41240 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10;
const int MOD = 1e9 + 7;
vector<int> g[N], topOrd;
int n, m, p;
int ord[N], topOrdIndex[N], dp[N];
bool viz[N];
void topSort(int node)
{
viz[node] = true;
for(int y : g[node])
if(!viz[y])
topSort(y);
topOrd.push_back(node);
}
int main()
{
cin >> n >> m >> p;
for(int i = 0; i < p; i++)
cin >> ord[i];
ord[p] = n;
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... |