Submission #1286013

#	Time	Username	Problem	Language	Result	Execution time	Memory
1286013		takoshanava	Souvenirs (IOI25_souvenirs)	C++20	7 / 100	13 ms	332 KiB

souvenirs

#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;

void buy_souvenirs(int N, long long P0) {
    if (N == 2) {
        transaction(P0 - 1);
        return;
    }

    if (P0 == N) {
        for (int i = 1; i < N; i++) {
            for (int j = 0; j < i; j++) transaction(N - i);
        }
        return;
    }

    if (N == 3) {
        auto res = transaction(P0 - 1);
        if ((int)res.first.size() == 1 && res.first[0] == 1) {
            transaction(P0 - 2);
        } else {
            transaction(res.second + 1); 
        }
        return;
    }

    vector<long long> P(N);
    P[0] = P0;
    for (int i = 1; i < N; i++) {
        auto res = transaction(P[i - 1] - 1);
        if ((int)res.first.size() == 1) {
            P[i] = P[i - 1] - 1;
        } else {
            P[i] = P[i - 1] - res.second - 1;
        }
    }

    for (int i = 1; i < N; i++)
        for (int j = 0; j < i; j++)
            transaction(P[i] - 1);
}

• Subtask 0: 0 / 0
• Subtask 1: 4 / 4
• Subtask 2: 3 / 3
• Subtask 3: 0 / 14
• Subtask 4: 0 / 18
• Subtask 5: 0 / 28
• Subtask 6: 0 / 33