oj.uz

답안 #102234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102234 2019-03-23T18:00:09 Z Benq Examination (JOI19_examination) C++14
100 / 100
 660 ms 22448 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 beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 100001;
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); }

template<class A, class B> A operator+=(A& l, const B& r) { return l = l+r; }
template<class A, class B> A operator-=(A& l, const B& r) { return l = l-r; }
template<class A, class B> A operator*=(A& l, const B& r) { return l = l*r; }
template<class A, class B> A operator/=(A& l, const B& r) { return l = l/r; }

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; trav(a,x) pr(!fst?", ":"",a), fst = 0; 
        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, 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 modInt {
    T val;
    T mod = 0;
    // static const T mod = MOD;

    void normalize() {
        if (mod == 0) return;
        val %= mod; if (val < 0) val += mod;
    }
    modInt(T v = 0, T m = 0) : val(v), mod(m) { normalize(); }
    // modInt(T v = 0, T m = 0) : val(v) { normalize(); }

    explicit operator T() const { return val; }
    friend ostream& operator<<(ostream& os, const modInt& a) { return os << a.val; }
    friend bool operator==(const modInt& a, const modInt& b) { return a.val == b.val; }
    friend bool operator!=(const modInt& a, const modInt& b) { return !(a == b); }

    friend void check(modInt& a, modInt& b) { // make sure all operations are valid
        // comment out if mod is static const
        if (a.mod > 0 && b.mod > 0) { assert(a.mod == b.mod); return; }
        T mod = max(a.mod,b.mod); if (mod == 0) mod = MOD;
        if (a.mod != mod) { a.mod = mod; a.normalize(); }
        if (b.mod != mod) { b.mod = mod; b.normalize(); }
    }
    friend modInt operator+(modInt a, modInt b) {
        check(a,b); a.val += (T)b;
        if (a.val >= a.mod) a.val -= a.mod;
        return a;
    }
    friend modInt operator-(modInt a, modInt b) {
        check(a,b); a.val -= (T)b; 
        if (a.val < 0) a.val += a.mod; 
        return a;
    }
    friend modInt operator-(const modInt& a) { return modInt(0)-a; }

    friend modInt operator*(modInt a, modInt b) {
        check(a,b); a.val = (ll)a.val*(T)b%a.mod; return a;
    }
    friend modInt exp(modInt a, ll p) {
        modInt ans(1,a.mod);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modInt inv(const modInt& a) {
        return {invGeneral(a.val,a.mod),a.mod};
        // return exp(b,b.mod-2) if prime
    }
    friend modInt operator/(modInt a, modInt b) { 
        check(a,b); return a*inv(b); 
    }
};

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

int N,Q, ans[MX];
vector<array<int,4>> q;
Tree<pi> sum, sec;

int ge(Tree<pi>& T, int x) {
    return sz(T)-T.order_of_key({x,-MOD});
} 

int main() {
    setIO();
    re(N,Q);
    F0R(i,N) {
        int S,T; re(S,T);
        q.pb({S,0,T,0});
    }
    F0R(i,Q) {
        int A,B,C; re(A,B,C); ckmax(C,A+B);
        // A to C-B-1: sum at least C
        // C-B to inf: at least B
        q.pb({A-1,1,i,C});
        q.pb({C-B-1,2,i,C});
        q.pb({C-B-1,3,i,B});
        q.pb({2*MOD,4,i,B});
    }
    sort(all(q));
    int co = 0;
    trav(t,q) {
        if (t[1] == 0) {
            sum.insert({t[0]+t[2],co++});
            sec.insert({t[2],co++});
        } else if (t[1] == 1) {
            ans[t[2]] -= ge(sum,t[3]);
        } else if (t[1] == 2) {
            ans[t[2]] += ge(sum,t[3]);
        } else if (t[1] == 3) {
            ans[t[2]] -= ge(sec,t[3]);
        } else {
            ans[t[2]] += ge(sec,t[3]);
        }
    }
    F0R(i,Q) 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

examination.cpp: In function 'void io::setIn(std::__cxx11::string)':
examination.cpp:117: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); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
examination.cpp: In function 'void io::setOut(std::__cxx11::string)':
examination.cpp:118: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
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 1152 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 10 ms 1152 KB Output is correct
10 Correct 10 ms 1152 KB Output is correct
11 Correct 10 ms 1124 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 11 ms 1156 KB Output is correct
14 Correct 9 ms 1024 KB Output is correct
15 Correct 8 ms 1024 KB Output is correct
16 Correct 8 ms 1024 KB Output is correct
17 Correct 9 ms 1124 KB Output is correct
18 Correct 9 ms 1024 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 552 ms 22288 KB Output is correct
2 Correct 597 ms 22284 KB Output is correct
3 Correct 608 ms 22288 KB Output is correct
4 Correct 319 ms 22228 KB Output is correct
5 Correct 516 ms 22228 KB Output is correct
6 Correct 293 ms 22100 KB Output is correct
7 Correct 461 ms 22100 KB Output is correct
8 Correct 491 ms 22104 KB Output is correct
9 Correct 392 ms 22164 KB Output is correct
10 Correct 519 ms 22100 KB Output is correct
11 Correct 385 ms 21972 KB Output is correct
12 Correct 366 ms 21716 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 552 ms 22288 KB Output is correct
2 Correct 597 ms 22284 KB Output is correct
3 Correct 608 ms 22288 KB Output is correct
4 Correct 319 ms 22228 KB Output is correct
5 Correct 516 ms 22228 KB Output is correct
6 Correct 293 ms 22100 KB Output is correct
7 Correct 461 ms 22100 KB Output is correct
8 Correct 491 ms 22104 KB Output is correct
9 Correct 392 ms 22164 KB Output is correct
10 Correct 519 ms 22100 KB Output is correct
11 Correct 385 ms 21972 KB Output is correct
12 Correct 366 ms 21716 KB Output is correct
13 Correct 613 ms 22152 KB Output is correct
14 Correct 574 ms 22448 KB Output is correct
15 Correct 508 ms 22272 KB Output is correct
16 Correct 304 ms 22228 KB Output is correct
17 Correct 539 ms 22228 KB Output is correct
18 Correct 376 ms 22108 KB Output is correct
19 Correct 549 ms 22196 KB Output is correct
20 Correct 607 ms 22440 KB Output is correct
21 Correct 572 ms 22272 KB Output is correct
22 Correct 525 ms 21980 KB Output is correct
23 Correct 384 ms 21940 KB Output is correct
24 Correct 431 ms 21708 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 10 ms 1152 KB Output is correct
8 Correct 10 ms 1152 KB Output is correct
9 Correct 10 ms 1152 KB Output is correct
10 Correct 10 ms 1152 KB Output is correct
11 Correct 10 ms 1124 KB Output is correct
12 Correct 10 ms 1024 KB Output is correct
13 Correct 11 ms 1156 KB Output is correct
14 Correct 9 ms 1024 KB Output is correct
15 Correct 8 ms 1024 KB Output is correct
16 Correct 8 ms 1024 KB Output is correct
17 Correct 9 ms 1124 KB Output is correct
18 Correct 9 ms 1024 KB Output is correct
19 Correct 552 ms 22288 KB Output is correct
20 Correct 597 ms 22284 KB Output is correct
21 Correct 608 ms 22288 KB Output is correct
22 Correct 319 ms 22228 KB Output is correct
23 Correct 516 ms 22228 KB Output is correct
24 Correct 293 ms 22100 KB Output is correct
25 Correct 461 ms 22100 KB Output is correct
26 Correct 491 ms 22104 KB Output is correct
27 Correct 392 ms 22164 KB Output is correct
28 Correct 519 ms 22100 KB Output is correct
29 Correct 385 ms 21972 KB Output is correct
30 Correct 366 ms 21716 KB Output is correct
31 Correct 613 ms 22152 KB Output is correct
32 Correct 574 ms 22448 KB Output is correct
33 Correct 508 ms 22272 KB Output is correct
34 Correct 304 ms 22228 KB Output is correct
35 Correct 539 ms 22228 KB Output is correct
36 Correct 376 ms 22108 KB Output is correct
37 Correct 549 ms 22196 KB Output is correct
38 Correct 607 ms 22440 KB Output is correct
39 Correct 572 ms 22272 KB Output is correct
40 Correct 525 ms 21980 KB Output is correct
41 Correct 384 ms 21940 KB Output is correct
42 Correct 431 ms 21708 KB Output is correct
43 Correct 601 ms 22252 KB Output is correct
44 Correct 619 ms 22208 KB Output is correct
45 Correct 660 ms 22404 KB Output is correct
46 Correct 413 ms 22248 KB Output is correct
47 Correct 487 ms 22228 KB Output is correct
48 Correct 339 ms 21852 KB Output is correct
49 Correct 562 ms 22408 KB Output is correct
50 Correct 543 ms 22228 KB Output is correct
51 Correct 516 ms 22368 KB Output is correct
52 Correct 547 ms 22064 KB Output is correct
53 Correct 387 ms 22044 KB Output is correct