oj.uz

답안 #970693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
970693 2024-04-27T05:22:42 Z hariaakas646 Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 1926 ms 72064 KB 
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

template <class T>
struct MinSegTree
{
    int size = 1, n;
    vector<T> segtree;
    vector<T> vec;

    T def; // Assign a value

    void init(int l, T defv)
    {
        n = l;
        def = defv;

        while (size < n)
            size *= 2;

        segtree.assign(2 * size, def);
        vec.assign(size, def);
    }

    T operation(T x, T y)
    {
        return min(x, y); // Any required operation
    }

    void recalculate(int x)
    {
        segtree[x] = operation(segtree[2 * x + 1], segtree[2 * x + 2]);
    }

    void build(int x, int l, int r)
    {
        if (l == r)
        {
            segtree[x] = vec[l];
            return;
        }
        int mid = (l + r) / 2;
        build(2 * x + 1, l, mid);
        build(2 * x + 2, mid + 1, r);
        recalculate(x);
    }

    void build()
    {
        build(0, 0, size - 1);
    }

    void set(int id, T val)
    {
        vec[id] = val;
    }

    void update(int x, int l, int r, int id, T val)
    {
        if (l == r)
        {
            segtree[x] = val;
            return;
        }
        int mid = (l + r) / 2;
        if (id <= mid)
        {
            update(2 * x + 1, l, mid, id, val);
        }
        else
        {
            update(2 * x + 2, mid + 1, r, id, val);
        }
        recalculate(x);
    }

    void update(int id, T val)
    {
        update(0, 0, size - 1, id, val);
    }

    T query(int x, int l, int r, int lx, int rx)
    {
        if (lx > r || rx < l)
        {
            return def;
        }
        if (lx <= l && r <= rx)
        {
            return segtree[x];
        }
        int mid = (l + r) / 2;
        T v1 = query(2 * x + 1, l, mid, lx, rx);
        T v2 = query(2 * x + 2, mid + 1, r, lx, rx);
        return operation(v1, v2);
    }

    T query(int lx, int rx)
    {
        return query(0, 0, size - 1, lx, rx);
    }
};

template <class T>
struct SegTree
{
    int size = 1, n;
    vector<T> segtree;
    vector<T> vec;

    T def; // Assign a value

    void init(int l, T defv)
    {
        n = l;
        def = defv;

        while (size < n)
            size *= 2;

        segtree.assign(2 * size, def);
        vec.assign(size, def);
    }

    T operation(T x, T y)
    {
        return max(x, y); // Any required operation
    }

    void recalculate(int x)
    {
        segtree[x] = operation(segtree[2 * x + 1], segtree[2 * x + 2]);
    }

    void build(int x, int l, int r)
    {
        if (l == r)
        {
            segtree[x] = vec[l];
            return;
        }
        int mid = (l + r) / 2;
        build(2 * x + 1, l, mid);
        build(2 * x + 2, mid + 1, r);
        recalculate(x);
    }

    void build()
    {
        build(0, 0, size - 1);
    }

    void set(int id, T val)
    {
        vec[id] = val;
    }

    void update(int x, int l, int r, int id, T val)
    {
        if (l == r)
        {
            segtree[x] = val;
            return;
        }
        int mid = (l + r) / 2;
        if (id <= mid)
        {
            update(2 * x + 1, l, mid, id, val);
        }
        else
        {
            update(2 * x + 2, mid + 1, r, id, val);
        }
        recalculate(x);
    }

    void update(int id, T val)
    {
        update(0, 0, size - 1, id, val);
    }

    T query(int x, int l, int r, int lx, int rx)
    {
        if (lx > r || rx < l)
        {
            return def;
        }
        if (lx <= l && r <= rx)
        {
            return segtree[x];
        }
        int mid = (l + r) / 2;
        T v1 = query(2 * x + 1, l, mid, lx, rx);
        T v2 = query(2 * x + 2, mid + 1, r, lx, rx);
        return operation(v1, v2);
    }

    T query(int lx, int rx)
    {
        return query(0, 0, size - 1, lx, rx);
    }
};

vector<SegTree<int>> lift1(20);
vector<MinSegTree<int>> lift2(20);

int binlift(int st, int en) {
    int tot = 0;
    pii curr = mp(st, st);
    for(int i=19; i>=0; i--) {
        pii tmp = mp(lift2[i].query(curr.f, curr.s), lift1[i].query(curr.f, curr.s));
        
        if(!(tmp.f <= en && en <= tmp.s)) {
            curr = tmp;
            tot += (1<<i);
        }
    }
    // printf("%d %d\n", curr.f, curr.s);
    curr = mp(lift2[0].query(curr.f, curr.s), lift1[0].query(curr.f, curr.s));
    // printf("%d %d\n", curr.f, curr.s);
    if(curr.f <= en && en <= curr.s)
        return tot + 1;
    else return -1;
}

