Submission #1035324

#TimeUsernameProblemLanguageResultExecution timeMemory
1035324vjudge1World of Tank (innopolis2018_final_E)C++17
15 / 100
2 ms604 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main() { int n, m1, m2, t; cin >> n >> m1 >> m2 >> t; vector<vector<int>> a(3, vector<int> (n + 1)); for (int i = 0; i < m1; i++){ int x; cin >> x; a[1][x] = 1; } for (int i = 0; i < m2; i++){ int x; cin >> x; a[2][x] = 1; } set<int> ans; bool f = 0; int pos = 1; for (int i = 0; i < n; i++){ if (a[pos][i + 1]){ ans.insert(i); pos = 3 - pos; if (a[pos][i] || a[pos][i + 1]){ f = 1; break; } } } if (f) cout << "No" << endl; else{ cout << "Yes" << endl; cout << ans.size() << endl; for (int x : ans){ cout << x << ' '; } cout << endl; cout << 0 << endl; } }
#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...