1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include "cielib.h"
#include <bits/stdc++.h>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> tablica(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug{
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(c) { ris; }
#endif
};
#define imie(x) " [" << #x ": " << (x) << "] "

bool better(int * t1, int * t2) { // checks if 't2' is closer
	czyCieplo(t1);
	return czyCieplo(t2);
}
bool worse(int * t1, int * t2) { // checks if 't1' is closer
	czyCieplo(t2);
	return czyCieplo(t1);
}

int main() {
	int d = podajD();
	int range = podajR();
	#define REP(i) for(int i = 0; i < d; ++i)
	int already[d], t1[d], t2[d];
	bool isMax[d];
	REP(i) already[i] = 0;
	while(true) {
		debug() << "debug " << tablica(already, already + d);
		REP(i) isMax[i] = false;
		bool anythingDone = false;
		while(true) {
			REP(i) t1[i] = t2[i] = already[i] + 1;
			int low = 0, high = d - 1;
			while(low < high) {
				int mid = (low + high) / 2;
				for(int i = low; i <= mid; ++i)
					if(!already[i] && !isMax[i])
						--t2[i];
				bool tmp_is_worse = worse(t1, t2);
				for(int i = low; i <= mid; ++i)
					t2[i] = t1[i];
				if(tmp_is_worse) high = mid; // there is max in [low, mid]
				else low = mid + 1;
			}
			bool valid = false;
			if(!already[low] && !isMax[low]) {
				--t2[low];
				if(worse(t1, t2)) valid = true;
				++t2[low];
			}
			if(!valid) break;
			anythingDone = true;
			isMax[low] = true;
			debug() << "max is " << low;
		}
		if(!anythingDone) {
			set<int> current_mins;
			REP(i) if(!already[i]) current_mins.insert(i);
			if(current_mins.empty()) break;
			set<int> mins;
			// copy-paste
			while(true) {
				REP(i) t1[i] = t2[i] = range - 1;
				int low = 0, high = d - 1;
				while(low < high) {
					int mid = (low + high) / 2;
					for(int i = low; i <= mid; ++i)
						if(!already[i] && !isMax[i])
							++t2[i];
					bool tmp_is_worse = worse(t1, t2);
					for(int i = low; i <= mid; ++i)
						t2[i] = t1[i];
					if(tmp_is_worse) high = mid; // there is max in [low, mid]
					else low = mid + 1;
				}
				bool valid = false;
				if(!already[low] && !isMax[low]) {
					++t2[low];
					if(worse(t1, t2)) valid = true;
					--t2[low];
				}
				if(!valid) break;
				anythingDone = true;
				isMax[low] = true;
				mins.insert(low);
				debug() << "min is " << low;
			}
			//assert(mins.size() <= current_mins.size());
			if(mins.size() == current_mins.size()) break;
			REP(i) if(!mins.count(i)) ++already[i];
			break;
		}
		int max_so_far = 0;
		REP(i) /* if(!isMax[i]) */
			max_so_far = max(max_so_far, already[i]);
		int low = 1, high = range - max_so_far;
		//assert(low <= high);
		while(low < high) {
			int diff = (low + high + 1) / 2;
			REP(i) {
				if(isMax[i] || already[i]) {
					t1[i] = already[i] + diff - 1;
					t2[i] = t1[i] + 1;
				}
				else t1[i] = t2[i] = 0;
			}
			if(better(t1, t2)) low = diff;
			else high = diff - 1;
		}
		REP(i) if(isMax[i] || already[i]) already[i] += low;
		if(max_so_far + low == range) break;
	}
	znalazlem(already);
}