제출 #1262993

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1262993		nerrrmin	선물 (IOI25_souvenirs)	C++20	21 / 100	11 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long n, p0;
long long cnt[205];
void buy_souvenirs(int N, long long P0)
{
    n = N;
    p0 = P0;
    long long pre = p0;
    for (int i = 1; i < n; ++ i)
    {
        std::pair<std::vector<int>, long long> res = transaction(pre - 1);

        //cout << pre - 1 << endl;
        long long resto = res.second;
        long long p = pre - 1 - resto;
        if(res.first.size() == 2)
        {
            cnt[n-1] ++;
            p --;
        }
        long long lft = i - cnt[i];
        for (int j = 1; j <= lft-1; ++ j)
        {
            std::pair<std::vector<int>, long long> res = transaction(p);
           // cout << p << endl;
        }
        pre = p;

       // cout << "i is in the end " << p << endl;
    }

    return;
}

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