제출 #483755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
483755		lemonislemon	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	17 / 100	3097 ms	14152 KiB

sortbooks

#include <iostream>
#define INF int(1e9)
using namespace std;
int main() {
  int n, m;
  cin >> n >> m;
  int w[n+1];
  w[0] = 0;
  for(int i = 1; i <= n; ++i) {
    cin >> w[i];
  }
  for(int i = 0; i < m; ++i) {
    int l, r, k;
    cin >> l >> r >> k;
    int wmax = 0;
    int kmin = 0;
    for(int j = l; j <= r; ++j) {
      if(wmax > w[j]) kmin = max(wmax + w[j], kmin);
      else wmax = w[j]; 
    }
    int wmin = INF;
    for(int j = r; j >= l; --j) {
      if(wmin < w[j]) kmin = max(wmin + w[j], kmin);
      else wmin = w[j];
    }
    if(kmin <= k) cout << "1\n";
    else cout << "0\n";
  }
  return 0;
} 

• Subtask 1: 8 / 8
• Subtask 2: 9 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23