oj.uz

Submission #44716

# Submission time Handle Problem Language Result Execution time Memory
44716 2018-04-05T12:24:24 Z Pajaraja Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 94836 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);
	while(!st.empty())
	{
		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");
		}
		vi[x]=true;
		sk.push(x);
	}
}

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 23808 KB Output is correct
2 Correct 18 ms 23936 KB Output is correct
3 Correct 19 ms 23808 KB Output is correct
4 Correct 25 ms 24192 KB Output is correct
5 Correct 23 ms 23912 KB Output is correct
6 Correct 24 ms 24448 KB Output is correct
7 Correct 37 ms 25976 KB Output is correct
8 Correct 22 ms 24064 KB Output is correct
9 Correct 221 ms 38260 KB Output is correct
10 Correct 20 ms 24192 KB Output is correct
11 Correct 19 ms 24064 KB Output is correct
12 Correct 201 ms 38368 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 17 ms 23808 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 20 ms 24192 KB Output is correct
5 Correct 18 ms 24064 KB Output is correct
6 Correct 22 ms 24448 KB Output is correct
7 Correct 31 ms 25984 KB Output is correct
8 Correct 26 ms 24064 KB Output is correct
9 Correct 202 ms 38264 KB Output is correct
10 Correct 21 ms 24204 KB Output is correct
11 Correct 23 ms 24192 KB Output is correct
12 Correct 210 ms 38392 KB Output is correct
13 Correct 126 ms 38008 KB Output is correct
14 Correct 136 ms 38628 KB Output is correct
15 Correct 149 ms 38520 KB Output is correct
16 Correct 122 ms 38140 KB Output is correct
17 Correct 159 ms 38624 KB Output is correct
18 Correct 148 ms 35140 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23808 KB Output is correct
2 Correct 23 ms 23808 KB Output is correct
3 Correct 18 ms 23808 KB Output is correct
4 Correct 31 ms 24192 KB Output is correct
5 Correct 21 ms 23936 KB Output is correct
6 Correct 23 ms 24448 KB Output is correct
7 Correct 38 ms 25984 KB Output is correct
8 Correct 21 ms 24192 KB Output is correct
9 Correct 205 ms 38368 KB Output is correct
10 Correct 20 ms 24192 KB Output is correct
11 Correct 20 ms 24064 KB Output is correct
12 Correct 176 ms 38364 KB Output is correct
13 Correct 141 ms 38112 KB Output is correct
14 Correct 141 ms 38624 KB Output is correct
15 Correct 169 ms 38428 KB Output is correct
16 Correct 124 ms 38008 KB Output is correct
17 Correct 175 ms 38624 KB Output is correct
18 Correct 159 ms 35140 KB Output is correct
19 Execution timed out 681 ms 94836 KB Time limit exceeded
20 Halted 0 ms 0 KB -