제출 #1158904

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158904		paulxaxa	어르신 집배원 (BOI14_postmen)	C++20	0 / 100	6 ms	12100 KiB

postmen

#include <bits/stdc++.h>

#define NMAX 500000
#define LOG 19

#define ll long long int
#define BASE 128
#define MOD 998244353


using namespace std;

ifstream fin("cod.in");
ofstream fout("cod.out");

int vis[NMAX+1];
vector<pair<int,int>> adj[NMAX+1];
bool used[NMAX+1];

vector<int> euler;
void dfs(int x,int t)
{
    for(auto [y,id] : adj[x])
    {
        if(!used[id])
        {
            used[id]=1;
            dfs(y,t);
        }
    }
    euler.push_back(x);
}

int last[NMAX+1];
int main()
{
    int n,m;
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin >> x >> y;
        adj[x].push_back({y,i});
        adj[y].push_back({x,i});
    }
    dfs(1,0);
    for(int i : euler)
    {
        cout << i << " ";
    }
    cout << '\n';
    vector<int> st;
    for(int i : euler)
    {
        if(last[i])
        {
            vector<int> v;
            v.push_back(i);
            while(st.back()!=i)
            {
                last[st.back()]--;
                v.push_back(st.back());
                st.pop_back();
            }
            v.push_back(i);
            st.pop_back();
            last[i]--;
            for(int j : v)
            {
                cout << j << " ";
            }
            cout << '\n';
        }
        st.push_back(i);
        last[i]++;
    }

}

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