oj.uz

Submission #154571

# Submission time Handle Problem Language Result Execution time Memory
154571 2019-09-22T18:09:33 Z hentai_lover Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
30 / 100
 741 ms 117496 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define lft(x) x * 2
#define rgt(x) x * 2 + 1

#define tm hui_pizda
#define ft first
#define sd second
#define pb push_back
#define pf push_front
#define sz size()
#define cnt continue
#define m_p make_pair
#define fr(i, l, r) for(int i = l; i <= r; ++ i)
#define rf(i, r, l) for(int i = r; i >= l; -- i)
#pragma GCC optimize(-O3)
#pragma GCC optimize(Ofast)
#pragma GCC optimize("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using _set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef vector <int> vi;
typedef vector <ll> vl;
typedef vector <pii> vpi;
typedef vector <pll> vpl;

mt19937_64 rnd(time(NULL));

const ll N = 1e6 + 10;
const ll mtrxN = 10;
const ll oo = 1e18 + 10;
//const ll oo = 228;
const ll B = 500;
const ll mod = 1e9 + 7;

struct mtrx{
    ll m[mtrxN][mtrxN] = {};
};
mtrx mtrx_mult(mtrx a, mtrx b){
    mtrx c;
    fr(i, 0, mtrxN - 1){
        fr(j, 0, mtrxN - 1){
            ll sum = 0;
            fr(x, 0, mtrxN - 1){
                sum += a.m[i][x] * b.m[x][j];
                sum %= mod;
            }
            c.m[i][j] = sum;
        }
    }
    return c;
}
mtrx mtrx_pow(mtrx a, ll n){
    mtrx res;
    fr(i, 0, mtrxN - 1)fr(j, 0, mtrxN - 1)res.m[i][j] = a.m[i][j];
    n --;
    while(n){
        if(n&1)res = mtrx_mult(res, a);
        a = mtrx_mult(a, a);
        n >>= 1;
    }
    return res;
}
ll _pow(ll a, ll n){
    ll r = 1;
    while(n){
        if(n&1)r = r * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return r;
}
ll div(ll x, ll y, ll md){
    return x * _pow(y, md - 2) % md;
}

ll a[1000001], p[1000001];
ll ans[5001][5001];

int main(){
    ios_base::sync_with_stdio(0), cin.tie(0);
    ll n, Q;
    cin >> n >> Q;
    fr(i, 1, n)cin >> a[i];
    if(n <= 5000 && Q <= 5000){
        fr(i, 1, n){
            ll mx = -oo, mx_k = 0;
            fr(j, i, n){
                mx = max(mx, a[j]);
                if(mx > a[j])mx_k = max(mx_k, a[j] + mx);
                ans[i][j] = mx_k;
            }
        }
        fr(e, 1, Q){
            ll l, r, k;
            cin >> l >> r >> k;
            if(ans[l][r] <= k)cout << 1 << "\n";
            else cout << 0 << "\n";
        }
        return 0;
    }
    fr(i, 1, n - 1){
        p[i] = p[i - 1];
        if(a[i] > a[i + 1])p[i] ++;
    }

    fr(e, 1, Q){
        ll l, r, k;
        //cin >> l >> r;
        cin >> l >> r >> k;
        if(l == r)cout << 1 << "\n";
        else if(p[l - 1] == p[r - 1])cout << 1 << "\n";
        else cout << 0 << "\n";
    }

    return 0;
}
/*
строки +
столбцы -

4 6
1 2 3 1
1 2
1 3
1 4
2 3
2 4
3 4
*/

Compilation message

sortbooks.cpp:17:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(-O3)
                      ^
sortbooks.cpp:18:22: warning: '#pragma GCC optimize' is not a string or number [-Wpragmas]
 #pragma GCC optimize(Ofast)
                      ^~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 5 ms 3320 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3320 KB Output is correct
9 Correct 4 ms 1592 KB Output is correct
10 Correct 5 ms 3420 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 5 ms 3320 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3320 KB Output is correct
9 Correct 4 ms 1592 KB Output is correct
10 Correct 5 ms 3420 KB Output is correct
11 Correct 16 ms 14328 KB Output is correct
12 Correct 106 ms 112092 KB Output is correct
13 Correct 107 ms 111808 KB Output is correct
14 Correct 114 ms 117372 KB Output is correct
15 Correct 115 ms 117496 KB Output is correct
16 Correct 104 ms 117496 KB Output is correct
17 Correct 74 ms 82672 KB Output is correct
18 Correct 112 ms 117480 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 722 ms 19388 KB Output is correct
2 Correct 732 ms 50884 KB Output is correct
3 Correct 728 ms 50712 KB Output is correct
4 Correct 723 ms 50936 KB Output is correct
5 Correct 741 ms 50968 KB Output is correct

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 5 ms 3320 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3320 KB Output is correct
9 Correct 4 ms 1592 KB Output is correct
10 Correct 5 ms 3420 KB Output is correct
11 Correct 16 ms 14328 KB Output is correct
12 Correct 106 ms 112092 KB Output is correct
13 Correct 107 ms 111808 KB Output is correct
14 Correct 114 ms 117372 KB Output is correct
15 Correct 115 ms 117496 KB Output is correct
16 Correct 104 ms 117496 KB Output is correct
17 Correct 74 ms 82672 KB Output is correct
18 Correct 112 ms 117480 KB Output is correct
19 Incorrect 147 ms 5160 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 1400 KB Output is correct
6 Correct 5 ms 3320 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 5 ms 3320 KB Output is correct
9 Correct 4 ms 1592 KB Output is correct
10 Correct 5 ms 3420 KB Output is correct
11 Correct 16 ms 14328 KB Output is correct
12 Correct 106 ms 112092 KB Output is correct
13 Correct 107 ms 111808 KB Output is correct
14 Correct 114 ms 117372 KB Output is correct
15 Correct 115 ms 117496 KB Output is correct
16 Correct 104 ms 117496 KB Output is correct
17 Correct 74 ms 82672 KB Output is correct
18 Correct 112 ms 117480 KB Output is correct
19 Correct 722 ms 19388 KB Output is correct
20 Correct 732 ms 50884 KB Output is correct
21 Correct 728 ms 50712 KB Output is correct
22 Correct 723 ms 50936 KB Output is correct
23 Correct 741 ms 50968 KB Output is correct
24 Incorrect 56 ms 3320 KB Output isn't correct
25 Halted 0 ms 0 KB -