oj.uz

답안 #896863

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
896863 2024-01-02T10:12:46 Z bLIC Examination (JOI19_examination) C++17
100 / 100
 210 ms 30548 KB 
/**
 *  Author: Anil Byar
**/

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

// using namespace __gnu_pbds;
using namespace std;

// template<class T>
// using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define uniq(v) v.erase(unique(all(v)), v.end())
#define ft first
#define sd second
#define pb push_back
#define eb emplace_back

// Source: https://codeforces.com/blog/entry/68809
// { start
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '"' << x << '"';}
void __print(const string &x) {cerr << '"' << x << '"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// } end


typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vl> vvl;

#define dbg if(0)

const ll MOD = 1e9+7;
const ll MOD9 = 998244353;
const ll INFLL = 1e18+5;
const int INF = 1e9;

void printbit(int x, int len) {string s="\n";while(len--){s=((x%2)?'1':'0')+s;x/=2;} cout<<s;}
ll power(ll x, ll y, ll mod){if (y==0) return 1;ll ret = power(x, y/2, mod);ret *= ret;ret%=mod;if (y&1) ret *= x;return ret%mod;}
ll modinv(ll x, ll mod = MOD) {return power(x, mod-2, mod);}

template<class T> bool chmin(T& a, T b){return (a>b?a=b,1:0);}
template<class T> bool chmax(T& a, T b){return (a<b?a=b,1:0);}
template<class T>
istream& operator>>(istream&in, vector<T>&v){
    for (T& x:v) in>>x;
    return in;
}
template<class T>
ostream& operator<<(ostream&out, vector<T>&v){
    for (T& x:v) out<<x<<' ';
    cout<<'\n';
    return out;
}


// Source: https://codeforces.com/blog/entry/18051
template <class T> struct SegTree{
    int n; T ID;
    std::vector<T> tree;
    T oper(T a, T b){return a+b;} // update this operation function according to need
    SegTree(int _n, T id){
        n = 1;ID = id;
        while(n<_n) n<<=1;
        tree.resize(2*n, ID);
    }
    void add(int i, T val){tree[i+n] = val;}
    void build(){
        for (int i = n-1;i>0;--i) tree[i] = oper(tree[i<<1], tree[i<<1|1]);
    }
    void update(int ind, T value){
        for (tree[ind+=n]+=value;ind>1;ind>>=1) tree[ind>>1] = (ind&1)?oper(tree[ind^1], tree[ind]):oper(tree[ind], tree[ind^1]);
    }
    T query(int l, int r){// indexing is from 0 to n-1, gives answer to [l, r)
        T left = ID, right = ID; // left and right for non associative operation
        for (l+=n, r+=n;l<r;l>>=1, r>>=1){
            if (l&1) left = oper(left, tree[l++]);
            if (r&1) right = oper(tree[--r], right);
        }
        return oper(left, right);
    }
};


// use ?: with brackets (?:)
// check for overflow
// think about dp
// Read the statement carefully



void solve(){
    int n, q;cin>>n>>q;
    vii a(n);
    vi tmp;
    for (int i = 0;i<n;i++){
        cin>>a[i].first>>a[i].second;
        tmp.push_back(a[i].first);
        tmp.push_back(a[i].second);
        tmp.push_back(a[i].first+a[i].second);
    }
    int ans[q]{};
    // q1 >=x, >=y, q2 x+y>=z, 
    vector<array<int, 3>> q1, queries(q);
    vector<array<int, 4>> q2;// x + y>=z , x<=A<=boundary
    for (int i =0;i<q;i++){
        int x, y, z;
        cin>>x>>y>>z;
        int boundary = z - y;
        q1.push_back({max(x, boundary), y, i});
        q2.push_back({x, boundary, z, i});
        tmp.push_back(x);
        tmp.push_back(y);
        tmp.push_back(z);
    }

    sort(all(tmp));
    uniq(tmp);

    auto getid = [&](int x){
        return lower_bound(all(tmp), x) - tmp.begin();
    };
    sort(all(a), [](pii x, pii y){
        return x.second>y.second;
    });
    sort(q1.begin(), q1.end(), [](array<int, 3> x, array<int, 3> y){
        return x[1]>y[1];
    });
    int m = sz(tmp);
    SegTree<int> seg(m, 0);
    int ind = 0;
    for (auto [x, y, id]:q1){
        while(ind<n && a[ind].second>=y){
            seg.update(getid(a[ind].first), 1);
            ind++;
        }
        ans[id] = seg.query(getid(x), m);
    }

    sort(all(a), [](pii x, pii y){
        return x.first+x.second>y.first + y.second;
    });
    sort(all(q2), [](array<int, 4>& x, array<int, 4>& y){
        return x[2]>y[2];
    });
    seg = SegTree<int>(m, 0);
    ind = 0;
    for (auto [x1, x2, y, id]:q2){
        while(ind<n && a[ind].second+a[ind].first>=y){
            seg.update(getid(a[ind].first), 1);
            ind++;
        }
        ans[id] += seg.query(getid(x1), getid(x2));
    }
    for (int i = 0;i<q;i++) cout<<ans[i]<<'\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);


#define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
    freopen("debug.dbg", "w", stderr);
    int tt = clock();
#endif

    int t=1, i = 1;
    // cin>>t;
    while(t--){
        // cout<<"Case #"<<i++<<": ";
        solve();
        cout<<'\n';
    }
#ifndef ONLINE_JUDGE
    cerr << "TIME = " << (float)(clock() - tt)/CLOCKS_PER_SEC << endl;
    tt = clock();
#endif
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:209:14: warning: unused variable 'i' [-Wunused-variable]
  209 |     int t=1, i = 1;
      |              ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 5 ms 1492 KB Output is correct
8 Correct 5 ms 1368 KB Output is correct
9 Correct 5 ms 1496 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 4 ms 1368 KB Output is correct
15 Correct 4 ms 952 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 4 ms 1072 KB Output is correct
18 Correct 2 ms 780 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15780 KB Output is correct
2 Correct 154 ms 16296 KB Output is correct
3 Correct 154 ms 16660 KB Output is correct
4 Correct 124 ms 13016 KB Output is correct
5 Correct 100 ms 12508 KB Output is correct
6 Correct 68 ms 10968 KB Output is correct
7 Correct 145 ms 15868 KB Output is correct
8 Correct 149 ms 16444 KB Output is correct
9 Correct 140 ms 12632 KB Output is correct
10 Correct 95 ms 13816 KB Output is correct
11 Correct 120 ms 13016 KB Output is correct
12 Correct 55 ms 10728 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 155 ms 15780 KB Output is correct
2 Correct 154 ms 16296 KB Output is correct
3 Correct 154 ms 16660 KB Output is correct
4 Correct 124 ms 13016 KB Output is correct
5 Correct 100 ms 12508 KB Output is correct
6 Correct 68 ms 10968 KB Output is correct
7 Correct 145 ms 15868 KB Output is correct
8 Correct 149 ms 16444 KB Output is correct
9 Correct 140 ms 12632 KB Output is correct
10 Correct 95 ms 13816 KB Output is correct
11 Correct 120 ms 13016 KB Output is correct
12 Correct 55 ms 10728 KB Output is correct
13 Correct 200 ms 15420 KB Output is correct
14 Correct 182 ms 15408 KB Output is correct
15 Correct 154 ms 15832 KB Output is correct
16 Correct 148 ms 12732 KB Output is correct
17 Correct 131 ms 13528 KB Output is correct
18 Correct 70 ms 11752 KB Output is correct
19 Correct 210 ms 15816 KB Output is correct
20 Correct 183 ms 16508 KB Output is correct
21 Correct 182 ms 16252 KB Output is correct
22 Correct 90 ms 13776 KB Output is correct
23 Correct 123 ms 13008 KB Output is correct
24 Correct 50 ms 10460 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 456 KB Output is correct
7 Correct 5 ms 1492 KB Output is correct
8 Correct 5 ms 1368 KB Output is correct
9 Correct 5 ms 1496 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 3 ms 856 KB Output is correct
13 Correct 4 ms 1116 KB Output is correct
14 Correct 4 ms 1368 KB Output is correct
15 Correct 4 ms 952 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 4 ms 1072 KB Output is correct
18 Correct 2 ms 780 KB Output is correct
19 Correct 155 ms 15780 KB Output is correct
20 Correct 154 ms 16296 KB Output is correct
21 Correct 154 ms 16660 KB Output is correct
22 Correct 124 ms 13016 KB Output is correct
23 Correct 100 ms 12508 KB Output is correct
24 Correct 68 ms 10968 KB Output is correct
25 Correct 145 ms 15868 KB Output is correct
26 Correct 149 ms 16444 KB Output is correct
27 Correct 140 ms 12632 KB Output is correct
28 Correct 95 ms 13816 KB Output is correct
29 Correct 120 ms 13016 KB Output is correct
30 Correct 55 ms 10728 KB Output is correct
31 Correct 200 ms 15420 KB Output is correct
32 Correct 182 ms 15408 KB Output is correct
33 Correct 154 ms 15832 KB Output is correct
34 Correct 148 ms 12732 KB Output is correct
35 Correct 131 ms 13528 KB Output is correct
36 Correct 70 ms 11752 KB Output is correct
37 Correct 210 ms 15816 KB Output is correct
38 Correct 183 ms 16508 KB Output is correct
39 Correct 182 ms 16252 KB Output is correct
40 Correct 90 ms 13776 KB Output is correct
41 Correct 123 ms 13008 KB Output is correct
42 Correct 50 ms 10460 KB Output is correct
43 Correct 209 ms 30164 KB Output is correct
44 Correct 207 ms 30424 KB Output is correct
45 Correct 206 ms 29652 KB Output is correct
46 Correct 168 ms 20688 KB Output is correct
47 Correct 136 ms 20948 KB Output is correct
48 Correct 75 ms 11740 KB Output is correct
49 Correct 203 ms 30464 KB Output is correct
50 Correct 207 ms 30548 KB Output is correct
51 Correct 207 ms 28888 KB Output is correct
52 Correct 133 ms 20692 KB Output is correct
53 Correct 141 ms 15576 KB Output is correct