oj.uz

Submission #154981

# Submission time Handle Problem Language Result Execution time Memory
154981 2019-09-25T19:21:14 Z davitmarg Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 52728 KB 
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <stack>
#include <cassert>
#include <iterator>
#include <bitset>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;;
int n,m;
int used[500005],edge[500005];
vector<pair<int,int>> g[500005];
vector<int> path;
 
void euler(int v)
{
    while(!g[v].empty())
	{
		int to=g[v].back().first;
		int id=g[v].back().second;
        g[v].pop_back();
        if(used[id])
			continue;
        used[id]=1;
        euler(to);
	}
	path.PB(v);
}
 
void add(int a,int b,int id)
{
	g[a].PB(MP(b,id));
	g[b].PB(MP(a,id));
}
 
void print(vector<int> &s)
{
    while(!s.empty())
	{
        printf("%d ",s.back());
        s.pop_back();
	}
    printf("\n");
}
 
int main()
{
    cin >> n >> m;
	while(m--)
	{
        int a,b;
        scanf("%d%d",&a,&b);
		add(a,b,m);
	}
    euler(1);
 
    vector<int> s;
    for(int i=0;i<=n;i++)
        used[i]=0;
    for(int i=0;i<path.size();i++)
	{
        if(!used[path[i]])
        {
            s.PB(path[i]);
            used[path[i]]=1;
        }
        else
		{
			printf("%d ",path[i]);
            while(s.back()!=path[i])
			{
				printf("%d ",s.back());
                used[s.back()]=0;
                s.pop_back();
			}
            printf("\n");
		}
	}
 
    return 0;
}
 
 
/*
 
6 6
1 2
1 3
1 4
1 5
3 2
4 5
 
 
 
*/

Compilation message

postmen.cpp: In function 'int main()':
postmen.cpp:74:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<path.size();i++)
                 ~^~~~~~~~~~~~
postmen.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&a,&b);
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 12032 KB Output is correct
2 Correct 12 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 14 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 18 ms 13184 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 62 ms 18504 KB Output is correct
10 Correct 15 ms 12288 KB Output is correct
11 Correct 17 ms 12288 KB Output is correct
12 Correct 59 ms 18780 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12032 KB Output is correct
2 Correct 20 ms 12032 KB Output is correct
3 Correct 11 ms 12032 KB Output is correct
4 Correct 15 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 13 ms 12416 KB Output is correct
7 Correct 22 ms 13160 KB Output is correct
8 Correct 12 ms 12288 KB Output is correct
9 Correct 62 ms 18428 KB Output is correct
10 Correct 17 ms 12288 KB Output is correct
11 Correct 15 ms 12288 KB Output is correct
12 Correct 60 ms 18788 KB Output is correct
13 Correct 89 ms 20212 KB Output is correct
14 Correct 103 ms 18412 KB Output is correct
15 Correct 79 ms 19668 KB Output is correct
16 Correct 103 ms 20188 KB Output is correct
17 Correct 89 ms 16620 KB Output is correct
18 Correct 86 ms 18932 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12032 KB Output is correct
2 Correct 16 ms 12032 KB Output is correct
3 Correct 13 ms 12032 KB Output is correct
4 Correct 13 ms 12288 KB Output is correct
5 Correct 12 ms 12160 KB Output is correct
6 Correct 14 ms 12416 KB Output is correct
7 Correct 20 ms 13220 KB Output is correct
8 Correct 13 ms 12288 KB Output is correct
9 Correct 53 ms 18480 KB Output is correct
10 Correct 16 ms 12288 KB Output is correct
11 Correct 14 ms 12288 KB Output is correct
12 Correct 76 ms 18804 KB Output is correct
13 Correct 96 ms 20212 KB Output is correct
14 Correct 110 ms 18388 KB Output is correct
15 Correct 83 ms 19560 KB Output is correct
16 Correct 92 ms 20212 KB Output is correct
17 Correct 93 ms 16680 KB Output is correct
18 Correct 90 ms 18932 KB Output is correct
19 Execution timed out 561 ms 52728 KB Time limit exceeded
20 Halted 0 ms 0 KB -