Submission #1672717
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
int N;
int ans[100010];
signed main() {
cin >> N;
vector<pii> v;
v.push_back(pii(0, -1));
rep(i,0,N) {
int p; cin >> p;
v.push_back(make_pair(p, i));
}
sort(v.begin(), v.end(), greater<pii>());
rep(i,0,N) {
int diff = v[i].first - v[i+1].first;
int cnt = i + 1;
ans[ v[i].second ] = diff * cnt;
}
rep(i,0,N) cout << ans[i] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Frequency |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1881 Byte |
Status |
WA |
Exec Time |
206 ms |
Memory |
3568 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 |
WA |
13 ms |
512 KB |
03.txt |
WA |
2 ms |
256 KB |
04.txt |
WA |
2 ms |
256 KB |
05.txt |
WA |
1 ms |
256 KB |
06.txt |
WA |
1 ms |
256 KB |
07.txt |
WA |
1 ms |
256 KB |
08.txt |
WA |
2 ms |
256 KB |
09.txt |
WA |
19 ms |
640 KB |
10.txt |
WA |
1 ms |
256 KB |
11.txt |
WA |
196 ms |
3312 KB |
12.txt |
WA |
187 ms |
3312 KB |
13.txt |
WA |
196 ms |
3312 KB |
14.txt |
WA |
188 ms |
3312 KB |
15.txt |
WA |
190 ms |
3312 KB |
16.txt |
AC |
205 ms |
2928 KB |
17.txt |
AC |
199 ms |
3312 KB |
18.txt |
WA |
203 ms |
3312 KB |
19.txt |
AC |
182 ms |
2928 KB |
20.txt |
WA |
196 ms |
3184 KB |
21.txt |
AC |
1 ms |
256 KB |
22.txt |
AC |
1 ms |
256 KB |
23.txt |
WA |
1 ms |
256 KB |
24.txt |
WA |
14 ms |
512 KB |
25.txt |
WA |
2 ms |
256 KB |
26.txt |
WA |
2 ms |
256 KB |
27.txt |
WA |
1 ms |
256 KB |
28.txt |
WA |
198 ms |
3568 KB |
29.txt |
WA |
191 ms |
3568 KB |
30.txt |
WA |
197 ms |
3568 KB |
31.txt |
WA |
198 ms |
3568 KB |
32.txt |
WA |
196 ms |
3568 KB |
33.txt |
WA |
201 ms |
3568 KB |
34.txt |
WA |
206 ms |
3568 KB |
35.txt |
WA |
196 ms |
3568 KB |
36.txt |
WA |
202 ms |
3568 KB |
37.txt |
WA |
201 ms |
3568 KB |