Submission #1368488
Source Code Expand
#include <stdio.h> #include <algorithm> #include <assert.h> #include <bitset> #include <cmath> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits.h> #include <map> #include <math.h> #include <queue> #include <set> #include <stdlib.h> #include <string.h> #include <string> #include <time.h> #include <unordered_map> #include <unordered_set> #include <vector> #pragma warning(disable:4996) #pragma comment(linker, "/STACK:336777216") using namespace std; #define mp make_pair #define Fi first #define Se second #define pb(x) push_back(x) #define szz(x) ((int)(x).size()) #define rep(i, n) for(int i=0;i<n;i++) #define all(x) (x).begin(), (x).end() #define ldb ldouble typedef tuple<int, int, int> t3; typedef long long ll; typedef unsigned long long ull; typedef double db; typedef long double ldb; typedef pair <int, int> pii; typedef pair <ll, ll> pll; typedef pair <ll, int> pli; typedef pair <db, db> pdd; int IT_MAX = 1 << 17; const ll MOD = 1000000007; const int INF = 0x3f3f3f3f; const ll LL_INF = 0x3f3f3f3f3f3f3f3f; const db PI = acos(-1); const db ERR = 1e-10; pll operator + (pll a, pll b) { return pll(a.first + b.first, a.second + b.second); } pll bit[140000]; void update(int p, pll v) { for (; p <= IT_MAX; p += p & (-p)) bit[p] = bit[p] + v; } pll getsum(int p) { pll rv = pll(0, 0); for (; p; p -= p & (-p)) rv = rv + bit[p]; return rv; } ll in[100050]; ll val[100050]; int u[100050]; ll sum[100050]; ll ans[100050]; int main() { int N, i; scanf("%d", &N); for (i = 1; i <= N; i++) scanf("%lld", &in[i]); for (i = 1; i <= N; i++) u[i] = i; sort(u + 1, u + N + 1, [](int a, int b) { if(in[a] != in[b]) return in[a] < in[b]; else return a < b; }); for (i = 1; i <= N; i++) sum[i] = sum[i - 1] + in[u[i]]; for (i = N; i >= 1; i--) val[u[i]] = (sum[N] - sum[i]) - (N - i) * in[u[i]]; for (i = 2; i <= N; i++) val[i] = min(val[i], val[i - 1]); ll c = 0; val[0] = sum[N]; for (i = N; i >= 1; i--) { ans[i] = val[i - 1] - c; c = val[i - 1]; } for (i = 1; i <= N; i++) printf("%lld\n", ans[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | dotorya |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 2241 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 5120 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:73:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:74:48: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (i = 1; i <= N; i++) scanf("%lld", &in[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 | 2 ms | 2304 KB |
00_example_02.txt | AC | 2 ms | 2304 KB |
01.txt | AC | 2 ms | 2304 KB |
02.txt | AC | 3 ms | 2432 KB |
03.txt | AC | 2 ms | 2304 KB |
04.txt | AC | 2 ms | 2304 KB |
05.txt | AC | 2 ms | 2304 KB |
06.txt | AC | 2 ms | 2304 KB |
07.txt | AC | 2 ms | 2304 KB |
08.txt | AC | 2 ms | 2304 KB |
09.txt | AC | 4 ms | 2560 KB |
10.txt | AC | 2 ms | 2304 KB |
11.txt | AC | 31 ms | 4480 KB |
12.txt | AC | 31 ms | 4480 KB |
13.txt | AC | 31 ms | 4480 KB |
14.txt | AC | 31 ms | 4480 KB |
15.txt | AC | 31 ms | 4480 KB |
16.txt | AC | 25 ms | 4480 KB |
17.txt | AC | 25 ms | 4864 KB |
18.txt | AC | 24 ms | 4480 KB |
19.txt | AC | 21 ms | 4480 KB |
20.txt | AC | 31 ms | 4480 KB |
21.txt | AC | 2 ms | 2304 KB |
22.txt | AC | 2 ms | 2304 KB |
23.txt | AC | 2 ms | 2304 KB |
24.txt | AC | 3 ms | 2560 KB |
25.txt | AC | 2 ms | 2304 KB |
26.txt | AC | 2 ms | 2304 KB |
27.txt | AC | 2 ms | 2304 KB |
28.txt | AC | 26 ms | 5120 KB |
29.txt | AC | 26 ms | 5120 KB |
30.txt | AC | 26 ms | 5120 KB |
31.txt | AC | 26 ms | 5120 KB |
32.txt | AC | 26 ms | 5120 KB |
33.txt | AC | 23 ms | 4480 KB |
34.txt | AC | 23 ms | 4480 KB |
35.txt | AC | 23 ms | 4480 KB |
36.txt | AC | 24 ms | 4480 KB |
37.txt | AC | 24 ms | 4480 KB |