제출 #959795

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959795		pcc	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	0 / 100	83 ms	21648 KiB

sortbooks

#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;
}

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