| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337276 | JPEGraid | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 344 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#define F first
#define S second
using namespace std;
using qr = pair<vector<int>, long long>;
void buy_souvenirs(int N, long long P0) {
qr q = transaction(P0-1);
// P[1]
if(q.F.size() == 1) {
P0 -= q.S;
transaction(P0);
transaction(P0);
}
// P[1]+P[2]
else {
int P1 = (P0-q.S)/2;
transaction(P1);
}
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... | ||||
