Submission #1318211

#TimeUsernameProblemLanguageResultExecution timeMemory
13182111otaSouvenirs (IOI25_souvenirs)C++20
3 / 100
12 ms332 KiB
#include <bits/stdc++.h>
#ifdef EVAL
#include "souvenirs.h"
#endif
using namespace std;

#define endl "\n"
#define int long long
#define int32 int32_t
#define pii pair<int, int>
#define ff first
#define ss second
#define entire(x) (x).begin(), (x).end()

#ifndef EVAL
vector<int> TheP;
pair<vector<int32>, int> transaction (int m){
    vector<int32> cur;
    for (int i = 0; i < (int) TheP.size(); i++){
        if (TheP[i] <= m) cur.push_back(i), m -= TheP[i];
    } return pair<vector<int32>, int>{cur, m};
}
#endif

void buy_souvenirs (int32 N, int p0){
    int n = N;
    for (int i = 0; i < n; i++) for (int j = 0; j < i; j++) transaction(n - i);
}

#ifndef EVAL
int32 main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(entire(a)); reverse(entire(a));
    TheP = a; buy_souvenirs(n, a[0]);
    return 0;
}
#endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...