# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
510085 | racsosabe | Alkemija (COCI18_alkemija) | C++14 | 75 ms | 11108 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 = 100000 + 5;
int n;
int m;
int k;
int cnt[N];
bool vis[N];
vector<int> in[N];
vector<int> product[N];
int main(){
scanf("%d %d", &n, &m);
queue<int> Q;
for(int i = 1; i <= m; i++){
int x;
scanf("%d", &x);
Q.emplace(x);
vis[x] = true;
}
scanf("%d", &k);
for(int i = 1; i <= k; i++){
int l, r;
scanf("%d %d", &l, &r);
cnt[i] = l;
for(int j = 1; j <= l; j++){
int x;
scanf("%d", &x);
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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |