Submission #1069204

#TimeUsernameProblemLanguageResultExecution timeMemory
1069204vjudge1Potemkin cycle (CEOI15_indcyc)C++17
10 / 100
8 ms600 KiB
#include<bits/stdc++.h> using namespace std; typedef pair<int, int> ii; typedef long long ll; typedef vector<ll> vll; typedef pair<long long, long long> pll; typedef pair<char, int> ci; typedef pair<string, int> si; typedef long double ld; typedef vector<int> vi; typedef vector<string> vs; #define pb push_back #define fi first #define se second #define whole(v) v.begin(), v.end() #define rwhole(v) v.rbegin(), v.rend() #define inf INT_MAX/2 #define fro front int main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n, r; cin >> n >> r; vector<ii> x(n+1, ii(inf, -1)); for(int i = 0; i < r; ++i){ int a, b; cin >> a >> b; if(b < a){ swap(a, b); } if(b == a+1){ x[a].se = 1; }else if(b < x[a].fi && b > a){ x[a].fi = b; } } vector<int> ans; for(int i = 1; i <= n; ++i){ int target = x[i].fi; //cout << target << " " << x[i].se << endl; if(target - i < 3){ continue; } if(x[i].se == -1){ continue; } int j = i+1; ans.pb(i); while(j != target){ if(x[j].fi <= target){ ans.clear(); break; } if(x[j].se == -1){ ans.clear(); break; } ans.pb(j); j++; } ans.pb(target); if(ans.size() >= 4){ break; } ans.clear(); } if(ans.size() < 4){ cout << "no" << endl; }else{ for(auto e:ans){ cout << e << " "; } cout << endl; } }
#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...