// bool check(int st, int en, int x) {
//     pii curr = mp(st, st);
//     frange(i, 20) {
//         if(x & (1<<i)) {
//             curr = mp(lift2[i].query(curr.f, curr.s), lift1[i].query(curr.f, curr.s));
//         }
//     }
//     if(curr.f <= en && en <= curr.s) return true;
//     else return false;
// }

int main() {
    // usaco();
    int n, k;
    scd(n);
    scd(k);
    int m;
    scd(m);

    vii vec(m);

    frange(i, m) {
        scd(vec[i].s);
        scd(vec[i].f);
    }

    sort(all(vec));
    seti act;
    frange(i, n) act.insert(i+1);

    sort(all(vec), greater<>());
    lift1[0].init(n+1, 0);
    forr(i, 1, n+1) {
        lift1[0].set(i, i);
    }
    for(auto p : vec) {
        if(p.f > p.s) {
            auto it = act.lower_bound(p.s);
            while(it != act.end() && *it < min(p.s+k, p.f)) {
                lift1[0].set(*it, p.f);
                act.erase(it);
                it=act.lower_bound(p.s);
            }
        }
    }
    lift1[0].build();
    frange(i, n) act.insert(i+1);

    sort(all(vec));
    lift2[0].init(n+1, 1e9);
    forr(i, 1, n+1) {
        lift2[0].set(i, i);
    }
    for(auto p : vec) {
        if(p.f < p.s) {
            auto it = act.lower_bound(max(p.f+1, p.s-k+1));
            while(it != act.end() && *it <= p.s) {
                lift2[0].set(*it, p.f);
                act.erase(it);
                it=act.lower_bound(max(p.f+1, p.s-k+1));
            }
        }
    }
    lift2[0].build();

    forr(i, 1, 20) {
        lift1[i].init(n+1, 0);
        lift2[i].init(n+1, 1e9);
        forr(j, 1, n+1) {
            lift1[i].set(j, lift1[i-1].query(lift2[i-1].query(j, j), lift1[i-1].query(j, j)));
            lift2[i].set(j, lift2[i-1].query(lift2[i-1].query(j, j), lift1[i-1].query(j, j)));
        }
        lift1[i].build();
        lift2[i].build();
    }

    int q;
    scd(q);

    frange(_, q) {
        int st, en;
        scd(st);
        scd(en);
        printf("%d\n", binlift(st, en));
        // int lo = 0;
        // int hi = m+1;

        // while(lo != hi) {
        //     int mid = (lo+hi)/2;
        //     if(check(st, en, mid)) hi = mid;
        //     else lo = mid+1;
        // }
        // if(hi == m+1) printf("-1\n");
        // else printf("%d\n", lo);
    }
}

Compilation message

Main.cpp: In function 'void usaco()':
Main.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:270:5: note: in expansion of macro 'scd'
  270 |     scd(n);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:271:5: note: in expansion of macro 'scd'
  271 |     scd(k);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:273:5: note: in expansion of macro 'scd'
  273 |     scd(m);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:278:9: note: in expansion of macro 'scd'
  278 |         scd(vec[i].s);
      |         ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:279:9: note: in expansion of macro 'scd'
  279 |         scd(vec[i].f);
      |         ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:333:5: note: in expansion of macro 'scd'
  333 |     scd(q);
      |     ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:337:9: note: in expansion of macro 'scd'
  337 |         scd(st);
      |         ^~~
Main.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
Main.cpp:338:9: note: in expansion of macro 'scd'
  338 |         scd(en);
      |         ^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 3 ms 696 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 484 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 3 ms 696 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 484 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 27 ms 1460 KB Output is correct
