oj.uz

답안 #209052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
209052 2020-03-13T03:13:24 Z coldEr66 Examination (JOI19_examination) C++14
100 / 100
 285 ms 15072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define eb emplace_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"LIND %d: (%s) = ",__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }

const ll MAXn=2e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;

struct query{
    int x,y,z,id;
} tmpdt[MAXn];
bool cmp(const query &a,const query &b){
    if (a.x != b.x) return a.x > b.x;
    if (a.y != b.y) return a.y > b.y;
    if (a.z != b.z) return a.z > b.z;
    return a.id < b.id;
}
vector<query> dt;
int ans[MAXn],bit[MAXn];
vector<int> rk;
int lowbit(int x){return x&(-x);}
void ins(int x,int v){
    for (;x>0;x-=lowbit(x)) bit[x] += v;
}
int qr(int x){
    int ret = 0;
    for (;x<MAXn;x+=lowbit(x)) ret += bit[x];
    return ret;
}
int GTPOS(int x){
    return int(lower_bound(ALL(rk),x) - rk.begin() + 1);
}
void CDQ(int l,int r){
    // debug(l,r);
    if (l == r-1) return;
    int mid = (l+r)>>1;
    CDQ(l,mid), CDQ(mid,r);
    int tl = l, tr = mid;
    int idx = 0;
    vector<int> op;
    while (tl < mid && tr < r) {
        if (dt[tl].y >= dt[tr].y) {
            if (dt[tl].id == -1) {
                ins(dt[tl].z,1);
                op.eb(dt[tl].z);
            }
            tmpdt[idx++] = dt[tl++];
        }
        else {
            if (dt[tr].id != -1) {
                ans[dt[tr].id] += qr(dt[tr].z);
            }
            tmpdt[idx++] = dt[tr++];
        }
    }
    while (tl < mid) {
        tmpdt[idx++] = dt[tl++];
    }
    while (tr < r) {
        if (dt[tr].id != -1){
            ans[dt[tr].id] += qr(dt[tr].z);
        }
        tmpdt[idx++] = dt[tr++];
    }
    for (int i=l;i<r;i++) {
        dt[i] = tmpdt[i-l];
    }
    for (auto i:op) ins(i,-1);
}
int main(){
    IOS();
    int n,q;
    cin >> n >> q;
    REP (i,n) {
        int s,t;
        cin >> s >> t;
        rk.eb(s+t);
        query tmp = (query){s,t,s+t,-1};
        dt.eb(tmp);
    }
    REP (i,q) {
        int x,y,z;
        cin >> x >> y >> z;
        rk.eb(z);
        query tmp = (query){x,y,z,i};
        dt.eb(tmp);
    }
    sort(ALL(rk));
    rk.resize(unique(ALL(rk))-rk.begin());
    sort(ALL(dt),cmp);
    REP (i,SZ(dt)) {
        dt[i].z = GTPOS(dt[i].z);
    }
    REP (i,SZ(dt)) debug(dt[i].x,dt[i].y,dt[i].z,dt[i].id);
    CDQ(0,SZ(dt));
    REP (i,q) cout << ans[i] << endl;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 12 ms 736 KB Output is correct
8 Correct 11 ms 760 KB Output is correct
9 Correct 11 ms 764 KB Output is correct
10 Correct 10 ms 760 KB Output is correct
11 Correct 11 ms 764 KB Output is correct
12 Correct 9 ms 760 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 788 KB Output is correct
15 Correct 11 ms 788 KB Output is correct
16 Correct 9 ms 760 KB Output is correct
17 Correct 10 ms 760 KB Output is correct
18 Correct 8 ms 760 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 9812 KB Output is correct
2 Correct 241 ms 9716 KB Output is correct
3 Correct 245 ms 12128 KB Output is correct
4 Correct 202 ms 11364 KB Output is correct
5 Correct 205 ms 11472 KB Output is correct
6 Correct 138 ms 10464 KB Output is correct
7 Correct 214 ms 12132 KB Output is correct
8 Correct 218 ms 12128 KB Output is correct
9 Correct 208 ms 12000 KB Output is correct
10 Correct 195 ms 11232 KB Output is correct
11 Correct 196 ms 11360 KB Output is correct
12 Correct 115 ms 10080 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 241 ms 9812 KB Output is correct
2 Correct 241 ms 9716 KB Output is correct
3 Correct 245 ms 12128 KB Output is correct
4 Correct 202 ms 11364 KB Output is correct
5 Correct 205 ms 11472 KB Output is correct
6 Correct 138 ms 10464 KB Output is correct
7 Correct 214 ms 12132 KB Output is correct
8 Correct 218 ms 12128 KB Output is correct
9 Correct 208 ms 12000 KB Output is correct
10 Correct 195 ms 11232 KB Output is correct
11 Correct 196 ms 11360 KB Output is correct
12 Correct 115 ms 10080 KB Output is correct
13 Correct 266 ms 12776 KB Output is correct
14 Correct 267 ms 12768 KB Output is correct
15 Correct 239 ms 12128 KB Output is correct
16 Correct 237 ms 12028 KB Output is correct
17 Correct 230 ms 11872 KB Output is correct
18 Correct 141 ms 10464 KB Output is correct
19 Correct 262 ms 12768 KB Output is correct
20 Correct 260 ms 12768 KB Output is correct
21 Correct 263 ms 12768 KB Output is correct
22 Correct 190 ms 11216 KB Output is correct
23 Correct 188 ms 11232 KB Output is correct
24 Correct 120 ms 10080 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 380 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 12 ms 736 KB Output is correct
8 Correct 11 ms 760 KB Output is correct
9 Correct 11 ms 764 KB Output is correct
10 Correct 10 ms 760 KB Output is correct
11 Correct 11 ms 764 KB Output is correct
12 Correct 9 ms 760 KB Output is correct
13 Correct 11 ms 888 KB Output is correct
14 Correct 11 ms 788 KB Output is correct
15 Correct 11 ms 788 KB Output is correct
16 Correct 9 ms 760 KB Output is correct
17 Correct 10 ms 760 KB Output is correct
18 Correct 8 ms 760 KB Output is correct
19 Correct 241 ms 9812 KB Output is correct
20 Correct 241 ms 9716 KB Output is correct
21 Correct 245 ms 12128 KB Output is correct
22 Correct 202 ms 11364 KB Output is correct
23 Correct 205 ms 11472 KB Output is correct
24 Correct 138 ms 10464 KB Output is correct
25 Correct 214 ms 12132 KB Output is correct
26 Correct 218 ms 12128 KB Output is correct
27 Correct 208 ms 12000 KB Output is correct
28 Correct 195 ms 11232 KB Output is correct
29 Correct 196 ms 11360 KB Output is correct
30 Correct 115 ms 10080 KB Output is correct
31 Correct 266 ms 12776 KB Output is correct
32 Correct 267 ms 12768 KB Output is correct
33 Correct 239 ms 12128 KB Output is correct
34 Correct 237 ms 12028 KB Output is correct
35 Correct 230 ms 11872 KB Output is correct
36 Correct 141 ms 10464 KB Output is correct
37 Correct 262 ms 12768 KB Output is correct
38 Correct 260 ms 12768 KB Output is correct
39 Correct 263 ms 12768 KB Output is correct
40 Correct 190 ms 11216 KB Output is correct
41 Correct 188 ms 11232 KB Output is correct
42 Correct 120 ms 10080 KB Output is correct
43 Correct 278 ms 15048 KB Output is correct
44 Correct 285 ms 15072 KB Output is correct
45 Correct 285 ms 14944 KB Output is correct
46 Correct 251 ms 13536 KB Output is correct
47 Correct 241 ms 13536 KB Output is correct
48 Correct 147 ms 10208 KB Output is correct
49 Correct 260 ms 15072 KB Output is correct
50 Correct 274 ms 15072 KB Output is correct
51 Correct 258 ms 14816 KB Output is correct
52 Correct 230 ms 13464 KB Output is correct
53 Correct 199 ms 12128 KB Output is correct