| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1250231 | omar1312 | 선물 (IOI25_souvenirs) | C++20 | 0 ms | 420 KiB |
#include "souvenirs.h"
#include <utility>
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1000000007;
int p[200005];
void buy_souvenirs(int n, long long p0) {
ll ask = p0 - 1;
pair<vector<int>, ll> res = transaction(ask);
if(res.first.size() == 1){
ask -= res.second + 1;
transaction(ask);
transaction(ask);
}
else{
ll sum = ask - res.second;
transaction(sum / 2);
}
return;
}
// 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... | ||||
