Submission #1252908

#	Time	Username	Problem	Language	Result	Execution time	Memory
1252908		kkzyr	Souvenirs (IOI25_souvenirs)	C++20	4 / 100	11 ms	412 KiB

souvenirs

#include <iostream>
#include <vector>
#include <utility>
using namespace std;

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

void buy_souvenirs(int N, long long P0){
    long long nxt = P0 - 1;
    int how_many_last = 0;
    for (int i = 1;i < N;i++){
        pair<vector<int>, long long> result;
        result = transaction(nxt);
        if (i == N - 1){
            for (int j = 1;j < (i - how_many_last);j++){
                transaction(nxt);
            }
        }
        else{
            for (int j = 1;j < i;j++){
                transaction(nxt);
            }
        }
        if (result.first.size() == 1 and result.second == 0 and result.first[0] == i){
            if (i == N - 1){
                for (int j = 1;j < (i - how_many_last);j++){
                    transaction(nxt);
                }
            }
            else{
                for (int j = 1;j < i;j++){
                    transaction(nxt);
                }
            }
        }
        else{
            if (result.first.size() == 2){
                how_many_last++;
            }
            nxt--;
            if (i == N - 1){
                for (int j = 1;j < (i - how_many_last);j++){
                    transaction(nxt - 1);
                }
            }
            else{
                for (int j = 1;j < i;j++){
                    transaction(nxt - 1);
                }
            }
        }
        nxt--;
    }
}

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