oj.uz

Submission #44946

# Submission time Handle Problem Language Result Execution time Memory
44946 2018-04-09T19:31:16 Z Pajaraja Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 94840 KB 
#include <bits/stdc++.h>
using namespace std;
set<int> g[500007];
stack<int> st,sk;
bool vi[500007];
void euler(int s)
{
	while(!g[s].empty())
	{
		int t=*g[s].begin();
		g[s].erase(t);
		g[t].erase(s);
		euler(t);
	}
	st.push(s);
}
int main()
{
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i<m;i++)
	{
		int t1,t2;
		scanf("%d%d",&t1,&t2);
		g[t1].insert(t2);
		g[t2].insert(t1);
	}
	euler(1);
	for(int i=0;i<m+1;i++)
	{
		int x=st.top();
		st.pop();
		if(vi[x])
		{
			while(true)
			{
				int y=sk.top();
				printf("%d ",y);
				sk.pop();
				vi[y]=false;
				if(y==x) break;
			}
			printf("\n");
		}
		sk.push(x);
		vi[x]=true;
	}
}

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:20: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:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&t1,&t2);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23856 KB Output is correct
2 Correct 20 ms 23848 KB Output is correct
3 Correct 25 ms 23784 KB Output is correct
4 Correct 26 ms 24320 KB Output is correct
5 Correct 18 ms 23936 KB Output is correct
6 Correct 27 ms 24424 KB Output is correct
7 Correct 35 ms 25984 KB Output is correct
8 Correct 19 ms 24112 KB Output is correct
9 Correct 192 ms 38264 KB Output is correct
10 Correct 21 ms 24320 KB Output is correct
11 Correct 20 ms 24064 KB Output is correct
12 Correct 188 ms 38436 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23808 KB Output is correct
2 Correct 24 ms 23808 KB Output is correct
3 Correct 17 ms 23784 KB Output is correct
4 Correct 23 ms 24192 KB Output is correct
5 Correct 24 ms 23936 KB Output is correct
6 Correct 27 ms 24448 KB Output is correct
7 Correct 34 ms 25984 KB Output is correct
8 Correct 20 ms 24192 KB Output is correct
9 Correct 210 ms 38240 KB Output is correct
10 Correct 20 ms 24192 KB Output is correct
11 Correct 24 ms 24064 KB Output is correct
12 Correct 223 ms 38364 KB Output is correct
13 Correct 151 ms 38112 KB Output is correct
14 Correct 144 ms 38648 KB Output is correct
15 Correct 158 ms 38612 KB Output is correct
16 Correct 134 ms 38008 KB Output is correct
17 Correct 164 ms 38604 KB Output is correct
18 Correct 158 ms 35124 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23856 KB Output is correct
2 Correct 21 ms 23808 KB Output is correct
3 Correct 26 ms 23808 KB Output is correct
4 Correct 21 ms 24192 KB Output is correct
5 Correct 22 ms 23912 KB Output is correct
6 Correct 27 ms 24512 KB Output is correct
7 Correct 34 ms 25984 KB Output is correct
8 Correct 21 ms 24064 KB Output is correct
9 Correct 187 ms 38264 KB Output is correct
10 Correct 22 ms 24320 KB Output is correct
11 Correct 20 ms 24064 KB Output is correct
12 Correct 187 ms 38384 KB Output is correct
13 Correct 125 ms 38028 KB Output is correct
14 Correct 132 ms 38648 KB Output is correct
15 Correct 152 ms 38496 KB Output is correct
16 Correct 130 ms 38032 KB Output is correct
17 Correct 157 ms 38520 KB Output is correct
18 Correct 132 ms 35168 KB Output is correct
19 Execution timed out 619 ms 94840 KB Time limit exceeded
20 Halted 0 ms 0 KB -