Submission #889805

#	Time	Username	Problem	Language	Result	Execution time	Memory
889805		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	3068 ms	10408 KiB

sortbooks

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
    int N, M;
    cin >> N >> M;
    vector<int> weights(N);
    for (int i = 0; i < N; ++i) {
        cin >> weights[i];
    }
    for (int day = 0; day < M; ++day) {
        int l, r, k;
        cin >> l >> r >> k;
	    vector<int> subarray(weights.begin() + l - 1, weights.begin() + r);
        sort(subarray.begin(), subarray.end());
        bool possible = true;
        for (int i = 0; i < subarray.size() - 1; ++i) {
            if (subarray[i + 1] - subarray[i] > k) {
                possible = false;
                break;
            }
        }
        cout << (possible ? 1 : 0) << endl;
    }
}

Compilation message (stderr)

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

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