oj.uz

Submission #346466

# Submission time Handle Problem Language Result Execution time Memory
346466 2021-01-09T20:22:57 Z alishahali1382 Senior Postmen (BOI14_postmen) C++14
100 / 100
 493 ms 73452 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=500010, LOG=20;

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

inline void add(int v){
	if (last[v]){
		while (last[v]){
			cout<<stk[sz]<<" ";
			last[stk[sz--]]=0;
		}
		cout<<"\n";
	}
	stk[++sz]=v;
	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);
	}
}

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);
	if (sz){
		for (int i=1; i<=sz; i++) cout<<stk[i]<<" ";cout<<"\n";
	}
	
	return 0;
}
/*
5 7
1 2
2 3
3 1
1 4
2 4
1 5
2 5

*/

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:66:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   66 |   for (int i=1; i<=sz; i++) cout<<stk[i]<<" ";cout<<"\n";
      |   ^~~
postmen.cpp:66:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   66 |   for (int i=1; i<=sz; i++) cout<<stk[i]<<" ";cout<<"\n";
      |                                               ^~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 10 ms 12396 KB Output is correct
5 Correct 9 ms 12268 KB Output is correct
6 Correct 10 ms 12524 KB Output is correct
7 Correct 14 ms 13548 KB Output is correct
8 Correct 9 ms 12268 KB Output is correct
9 Correct 43 ms 20844 KB Output is correct
10 Correct 9 ms 12268 KB Output is correct
11 Correct 11 ms 12268 KB Output is correct
12 Correct 48 ms 21228 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 11 ms 12396 KB Output is correct
5 Correct 9 ms 12268 KB Output is correct
6 Correct 10 ms 12524 KB Output is correct
7 Correct 14 ms 13548 KB Output is correct
8 Correct 9 ms 12268 KB Output is correct
9 Correct 44 ms 20844 KB Output is correct
10 Correct 10 ms 12268 KB Output is correct
11 Correct 10 ms 12268 KB Output is correct
12 Correct 50 ms 21228 KB Output is correct
13 Correct 71 ms 23148 KB Output is correct
14 Correct 68 ms 19308 KB Output is correct
15 Correct 67 ms 21856 KB Output is correct
16 Correct 76 ms 23020 KB Output is correct
17 Correct 71 ms 16364 KB Output is correct
18 Correct 75 ms 20716 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12160 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 10 ms 12396 KB Output is correct
5 Correct 9 ms 12268 KB Output is correct
6 Correct 10 ms 12524 KB Output is correct
7 Correct 14 ms 13548 KB Output is correct
8 Correct 10 ms 12268 KB Output is correct
9 Correct 45 ms 20844 KB Output is correct
10 Correct 11 ms 12268 KB Output is correct
11 Correct 9 ms 12396 KB Output is correct
12 Correct 49 ms 21228 KB Output is correct
13 Correct 73 ms 23020 KB Output is correct
14 Correct 63 ms 19308 KB Output is correct
15 Correct 67 ms 21856 KB Output is correct
16 Correct 72 ms 23020 KB Output is correct
17 Correct 72 ms 16364 KB Output is correct
18 Correct 69 ms 20716 KB Output is correct
19 Correct 464 ms 73452 KB Output is correct
20 Correct 429 ms 55020 KB Output is correct
21 Correct 429 ms 66132 KB Output is correct
22 Correct 477 ms 73452 KB Output is correct
23 Correct 200 ms 58492 KB Output is correct
24 Correct 493 ms 40172 KB Output is correct
25 Correct 475 ms 62188 KB Output is correct