Submission #1094009

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1094009	2024-09-28T09:01:34 Z	KasymK	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	362 ms	39040 KB

sortbooks

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e6+5;
int par[N];

int main(){
    int n, q;
    scanf("%d%d", &n, &q);
    int prev = 0;
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        par[i] = par[i-1]+(x<prev);
        prev = x;
    }
    while(q--){
        int l, r, k;
        scanf("%d%d%d", &l, &r, &k);
        if(par[r]-par[l] == 0)
            puts("1");
        else
            puts("0");
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
sortbooks.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d%d%d", &l, &r, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #3
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	280 ms	37968 KB	Output is correct
2	Correct	287 ms	39040 KB	Output is correct
3	Correct	362 ms	39024 KB	Output is correct
4	Correct	322 ms	38968 KB	Output is correct
5	Correct	291 ms	39040 KB	Output is correct