| Task: | Lisäykset |
| Sender: | Sisuaski |
| Submission time: | 2025-11-29 07:11:44 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 20 |
| #2 | ACCEPTED | 33 |
| #3 | ACCEPTED | 47 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 3 | details |
| #5 | ACCEPTED | 0.01 s | 1, 3 | details |
| #6 | ACCEPTED | 0.07 s | 2, 3 | details |
| #7 | ACCEPTED | 0.07 s | 3 | details |
| #8 | ACCEPTED | 0.07 s | 3 | details |
| #9 | ACCEPTED | 0.08 s | 3 | details |
| #10 | ACCEPTED | 0.16 s | 3 | details |
| #11 | ACCEPTED | 0.16 s | 3 | details |
Code
#include <iostream>
#include <map>
using namespace std;
int main() {
int n,m;cin>>n>>m;
map<int,int> q;
for(int i=0,p=0; i<n; ++i) {
int x;cin>>x;
if (x!=p) q[i]=x-p;
p=x;
}
q[n]=m;
while(m--){
int k;cin>>k;
++q[0];
auto it = q.lower_bound(k);
if (it->first==k) {
if (!--it->second) q.erase(it);
} else {
auto p = prev(it);
int a=p->first;
int b=it->first;
if (!--p->second) q.erase(p);
if (!--it->second) q.erase(it);
++q[a+b-k];
}
}
auto it=q.begin();
int x=0;
for(int i=0; i<n; ++i) {
if (i==it->first) x+=it++->second;
cout<<x<<' ';
}
cout<<'\n';
}
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: ACCEPTED
| 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 |
|---|
| 49996 49996 49996 49996 49996 ... |
Test 8
Group: 3
Verdict: ACCEPTED
| 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 |
|---|
| 50057 50057 50057 50057 50057 ... |
Test 9
Group: 3
Verdict: ACCEPTED
| 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 |
|---|
| 50536 50536 50536 50536 50536 ... |
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... |
