Submission #905787
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
template<class Cmp=less_equal<int>>
class SparseTableRMQ{
public:
SparseTableRMQ(){
}
SparseTableRMQ(int *ar, int n): n(n), data(n){
for(int i = 0; i < n;++i) data[i] = ar[i];
table = buildRMQ();
}
int queryPos(int l, int r){
int k = lgInt(r - l - 1);
int lid = table[l + n*k], rid = table[r + n*k - (1 << k)];
return (cmp(data[lid], data[rid])) ? lid : rid;
}
int queryValue(int l, int r){
return data[queryPos(l, r)];
}
private:
int n;
vector<int> data, table;
Cmp cmp;
int lgInt(int v){
static const unsigned b[] = {0x2, 0xC, 0xF0, 0xFF00, 0xFFFF0000};
static const unsigned S[] = {1, 2, 4, 8, 16};
int res = 0;
for (int i = 4; i >= 0; i--) {
if (v & b[i]) {
v >>= S[i];
res |= S[i];
}
}
return res;
}
vector<int> buildRMQ() {
int logn = 1;
for (int k = 1; k < n; k *= 2) ++logn;
vector<int> b(n*logn);
for(int i = 0; i < n; ++i)b[i] = i;
int cur = 0;
for(int k = 1; k < n; k *= 2){
copy(b.begin() + cur, b.begin() + cur + n, b.begin() + cur + n);
cur += n;
for(int i = 0; i < n - k; ++i){
int idl = b[cur + i], idr = b[cur + i + k];
if(cmp(data[idl], data[idr])){
b[cur + i] = idl;
} else{
b[cur + i] = idr;
}
}
}
return b;
}
};
typedef SparseTableRMQ<less_equal<int>> RMinQ;
typedef SparseTableRMQ<greater_equal<int>> RMaxQ;
int N, A[200001];
int main(){
cin >> N;
rep(i, N)scanf("%d", &A[i]);
RMinQ rmq(A, N);
ll X = 0;
rep(i, N){
int l = -1, r = i, m, L, R;
while(r - l > 1){
m = (l + r) / 2;
if(rmq.queryValue(m, i + 1) >= A[i])r = m;
else l = m;
}
L = r;
l = i+1, r = N+1;
while(r - l > 1){
m = (l + r) / 2;
if(rmq.queryValue(i, m) < A[i])r = m;
else l = m;
}
R = l;
X += (i-L+1ll)*(R-i)*(ll)A[i];
}
cout << X << endl;
}
Submission Info
Submission Time
2016-10-01 21:40:32+0900
Task
B - Minimum Sum
User
paruki
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
2848 Byte
Status
AC
Exec Time
112 ms
Memory
16640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:82:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
rep(i, N)scanf("%d", &A[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
Set Name
Test Cases
Sample
example0, example1, example2
All
corner0, corner1, corner2, corner3, example0, example1, example2, maxrand0, maxrand1, maxrand2, rand0, rand1, rand2
Case Name
Status
Exec Time
Memory
corner0
AC
111 ms
16640 KB
corner1
AC
106 ms
16640 KB
corner2
AC
3 ms
256 KB
corner3
AC
110 ms
16640 KB
example0
AC
3 ms
256 KB
example1
AC
3 ms
256 KB
example2
AC
3 ms
256 KB
maxrand0
AC
112 ms
16640 KB
maxrand1
AC
111 ms
16640 KB
maxrand2
AC
112 ms
16640 KB
rand0
AC
3 ms
256 KB
rand1
AC
3 ms
256 KB
rand2
AC
3 ms
256 KB