Submission #1648965


Source Code Expand

//#include "IntMod.h"
//typedef IntMod<1000000007> MInt;

//#include "Union_Find.h"

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <list>
#include <bitset>

using namespace std;
#define REP(i,a,n) for(int i = (a); i < (int)(n); ++i)
#define REPM(i,n,a) for(int i = ((n) - 1); i >= (a); --i)
#define EPS 0.0001
#define INF 0x3FFFFFFF
#define INFLL 0x3FFFFFFF3FFFFFFF
#define INFD 1.0e+308
#define FLOAT setprecision(16)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;

template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(begin(dest), end(dest), val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
//sum, 累積和
// 負のときの割り算に注意
#if 1
#include <array>
#include <unordered_set>
#include <unordered_map>
template<class T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
#endif

//#include "Union_Find.h"

int N;
map<LL, vector<int>, greater<LL>> M;
LL A[100001];
int main() {
	cin >> N;
	REP(i, 0, N) {
		int a;
		cin >> a;
		M[a].push_back(i);
	}
	M[0].push_back(1);

	LL c = 0;
	int mn = INF;
	for (auto it = M.begin(); it != prev(M.end()); ++it){
		LL diff = it->first - next(it)->first;
		c += it->second.size();
		mn = min(mn, it->second[0]);
		A[mn] += c * diff;
	}
	REP(i, 0, N) {
		cout << A[i] << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task E - Frequency
User Aquarius
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2100 Byte
Status AC
Exec Time 237 ms
Memory 12800 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 39
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 14 ms 768 KB
03.txt AC 2 ms 256 KB
04.txt AC 2 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 2 ms 256 KB
09.txt AC 19 ms 1024 KB
10.txt AC 1 ms 256 KB
11.txt AC 214 ms 7424 KB
12.txt AC 224 ms 7424 KB
13.txt AC 220 ms 7424 KB
14.txt AC 219 ms 7424 KB
15.txt AC 222 ms 7424 KB
16.txt AC 203 ms 1016 KB
17.txt AC 235 ms 12544 KB
18.txt AC 237 ms 11392 KB
19.txt AC 168 ms 1020 KB
20.txt AC 201 ms 5120 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 15 ms 1024 KB
25.txt AC 1 ms 256 KB
26.txt AC 2 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 224 ms 12672 KB
29.txt AC 223 ms 12672 KB
30.txt AC 228 ms 12800 KB
31.txt AC 222 ms 12672 KB
32.txt AC 223 ms 12672 KB
33.txt AC 229 ms 11392 KB
34.txt AC 225 ms 11392 KB
35.txt AC 224 ms 11392 KB
36.txt AC 225 ms 11392 KB
37.txt AC 224 ms 11392 KB