oj.uz

Submission #964247

# Submission time Handle Problem Language Result Execution time Memory
964247 2024-04-16T13:29:39 Z GrindMachine Senior Postmen (BOI14_postmen) C++17
100 / 100
 331 ms 69032 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://github.com/dolphingarlic/CompetitiveProgramming/blob/master/Baltic/Baltic%2014-postmen.cpp
https://codeforces.com/blog/entry/49035 (algorithm to find euler circuit)

*/

const int MOD = 1e9 + 7;
const int N = 5e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pii> adj[N];
vector<int> ord;
vector<bool> vis(N);

void dfs1(int u){
    while(!adj[u].empty()){
        auto [v,id] = adj[u].back();
        adj[u].pop_back();
        if(vis[id]) conts;
        vis[id] = 1;
        dfs1(v);
    }
 
    ord.pb(u);
}
 
void solve(int test_case)
{
    int n,m; cin >> n >> m;
    rep1(i,m){
        int u,v; cin >> u >> v;
        adj[u].pb({v,i}), adj[v].pb({u,i});
    }
 
    dfs1(1);
    ord.pop_back();

    vector<vector<int>> ans;
    vector<int> curr;
    vector<bool> there(n+5);

    trav(u,ord){
        if(!there[u]){
            curr.pb(u);
            there[u] = 1;
            conts;
        }

        vector<int> cyc;
        cyc.pb(u);

        while(curr.back() != u){
            cyc.pb(curr.back());
            there[curr.back()] = 0;
            curr.pop_back();
        }

        reverse(all(cyc));
        ans.pb(cyc);
    }

    ans.pb(curr);

    trav(cyc,ans){
        trav(u,cyc){
            cout << u << " ";
        }

        cout << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12212 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 4 ms 12564 KB Output is correct
5 Correct 8 ms 12120 KB Output is correct
6 Correct 4 ms 12636 KB Output is correct
7 Correct 7 ms 13400 KB Output is correct
8 Correct 3 ms 12380 KB Output is correct
9 Correct 29 ms 20052 KB Output is correct
10 Correct 4 ms 12380 KB Output is correct
11 Correct 4 ms 12376 KB Output is correct
12 Correct 32 ms 20340 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 3 ms 12124 KB Output is correct
3 Correct 4 ms 12124 KB Output is correct
4 Correct 4 ms 12380 KB Output is correct
5 Correct 3 ms 12124 KB Output is correct
6 Correct 4 ms 12636 KB Output is correct
7 Correct 7 ms 13404 KB Output is correct
8 Correct 4 ms 12376 KB Output is correct
9 Correct 29 ms 20068 KB Output is correct
10 Correct 4 ms 12380 KB Output is correct
11 Correct 5 ms 12380 KB Output is correct
12 Correct 32 ms 20536 KB Output is correct
13 Correct 46 ms 21944 KB Output is correct
14 Correct 46 ms 19688 KB Output is correct
15 Correct 43 ms 22332 KB Output is correct
16 Correct 44 ms 21972 KB Output is correct
17 Correct 42 ms 18176 KB Output is correct
18 Correct 40 ms 21092 KB Output is correct

Subtask #3
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 3 ms 12376 KB Output is correct
3 Correct 3 ms 12124 KB Output is correct
4 Correct 4 ms 12380 KB Output is correct
5 Correct 3 ms 12120 KB Output is correct
6 Correct 4 ms 12636 KB Output is correct
7 Correct 7 ms 13404 KB Output is correct
8 Correct 4 ms 12380 KB Output is correct
9 Correct 30 ms 20088 KB Output is correct
10 Correct 4 ms 12316 KB Output is correct
11 Correct 4 ms 12380 KB Output is correct
12 Correct 35 ms 20428 KB Output is correct
13 Correct 46 ms 21832 KB Output is correct
14 Correct 46 ms 19880 KB Output is correct
15 Correct 46 ms 22472 KB Output is correct
16 Correct 42 ms 21836 KB Output is correct
17 Correct 42 ms 18332 KB Output is correct
18 Correct 40 ms 21052 KB Output is correct
19 Correct 321 ms 60656 KB Output is correct
20 Correct 286 ms 50884 KB Output is correct
21 Correct 279 ms 69032 KB Output is correct
22 Correct 311 ms 67312 KB Output is correct
23 Correct 146 ms 53948 KB Output is correct
24 Correct 331 ms 48960 KB Output is correct
25 Correct 328 ms 63776 KB Output is correct