oj.uz

Submission #346454

# Submission time Handle Problem Language Result Execution time Memory
346454 2021-01-09T19:59:00 Z alishahali1382 Senior Postmen (BOI14_postmen) C++14
0 / 100
 6 ms 7532 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int MAXN=300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int last[MAXN], sz;
pii stk[MAXN];
bool mark[MAXN];
vector<pii> G[MAXN];

inline void add(int v, int e){
	if (last[v]){
		while (last[v]){
			cout<<stk[sz].second<<" ";
			last[stk[sz--].first]=0;
		}
		cout<<"\n";
	}
	stk[++sz]={v, e};
	last[v]=sz;
}

void dfs(int node){
	while (G[node].size()){
		pii p=G[node].back();
		G[node].pop_back();
		int v=p.first, e=p.second;
		if (mark[e]) continue ;
		mark[e]=1;
		dfs(v);
		add(v, e);
	}
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m;
	for (int i=1; i<=m; i++){
		cin>>u>>v;
		G[u].pb({v, i});
		G[v].pb({u, i});
	}
	dfs(1);
	add(stk[1].first, 0);
	
	return 0;
}

Subtask #1
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Incorrect 5 ms 7404 KB Edge does not exist or used 8, 2
3 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7404 KB Output is correct
2 Incorrect 5 ms 7404 KB Edge does not exist or used 8, 2
3 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Incorrect 5 ms 7404 KB Edge does not exist or used 8, 2
3 Halted 0 ms 0 KB -