oj.uz

Submission #234412

# Submission time Handle Problem Language Result Execution time Memory
234412 2020-05-24T07:14:07 Z kartel Deda (COCI17_deda) C++14
140 / 140
 145 ms 3448 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +300500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

int t[4 * N], n, q, i, x, a, y, b, ans;
char c;

void upd(int v, int l, int r, int ps, int vl)
{
    if (l == r) t[v] = vl;else
    {
        int md = (l + r) >> 1;
        if (ps <= md)
             upd(v * 2, l, md, ps, vl);
        else upd(v * 2 + 1, md + 1, r, ps, vl);
        t[v] = min(t[v * 2], t[v * 2 + 1]);
    }
}

void srch(int v, int l, int r)
{
    if (ans != -1) return;
    if (t[v] > y) return;

    if (l == r) {ans = l;return;}

    int md = (l + r) >> 1;

    srch(v * 2, l, md);
    srch(v * 2 + 1, md + 1, r);
}

void fnd(int v, int l, int r, int tl, int tr)
{
    if (ans != -1) return;

    if (l == tl && r == tr)
    {
        if (ans == -1)
            srch(v, l, r);
        return;
    }

    if (l > r || l > tr || tl > tr || tl > r) return;

    int md = (l + r) >> 1;

    fnd(v * 2, l, md, tl, min(md, tr));
    fnd(v * 2 + 1, md + 1, r, max(tl, md + 1), tr);
}

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n >> q;

    for (i = 1; i <= n; i++) upd(1, 1, n, i, 2e9);

    while (q--)
    {
        cin >> c;
        if (c == 'M')
        {
            cin >> x >> a;
            upd(1, 1, n, a, x);
        }
        else
        {
            cin >> y >> b;

            ans = -1;

            fnd(1, 1, n, b, n);

            cout << ans << el;
        }
    }
}

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Correct 145 ms 3448 KB Output is correct
5 Correct 127 ms 2168 KB Output is correct
6 Correct 135 ms 3320 KB Output is correct
7 Correct 145 ms 3448 KB Output is correct