oj.uz

Submission #687460

# Submission time Handle Problem Language Result Execution time Memory
687460 2023-01-26T12:19:34 Z tamthegod Senior Postmen (BOI14_postmen) C++17
0 / 100
 29 ms 47268 KB 
// Make the best become better
// No room for laziness
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, m;
int id = 0;
vector<int> path[maxN];
vector<int> adj[maxN];
void ReadInput()
{
    cin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
}
void dfs(int u)
{
    while(!adj[u].empty())
    {
        int v = adj[u].back();
        adj[u].pop_back();
        dfs(v);
    }
    path[id].pb(u);
}
void Solve()
{
    for(int i=1; i<=n; i++)
    {
        if(adj[i].empty()) continue;
        id++;
        dfs(i);
    }
    //cout << id;return;
    for(int i=1; i<=id; i++, cout << '\n')
    {
        reverse(path[i].begin(), path[i].end());
        for(int v : path[i])
            cout << v << " ";
    }
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Subtask #1
0 / 38.0

# Verdict Execution time Memory Grader output
1 Incorrect 24 ms 47256 KB Same junction appears twice in a route
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 47268 KB Same junction appears twice in a route
2 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 47172 KB Same junction appears twice in a route
2 Halted 0 ms 0 KB -