제출 #1356646

#제출 시각아이디문제언어결과실행 시간메모리
1356646JohanHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
3094 ms23756 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 5;
const int INF = 1e18;
int l, r, k;
bool cmp(int a, int b){
  if(a + b <= k){
    return a < b;
  }
  return false;
}
signed main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q;
  cin >> n >> q;
  vector < int > a(n);
  for(int &i : a)cin >> i;
  while(q--){
    cin >> l >> r >> k;
    l--, r--;
    vector < int > v;
    for(int i = l; i <= r; i++)
      v.push_back(a[i]);
    sort(v.begin(), v.end(), cmp);
    // for(int i : v)
    //   cout << i << ' ';
    // cout << endl;
    if(is_sorted(v.begin(), v.end()) == true){
      cout << "1" << endl;
      continue;
    }
    cout << "0" << endl;;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...