oj.uz

Submission #143054

# Submission time Handle Problem Language Result Execution time Memory
143054 2019-08-12T19:08:31 Z Benq Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 1323 ms 68620 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
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 vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#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

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 1000005;
const ld PI = 4*atan((ld)1);

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); }

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 Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    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) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

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;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    modular(const ll& v) { 
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    
    // friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend void pr(const modular& a) { pr(a.val); }
    friend void re(modular& a) { ll x; re(x); a = modular(x); }
   
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
    friend bool operator<(const modular& a, const modular& b) { return a.val < b.val; }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular pow(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<class T, int SZ> struct Seg { // SZ should be power of 2
    T ID = 0; // comb(ID,b) must equal b
    T comb(T a, T b) { return max(a,b); } // easily change this to min or max

    T seg[2*SZ];
    Seg() { memset(seg,0,sizeof seg); }

    void build() { FORd(i,1,SZ) seg[i] = comb(seg[2*i],seg[2*i+1]); }

    void upd(int p, T value) {  // set value at position p
        ckmax(seg[p += SZ],value);
        for (p /= 2; p; p /= 2) seg[p] = comb(seg[2*p],seg[2*p+1]);
    }

    T query(int l, int r) {  // sum on interval [l, r]
        r ++; T lres = ID, rres = ID; // make sure non-commutative operations work
        for (l += SZ, r += SZ; l < r; l /= 2, r /= 2) {
            if (l&1) lres = comb(lres,seg[l++]);
            if (r&1) rres = comb(seg[--r],rres);
        }
        return comb(lres,rres);
    }
};

int N,M,ans[MX];
vector<array<int,3>> todo[MX];
vi w;
Seg<int,1<<20> S;

int main() {
    setIO(); re(N,M); 
    w.rsz(N+1); FOR(i,1,N+1) re(w[i]);
    F0R(i,M) {
    	int l,r,k; re(l,r,k);
    	todo[l].pb({r,i,k});
    }
    vi mn;
    FORd(i,1,N+1) {
    	while (sz(mn) && w[i] > w[mn.back()]) {
    		S.upd(mn.back(),w[i]+w[mn.back()]);
    		mn.pop_back();
    	}
    	mn.pb(i);
    	trav(t,todo[i]) ans[t[1]] = S.query(i,t[0]) <= t[2];
    }
    F0R(i,M) ps(ans[i]);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Compilation message

sortbooks.cpp: In function 'void io::setIn(std::__cxx11::string)':
sortbooks.cpp:113: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:114: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 32 ms 32120 KB Output is correct
2 Correct 32 ms 32120 KB Output is correct
3 Correct 33 ms 31996 KB Output is correct
4 Correct 32 ms 32152 KB Output is correct
5 Correct 32 ms 31992 KB Output is correct
6 Correct 33 ms 32120 KB Output is correct
7 Correct 32 ms 32120 KB Output is correct
8 Correct 32 ms 32120 KB Output is correct
9 Correct 32 ms 32120 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 32120 KB Output is correct
2 Correct 32 ms 32120 KB Output is correct
3 Correct 33 ms 31996 KB Output is correct
4 Correct 32 ms 32152 KB Output is correct
5 Correct 32 ms 31992 KB Output is correct
6 Correct 33 ms 32120 KB Output is correct
7 Correct 32 ms 32120 KB Output is correct
8 Correct 32 ms 32120 KB Output is correct
9 Correct 32 ms 32120 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 35 ms 32092 KB Output is correct
12 Correct 34 ms 32184 KB Output is correct
13 Correct 35 ms 32120 KB Output is correct
14 Correct 36 ms 32248 KB Output is correct
15 Correct 36 ms 32248 KB Output is correct
16 Correct 36 ms 32248 KB Output is correct
17 Correct 37 ms 32248 KB Output is correct
18 Correct 38 ms 32248 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1310 ms 63740 KB Output is correct
2 Correct 1277 ms 63736 KB Output is correct
3 Correct 1272 ms 63712 KB Output is correct
4 Correct 1323 ms 63552 KB Output is correct
5 Correct 1205 ms 67704 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 35320 KB Output is correct
2 Correct 113 ms 35064 KB Output is correct
3 Correct 114 ms 35672 KB Output is correct
4 Correct 116 ms 35700 KB Output is correct
5 Correct 115 ms 35856 KB Output is correct
6 Correct 91 ms 35184 KB Output is correct
7 Correct 91 ms 35284 KB Output is correct
8 Correct 106 ms 35248 KB Output is correct
9 Correct 74 ms 34080 KB Output is correct
10 Correct 105 ms 35388 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 32120 KB Output is correct
2 Correct 32 ms 32120 KB Output is correct
3 Correct 33 ms 31996 KB Output is correct
4 Correct 32 ms 32152 KB Output is correct
5 Correct 32 ms 31992 KB Output is correct
6 Correct 33 ms 32120 KB Output is correct
7 Correct 32 ms 32120 KB Output is correct
8 Correct 32 ms 32120 KB Output is correct
9 Correct 32 ms 32120 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 35 ms 32092 KB Output is correct
12 Correct 34 ms 32184 KB Output is correct
13 Correct 35 ms 32120 KB Output is correct
14 Correct 36 ms 32248 KB Output is correct
15 Correct 36 ms 32248 KB Output is correct
16 Correct 36 ms 32248 KB Output is correct
17 Correct 37 ms 32248 KB Output is correct
18 Correct 38 ms 32248 KB Output is correct
19 Correct 259 ms 38620 KB Output is correct
20 Correct 249 ms 38520 KB Output is correct
21 Correct 219 ms 38136 KB Output is correct
22 Correct 216 ms 38008 KB Output is correct
23 Correct 214 ms 38008 KB Output is correct
24 Correct 195 ms 39020 KB Output is correct
25 Correct 195 ms 38888 KB Output is correct
26 Correct 256 ms 39024 KB Output is correct
27 Correct 254 ms 39020 KB Output is correct
28 Correct 230 ms 39024 KB Output is correct
29 Correct 241 ms 39408 KB Output is correct
30 Correct 242 ms 39408 KB Output is correct
31 Correct 243 ms 39404 KB Output is correct
32 Correct 241 ms 39404 KB Output is correct
33 Correct 250 ms 39432 KB Output is correct
34 Correct 175 ms 38260 KB Output is correct
35 Correct 176 ms 38292 KB Output is correct
36 Correct 171 ms 38264 KB Output is correct
37 Correct 172 ms 38232 KB Output is correct
38 Correct 175 ms 38324 KB Output is correct
39 Correct 209 ms 38860 KB Output is correct
40 Correct 177 ms 38080 KB Output is correct
41 Correct 208 ms 38604 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 32120 KB Output is correct
2 Correct 32 ms 32120 KB Output is correct
3 Correct 33 ms 31996 KB Output is correct
4 Correct 32 ms 32152 KB Output is correct
5 Correct 32 ms 31992 KB Output is correct
6 Correct 33 ms 32120 KB Output is correct
7 Correct 32 ms 32120 KB Output is correct
8 Correct 32 ms 32120 KB Output is correct
9 Correct 32 ms 32120 KB Output is correct
10 Correct 32 ms 31992 KB Output is correct
11 Correct 35 ms 32092 KB Output is correct
12 Correct 34 ms 32184 KB Output is correct
13 Correct 35 ms 32120 KB Output is correct
14 Correct 36 ms 32248 KB Output is correct
15 Correct 36 ms 32248 KB Output is correct
16 Correct 36 ms 32248 KB Output is correct
17 Correct 37 ms 32248 KB Output is correct
18 Correct 38 ms 32248 KB Output is correct
19 Correct 1310 ms 63740 KB Output is correct
20 Correct 1277 ms 63736 KB Output is correct
21 Correct 1272 ms 63712 KB Output is correct
22 Correct 1323 ms 63552 KB Output is correct
23 Correct 1205 ms 67704 KB Output is correct
24 Correct 122 ms 35320 KB Output is correct
25 Correct 113 ms 35064 KB Output is correct
26 Correct 114 ms 35672 KB Output is correct
27 Correct 116 ms 35700 KB Output is correct
28 Correct 115 ms 35856 KB Output is correct
29 Correct 91 ms 35184 KB Output is correct
30 Correct 91 ms 35284 KB Output is correct
31 Correct 106 ms 35248 KB Output is correct
32 Correct 74 ms 34080 KB Output is correct
33 Correct 105 ms 35388 KB Output is correct
34 Correct 259 ms 38620 KB Output is correct
35 Correct 249 ms 38520 KB Output is correct
36 Correct 219 ms 38136 KB Output is correct
37 Correct 216 ms 38008 KB Output is correct
38 Correct 214 ms 38008 KB Output is correct
39 Correct 195 ms 39020 KB Output is correct
40 Correct 195 ms 38888 KB Output is correct
41 Correct 256 ms 39024 KB Output is correct
42 Correct 254 ms 39020 KB Output is correct
43 Correct 230 ms 39024 KB Output is correct
44 Correct 241 ms 39408 KB Output is correct
45 Correct 242 ms 39408 KB Output is correct
46 Correct 243 ms 39404 KB Output is correct
47 Correct 241 ms 39404 KB Output is correct
48 Correct 250 ms 39432 KB Output is correct
49 Correct 175 ms 38260 KB Output is correct
50 Correct 176 ms 38292 KB Output is correct
51 Correct 171 ms 38264 KB Output is correct
52 Correct 172 ms 38232 KB Output is correct
53 Correct 175 ms 38324 KB Output is correct
54 Correct 209 ms 38860 KB Output is correct
55 Correct 177 ms 38080 KB Output is correct
56 Correct 208 ms 38604 KB Output is correct
57 Correct 1294 ms 64472 KB Output is correct
58 Correct 1287 ms 64412 KB Output is correct
59 Correct 1227 ms 62456 KB Output is correct
60 Correct 1287 ms 62456 KB Output is correct
61 Correct 1231 ms 62456 KB Output is correct
62 Correct 1252 ms 62368 KB Output is correct
63 Correct 869 ms 62664 KB Output is correct
64 Correct 829 ms 62696 KB Output is correct
65 Correct 1179 ms 66436 KB Output is correct
66 Correct 1175 ms 66652 KB Output is correct
67 Correct 1155 ms 66588 KB Output is correct
68 Correct 1221 ms 68492 KB Output is correct
69 Correct 1229 ms 68620 KB Output is correct
70 Correct 1231 ms 68164 KB Output is correct
71 Correct 1269 ms 68136 KB Output is correct
72 Correct 1209 ms 67988 KB Output is correct
73 Correct 733 ms 61784 KB Output is correct
74 Correct 742 ms 61536 KB Output is correct
75 Correct 735 ms 61632 KB Output is correct
76 Correct 753 ms 61684 KB Output is correct
77 Correct 755 ms 61920 KB Output is correct
78 Correct 1071 ms 65260 KB Output is correct
79 Correct 817 ms 60316 KB Output is correct
80 Correct 1008 ms 64328 KB Output is correct