Submission #1251130

#	Time	Username	Problem	Language	Result	Execution time	Memory
1251130		somefolk	선물 (IOI25_souvenirs)	C++20	0 / 100	0 ms	412 KiB

souvenirs

#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <complex>
#include <list>
#include <cassert>
#include <chrono>
#include <random>
#include <stack>
#include <iomanip>
#include <fstream>
using namespace std;

#define endl "\n"
#define ll long long

const int INF = 1e9+7;
const int MOD = 1e9+7;

// pair<vector<int>, ll> transaction(ll m);

pair<vector<int>, ll> transaction(int n, ll m){
    cout << "Input arr: ";
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
    }
    cout << "Input r: ";
    int r;
    cin >> r;
    return {a, r};
}

void buy_souvenirs(int n, ll p0){
    transaction(n, p0-1);
}

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