Submission #1253054

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253054		SoMotThanhXuan	Souvenirs (IOI25_souvenirs)	C++20	39 / 100	13 ms	412 KiB

souvenirs

#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; ++i)
#define REP(i, a, b) for(int i = (a), _b = (b); i >= _b; --i)
#define mp make_pair
#define all(v) v.begin(), v.end()
#define uni(v) v.erase(unique(all(v)), v.end())
#define Bit(x, i) ((x >> (i)) & 1)
#define Mask(i) (1 << (i))
#define Cnt(x) __builtin_popcount(x)
#define Cntll(x) __builtin_popcountll(x)
#define Ctz(x) __builtin_ctz(x) // so luong so 0 tinh tu ben phai
#define Ctzll(x) __builtin_ctzll(x)
#define Clz(x) __builtin_clz(x) // so luong so 0 tinh tu ben trai
#define Clzll(x) __builtin_clzll(x)
inline bool maximize(int &u, int v){
    return v > u ? u = v, true : false;
}
inline bool minimize(int &u, int v){
    return v < u ? u = v, true : false;
}
inline bool maximizell(long long &u, long long v){
    return v > u ? u = v, true : false;
}
inline bool minimizell(long long &u, long long v){
    return v < u ? u = v, true : false;
}
const int mod = 1e9 + 7;
inline int fastPow(int a, int n){
    if(n == 0) return 1;
    int t = fastPow(a, n >> 1);
    t = 1ll * t * t % mod;
    if(n & 1) t = 1ll * t * a % mod;
    return t;
}
inline void add(int &u, int v){
    u += v;
    if(u >= mod) u -= mod;
}
inline void sub(int &u, int v){
    u -= v;
    if(u < 0) u += mod;
}
const int maxN = 1e2 + 5;
const int inf = 1e9;
const long long infll = 1e18;
//long long P[maxN];
//int N;
//pair<vector<int>, long long> transaction(long long M){
//    vector<int> res;
//    FOR(i, 0, N - 1){
//        if(M >= P[i]){
//            res.emplace_back(i);
//            M -= P[i];
//        }
//    }
//    assert(!res.empty());
//    return mp(res, M);
//}
int Q[maxN];
long long P[maxN];
using T = pair<vector<int>, long long>;
void buy_souvenirs(int N, long long P0) {
    if(N == 2){
        T val = transaction(P0 - 1);
        return;
    }
    if(N == 3){
        T val = transaction(P0 - 1);
        if(val.first.size() == 1){
            P[1] = P0 - 1 - val.second;
            FOR(i, 1, 2)T val = transaction(P[1] - 1);
            return;
        }
        // val.size() == 2
        val = transaction((P0 - 1 - val.second) / 2);
        return;
    }
    long long Rem = P0 - 1;
    FOR(i, 1, N - 1){
        while(Q[i] < i){
            pair<vector<int>, long long> val = transaction(Rem);
            for(int x : val.first)Q[x]++;
            if(val.first.size() == 1){
                Rem -= val.second;
            }else{
                --Rem;
            }
        }
        --Rem;
    }
    return;
}
//void process(){
//    cin >> N;
//    FOR(i, 0, N - 1) cin >> P[i];
//    buy_souvenirs(N, P[0]);
//}
//#define LOVE ""
//int main(){
//    if(fopen(LOVE".inp", "r")){
//        freopen(LOVE".inp", "r", stdin);
//        freopen(LOVE".out", "w", stdout);
//    }
//    ios_base::sync_with_stdio(false);
//    cin.tie(0);
//    cout.tie(0);
//
//    int t = 1;
////    cin >> t;
//    while(t--)
//        process();
////    cerr << '\n' << "Time elapsed: " << (1.0 * clock() / CLOCKS_PER_SEC) << " s\n" ;
//    return 0;
//}

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