oj.uz

답안 #896168

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896168 2023-12-31T23:41:40 Z I_am_Polish_Girl 어르신 집배원 (BOI14_postmen) C++14
100 / 100
 384 ms 84920 KB 
/*
* powered by ANDRIY POPYK
* in honor of  SEGMENT DECOMPOSITION and N ^ (log(N)) and hate_club_Dasha_Lobas
* I hate GeZhiyuan
* fuck you
*/

/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,popcnt")
*/


#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <set>
#include <bitset>
#include <queue>
#include <string>
#include <vector>
#include <stack>
#include <random>
#include <ctime>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>

using namespace std;
typedef long long ll;
int mod = 998244353;
int inf = 2000000000;

vector <vector <int>> g;

vector <pair <int, int>> edges;
vector <int> ind_ed;
vector <bool> t;
vector <int> el;


void dfs(int ind)
{
	while (ind_ed[ind] < g[ind].size())
	{
		int i = g[ind][ind_ed[ind]];
		ind_ed[ind]++;
		if (t[i] == true)
			continue;

		t[i] = true;
		t[i ^ 1] = true;
		dfs(edges[i].second);
	}


	el.push_back(ind);
}
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	int times_ = 1;

	//cin >> times_;

	while (times_--)
	{
		int n, m;
		cin >> n >> m;
		g.resize(n);
		ind_ed.resize(n, 0);

		for (int i = 0; i < m; i++)
		{
			int u, v;
			cin >> u >> v;
			u--;
			v--;
			g[u].push_back(2 * i);
			g[v].push_back(2 * i + 1);

			edges.push_back({ u , v });
			edges.push_back({ v , u });

		}

		t.resize(edges.size(), false);

		dfs(0);

		vector <int> s(n+10);

		vector <int> go_to(el.size(), inf);
		for (int i = 0; i < el.size(); i++)
		{
			if (s[el[i]] == 0)
			{
				s[el[i]]++;
			}
			else
			{
				int ind = i - 1;
				while (s[el[i]] > 0)
				{
					if (s[el[ind]] > 0)
						cout << el[ind] + 1 << " ";

					s[el[ind]]--;

					ind--;

					if (ind < 0)
						break;
					ind = min(ind, go_to[ind]);

					if (ind < 0)
						break;
				}

				go_to[i - 1] = ind;

				cout << "\n";

				s[el[i]]++;
			}
		}


	}
}
/*
axbbbbbbzbxbbabaxbbabababababababaababababababababaabababababababxbxbb
5
ababb
bbb
tr
are
aaa
*/
/*

4
12
1 1 1 2 2 3 4 4 7 7 6
11 2 1 11 12 8 5 8 8 5 11 7
13
1 1 1 2 2 2 3 3 4 5 6 6
2 2 2 1 4 9 7 2 5 2 1 11 2
7
1 1 2 2 3 3
6 5 2 3 6 5 6
*/

Compilation message

postmen.cpp: In function 'void dfs(int)':
postmen.cpp:48:21: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |  while (ind_ed[ind] < g[ind].size())
postmen.cpp: In function 'int main()':
postmen.cpp:100:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |   for (int i = 0; i < el.size(); i++)
      |                   ~~^~~~~~~~~~~

Subtask #1
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 4 ms 1936 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 25 ms 10444 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 28 ms 10688 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 5 ms 1872 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 29 ms 10608 KB Output is correct
10 Correct 1 ms 856 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 28 ms 10700 KB Output is correct
13 Correct 40 ms 15844 KB Output is correct
14 Correct 39 ms 11456 KB Output is correct
15 Correct 38 ms 14340 KB Output is correct
16 Correct 39 ms 16068 KB Output is correct
17 Correct 41 ms 9156 KB Output is correct
18 Correct 38 ms 12996 KB Output is correct

Subtask #3
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 856 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 4 ms 1872 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 25 ms 10444 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 30 ms 10688 KB Output is correct
13 Correct 42 ms 15812 KB Output is correct
14 Correct 37 ms 11460 KB Output is correct
15 Correct 35 ms 14184 KB Output is correct
16 Correct 45 ms 16004 KB Output is correct
17 Correct 36 ms 8640 KB Output is correct
18 Correct 48 ms 12964 KB Output is correct
19 Correct 358 ms 78260 KB Output is correct
20 Correct 327 ms 62076 KB Output is correct
21 Correct 306 ms 74748 KB Output is correct
22 Correct 384 ms 84920 KB Output is correct
23 Correct 145 ms 53692 KB Output is correct
24 Correct 370 ms 47428 KB Output is correct
25 Correct 343 ms 69496 KB Output is correct