oj.uz

Submission #226419

# Submission time Handle Problem Language Result Execution time Memory
226419 2020-04-23T18:51:05 Z rqi Examination (JOI19_examination) C++14
100 / 100
 610 ms 31424 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<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 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}; 

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; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// 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
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
    bool fst = 1; str res = "{";
    F0R(i,sz(v)) {
        if (!fst) res += ", ";
        fst = 0; res += ts(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 T> str ts(T v) {
    bool fst = 1; str res = "{";
    for (const auto& x: v) {
        if (!fst) res += ", ";
        fst = 0; res += ts(x);
    }
    res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
    return "("+ts(p.f)+", "+ts(p.s)+")"; }

// 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 << to_string(h); if (sizeof...(t)) cerr << ", ";
    DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

// FILE I/O
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { ios_base::sync_with_stdio(0); cin.tie(0); }
void setIO(string 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
}

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

/**
 * Description: A set (not multiset!) with support for finding the $n$'th
 * element, and finding the index of an element. Change \texttt{null\_type} for map.
 * Time: O(\log N)
 * Source: KACTL
 * Verification: many
 */

#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, 
    rb_tree_tag, tree_order_statistics_node_update>; 
#define ook order_of_key
#define fbo find_by_order


const int mx = 100005;
int ezans[mx];
int hardans[mx];
int S[mx];
int T[mx];
int X[mx];
int Y[mx];
int Z[mx];




int main() {
    setIO();
    int N, Q;
    cin >> N >> Q;
    vpi xpoints;
    vpi ypoints;
    vpi dpoints;
    for(int i = 1; i <= N; i++){
        cin >> S[i] >> T[i];
        xpoints.pb(mp(S[i], i));
        ypoints.pb(mp(T[i], i));
        dpoints.pb(mp(S[i]+T[i], i));
    }
    sort(all(xpoints));
    sort(all(ypoints));
    sort(all(dpoints));
    vpi xq, dq;
    for(int i = 1; i <= Q; i++){
        cin >> X[i] >> Y[i] >> Z[i];
        xq.pb(mp(X[i], i));
        dq.pb(mp(Z[i], i));
    }

    sort(xq.rbegin(), xq.rend());
    
    Tree<pi> vals;
    int curp = N-1;
    //dbg(xpoints);
    for(auto u: xq){
        int ind = u.s;
        int xbound = X[ind];
        int ybound = Y[ind];

        while(curp >= 0 && xpoints[curp].f >= xbound){
            int p = xpoints[curp].s;
            vals.ins(mp(T[p], p));
            curp--;
        }
        ezans[ind] = sz(vals)-vals.order_of_key(mp(ybound, 0));
    }

    sort(dq.rbegin(), dq.rend());

    Tree<pi> xvals;
    Tree<pi> yvals;

    curp = N-1;
    for(auto u: dq){
        int ind = u.s;
        int dbound = Z[ind];
        int xbound = X[ind];
        int ybound = Y[ind];
        while(curp >= 0 && dpoints[curp].f >= dbound){
            int p = dpoints[curp].s;
            xvals.ins(mp(S[p], p));
            yvals.ins(mp(T[p], p));
            curp--;
        }
        
        hardans[ind] = sz(xvals)-xvals.order_of_key(mp(xbound, 0))-yvals.order_of_key(mp(ybound, 0));
        //dbg(ind, dbound, hardans[ind]);
    }

    for(int i = 1; i <= Q; i++){
        if(X[i]+Y[i] < Z[i]){
            ps(hardans[i]);
        }
        else ps(ezans[i]);
    }

    // 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

examination.cpp: In function 'void setIn(std::__cxx11::string)':
examination.cpp:123:31: 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 setOut(std::__cxx11::string)':
examination.cpp:124:32: 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

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 13 ms 1408 KB Output is correct
8 Correct 13 ms 1408 KB Output is correct
9 Correct 12 ms 1408 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 15 ms 1408 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 13 ms 1280 KB Output is correct
16 Correct 11 ms 1280 KB Output is correct
17 Correct 13 ms 1280 KB Output is correct
18 Correct 10 ms 1280 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 29024 KB Output is correct
2 Correct 488 ms 28860 KB Output is correct
3 Correct 488 ms 29024 KB Output is correct
4 Correct 446 ms 28284 KB Output is correct
5 Correct 431 ms 28168 KB Output is correct
6 Correct 277 ms 27388 KB Output is correct
7 Correct 564 ms 28848 KB Output is correct
8 Correct 509 ms 28928 KB Output is correct
9 Correct 380 ms 28788 KB Output is correct
10 Correct 395 ms 28020 KB Output is correct
11 Correct 392 ms 27900 KB Output is correct
12 Correct 299 ms 27132 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 478 ms 29024 KB Output is correct
2 Correct 488 ms 28860 KB Output is correct
3 Correct 488 ms 29024 KB Output is correct
4 Correct 446 ms 28284 KB Output is correct
5 Correct 431 ms 28168 KB Output is correct
6 Correct 277 ms 27388 KB Output is correct
7 Correct 564 ms 28848 KB Output is correct
8 Correct 509 ms 28928 KB Output is correct
9 Correct 380 ms 28788 KB Output is correct
10 Correct 395 ms 28020 KB Output is correct
11 Correct 392 ms 27900 KB Output is correct
12 Correct 299 ms 27132 KB Output is correct
13 Correct 424 ms 29308 KB Output is correct
14 Correct 610 ms 29432 KB Output is correct
15 Correct 428 ms 28800 KB Output is correct
16 Correct 411 ms 28548 KB Output is correct
17 Correct 405 ms 28544 KB Output is correct
18 Correct 308 ms 27644 KB Output is correct
19 Correct 552 ms 29432 KB Output is correct
20 Correct 446 ms 29308 KB Output is correct
21 Correct 435 ms 29420 KB Output is correct
22 Correct 386 ms 27900 KB Output is correct
23 Correct 401 ms 28024 KB Output is correct
24 Correct 299 ms 27264 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 13 ms 1408 KB Output is correct
8 Correct 13 ms 1408 KB Output is correct
9 Correct 12 ms 1408 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 12 ms 1280 KB Output is correct
12 Correct 11 ms 1280 KB Output is correct
13 Correct 15 ms 1408 KB Output is correct
14 Correct 12 ms 1280 KB Output is correct
15 Correct 13 ms 1280 KB Output is correct
16 Correct 11 ms 1280 KB Output is correct
17 Correct 13 ms 1280 KB Output is correct
18 Correct 10 ms 1280 KB Output is correct
19 Correct 478 ms 29024 KB Output is correct
20 Correct 488 ms 28860 KB Output is correct
21 Correct 488 ms 29024 KB Output is correct
22 Correct 446 ms 28284 KB Output is correct
23 Correct 431 ms 28168 KB Output is correct
24 Correct 277 ms 27388 KB Output is correct
25 Correct 564 ms 28848 KB Output is correct
26 Correct 509 ms 28928 KB Output is correct
27 Correct 380 ms 28788 KB Output is correct
28 Correct 395 ms 28020 KB Output is correct
29 Correct 392 ms 27900 KB Output is correct
30 Correct 299 ms 27132 KB Output is correct
31 Correct 424 ms 29308 KB Output is correct
32 Correct 610 ms 29432 KB Output is correct
33 Correct 428 ms 28800 KB Output is correct
34 Correct 411 ms 28548 KB Output is correct
35 Correct 405 ms 28544 KB Output is correct
36 Correct 308 ms 27644 KB Output is correct
37 Correct 552 ms 29432 KB Output is correct
38 Correct 446 ms 29308 KB Output is correct
39 Correct 435 ms 29420 KB Output is correct
40 Correct 386 ms 27900 KB Output is correct
41 Correct 401 ms 28024 KB Output is correct
42 Correct 299 ms 27264 KB Output is correct
43 Correct 600 ms 31236 KB Output is correct
44 Correct 524 ms 31424 KB Output is correct
45 Correct 482 ms 31228 KB Output is correct
46 Correct 409 ms 29812 KB Output is correct
47 Correct 449 ms 29820 KB Output is correct
48 Correct 265 ms 27260 KB Output is correct
49 Correct 529 ms 31228 KB Output is correct
50 Correct 395 ms 31096 KB Output is correct
51 Correct 490 ms 31364 KB Output is correct
52 Correct 396 ms 29452 KB Output is correct
53 Correct 479 ms 28796 KB Output is correct