Submission #1389341


Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	//key:値		最小index,要素数
	map< int, vector<LL> > numMap;
	int N;
	cin >> N;
	vector<LL> temp(2);
	for(int i=0;i<N;++i){
		int a;
		cin >> a;
		if( numMap.find( a ) != numMap.end() ){
			//indexがあるなら、それはより小さいi
			temp = numMap[ a ];
			temp[1]++;
			numMap[a] = temp;
			
		}else{
			temp[0] = i;
			temp[1] = 1;
			numMap[ a ] = temp;
		}
	}
	map<int,vector<LL> >::iterator itr,begin,next;
	itr = numMap.end();
	--itr;
	begin = numMap.begin();
	vector<LL> ans(N,0);
	while(1){
		if( itr == begin ){
			//LL Aval = 0;
			LL Bval = itr->first;
			int index = (itr->second)[0];
			LL num = (itr->second)[1];
			ans[ index ] += Bval*num;
			break;
		}
		next = itr;
		next--;
		LL Aval = next->first;
		LL Bval = itr->first;
		int index = (itr->second)[0];
		LL num = (itr->second)[1];
		
		//indexが呼び出される回数。
		ans[index] += (Bval-Aval)*num;
		
		(next->second)[0] = min((next->second)[0],(LL)index);
		(next->second)[1] += num;

		--itr;
	}

	for(int i=0;i<N;++i){
		cout << ans[i] << endl;
	}
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Submission Time
Task E - Frequency
User akarin55
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2298 Byte
Status AC
Exec Time 222 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 896 KB
03.txt AC 2 ms 256 KB
04.txt AC 2 ms 384 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 18 ms 1024 KB
10.txt AC 1 ms 256 KB
11.txt AC 217 ms 8064 KB
12.txt AC 221 ms 8064 KB
13.txt AC 217 ms 8064 KB
14.txt AC 222 ms 8064 KB
15.txt AC 221 ms 8064 KB
16.txt AC 164 ms 1280 KB
17.txt AC 206 ms 12544 KB
18.txt AC 216 ms 12160 KB
19.txt AC 163 ms 1280 KB
20.txt AC 196 ms 5504 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 13 ms 1024 KB
25.txt AC 2 ms 256 KB
26.txt AC 2 ms 384 KB
27.txt AC 1 ms 256 KB
28.txt AC 198 ms 12672 KB
29.txt AC 198 ms 12800 KB
30.txt AC 204 ms 12800 KB
31.txt AC 199 ms 12672 KB
32.txt AC 196 ms 12672 KB
33.txt AC 193 ms 12160 KB
34.txt AC 199 ms 12160 KB
35.txt AC 209 ms 12160 KB
36.txt AC 196 ms 12160 KB
37.txt AC 193 ms 12160 KB