답안 #1071221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071221	2024-08-23T06:01:57 Z	vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	17 / 100	74 ms	8028 KB

sortbooks

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define nn "\n";
const int N = 2e5 + 8  , inf = 1e9+7 ;
int  n , m , q ;
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0);
    cin>> n >> q;
    int w[n+1];
    int mx1 = max(n , q );
    for(int i= 1 ; i <= n; i++){
        cin>> w[i];
    }
    if(mx1 <= 5000){
        while(q--){
            int l , r , k ;
            cin>>l >> r >> k ;
            int mx =w[l] , cnt =0  ;
            for(int i =l+1 ; i <= r ; i++){
                if(w[i]< mx ){
                    cnt = max(cnt , w[i]+mx);
                }
                else mx = w[i];
            }
            if(cnt <= k ){
                cout << 1 << nn
            }
            else cout << 0 << nn
        }
    }
}

Subtask #1

8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	464 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct

Subtask #2

9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	464 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	5 ms	348 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	9 ms	600 KB	Output is correct
15	Correct	8 ms	604 KB	Output is correct
16	Correct	11 ms	604 KB	Output is correct
17	Correct	8 ms	348 KB	Output is correct
18	Correct	11 ms	348 KB	Output is correct

Subtask #3

0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	74 ms	8028 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #4

0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	6 ms	1116 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	464 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	5 ms	348 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	9 ms	600 KB	Output is correct
15	Correct	8 ms	604 KB	Output is correct
16	Correct	11 ms	604 KB	Output is correct
17	Correct	8 ms	348 KB	Output is correct
18	Correct	11 ms	348 KB	Output is correct
19	Incorrect	15 ms	4052 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #6

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	0 ms	460 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	464 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	3 ms	348 KB	Output is correct
12	Correct	5 ms	348 KB	Output is correct
13	Correct	5 ms	600 KB	Output is correct
14	Correct	9 ms	600 KB	Output is correct
15	Correct	8 ms	604 KB	Output is correct
16	Correct	11 ms	604 KB	Output is correct
17	Correct	8 ms	348 KB	Output is correct
18	Correct	11 ms	348 KB	Output is correct
19	Incorrect	74 ms	8028 KB	Output isn't correct
20	Halted	0 ms	0 KB	-