# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976731 | 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;
int main(){
int N,M,ans=0;
cin>>N;
int A[N];
for(int i=0; i<N; i++){
cin>>A[i];
}
cin>>M;
int B[M][100];
memset(B,0,sizeof(B));
for(int i=0; i<M; i++){
int K;
cin>>K;
for(int j=0; j<K; j++){
cin>>B[i][j];
}
}
for(int i=0; i<M; i++){
bool gsuka=false;
for(int j=0; j<100; j++){
if(gsuka) break;
if(B[i][j]==0){
ans++;
break;
}
for(int k=0; k<N; k++){
if(B[i][j]==A[k]){
gsuka=true;
# | 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... |