oj.uz

Submission #573435

# Submission time Handle Problem Language Result Execution time Memory
573435 2022-06-06T15:30:38 Z MohammadAghil Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 790 ms 56280 KB 
      #include <bits/stdc++.h>
//   #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
    using namespace std;
  typedef long long ll;
   typedef pair<int, int> pp;
    #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
      #define per(i,r,l) for(int i = (r); i >= (l); i--)
        #define rep(i,l,r) for(int i = (l); i < (r); i++)
           #define all(x) x.begin(), x.end()
              #define sz(x) (int)(x).size()
                  #define pb push_back
                      #define ss second
                           #define ff first
                                   void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 1e9 + 7, maxn = 1e6 + 5, lg = 22, lng = 26, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}

int fen[maxn], n;
void upd(int i, int k){
     for(i++; i <= n; i += i&-i) fen[i] = max(fen[i], k);
}
int get(int i){
     int res = -1;
     for(i++; i; i -= i&-i) res = max(res, fen[i]);
     return res;
}

int main(){
     cin.tie(0) -> sync_with_stdio(0);
     int q; cin >> n >> q;
     vector<int> w(n);
     rep(i,0,n){
          cin >> w[i];
     }
     struct tr{
          int r, id, k;
     };
     vector<vector<tr>> query(n);
     rep(i,0,q){
          int l, r, k; cin >> l >> r >> k; l--;
          query[l].pb({r, i, k});
     }
     fill(fen, fen+n+1, -1);
     vector<int> st;
     vector<bool> ans(q);
     per(i,n-1,0){
          while(sz(st) && w[st.back()] < w[i]){
               upd(st.back(), w[st.back()] + w[i]);
               st.pop_back();
          }
          st.pb(i);
          for(auto[r, id, k]: query[i]){
               ans[id] = get(r) <= k;
          }
     }
     for(auto c: ans) cout << c << '\n';
     return 0; 
}

/*
5 2
3 5 1 8 2
1 3 6
2 5 3
*/

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:54:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |           for(auto[r, id, k]: query[i]){
      |                   ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

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

Subtask #6
0 / 23.0

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