oj.uz

답안 #330609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
330609 2020-11-26T00:00:31 Z rqi Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 2594 ms 136744 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db; 
typedef string str; 
 
typedef pair<int,int> pi;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 
 
typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
 
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
const int MOD = 1e9+7; // 998244353;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 
 
template<class T> bool ckmin(T& a, const T& b) { 
    return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
    return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }
 
template<class T, class U> T fstTrue(T lo, T hi, U f) { 
    // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
    hi ++; assert(lo <= hi); // assuming f is increasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi);
        f(mid) ? hi = mid : lo = mid+1; 
    } 
    return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
    lo --; assert(lo <= hi); // assuming f is decreasing
    while (lo < hi) { // find first index such that f is true 
        T mid = half(lo+hi+1);
        f(mid) ? lo = mid : hi = mid-1;
    } 
    return lo;
}
template<class T> void remDup(vector<T>& v) { 
    sort(all(v)); v.erase(unique(all(v)),end(v)); }
 
// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);
 
template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }
 
template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }
 
// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
    #ifdef LOCAL
        return b ? "true" : "false"; 
    #else 
        return ts((int)b);
    #endif
}
template<class A> str ts(complex<A> c) { 
    stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
    str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
    res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
    str res = ""; F0R(i,SZ) res += char('0'+b[i]);
    return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
    #ifdef LOCAL
        bool fst = 1; str res = "{";
        for (const auto& x: v) {
            if (!fst) res += ", ";
            fst = 0; res += ts(x);
        }
        res += "}"; return res;
    #else
        bool fst = 1; str res = "";
        for (const auto& x: v) {
            if (!fst) res += " ";
            fst = 0; res += ts(x);
        }
        return res;
 
    #endif
}
template<class A, class B> str ts(pair<A,B> p) {
    #ifdef LOCAL
        return "("+ts(p.f)+", "+ts(p.s)+")"; 
    #else
        return ts(p.f)+" "+ts(p.s);
    #endif
}
 
// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
    pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
    pr(h); if (sizeof...(t)) pr(" "); ps(t...); }
 
// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
    cerr << ts(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
    #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
    #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
         << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
    #define dbg(...) 0
    #define chk(...) 0
#endif
 
// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
    unsyncIO();
    // cin.exceptions(cin.failbit); 
    // throws exception when do smth illegal
    // ex. try to read letter into int
    if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}

 
const int SZ = 1048576;
int N, M;
int w[SZ];
int l[SZ];
int r[SZ];
int k[SZ];
int ans[SZ]; //maximum difference
 
vi queries[2*SZ]; //indices of queries
int fanses[SZ]; //prefix and suffix anses
int maxes[SZ]; //sufix maxes
 
//vpi sortq;
vi emp;
vpi allvals, qvals;

