| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 246103 |
2020-07-08T07:30:28 Z |
leaked |
Poklon (COCI17_poklon) |
C++14 |
|
5000 ms |
10160 KB |
#include<bits/stdc++.h>
using namespace std;
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
//
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("-O3")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("fast-math")
//#define LOCAL
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cout<< *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
~debug() { cout << endl; }
eni(!=) cout << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int>a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ll long long
////////////////////////////////???????????????CHECK THIS OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define m_p make_pair
#define fast_io cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
#define all(x) x.begin(),x.end()
#define getfiles ifstream cin("input.txt");ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (ll)x.size()
#define endl "\n"
#define rall(x) x.rbegin(),x.rend()
#define len(a) (ll)a.size()
#define rep(x,l,r) for(ll x=l;x<r;x++)
//using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi=3.14159265359;
ll inf = 1e18,mod1=1e9+7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) { return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod : sqr(binpow(a, b / 2, mod)) % mod) : 1; }
ll binmult(ll a, ll b, ll mod) { return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod : (2 * binmult(a, b / 2, mod)) % mod) : 0; }
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R=1e4;
const ll tx[4]={0,0,-1,1};
const ll ty[4]={-1,1,0,0};
const char rev_to[4]={'E','W','N','S'};
const int N=2e6+1;
const int M=999999937;
int block=112;
unordered_map<int,int>mp;
int n,a[N];
int fnw[N];
ll ans=0;
void f(int pos,int val){
fnw[pos]+=val;
}
void add(int val){
f(mp[val],-1);
mp[val]++;
f(mp[val],1);
}
void del(int val){
f(mp[val],-1);
mp[val]--;
f(mp[val],1);
}
bool cmp(pair<int,pii>aa,pair<int,pii>b){
if((aa.s.f/block)==(b.s.f/block)) return aa.s.s<b.s.s;
else return (aa.s.f/block)<(b.s.f/block);
}
int q;
signed main(){
fast_io;
cin>>n>>q;
block=477;
for(int i=0;i<n;i++) cin>>a[i];
vector<pair<int,pii>>lol(q);
for(int i=0;i<q;i++){
cin>>lol[i].s.f>>lol[i].s.s;
lol[i].f=i;
}
sort(all(lol),cmp);
vector<int>ans(q);
int l=0,r=0;
add(a[0]);
for(int i=0;i<q;i++){
int idx=lol[i].f,rl=lol[i].s.f-1,rr=lol[i].s.s-1;
while(l>rl){
add(a[l-1]);--l;
}
while(l<rl){
del(a[l]);l++;
}
while(r<rr){
add(a[r+1]);r++;
}
while(r>rr){
del(a[r]);r--;
}
ans[idx]=fnw[2];
}
for(auto &z : ans) cout<<z<<endl;
return 0;
}
///stuff you should look for :
/*
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* read the conditions carefully
* WRITE STUFF DOWN
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
6 ms |
384 KB |
Output is correct |
| 3 |
Correct |
9 ms |
384 KB |
Output is correct |
| 4 |
Correct |
24 ms |
512 KB |
Output is correct |
| 5 |
Correct |
829 ms |
2680 KB |
Output is correct |
| 6 |
Correct |
827 ms |
2556 KB |
Output is correct |
| 7 |
Correct |
2550 ms |
4736 KB |
Output is correct |
| 8 |
Execution timed out |
5059 ms |
6264 KB |
Time limit exceeded |
| 9 |
Execution timed out |
5073 ms |
8184 KB |
Time limit exceeded |
| 10 |
Execution timed out |
5050 ms |
10160 KB |
Time limit exceeded |
