Submission #1005531

#TimeUsernameProblemLanguageResultExecution timeMemory
1005531vjudge1Untitled (POI11_imp)C++17
100 / 100
880 ms25424 KiB
#include <bits/stdc++.h> //#include "Allincludes.h" typedef long long ll; using namespace std; #define int long long bool f[3002][3002]; signed main(){ int n, m; cin >> n >> m; while(m--){ int a, b; cin >> a >> b; 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; } } } } vector<int>ans; for(int i = 1; i <= n; i++){ if(!ii[i]) ans.push_back(i); } int y = n/3; for(int i = 0; i < y; i++){ cout << ans[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...