# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928215 | 2024-02-16T05:02:40 Z | vjudge1 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3000 ms | 45732 KB |
#include <bits/stdc++.h> #define S second #define F first #define sz size() #define int long long #define pb push_back #define all(x) x.begin(),x.end() #define yes "YES\n" #define no "NO\n" #define ent "\n" #define give_me_more_speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; const int maxn = 1000, mod = 1e9 + 7; void solve(){ int n , q; cin >> n >> q; int a[n + 5]; for(int i = 1;i <= n;i++) cin >> a[i]; while(q--){ int l , r , k; cin >> l >> r >> k; vector <int> ans; int ok = 1; vector <pair <int , int>> v; int cur = 0; for(int i = l;i <= r;i++){ ans.pb(a[i]); v.pb({a[i] , cur}); cur++; } sort(all(v)); for(int i = 0;i < v.size();i++){ int mx = 0; for(int j = 0;j < v[i].S;j++){ mx = max(mx , ans[j]); } // cout<<mx<<ent; if(mx + v[i].F > k){ ok = 0;break; } ans[v[i].S] = 0; } cout<<ok<<ent; } } signed main(){ give_me_more_speed int t = 1; //cin>>t; for(int i = 1;i <= t;i++){ solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3061 ms | 45732 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3042 ms | 3472 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Incorrect | 1 ms | 348 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |