Submission #898093

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
898093	2024-01-04T09:55:05 Z	vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3000 ms	4188 KB

sortbooks

#include<bits/stdc++.h>
using namespace std;

#define endl '\n'

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
  int n,q; cin>>n>>q;
  vector<int> v(n); for(int& i : v) cin>>i;
  while(q--){
  	int l,r,k; cin>>l>>r>>k; l--; r--;
  	int mx = 0;
  	for(int i = l; i <= r; i++){
  		for(int j = i+1; j<=r; j++){
  			if(v[i] > v[j]) mx = max(mx,v[i] + v[j]); // ill have to swap them
  		}
  	}
  	if(mx > k) cout<<0<<endl;
  	else cout<<1<<endl;
  }
}

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	21 ms	452 KB	Output is correct
7	Correct	21 ms	452 KB	Output is correct
8	Correct	27 ms	344 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	23 ms	348 KB	Output is correct

Subtask #2

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	21 ms	452 KB	Output is correct
7	Correct	21 ms	452 KB	Output is correct
8	Correct	27 ms	344 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	23 ms	348 KB	Output is correct
11	Correct	1038 ms	596 KB	Output is correct
12	Execution timed out	3040 ms	348 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3058 ms	4188 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	3028 ms	856 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	21 ms	452 KB	Output is correct
7	Correct	21 ms	452 KB	Output is correct
8	Correct	27 ms	344 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	23 ms	348 KB	Output is correct
11	Correct	1038 ms	596 KB	Output is correct
12	Execution timed out	3040 ms	348 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	21 ms	452 KB	Output is correct
7	Correct	21 ms	452 KB	Output is correct
8	Correct	27 ms	344 KB	Output is correct
9	Correct	8 ms	348 KB	Output is correct
10	Correct	23 ms	348 KB	Output is correct
11	Correct	1038 ms	596 KB	Output is correct
12	Execution timed out	3040 ms	348 KB	Time limit exceeded
13	Halted	0 ms	0 KB	-