# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053625 | devariaota | Senior Postmen (BOI14_postmen) | C++17 | 1077 ms | 14172 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef unsigned long long int ull;
const ll md = 1e9+7;
const int ukr = 5e5+10;
int read() {
int ketek = 0; bool ne=0;
register char c = getchar();
while(c == ' ' or c =='\n') c =getchar();
if(c=='-'){ne = 1; c = getchar();}
while(c >= '0' and c <='9') { ketek = (ketek<<3)+(ketek<<1)+c-'0'; c = getchar();}
if(ne) ketek*=-1;
return ketek;
}
void print(int x) {
if (x < 0) {putchar('-');x = -x;}
int len = 0, buf[10];
if (x == 0) {putchar('0');return;}
while (x > 0) {buf[len++] = x % 10; x/=10;}
while (len > 0) {putchar('0' + buf[--len]);}
}
void File_Work(){
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
}
int n, m, a, b, c, d, id;
struct babi{
ll x, y, id;
};
struct babis{
ll x, y;
};
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
ll pgkt(ll rnx, ll rny){
if(rny == 0) return 1;
ll nwrn = pgkt(rnx, rny/2);
if(rny%2){
return (((nwrn*nwrn)%md)*rnx)%md;
}else{
return (nwrn*nwrn)%md;
}
}
vector<vector<pair<int,int>>> adj(ukr);
vector<int> v;
int vis[ukr];
int eve[ukr];
int deg[ukr];
string s;
set<ll> st;
bool dfs(ll rn){
vis[rn] = 1;
deg[rn] -= 2;
v.push_back(rn);
if(!deg[rn]){
auto it = st.find(rn);
st.erase(it);
}
for(auto i : adj[rn]){
if(eve[i.second]){
continue;
}
eve[i.second] = 1;
if(vis[i.first]){
for(auto j : v){
cout << j << " ";
}
cout << "\n";
vis[i.first] = 0;
return 1;
}
if(dfs(i.first)){
vis[i.first] = 0;
return 1;
}
}
v.pop_back();
vis[rn] = 0;
if(!deg[rn]){
st.insert(rn);
}
deg[rn] += 2;
return 0;
}
void solve(){
cin >> n >> m;
for(int i = 0; i < m; i++){
cin >> a >> b;
adj[a].push_back({b, i});
adj[b].push_back({a, i});
deg[a]++; deg[b]++;
}
for(int i = 1; i <= n; i++){
st.insert(i);
}
while(!st.empty()){
v.clear();
dfs(*st.begin());
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t =1;
//cin >> t;
for(int i = 1; i <= t; i++){
//cout << "Case " << i << ": ";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |