| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1250588 | thunopro | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 400 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#define ll long long
using namespace std ;
typedef pair<vector<int>,ll> Data ;
void buy_souvenirs(int N, long long P0) {
if ( N == 2 )
{
Data res = transaction (P0-1) ;
return ;
}
if ( N == 3 )
{
Data res = transaction (P0-1) ;
if ( res.first.size () == 1 )
{
ll cost = res.second ;
res = transaction ((P0-1-cost)) ;
res = transaction ((P0-1-cost)) ;
return ;
}
else
{
ll cost = res.second ;
res = transaction ((P0-1-cost)/2) ;
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... | ||||
