| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347738 | fahmid_rng | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#include "souvenirs.h"
#include <utility>
void buy_souvenirs(int n, long long prev) {
//n=3
pair<vector<int>, ll> p=transaction(prev-1);
prev-=p.second+1;
if(p.first.size()==1){
for(int i=0; i<2; ++i) transaction(prev-1);
return;
}
transaction(prev/2);
}
| # | 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... | ||||
