| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345520 | prince | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++20 | 805 ms | 36744 KiB |
#include "bits/stdc++.h"
using namespace std;
int main(){
#ifdef whymagic
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,m;
cin >> n >> m;
vector<int>a(n);
for(auto &x : a)cin >> x;
set<pair<int,int>>st;
int i = 0;
while(i < n){
int j = i;
while (j + 1 < n && a[j+1] >= a[j])j ++;
st.emplace(i,j);
i = j + 1;
}
for(auto [l,r] : st)cout << l << ' ' << r << '\n';
while(m--){
int l,r,x;
cin >> l >> r >> x;
l--,r--;
auto it = st.upper_bound({l,1e9});
int ok;
if(it != st.begin()){
it --;
auto [L,R] = *it;
ok = (L <= l && r <= R);
} else ok = 0;
cout << ok << '\n';
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
