제출 #120401

#제출 시각아이디문제언어결과실행 시간메모리
120401popovicirobert무제 (POI11_imp)C++14
100 / 100
735 ms33528 KiB
#include <bits/stdc++.h> #define ll long long #define ull unsigned long long #define lsb(x) (x & (-x)) using namespace std; const int MAXN = 3000; bitset < 3005 > edge[MAXN + 1]; bool vis[MAXN + 1]; int main() { //ifstream cin("A.in"); //ofstream cout("A.out"); int i, j, n, m; ios::sync_with_stdio(false); cin.tie(0), cout.tie(0); cin >> n >> m; for(i = 1; i <= m; i++) { int x, y; cin >> x >> y; edge[x][y] = edge[y][x] = 1; } for(i = 1; i <= n; i++) { if(vis[i]) continue; for(j = 1; j <= n; j++) { if(i != j && edge[i][j] == 0 && vis[j] == 0) { vis[i] = vis[j] = 1; break; } } } int cnt = 0; for(i = 1; i <= n; i++) { if(vis[i] == 0) { cnt++; if(cnt <= n / 3) { cout << i << " "; } } } return 0; }
#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...