14 Correct 26 ms 1368 KB Output is correct
15 Correct 19 ms 1372 KB Output is correct
16 Correct 26 ms 1372 KB Output is correct
17 Correct 25 ms 1372 KB Output is correct
18 Correct 23 ms 1352 KB Output is correct
19 Correct 22 ms 1368 KB Output is correct
20 Correct 23 ms 1372 KB Output is correct
21 Correct 19 ms 1368 KB Output is correct
22 Correct 23 ms 1368 KB Output is correct
23 Correct 23 ms 1368 KB Output is correct
24 Correct 23 ms 1488 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1349 ms 66772 KB Output is correct
2 Correct 1324 ms 68516 KB Output is correct
3 Correct 1402 ms 68432 KB Output is correct
4 Correct 1304 ms 67920 KB Output is correct
5 Correct 1308 ms 66892 KB Output is correct
6 Correct 1353 ms 66396 KB Output is correct
7 Correct 1322 ms 65876 KB Output is correct
8 Correct 1283 ms 64612 KB Output is correct
9 Correct 1299 ms 65384 KB Output is correct
10 Correct 1288 ms 66248 KB Output is correct
11 Correct 1289 ms 66796 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1626 ms 65240 KB Output is correct
2 Correct 1555 ms 64900 KB Output is correct
3 Correct 1568 ms 63916 KB Output is correct
4 Correct 1495 ms 63936 KB Output is correct
5 Correct 1494 ms 63744 KB Output is correct
6 Correct 1524 ms 64184 KB Output is correct
7 Correct 1490 ms 67920 KB Output is correct
8 Correct 1670 ms 64200 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1755 ms 68680 KB Output is correct
2 Correct 1880 ms 67924 KB Output is correct
3 Correct 1875 ms 67828 KB Output is correct
4 Correct 1729 ms 67412 KB Output is correct
5 Correct 1552 ms 67196 KB Output is correct
6 Correct 1615 ms 67644 KB Output is correct
7 Correct 1521 ms 69648 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 28 ms 1420 KB Output is correct
10 Correct 1372 ms 71052 KB Output is correct
11 Correct 1528 ms 71576 KB Output is correct
12 Correct 1521 ms 71504 KB Output is correct
13 Correct 1545 ms 71428 KB Output is correct
14 Correct 3 ms 600 KB Output is correct
15 Correct 27 ms 1444 KB Output is correct
16 Correct 1347 ms 70836 KB Output is correct
17 Correct 1786 ms 72064 KB Output is correct
18 Correct 1730 ms 71464 KB Output is correct
19 Correct 1667 ms 71508 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Output is correct
2 Correct 3 ms 696 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 600 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 3 ms 528 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 484 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 27 ms 1460 KB Output is correct
14 Correct 26 ms 1368 KB Output is correct
15 Correct 19 ms 1372 KB Output is correct
16 Correct 26 ms 1372 KB Output is correct
17 Correct 25 ms 1372 KB Output is correct
18 Correct 23 ms 1352 KB Output is correct
19 Correct 22 ms 1368 KB Output is correct
20 Correct 23 ms 1372 KB Output is correct
21 Correct 19 ms 1368 KB Output is correct
22 Correct 23 ms 1368 KB Output is correct
23 Correct 23 ms 1368 KB Output is correct
24 Correct 23 ms 1488 KB Output is correct
25 Correct 1349 ms 66772 KB Output is correct
26 Correct 1324 ms 68516 KB Output is correct
27 Correct 1402 ms 68432 KB Output is correct
28 Correct 1304 ms 67920 KB Output is correct
29 Correct 1308 ms 66892 KB Output is correct
30 Correct 1353 ms 66396 KB Output is correct
31 Correct 1322 ms 65876 KB Output is correct
32 Correct 1283 ms 64612 KB Output is correct
33 Correct 1299 ms 65384 KB Output is correct
34 Correct 1288 ms 66248 KB Output is correct
35 Correct 1289 ms 66796 KB Output is correct
36 Correct 1626 ms 65240 KB Output is correct
37 Correct 1555 ms 64900 KB Output is correct
38 Correct 1568 ms 63916 KB Output is correct
39 Correct 1495 ms 63936 KB Output is correct
40 Correct 1494 ms 63744 KB Output is correct
41 Correct 1524 ms 64184 KB Output is correct
42 Correct 1490 ms 67920 KB Output is correct
43 Correct 1670 ms 64200 KB Output is correct
44 Correct 1755 ms 68680 KB Output is correct
45 Correct 1880 ms 67924 KB Output is correct
46 Correct 1875 ms 67828 KB Output is correct
47 Correct 1729 ms 67412 KB Output is correct
48 Correct 1552 ms 67196 KB Output is correct
49 Correct 1615 ms 67644 KB Output is correct
50 Correct 1521 ms 69648 KB Output is correct
51 Correct 3 ms 604 KB Output is correct
52 Correct 28 ms 1420 KB Output is correct
53 Correct 1372 ms 71052 KB Output is correct
54 Correct 1528 ms 71576 KB Output is correct
55 Correct 1521 ms 71504 KB Output is correct
56 Correct 1545 ms 71428 KB Output is correct
57 Correct 3 ms 600 KB Output is correct
58 Correct 27 ms 1444 KB Output is correct
59 Correct 1347 ms 70836 KB Output is correct
60 Correct 1786 ms 72064 KB Output is correct
61 Correct 1730 ms 71464 KB Output is correct
62 Correct 1667 ms 71508 KB Output is correct
63 Correct 1771 ms 68176 KB Output is correct
64 Correct 1926 ms 67840 KB Output is correct
65 Correct 1775 ms 68432 KB Output is correct
66 Correct 1621 ms 67392 KB Output is correct
67 Correct 1811 ms 66976 KB Output is correct
68 Correct 1457 ms 67664 KB Output is correct
69 Correct 1476 ms 67296 KB Output is correct
70 Correct 1603 ms 71920 KB Output is correct
71 Correct 1739 ms 66968 KB Output is correct