# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976395 | 2024-05-06T14:03:24 Z | vjudge1 | Pizza (COCI21_pizza) | C++17 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define pll pair<ll,ll> const ll MOD=1e9+7; #define ll int //#define ll int //KALAU TAKUT RTE bool cmp (pair<ll,ll> x, pair<ll,ll>y){ return x.second < y.second; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); ll n; cin>>n; set<ll>a; for (int i=0; i<n;i++){ ll x; cin>>x; a.insert(x); } ll m ; cin>>m; ll cnt=0; while(m--){ ll k; cin>>k; bool suka = true; for (int i=0; i<k;i++){ ll x; cin>>x; if (a.count(x)) suka=false; } if (suka) cnt++; } cout<<cnt<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |