oj.uz

Submission #210173

# Submission time Handle Problem Language Result Execution time Memory
210173 2020-03-16T18:23:48 Z caoash Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 2456 ms 151672 KB 
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 1000005;
const ld PI = 4*atan((ld)1);
template<class T, int SZ> struct Seg{
  T tree[4*SZ];
  T merge(T a, T b){
    return max(a,b);
  }
  
  void update(int v, int l, int r, int i, T x) {
    if (i > r || i < l) {
      return;
    } else if (l == r) {
      tree[v] = x;
    } else {
      int m = (l + r) / 2;
      update(2 * v + 1, l, m, i, x);
      update(2 * v + 2, m + 1, r, i, x);
      tree[v] = merge(tree[2 * v + 1], tree[2 * v + 2]);
    }
  }
 
  T query(int v, int l, int r, int ql, int qr) {
    if (l > qr || r < ql) {
      return 0;
    } else if (l >= ql && r <= qr) {
      return tree[v];
    } else {
      int m = (l + r) / 2;
      T a = query(2 * v + 1, l, m, ql, qr);
      T b = query(2 * v + 2, m + 1, r, ql, qr);
      return merge(a,b);
    }
  }
};
Seg<int, MX> orz; map<int,int> par; vector<pair<pi,pi>> evts[MX]; bool wk[MX];
int main() {
   setIO();
   int N,M; re(N,M);
   vi a(N);
   fax(i,N) re(a[i]);
   fax(i,N) par[i] = -1;
   stack<pi> stk;
   fax(i,N){
    while(!stk.empty() && stk.top().f <= a[i]){
      stk.pop();
    }
    if(!stk.empty()){
      par[i] = stk.top().s;
    }
    stk.push(mp(a[i], i));
   }
   fax(i,N) {
     if(par[i] == -1) continue;
     evts[i].pb(mp(mp(-1,par[i]),mp(0,0)));
   }
   fax(i,M){
    int l,r,w; re(l,r,w);
    l--; r--;
    evts[r].pb(mp(mp(1,l),mp(w,i)));
   }
   fax(i,N){
    sort(all(evts[i]));
    trav(curr, evts[i]){
      if(curr.f.f == -1){
        orz.update(0,0,N-1,curr.f.s,a[i] + a[curr.f.s]);
        //dbg("UPD",curr.f.s,a[i]+a[curr.f.s]);
      }
      else{
        int mx = orz.query(0,0,N-1,curr.f.s,i);
        wk[curr.s.s] = (mx <= curr.s.f);
        //dbg("QRY",curr.f.s,i,mx);
      }
    }
   }
   fax(i,M){
    pr(wk[i]?1:0, "\n");
   }
}

Compilation message

sortbooks.cpp: In function 'void io::setIn(std::__cxx11::string)':
sortbooks.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'void io::setOut(std::__cxx11::string)':
sortbooks.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23800 KB Output is correct
2 Correct 20 ms 23800 KB Output is correct
3 Correct 20 ms 23800 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 20 ms 23804 KB Output is correct
6 Correct 21 ms 23928 KB Output is correct
7 Correct 21 ms 23928 KB Output is correct
8 Correct 21 ms 23928 KB Output is correct
9 Correct 21 ms 23800 KB Output is correct
10 Correct 20 ms 23928 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23800 KB Output is correct
2 Correct 20 ms 23800 KB Output is correct
3 Correct 20 ms 23800 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 20 ms 23804 KB Output is correct
6 Correct 21 ms 23928 KB Output is correct
7 Correct 21 ms 23928 KB Output is correct
8 Correct 21 ms 23928 KB Output is correct
9 Correct 21 ms 23800 KB Output is correct
10 Correct 20 ms 23928 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 25 ms 24568 KB Output is correct
13 Correct 26 ms 24440 KB Output is correct
14 Correct 27 ms 24568 KB Output is correct
15 Correct 27 ms 24568 KB Output is correct
16 Correct 25 ms 24440 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24484 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2384 ms 147748 KB Output is correct
2 Correct 2421 ms 148476 KB Output is correct
3 Correct 2456 ms 148472 KB Output is correct
4 Correct 2411 ms 148460 KB Output is correct
5 Correct 1655 ms 107640 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 36472 KB Output is correct
2 Correct 174 ms 36216 KB Output is correct
3 Correct 136 ms 32120 KB Output is correct
4 Correct 135 ms 32120 KB Output is correct
5 Correct 139 ms 32120 KB Output is correct
6 Correct 121 ms 32120 KB Output is correct
7 Correct 127 ms 32120 KB Output is correct
8 Correct 153 ms 34408 KB Output is correct
9 Correct 71 ms 26476 KB Output is correct
10 Correct 155 ms 33904 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23800 KB Output is correct
2 Correct 20 ms 23800 KB Output is correct
3 Correct 20 ms 23800 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 20 ms 23804 KB Output is correct
6 Correct 21 ms 23928 KB Output is correct
7 Correct 21 ms 23928 KB Output is correct
8 Correct 21 ms 23928 KB Output is correct
9 Correct 21 ms 23800 KB Output is correct
10 Correct 20 ms 23928 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 25 ms 24568 KB Output is correct
13 Correct 26 ms 24440 KB Output is correct
14 Correct 27 ms 24568 KB Output is correct
15 Correct 27 ms 24568 KB Output is correct
16 Correct 25 ms 24440 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24484 KB Output is correct
19 Correct 425 ms 48760 KB Output is correct
20 Correct 425 ms 48760 KB Output is correct
21 Correct 353 ms 48120 KB Output is correct
22 Correct 349 ms 48120 KB Output is correct
23 Correct 354 ms 48120 KB Output is correct
24 Correct 261 ms 39800 KB Output is correct
25 Correct 265 ms 39800 KB Output is correct
26 Correct 286 ms 39928 KB Output is correct
27 Correct 282 ms 39928 KB Output is correct
28 Correct 288 ms 40056 KB Output is correct
29 Correct 296 ms 40108 KB Output is correct
30 Correct 311 ms 40184 KB Output is correct
31 Correct 302 ms 40184 KB Output is correct
32 Correct 315 ms 40184 KB Output is correct
33 Correct 307 ms 40124 KB Output is correct
34 Correct 264 ms 39420 KB Output is correct
35 Correct 257 ms 39416 KB Output is correct
36 Correct 249 ms 39392 KB Output is correct
37 Correct 253 ms 39416 KB Output is correct
38 Correct 255 ms 39416 KB Output is correct
39 Correct 312 ms 42476 KB Output is correct
40 Correct 224 ms 36712 KB Output is correct
41 Correct 308 ms 43660 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 23800 KB Output is correct
2 Correct 20 ms 23800 KB Output is correct
3 Correct 20 ms 23800 KB Output is correct
4 Correct 20 ms 23800 KB Output is correct
5 Correct 20 ms 23804 KB Output is correct
6 Correct 21 ms 23928 KB Output is correct
7 Correct 21 ms 23928 KB Output is correct
8 Correct 21 ms 23928 KB Output is correct
9 Correct 21 ms 23800 KB Output is correct
10 Correct 20 ms 23928 KB Output is correct
11 Correct 23 ms 24184 KB Output is correct
12 Correct 25 ms 24568 KB Output is correct
13 Correct 26 ms 24440 KB Output is correct
14 Correct 27 ms 24568 KB Output is correct
15 Correct 27 ms 24568 KB Output is correct
16 Correct 25 ms 24440 KB Output is correct
17 Correct 25 ms 24312 KB Output is correct
18 Correct 26 ms 24484 KB Output is correct
19 Correct 2384 ms 147748 KB Output is correct
20 Correct 2421 ms 148476 KB Output is correct
21 Correct 2456 ms 148472 KB Output is correct
22 Correct 2411 ms 148460 KB Output is correct
23 Correct 1655 ms 107640 KB Output is correct
24 Correct 185 ms 36472 KB Output is correct
25 Correct 174 ms 36216 KB Output is correct
26 Correct 136 ms 32120 KB Output is correct
27 Correct 135 ms 32120 KB Output is correct
28 Correct 139 ms 32120 KB Output is correct
29 Correct 121 ms 32120 KB Output is correct
30 Correct 127 ms 32120 KB Output is correct
31 Correct 153 ms 34408 KB Output is correct
32 Correct 71 ms 26476 KB Output is correct
33 Correct 155 ms 33904 KB Output is correct
34 Correct 425 ms 48760 KB Output is correct
35 Correct 425 ms 48760 KB Output is correct
36 Correct 353 ms 48120 KB Output is correct
37 Correct 349 ms 48120 KB Output is correct
38 Correct 354 ms 48120 KB Output is correct
39 Correct 261 ms 39800 KB Output is correct
40 Correct 265 ms 39800 KB Output is correct
41 Correct 286 ms 39928 KB Output is correct
42 Correct 282 ms 39928 KB Output is correct
43 Correct 288 ms 40056 KB Output is correct
44 Correct 296 ms 40108 KB Output is correct
45 Correct 311 ms 40184 KB Output is correct
46 Correct 302 ms 40184 KB Output is correct
47 Correct 315 ms 40184 KB Output is correct
48 Correct 307 ms 40124 KB Output is correct
49 Correct 264 ms 39420 KB Output is correct
50 Correct 257 ms 39416 KB Output is correct
51 Correct 249 ms 39392 KB Output is correct
52 Correct 253 ms 39416 KB Output is correct
53 Correct 255 ms 39416 KB Output is correct
54 Correct 312 ms 42476 KB Output is correct
55 Correct 224 ms 36712 KB Output is correct
56 Correct 308 ms 43660 KB Output is correct
57 Correct 2418 ms 151672 KB Output is correct
58 Correct 2400 ms 151544 KB Output is correct
59 Correct 2220 ms 149820 KB Output is correct
60 Correct 2269 ms 149752 KB Output is correct
61 Correct 2284 ms 149752 KB Output is correct
62 Correct 2214 ms 149752 KB Output is correct
63 Correct 1351 ms 108280 KB Output is correct
64 Correct 1293 ms 108280 KB Output is correct
65 Correct 1612 ms 110072 KB Output is correct
66 Correct 1626 ms 109944 KB Output is correct
67 Correct 1609 ms 109944 KB Output is correct
68 Correct 1680 ms 110712 KB Output is correct
69 Correct 1695 ms 110712 KB Output is correct
70 Correct 1661 ms 110456 KB Output is correct
71 Correct 1650 ms 110456 KB Output is correct
72 Correct 1637 ms 110584 KB Output is correct
73 Correct 1293 ms 105208 KB Output is correct
74 Correct 1303 ms 105080 KB Output is correct
75 Correct 1296 ms 105336 KB Output is correct
76 Correct 1257 ms 105336 KB Output is correct
77 Correct 1321 ms 105128 KB Output is correct
78 Correct 1744 ms 120696 KB Output is correct
79 Correct 1105 ms 84052 KB Output is correct
80 Correct 1781 ms 129808 KB Output is correct