Submission #1499600
Source Code Expand
#include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define fio ios::sync_with_stdio(0),cin.tie(0),cout.tie(0) using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<vi> vvi; typedef long long ll; //range ADD update, point VAL query template <class T> struct segt { int N; vector<T> t; segt(){} segt(int N):N(N),t(2*N){} constexpr static T NONE = 0; //add val to [l,r] inline void update(int l, int r, T val) { for(l+=N,r+=N+1;l<r;l>>=1,r>>=1) { if(l&1) t[l++] += val; if(r&1) t[--r] += val; } } //query point i inline T query(int i) const { T ans = NONE; for(i+=N;i;i>>=1) ans += t[i]; return ans; } }; const int N = 1e5+5; int a[N]={},mx[N]={},n; ll add[N]={}, ans[N]; vector<int> ind; segt<ll> S; int main() { scanf("%d",&n); for(int i = 1; i <= n; ++i) scanf("%d",a+i); for(int i = 1; i <= n; ++i) mx[i] = (a[mx[i-1]]>=a[i])?mx[i-1]:i; int c = n+1; while(c) { c = mx[c-1]; ind.push_back(c); } reverse(ind.begin(),ind.end()); S = segt<ll>(ind.size()); for(int i = n; i; --i) { int lo = 0, hi = ind.size(); while(hi-lo > 1) { int md = (lo+hi)/2; if(ind[md] < i && a[i] > a[ind[md]]) lo = md; else hi = md; } add[lo+1] += a[i] - a[ind[lo]]; S.update(0,lo,1); } ind.pb(ind.back()); for(int i = 1; i < ind.size()-1; ++i) ans[ind[i]] = S.query(i) * (a[ind[i]] - a[ind[i-1]]) + add[i]; for(int i = 1; i <= n; ++i) printf("%lld\n",ans[i]); }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | cephian |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1547 Byte |
Status | AC |
Exec Time | 37 ms |
Memory | 5496 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:45:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:47:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",a+i); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 2 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 3 ms | 384 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 21 ms | 1280 KB |
12.txt | AC | 22 ms | 1280 KB |
13.txt | AC | 21 ms | 1280 KB |
14.txt | AC | 21 ms | 1280 KB |
15.txt | AC | 21 ms | 1280 KB |
16.txt | AC | 22 ms | 1280 KB |
17.txt | AC | 36 ms | 5240 KB |
18.txt | AC | 22 ms | 1280 KB |
19.txt | AC | 18 ms | 1280 KB |
20.txt | AC | 21 ms | 1280 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 1 ms | 256 KB |
24.txt | AC | 3 ms | 512 KB |
25.txt | AC | 1 ms | 256 KB |
26.txt | AC | 1 ms | 256 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 35 ms | 5112 KB |
29.txt | AC | 36 ms | 5240 KB |
30.txt | AC | 37 ms | 5496 KB |
31.txt | AC | 35 ms | 4984 KB |
32.txt | AC | 35 ms | 4984 KB |
33.txt | AC | 21 ms | 1280 KB |
34.txt | AC | 21 ms | 1280 KB |
35.txt | AC | 21 ms | 1280 KB |
36.txt | AC | 21 ms | 1280 KB |
37.txt | AC | 21 ms | 1280 KB |