oj.uz

Submission #1078663

# Submission time Handle Problem Language Result Execution time Memory
1078663 2024-08-28T03:41:23 Z doducanh Examination (JOI19_examination) C++14
100 / 100
 2208 ms 173828 KB 
///breaker
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx")
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>

#define ll long long
#define fi first
#define se second
#define ii pair<int,int>
#define mp make_pair
#define in(x) freopen(x,"r",stdin)
#define out(x) freopen(x,"w",stdout)
#define bit(x,i) ((x>>i)&1)
#define lc (id<<1)
#define rc ((id<<1)^1)
const int maxn=2e5+7;
const int sz=350;
struct fenwick
{
    vector <int> fen;
    int n;
    fenwick(int _n=1e5)
    {
        n=_n;
        fen.assign(n+5,0);
    }
    void add(int pos)
    {
        for(;pos>0;pos-=pos&-pos) fen[pos]++;
        return;
    }
    int get(int pos)
    {
        if (!pos) return 0;
        int ans=0;
        for(;pos<=n;pos+=pos&-pos) ans+=fen[pos];
        return ans;
    }
}t[sz+3];
struct Data
{
    int x,y,z,id;
};
int n,q;
Data a[maxn];
Data qu[maxn];
int ans[maxn];
ordered_set s[maxn];
vector<int>vx;
vector<int>vy;
int pos(int x,vector<int>&v)
{
    return lower_bound(v.begin(),v.end(),x)-v.begin()+1;
}
bool cmp(Data &a,Data &b)
{
    return a.z>b.z;
}
void sol(void){
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
        vx.push_back(a[i].x);
        vy.push_back(a[i].y);
        a[i].z=a[i].x+a[i].y;
    }
    for(int i=1;i<=q;i++){
        cin>>qu[i].x>>qu[i].y>>qu[i].z;
        qu[i].id=i;
    }
    sort(vx.begin(),vx.end());
    sort(vy.begin(),vy.end());
    vx.erase(unique(vx.begin(),vx.end()),vx.end());
    vy.erase(unique(vy.begin(),vy.end()),vy.end());
    sort(a+1,a+n+1,cmp);
    sort(qu+1,qu+q+1,cmp);
    int l=1;
    for(int i=1;i<=n;i++){
        int pos1=pos(a[i].x,vx);
        int pos2=pos(a[i].y,vy);
        t[(pos1-1)/sz].add(pos2);
        s[pos1].insert({pos2,i});
        if(i<n&&a[i].z==a[i+1].z)continue;
        while(l<=q&&(i==n||qu[l].z>a[i+1].z)){
            if(qu[l].z>a[i].z){
                l++;
                continue;
            }
            pos1=pos(qu[l].x,vx);
            pos2=pos(qu[l].y,vy);
            int tmp=0;
            for(int block=(pos1-1)/sz+1; block<=(vx.size()-1)/sz; block++)tmp+=t[block].get(pos2);
            for(int els=pos1; els<=((pos1-1)/sz+1)*sz; els++)tmp+=s[els].size()-s[els].order_of_key({pos2,0});
            ans[qu[l].id]=tmp;
            l++;
        }
    }
    for(int i=1;i<=q;i++){
        cout<<ans[i]<<"\n";
    }
    return;
}
signed main(void)
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;
    while(t--){
        sol();
    }
    // you should actually read the stuff at the bottom
    return 0;
}
/* stuff you should look for
 * int overflow, array bounds
 * special cases (n=1?)
 * do smth instead of nothing and stay organized
 * WRITE STUFF DOWN
 * DON'T GET STUCK ON ONE APPROACH
 */

Compilation message

examination.cpp: In function 'void sol()':
examination.cpp:98:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |             for(int block=(pos1-1)/sz+1; block<=(vx.size()-1)/sz; block++)tmp+=t[block].get(pos2);
      |                                          ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 157768 KB Output is correct
