oj.uz

Submission #928219

# Submission time Handle Problem Language Result Execution time Memory
928219 2024-02-16T05:10:18 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 8024 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 = 1000, mod = 1e9 + 7;

void solve(){
  int n , q;
  cin >> n >> q;
  int a[n + 5];
  for(int i = 1;i <= n;i++) cin >> a[i];
  while(q--){
    int l , r , k;
    cin >> l >> r >> k;
    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 15 ms 344 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 23 ms 600 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 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 15 ms 344 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 23 ms 600 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 657 ms 692 KB Output is correct
12 Execution timed out 3038 ms 468 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 3041 ms 8024 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 3032 ms 1112 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 15 ms 344 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 23 ms 600 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 657 ms 692 KB Output is correct
12 Execution timed out 3038 ms 468 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 15 ms 344 KB Output is correct
7 Correct 14 ms 348 KB Output is correct
8 Correct 23 ms 600 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 23 ms 348 KB Output is correct
11 Correct 657 ms 692 KB Output is correct
12 Execution timed out 3038 ms 468 KB Time limit exceeded
13 Halted 0 ms 0 KB -