oj.uz

Submission #382082

# Submission time Handle Problem Language Result Execution time Memory
382082 2021-03-26T11:14:01 Z vishesh312 Temperature (POI11_tem) C++17
8 / 100
 240 ms 15980 KB 
#include "bits/stdc++.h"

#pragma GCC optimize("unroll-loops", "Ofast")

using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

const int mxN = 1e6;
int mn[mxN], mx[mxN];

struct SegTree {
    int n;
    vector<int> t;
    int query(int l, int r) {
        int ret = INT_MIN;
        for (l += n, r += n; l <= r; l /= 2, r /= 2) {
            if (l&1) ret = max(ret, t[l++]);
            if (r&1) ret = max(ret, t[r--]);
        }
        return ret;
    }
    SegTree(int _n) {
        n = _n;
        t.resize(2*n);
        for (int i = n; i < 2*n; ++i) {
            t[i] = mn[i-n];
        }
        for (int i = n-1; i > 0; --i) {
            t[i] = max(t[i*2], t[i*2+1]);
        }
    }
};

void solve(int tc) {
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> mn[i] >> mx[i];
    }
    SegTree seg(n);
    int lo = 0, hi = n-1;
    int m = INT_MIN;
    int ans = 0;
    for (int i = 0; i < n; ++i) {
        if (mx[i] < m) {
            ++lo;
            hi = i;
            while (lo < hi) {
                int mid = (lo + hi) / 2;
                int q = seg.query(mid, i);
                if (mx[i] < q) lo = mid+1;
                else hi = mid;
            }
            m = seg.query(lo, i);
        }
        m = max(m, mn[i]);
        ans = max(ans, i - lo + 1);
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 492 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Incorrect 3 ms 492 KB Output isn't correct

Subtask #4
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 7532 KB Output is correct
2 Correct 80 ms 8556 KB Output is correct
3 Incorrect 92 ms 9580 KB Output isn't correct

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 11756 KB Output is correct
2 Correct 164 ms 12780 KB Output is correct
3 Incorrect 163 ms 12780 KB Output isn't correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 194 ms 12452 KB Output is correct
2 Correct 168 ms 13036 KB Output is correct
3 Incorrect 197 ms 13036 KB Output isn't correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 14444 KB Output is correct
2 Correct 172 ms 13420 KB Output is correct
3 Incorrect 239 ms 15980 KB Output isn't correct

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 213 ms 13036 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 127 ms 13164 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 12268 KB Output is correct
2 Incorrect 127 ms 13804 KB Output isn't correct

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 11628 KB Output is correct
2 Incorrect 240 ms 15280 KB Output isn't correct

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 11196 KB Output is correct
2 Incorrect 217 ms 13804 KB Output isn't correct