# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
689615 | tvladm2009 | Shell (info1cup18_shell) | C++17 | 437 ms | 78976 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 long long ll;
const int N = (int) 1e6 + 7;
const int M = (int) 1e9 + 7;
int a[N], special[N], degree[N], dp[N], order[N];
vector<int> in[N], out[N];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m, p;
cin >> n >> m >> p;
for (int i = 1; i <= p; i++) {
cin >> a[i];
special[a[i]] = 1;
}
for (int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
in[y].push_back(x);
out[x].push_back(y);
degree[y]++;
}
queue<int> q;
vector<int> depth(n + 1);
for (int i = 1; i <= n; i++) {
if (degree[i] == 0) {
# | 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... |