oj.uz

답안 #1078654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078654 2024-08-28T03:08:49 Z doducanh Examination (JOI19_examination) C++14
43 / 100
 1388 ms 66424 KB 
///breaker
#pragma GCC optimize("O3")
#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 BIT
{
    int t[maxn];
    void add(int x,int val){for(;x;x-=(x&(-x)))t[x]+=val;}
    int get(int x){if(!x)return 0;int res=0;for(;x<maxn;x+=(x&(-x)))res+=t[x];return res;}
}t[sz+7];
struct Data
{
    int x,y,z,id;
};
int n,q;
Data a[maxn];
Data qu[maxn];
int ans[maxn];
ordered_set s[maxn];
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;
    vector<int>vx;
    vector<int>vy;
    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,1);
        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";
    }
}
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:82:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |             for(int block=(pos1-1)/sz+1; block<=(vx.size()-1)/sz; block++)tmp+=t[block].get(pos2);
      |                                          ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9820 KB Output is correct
2 Correct 6 ms 9820 KB Output is correct
3 Correct 6 ms 9712 KB Output is correct
4 Correct 7 ms 9816 KB Output is correct
5 Correct 7 ms 9828 KB Output is correct
6 Correct 6 ms 9820 KB Output is correct
7 Correct 12 ms 10312 KB Output is correct
8 Correct 12 ms 10332 KB Output is correct
9 Correct 12 ms 10332 KB Output is correct
10 Correct 10 ms 10072 KB Output is correct
11 Correct 11 ms 10072 KB Output is correct
12 Correct 10 ms 10148 KB Output is correct
13 Correct 11 ms 10328 KB Output is correct
14 Correct 11 ms 10332 KB Output is correct
15 Correct 12 ms 10332 KB Output is correct
16 Correct 10 ms 10076 KB Output is correct
17 Correct 10 ms 10076 KB Output is correct
18 Correct 8 ms 10076 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1181 ms 66052 KB Output is correct
2 Correct 1119 ms 66380 KB Output is correct
3 Correct 1162 ms 66168 KB Output is correct
4 Correct 628 ms 21620 KB Output is correct
5 Correct 269 ms 21108 KB Output is correct
6 Correct 199 ms 20992 KB Output is correct
7 Correct 1388 ms 65904 KB Output is correct
8 Correct 722 ms 66164 KB Output is correct
9 Correct 858 ms 66168 KB Output is correct
10 Correct 168 ms 20848 KB Output is correct
11 Correct 541 ms 21508 KB Output is correct
12 Correct 155 ms 20592 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1181 ms 66052 KB Output is correct
2 Correct 1119 ms 66380 KB Output is correct
3 Correct 1162 ms 66168 KB Output is correct
4 Correct 628 ms 21620 KB Output is correct
5 Correct 269 ms 21108 KB Output is correct
6 Correct 199 ms 20992 KB Output is correct
7 Correct 1388 ms 65904 KB Output is correct
8 Correct 722 ms 66164 KB Output is correct
9 Correct 858 ms 66168 KB Output is correct
10 Correct 168 ms 20848 KB Output is correct
11 Correct 541 ms 21508 KB Output is correct
12 Correct 155 ms 20592 KB Output is correct
13 Correct 810 ms 66348 KB Output is correct
14 Correct 1106 ms 66168 KB Output is correct
15 Correct 1169 ms 66400 KB Output is correct
16 Correct 503 ms 21616 KB Output is correct
17 Correct 244 ms 21104 KB Output is correct
18 Correct 193 ms 20836 KB Output is correct
19 Correct 840 ms 66424 KB Output is correct
20 Correct 930 ms 66164 KB Output is correct
21 Correct 700 ms 66376 KB Output is correct
22 Correct 169 ms 21108 KB Output is correct
23 Correct 528 ms 21624 KB Output is correct
24 Correct 159 ms 20404 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9820 KB Output is correct
2 Correct 6 ms 9820 KB Output is correct
3 Correct 6 ms 9712 KB Output is correct
4 Correct 7 ms 9816 KB Output is correct
5 Correct 7 ms 9828 KB Output is correct
6 Correct 6 ms 9820 KB Output is correct
7 Correct 12 ms 10312 KB Output is correct
8 Correct 12 ms 10332 KB Output is correct
9 Correct 12 ms 10332 KB Output is correct
10 Correct 10 ms 10072 KB Output is correct
11 Correct 11 ms 10072 KB Output is correct
12 Correct 10 ms 10148 KB Output is correct
13 Correct 11 ms 10328 KB Output is correct
14 Correct 11 ms 10332 KB Output is correct
15 Correct 12 ms 10332 KB Output is correct
16 Correct 10 ms 10076 KB Output is correct
17 Correct 10 ms 10076 KB Output is correct
18 Correct 8 ms 10076 KB Output is correct
19 Correct 1181 ms 66052 KB Output is correct
20 Correct 1119 ms 66380 KB Output is correct
21 Correct 1162 ms 66168 KB Output is correct
22 Correct 628 ms 21620 KB Output is correct
23 Correct 269 ms 21108 KB Output is correct
24 Correct 199 ms 20992 KB Output is correct
25 Correct 1388 ms 65904 KB Output is correct
26 Correct 722 ms 66164 KB Output is correct
27 Correct 858 ms 66168 KB Output is correct
28 Correct 168 ms 20848 KB Output is correct
29 Correct 541 ms 21508 KB Output is correct
30 Correct 155 ms 20592 KB Output is correct
31 Correct 810 ms 66348 KB Output is correct
32 Correct 1106 ms 66168 KB Output is correct
33 Correct 1169 ms 66400 KB Output is correct
34 Correct 503 ms 21616 KB Output is correct
35 Correct 244 ms 21104 KB Output is correct
36 Correct 193 ms 20836 KB Output is correct
37 Correct 840 ms 66424 KB Output is correct
38 Correct 930 ms 66164 KB Output is correct
39 Correct 700 ms 66376 KB Output is correct
40 Correct 169 ms 21108 KB Output is correct
41 Correct 528 ms 21624 KB Output is correct
42 Correct 159 ms 20404 KB Output is correct
43 Runtime error 77 ms 28280 KB Execution killed with signal 11
44 Halted 0 ms 0 KB -