oj.uz

Submission #40908

# Submission time Handle Problem Language Result Execution time Memory
40908 2018-02-09T22:58:34 Z Hassoony Poklon (COCI17_poklon) C++14
0 / 140
 364 ms 43088 KB 
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const int mod=1e9+7;
const int MX=5e5+9;
const int SQ=200;
int n,q,a[MX],ans,res[MX];
pair<int,pair<int,int> >Q[MX];
unordered_map<int,int>cnt;
bool cmp(pair<int,pair<int,int> >A,pair<int,pair<int,int> >B){
    if((A.first/SQ)==(B.first/SQ)){
        return A.second.first<B.second.first;
    }
    return (A.first/SQ)<(B.first/SQ);
}
void add(int x){
    ans-=(cnt[x]==2);
    cnt[x]++;
    ans+=(cnt[x]==2);
}
void rem(int x){
    ans-=(cnt[x]==2);
    cnt[x]--;
    ans+=(cnt[x]==2);
}
int main(){
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    for(int i=0;i<q;i++){
        scanf("%d%d",&Q[i].first,&Q[i].second.first);
        Q[i].second.second=i;
    }
    sort(Q,Q+q,cmp);
    int mol=1,mor=0;
    for(int i=0;i<q;i++){
        int L=Q[i].first,R=Q[i].second.first;
        while(mor<R){
            add(a[++mor]);
        }
        while(mor>R){
            rem(a[mor++]);
        }
        while(mol<L){
            rem(a[mol++]);
        }
        while(mol>L){
            add(a[++mol]);
        }
     //   cout<<L<<" "<<R<<" "<<Q[i].second.second<<endl;
        res[Q[i].second.second]=ans;
    }
    for(int i=0;i<q;i++)printf("%d\n",res[i]);
}

Compilation message

poklon.cpp: In function 'int main()':
poklon.cpp:32:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
                          ^
poklon.cpp:35:53: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&Q[i].first,&Q[i].second.first);
                                                     ^

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Runtime error 26 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 26 ms 656 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 26 ms 776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 30 ms 1064 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 88 ms 5524 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 91 ms 7080 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 155 ms 13468 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 222 ms 21620 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 326 ms 31436 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 364 ms 43088 KB Execution killed with signal 11 (could be triggered by violating memory limits)