답안 #1083194

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083194	2024-09-02T17:49:54 Z	mihneacazan	Deda (COCI17_deda)	C++17	0 / 140	335 ms	8784 KB

deda

#include <bits/stdc++.h>

using namespace std;

template<typename T>
class SegTree {
private:
    int n;  // Size of the input array
    std::vector<T> t;  // Segment tree array
    std::function<T(T, T)> combine;  // Function to combine two nodes
    //std::vector<bool> marked;
    //std::vector<int> lazy;

    /*void assign_push(int v) {
        if (marked[v]) {
            t[v*2] = t[v*2+1] = t[v];
            marked[v*2] = marked[v*2+1] = true;
            marked[v] = false;
        }
    }

    void addition_push(int v) {
        t[v*2] += lazy[v];
        lazy[v*2] += lazy[v];
        t[v*2+1] += lazy[v];
        lazy[v*2+1] += lazy[v];
        lazy[v] = 0;
    }*/

    void build(const std::vector<T>& a, int v, int tl, int tr) {
        if (tl == tr) {
            t[v] = a[tl];
        } else {
            int tm = (tl + tr) / 2;
            build(a, v*2, tl, tm);
            build(a, v*2+1, tm+1, tr);
            t[v] = combine(t[v*2], t[v*2+1]);
        }
    }

    T query_non_lazy(int v, int tl, int tr, int l, int r, int y) {
        // cout << v << " " << tl << " " << tr << " " << l << " " << r << " " << y << " " << t[v] << "\n";
        if (tl > r || tr < l || t[v] > y) return -1;
        if (tl == tr) {
            return tl;
        }
        int tm = (tl + tr) / 2;
        int left = query_non_lazy(2*v, tl, tm, l, r, y);
        if (left != -1) return left;
        return query_non_lazy(2*v+1, tm+1, tr, l, r, y);
    }

    void non_lazy_update(int v, int tl, int tr, int pos, int new_val) {
        if (tl == tr) {
            t[v] = new_val;
        } else {
            int tm = (tl + tr) / 2;
            if (pos <= tm)
                non_lazy_update(v*2, tl, tm, pos, new_val);
            else
                non_lazy_update(v*2+1, tm+1, tr, pos, new_val);
            t[v] = combine(t[v*2], t[v*2+1]);
        }
    }

public:
    // Constructor to initialize the segment tree
    SegTree(const std::vector<T>& a, std::function<T(T, T)> combineFunc) {
        n = a.size();
        t.resize(4 * n);
        // marked.resize(4 * n);
        // lazy.resize(4 * n);
        combine = combineFunc;
        build(a, 1, 0, n - 1);
    }

    // Point update function
    void SetPoint(int pos, T new_val) {
        non_lazy_update(1, 0, n - 1, pos, new_val);
    }
    T query(int y, int b) {
        return query_non_lazy(1, 0, n - 1, b, n, y);
    }
};

int combine(int x, int y)
{
    return min(x, y);
}

int main()
{
    int n, q;
    cin >> n >> q;
    vector<int> a(n, INT_MAX);
    SegTree<int> seg(a, combine);
    while (q--) {
        char c;
        cin >> c;
        if (c == 'M') {
            int X, A;
            cin >> X >> A;
            A--;
            a[A] = X;
            seg.SetPoint(A, a[A]);
        } else {
            int Y, B;
            cin >> Y >> B;
            B--;
            cout << seg.query(Y, B) + 1 << "\n";
        }
    }
    return 0;
}

Subtask #1

0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	348 KB	Output isn't correct
2	Incorrect	1 ms	432 KB	Output isn't correct
3	Incorrect	7 ms	348 KB	Output isn't correct
4	Incorrect	335 ms	8608 KB	Output isn't correct
5	Incorrect	321 ms	6352 KB	Output isn't correct
6	Incorrect	310 ms	7512 KB	Output isn't correct
7	Incorrect	305 ms	8784 KB	Output isn't correct