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;
#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 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... |