oj.uz

Submission #681847

# Submission time Handle Problem Language Result Execution time Memory
681847 2023-01-14T16:51:09 Z elkernos Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 498 ms 63044 KB 
// while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC target ("avx2")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                    \
    sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(c i) \
    {
sim > struct rge {
    c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef XOX
    ~debug()
    {
        cerr << endl;
    }
    eni(!=) cerr << boolalpha << i;
    ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d)
{
    ris << "" << d.first << " --> " << d.second << "";
}
sim dor(rge<c> d)
{
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
        *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
}
#else
    sim dor(const c &)
    {
        ris;
    }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#ifdef XOX
#warning Times may differ!!!
#endif

#define endl '\n'
#define pb emplace_back
#define vt vector
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

const int nax = 1000 * 1007, mod = 1e9 + 7;

struct Node {
    int lo, hi;
    Node(int x, int y) : lo(x), hi(y) {}
    Node operator|(const Node &he) { return Node(min(lo, he.lo), max(hi, he.hi)); }
    void operator|=(const Node &he) { *this = *this | he; }
};

struct Tree {
    vt<Node> wek;
    int base = 1;
    Tree() {}
    Tree(int n)
    {
        while (base < n)
            base *= 2;
        wek.resize(2 * base, Node(mod, -mod));
    }
    void pisz(int x, Node y)
    {
        for (x += base; x; x /= 2)
            wek[x] |= y;
    }
    Node czyt(int a, int b)
    {
        Node ret(mod, -mod);
        for (a += base, b += base; a <= b; a /= 2, b /= 2) {
            ret |= wek[a] | wek[b];
            a++, b--;
        }
        return ret;
    }
};

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int n, k, m;
    cin >> n >> k >> m;
    vt<vt<int>> add_right(n + 1), sub_right(n + 1), add_left(n + 1), sub_left(n + 1);
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        if (a < b) add_right[a].pb(b), sub_right[min(a + k, b)].pb(b);
        else add_left[a].pb(b), sub_left[max(a - k, b)].pb(b);
    }
    multiset<int> secik;
    vt<int> to_left(n + 1), to_right(n + 1);
    for (int i = 1; i <= n; i++) {
        for (int x : add_right[i])
            secik.insert(x);
        for (int x : sub_right[i])
            secik.erase(secik.find(x));
        if (!sz(secik)) to_right[i] = i;
        else to_right[i] = *secik.rbegin();
    }
    for (int i = n; i >= 1; i--) {
        for (int x : add_left[i])
            secik.insert(x);
        for (int x : sub_left[i])
            secik.erase(secik.find(x));
        if (!sz(secik)) to_left[i] = i;
        else to_left[i] = *secik.begin();
    }
    debug() << imie(to_left);
    debug() << imie(to_right);
    vt<Tree> seg(18);
    for (int i = 0; i <= 17; i++) {
        seg[i] = Tree(n + 1);
        if (i == 0) {
            for (int j = 1; j <= n; j++) {
                seg[i].pisz(j, Node(to_left[j], to_right[j]));
                debug() << imie(j) << "po " << (1 << i) << " krokach to " << seg[i].czyt(j, j).lo << " " << seg[i].czyt(j, j).hi;
            }
            continue;
        }
        for (int j = 1; j <= n; j++) {
            auto jego = seg[i - 1].czyt(j, j);
            auto rozszerz = seg[i - 1].czyt(jego.lo, jego.hi);
            seg[i].pisz(j, rozszerz);
            debug() << imie(j) << "po " << (1 << i) << " krokach to " << rozszerz.lo << " " << rozszerz.hi;
        }
    }
    int q;
    cin >> q;
    for (int qq = 0; qq < q; qq++) {
        int s, t;
        cin >> s >> t;
        int c = 0;
        Node ret(s, s);
        for (int i = 17; i >= 0; i--) {
            Node maybe = seg[i].czyt(ret.lo, ret.hi);
            if (!(maybe.lo <= t && t <= maybe.hi)) {
                c += (1 << i);
                ret = maybe;
            }
        }
        if (c + 1 == (1 << 18)) cout << -1 << endl;
        else cout << c + 1 << endl;
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 6 ms 1108 KB Output is correct
15 Correct 4 ms 1100 KB Output is correct
16 Correct 8 ms 1228 KB Output is correct
17 Correct 4 ms 1236 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 4 ms 1232 KB Output is correct
20 Correct 4 ms 1236 KB Output is correct
21 Correct 5 ms 1236 KB Output is correct
22 Correct 4 ms 1236 KB Output is correct
23 Correct 4 ms 1236 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 53464 KB Output is correct
2 Correct 218 ms 53324 KB Output is correct
3 Correct 232 ms 54664 KB Output is correct
4 Correct 182 ms 52940 KB Output is correct
5 Correct 339 ms 58160 KB Output is correct
6 Correct 263 ms 62208 KB Output is correct
7 Correct 301 ms 57144 KB Output is correct
8 Correct 278 ms 54304 KB Output is correct
9 Correct 263 ms 54504 KB Output is correct
10 Correct 308 ms 57696 KB Output is correct
11 Correct 326 ms 57848 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 55444 KB Output is correct
2 Correct 451 ms 58772 KB Output is correct
3 Correct 350 ms 55668 KB Output is correct
4 Correct 362 ms 57744 KB Output is correct
5 Correct 402 ms 59764 KB Output is correct
6 Correct 428 ms 59868 KB Output is correct
7 Correct 345 ms 58484 KB Output is correct
8 Correct 396 ms 58420 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 498 ms 58136 KB Output is correct
2 Correct 349 ms 55752 KB Output is correct
3 Correct 299 ms 51980 KB Output is correct
4 Correct 296 ms 49740 KB Output is correct
5 Correct 216 ms 48528 KB Output is correct
6 Correct 229 ms 48232 KB Output is correct
7 Correct 245 ms 53500 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 6 ms 1236 KB Output is correct
10 Correct 394 ms 56124 KB Output is correct
11 Correct 342 ms 60212 KB Output is correct
12 Correct 381 ms 58224 KB Output is correct
13 Correct 346 ms 60112 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 5 ms 1108 KB Output is correct
16 Correct 309 ms 55592 KB Output is correct
17 Correct 368 ms 56204 KB Output is correct
18 Correct 355 ms 56308 KB Output is correct
19 Correct 353 ms 56132 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 6 ms 1108 KB Output is correct
15 Correct 4 ms 1100 KB Output is correct
16 Correct 8 ms 1228 KB Output is correct
17 Correct 4 ms 1236 KB Output is correct
18 Correct 4 ms 1108 KB Output is correct
19 Correct 4 ms 1232 KB Output is correct
20 Correct 4 ms 1236 KB Output is correct
21 Correct 5 ms 1236 KB Output is correct
22 Correct 4 ms 1236 KB Output is correct
23 Correct 4 ms 1236 KB Output is correct
24 Correct 4 ms 1108 KB Output is correct
25 Correct 198 ms 53464 KB Output is correct
26 Correct 218 ms 53324 KB Output is correct
27 Correct 232 ms 54664 KB Output is correct
28 Correct 182 ms 52940 KB Output is correct
29 Correct 339 ms 58160 KB Output is correct
30 Correct 263 ms 62208 KB Output is correct
31 Correct 301 ms 57144 KB Output is correct
32 Correct 278 ms 54304 KB Output is correct
33 Correct 263 ms 54504 KB Output is correct
34 Correct 308 ms 57696 KB Output is correct
35 Correct 326 ms 57848 KB Output is correct
36 Correct 307 ms 55444 KB Output is correct
37 Correct 451 ms 58772 KB Output is correct
38 Correct 350 ms 55668 KB Output is correct
39 Correct 362 ms 57744 KB Output is correct
40 Correct 402 ms 59764 KB Output is correct
41 Correct 428 ms 59868 KB Output is correct
42 Correct 345 ms 58484 KB Output is correct
43 Correct 396 ms 58420 KB Output is correct
44 Correct 498 ms 58136 KB Output is correct
45 Correct 349 ms 55752 KB Output is correct
46 Correct 299 ms 51980 KB Output is correct
47 Correct 296 ms 49740 KB Output is correct
48 Correct 216 ms 48528 KB Output is correct
49 Correct 229 ms 48232 KB Output is correct
50 Correct 245 ms 53500 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 6 ms 1236 KB Output is correct
53 Correct 394 ms 56124 KB Output is correct
54 Correct 342 ms 60212 KB Output is correct
55 Correct 381 ms 58224 KB Output is correct
56 Correct 346 ms 60112 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 5 ms 1108 KB Output is correct
59 Correct 309 ms 55592 KB Output is correct
60 Correct 368 ms 56204 KB Output is correct
61 Correct 355 ms 56308 KB Output is correct
62 Correct 353 ms 56132 KB Output is correct
63 Correct 333 ms 53572 KB Output is correct
64 Correct 363 ms 54988 KB Output is correct
65 Correct 335 ms 53860 KB Output is correct
66 Correct 415 ms 58776 KB Output is correct
67 Correct 419 ms 63044 KB Output is correct
68 Correct 386 ms 57964 KB Output is correct
69 Correct 396 ms 59792 KB Output is correct
70 Correct 383 ms 58572 KB Output is correct
71 Correct 417 ms 58756 KB Output is correct