제출 #1005513

#제출 시각아이디문제언어결과실행 시간메모리
1005513vjudge1무제 (POI11_imp)C++17
100 / 100
350 ms9300 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int maxn = 3005; bool adj[maxn][maxn]; signed main() { cin.tie(0) -> sync_with_stdio(0); int n, m; cin >> n >> m; for(int i = 0; i < m; i++){ int u, v; cin >> u >> v; adj[u][v] = 1; adj[v][u] = 1; } bool skip[n + 5] = {}; for(int i = 1; i <= n; i++){ for(int j = 1; j <= n; j++){ if(skip[i] || skip[j] || i == j) continue; if(!adj[i][j]){ skip[i] = 1; skip[j] = 1; } } } int t = 0; vector<int>ans; for(int i = 1; i <= n && t < n / 3; i++){ if(skip[i]) continue; t++; ans.push_back(i); } for(int i : ans) cout << i << ' '; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...