Submission #292205

#	Time	Username	Problem	Language	Result	Execution time	Memory
292205		davooddkareshki	Senior Postmen (BOI14_postmen)	C++17	55 / 100	539 ms	67168 KiB

postmen

#include<bits/stdc++.h>
using namespace std;

//#define int long long
#define F first
#define S second
#define pii pair<int,int>
#define mpr make_pair

typedef long long ll;
//typedef long double ld;

const int maxn = 5e5+10;
const int mod = 1e9+7;
const int inf = (1ll<<40)-1;

int n, m, k;
bool mark_E[maxn];
vector<pii> g[maxn];
int ptr[maxn];

int mark[maxn];
vector<int> stk;
vector<int> ans[maxn]; int num = 0;

void DO(int v)
{
    if(mark[v])
    {
        num++;
        while(stk.back() != v)
        {
            int u = stk.back();
            mark[u] = 0;
            ans[num].push_back(u);
            stk.pop_back();
        }
        mark[v] = 0;
        ans[num].push_back(v);
        stk.pop_back();
    }
    mark[v] = 1;
    stk.push_back(v);
}

void dfs(int v)
{
    for(; ptr[v] < g[v].size(); ptr[v]++)
    {
        pii e = g[v][ptr[v]];
        int u = e.F, id = e.S;
        if(!mark_E[id])
        {
            mark_E[id] = 1;
            dfs(u);
            DO(u);
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    cin>> n >> m;
    for(int i = 1, u, v; i <= m; i++)
    {
        cin>> u >> v;
        g[u].push_back({v,i});
        g[v].push_back({u,i});
    }

    dfs(1);
    DO(1);

    for(int i = 1; i <= num; i++)
    {
        for(auto v : ans[i]) cout<< v <<" ";
        cout<<"\n";
    }
}
/*
10 15
1 3
5 1
2 3
9 2
3 4
6 3
4 5
7 4
4 8
5 7
8 5
6 7
7 8
8 10
10 9
*/

Compilation message (stderr)

postmen.cpp:15:26: warning: overflow in conversion from 'long long int' to 'int' changes value from '1099511627775' to '-1' [-Woverflow]
   15 | const int inf = (1ll<<40)-1;
      |                 ~~~~~~~~~^~
postmen.cpp: In function 'void dfs(int)':
postmen.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(; ptr[v] < g[v].size(); ptr[v]++)
      |           ~~~~~~~^~~~~~~~~~~~~

• Subtask 1: 38 / 38
• Subtask 2: 17 / 17
• Subtask 3: 0 / 45