# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
383392 | morato | Bitaro’s Party (JOI18_bitaro) | C++17 | 4 ms | 2796 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 MAXN = 1e5 + 5;
vector<int> adj[MAXN];
int mark[MAXN], ans[MAXN], in[MAXN];
int a[2 * MAXN], b[2 * MAXN];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, m, q;
cin >> n >> m >> q;
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
adj[b[i]].push_back(a[i]);
in[a[i]]++;
}
int t, k;
cin >> t >> k;
for (int i = 0; i < k; i++) {
int x;
cin >> x;
mark[x] = 1;
}
vector<int> lista;
for (int i = t + 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... |