2 Correct 71 ms 157800 KB Output is correct
3 Correct 70 ms 157692 KB Output is correct
4 Correct 72 ms 157776 KB Output is correct
5 Correct 71 ms 157776 KB Output is correct
6 Correct 70 ms 157768 KB Output is correct
7 Correct 79 ms 158292 KB Output is correct
8 Correct 76 ms 158288 KB Output is correct
9 Correct 92 ms 158288 KB Output is correct
10 Correct 77 ms 158288 KB Output is correct
11 Correct 75 ms 158292 KB Output is correct
12 Correct 74 ms 158036 KB Output is correct
13 Correct 79 ms 158236 KB Output is correct
14 Correct 78 ms 158320 KB Output is correct
15 Correct 80 ms 158288 KB Output is correct
16 Correct 75 ms 158276 KB Output is correct
17 Correct 82 ms 158288 KB Output is correct
18 Correct 74 ms 158192 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1139 ms 171296 KB Output is correct
2 Correct 1197 ms 171412 KB Output is correct
3 Correct 1164 ms 171420 KB Output is correct
4 Correct 759 ms 170692 KB Output is correct
5 Correct 339 ms 170704 KB Output is correct
6 Correct 258 ms 169924 KB Output is correct
7 Correct 1540 ms 171324 KB Output is correct
8 Correct 737 ms 171464 KB Output is correct
9 Correct 981 ms 171356 KB Output is correct
10 Correct 208 ms 170440 KB Output is correct
11 Correct 645 ms 170568 KB Output is correct
12 Correct 212 ms 169676 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1139 ms 171296 KB Output is correct
2 Correct 1197 ms 171412 KB Output is correct
3 Correct 1164 ms 171420 KB Output is correct
4 Correct 759 ms 170692 KB Output is correct
5 Correct 339 ms 170704 KB Output is correct
6 Correct 258 ms 169924 KB Output is correct
7 Correct 1540 ms 171324 KB Output is correct
8 Correct 737 ms 171464 KB Output is correct
9 Correct 981 ms 171356 KB Output is correct
10 Correct 208 ms 170440 KB Output is correct
11 Correct 645 ms 170568 KB Output is correct
12 Correct 212 ms 169676 KB Output is correct
13 Correct 1000 ms 171716 KB Output is correct
14 Correct 1174 ms 171924 KB Output is correct
15 Correct 1132 ms 171328 KB Output is correct
16 Correct 635 ms 171100 KB Output is correct
17 Correct 304 ms 170952 KB Output is correct
18 Correct 248 ms 169996 KB Output is correct
19 Correct 1065 ms 171948 KB Output is correct
20 Correct 1091 ms 172136 KB Output is correct
21 Correct 994 ms 171716 KB Output is correct
22 Correct 216 ms 170440 KB Output is correct
23 Correct 647 ms 170508 KB Output is correct
24 Correct 207 ms 169616 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 157768 KB Output is correct
2 Correct 71 ms 157800 KB Output is correct
3 Correct 70 ms 157692 KB Output is correct
4 Correct 72 ms 157776 KB Output is correct
5 Correct 71 ms 157776 KB Output is correct
6 Correct 70 ms 157768 KB Output is correct
7 Correct 79 ms 158292 KB Output is correct
8 Correct 76 ms 158288 KB Output is correct
9 Correct 92 ms 158288 KB Output is correct
10 Correct 77 ms 158288 KB Output is correct
11 Correct 75 ms 158292 KB Output is correct
12 Correct 74 ms 158036 KB Output is correct
13 Correct 79 ms 158236 KB Output is correct
14 Correct 78 ms 158320 KB Output is correct
15 Correct 80 ms 158288 KB Output is correct
16 Correct 75 ms 158276 KB Output is correct
17 Correct 82 ms 158288 KB Output is correct
18 Correct 74 ms 158192 KB Output is correct
19 Correct 1139 ms 171296 KB Output is correct
20 Correct 1197 ms 171412 KB Output is correct
21 Correct 1164 ms 171420 KB Output is correct
22 Correct 759 ms 170692 KB Output is correct
23 Correct 339 ms 170704 KB Output is correct
24 Correct 258 ms 169924 KB Output is correct
25 Correct 1540 ms 171324 KB Output is correct
26 Correct 737 ms 171464 KB Output is correct
27 Correct 981 ms 171356 KB Output is correct
28 Correct 208 ms 170440 KB Output is correct
29 Correct 645 ms 170568 KB Output is correct
30 Correct 212 ms 169676 KB Output is correct
31 Correct 1000 ms 171716 KB Output is correct
32 Correct 1174 ms 171924 KB Output is correct
33 Correct 1132 ms 171328 KB Output is correct
34 Correct 635 ms 171100 KB Output is correct
35 Correct 304 ms 170952 KB Output is correct
36 Correct 248 ms 169996 KB Output is correct
37 Correct 1065 ms 171948 KB Output is correct
38 Correct 1091 ms 172136 KB Output is correct
39 Correct 994 ms 171716 KB Output is correct
40 Correct 216 ms 170440 KB Output is correct
41 Correct 647 ms 170508 KB Output is correct
42 Correct 207 ms 169616 KB Output is correct
43 Correct 1460 ms 173756 KB Output is correct
44 Correct 1492 ms 173764 KB Output is correct
45 Correct 1501 ms 173828 KB Output is correct
46 Correct 910 ms 172180 KB Output is correct
47 Correct 308 ms 172228 KB Output is correct
48 Correct 195 ms 169924 KB Output is correct
49 Correct 2208 ms 173620 KB Output is correct
50 Correct 913 ms 173736 KB Output is correct
51 Correct 1363 ms 173516 KB Output is correct
52 Correct 292 ms 172144 KB Output is correct
53 Correct 870 ms 171208 KB Output is correct