# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28549 | not good but never sad (#68) | LR Springboard (FXCUP2_springboard) | C++14 | 3 ms | 2088 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "springboard.h"
#include <vector>
using namespace std;
void Reorder(int N) {
PutBall((N+1)/2);
vector<int> cand;
if (PutBall((N+1)/2) == -1){
for (int i=(N+1)/2;i<=N;i++) cand.push_back(i);
}
else{
for (int i=0;i<(N+1)/2;i++) cand.push_back(i);
}
while (cand.size() > 1){
int step = (cand.size() + 1) / 2;
if (cand.back() != N) step = N + 1 - step;
int r = PutBall(step);
vector<int> ncand;
for (int i=0;i<cand.size();i++){
int nxt = (cand[i] + step) % (N+1);
if ((cand[i] - nxt) * r > 0) ncand.push_back(nxt);
}
cand = ncand;
}
int push = N-cand[0]+1;
if (1 <= push && push <= N) PutBall(push);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |