| Task: | Muutokset |
| Sender: | hltk |
| Submission time: | 2025-11-09 14:06:31 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 20 |
| #2 | ACCEPTED | 30 |
| #3 | ACCEPTED | 50 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.03 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.04 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.04 s | 2, 3 | details |
| #7 | ACCEPTED | 0.04 s | 2, 3 | details |
| #8 | ACCEPTED | 0.04 s | 2, 3 | details |
| #9 | ACCEPTED | 0.04 s | 2, 3 | details |
| #10 | ACCEPTED | 0.21 s | 3 | details |
| #11 | ACCEPTED | 0.24 s | 3 | details |
| #12 | ACCEPTED | 0.26 s | 3 | details |
| #13 | ACCEPTED | 0.26 s | 3 | details |
Code
#include <algorithm>
#include <cassert>
#include <iostream>
#include <numeric>
using namespace std;
const int N = 2e5 + 2;
struct T {
int cnt;
long s;
T operator+(T oth) {
return {cnt + oth.cnt, s + oth.s};
}
};
long sc0[N], sc1[N];
const int P = 1 << 20;
T st_t[P * 2];
void st_add(int k, T x) {
k += P;
st_t[k] = st_t[k] + x;
while (k /= 2)
st_t[k] = st_t[k * 2] + st_t[k * 2 + 1];
}
T st_query(int l, int r) {
l += P;
r += P;
T s {};
while (l <= r) {
if (l % 2 == 1) s = s + st_t[l++];
if (r % 2 == 0) s = s + st_t[r--];
l /= 2;
r /= 2;
}
return s;
}
int main() {
int n, m;
cin >> n >> m;
int v[m] {};
for (int i = 0; i < m; ++i) {
cin >> v[i];
v[i]--;
}
for (int t = 0; t < 2; ++t) {
fill(st_t, st_t + P * 2, T{});
int c[n] {};
pair<int, int> o[m] {};
for (int i = 0; i < m; ++i) {
c[v[i]]++;
o[i] = {c[v[i]], v[i]};
}
sort(o, o + m, greater{});
fill(c, c + n, 0);
long s = 0;
for (int i = 0; i < m; ++i) {
if (c[v[i]]) {
int j = lower_bound(o, o + m, pair{c[v[i]], v[i]}, greater{}) - o;
s -= st_query(j + 1, P - 1).s;
s -= long(1 + st_query(0, j - 1).cnt) * c[v[i]];
st_add(j, {-1, -c[v[i]]});
}
c[v[i]]++;
int j = lower_bound(o, o + m, pair{c[v[i]], v[i]}, greater{}) - o;
s += st_query(j + 1, P - 1).s;
s += long(1 + st_query(0, j - 1).cnt) * c[v[i]];
st_add(j, {1, c[v[i]]});
sc0[i] = s;
}
swap(sc0, sc1);
reverse(v, v + m);
}
for (int i = 0; i < m - 1; ++i)
cout << sc0[i] + sc1[m - i - 2] << ' ';
cout << endl;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 1 1 |
| correct output |
|---|
| (empty) |
| user output |
|---|
| (empty) |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000 1000 1000 1000 1000 1000 ... |
| user output |
|---|
| 1000 1000 1000 1000 1000 1000 ... |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000 1 2 2 2 1 1 1 1 1 1 1 1 1 2 1 ... |
| correct output |
|---|
| 1488 1488 1487 1486 1487 1488 ... |
| user output |
|---|
| 1488 1488 1487 1486 1487 1488 ... |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000 7 8 2 4 8 3 3 10 9 7 7 6 8 7 2... |
| correct output |
|---|
| 5107 5107 5103 5099 5098 5102 ... |
| user output |
|---|
| 5107 5107 5103 5099 5098 5102 ... |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 1000 23 85 3 99 63 79 38 37 67 28 7... |
| correct output |
|---|
| 41676 41672 41621 41587 41589 ... |
| user output |
|---|
| 41676 41672 41621 41587 41589 ... |
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000 2 1 2 1 1 2 2 2 1 2 2 2 2 2 2 ... |
| correct output |
|---|
| 1484 1485 1484 1485 1485 1485 ... |
| user output |
|---|
| 1484 1485 1484 1485 1485 1485 ... |
Test 7
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000 10 8 4 4 3 8 4 7 5 9 7 1 5 3 4... |
| correct output |
|---|
| 5279 5275 5277 5276 5272 5268 ... |
| user output |
|---|
| 5279 5275 5277 5276 5272 5268 ... |
Test 8
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000 82 63 63 58 57 46 58 40 23 47 ... |
| correct output |
|---|
| 41444 41381 41301 41284 41279 ... |
| user output |
|---|
| 41444 41381 41301 41284 41279 ... |
Test 9
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 1000 50231 31135 38003 12048 55578 ... |
| correct output |
|---|
| 498503 497507 496513 495521 49... |
| user output |
|---|
| 498503 497507 496513 495521 49... |
Test 10
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 1 2 1 2 1 1 2 1 1 1 1 2 1 1 2 ... |
| correct output |
|---|
| 149988 149988 149988 149988 14... |
| user output |
|---|
| 149988 149988 149988 149988 14... |
Test 11
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 4 2 6 2 2 2 2 5 9 5 3 5 1 9 1 ... |
| correct output |
|---|
| 547169 547164 547157 547151 54... |
| user output |
|---|
| 547169 547164 547157 547151 54... |
Test 12
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 15 9 37 82 72 45 42 96 67 99 6... |
| correct output |
|---|
| 4959855 4959845 4959773 495975... |
| user output |
|---|
| 4959855 4959845 4959773 495975... |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 30941 71402 45742 82863 71830 ... |
| correct output |
|---|
| 2378217706 2378191367 23781909... |
| user output |
|---|
| 2378217706 2378191367 23781909... |
