# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1017173 | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 348 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;
#define int long long
const int mod = 1e9+7;
signed main(){
int n; cin >> n;
unordered_map<int, int> a;
for(int i = 0; i < n; i++){
int u; cin >> u;
a[u] = i;
}
int m; cin >> m;
int cnt = 0;
for(int i = 0; i < m; i++){
int k; cin >> k;
bool ada = false;
vector<int> b(k);
for(int j = 0; j < k; j++){
cin >> b[j];
}
for(int j = 0; j < k; j++){
if(a.find(b[j]) != a.end()){
ada = true;
break;
}
}
# | 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... |