oj.uz

답안 #743918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743918 2023-05-18T06:09:47 Z beepbeepsheep Weirdtree (RMI21_weirdtree) C++17
13 / 100
 2000 ms 8612 KB 
#include "weirdtree.h"
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll,ll>
using namespace std;
vector<ll> v;
void initialise(int N, int Q, int H[]) {
	// Your code here.
	v.emplace_back(0);
	for (int i=1;i<=N;i++){
        v.emplace_back(H[i]);
	}
}
void cut(int l, int r, int k) {
    while (k--){
        ii best={0,-1};
        for (int i=l;i<=r;i++){
            if (v[i]>best.first){
                best.first=v[i];
                best.second=i;
            }
        }
        if (best.second!=-1) v[best.second]--;
    }
	// Your code here.
}
void magic(int i, int x) {
    v[i]=x;
	// Your code here.
}
long long int inspect(int l, int r) {
	// Your code here.
	ll ans=0;
	for (int i=l;i<=r;i++){
        ans+=v[i];
	}
	return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 856 ms 3716 KB Output is correct
4 Correct 835 ms 3744 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2069 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2069 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2043 ms 8612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 856 ms 3716 KB Output is correct
4 Correct 835 ms 3744 KB Output is correct
5 Execution timed out 2069 ms 340 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 856 ms 3716 KB Output is correct
4 Correct 835 ms 3744 KB Output is correct
5 Execution timed out 2069 ms 340 KB Time limit exceeded
6 Halted 0 ms 0 KB -