| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1314117 | AhmadAlhussain | Souvenirs (IOI25_souvenirs) | C++20 | 12 ms | 400 KiB |
#include<bits/stdc++.h>
using namespace std;
pair<vector<int>,long long> transaction(long long M);
int cnt=0;
void buy_souvenirs(int N,long long p0) {
long long last=p0;
for(int i=1;i<N-1;i++) {
auto[v,r]=transaction(last-1);
if(v.size()==2||r==1) {
last-=2;
cnt+=v.size()==2;
}
else {
last-=1;
}
for(int j=1;j<i;j++) {
transaction(last);
}
}
for(int i=cnt;i<N-1;i++) {
transaction(last-1);
}
}
| # | 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... | ||||
