이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
const int N = 3000;
int n, m;
bitset<N> adj[N];
bool in[N];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
memset(in, 1, sizeof(in));
for (int i = 0; i < m; i++) {
int a, b; cin>>a>>b;
adj[--a].set(--b);
adj[b].set(a);
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i != j && adj[i][j] == 0 && in[i] && in[j])
in[i] = in[j] = 0;
stringstream ss;
for (int i = 0, cnt = 0; i < n; i++) {
if (in[i]) {
ss << i << " ";
if (++cnt == n/3)
break;
}
}
cout << ss.str() << endl;
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... |