oj.uz

Submission #931793

# Submission time Handle Problem Language Result Execution time Memory
931793 2024-02-22T10:58:14 Z Aiperiii Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
8 / 100
 3000 ms 17204 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,q;
    cin>>n>>q;
    vector <int> a(n+1);
    for(int i=1;i<=n;i++)cin>>a[i];
    while(q--){
        int l,r,x;
        cin>>l>>r>>x;
        vector <int> v;
        for(int i=l;i<=r;i++)v.pb(a[i]);
        bool ok=1;
        for(int i=v.size()-1;i>=0;i--){
            for(int j=v.size()-1;j>i;j--){
                if(v[i]>v[j]){
                    if(x<v[i]+v[j])ok=0;
                }
            }
        }
        cout<<ok<<"\n";
    }
}
/*
5 2
3 5 1 8 2
1 3 6
2 5 3
 
7 1
2 8 9 8 10 3 1
1 7 12
 2 8 9 8 10 1 3
 2 8 9 8 1 3 10
 2 8 9 1 3 8 10
 2 8 1 3 8 9 10
 2 1 3 8 8 9 10
 1 2 3 8 8 9 10
 */

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 19 ms 348 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 26 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 444 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 19 ms 348 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 26 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 444 KB Output is correct
11 Correct 960 ms 460 KB Output is correct
12 Execution timed out 3030 ms 516 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 3015 ms 17204 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 3045 ms 1752 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 19 ms 348 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 26 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 444 KB Output is correct
11 Correct 960 ms 460 KB Output is correct
12 Execution timed out 3030 ms 516 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 19 ms 348 KB Output is correct
7 Correct 19 ms 344 KB Output is correct
8 Correct 26 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 444 KB Output is correct
11 Correct 960 ms 460 KB Output is correct
12 Execution timed out 3030 ms 516 KB Time limit exceeded
13 Halted 0 ms 0 KB -