Submission #1351661
Source Code Expand
#define _USE_MATH_DEFINES #include <cassert> #include <cstdio> #include <cstring> #include <iostream> #include <string> #include <sstream> #include <vector> #include <queue> #include <stack> #include <list> #include <set> #include <map> #include <unordered_set> #include <unordered_map> #include <algorithm> #include <complex> #include <cmath> #include <numeric> #include <bitset> using namespace std; #define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) template <typename Arg1> void __f(const char* name, Arg1&& arg1){ cerr << name << ": " << arg1 << endl; } template <typename Arg1, typename... Args> void __f(const char* names, Arg1&& arg1, Args&&... args){ const char* comma = strchr(names + 1, ','); cerr.write(names, comma - names) << ": " << arg1 << " |"; __f(comma + 1, args...); } typedef long long int64; typedef pair<int, int> ii; const int INF = 1 << 30; const int MOD = 1e9 + 7; const int N = 1e5 + 10; ii a[N]; int64 ret[N]; int main() { int n; scanf("%d", &n); for (int i = 0; i < n; ++i) { scanf("%d", &a[i].first); a[i].second = i + 1; } sort(a, a + n, greater<ii>()); int sum = 0, idx = n; for (int i = 0, j; i < n; i = j) { for (j = i; j < n && a[j].first == a[i].first; ++j) { idx = min(idx, a[j].second); } sum += j - i; ret[idx] = j == n ? sum : (int64)sum * (a[i].first - a[j].first); } for (int i = 1; i <= n; ++i) { printf("%lld\n", ret[i]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Frequency |
User | cuiaoxiang |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1513 Byte |
Status | WA |
Exec Time | 27 ms |
Memory | 2688 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:47:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^ ./Main.cpp:49:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &a[i].first); ^
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 | 3 ms | 256 KB |
03.txt | WA | 1 ms | 256 KB |
04.txt | WA | 1 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 | 1 ms | 256 KB |
09.txt | WA | 3 ms | 384 KB |
10.txt | WA | 1 ms | 256 KB |
11.txt | WA | 27 ms | 1280 KB |
12.txt | WA | 27 ms | 1280 KB |
13.txt | WA | 27 ms | 1280 KB |
14.txt | WA | 27 ms | 1280 KB |
15.txt | WA | 27 ms | 1280 KB |
16.txt | WA | 23 ms | 1280 KB |
17.txt | WA | 23 ms | 2432 KB |
18.txt | WA | 23 ms | 1280 KB |
19.txt | AC | 18 ms | 1280 KB |
20.txt | WA | 26 ms | 1280 KB |
21.txt | WA | 1 ms | 256 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | WA | 1 ms | 256 KB |
24.txt | WA | 3 ms | 384 KB |
25.txt | WA | 1 ms | 256 KB |
26.txt | WA | 1 ms | 256 KB |
27.txt | WA | 1 ms | 256 KB |
28.txt | WA | 24 ms | 2560 KB |
29.txt | WA | 24 ms | 2560 KB |
30.txt | WA | 24 ms | 2688 KB |
31.txt | WA | 24 ms | 2560 KB |
32.txt | WA | 24 ms | 2560 KB |
33.txt | WA | 22 ms | 1280 KB |
34.txt | WA | 22 ms | 1280 KB |
35.txt | WA | 22 ms | 1280 KB |
36.txt | WA | 22 ms | 1280 KB |
37.txt | WA | 22 ms | 1280 KB |