void search(int ind, int L = 0, int R = SZ-1){
    if(L == R) return;
    if(sz(queries[ind]) == 0) return;
    int M = (L+R)/2;
    
    while(sz(queries[ind])){
        int u = queries[ind].bk;
        queries[ind].pop_back();
        if(r[u] <= M){
            queries[2*ind].pb(u);
        }
        else if(l[u] >= M+1){
            queries[2*ind+1].pb(u);
        }
        else{
            emp.pb(u);
        }
    }
    queries[ind].clear();
    swap(queries[ind], emp);

    for(int i = M; i >= L; i--){
        fanses[i] = 0;
    }
 
    //set<int> vals;
    
    for(int i = L; i <= M; i++){
        allvals.pb(mp(w[i], i));
        qvals.pb(mp(w[i], i));
    }
    sort(all(allvals));
    sort(all(qvals));

    vi bvals; //decreasing indices with increasing value
    int curind = 0;

    for(auto u: qvals){
        while(curind < sz(allvals)){
            if(allvals[curind].f >= u.f){
                break;
            }
            while(sz(bvals)){
                if(bvals.bk > allvals[curind].s) break;
                bvals.pop_back();
            }
            bvals.pb(allvals[curind].s);
            curind++;
        }

        if(sz(bvals) != 0 && bvals[0] >= u.s){
            int lo = 0;
            int hi = sz(bvals)-1;
            while(lo < hi){
                int mid = (lo+hi)/2+1;
                if(u.s <= bvals[mid]){
                    lo = mid;
                }
                else hi = mid-1;
            }
            ckmax(fanses[u.s], u.f+w[bvals[lo]]);
        }
    }

    allvals.clear();
    qvals.clear();
    bvals.clear();

    for(int i = M-1; i >= L; i--){
        ckmax(fanses[i], fanses[i+1]);
    }
    
    int curmax = 0;
    for(int i = M+1; i <= R; i++){
        if(i > M+1){
            fanses[i] = fanses[i-1];
        }
        else{
            fanses[i] = 0;
        }
        if(curmax > w[i]){
            ckmax(fanses[i], curmax+w[i]);
        }
        ckmax(curmax, w[i]);
    }
    curmax = 0;
 
    for(int i = M; i >= L; i--){
        if(i < M){
            maxes[i] = maxes[i+1];
        }
        else{
            maxes[i] = 0;
        }
        ckmax(maxes[i], w[i]);
    }
    
    // int curR = M;
    // for(auto x: sortq){
    //  int u = x.s;
    //  while(curR < r[u]){
    //      curR++;
    //      vals.ins(w[curR]);
    //  }

    //  ckmax(ans[u], fanses[l[u]]);
    //  ckmax(ans[u], fanses[r[u]]);
 
    //  auto it = vals.lb(maxes[l[u]]);
    //  if(it != vals.begin()){
    //      int y = *(prev(it));
    //      ckmax(ans[u], maxes[l[u]]+y);
    //  }
    // }

    for(auto u: queries[ind]){
        ckmax(ans[u], fanses[l[u]]);
        ckmax(ans[u], fanses[r[u]]);
        qvals.pb(mp(maxes[l[u]], u));
    }

    for(int i = M+1; i <= R; i++){
        allvals.pb(mp(w[i], i));
    }

    sort(all(allvals));
    sort(all(qvals));


    curind = 0;

    for(auto u: qvals){
        //dbg(u, L, R);
        while(curind < sz(allvals)){
            if(allvals[curind].f >= u.f){
                break;
            }
            while(sz(bvals)){
                if(bvals.bk < allvals[curind].s) break;
                bvals.pop_back();
            }
            bvals.pb(allvals[curind].s);
            curind++;
        }

        //dbg(bvals);

        if(sz(bvals) != 0 && bvals[0] <= r[u.s]){
            int lo = 0;
            int hi = sz(bvals)-1;
            while(lo < hi){
                int mid = (lo+hi)/2+1;
                if(r[u.s] >= bvals[mid]){
                    lo = mid;
                }
                else hi = mid-1;
            }
            ckmax(ans[u.s], u.f+w[bvals[lo]]);
        }
    }

    allvals.clear();
    qvals.clear();
    bvals.clear();
 
    search(2*ind, L, M);
    search(2*ind+1, M+1, R);
}
 
int main() {
    setIO();
    cin >> N >> M;
    for(int i = 1; i <= N; i++){
        cin >> w[i];
    }
    for(int i = 1; i <= M; i++){
        cin >> l[i] >> r[i] >> k[i];
    }
    
    for(int i = 1; i <= M; i++){
        queries[1].pb(i);
    }
 
    search(1);
 
    for(int i = 1; i <= M; i++){
        // ps(ans[i]);
        if(ans[i] > k[i]){
        	ps(0);
        }
        else{
        	ps(1);
        }
    }
    // you should actually read the stuff at the bottom
}
 
/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?)
    * do smth instead of nothing and stay organized
    * WRITE STUFF DOWN
*/

Compilation message

