Submission #1249531

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249531		Charizard2021	Souvenirs (IOI25_souvenirs)	C++20	21 / 100	12 ms	420 KiB

souvenirs

#include "souvenirs.h"
#include<bits/stdc++.h>
using namespace std;
void buy_souvenirs(int N, long long P0){
    if(N == 2){
        pair<vector<int>, long long> res = transaction(P0 - 1);
        return;
    }
    else{
        map<long long, long long> mp;
        long long cur = P0;
        for(int i = 1; i < N; i++){
            if(mp.find(i) != mp.end() && mp[i] == i){
                continue;
            }
            if(i == N - 1){
                cur--;
                pair<vector<int>, long long> res = transaction(cur);
                sort(res.first.begin(), res.first.end());
                reverse(res.first.begin(), res.first.end());
                if(res.first[0] == i){
                    for(long long x : res.first){
                        mp[x]++;
                    }
                    for(int j = 0; j < i - mp[i]; j++){
                        pair<vector<int>, long long> res2 = transaction(cur);
                    }
                }
                return;
            }
            cur -= 2;
            pair<vector<int>, long long> res = transaction(cur);
            sort(res.first.begin(), res.first.end());
            reverse(res.first.begin(), res.first.end());
            if(res.first[0] == i){
                for(long long x : res.first){
                    mp[x]++;
                }
                for(int j = 0; j < i - mp[i]; j++){
                    pair<vector<int>, long long> res2 = transaction(cur);
                }
            }
            else{
                for(long long x : res.first){
                    mp[x]++;
                }
                cur++;
                for(int j = 0; j < i - mp[i]; j++){
                    pair<vector<int>, long long> res2 = transaction(cur);
                }
            }
        }
    }
}

• 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