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