제출 #1319340

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1319340		Trisanu_Das	선물 (IOI25_souvenirs)	C++20	0 / 100	12 ms	400 KiB

souvenirs

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

pair<vector<int>, long long> transaction(long long M);

void buy_souvenirs(int N, long long P0) {
    vector<long long> P(N);
    P[0] = P0;
    vector<int> freq(N, 0);
    int trials = 200;

    for (int t = 0; t < trials; ++t) {
        auto res = transaction(P0 - 1);
        for (int x : res.first)
            if (x < N) freq[x]++;
    }
    P[1] = P0 - 1;
    for (int i = 2; i < N; ++i) {
        if (freq[i] > freq[i - 1])
            P[i] = P[i - 1] - 2;
        else
            P[i] = P[i - 1] - 1;

        if (P[i] <= 0) P[i] = 1;
    }
    for (int t = 1; t < N; ++t) {
        for (int rep = 0; rep < t; ++rep) {
            long long M = P[t];

            for (int j = N - 1; j > t; --j)
                if (M + P[j] < P0)
                    M += P[j];

            transaction(M);
        }
    }
}

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