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 ll long long
#define endl '\n'
#define all(x) x.begin(), x.end()
#define INF 0x3f3f3f3f
#define INFLL (ll)0x3f3f3f3f3f3f3f3f
const int MOD = 1e9 + 7, SZ = 1e5 + 10;
const int MAXN = 3e3 + 10;
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
int N = n;
vector<vector<int>> vtx(n + 1);
int A[n + 1] = {};
while(m--){
int u, v;
cin >> u >> v;
vtx[u].push_back(v);
vtx[v].push_back(u);
}
// cout << endl;
for(int i = 1; i <= n; i++){
int con[n + 1] = {};
for(int v : vtx[i]){
con[v] = 1;
}
for(int j = 1; j <= n; j++){
if(con[j] || j == i) continue;
A[i] = A[j] = 1;
break;
}
}
cout << "ans: ";
for(int i = 1; i <= n; i++){
if(A[i] && N > n / 3){
N--;
continue;
}
cout << i << ' ';
}
cout << endl;
return 0;
}
// by me
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |