# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483732 | kawaii | Peru (RMI20_peru) | C++14 | 0 ms | 0 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;
//define int long long
long long t, n, m, k, a[2500001], mod = 1e9 + 7, l2[2500001], ans = 0;
long int mx[2500001][22];
deque<pair<long long, int> > dq;
long long mul(long long x, long long y){
if(y == 0) return 1;
long long ans = mul(x, y / 2);
if(y % 2 == 0) return (ans * ans) % mod;
else return (((ans * ans) % mod) * x) % mod;
}
int solve(long long n, long long k, long long* a){
for(int i = 0; i <= n; i++){
for(int j = 1; (1 << j) <= n; j++){
mx[i][j] = max(mx[i][j - 1], mx[i + (1 << (j - 1))][j - 1]);
}
}
dq.push_back(make_pair(0, 0));
for(int i = 1; i <= n; i++){
if(dq.size() == 0){
dq.push_back(make_pair(a[i], i));
ans = (ans + a[i] * mul(23, n - i)) % mod;
}
else{
int q = dq.front().first;
pair<int, int> t;