# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971570 | 2024-04-29T02:30:03 Z | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 436 KB |
#include<bits/stdc++.h> using namespace std; int n,m,k,b; int gaksuka[100]; bool search(int cari){ for(int i=0; i<n;i++){ if(cari == gaksuka[i]) return false; } return true; } int main(){ cin>>n; for(int i=0;i<n;i++){ cin>>gaksuka[i]; } cin>>m; int count=0; bool bisa = true; while(m--){ cin>>k; bisa = true; while(k--){ cin>>b; if(!search(b)) bisa = false; continue; } if(bisa) count++; } cout<<count; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 436 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |