제출 #1276617

#제출 시각아이디문제언어결과실행 시간메모리
1276617linhhnt11072010선물 (IOI25_souvenirs)C++20
4 / 100
1 ms404 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; ll pp[105]; pair<vector<int>, ll> transaction(ll m); void buy_souvenirs(int n, ll p0){ ll ans = p0-1; for(int i = 1;i<n;i++){ pair<vector<int>, ll> pr = transaction(ans); ll p = abs(pr.second-ans); for(int j = 0;j<pr.first.size();j++) pp[pr.first[j]]++; for(int j = pp[i]+1;j<=i;j++){ for(int j = 0;j<pr.first.size();j++) pp[pr.first[j]]++; pp[i]++; } ans/=pr.first.size(); if(pr.first.size() == 1) ans--; } }
#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...