| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 28547 | not good but never sad (#68) | LR Springboard (FXCUP2_springboard) | C++98 | 1000 ms | 2084 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 <stdio.h>
#include <algorithm>
#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;
		step %= N+1;
		int r = PutBall(step);
		vector<int> nxt = cand;
		for (int &x : nxt) x = (x + step) % (N+1);
		vector<int> ncand;
		for (int i=0;i<cand.size();i++){
			if ((cand[i] - nxt[i]) * r > 0) ncand.push_back(nxt[i]);
		}
		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... | ||||
