oj.uz

답안 #777630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
777630 2023-07-09T11:38:16 Z MasterTaster 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 465 ms 44812 KB 
#include <bits/stdc++.h>

#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define pb push_back
#define MAXN 500010

using namespace std;

int n, m; //deg[MAXN]
vector<int> put, tren;
vector<pii> g[MAXN];
bool bio[MAXN], bila[MAXN];

int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin>>n>>m;

	for (int i=0; i<m; i++)
	{
		int u, v; cin>>u>>v;
		g[u].pb({v, i});
		g[v].pb({u, i});
		//deg[u]++;
		//deg[v]++;  
	}
	//cout<<"ee"<<endl;

	stack<int> st;
	st.push(1);
	while (!st.empty())
	{
		int u=st.top();

		pii nesto=g[u].back();
		while (g[u].size() && bila[nesto.yy])
		{
			g[u].pop_back();
			nesto=g[u].back();
		}

		if (!g[u].size())
		{
			put.pb(u);
			st.pop();
			continue;
		}

		nesto=g[u].back();
		bila[nesto.yy]=true;
		g[u].pop_back();
		//deg[u]--;
		//deg[v]--;
		int v=nesto.xx;
		st.push(v);
	}

	//for (auto x:put) cout<<x<<" ";
	//cout<<endl;

	for (int i=0; i<put.size(); i++)
	{
		int u=put[i];
		st.push(u);
		if (bio[u])
		{
			tren.clear();
			int nes=0;
			while (!nes || st.top()!=u)
			{
				nes++;
				bio[st.top()]=false;
				tren.pb(st.top());
				st.pop();
			}
			for (auto x:tren) cout<<x<<" ";
			cout<<endl;
		}
		bio[u]=true;
	}
	
	cout<<endl;

}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:63:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for (int i=0; i<put.size(); i++)
      |                ~^~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12068 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12068 KB Output is correct
4 Correct 8 ms 12116 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 7 ms 12244 KB Output is correct
7 Correct 10 ms 12852 KB Output is correct
8 Correct 6 ms 12116 KB Output is correct
9 Correct 36 ms 15976 KB Output is correct
10 Correct 8 ms 12144 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 34 ms 16536 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12072 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 6 ms 12076 KB Output is correct
4 Correct 8 ms 12152 KB Output is correct
5 Correct 6 ms 12116 KB Output is correct
6 Correct 7 ms 12188 KB Output is correct
7 Correct 10 ms 12852 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 30 ms 16000 KB Output is correct
10 Correct 8 ms 12176 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 34 ms 16456 KB Output is correct
13 Correct 39 ms 18388 KB Output is correct
14 Correct 62 ms 17372 KB Output is correct
15 Correct 70 ms 17476 KB Output is correct
16 Correct 38 ms 18348 KB Output is correct
17 Correct 86 ms 17228 KB Output is correct
18 Correct 64 ms 17608 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 5 ms 11988 KB Output is correct
3 Correct 6 ms 12064 KB Output is correct
4 Correct 7 ms 12212 KB Output is correct
5 Correct 6 ms 12076 KB Output is correct
6 Correct 7 ms 12244 KB Output is correct
7 Correct 11 ms 12872 KB Output is correct
8 Correct 7 ms 12116 KB Output is correct
9 Correct 31 ms 16032 KB Output is correct
10 Correct 8 ms 12212 KB Output is correct
11 Correct 7 ms 12116 KB Output is correct
12 Correct 34 ms 16464 KB Output is correct
13 Correct 38 ms 18344 KB Output is correct
14 Correct 70 ms 17464 KB Output is correct
15 Correct 73 ms 17524 KB Output is correct
16 Correct 39 ms 18384 KB Output is correct
17 Correct 71 ms 17236 KB Output is correct
18 Correct 64 ms 17608 KB Output is correct
19 Correct 294 ms 40260 KB Output is correct
20 Correct 371 ms 35868 KB Output is correct
21 Correct 399 ms 39724 KB Output is correct
22 Correct 334 ms 44812 KB Output is correct
23 Correct 132 ms 30520 KB Output is correct
24 Correct 465 ms 38544 KB Output is correct
25 Correct 421 ms 41164 KB Output is correct