| Task: | Lisäykset |
| Sender: | hltk |
| Submission time: | 2025-11-29 18:38:56 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 53 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 20 |
| #2 | ACCEPTED | 33 |
| #3 | TIME LIMIT EXCEEDED | 0 |
| 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.01 s | 1, 3 | details |
| #4 | ACCEPTED | 0.01 s | 1, 3 | details |
| #5 | ACCEPTED | 0.01 s | 1, 3 | details |
| #6 | ACCEPTED | 0.03 s | 2, 3 | details |
| #7 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #10 | ACCEPTED | 0.03 s | 3 | details |
| #11 | ACCEPTED | 0.04 s | 3 | details |
Code
#pragma GCC optimize("O3,unroll-loops")
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
vector<int> t(n);
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
t[x - 1]++;
}
for (int i = n - 1; i > 0; --i) {
t[i - 1] += t[i];
}
for (int i = 0; i < n; ++i) {
v[i] += t[i];
}
for (; ;) {
bool f = 0;
for (int i = 0; i < n - 1; ++i) {
if (v[i] > v[i + 1]) {
int j = i + 1;
while (j + 1 < n && v[j] + 1 > v[j + 1]) ++j;
long s = 0;
for (int k = i; k <= j; ++k) {
s += v[k];
}
for (int k = i; k <= j; ++k) {
v[k] = s / (j - i + 1) + (j - k < s % (j - i + 1));
}
f = 1;
i = j;
}
}
if (!f) break;
}
for (int i = 0; i < n; ++i) {
cout << v[i] << ' ';
}
cout << endl;
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1 1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 1000 |
| user output |
|---|
| 1000 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 511 511 511 511 511 511 511 51... |
| user output |
|---|
| 511 511 511 511 511 511 511 51... |
Test 3
Group: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 495 495 495 495 495 495 495 49... |
| user output |
|---|
| 495 495 495 495 495 495 495 49... |
Test 4
Group: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 ... |
| correct output |
|---|
| 562 562 562 562 562 562 562 56... |
| user output |
|---|
| 562 562 562 562 562 562 562 56... |
Test 5
Group: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 1000 1000 0 1 3 4 6 9 9 9 10 11 11 11 11... |
| correct output |
|---|
| 997 997 997 997 997 998 998 99... |
| user output |
|---|
| 997 997 997 997 997 998 998 99... |
Test 6
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 50033 50033 50033 50033 50033 ... |
| user output |
|---|
| 50033 50033 50033 50033 50033 ... |
Test 7
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 49996 49996 49996 49996 49996 ... |
| user output |
|---|
| (empty) |
Test 8
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 50057 50057 50057 50057 50057 ... |
| user output |
|---|
| (empty) |
Test 9
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 100000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| correct output |
|---|
| 50536 50536 50536 50536 50536 ... |
| user output |
|---|
| (empty) |
Test 10
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 0 4 7 29 33 44 52 75 77 79 82 ... |
| correct output |
|---|
| 100000 100001 100003 100023 10... |
| user output |
|---|
| 100000 100001 100003 100023 10... |
Test 11
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 1 12 14 16 49 59 59 63 68 73 8... |
| correct output |
|---|
| 100001 100010 100012 100014 10... |
| user output |
|---|
| 100001 100010 100012 100014 10... |
