| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327807 | adiyer | 선물 (IOI25_souvenirs) | C++20 | 12 ms | 388 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
void buy_souvenirs(int n, ll p0) {
pair < vector < int >, ll > res;
ll p[n], c = 0; p[0] = p0;
for(int i = 1; i < n; i++){
res = transaction(p[i - 1] - 1);
if(res.first.size() == 2) c++;
if(res.second == 1 || res.first.size() == 2) p[i] = p[i - 1] - 2;
else p[i] = p[i - 1] - 1;
if(i == n - 1){
for(int j = 0; j < i - 1 - c; j++) transaction(p[i]);
}
else{
for(int j = 0; j < i - 1; j++) transaction(p[i]);
}
}
}
| # | 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... | ||||
