| Task: | Muutokset |
| Sender: | Metabolix |
| Submission time: | 2025-11-07 19:43:18 +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.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 2, 3 | details |
| #8 | ACCEPTED | 0.01 s | 2, 3 | details |
| #9 | ACCEPTED | 0.01 s | 2, 3 | details |
| #10 | ACCEPTED | 0.03 s | 3 | details |
| #11 | ACCEPTED | 0.02 s | 3 | details |
| #12 | ACCEPTED | 0.02 s | 3 | details |
| #13 | ACCEPTED | 0.03 s | 3 | details |
Compiler report
input/code.cpp: In function 'auto f(std::vector<int>&, int, int)':
input/code.cpp:32:27: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
32 | if (find_c[c] == t.size()) {Code
#include <bits/stdc++.h>
using namespace std;
auto f(vector<int>& inputs, int n, int m) {
vector<long> results(m+1);
vector<int> counts(n+1);
vector<int> t;
vector<int> find_a(n+1, -1), find_c(m+1, -1);
for (int i = 0; i < m; ++i) {
int a = inputs[i];
if (find_a[a] == -1) {
counts[a] = 1;
find_a[a] = t.size();
if (find_c[counts[a]] == -1) {
find_c[counts[a]] = find_a[a];
}
t.push_back(a);
results[i+1] = results[i] + find_a[a] + 1;
} else {
// viedään a oman osastonsa kärkeen; ei vaikuta hintaan
int b = t[find_c[counts[a]]];
swap(find_a[a], find_a[b]);
swap(t[find_a[a]], t[find_a[b]]);
// a siirtyy seuraavaan osastoon mutta ei liiku; ei vaikuta hintaan
int c = counts[a];
counts[a]++;
find_c[c]++;
if (find_c[c] == t.size()) {
find_c[c] = -1;
}
if (find_c[counts[a]] == -1) {
find_c[counts[a]] = find_a[a];
}
// Yksi a:n hinta lisää.
results[i+1] = results[i] + find_a[a] + 1;
}
}
return results;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> inputs(m);
for (int i = 0; i < m; ++i) {
cin >> inputs[i];
inputs[i]--;
}
auto results_fwd = f(inputs, n, m);
reverse(inputs.begin(), inputs.end());
auto results_bwd = f(inputs, n, m);
reverse(results_bwd.begin(), results_bwd.end());
for (int i = 1; i < m; ++i) {
cout << results_fwd[i] + results_bwd[i] << " ";
}
cout << "\n";
}
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... |
