이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
//#include "Allincludes.h"
typedef long long ll;
using namespace std;
#define int long long
vector<vector<int>>e;
bool f[3002][3002];
signed main(){
int n, m;
cin >> n >> m;
e.resize(n+1);
while(m--){
int a, b;
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
f[a][b] = 1;
f[b][a] = 1;
}
bool ii[n+1];
fill(ii, ii + n+1, 0);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(!ii[i] && !ii[j]){
if(i != j && f[i][j] == 0){
ii[i] = 1;
ii[j] = 1;
for(auto x : e[i]){
f[i][x] = 0;
f[x][i] = 0;
}
for(auto x : e[j]){
f[j][x] = 0;
f[x][j] = 0;
}
}
}
}
}
vector<int>ans;
for(int i = 1; i <= n; i++){
for(auto x : e[i]){
if(f[i][x]){
ans.push_back(i);
break;
}
if(f[x][i]){
ans.push_back(i);
break;
}
}
}
int y = n/3;
for(int i = 0; i < y; i++){
cout << ans[i] << " ";
}
}
# | 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... |