oj.uz

Submission #1060902

# Submission time Handle Problem Language Result Execution time Memory
1060902 2024-08-16T04:16:45 Z RiverFlow Osumnjičeni (COCI21_osumnjiceni) C++14
110 / 110
 394 ms 54220 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b or a == 0) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

const int LG = 17;

int p[N], l[N], r[N], lg[N], sp[N][LG + 1];

int get(int l, int r) { int j = lg[r - l + 1];
    return min(sp[l][j], sp[r - (1 << j) + 1][j]);
}

int n, f[N][LG + 1];

namespace SUB1 {
    const int N = (int)5e3 + 3;

    int dp[N][N];

    void sol() {
        for(int i = 1; i <= n; ++i) {
            p[i] = n + 1;
            for(int j = i + 1; j <= n; ++j) {
                if ( l[i] > r[j] or r[i] < l[j] ) continue ;
                p[i] = j; break ;
            }
            sp[i][0] = p[i];
        }
        FOR(i, 2, n) lg[i] = lg[i / 2] + 1;
        for(int j = 1; (1 << j) <= n; ++j)
            for(int i = 1; i + (1 << j) - 1 <= n; ++i)
                sp[i][j] = min(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);

        FOD(i, n, 1) {
            int num_seg = 0;
            int last_end = i;
            dp[i][i] = 1;
            for(int j = i + 1; j <= n; ++j) {
                if (get(last_end, j) > j) {
                    dp[i][j] = num_seg + 1;
                    continue ;
                }
                ++num_seg;
                last_end = j;
                dp[i][j] = num_seg + 1;
            }
        }
        int q; cin >> q;
        while (q--) {
            int l, r; cin >> l >> r;
            cout << dp[l][r] << nl;
        }
    }
};

struct segment_tree {
    int n;
    vector<int> t, lz;
    const int INF = (int)1e8;
    segment_tree (int _n) {
        n = _n;
        t.resize(4 * n + 7);
        lz.resize(4 * n + 7);
        FOR(i, 1, 4 * n) t[i] = INF;
    }
    void upd(int id, int l, int r, int u, int v, int val) {
        if (l > v or r < u) return ;
        if (l >= u and r <= v) {
            t[id] = val;
            lz[id] = val;
            return ;
        }
        if (lz[id]) {
            mini(t[id << 1], lz[id]);
            mini(t[id << 1 | 1], lz[id]);
            mini(lz[id << 1], lz[id]);
            mini(lz[id << 1 | 1], lz[id]);
            lz[id] = 0;
        }
        int m = (l + r) >> 1;
        upd(id << 1, l, m, u, v, val);
        upd(id << 1 | 1, m + 1, r, u, v, val);
        t[id] = min(t[id << 1], t[id << 1 | 1]);
    }
    void upd(int l, int r, int val) {
        upd(1, 1, n, l, r, val);
    }
    int get(int id, int l, int r, int u, int v) {
        if (l > v or r < u) return INF;
        if (l >= u and r <= v) return t[id];
        if (lz[id]) {
            mini(t[id << 1], lz[id]);
            mini(t[id << 1 | 1], lz[id]);
            mini(lz[id << 1], lz[id]);
            mini(lz[id << 1 | 1], lz[id]);
            lz[id] = 0;
        }
        int m = (l + r) >> 1;
        return min(get(id<<1,l,m,u,v), get(id<<1|1,m+1,r,u,v));
    }
    int get(int l, int r){
        return get(1,1,n,l,r);
    }

};


void main_code() {
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> l[i] >> r[i];
    }
