제출 #1310274

#제출 시각아이디문제언어결과실행 시간메모리
1310274quollcucumber`Povjerenstvo (COI22_povjerenstvo)C++20
100 / 100
347 ms34676 KiB
// #pragma GCC optimize("Ofast,unroll-loops") #include <bits/stdc++.h> // #pragma GCC target("avx2") #define int long long using namespace std; signed main(){ int n, m; cin >> n >> m; vector<int> v[n+1]; for(int i = 0; i< m; i++) { int a, b; cin >> a>> b; v[b].push_back(a); v[a].push_back(b); } bool arr[n+1]; memset(arr, true, sizeof(arr)); vector<int> ans; for(int i = 1; i <= n; i++) { if(arr[i]) { ans.push_back(i); for(int j : v[i]) { arr[j] = false; } } } cout<<ans.size()<<'\n'; for(int i : ans) { cout<<i<<' '; } cout<<'\n'; 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...