oj.uz

Submission #744012

# Submission time Handle Problem Language Result Execution time Memory
744012 2023-05-18T07:12:25 Z siewjh Weirdtree (RMI21_weirdtree) C++17
13 / 100
 2000 ms 46720 KB 
#include "weirdtree.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

struct node{
    int s, e, m; pair<ll, int> val; ll sum;
    node *l, *r;
    node(int _s, int _e){
        s = _s, e = _e, m = (s + e) >> 1, val = {0, -s}, sum = 0;
        if (s != e){
            l = new node(s, m);
            r = new node(m + 1, e);
        }
    }
    void update(int p, ll v){
        if (s == e){
            val.first = v;
            sum = v;
            return;
        }
        else if (p <= m) l->update(p, v);
        else r->update(p, v);
        val = max(l->val, r->val);
        sum = l->sum + r->sum;
    }
    pair<ll, int> qmax(int x, int y){
        if (x == s && y == e) return val;
        else if (y <= m) return l->qmax(x, y);
        else if (x > m) return r->qmax(x, y);
        else return max(l->qmax(x, m), r->qmax(m + 1, y));
    }
    ll qsum(int x, int y){
        if (x == s && y == e) return sum;
        else if (y <= m) return l->qsum(x, y);
        else if (x > m) return r->qsum(x, y);
        else return l->qsum(x, m)+ r->qsum(m + 1, y);
    }
}*root;

void initialise(int N, int Q, int h[]) {
	root = new node(1, N);
	for (int i = 1; i <= N; i++) root->update(i, h[i]);
}
void cut(int l, int r, int k) {
	for (int i = 0; i < k; i++){
        auto res = root->qmax(l, r);
        if (res.first == 0) break;
        root->update(-res.second, res.first - 1);
	}
}
void magic(int i, int x) {
	root->update(i, x);
}
ll inspect(int l, int r) {
	return root->qsum(l, r);
	return -1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 472 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 68 ms 11176 KB Output is correct
4 Correct 84 ms 11028 KB Output is correct

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2064 ms 476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 39108 KB Output is correct
2 Correct 181 ms 46720 KB Output is correct
3 Execution timed out 2072 ms 11416 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 68 ms 11176 KB Output is correct
4 Correct 84 ms 11028 KB Output is correct
5 Execution timed out 2064 ms 476 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 68 ms 11176 KB Output is correct
4 Correct 84 ms 11028 KB Output is correct
5 Execution timed out 2064 ms 476 KB Time limit exceeded
6 Halted 0 ms 0 KB -