| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1250213 | omar1312 | Souvenirs (IOI25_souvenirs) | C++20 | 12 ms | 412 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1000000007, N = 200005;
void buy_souvenirs(int n, long long p0) {
int p[n+2]{};
int ask = p0 - 1;
for(int i = 1; i < n; i++){
int to = i - p[i];
assert(to >= 0);
for(int j = 0; j < to; j++){
pair<vector<int>, long long> res = transaction(ask);
for(auto &k : res.first){
p[k]++;
}
ask = ask - res.second;
}
ask--;
}
}
// int main(){
// cin.tie(0)->sync_with_stdio(0);
// }| # | 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... | ||||
