# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47758 | mirbek01 | Bitaro’s Party (JOI18_bitaro) | C++17 | 2074 ms | 9420 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 N = 1e5 + 2;
int n, m, q, d[N], used[N];
vector <int> g[N];
int main(){
cin >> n >> m >> q;
for(int i = 0; i < m; i ++){
int u, v;
scanf("%d %d", &u, &v);
g[v].push_back(u);
}
while(q --){
int t, y;
cin >> t >> y;
vector <int> v;
for(int i = 1; i <= y; i ++){
int x;
scanf("%d", &x);
used[x] = 1;
v.push_back(x);
}
set < pair <int, int> > st;
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... |