제출 #950239

#제출 시각아이디문제언어결과실행 시간메모리
950239nguyennhHedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++14
8 / 100
87 ms14148 KiB
#include<bits/stdc++.h> #define el '\n' using namespace std ; mt19937 rd(chrono::steady_clock::now().time_since_epoch().count()); const int MN = 1e6 + 5; int n , m , a[MN]; namespace sub_trau{ bool valid_input(){ return n <= 500 && m <= 500; } void solve(){ while(m--){ int l , r , k; cin >> l >> r >> k; int ans = 0; for ( int i = l ; i <= r ; i++ ){ for ( int j = i ; j <= r ; j++ ){ if (a[j] < a[i]) ans = max(ans , a[j] + a[i]); } } cout << (ans <= k ? 1 : 0) << el; } } } int32_t main (){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> m; for ( int i = 1 ; i <= n ; i++ ) cin >> a[i]; if (sub_trau::valid_input()){ sub_trau::solve(); return 0; } }
#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...