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