| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1351212 | jump | 선물 (IOI25_souvenirs) | C++20 | 8 ms | 400 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#define ll long long
std::pair<std::vector<int>,long long> res;
std::vector<int> total;
void wrap(ll ts){
res = transaction(ts);
for(int i=0;i<res.first.size();i++){
total[res.first[i]]+=1;
}
}
void buy_souvenirs(int N, long long P0) {
total.resize(N+4);
for(int i=1;i<N;i++)
for(int j=0;j<i;j++)
wrap(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... | ||||
