| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327808 | adiyer | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 332 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void buy_souvenirs(int n, ll p0) {
pair < vector < int >, ll > res;
res = transaction(p0 - 1);
if(res.first.size() == 1){
ll p1 = p0 - 1 - res.second;
transaction(p1 - 1);
transaction(p1 - 1);
return;
}
ll s = p0 - 1 - res.second;
transaction(s / 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... | ||||
