| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1284479 | dimitri.shengelia | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 400 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
#include <utility>
#include <vector>
using namespace std;
pair <vector<int>, long long> transaction(long long M);
void buy_souvenirs(int N, long long P0) {
pair <vector<int>, long long> res;
for ( int i = 1; i < N; i++ ) {
for ( int j = 0; j < i; j++ ) {
transaction ( N - i );
}
}
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... | ||||
