Submission #544879

#	Time	Username	Problem	Language	Result	Execution time	Memory
544879		BackNoob	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3089 ms	5996 KiB

sortbooks

#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1)
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 998244353;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;

template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

int n, q;
int a[mxN];
bool vis[mxN];

void solve()
{
    cin >> n >> q;
    for(int i = 1 ; i <= n ; i++) cin >> a[i];

    while(q--) {
        int l, r, c;
        cin >> l >> r >> c;

        vector<int> val;
        for(int i = l ; i <= r ; i++) val.pb(a[i]);
        sort(all(val));

        for(int i = l ; i <= r ; i++) vis[i] = false;
        bool ok = true;
        for(auto it : val) {
            int mx = -inf;
            for(int i = l ; i <= r ; i++) {
                if(vis[i] == true) continue;
                if(a[i] == it) {
                    vis[i] = true;
                    break;
                }
                maximize(mx , a[i]);
            }
            if(it + mx > c) ok = false;
        }
        if(ok) cout << 1 << endl;
        else cout << 0 << endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".inp" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);

    int tc = 1;
    //cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23