oj.uz

Submission #627429

# Submission time Handle Problem Language Result Execution time Memory
627429 2022-08-12T14:58:46 Z MohamedFaresNebili Bread First Search (CCO21_day2problem2) C++14
25 / 25
 231 ms 14184 KB 
#include <bits/stdc++.h>

            using namespace std;

            using ll = long long;
            using ld = long double;
            using pi = pair<pair<int, int>, pair<int, int>>;

            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
            #define int ll

            int N, M, ST[800005], lazy[800005], L[200005], R[200005];
            void prop(int v, int l, int r) {
                if(l == r) return;
                lazy[v * 2] += lazy[v];
                lazy[v * 2 + 1] += lazy[v];

                ST[v * 2] += lazy[v];
                ST[v * 2 + 1] += lazy[v];

                lazy[v] = 0; return;
            }
            void update(int v, int l, int r, int lo, int hi, int val) {
                prop(v, l, r);
                if(l > hi || r < lo) return;
                if(l >= lo && r <= hi) {
                    ST[v] += val; lazy[v] += val;
                    return;
                }
                update(v * 2, l, (l + r) / 2, lo, hi, val);
                update(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi, val);
                ST[v] = min(ST[v * 2], ST[v * 2 + 1]);
            }
            int query(int v, int l, int r, int lo, int hi) {
                prop(v, l, r);
                if(l > hi || r < lo) return 1e9 + 7;
                if(l >= lo && r <= hi) return ST[v];
                return min(query(v * 2, l, (l + r) / 2, lo, hi),
                           query(v * 2 + 1, (l + r) / 2 + 1, r, lo, hi));
            }

            int32_t main() {
                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
                cin >> N >> M;
                for(int l = 1; l <= N; l++) L[l] = l, R[l] = l;
                for(int l = 1; l <= M; l++) {
                    int U, V; cin >> U >> V;
                    L[V] = min(L[V], U); L[U] = min(L[U], V);
                    R[V] = max(R[V], U); R[U] = max(R[U], V);
                }
                int i = 1;
                for(int l = 2; l <= N; l++) {
                    while(i < l && R[i] <= l) i++;
                    update(1, 1, N, 1, L[l] - 1, 1);
                    int P = query(1, 1, N, 1, i - 1);
                    update(1, 1, N, l, l, P);
                }
                cout << ST[1] << "\n";
                return 0;
            }

Subtask #1
5.0 / 5.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 7 ms 748 KB Output is correct
26 Correct 7 ms 792 KB Output is correct
27 Correct 5 ms 792 KB Output is correct
28 Correct 6 ms 732 KB Output is correct
29 Correct 3 ms 600 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 11 ms 1052 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 5 ms 596 KB Output is correct
25 Correct 7 ms 748 KB Output is correct
26 Correct 7 ms 792 KB Output is correct
27 Correct 5 ms 792 KB Output is correct
28 Correct 6 ms 732 KB Output is correct
29 Correct 3 ms 600 KB Output is correct
30 Correct 8 ms 980 KB Output is correct
31 Correct 11 ms 1052 KB Output is correct
32 Correct 136 ms 11704 KB Output is correct
33 Correct 145 ms 11728 KB Output is correct
34 Correct 127 ms 13232 KB Output is correct
35 Correct 186 ms 14156 KB Output is correct
36 Correct 167 ms 14184 KB Output is correct
37 Correct 182 ms 14084 KB Output is correct
38 Correct 132 ms 11588 KB Output is correct
39 Correct 147 ms 11688 KB Output is correct
40 Correct 78 ms 7128 KB Output is correct
41 Correct 136 ms 13272 KB Output is correct
42 Correct 231 ms 14052 KB Output is correct
43 Correct 194 ms 14056 KB Output is correct
44 Correct 1 ms 340 KB Output is correct
45 Correct 1 ms 332 KB Output is correct