oj.uz

답안 #197811

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197811 2020-01-23T11:23:09 Z dndhk 어르신 집배원 (BOI14_postmen) C++14
55 / 100
 500 ms 34200 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;
	int nxt = gp[x].back().first;
	gp[x].pop_back();
	if(vst[nxt]){
		while(v.back()!=nxt){
			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(nxt);
	}
	else	solve(nxt);
}
 
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{
			int n = idx;
			while(1){
				vst[n] = true;
				v.pb(n);
				while(!gp[n].empty() && chk[gp[n].back().second])	gp[n].pop_back();
				chk[gp[n].back().second] = true;
				if(vst[gp[n].back().first]){
					while(v.back()!=gp[n].back().first){
						vst[v.back()] = false;
						printf("%d ", v.back());
						v.pop_back();
					}
					vst[v.back()] = false;
					printf("%d\n", v.back()); v.pop_back();
					if(v.empty())	break;
					else n = gp[n].back().first;
				}else{
					n = gp[n].back().first;
				}
			}
		}
	}
	return 0;
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:41: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:43: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

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 14 ms 12032 KB Output is correct
3 Correct 14 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 14 ms 12136 KB Output is correct
6 Correct 17 ms 12160 KB Output is correct
7 Correct 18 ms 12544 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 51 ms 14432 KB Output is correct
10 Correct 16 ms 12160 KB Output is correct
11 Correct 14 ms 12208 KB Output is correct
12 Correct 59 ms 14888 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 12136 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 12 ms 12008 KB Output is correct
4 Correct 19 ms 12160 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 16 ms 12240 KB Output is correct
7 Correct 17 ms 12544 KB Output is correct
8 Correct 13 ms 12160 KB Output is correct
9 Correct 50 ms 14436 KB Output is correct
10 Correct 14 ms 12160 KB Output is correct
11 Correct 13 ms 12160 KB Output is correct
12 Correct 56 ms 14840 KB Output is correct
13 Correct 83 ms 16500 KB Output is correct
14 Correct 109 ms 15776 KB Output is correct
15 Correct 73 ms 15340 KB Output is correct
16 Correct 92 ms 16584 KB Output is correct
17 Correct 102 ms 15584 KB Output is correct
18 Correct 100 ms 15864 KB Output is correct

Subtask #3
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 13 ms 12160 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 16 ms 12160 KB Output is correct
7 Correct 24 ms 12544 KB Output is correct
8 Correct 12 ms 12160 KB Output is correct
9 Correct 70 ms 14432 KB Output is correct
10 Correct 14 ms 12212 KB Output is correct
11 Correct 16 ms 12160 KB Output is correct
12 Correct 63 ms 14840 KB Output is correct
13 Correct 88 ms 16500 KB Output is correct
14 Correct 105 ms 15824 KB Output is correct
15 Correct 74 ms 15340 KB Output is correct
16 Correct 90 ms 16480 KB Output is correct
17 Correct 94 ms 15608 KB Output is correct
18 Correct 92 ms 16008 KB Output is correct
19 Execution timed out 550 ms 34200 KB Time limit exceeded
20 Halted 0 ms 0 KB -