oj.uz

답안 #479859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
479859 2021-10-13T15:40:17 Z aris12345678 Deda (COCI17_deda) C++14
120 / 140
 1000 ms 7668 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
#define X first
#define Y second

const int mxN = 200005;
const int inf = 1e9+5;
int st[4*mxN];

void update(int p, int l, int r, int i, int v) {
    if(l == r)
        st[p] = v;
    else {
        int md = (l+r)/2;
        if(i <= md)
            update(2*p, l, md, i, v);
        else
            update(2*p+1, md+1, r, i, v);
        st[p] = min(st[2*p], st[2*p+1]);
    }
}

int Min(int p, int l, int r, int i, int j) {
    if(i > r || l > j)
        return inf;
    if(i <= l && r <= j)
        return st[p];
    int md = (l+r)/2;
    return min(Min(2*p, l, md, i, j), Min(2*p+1, md+1, r, i, j));
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n, q;
    scanf("%d %d\n", &n, &q);
    fill(st, st+4*mxN, inf);
    while(q--) {
        char type;
        int l, r;
        scanf(" %c %d %d", &type, &l, &r);
        if(type == 'M')
            update(1, 1, n, r, l);
        else {
            int st = r, en = n, md, ans = -1;
            while(st <= en) {
                md = (st+en)/2;
                if(Min(1, 1, n, r, md) <= l)
                    ans = md, en = md-1;
                else
                    st = md+1;
            }
            printf("%d\n", ans);
        }
    }
    return 0;
}

Compilation message

deda.cpp: In function 'int main()':
deda.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |     scanf("%d %d\n", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
deda.cpp:44:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |         scanf(" %c %d %d", &type, &l, &r);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
120.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3404 KB Output is correct
2 Correct 3 ms 3404 KB Output is correct
3 Correct 9 ms 3452 KB Output is correct
4 Execution timed out 1077 ms 7668 KB Time limit exceeded
5 Correct 688 ms 4392 KB Output is correct
6 Correct 853 ms 4424 KB Output is correct
7 Correct 825 ms 4364 KB Output is correct