| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1347726 | fahmid_rng | 선물 (IOI25_souvenirs) | C++20 | 8 ms | 404 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#include "souvenirs.h"
#include <utility>
void buy_souvenirs(int n, long long prev) {
//p[i]=p[i+1]+1 or p[i+1]+2
int cnt=0;
for(int i=1; i<n-1; ++i){
pair<vector<int>,int> p=transaction(prev-1);
prev-=2;
if(!p.second){
if(p.first.size()==1) ++prev;
else ++cnt;
}
for(int j=1;j<i;++j) transaction(prev);
}
for(int i=cnt+1; i<n; ++i) transaction(prev-1);
}
| # | 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... | ||||
