Submission #16,386

2025-04-29 10:40:09

cpp17

Accepted 100/100

17ms

1420 KiB

#include <iostream>

using namespace std;

int sor[200005] = {};

void kovetkezo(int N, int sum)
{
    int temp_sor[200005] = {};
    for(int i = 1; i <= N; i++){
        temp_sor[i] = sor[i];
    }

    int curr_sum = sum;
    int index = N;
    while(curr_sum == sum || temp_sor[index-1] == temp_sor[index]){
        curr_sum -= temp_sor[index];
        index--;
    }
    curr_sum++;
    temp_sor[index]++;
    index++;
    while(curr_sum < sum){
        temp_sor[index] = 1;
        index++;
        curr_sum++;
    }
    curr_sum = 0;
    for(int i = 1; curr_sum < sum; i++){
        cout << temp_sor[i] << " ";
        curr_sum += temp_sor[i];
    }
    cout << endl;
}

void elozo(int N, int sum)
{
    int temp_sor[200005] = {};
    for(int i = 1; i <= N; i++){
        temp_sor[i] = sor[i];
    }

    int curr_sum = sum;
    int index = N;
    while(temp_sor[index] == 1){
        curr_sum--;
        index--;
    }
    temp_sor[index]--;
    curr_sum--;
    index++;
    while(curr_sum < sum){
        if(sum - curr_sum <= temp_sor[index-1]){
            temp_sor[index] = sum - curr_sum;
            break;
        }
        temp_sor[index] = temp_sor[index-1];
        index++;
        curr_sum += temp_sor[index];
    }

    curr_sum = 0;
    for(int i = 1; curr_sum < sum; i++){
        cout << temp_sor[i] << " ";
        curr_sum += temp_sor[i];
    }
    cout << endl;
}

int main()
{
    int N;
    cin >> N;
    int sum = 0;
    for(int i = 1; i <= N; i++){
        cin >> sor[i];
        sum += sor[i];
    }
    if(N == 1){
        cout << "0\n";
    }
    else{
        kovetkezo(N, sum);
    }
    if(N == sum){
        cout << "0\n";
    }
    else{
        elozo(N, sum);
    }

    return 0;
}

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	2ms	1076 KiB
		2	Accepted	2ms	1076 KiB
		3	Accepted	3ms	1076 KiB
subtask2	6/6
		4	Accepted	1ms	316 KiB
		5	Accepted	2ms	1076 KiB
		6	Accepted	2ms	1092 KiB
		7	Accepted	2ms	1080 KiB
		8	Accepted	2ms	1268 KiB
subtask3	6/6
		9	Accepted	1ms	1076 KiB
		10	Accepted	1ms	1076 KiB
		11	Accepted	2ms	1136 KiB
		12	Accepted	4ms	1080 KiB
		13	Accepted	4ms	1076 KiB
subtask4	10/10
		14	Accepted	1ms	1076 KiB
		15	Accepted	1ms	1076 KiB
		16	Accepted	2ms	1136 KiB
		17	Accepted	4ms	1080 KiB
		18	Accepted	4ms	1076 KiB
		19	Accepted	1ms	1076 KiB
		20	Accepted	2ms	1076 KiB
		21	Accepted	16ms	1324 KiB
		22	Accepted	17ms	1328 KiB
		23	Accepted	14ms	1420 KiB
subtask5	10/10
		24	Accepted	2ms	1268 KiB
		25	Accepted	2ms	1268 KiB
		26	Accepted	2ms	1080 KiB
		27	Accepted	2ms	1076 KiB
		28	Accepted	2ms	1076 KiB
subtask6	10/10
		29	Accepted	2ms	1076 KiB
		30	Accepted	2ms	1112 KiB
		31	Accepted	2ms	1076 KiB
		32	Accepted	2ms	1076 KiB
		33	Accepted	1ms	1076 KiB
subtask7	58/58
		34	Accepted	2ms	1268 KiB
		35	Accepted	1ms	1076 KiB
		36	Accepted	2ms	1272 KiB
		37	Accepted	1ms	316 KiB
		38	Accepted	2ms	1076 KiB
		39	Accepted	2ms	1092 KiB
		40	Accepted	2ms	1080 KiB
		41	Accepted	2ms	1268 KiB
		42	Accepted	1ms	1076 KiB
		43	Accepted	1ms	1076 KiB
		44	Accepted	2ms	1136 KiB
		45	Accepted	4ms	1080 KiB
		46	Accepted	4ms	1076 KiB
		47	Accepted	1ms	1076 KiB
		48	Accepted	2ms	1076 KiB
		49	Accepted	16ms	1324 KiB
		50	Accepted	17ms	1328 KiB
		51	Accepted	2ms	1076 KiB
		52	Accepted	2ms	1076 KiB
		53	Accepted	2ms	1112 KiB
		54	Accepted	2ms	1076 KiB
		55	Accepted	2ms	1076 KiB
		56	Accepted	1ms	1076 KiB
		57	Accepted	2ms	1264 KiB
		58	Accepted	2ms	1076 KiB
		59	Accepted	2ms	1076 KiB
		60	Accepted	1ms	1076 KiB
		61	Accepted	2ms	1076 KiB
		62	Accepted	2ms	1076 KiB
		63	Accepted	3ms	1268 KiB
		64	Accepted	3ms	1076 KiB
		65	Accepted	4ms	1076 KiB
		66	Accepted	6ms	1260 KiB