oj.uz

Submission #598949

# Submission time Handle Problem Language Result Execution time Memory
598949 2022-07-19T08:19:24 Z Plurm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
17 / 100
 3000 ms 20668 KB 
#include <bits/stdc++.h>
using namespace std;

int w[1000005];

int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  stack<int> stk;
  vector<pair<int, int>> interesting;
  for (int i = 1; i <= n; i++) {
    scanf("%d", w + i);
    while (!stk.empty() && w[stk.top()] <= w[i])
      stk.pop();
    if (!stk.empty())
      interesting.push_back({stk.top(), i});
    stk.push(i);
  }
  while (!stk.empty())
    stk.pop();
  for (int i = n; i > 0; i--) {
    while (!stk.empty() && w[stk.top()] >= w[i])
      stk.pop();
    if (!stk.empty())
      interesting.push_back({i, stk.top()});
    stk.push(i);
  }
  for (int i = 0; i < m; i++) {
    int l, r, k;
    scanf("%d%d%d", &l, &r, &k);
    bool counter = false;
    for (auto p : interesting) {
      if (w[p.first] + w[p.second] > k && l <= p.first && p.second <= r) {
        counter = true;
        break;
      }
    }
    if (counter)
      printf("0\n");
    else
      printf("1\n");
  }
  return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d", w + i);
      |     ~~~~~^~~~~~~~~~~~~
sortbooks.cpp:30:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     scanf("%d%d%d", &l, &r, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 13 ms 540 KB Output is correct
13 Correct 16 ms 540 KB Output is correct
14 Correct 26 ms 468 KB Output is correct
15 Correct 26 ms 548 KB Output is correct
16 Correct 9 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 9 ms 432 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3030 ms 20668 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 3050 ms 2788 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 13 ms 540 KB Output is correct
13 Correct 16 ms 540 KB Output is correct
14 Correct 26 ms 468 KB Output is correct
15 Correct 26 ms 548 KB Output is correct
16 Correct 9 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 9 ms 432 KB Output is correct
19 Execution timed out 3095 ms 5308 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 13 ms 540 KB Output is correct
13 Correct 16 ms 540 KB Output is correct
14 Correct 26 ms 468 KB Output is correct
15 Correct 26 ms 548 KB Output is correct
16 Correct 9 ms 392 KB Output is correct
17 Correct 10 ms 340 KB Output is correct
18 Correct 9 ms 432 KB Output is correct
19 Execution timed out 3030 ms 20668 KB Time limit exceeded
20 Halted 0 ms 0 KB -