oj.uz

답안 #673526

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
673526 2022-12-20T21:12:37 Z Carmel_Ab1 Examination (JOI19_examination) C++17
100 / 100
 1388 ms 550756 KB 
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#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;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map


template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}



void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
struct seg{
    seg* lp=0,*rp=0;
    int l,r,m;
    int sum=0;

    seg(int l,int r):l(l),r(r),m((l+r)/2){}

    void expand(){
        if(!lp)lp=new seg(l,m);
        if(!rp)rp=new seg(m,r);
    }
    void upd(int i,int v){
        sum+=v;
        if(l+1==r)
            return;
        expand();
        if(i<m)
            lp->upd(i,v);
        else
            rp->upd(i,v);
    }

    int qur(int a,int b){
        if(b<=l || r<=a)
            return 0;
        if(a<=l && r<=b)
            return sum;
        expand();
        return lp->qur(a,b) + rp->qur(a,b);
    }
};

/*
 Basically what we do is split the queries into 2 types:
 type (1): queries where A+B>=C: then we only need to count S>=A, T>=B, (and then it applies that S+T>=A+B>=C).
 So we only need to count how many fulfil S>=A, T>=B.
 This can be done offline - sorting queries and pairs by S/A, then querying a segment tree on [B,inf].

 type (2): queries where A+B<C:
 Now try to visualize pairs of (S[i],T[i]) on the cartesian plane.
 The restrictions of the queries can be modeled in the following way:

  \   |
   \  |
    \ |"This area is what we want"
     \|
      |\
----------------------------------------------- "limit A"
      |   \
      |    \"limit C"
     "limit B"

 Then we can count how many (S+T>=C AND T>=B) - (S+T>=C AND A<S).

 This can be done similarly to type (1) queries.

 Also see: https://codeforces.com/blog/entry/66022?#comment-501375
 */
