| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1251374 | InternetPerson10 | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 400 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll counts[2001];
ll costs[2001];
void try_buy(int k, int n, ll p) {
}
void buy_souvenirs(int N, long long P0) {
for(int i = 0; i < N; i++) {
costs[i] = -1;
}
costs[0] = P0;
// pair<vector<int>, ll> res = transaction(3);
for(int i = 1; i < N; i++) {
for(int j = 0; j < i; j++) {
transaction(P0-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... | ||||
