oj.uz

Submission #896081

# Submission time Handle Problem Language Result Execution time Memory
896081 2023-12-31T17:38:16 Z I_am_Polish_Girl Senior Postmen (BOI14_postmen) C++14
38 / 100
 500 ms 19736 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;

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);
		
		set <int> s;
		for (int i = 0; i < el.size(); i++) 
		{
			if (s.count(el[i]) == 0)
			{
				s.insert(el[i]);
			}
			else
			{
				int ind = i - 1;
				while (s.count(el[i]) > 0)
				{
					if (s.count(el[ind]) > 0)
						cout << el[ind] + 1 << " ";

					s.erase(el[ind]);

					ind--;
				}

				cout << "\n";
			
				s.insert(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:36:11: warning: overflow in conversion from 'long int' to 'int' changes value from '2000000000000000000' to '1321730048' [-Woverflow]
   36 | int inf = 2000000000000000000;
      |           ^~~~~~~~~~~~~~~~~~~
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:98:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |   for (int i = 0; i < el.size(); i++)
      |                   ~~^~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 2 ms 860 KB Output is correct
7 Correct 8 ms 1872 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 55 ms 10596 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 62 ms 10716 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory 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 2 ms 860 KB Output is correct
7 Correct 8 ms 1872 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 51 ms 10556 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 62 ms 10716 KB Output is correct
13 Correct 71 ms 19652 KB Output is correct
14 Execution timed out 1018 ms 12224 KB Time limit exceeded
15 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 2 ms 860 KB Output is correct
7 Correct 8 ms 2044 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 53 ms 10416 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 62 ms 10804 KB Output is correct
13 Correct 74 ms 19736 KB Output is correct
14 Execution timed out 1071 ms 12148 KB Time limit exceeded
15 Halted 0 ms 0 KB -