제출 #1344840

#제출 시각아이디문제언어결과실행 시간메모리
1344840ahmetlbktd4Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++20
0 / 100
3095 ms8268 KiB
#include "bits/stdc++.h"
using namespace std;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,m;
    cin >> n >> m;
    vector <int> a(n);
    for (int i = 0;i < n;i++){
        cin >> a[i];
    }
    while (m--){
        int l,r,w;
        cin >> l >> r >> w;
        l--;r--;
        vector <int> b(n);
        b = a;
        bool f = 1;  
        for (int j = 0;j < n-1 && f;j++){
            for (int i = l;i < r && f;i++){
                if (b[i] + b[i+1] > w && b[i] > b[i+1]){
                    f = 0;break;
                }
                if (b[i] > b[i+1] && b[i]+b[i+1] <= w)
                swap(b[i],b[i+1]);
            }

        }
        bool b1 = 1;
        if (is_sorted(b.begin()+l,b.begin()+r))
        b1 = 1;
        else b1 = 0;
        cout << b1 << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...