Submission #438721

#TimeUsernameProblemLanguageResultExecution timeMemory
438721SorahISAPizza (COCI21_pizza)C++17
50 / 50
1 ms316 KiB
// #pragma GCC optimize("Ofast", "unroll-loops") #include <bits/stdc++.h> using namespace std; #define int long long #define double long double using pii = pair<int, int>; template<typename T> using prior = priority_queue<T, vector<T>, greater<T>>; template<typename T> using Prior = priority_queue<T>; #define X first #define Y second #define ALL(x) (x).begin(), (x).end() #define eb emplace_back #define pb push_back #define fastIO() ios_base::sync_with_stdio(false), cin.tie(0) void solve() { int n, m, k, tmp, fl, cnt = 0; cin >> n; set<int> st; while (n--) cin >> tmp, st.insert(tmp); cin >> m; while (m--) { cin >> k, fl = 0; while (k--) cin >> tmp, fl |= st.count(tmp); cnt += !fl; } cout << cnt << "\n"; } int32_t main() { fastIO(); int t = 1; // cin >> t; while (t--) solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...