# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137131 | KLPP | Poklon (COCI17_poklon) | C++14 | 1975 ms | 15116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define block 700
int n,q;
int arr[1000000];
multiset<int> m;
struct queries{
int l,r;
int index;
};
bool operator <(queries a, queries b){
if(a.l/block<b.l/block)return true;
if(a.l/block>b.l/block)return false;
return (a.r<b.r);
}
queries Q[1000000];
int L,R;
int freq[1000000];
int ans;
void Rplus(){
R++;
ans-=(freq[arr[R]]==2);
freq[arr[R]]++;
ans+=(freq[arr[R]]==2);
}
void Lminus(){
L--;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |