Submission #316990

#TimeUsernameProblemLanguageResultExecution timeMemory
316990thecodingwizardUntitled (POI11_imp)C++11
9 / 100
917 ms9208 KiB
#include <bits/stdc++.h> using namespace std; #define pb push_back bool adj[3000][3000]; bool dead[3000]; int main() { cin.tie(0)->sync_with_stdio(0); int n, m; cin >> n >> m; for (int i = 0; i < m; i++) { int a, b; cin >> a >> b; --a; --b; adj[a][b] = 1; adj[b][a] = 1; } for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if (!dead[i] && !dead[j] && !adj[i][j]) { dead[i] = dead[j] = 1; } } } int ct = 0; for (int i = 0; i < n; i++) { if (!dead[i]) { cout << i+1 << " "; ct++; if (ct == n*2/3) break; } } cout << endl; 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...