Submission #344210

#	Time	Username	Problem	Language	Result	Execution time	Memory
344210		Rakhmand	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++14	0 / 100	3076 ms	4844 KiB

sortbooks

//
//  A.cpp
//  torelax
//
//  Created by Rakhman on 1/5/21.
//
 
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <iterator>
 
#define ios ios_base::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define S second
#define F first
#define pb push_back
#define nl '\n'
#define NL cout << '\n';
#define EX exit(0)
#define all(s) s.begin(), s.end()
#define no_answer {cout << "NO"; exit(0);}
#define FOR(i, start, finish, k) for(llong i = start; i <= finish; i += k)
 
const long long mxn = 1e6 + 110;
const long long mnn = 1e3 + 2;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
const long long OO = 1e9;
 
typedef long long llong;
typedef unsigned long long ullong;
 
using namespace std;
 
int n, m, mx[mxn], baskan[mxn], wegol[mxn];
int b[mxn];
int sq = 448;
vector<int> v[501];
 
int main() {
    cin >> n >> m;
    for(int i = 0; i < n; i++){
        cin >> b[i];
        v[i / sq].push_back(b[i]);
    }
    for(int i = 0; i <= (n - 1) / sq; i++){
        for(int j = 0; j < v[i].size(); j++){
            if(baskan[i] > v[i][j]){
                mx[i] = max(mx[i], baskan[i] + v[i][j]);
            }
            baskan[i] = max(baskan[i], v[i][j]);
            wegol[i] = min(wegol[i], v[i][j]);
        }
        sort(v[i].begin(), v[i].end());
    }
    for(int i = 1; i <= m; i++){
        int l, r, x, batkya = 0;
        cin >> l >> r >> x;
        l--, r--;
        int ans = 0;
        for( ; l <= r; ){
            if(l % sq == 0 && l + sq - 1 <= r){
                ans = max(ans, mx[l / sq]);
                if(batkya > baskan[l / sq]) ans = max(ans, batkya + baskan[l / sq]);
                else {
                    int l = 0, r = v[l / sq].size() - 1;
                    while(r - l > 1){
                        int m = (l + r) / 2;
                        if(batkya > v[l / sq][m]){
                            l = m;
                        }else{
                            r = m;
                        }
                    }
                    int lol = 0;
                    if(batkya >= v[l / sq][r]) lol = r;
                    else if(batkya >= v[l / sq][l]) lol = l;
                    else lol = -OO;
                    ans = max(ans, batkya + lol);
                    l += sq;
                }
                batkya = max(batkya, baskan[l / sq]);
            }else{
                if(batkya > b[l - 1]){
                    ans = max(ans, batkya + b[l - 1]);
                }
                batkya = max(batkya, b[l - 1]);
                l++;
            }
        }
        if(ans > x){
            cout << 0;
        }else{
            cout << 1;
        }
        cout << nl;
    }
    
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:65:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for(int j = 0; j < v[i].size(); j++){
      |                        ~~^~~~~~~~~~~~~

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