oj.uz

답안 #598947

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
598947 2022-07-19T08:18:46 Z Plurm Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++11
0 / 100
 3000 ms 20696 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 (p.first + 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
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -