Submission #1071330

#TimeUsernameProblemLanguageResultExecution timeMemory
1071330vjudge1Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
0 / 100
3026 ms22096 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define pb push_back #define sz(x) x.size() #define nl '\n' #define F first #define S second const int N = 1e6 + 1; const int inf = 1e18; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, q; cin >>n >>q; int a[n + 1]; for( int i = 1; i <= n; ++i ) cin >>a[i]; while( q-- ) { int l, r, k; bool ch = false; cin >>l >>r >>k; pair<int, int>v[r - l + 1]; for( int i = l; i <= r; ++i ) v[i - l] = {a[i], i - l}; sort(v, v + r - l + 1); for( int i = 0; i < r - l; ++i ) if( v[i].F + v[i + 1].F > k && v[i].S > v[i + 1].S ) { cout <<0 <<nl; ch = true; break; } if( !ch ) cout <<1 <<nl; } }
#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...