oj.uz

답안 #616106

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
616106 2022-07-31T21:26:01 Z Iwanttobreakfree Examination (JOI19_examination) C++17
2 / 100
 3000 ms 30640 KB 
#include <iostream>
#include <vector>
#include <unordered_map>
#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=400;
int next(int x){return x + (x&(-x));}
int par(int x){return x - (x&(-x));}
bool cmp(pair<pii,pii>& a,pair<pii,pii>& b){
    if(a.first.first/sz!=b.first.first/sz)return a.first.first/sz<b.first.first/sz;
    return a.first.second<b.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];
    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<<i<<' '<<'\n';
}
void del(int i,vector<vector<int>>& g,vector<int>& exam){
    for(int x:g[i]){
        if(cnt[x]==2)pupd(mp_a[exam[x]]+1,-1);
        cnt[x]--;
    }
}
vector<vector<int>> math,info;
void MO(int q,vector<int>& m,vector<int>& in,vector<int>& av,vector<int>& exam){
    int x,y,z;
    vector<pair<pii,pii>> qu(q);
    vector<int> ans(q);
    for(int i=0;i<q;i++){
        cin>>x>>y>>z;
        qu[i]={{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=bin_find(qu[i].first.first,m),min_info=bin_find(qu[i].first.second,in),min_av=bin_find(qu[i].second.first,av);
        if(min_math==m.size()||min_info==in.size()||min_av==av.size()){
            ans[qu[i].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].first.first<<'\n';
        ans[qu[i].second.second]=val(min_av,BIT.size()-1);
    }
    for(int i=0;i<q;i++)cout<<ans[i]<<'\n';
}
int main(){
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int n,q,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.push_back(x);
    }
    for(int x:in){
        mp_i[x]=cnti;
        cnti++;
        b.push_back(x);
    }
    for(int x:av){
        mp_a[x]=cnta;
        cnta++;
        c.push_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]]].push_back(i);
        info[mp_i[exam_info[i]]].push_back(i);
    }
    MO(q,a,b,c,exam_av);
}

Compilation message

examination.cpp: In function 'void pupd(int, int)':
examination.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for(int i=x;i<BIT.size();i=next(i))BIT[i]+=k;
      |                 ~^~~~~~~~~~~
examination.cpp: In function 'void MO(int, std::vector<int>&, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
examination.cpp:68:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if(min_math==m.size()||min_info==in.size()||min_av==av.size()){
      |            ~~~~~~~~^~~~~~~~~~
examination.cpp:68:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if(min_math==m.size()||min_info==in.size()||min_av==av.size()){
      |                                ~~~~~~~~^~~~~~~~~~~
examination.cpp:68:59: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |         if(min_math==m.size()||min_info==in.size()||min_av==av.size()){
      |                                                     ~~~~~~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 4 ms 3448 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 116 ms 4724 KB Output is correct
8 Correct 117 ms 4728 KB Output is correct
9 Correct 118 ms 4728 KB Output is correct
10 Correct 77 ms 4340 KB Output is correct
11 Correct 82 ms 4308 KB Output is correct
12 Correct 46 ms 3708 KB Output is correct
13 Correct 119 ms 4692 KB Output is correct
14 Correct 121 ms 4732 KB Output is correct
15 Correct 130 ms 4728 KB Output is correct
16 Correct 6 ms 4308 KB Output is correct
17 Correct 8 ms 4264 KB Output is correct
18 Correct 4 ms 3668 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3049 ms 30640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3049 ms 30640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 3540 KB Output is correct
2 Correct 2 ms 3540 KB Output is correct
3 Correct 2 ms 3540 KB Output is correct
4 Correct 4 ms 3448 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3540 KB Output is correct
7 Correct 116 ms 4724 KB Output is correct
8 Correct 117 ms 4728 KB Output is correct
9 Correct 118 ms 4728 KB Output is correct
10 Correct 77 ms 4340 KB Output is correct
11 Correct 82 ms 4308 KB Output is correct
12 Correct 46 ms 3708 KB Output is correct
13 Correct 119 ms 4692 KB Output is correct
14 Correct 121 ms 4732 KB Output is correct
15 Correct 130 ms 4728 KB Output is correct
16 Correct 6 ms 4308 KB Output is correct
17 Correct 8 ms 4264 KB Output is correct
18 Correct 4 ms 3668 KB Output is correct
19 Execution timed out 3049 ms 30640 KB Time limit exceeded
20 Halted 0 ms 0 KB -