Submission #341843

#	Time	Username	Problem	Language	Result	Execution time	Memory
341843		Redhood	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	8 / 100	3098 ms	4332 KiB

sortbooks

#include<bits/stdc++.h>
#define fi first
#define se second
#define len(x) (int)(x).size()
#define pb push_back
#define p2(x) (x)*(x)
#define all(x) (x).begin() , (x).end()
#define mkp make_pair


//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("-O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long double ld;
typedef long long ll;


signed main()
{
    int n , m;cin >> n >> m;
    vector < int > w(n);
    for(auto &i  : w)
        cin >> i;
    for(int qq = 0; qq < m; ++qq){
        int l , r , k;
        cin >> l >> r >> k;
        --l , --r;
        bool bad = 0;
        for(int j = l; j <= r; ++j){
            for(int more = j + 1; more <= r; ++more){
                if(w[more] < w[j]){
                    if(w[more] + w[j] > k)
                        bad = 1;
                }
            }
        }
        if(!bad)
            cout << 1;
        else
            cout << 0;
        cout << '\n';
    }
    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