sortbooks.cpp: In function 'void setIn(str)':
sortbooks.cpp:168:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  168 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp: In function 'void setOut(str)':
sortbooks.cpp:169:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  169 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 64196 KB Output is correct
2 Correct 185 ms 64196 KB Output is correct
3 Correct 376 ms 64184 KB Output is correct
4 Correct 400 ms 64196 KB Output is correct
5 Correct 359 ms 64328 KB Output is correct
6 Correct 337 ms 64196 KB Output is correct
7 Correct 330 ms 64196 KB Output is correct
8 Correct 337 ms 64344 KB Output is correct
9 Correct 355 ms 64168 KB Output is correct
10 Correct 333 ms 64196 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 64196 KB Output is correct
2 Correct 185 ms 64196 KB Output is correct
3 Correct 376 ms 64184 KB Output is correct
4 Correct 400 ms 64196 KB Output is correct
5 Correct 359 ms 64328 KB Output is correct
6 Correct 337 ms 64196 KB Output is correct
7 Correct 330 ms 64196 KB Output is correct
8 Correct 337 ms 64344 KB Output is correct
9 Correct 355 ms 64168 KB Output is correct
10 Correct 333 ms 64196 KB Output is correct
11 Correct 298 ms 64452 KB Output is correct
12 Correct 250 ms 64452 KB Output is correct
13 Correct 246 ms 64464 KB Output is correct
14 Correct 248 ms 64376 KB Output is correct
15 Correct 247 ms 64376 KB Output is correct
16 Correct 237 ms 64376 KB Output is correct
17 Correct 238 ms 64376 KB Output is correct
18 Correct 228 ms 64376 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2592 ms 101432 KB Output is correct
2 Correct 2554 ms 101212 KB Output is correct
3 Correct 2516 ms 134028 KB Output is correct
4 Correct 2509 ms 134196 KB Output is correct
5 Correct 1290 ms 130132 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 498 ms 69200 KB Output is correct
2 Correct 346 ms 68560 KB Output is correct
3 Correct 326 ms 68304 KB Output is correct
4 Correct 332 ms 68408 KB Output is correct
5 Correct 361 ms 69072 KB Output is correct
6 Correct 368 ms 68572 KB Output is correct
7 Correct 312 ms 68688 KB Output is correct
8 Correct 367 ms 68688 KB Output is correct
9 Correct 382 ms 70992 KB Output is correct
10 Correct 369 ms 68688 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 64196 KB Output is correct
2 Correct 185 ms 64196 KB Output is correct
3 Correct 376 ms 64184 KB Output is correct
4 Correct 400 ms 64196 KB Output is correct
5 Correct 359 ms 64328 KB Output is correct
6 Correct 337 ms 64196 KB Output is correct
7 Correct 330 ms 64196 KB Output is correct
8 Correct 337 ms 64344 KB Output is correct
9 Correct 355 ms 64168 KB Output is correct
10 Correct 333 ms 64196 KB Output is correct
11 Correct 298 ms 64452 KB Output is correct
12 Correct 250 ms 64452 KB Output is correct
13 Correct 246 ms 64464 KB Output is correct
14 Correct 248 ms 64376 KB Output is correct
15 Correct 247 ms 64376 KB Output is correct
16 Correct 237 ms 64376 KB Output is correct
17 Correct 238 ms 64376 KB Output is correct
18 Correct 228 ms 64376 KB Output is correct
19 Correct 738 ms 73348 KB Output is correct
20 Correct 750 ms 73264 KB Output is correct
21 Correct 448 ms 71728 KB Output is correct
22 Correct 449 ms 71684 KB Output is correct
23 Correct 446 ms 71792 KB Output is correct
24 Correct 378 ms 71044 KB Output is correct
25 Correct 374 ms 70916 KB Output is correct
26 Correct 376 ms 70980 KB Output is correct
27 Correct 377 ms 70980 KB Output is correct
28 Correct 384 ms 70948 KB Output is correct
29 Correct 473 ms 72452 KB Output is correct
30 Correct 459 ms 72452 KB Output is correct
31 Correct 421 ms 71812 KB Output is correct
32 Correct 441 ms 71812 KB Output is correct
33 Correct 419 ms 71812 KB Output is correct
34 Correct 379 ms 71684 KB Output is correct
35 Correct 388 ms 71812 KB Output is correct
36 Correct 371 ms 71812 KB Output is correct
37 Correct 365 ms 71684 KB Output is correct
38 Correct 373 ms 71812 KB Output is correct
39 Correct 527 ms 72068 KB Output is correct
40 Correct 391 ms 72452 KB Output is correct
41 Correct 534 ms 72388 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 64196 KB Output is correct
2 Correct 185 ms 64196 KB Output is correct
3 Correct 376 ms 64184 KB Output is correct
4 Correct 400 ms 64196 KB Output is correct
5 Correct 359 ms 64328 KB Output is correct
6 Correct 337 ms 64196 KB Output is correct
7 Correct 330 ms 64196 KB Output is correct
8 Correct 337 ms 64344 KB Output is correct
9 Correct 355 ms 64168 KB Output is correct
10 Correct 333 ms 64196 KB Output is correct
11 Correct 298 ms 64452 KB Output is correct
12 Correct 250 ms 64452 KB Output is correct
13 Correct 246 ms 64464 KB Output is correct
14 Correct 248 ms 64376 KB Output is correct
15 Correct 247 ms 64376 KB Output is correct
16 Correct 237 ms 64376 KB Output is correct
17 Correct 238 ms 64376 KB Output is correct
18 Correct 228 ms 64376 KB Output is correct
19 Correct 2592 ms 101432 KB Output is correct
20 Correct 2554 ms 101212 KB Output is correct
21 Correct 2516 ms 134028 KB Output is correct
22 Correct 2509 ms 134196 KB Output is correct
23 Correct 1290 ms 130132 KB Output is correct
24 Correct 498 ms 69200 KB Output is correct
25 Correct 346 ms 68560 KB Output is correct
26 Correct 326 ms 68304 KB Output is correct
27 Correct 332 ms 68408 KB Output is correct
28 Correct 361 ms 69072 KB Output is correct
29 Correct 368 ms 68572 KB Output is correct
30 Correct 312 ms 68688 KB Output is correct
31 Correct 367 ms 68688 KB Output is correct
32 Correct 382 ms 70992 KB Output is correct
33 Correct 369 ms 68688 KB Output is correct
34 Correct 738 ms 73348 KB Output is correct
35 Correct 750 ms 73264 KB Output is correct
36 Correct 448 ms 71728 KB Output is correct
37 Correct 449 ms 71684 KB Output is correct
38 Correct 446 ms 71792 KB Output is correct
39 Correct 378 ms 71044 KB Output is correct
40 Correct 374 ms 70916 KB Output is correct
41 Correct 376 ms 70980 KB Output is correct
42 Correct 377 ms 70980 KB Output is correct
43 Correct 384 ms 70948 KB Output is correct
44 Correct 473 ms 72452 KB Output is correct
45 Correct 459 ms 72452 KB Output is correct
46 Correct 421 ms 71812 KB Output is correct
47 Correct 441 ms 71812 KB Output is correct
48 Correct 419 ms 71812 KB Output is correct
49 Correct 379 ms 71684 KB Output is correct
50 Correct 388 ms 71812 KB Output is correct
51 Correct 371 ms 71812 KB Output is correct
52 Correct 365 ms 71684 KB Output is correct
53 Correct 373 ms 71812 KB Output is correct
54 Correct 527 ms 72068 KB Output is correct
55 Correct 391 ms 72452 KB Output is correct
56 Correct 534 ms 72388 KB Output is correct
57 Correct 2586 ms 136732 KB Output is correct
58 Correct 2594 ms 136744 KB Output is correct
59 Correct 1180 ms 130964 KB Output is correct
60 Correct 1133 ms 131088 KB Output is correct
61 Correct 1110 ms 131132 KB Output is correct
62 Correct 1164 ms 131000 KB Output is correct
63 Correct 848 ms 125348 KB Output is correct
64 Correct 856 ms 125308 KB Output is correct
65 Correct 885 ms 127152 KB Output is correct
66 Correct 893 ms 127196 KB Output is correct
67 Correct 901 ms 127896 KB Output is correct
68 Correct 1349 ms 132928 KB Output is correct
69 Correct 1307 ms 132820 KB Output is correct
70 Correct 993 ms 129132 KB Output is correct
71 Correct 986 ms 129108 KB Output is correct
72 Correct 988 ms 129364 KB Output is correct
73 Correct 795 ms 127712 KB Output is correct
74 Correct 821 ms 128688 KB Output is correct
75 Correct 797 ms 127736 KB Output is correct
76 Correct 803 ms 127736 KB Output is correct
77 Correct 800 ms 127736 KB Output is correct
78 Correct 1579 ms 128208 KB Output is correct
79 Correct 1002 ms 121564 KB Output is correct
80 Correct 1541 ms 128208 KB Output is correct