Submission #890035

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
890035	2023-12-20T11:23:22 Z	vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	13 / 100	410 ms	41648 KB

sortbooks

#include <bits/stdc++.h>
#define ll long long
#define fort(x , y) for(int y = 1 ; y <= x ; y++)
#define pb push_back
#define pf push_front
#define ppb pop_back
#define int long long
#define F first
#define S second
using namespace std;
const int N = 1e6 + 5;
const int NN = 1e9 + 7;
int n,m,a[N],k[N],l[N],r[N],s[N],cnt;
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
	}
	cnt = 1;
	for(int i = 1 ; i < n ; i++){
		if(a[i] <= a[i + 1]){
			s[i] = cnt;
			s[i + 1] = cnt;  
		}
		else{
			cnt++;
		}
	}
	for(int j = 1 ; j <= m ; j++){
		cin >> l[j] >> r[j] >> k[j];
		if(l[j] == r[j]){
			cout << 1 << '\n';
			continue;
		}
		bool ok = 0;
		if(s[l[j]] == s[r[j]] && s[l[j]] != 0){
			ok = 1;
		}
		if(ok){
			cout << 1 << '\n';
		}
		else{
			cout << 0 << '\n';
		}
	}

}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	8540 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	372 ms	41504 KB	Output is correct
2	Correct	358 ms	41648 KB	Output is correct
3	Correct	397 ms	41560 KB	Output is correct
4	Correct	410 ms	41544 KB	Output is correct
5	Correct	349 ms	41556 KB	Output is correct