oj.uz

Submission #964244

# Submission time Handle Problem Language Result Execution time Memory
964244 2024-04-16T13:25:06 Z GrindMachine Senior Postmen (BOI14_postmen) C++17
55 / 100
 500 ms 162316 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;

struct chash{
    ll operator()(const pii &p) const {
        return (ll)p.ff*N+p.ss;
    };
};

unordered_set<pii,chash> adj[N];
vector<int> ord;
 
void dfs1(int u){
    while(!adj[u].empty()){
        auto [v,id] = *adj[u].begin();
        adj[u].erase(adj[u].begin());
        adj[v].erase({u,id});
        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].insert({v,i}), adj[v].insert({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 9 ms 27896 KB Output is correct
2 Correct 7 ms 27740 KB Output is correct
3 Correct 7 ms 27740 KB Output is correct
4 Correct 9 ms 28508 KB Output is correct
5 Correct 8 ms 27996 KB Output is correct
6 Correct 10 ms 28600 KB Output is correct
7 Correct 15 ms 30300 KB Output is correct
8 Correct 8 ms 28248 KB Output is correct
9 Correct 85 ms 43992 KB Output is correct
10 Correct 9 ms 28252 KB Output is correct
11 Correct 9 ms 28464 KB Output is correct
12 Correct 73 ms 44368 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27740 KB Output is correct
2 Correct 7 ms 27740 KB Output is correct
3 Correct 7 ms 27788 KB Output is correct
4 Correct 10 ms 28504 KB Output is correct
5 Correct 9 ms 28004 KB Output is correct
6 Correct 12 ms 28468 KB Output is correct
7 Correct 15 ms 30300 KB Output is correct
8 Correct 11 ms 28252 KB Output is correct
9 Correct 68 ms 44116 KB Output is correct
10 Correct 9 ms 28248 KB Output is correct
11 Correct 9 ms 28248 KB Output is correct
12 Correct 87 ms 44216 KB Output is correct
13 Correct 143 ms 54632 KB Output is correct
14 Correct 114 ms 48388 KB Output is correct
15 Correct 132 ms 52184 KB Output is correct
16 Correct 110 ms 54712 KB Output is correct
17 Correct 140 ms 44636 KB Output is correct
18 Correct 128 ms 50204 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27740 KB Output is correct
2 Correct 7 ms 27740 KB Output is correct
3 Correct 7 ms 27756 KB Output is correct
4 Correct 9 ms 28504 KB Output is correct
5 Correct 10 ms 27996 KB Output is correct
6 Correct 11 ms 28504 KB Output is correct
7 Correct 16 ms 30296 KB Output is correct
8 Correct 8 ms 28252 KB Output is correct
9 Correct 81 ms 44128 KB Output is correct
10 Correct 9 ms 28252 KB Output is correct
11 Correct 9 ms 28248 KB Output is correct
12 Correct 79 ms 44172 KB Output is correct
13 Correct 119 ms 54640 KB Output is correct
14 Correct 99 ms 48444 KB Output is correct
15 Correct 135 ms 52332 KB Output is correct
16 Correct 117 ms 54620 KB Output is correct
17 Correct 138 ms 44384 KB Output is correct
18 Correct 99 ms 50244 KB Output is correct
19 Execution timed out 677 ms 162316 KB Time limit exceeded
20 Halted 0 ms 0 KB -