oj.uz

Submission #928207

# Submission time Handle Problem Language Result Execution time Memory
928207 2024-02-16T04:45:17 Z vjudge1 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
0 / 100
 3000 ms 29220 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;
    vector <int> ans , v;
    for(int i = l;i <= r;i++){
      ans.pb(a[i]);
      v.pb(a[i]);
    }
    sort(all(v));
    int ok = 1;
    vector <int> res;
    for(int i = 0;i < v.size();i++){
      int pos = 0;
      int cnt = 0;
      while(v[i] != ans[pos]){
        if(v[i] + ans[pos] > k){
          ok = 0;
        }
        if(v[i] > ans[pos]){
          cnt++;
        }
        pos++;
      }
      if(ok == 1){
        res.pb(ans[pos]);
        ans[pos] = 0;
      }
      else break;
    }
    if(ok == 1 && is_sorted(all(res))){
      cout<<1<<ent;
    }
    else cout<<0<<ent;
  }
}

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

Compilation message

sortbooks.cpp: In function 'void solve()':
sortbooks.cpp:33:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i = 0;i < v.size();i++){
      |                   ~~^~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3024 ms 29220 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 3018 ms 3700 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -