oj.uz

Submission #928222

# Submission time Handle Problem Language Result Execution time Memory
928222 2024-02-16T05:17:15 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 18084 KB 
#include <bits/stdc++.h>
#define S second
#define F first
#define sz size()
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define yes "YES\n"
#define no "NO\n"
#define ent "\n"
#define give_me_more_speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

using namespace std;

const int maxn = 1e6 + 5, mod = 1e9 + 7;

int pref[maxn];

int a[maxn];

void solve(){
  int n , q;
  cin >> n >> q;
  for(int i = 1;i <= n;i++){
    cin >> a[i];
    if(i > 1){
      pref[i] = pref[i - 1] + (a[i - 1] <= a[i]);
    }
  }
  int mn = *min_element(a + 1,a + 1 + n);
  // cout<<mn<<ent;
  while(q--){
    int l , r , k;
    cin >> l >> r >> k;
    if(k < mn){
      if(pref[r] - pref[l] == (r - l + 1)){
        cout<<1<<ent;
      }
      else cout<<0<<ent;
      continue;
    }
    int ok = 1;
    for(int i = l + 1;i <= r;i++){
      for(int j = l;j < i;j++){
        if(a[i] + a[j] > k && a[i] < a[j]){
          ok = 0;
        }
      }
    }
    cout<<ok<<ent;
  }
}

signed main(){
  give_me_more_speed
  int t = 1;
  //cin>>t;
  for(int i = 1;i <= t;i++){
      solve();
  }
}

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 20 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 41 ms 472 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 33 ms 348 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 20 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 41 ms 472 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 33 ms 348 KB Output is correct
11 Correct 738 ms 728 KB Output is correct
12 Execution timed out 3023 ms 600 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 377 ms 18084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3046 ms 5208 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 20 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 41 ms 472 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 33 ms 348 KB Output is correct
11 Correct 738 ms 728 KB Output is correct
12 Execution timed out 3023 ms 600 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 20 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 41 ms 472 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 33 ms 348 KB Output is correct
11 Correct 738 ms 728 KB Output is correct
12 Execution timed out 3023 ms 600 KB Time limit exceeded
13 Halted 0 ms 0 KB -