#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
}
void phongbeo();
const int inf = 1e10;
const ll mod2 = 1e9 + 7;
const int mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0)x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c;
};
struct id
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,t,lim,w,l,r ;
int kk;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
// modwwe
phongbeo();
// checktime
}
int S=316;
bool cmp(ic a,ic b)
{
if(a.a / S != b.a / S) return (a.a < b.a);
else if(!((a.a / S) & 1)) return (a.b < b.b);
else return (a.b > b.b);
}
multiset<ll> s;
int ans[100001];
int a[100001];
vector<int> v;
vector<ic> v2;
int c[100001];
void go(int x,int y)
{
while(l<x)
{
s.erase(s.find(1ll*c[a[l]]*v[a[l]]));
c[a[l]]--;
s.insert(1ll*c[a[l]]*v[a[l]]);
l++;
}
while(l>x)
{
l--;
s.erase(s.find(1ll*c[a[l]]*v[a[l]]));
c[a[l]]++;
s.insert(1ll*c[a[l]]*v[a[l]]);
}
while(r<y)
{
r++;
s.erase(s.find(1ll*c[a[r]]*v[a[r]]));
c[a[r]]++;
s.insert(1ll*c[a[r]]*v[a[r]]);
}
while(r>y)
{
s.erase(s.find(c[a[r]]*v[a[r]]));
c[a[r]]--;
s.insert(c[a[r]]*v[a[r]]);
r--;
}
}
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>a[i],s.insert(0),v.pb(a[i]);
sort(v.begin(),v.end());
for(int i=1;i<=n;i++)
a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin();
for(int i=1; i<=m; i++)
{
cin>>l>>r;
v2.pb({l,r,i});
}
sort(v2.begin(),v2.end(),cmp);
l=1;
r=0;
for(auto x:v2)
{
go(x.a,x.b);
ans[x.c]=*s.rbegin();
}
for(int i=1;i<=m;i++)
cout<<ans[i],down
}
Compilation message
historic.cpp:38:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+10' to '2147483647' [-Woverflow]
38 | const int inf = 1e10;
| ^~~~
historic.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
75 | main()
| ^~~~
historic.cpp: In function 'void phongbeo()':
historic.cpp:135:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
135 | for(int i=1; i<=n; i++)
| ^~~
historic.cpp:137:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
137 | sort(v.begin(),v.end());
| ^~~~
historic.cpp: In function 'int main()':
historic.cpp:13:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | #define fin(x) freopen(x".inp","r",stdin)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~
historic.cpp:79:9: note: in expansion of macro 'fin'
79 | fin(task);
| ^~~
historic.cpp:14:23: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
14 | #define fou(x) freopen(x".out","w",stdout)
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~
historic.cpp:80:9: note: in expansion of macro 'fou'
80 | fou(task);
| ^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
2 ms |
592 KB |
Output is correct |
| 6 |
Correct |
3 ms |
592 KB |
Output is correct |
| 7 |
Correct |
7 ms |
848 KB |
Output is correct |
| 8 |
Incorrect |
9 ms |
1104 KB |
Output isn't correct |
| 9 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
336 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
