oj.uz

답안 #623393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
623393 2022-08-05T14:13:00 Z Iwanttobreakfree Examination (JOI19_examination) C++
43 / 100
 3000 ms 44832 KB 
#include <iostream>
#include <vector>
#include <unordered_map>
#include <cmath>
#include <algorithm>
#include <set>
using namespace std;
#define pii pair<int,int>
unordered_map<int,int> mp_m,mp_i,mp_a,av;
vector<int> BIT,cnt;
int sz=700,n,q;
int next(int x){return x + (x&(-x));}
int par(int x){return x - (x&(-x));}
bool cmp(pair<int,pair<pii,pii>>& a,pair<int,pair<pii,pii>>& b){
    if(a.first!=b.first)return a.first<b.first;
    if(a.first&1)return a.second.first.second<b.second.first.second;
    return a.second.first.second>b.second.first.second;
}
int bin_find(int x,vector<int>& v){
    int l=0,r=v.size()-1,ans=v.size();
    while(l<=r){
        int mid=(r+l)/2;
        if(v[mid]<x)l=mid+1;
        else {
            ans=mid;
            r=mid-1;
        }
    }
    return ans;
}
void pupd(int x,int k){
    //cout<<x<<' '<<k<<'\n';
    for(int i=x;i<BIT.size();i=next(i))BIT[i]+=k;
}
int sum(int x){
    int ans=0;
    for(int i=x;i>0;i=par(i)){
        ans+=BIT[i];
        //cout<<i<<' '<<BIT[i]<<'\n';
    }
    return ans;
}
int val(int l,int r){
    return sum(r)-sum(l);
}
void add(int i,vector<vector<int>>& g,vector<int>& exam){
    //cout<<i<<' ';
    for(int x:g[i]){
        cnt[x]++;
        if(cnt[x]==2){
            pupd(mp_a[exam[x]]+1,+1);
        }
    }
    //cout<<ans<<' '<<'\n';
}
void del(int i,vector<vector<int>>& g,vector<int>& exam){
    //cout<<i<<' ';
    for(int x:g[i]){
        if(cnt[x]==2){
            pupd(mp_a[exam[x]]+1,-1);
        }
        cnt[x]--;
    }
    //cout<<ans<<'\n';
}
vector<vector<int>> math,info;
void MO(vector<int>& m,vector<int>& in,vector<int>& av,vector<int>& exam,vector<int>& id){
    int x,y,z;
    vector<pair<int,pair<pii,pii>>> qu(q);
    vector<int> answer(q);
    for(int i=0;i<q;i++){
        cin>>x>>y>>z;
        x=bin_find(x,m);
        y=bin_find(y,in);
        z=bin_find(z,av);
        //cout<<x<<' '<<y<<' '<<z<<' '<<id[x]<<'\n';
        qu[i]={id[x],{{x,y},{z,i}}};
    }
    sort(qu.begin(),qu.end(),cmp);
    int l_math=m.size(),l_info=in.size();
    for(int i=0;i<q;i++){
        int min_math=qu[i].second.first.first,min_info=qu[i].second.first.second,min_av=qu[i].second.second.first;
        //cout<<min_math<<' '<<min_info<<'\n';
        if(min_av==av.size()){
            answer[qu[i].second.second.second]=0;
            continue;
        }
        //cout<<l_math<<' '<<l_info<<'\n';
        while(l_math>min_math){
            l_math--;
            add(l_math,math,exam);
        }
        while(l_math<min_math){
            del(l_math,math,exam);
            l_math++;
        }
        //cout<<l_math<<' '<<l_info<<'\n';
        while(l_info>min_info){
            l_info--;
            //cout<<l_info<<' ';
            add(l_info,info,exam);
        }
        //cout<<l_info<<' ';
        while(l_info<min_info){
            del(l_info,info,exam);
            l_info++;
        }
        //cout<<l_math<<' '<<l_info<<' '<<qu[i].second.second<<' '<<ans<<' '<<sum(min_av)<<'\n';
        answer[qu[i].second.second.second]=val(min_av,BIT.size()-1);
    }
    for(int i=0;i<q;i++)cout<<answer[i]<<'\n';
}
int main(){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int x,y;
    cin>>n>>q;
    set<int> m,in,av;
    cnt=vector<int>(n);
    vector<int> exam_math(n),exam_info(n),exam_av(n),a,b,c;
    for(int i=0;i<n;i++){
        cin>>x>>y;
        m.insert(x);
        in.insert(y);
        av.insert((x+y));
        exam_math[i]=x;
        exam_info[i]=y;
        exam_av[i]=(x+y);
    }
    mp_m.reserve(131072);
    mp_i.reserve(131072);
    mp_a.reserve(131072);
    int cntm=0,cnti=0,cnta=0;
    for(int x:m){
        mp_m[x]=cntm;
        cntm++;
        a.emplace_back(x);
    }
    for(int x:in){
        mp_i[x]=cnti;
        cnti++;
        b.emplace_back(x);
    }
    for(int x:av){
        mp_a[x]=cnta;
        cnta++;
        c.emplace_back(x);
    }
    BIT=vector<int> (cnta+1);
    math=vector<vector<int>> (cntm,vector<int>());
    info=vector<vector<int>> (cnti,vector<int>());
    for(int i=0;i<n;i++){
        math[mp_m[exam_math[i]]].emplace_back(i);
        info[mp_i[exam_info[i]]].emplace_back(i);
    }
    vector<int> id(cntm+1);
    int cur=0,cont=2e6;
    for(int i=0;i<math.size();i++){
        if(math[i].size()>=sz){
            cont--;
            id[i]=cont;
            cont--;
            cur=0;
        }else if(math[i].size()+cur>sz){
            cur=0;
            id[i]=cont;
            cont--;
        }else{
            cur+=math[i].size();
            id[i]=cont;
        }
    }
    id[cntm]=cont;
    MO(a,b,c,exam_av,id);
}