//    if (n <= 5000) {
//        SUB1::sol();
//        return ;
//    }

    vector<int> val;
    FOR(i, 1, n) {
        val.push_back(l[i]);
        val.push_back(r[i]);
    }
    unq(val);
    FOR(i, 1, n) {
        l[i] = lower_bound(all(val), l[i]) - val.begin() + 1;
        r[i] = lower_bound(all(val), r[i]) - val.begin() + 1;
    }
    segment_tree st(sz(val));
    FOD(i, n, 1) {
        p[i] = min(n + 1, st.get(l[i], r[i]));
        st.upd(l[i], r[i], i);
        sp[i][0] = p[i];
    }
    FOR(i, 2, n) lg[i] = lg[i / 2] + 1;
    for(int j = 1; (1 << j) <= n; ++j)
        for(int i = 1; i + (1 << j) - 1 <= n; ++i)
            sp[i][j] = min(sp[i][j - 1], sp[i + (1 << (j - 1))][j - 1]);

    for(int i = 1; i <= n; ++i) {
        int lb = i, rb = n, p = -1;
        while (lb <= rb) {
            int m = (lb + rb) >> 1;
            if (get(i, m) > m) {
                p = m;
                lb = m + 1;
            } else
                rb = m - 1;
        }
        f[i][0] = p;
    }
    FOR(j, 1, LG)
    FOR(i, 1, n) if (f[i][j-1] > 0)
        f[i][j] = f[f[i][j-1]+1][j-1]; // endpoint sau khi nhay 2^j buoc


    int q; cin >> q;

    while (q--) {
        int l, r;
        cin >> l >> r;
        int i = l;
        int ans = 0;
        FOD(j, LG, 0) {
            if (f[i][j] > 0 and f[i][j] < r) {
                ans += (1 << j);
                i = f[i][j] + 1;
            }
        }
        cout << ans + 1 << nl;
    }
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 46552 KB Output is correct
2 Correct 329 ms 46156 KB Output is correct
3 Correct 328 ms 46260 KB Output is correct
4 Correct 345 ms 46536 KB Output is correct
5 Correct 367 ms 47124 KB Output is correct
6 Correct 50 ms 34428 KB Output is correct
7 Correct 88 ms 34500 KB Output is correct
8 Correct 62 ms 34484 KB Output is correct
9 Correct 77 ms 34444 KB Output is correct
10 Correct 89 ms 34504 KB Output is correct
11 Correct 211 ms 46968 KB Output is correct
12 Correct 190 ms 45756 KB Output is correct
13 Correct 197 ms 45756 KB Output is correct
14 Correct 213 ms 46792 KB Output is correct
15 Correct 219 ms 46532 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 55 ms 34504 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7000 KB Output is correct
2 Correct 9 ms 7004 KB Output is correct
3 Correct 7 ms 7004 KB Output is correct
4 Correct 8 ms 7004 KB Output is correct
5 Correct 9 ms 7004 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6784 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 5 ms 6748 KB Output is correct
11 Correct 6 ms 7004 KB Output is correct
12 Correct 5 ms 7004 KB Output is correct
13 Correct 5 ms 7004 KB Output is correct
14 Correct 5 ms 7000 KB Output is correct
15 Correct 6 ms 7004 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7000 KB Output is correct
2 Correct 9 ms 7004 KB Output is correct
3 Correct 7 ms 7004 KB Output is correct
4 Correct 8 ms 7004 KB Output is correct
5 Correct 9 ms 7004 KB Output is correct
6 Correct 3 ms 6748 KB Output is correct
7 Correct 3 ms 6740 KB Output is correct
8 Correct 3 ms 6784 KB Output is correct
9 Correct 3 ms 6744 KB Output is correct
10 Correct 5 ms 6748 KB Output is correct
11 Correct 6 ms 7004 KB Output is correct
12 Correct 5 ms 7004 KB Output is correct
13 Correct 5 ms 7004 KB Output is correct
14 Correct 5 ms 7000 KB Output is correct
15 Correct 6 ms 7004 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 3 ms 6744 KB Output is correct
18 Correct 59 ms 7836 KB Output is correct
19 Correct 49 ms 7760 KB Output is correct
20 Correct 52 ms 7760 KB Output is correct
21 Correct 60 ms 7648 KB Output is correct
22 Correct 50 ms 7764 KB Output is correct
23 Correct 49 ms 7508 KB Output is correct
24 Correct 52 ms 7508 KB Output is correct
25 Correct 47 ms 7504 KB Output is correct
26 Correct 70 ms 7464 KB Output is correct
27 Correct 63 ms 7248 KB Output is correct
28 Correct 32 ms 7248 KB Output is correct
29 Correct 33 ms 7392 KB Output is correct
30 Correct 31 ms 7260 KB Output is correct
31 Correct 35 ms 7288 KB Output is correct
32 Correct 52 ms 7268 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 34 ms 7596 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 338 ms 47300 KB Output is correct
2 Correct 361 ms 46780 KB Output is correct
3 Correct 292 ms 45640 KB Output is correct
4 Correct 290 ms 45708 KB Output is correct
5 Correct 304 ms 46072 KB Output is correct
6 Correct 49 ms 34232 KB Output is correct
7 Correct 54 ms 34244 KB Output is correct
8 Correct 59 ms 34244 KB Output is correct
9 Correct 62 ms 34248 KB Output is correct
10 Correct 68 ms 34508 KB Output is correct
11 Correct 174 ms 45752 KB Output is correct
12 Correct 194 ms 47284 KB Output is correct
13 Correct 178 ms 45764 KB Output is correct
14 Correct 197 ms 46276 KB Output is correct
15 Correct 205 ms 47048 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 49 ms 34284 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 46552 KB Output is correct
2 Correct 329 ms 46156 KB Output is correct
3 Correct 328 ms 46260 KB Output is correct
4 Correct 345 ms 46536 KB Output is correct
5 Correct 367 ms 47124 KB Output is correct
6 Correct 50 ms 34428 KB Output is correct
7 Correct 88 ms 34500 KB Output is correct
8 Correct 62 ms 34484 KB Output is correct
9 Correct 77 ms 34444 KB Output is correct
10 Correct 89 ms 34504 KB Output is correct
11 Correct 211 ms 46968 KB Output is correct
12 Correct 190 ms 45756 KB Output is correct
13 Correct 197 ms 45756 KB Output is correct
14 Correct 213 ms 46792 KB Output is correct
15 Correct 219 ms 46532 KB Output is correct
16 Correct 1 ms 6488 KB Output is correct
17 Correct 55 ms 34504 KB Output is correct
18 Correct 10 ms 7000 KB Output is correct
19 Correct 9 ms 7004 KB Output is correct
20 Correct 7 ms 7004 KB Output is correct
21 Correct 8 ms 7004 KB Output is correct
22 Correct 9 ms 7004 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 3 ms 6740 KB Output is correct
25 Correct 3 ms 6784 KB Output is correct
26 Correct 3 ms 6744 KB Output is correct
27 Correct 5 ms 6748 KB Output is correct
28 Correct 6 ms 7004 KB Output is correct
29 Correct 5 ms 7004 KB Output is correct
30 Correct 5 ms 7004 KB Output is correct
31 Correct 5 ms 7000 KB Output is correct
32 Correct 6 ms 7004 KB Output is correct
33 Correct 1 ms 6492 KB Output is correct
34 Correct 3 ms 6744 KB Output is correct
35 Correct 59 ms 7836 KB Output is correct
36 Correct 49 ms 7760 KB Output is correct
37 Correct 52 ms 7760 KB Output is correct
38 Correct 60 ms 7648 KB Output is correct
39 Correct 50 ms 7764 KB Output is correct
40 Correct 49 ms 7508 KB Output is correct
41 Correct 52 ms 7508 KB Output is correct
42 Correct 47 ms 7504 KB Output is correct
43 Correct 70 ms 7464 KB Output is correct
44 Correct 63 ms 7248 KB Output is correct
45 Correct 32 ms 7248 KB Output is correct
46 Correct 33 ms 7392 KB Output is correct
47 Correct 31 ms 7260 KB Output is correct
48 Correct 35 ms 7288 KB Output is correct
49 Correct 52 ms 7268 KB Output is correct
50 Correct 1 ms 6492 KB Output is correct
51 Correct 34 ms 7596 KB Output is correct
52 Correct 338 ms 47300 KB Output is correct
53 Correct 361 ms 46780 KB Output is correct
54 Correct 292 ms 45640 KB Output is correct
55 Correct 290 ms 45708 KB Output is correct
56 Correct 304 ms 46072 KB Output is correct
57 Correct 49 ms 34232 KB Output is correct
58 Correct 54 ms 34244 KB Output is correct
59 Correct 59 ms 34244 KB Output is correct
60 Correct 62 ms 34248 KB Output is correct
61 Correct 68 ms 34508 KB Output is correct
62 Correct 174 ms 45752 KB Output is correct
63 Correct 194 ms 47284 KB Output is correct
64 Correct 178 ms 45764 KB Output is correct
65 Correct 197 ms 46276 KB Output is correct
66 Correct 205 ms 47048 KB Output is correct
67 Correct 1 ms 6488 KB Output is correct
68 Correct 49 ms 34284 KB Output is correct
69 Correct 392 ms 49264 KB Output is correct
70 Correct 394 ms 54220 KB Output is correct
71 Correct 365 ms 52476 KB Output is correct
72 Correct 379 ms 53704 KB Output is correct
73 Correct 387 ms 53276 KB Output is correct
74 Correct 132 ms 42180 KB Output is correct
75 Correct 139 ms 41412 KB Output is correct
76 Correct 133 ms 42188 KB Output is correct
77 Correct 130 ms 41272 KB Output is correct
78 Correct 142 ms 41668 KB Output is correct
79 Correct 229 ms 53188 KB Output is correct
80 Correct 213 ms 51520 KB Output is correct
81 Correct 218 ms 51772 KB Output is correct
82 Correct 240 ms 52672 KB Output is correct
83 Correct 220 ms 51680 KB Output is correct
84 Correct 1 ms 6488 KB Output is correct
85 Correct 102 ms 41416 KB Output is correct