Submission #959795

# Submission time Handle Problem Language Result Execution time Memory
959795 2024-04-09T06:07:25 Z pcc Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
83 ms 21648 KB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>

const int mxn = 2e5+10;
vector<pii> op[mxn];
int arr[mxn];
int N,Q;
bitset<mxn> ans;

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>N>>Q;
	for(int i = 1;i<=N;i++){
		cin>>arr[i];
	}
	for(int i = 1;i<=Q;i++){
		int s,e,k;
		cin>>s>>e>>k;
		op[e].push_back(pii(s,i));
	}
	int pre = 0;
	for(int i = 1;i<=N;i++){
		if(arr[i]<arr[i-1])pre = i;
		for(auto &j:op[i]){
			ans[j.sc] = (pre>j.fs?0:1);
		}
	}
	for(int i = 1;i<=Q;i++){
		cout<<ans[i]<<'\n';
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5980 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5980 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 21648 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 9992 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5980 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 5980 KB Output isn't correct
2 Halted 0 ms 0 KB -