Compilation message

examination.cpp: In function 'void pupd(int, int)':
examination.cpp:33:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for(int i=x;i<BIT.size();i=next(i))BIT[i]+=k;
      |                 ~^~~~~~~~~~~
examination.cpp: In function 'void MO(std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
examination.cpp:84:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |         if(min_av==av.size()){
      |            ~~~~~~^~~~~~~~~~~
examination.cpp: In function 'int main()':
examination.cpp:159:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  159 |     for(int i=0;i<math.size();i++){
      |                 ~^~~~~~~~~~~~
examination.cpp:160:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  160 |         if(math[i].size()>=sz){
      |            ~~~~~~~~~~~~~~^~~~
examination.cpp:165:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  165 |         }else if(math[i].size()+cur>sz){
      |                  ~~~~~~~~~~~~~~~~~~^~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 35 ms 4752 KB Output is correct
8 Correct 30 ms 4768 KB Output is correct
9 Correct 29 ms 4692 KB Output is correct
10 Correct 28 ms 4372 KB Output is correct
11 Correct 22 ms 4368 KB Output is correct
12 Correct 13 ms 3732 KB Output is correct
13 Correct 31 ms 4776 KB Output is correct
14 Correct 33 ms 4764 KB Output is correct
15 Correct 31 ms 4760 KB Output is correct
16 Correct 6 ms 4308 KB Output is correct
17 Correct 24 ms 4372 KB Output is correct
18 Correct 4 ms 3704 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2642 ms 31944 KB Output is correct
2 Correct 2538 ms 34348 KB Output is correct
3 Correct 2737 ms 34388 KB Output is correct
4 Correct 1296 ms 24644 KB Output is correct
5 Correct 255 ms 24392 KB Output is correct
6 Correct 93 ms 10288 KB Output is correct
7 Correct 1470 ms 34372 KB Output is correct
8 Correct 1880 ms 34272 KB Output is correct
9 Correct 1797 ms 34272 KB Output is correct
10 Correct 158 ms 23984 KB Output is correct
11 Correct 1196 ms 24344 KB Output is correct
12 Correct 51 ms 9656 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2642 ms 31944 KB Output is correct
2 Correct 2538 ms 34348 KB Output is correct
3 Correct 2737 ms 34388 KB Output is correct
4 Correct 1296 ms 24644 KB Output is correct
5 Correct 255 ms 24392 KB Output is correct
6 Correct 93 ms 10288 KB Output is correct
7 Correct 1470 ms 34372 KB Output is correct
8 Correct 1880 ms 34272 KB Output is correct
9 Correct 1797 ms 34272 KB Output is correct
10 Correct 158 ms 23984 KB Output is correct
11 Correct 1196 ms 24344 KB Output is correct
12 Correct 51 ms 9656 KB Output is correct
13 Correct 2651 ms 34868 KB Output is correct
14 Correct 2580 ms 32908 KB Output is correct
15 Correct 2606 ms 32976 KB Output is correct
16 Correct 1304 ms 23928 KB Output is correct
17 Correct 284 ms 23736 KB Output is correct
18 Correct 92 ms 10312 KB Output is correct
19 Correct 2589 ms 32908 KB Output is correct
20 Correct 2572 ms 32908 KB Output is correct
21 Correct 2096 ms 32896 KB Output is correct
22 Correct 166 ms 23396 KB Output is correct
23 Correct 1176 ms 23580 KB Output is correct
24 Correct 50 ms 9664 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 2 ms 3540 KB Output is correct
5 Correct 2 ms 3540 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 35 ms 4752 KB Output is correct
8 Correct 30 ms 4768 KB Output is correct
9 Correct 29 ms 4692 KB Output is correct
10 Correct 28 ms 4372 KB Output is correct
11 Correct 22 ms 4368 KB Output is correct
12 Correct 13 ms 3732 KB Output is correct
13 Correct 31 ms 4776 KB Output is correct
14 Correct 33 ms 4764 KB Output is correct
15 Correct 31 ms 4760 KB Output is correct
16 Correct 6 ms 4308 KB Output is correct
17 Correct 24 ms 4372 KB Output is correct
18 Correct 4 ms 3704 KB Output is correct
19 Correct 2642 ms 31944 KB Output is correct
20 Correct 2538 ms 34348 KB Output is correct
21 Correct 2737 ms 34388 KB Output is correct
22 Correct 1296 ms 24644 KB Output is correct
23 Correct 255 ms 24392 KB Output is correct
24 Correct 93 ms 10288 KB Output is correct
25 Correct 1470 ms 34372 KB Output is correct
26 Correct 1880 ms 34272 KB Output is correct
27 Correct 1797 ms 34272 KB Output is correct
28 Correct 158 ms 23984 KB Output is correct
29 Correct 1196 ms 24344 KB Output is correct
30 Correct 51 ms 9656 KB Output is correct
31 Correct 2651 ms 34868 KB Output is correct
32 Correct 2580 ms 32908 KB Output is correct
33 Correct 2606 ms 32976 KB Output is correct
34 Correct 1304 ms 23928 KB Output is correct
35 Correct 284 ms 23736 KB Output is correct
36 Correct 92 ms 10312 KB Output is correct
37 Correct 2589 ms 32908 KB Output is correct
38 Correct 2572 ms 32908 KB Output is correct
39 Correct 2096 ms 32896 KB Output is correct
40 Correct 166 ms 23396 KB Output is correct
41 Correct 1176 ms 23580 KB Output is correct
42 Correct 50 ms 9664 KB Output is correct
43 Execution timed out 3067 ms 44832 KB Time limit exceeded
44 Halted 0 ms 0 KB -