| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1250239 | faustaadp | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 412 KiB |
#include "souvenirs.h"
#include "bits/stdc++.h"
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
void buy_souvenirs(int N, long long P0) {
long long X = P0 - 1;
pair<vector<int>, long long> res = transaction(X);
ll Y = res.second;
// cout << X << " " << Y << "\n";
if((res.first).size() == 1) {
transaction(X - Y - 1);
transaction(X - Y - 1);
} else {
transaction((X - Y) / 2);
}
return;
}
| # | 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... | ||||
