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 <iostream>
#include <vector>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((b) < (a)) ? (b) : (a))
int const nmax = 3000;
int mat[1 + nmax][1 + nmax];
int sol[1 + nmax];
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
int n, m;
std::cin >> n >> m;
for(int i = 1; i <= n; i++)
mat[i][i] = 1;
for(int i = 1; i <= m; i++) {
int x, y;
std::cin >> x >> y;
mat[x][y] = mat[y][x] = 1;
}
for(int i = 1; i <= n; i++)
sol[i] = 1;
for(int i = 1;i <= n; i++)
for(int j = 1;j <= n; j++)
if(mat[i][j] == 0 && sol[i] + sol[j] == 2)
sol[i] = sol[j] = 0;
int _count = 0;
for(int i = 1;i <= n; i++)
if(_count < n / 3 && sol[i] == 1) {
std::cout << i << " ";
_count++;
}
return 0;
}
# | 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... |