제출 #1256632

#제출 시각아이디문제언어결과실행 시간메모리
1256632medmdg선물 (IOI25_souvenirs)C++20
25 / 100
12 ms412 KiB
#include "souvenirs.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; void sub1(int N, long long P0) { pair<vector<int>, long long> res = transaction(P0-1); } void sub2(int N, ll P0){ for(int i=N-1;i>0;i--){ for(int j=N;j>i;j--){ transaction(i); } } } void sub4(int N, long long P0) { pair<vector<int>, long long> res = transaction(P0-1); ll cost=P0-1-res.second; //cout<<"#"<<cost<<endl; if(res.first.size()>1) transaction(cost/2); else{ transaction(cost-1); transaction(cost-1); } } void buy_souvenirs(int N, long long P0) { if(N==3)sub4(N,P0); else if(N==2) sub1(N,P0); else sub2(N,P0); return; }
#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...