| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1254080 | vpinx | 선물 (IOI25_souvenirs) | C++20 | 1 ms | 416 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
extern pair<vector<int>, long long> transaction(long long m);
void buy_souvenirs(int n, long long p0) {
if (n == 2) auto [l, r] = transaction(p0 - 1);
else {
int sum = n * (n - 1) / 2;
for (int i = 1; i < n; i++) {
auto [l, r] = transaction(sum);
sum -= (n - i);
}
}
}| # | 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... | ||||
