oj.uz

답안 #989744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
989744 2024-05-28T17:22:41 Z tch1cherin Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 5460 KB 
#include <bits/stdc++.h>
using namespace std;
 
int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<int> W(N);
  for (int &value : W) {
    cin >> value;
  }
  while (M--) {
    int L, R, K;
    cin >> L >> R >> K;
    L--, R--;
    int current = 0;
    bool good = true;
    for (int i = L; i <= R; i++) {
      current = max(current, W[i]);
      if (W[i] < current) {
        if (W[i] + current > K) {
          good = false;
        }
      }
    }
    cout << int(good) << "\n";
  }
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 7 ms 616 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 12 ms 348 KB Output is correct
17 Correct 10 ms 348 KB Output is correct
18 Correct 20 ms 344 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1831 ms 836 KB Output is correct
2 Execution timed out 3080 ms 2232 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 7 ms 616 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 12 ms 348 KB Output is correct
17 Correct 10 ms 348 KB Output is correct
18 Correct 20 ms 344 KB Output is correct
19 Execution timed out 3058 ms 5460 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 7 ms 616 KB Output is correct
15 Correct 8 ms 604 KB Output is correct
16 Correct 12 ms 348 KB Output is correct
17 Correct 10 ms 348 KB Output is correct
18 Correct 20 ms 344 KB Output is correct
19 Execution timed out 3038 ms 4184 KB Time limit exceeded
20 Halted 0 ms 0 KB -