Submission #597024

#TimeUsernameProblemLanguageResultExecution timeMemory
597024DJ035Untitled (POI11_imp)C++17
90 / 100
855 ms65596 KiB
#pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2") #include <bits/stdc++.h> #define MEM 3333 #define sanic ios_base::sync_with_stdio(0) #define x first #define y second #define pf push_front #define pb push_back #define all(v) v.begin(), v.end() #define sz size() using namespace std; typedef long long ll; typedef pair<ll, ll> pi; const ll INF = 2e18; const ll MOD = 998244353; ll n,m,k; ll a[MEM][MEM], p[MEM]; signed main(){ sanic; cin.tie(0); cin >> n >> m; for(int i=0; i<m; i++){ ll q1,q2; cin >> q1 >> q2; if(q1>q2) swap(q1,q2); a[q1][q2] = 1; } for(int i=1; i<=n; i++) for(int j=i+1; j<=n; j++){ if(a[i][j]) continue; if(p[i]+p[j]) continue; p[i] = p[j] = 1; } ll o=0; for(int i=1; i<=n; i++){ o += p[i]^1; if(p[i]^1) cout << i << ' '; if(o==n/3) break; } }
#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...