oj.uz

Submission #569654

# Submission time Handle Problem Language Result Execution time Memory
569654 2022-05-27T15:17:45 Z SSRS Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
 3000 ms 14192 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> w(N);
  for (int i = 0; i < N; i++){
    cin >> w[i];
  }
  for (int i = 0; i < M; i++){
    int l, r, k;
    cin >> l >> r >> k;
    l--;
    int mx = 0;
    for (int x = l; x < r; x++){
      for (int y = x + 1; y < r; y++){
        if (w[x] > w[y]){
          mx = max(mx, w[x] + w[y]);
        }
      }
    }
    if (mx <= k){
      cout << 1 << endl;
    } else {
      cout << 0 << endl;
    }
  }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 2 ms 300 KB Output is correct
6 Correct 39 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 39 ms 212 KB Output is correct
9 Correct 17 ms 304 KB Output is correct
10 Correct 37 ms 212 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 2 ms 300 KB Output is correct
6 Correct 39 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 39 ms 212 KB Output is correct
9 Correct 17 ms 304 KB Output is correct
10 Correct 37 ms 212 KB Output is correct
11 Correct 1524 ms 364 KB Output is correct
12 Execution timed out 3028 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 2 ms 300 KB Output is correct
6 Correct 39 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 39 ms 212 KB Output is correct
9 Correct 17 ms 304 KB Output is correct
10 Correct 37 ms 212 KB Output is correct
11 Correct 1524 ms 364 KB Output is correct
12 Execution timed out 3028 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 3 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 2 ms 300 KB Output is correct
6 Correct 39 ms 212 KB Output is correct
7 Correct 31 ms 212 KB Output is correct
8 Correct 39 ms 212 KB Output is correct
9 Correct 17 ms 304 KB Output is correct
10 Correct 37 ms 212 KB Output is correct
11 Correct 1524 ms 364 KB Output is correct
12 Execution timed out 3028 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -