Submission #883325

#TimeUsernameProblemLanguageResultExecution timeMemory
883325AI_2512Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)C++17
8 / 100
3093 ms72760 KiB
#include <bits/stdc++.h>

using namespace std;

int main() {
    long long n,m;
    cin >> n >> m;
    vector<int> books(n);
    vector<vector<int>> days(m,vector<int>(3));
    for (int i = 0; i <n; i++){
        cin >> books[i];
    }
    for (int i = 0; i<m; i++){
        int l,r,ki;
        cin >> l >> r >> ki;
        vector<int> vec(books.begin()+l-1, books.begin()+r);
        bool broken = false;
        for (int k = 0;k < vec.size()-1;k++){
            if (vec[k] > vec[k+1]){
                if (vec[k]+vec[k+1] <= ki){
                    swap(vec[k], vec[k+1]);
                }else{
                    broken = true;
                    break;
                }
            }
            if (is_sorted(vec.begin(), vec.end())){
                break;
            }
        }
        if (broken){
            cout << 0 << "\n";
        }else{
            cout << 1 << "\n";
        }
    }
    return 0;
}

Compilation message (stderr)

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:18:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for (int k = 0;k < vec.size()-1;k++){
      |                        ~~^~~~~~~~~~~~~~
#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...