oj.uz

Submission #197470

# Submission time Handle Problem Language Result Execution time Memory
197470 2020-01-21T12:11:17 Z dndhk Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 49892 KB 
#include <bits/stdc++.h>

#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAX_N = 500000;

int N, M;
vector<pii> gp[MAX_N+1];
bool chk[MAX_N+1];
bool vst[MAX_N+1];
vector<int> v;

void solve(int x){
	vst[x] = true;
	v.pb(x);
	while(!gp[x].empty() && chk[gp[x].back().second])	gp[x].pop_back();
	chk[gp[x].back().second] = true;
	if(vst[gp[x].back().first]){
		while(v.back()!=gp[x].back().first){
			printf("%d ", v.back());
			vst[v.back()] = false;
			v.pop_back();
		}
		vst[v.back()] = false;
		printf("%d\n", v.back()); v.pop_back();
		if(v.empty())	return;
		else solve(gp[x].back().first);
	}
	else	solve(gp[x].back().first);
}

int main(){
	scanf("%d%d", &N, &M);
	for(int i=1; i<=M; i++){
		int a, b; scanf("%d%d", &a, &b);
		gp[a].pb({b, i});
		gp[b].pb({a, i});
	}
	int idx = 1;
	while(idx<=N){
		while(!gp[idx].empty() && chk[gp[idx].back().second])	gp[idx].pop_back();
		if(gp[idx].empty())	idx++;
		else{
			solve(idx);
		}
	}
	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &M);
  ~~~~~^~~~~~~~~~~~~~~~
postmen.cpp:41:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d%d", &a, &b);
             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12032 KB Output is correct
2 Correct 13 ms 12032 KB Output is correct
3 Correct 12 ms 12136 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 13 ms 12160 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 14 ms 12264 KB Output is correct
9 Correct 50 ms 14584 KB Output is correct
10 Correct 13 ms 12160 KB Output is correct
11 Correct 13 ms 12288 KB Output is correct
12 Correct 63 ms 15072 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 12008 KB Output is correct
2 Correct 15 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 14 ms 12160 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 18 ms 12288 KB Output is correct
7 Correct 22 ms 12544 KB Output is correct
8 Correct 14 ms 12160 KB Output is correct
9 Correct 52 ms 14564 KB Output is correct
10 Correct 15 ms 12160 KB Output is correct
11 Correct 12 ms 12288 KB Output is correct
12 Correct 58 ms 15076 KB Output is correct
13 Correct 103 ms 19716 KB Output is correct
14 Correct 89 ms 15736 KB Output is correct
15 Correct 83 ms 15276 KB Output is correct
16 Correct 105 ms 19696 KB Output is correct
17 Correct 97 ms 15608 KB Output is correct
18 Correct 101 ms 18296 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 12160 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 12 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 11 ms 12160 KB Output is correct
6 Correct 14 ms 12264 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 16 ms 12160 KB Output is correct
9 Correct 49 ms 14584 KB Output is correct
10 Correct 15 ms 12240 KB Output is correct
11 Correct 17 ms 12316 KB Output is correct
12 Correct 63 ms 15072 KB Output is correct
13 Correct 101 ms 19700 KB Output is correct
14 Correct 104 ms 15716 KB Output is correct
15 Correct 80 ms 15312 KB Output is correct
16 Correct 104 ms 19700 KB Output is correct
17 Correct 109 ms 15656 KB Output is correct
18 Correct 92 ms 18324 KB Output is correct
19 Execution timed out 550 ms 49892 KB Time limit exceeded
20 Halted 0 ms 0 KB -