| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1254804 | AbdullahIshfaq | 선물 (IOI25_souvenirs) | C++20 | 13 ms | 412 KiB |
#include "souvenirs.h"
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long
void buy_souvenirs(int n, ll p)
{
ll curr = p - 1;
vector<ll> pur(n);
for(int i = 1; i < n; i++){
while(pur[i] < i){
auto tmp = transaction(curr);
// cout << "tmp : ";
// for(auto j : tmp.first){
// cout << j << " ";
// }
// cout << endl << tmp.second << '\n';
if(tmp.first.size() == 1){
pur[i]++;
}
else{
for(auto j : tmp.first){
pur[j]++;
}
curr--;
}
}
curr--;
}
}
| # | 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... | ||||
