답안 #1071510

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071510 2024-08-23T07:57:25 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
3000 ms 10256 KB
#include <bits/stdc++.h>
#define int long long
#define boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin); freopen(s".out", "w", stdout)
const int N=1e6+1;
const int inf=1e18;
const int mod=1e9+7;
using namespace std;
vector<int>v;
signed main(){
	boost;
	int n,m;
	cin>>n>>m;
	v.push_back(0);
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		v.push_back(x);
	}
	while(m--){
		int l,r,k;
		cin>>l>>r>>k;
		if(l==r){
			cout<<1<<"\n";
			continue;
		}
		int ok=0;
		int mx=0;
		for(int i=l;i<=r;i++){
			if(i!=l){
				if(mx>v[i]&&mx+v[i]>k){
					ok=1;
				}
			}
			mx=max(mx,v[i]);
		}
		if(ok==0){
			cout<<1<<"\n";
		}else{
			cout<<0<<"\n";
		}
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 12 ms 568 KB Output is correct
17 Correct 10 ms 564 KB Output is correct
18 Correct 15 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3090 ms 10256 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1704 ms 1512 KB Output is correct
2 Execution timed out 3036 ms 2760 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 12 ms 568 KB Output is correct
17 Correct 10 ms 564 KB Output is correct
18 Correct 15 ms 344 KB Output is correct
19 Execution timed out 3031 ms 4700 KB Time limit exceeded
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 8 ms 348 KB Output is correct
16 Correct 12 ms 568 KB Output is correct
17 Correct 10 ms 564 KB Output is correct
18 Correct 15 ms 344 KB Output is correct
19 Execution timed out 3090 ms 10256 KB Time limit exceeded
20 Halted 0 ms 0 KB -