oj.uz

Submission #896090

# Submission time Handle Problem Language Result Execution time Memory
896090 2023-12-31T18:01:48 Z I_am_Polish_Girl Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 16340 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 = 2000000000000000000;

	vector <vector <int>> g;

	int edges[1000000];
	int ind_ed[1000000];
	bool t[1000000];
	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]);
		}
		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);

			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[2 * i]= v;

				edges[2 * i+1] = u;

			}
		
			dfs(0);
		
			vector <int> s(n+1);
			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]] = 0;

						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:10: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   10 |  #pragma GCC optimization("unroll-loops")
      | 
postmen.cpp:34:12: warning: overflow in conversion from 'long int' to 'int' changes value from '2000000000000000000' to '1321730048' [-Woverflow]
   34 |  int inf = 2000000000000000000;
      |            ^~~~~~~~~~~~~~~~~~~
postmen.cpp: In function 'void dfs(int)':
postmen.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |   while (ind_ed[ind] < g[ind].size())
      |          ~~~~~~~~~~~~^~~~~~~~~~~~~~~
postmen.cpp: In function 'int main()':
postmen.cpp:94:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |    for (int i = 0; i < el.size(); i++)
      |                    ~~^~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 4 ms 3676 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 27 ms 10716 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 29 ms 10904 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2648 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 2 ms 2908 KB Output is correct
7 Correct 4 ms 3676 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 26 ms 10824 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 30 ms 10960 KB Output is correct
13 Correct 37 ms 16340 KB Output is correct
14 Execution timed out 1081 ms 11720 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2908 KB Output is correct
7 Correct 5 ms 3676 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 25 ms 10712 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct
11 Correct 1 ms 2648 KB Output is correct
12 Correct 31 ms 10964 KB Output is correct
13 Correct 41 ms 16340 KB Output is correct
14 Execution timed out 1016 ms 11464 KB Time limit exceeded
15 Halted 0 ms 0 KB -