| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337823 | spuike | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 348 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second
pair<vector<int>, long long> transaction(long long M);
void buy_souvenirs(int N, long long P0){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(N==2){
transaction(P0-1);
}
else if(N==3){
pair<vector<int>, long long>p=transaction(P0-1);
if(p.fi.size()==1){
transaction(P0-1-p.se-1);
transaction(P0-1-p.se-1);
}
else{
transaction((P0-1-p.se)/2);
}
}
else{
ll pi=P0;
ll k=0;
for(int i=1;i<N-1;i++){
pair<vector<int>, long long>p=transaction(pi-1);
if(p.fi.size()==1){
pi-=p.se;
}
else{
pi-=p.se-1;
k++;
}
for(int j=N;j>N-i;j--){
transaction(pi-1);
}
}
while(k<N){
transaction(pi-1);
k++;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
