Submission #1671030
Source Code Expand
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;
int n, a[100010];
vi solve_naive(){
vi ans(n), aprev(n); rep(i, n) aprev[i] = a[i];
rep(it, n){
int mx = -1, mxi, mx2 = -1, mx2i;
rep(i, n) if(a[i] > mx) mx = a[i], mxi = i;
rep(i, mxi) if(a[i] > mx2) mx2 = a[i], mx2i = i;
if(mx2 < 0){
rep(i, n) ans[mxi] += a[i];
break;
}
int cnt = 0;
for(int i = mxi; i < n; i++){
cnt += max(0, a[i] - mx2);
a[i] = min(a[i], mx2);
}
ans[mxi] += cnt;
}
rep(i, n) a[i] = aprev[i];
return ans;
}
int main(){
cin.tie(0); cin.sync_with_stdio(0);
cin >> n;
rep(i, n) cin >> a[i+1];
//dbg(solve_naive());
n++;
vi idx;
int prev = -1;
rep(i, n) if(a[i] > prev){
prev = a[i];
idx.pb(i);
}
set<pi> vals;
vector<ll> ans(n);
for(int ii = idx.size() - 1, j = n - 1; ii > 0; ii--){
int i = idx[ii - 1];
while(j > i){
if(a[j] >= a[i]) ans[i] += a[j] - a[idx[ii]];
else vals.emplace(-a[j], j);
j--;
}
set<pi> dels;
for(auto it = vals.begin(); it != vals.end() && -it->first >= a[i]; it++){
dels.insert(*it);
ans[idx[ii]] += -it->first - a[idx[ii]];
}
for(auto it : dels) vals.erase(it);
ans[idx[ii]] += (n - 1ll - i - vals.size()) * (a[idx[ii]] - a[i]);
}
rep(i, n-1) cout << ans[i+1] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Frequency |
User |
nadeko |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2752 Byte |
Status |
WA |
Exec Time |
217 ms |
Memory |
9856 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
1 ms |
256 KB |
02.txt |
AC |
14 ms |
768 KB |
03.txt |
WA |
2 ms |
256 KB |
04.txt |
WA |
2 ms |
384 KB |
05.txt |
AC |
1 ms |
256 KB |
06.txt |
WA |
1 ms |
256 KB |
07.txt |
AC |
1 ms |
256 KB |
08.txt |
WA |
2 ms |
256 KB |
09.txt |
AC |
19 ms |
1024 KB |
10.txt |
WA |
1 ms |
256 KB |
11.txt |
WA |
210 ms |
7552 KB |
12.txt |
AC |
209 ms |
7808 KB |
13.txt |
AC |
216 ms |
9856 KB |
14.txt |
WA |
217 ms |
9472 KB |
15.txt |
WA |
212 ms |
7168 KB |
16.txt |
AC |
156 ms |
1664 KB |
17.txt |
AC |
161 ms |
2552 KB |
18.txt |
WA |
157 ms |
1664 KB |
19.txt |
AC |
154 ms |
1664 KB |
20.txt |
AC |
207 ms |
6656 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 |
12 ms |
640 KB |
25.txt |
AC |
2 ms |
256 KB |
26.txt |
AC |
2 ms |
256 KB |
27.txt |
AC |
1 ms |
256 KB |
28.txt |
WA |
161 ms |
2680 KB |
29.txt |
WA |
163 ms |
2680 KB |
30.txt |
WA |
158 ms |
2808 KB |
31.txt |
WA |
162 ms |
2680 KB |
32.txt |
WA |
164 ms |
2680 KB |
33.txt |
WA |
157 ms |
1664 KB |
34.txt |
WA |
156 ms |
1664 KB |
35.txt |
WA |
157 ms |
1664 KB |
36.txt |
WA |
157 ms |
1664 KB |
37.txt |
WA |
159 ms |
1664 KB |