oj.uz

Submission #1078661

# Submission time Handle Problem Language Result Execution time Memory
1078661 2024-08-28T03:24:53 Z doducanh Examination (JOI19_examination) C++14
43 / 100
 1519 ms 313968 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=1e5+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:100:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |             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 64 ms 148320 KB Output is correct
2 Correct 64 ms 148308 KB Output is correct
3 Correct 66 ms 148304 KB Output is correct
4 Correct 68 ms 148520 KB Output is correct
5 Correct 64 ms 148308 KB Output is correct
6 Correct 65 ms 148308 KB Output is correct
7 Correct 70 ms 148816 KB Output is correct
8 Correct 74 ms 148816 KB Output is correct
9 Correct 75 ms 148948 KB Output is correct
10 Correct 68 ms 148820 KB Output is correct
11 Correct 67 ms 148820 KB Output is correct
12 Correct 70 ms 148736 KB Output is correct
13 Correct 78 ms 148816 KB Output is correct
14 Correct 77 ms 148752 KB Output is correct
15 Correct 71 ms 148912 KB Output is correct
16 Correct 72 ms 148820 KB Output is correct
17 Correct 70 ms 148812 KB Output is correct
18 Correct 71 ms 148880 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1093 ms 161912 KB Output is correct
2 Correct 1117 ms 161908 KB Output is correct
3 Correct 1125 ms 161992 KB Output is correct
4 Correct 682 ms 161396 KB Output is correct
5 Correct 326 ms 161340 KB Output is correct
6 Correct 245 ms 160632 KB Output is correct
7 Correct 1519 ms 162024 KB Output is correct
8 Correct 711 ms 161964 KB Output is correct
9 Correct 937 ms 161872 KB Output is correct
10 Correct 223 ms 161144 KB Output is correct
11 Correct 590 ms 161028 KB Output is correct
12 Correct 209 ms 160116 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1093 ms 161912 KB Output is correct
2 Correct 1117 ms 161908 KB Output is correct
3 Correct 1125 ms 161992 KB Output is correct
4 Correct 682 ms 161396 KB Output is correct
5 Correct 326 ms 161340 KB Output is correct
6 Correct 245 ms 160632 KB Output is correct
7 Correct 1519 ms 162024 KB Output is correct
8 Correct 711 ms 161964 KB Output is correct
9 Correct 937 ms 161872 KB Output is correct
10 Correct 223 ms 161144 KB Output is correct
11 Correct 590 ms 161028 KB Output is correct
12 Correct 209 ms 160116 KB Output is correct
13 Correct 941 ms 162436 KB Output is correct
14 Correct 1096 ms 162420 KB Output is correct
15 Correct 1139 ms 161916 KB Output is correct
16 Correct 628 ms 161652 KB Output is correct
17 Correct 288 ms 161752 KB Output is correct
18 Correct 247 ms 160632 KB Output is correct
19 Correct 971 ms 162528 KB Output is correct
20 Correct 1030 ms 162540 KB Output is correct
21 Correct 854 ms 162420 KB Output is correct
22 Correct 219 ms 161088 KB Output is correct
23 Correct 645 ms 161140 KB Output is correct
24 Correct 203 ms 160220 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 148320 KB Output is correct
2 Correct 64 ms 148308 KB Output is correct
3 Correct 66 ms 148304 KB Output is correct
4 Correct 68 ms 148520 KB Output is correct
5 Correct 64 ms 148308 KB Output is correct
6 Correct 65 ms 148308 KB Output is correct
7 Correct 70 ms 148816 KB Output is correct
8 Correct 74 ms 148816 KB Output is correct
9 Correct 75 ms 148948 KB Output is correct
10 Correct 68 ms 148820 KB Output is correct
11 Correct 67 ms 148820 KB Output is correct
12 Correct 70 ms 148736 KB Output is correct
13 Correct 78 ms 148816 KB Output is correct
14 Correct 77 ms 148752 KB Output is correct
15 Correct 71 ms 148912 KB Output is correct
16 Correct 72 ms 148820 KB Output is correct
17 Correct 70 ms 148812 KB Output is correct
18 Correct 71 ms 148880 KB Output is correct
19 Correct 1093 ms 161912 KB Output is correct
20 Correct 1117 ms 161908 KB Output is correct
21 Correct 1125 ms 161992 KB Output is correct
22 Correct 682 ms 161396 KB Output is correct
23 Correct 326 ms 161340 KB Output is correct
24 Correct 245 ms 160632 KB Output is correct
25 Correct 1519 ms 162024 KB Output is correct
26 Correct 711 ms 161964 KB Output is correct
27 Correct 937 ms 161872 KB Output is correct
28 Correct 223 ms 161144 KB Output is correct
29 Correct 590 ms 161028 KB Output is correct
30 Correct 209 ms 160116 KB Output is correct
31 Correct 941 ms 162436 KB Output is correct
32 Correct 1096 ms 162420 KB Output is correct
33 Correct 1139 ms 161916 KB Output is correct
34 Correct 628 ms 161652 KB Output is correct
35 Correct 288 ms 161752 KB Output is correct
36 Correct 247 ms 160632 KB Output is correct
37 Correct 971 ms 162528 KB Output is correct
38 Correct 1030 ms 162540 KB Output is correct
39 Correct 854 ms 162420 KB Output is correct
40 Correct 219 ms 161088 KB Output is correct
41 Correct 645 ms 161140 KB Output is correct
42 Correct 203 ms 160220 KB Output is correct
43 Runtime error 254 ms 313968 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -