oj.uz

Submission #896031

# Submission time Handle Problem Language Result Execution time Memory
896031 2023-12-31T13:17:37 Z shmax Senior Postmen (BOI14_postmen) C++14
55 / 100
 500 ms 108732 KB 
/*
 * powered by ANDRIY POPYK
 * in honor of MYSELF and SEGMENT DECOMPOSITION and N^(log(N)) and (Harry Potter and the Methods of Rationality) and Monkie D. Luffy
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

//#pragma GCC optimize("O3")
//#pragma GCC target("avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,sse4,popcnt")

using namespace std;
using namespace __gnu_pbds;
#define int long long
#define float long double
#define elif else if
#define endl "\n"
#define mod 1000000007
#define pi acos(-1)
#define eps 0.000000001
#define inf 1000'000'000'000'000'000LL
#define FIXED(a) cout << fixed << setprecision(a)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define time_init auto start = std::chrono::high_resolution_clock::now()
#define time_report                                       \
    auto end = std::chrono::high_resolution_clock::now(); \
    std::cout << std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count() << " ms" << endl
#define debug(x) \
    { cerr << #x << " = " << x << endl; }
#define len(x) (int) x.size()
#define sqr(x) ((x) * (x))
#define cube(x) ((x) * (x) * (x))
#define bit(x, i) (((x) >> (i)) & 1)
#define set_bit(x, i) ((x) | (1LL << (i)))
#define clear_bit(x, i) ((x) & (~(1LL << (i))))
#define toggle_bit(x, i) ((x) ^ (1LL << (i)))
#define low_bit(x) ((x) & (-(x)))
#define count_bit(x) __builtin_popcountll(x)
#define srt(x) sort(all(x))
#define rsrt(x) sort(rall(x))
#define mp make_pair
#define maxel(x) (*max_element(all(x)))
#define minel(x) (*min_element(all(x)))
#define maxelpos(x) (max_element(all(x)) - x.begin())
#define minelpos(x) (min_element(all(x)) - x.begin())
#define sum(x) (accumulate(all(x), 0LL))
#define product(x) (accumulate(all(x), 1LL, multiplies<int>()))
#define gcd __gcd
#define lcm(a, b) ((a) / gcd(a, b) * (b))
#define rev(x) (reverse(all(x)))
#define shift_left(x, k) (rotate(x.begin(), x.begin() + k, x.end()))
#define shift_right(x, k) (rotate(x.rbegin(), x.rbegin() + k, x.rend()))
#define is_sorted(x) (is_sorted_until(all(x)) == x.end())
#define is_even(x) (((x) &1) == 0)
#define is_odd(x) (((x) &1) == 1)
#define pow2(x) (1LL << (x))

struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T>
using matrix = vector<vector<T>>;
template<typename T>
using graph = vector<vector<T>>;
using hashmap = gp_hash_table<int, int, custom_hash>;

template<typename T>
vector<T> vect(int n, T val) {
    return vector<T>(n, val);
}

template<typename T>
vector<vector<T>> vect(int n, int m, T val) {
    return vector<vector<T>>(n, vector<T>(m, val));
}

template<typename T>
vector<vector<vector<T>>> vect(int n, int m, int k, T val) {
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, val)));
}

template<typename T>
vector<vector<vector<vector<T>>>> vect(int n, int m, int k, int l, T val) {
    return vector<vector<vector<vector<T>>>>(n, vector<vector<vector<T>>>(m, vector<vector<T>>(k, vector<T>(l, val))));
}

template<typename T>
matrix<T> new_matrix(int n, int m, T val) {
    return matrix<T>(n, vector<T>(m, val));
}

template<typename T>
graph<T> new_graph(int n) {
    return graph<T>(n);
}

template<class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}

template<class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;

template<typename T>
using vec = vector<T>;

using pII = pair<int, int>;
template<typename T>
using enumerated = pair<T, int>;
int n, m;
struct edge {
    int to;
    int id;
};
graph<edge> g;
vec<int> pointer;
vec<int> euler_tour;
vec<bool> used;
void dfs(int v) {
    while (pointer[v] < len(g[v])) {
        auto &e = g[v][pointer[v]];
        if (used[e.id]) {
            ++pointer[v];
            continue;
        }
        used[e.id] = true;
        dfs(e.to);
    }
    euler_tour.push_back(v);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> n >> m;
    g = new_graph<edge>(n);
    for (int i = 0; i < m; ++i) {
        int a, b;
        cin >> a >> b;
        --a;
        --b;
        g[a].push_back({b, i});
        g[b].push_back({a, i});
    }
    pointer = vec<int>(n);
    used = vec<bool>(m);
    dfs(0);
    vec<int> cur_part;
    multiset<int> cur_part_val;
    vec<vec<int>> ans;
    for (int i = 0; i < len(euler_tour); i++) {
        vec<int> path;
        while (cur_part_val.count(euler_tour[i])) {
            path.push_back(cur_part.back());
            cur_part_val.erase(cur_part_val.find(cur_part.back()));
            cur_part.pop_back();
        }
        if (!path.empty()) {
            ans.push_back(path);
        }
        cur_part_val.insert(euler_tour[i]);
        cur_part.push_back(euler_tour[i]);
    }
    for (auto &i: ans) {
        for (auto &j: i) {
            cout << j + 1 << " ";
        }
        cout << endl;
    }


}

Subtask #1
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 41 ms 12204 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 880 KB Output is correct
12 Correct 47 ms 12856 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 860 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 1 ms 856 KB Output is correct
9 Correct 41 ms 12248 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 46 ms 12900 KB Output is correct
13 Correct 78 ms 22468 KB Output is correct
14 Correct 70 ms 16212 KB Output is correct
15 Correct 48 ms 17200 KB Output is correct
16 Correct 77 ms 22160 KB Output is correct
17 Correct 51 ms 11208 KB Output is correct
18 Correct 57 ms 16324 KB Output is correct

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 1112 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 2 ms 860 KB Output is correct
7 Correct 7 ms 2396 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 44 ms 12356 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 2 ms 856 KB Output is correct
12 Correct 49 ms 12908 KB Output is correct
13 Correct 69 ms 22212 KB Output is correct
14 Correct 59 ms 16072 KB Output is correct
15 Correct 48 ms 17088 KB Output is correct
16 Correct 70 ms 22412 KB Output is correct
17 Correct 51 ms 11108 KB Output is correct
18 Correct 62 ms 16528 KB Output is correct
19 Execution timed out 518 ms 108732 KB Time limit exceeded
20 Halted 0 ms 0 KB -