Submission #1257679

#TimeUsernameProblemLanguageResultExecution timeMemory
1257679ro9669Souvenirs (IOI25_souvenirs)C++20
22 / 100
0 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> #define fi first #define se second #define sz(a) int(a.size()) using namespace std; typedef long long ll; const int maxN = 107; int n , p[maxN] , cnt[maxN]; // pair<vector<int> , ll> transaction(ll m){ // cout << "start : " << m << "\n"; // vector<int> tmp; // for (int i = 0 ; i < n ; i++){ // if (m >= p[i]){ // m -= p[i]; // tmp.push_back(i); // } // } // for (int x : tmp) cout << x << " "; // cout << "\n"; // cout << m << "\n"; // cout << "-------------------------\n"; // return {tmp , m}; // } void buy_souvenirs(int n , ll p0){ if (n == 2){ auto x = transaction(p0 - 1); return; } if (n == 3){ auto x = transaction(p0 - 1); if (sz(x.fi) == 1){ ll p1 = p0 - 1 - x.se; auto y = transaction(p1 - 1); auto z = transaction(p1 - 1); } else{ auto y = transaction((p0 - 1 - x.se) / 2); } } } // int main(){ // ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); // cin >> n; // for (int i = 0 ; i < n ; i++) cin >> p[i]; // buy_souvenirs(n , p[0]); // return 0; // }
#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...