void solve() {
    int n,q;
    cin >> n >> q;
    vvl a(n,vl(2));
    for(int i=0 ;i<n; i++)
        cin >> a[i][0] >> a[i][1];

    vvl queries(q,vl(4));
    for(int i=0; i<q; i++){
        cin >>queries[i][0] >> queries[i][1] >> queries[i][2];
        queries[i][3]=i;
    }
    sort(all(a));
    sort(all(queries));

    vi ans(q);
    seg ST(0,1e9 +10);

    for(int i=0; i<n; i++)
        ST.upd(a[i][1],1);

    for(int i=0,j=0; i<q; i++){
        while(j<n && a[j][0]<queries[i][0])
            ST.upd(a[j++][1],-1);
        if(queries[i][0]+queries[i][1]>=queries[i][2])
            ans[queries[i][3]] = ST.qur(queries[i][1],1e9 + 2);
    }

    sort(all(a),[&](vl v1,vl v2){
        return v1[0]+v1[1] < v2[0]+v2[1];
    });
    sort(all(queries),[&](vl v1,vl v2){
       return v1[2]<v2[2];
    });
    ST = seg(0,1e9 + 10);
    for(int i=0; i<n;i++)
        ST.upd(a[i][1],1);

    for(int i=0,j=0; i<q; i++){
        ll A=queries[i][0],B=queries[i][1],C=queries[i][2],ix=queries[i][3];
        if(A+B>=C)
            continue;
        while(j<n && a[j][0]+a[j][1]<C)
            ST.upd(a[j][1],-1), j++;
        ans[ix] = ST.qur(B,1e9 + 2);
    }


    ST = seg(0,1e9 + 10);
    for(int i=0; i<n;i++)
        ST.upd(a[i][0],1);
    for(int i=0,j=0; i<q; i++){
        ll A=queries[i][0],B=queries[i][1],C=queries[i][2],ix=queries[i][3];
        if(A+B>=C)
            continue;
        while(j<n && a[j][0]+a[j][1]<C)
            ST.upd(a[j][0],-1), j++;
        ans[ix] -= ST.qur(0,A);
    }


    for(int x:ans)
        cout << x << "\n";
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 33 ms 23028 KB Output is correct
8 Correct 30 ms 23164 KB Output is correct
9 Correct 30 ms 23076 KB Output is correct
10 Correct 16 ms 8192 KB Output is correct
11 Correct 23 ms 15632 KB Output is correct
12 Correct 8 ms 716 KB Output is correct
13 Correct 27 ms 20812 KB Output is correct
14 Correct 34 ms 20780 KB Output is correct
15 Correct 35 ms 20832 KB Output is correct
16 Correct 20 ms 15564 KB Output is correct
17 Correct 17 ms 8348 KB Output is correct
18 Correct 7 ms 740 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 464 ms 40988 KB Output is correct
2 Correct 474 ms 41020 KB Output is correct
3 Correct 503 ms 41092 KB Output is correct
4 Correct 341 ms 23164 KB Output is correct
5 Correct 410 ms 32364 KB Output is correct
6 Correct 306 ms 14336 KB Output is correct
7 Correct 471 ms 41180 KB Output is correct
8 Correct 492 ms 40660 KB Output is correct
9 Correct 473 ms 40812 KB Output is correct
10 Correct 350 ms 32092 KB Output is correct
11 Correct 358 ms 22972 KB Output is correct
12 Correct 266 ms 13904 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 464 ms 40988 KB Output is correct
2 Correct 474 ms 41020 KB Output is correct
3 Correct 503 ms 41092 KB Output is correct
4 Correct 341 ms 23164 KB Output is correct
5 Correct 410 ms 32364 KB Output is correct
6 Correct 306 ms 14336 KB Output is correct
7 Correct 471 ms 41180 KB Output is correct
8 Correct 492 ms 40660 KB Output is correct
9 Correct 473 ms 40812 KB Output is correct
10 Correct 350 ms 32092 KB Output is correct
11 Correct 358 ms 22972 KB Output is correct
12 Correct 266 ms 13904 KB Output is correct
13 Correct 606 ms 41344 KB Output is correct
14 Correct 614 ms 40976 KB Output is correct
15 Correct 455 ms 40772 KB Output is correct
16 Correct 437 ms 23104 KB Output is correct
17 Correct 469 ms 32124 KB Output is correct
18 Correct 354 ms 14168 KB Output is correct
19 Correct 582 ms 41220 KB Output is correct
20 Correct 628 ms 41156 KB Output is correct
21 Correct 650 ms 40980 KB Output is correct
22 Correct 391 ms 32020 KB Output is correct
23 Correct 366 ms 22732 KB Output is correct
24 Correct 298 ms 13772 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 33 ms 23028 KB Output is correct
8 Correct 30 ms 23164 KB Output is correct
9 Correct 30 ms 23076 KB Output is correct
10 Correct 16 ms 8192 KB Output is correct
11 Correct 23 ms 15632 KB Output is correct
12 Correct 8 ms 716 KB Output is correct
13 Correct 27 ms 20812 KB Output is correct
14 Correct 34 ms 20780 KB Output is correct
15 Correct 35 ms 20832 KB Output is correct
16 Correct 20 ms 15564 KB Output is correct
17 Correct 17 ms 8348 KB Output is correct
18 Correct 7 ms 740 KB Output is correct
19 Correct 464 ms 40988 KB Output is correct
20 Correct 474 ms 41020 KB Output is correct
21 Correct 503 ms 41092 KB Output is correct
22 Correct 341 ms 23164 KB Output is correct
23 Correct 410 ms 32364 KB Output is correct
24 Correct 306 ms 14336 KB Output is correct
25 Correct 471 ms 41180 KB Output is correct
26 Correct 492 ms 40660 KB Output is correct
27 Correct 473 ms 40812 KB Output is correct
28 Correct 350 ms 32092 KB Output is correct
29 Correct 358 ms 22972 KB Output is correct
30 Correct 266 ms 13904 KB Output is correct
31 Correct 606 ms 41344 KB Output is correct
32 Correct 614 ms 40976 KB Output is correct
33 Correct 455 ms 40772 KB Output is correct
34 Correct 437 ms 23104 KB Output is correct
35 Correct 469 ms 32124 KB Output is correct
36 Correct 354 ms 14168 KB Output is correct
37 Correct 582 ms 41220 KB Output is correct
38 Correct 628 ms 41156 KB Output is correct
39 Correct 650 ms 40980 KB Output is correct
40 Correct 391 ms 32020 KB Output is correct
41 Correct 366 ms 22732 KB Output is correct
42 Correct 298 ms 13772 KB Output is correct
43 Correct 1325 ms 542428 KB Output is correct
44 Correct 1365 ms 542760 KB Output is correct
45 Correct 1249 ms 508216 KB Output is correct
46 Correct 666 ms 190264 KB Output is correct
47 Correct 986 ms 365940 KB Output is correct
48 Correct 443 ms 13772 KB Output is correct
49 Correct 1153 ms 531900 KB Output is correct
50 Correct 1388 ms 550756 KB Output is correct
51 Correct 1076 ms 549884 KB Output is correct
52 Correct 751 ms 365396 KB Output is correct
53 Correct 429 ms 139900 KB Output is correct