oj.uz

Submission #497459

# Submission time Handle Problem Language Result Execution time Memory
497459 2021-12-23T06:17:20 Z ergagan Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 1140 ms 22488 KB 
//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
#define pll pair<ll,ll>


//17 SEVENTEEN
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;

const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, a[N], b[N];

void solve() {
    ll n, q;
    cin >> n >> q;
    for(ll i = 1; i <= n; i++) {
        cin >> a[i];
    }
    if(n <= M) {
        while(q--) {
            ll l, r, k;
            cin >> l >> r >> k;

            ll ok = 1;
            set<ll> st;
            st.insert(a[l]);
            for(ll i = l + 1; i <= r; i++) {
                if(*st.rbegin() > a[i] && *st.rbegin() + a[i] > k) { ok = 0; break; }
                st.insert(a[i]);
            }

            cout << ok << "\n";
        }
        return;
    }
    while(q--) {
        ll l, r, k;
        cin >> l >> r >> k;
        cout << is_sorted(a + l, a + (r - l + 1) + 1) << "\n";
    }
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 456 KB Output is correct
12 Correct 6 ms 568 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 15 ms 708 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 1140 ms 704 KB Output is correct
17 Correct 1040 ms 644 KB Output is correct
18 Correct 68 ms 440 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 527 ms 22488 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 3396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 456 KB Output is correct
12 Correct 6 ms 568 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 15 ms 708 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 1140 ms 704 KB Output is correct
17 Correct 1040 ms 644 KB Output is correct
18 Correct 68 ms 440 KB Output is correct
19 Incorrect 100 ms 8872 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 10 ms 332 KB Output is correct
9 Correct 6 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 5 ms 456 KB Output is correct
12 Correct 6 ms 568 KB Output is correct
13 Correct 6 ms 584 KB Output is correct
14 Correct 15 ms 708 KB Output is correct
15 Correct 9 ms 596 KB Output is correct
16 Correct 1140 ms 704 KB Output is correct
17 Correct 1040 ms 644 KB Output is correct
18 Correct 68 ms 440 KB Output is correct
19 Incorrect 527 ms 22488 KB Output isn't correct
20 Halted 0 ms 0 KB -