QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #683579 | #9519. Build a Computer | SorahISA | AC ✓ | 0ms | 3852kb | C++23 | 13.6kb | 2024-10-27 21:57:09 | 2024-10-27 21:57:09 |
Judging History
answer
#ifndef SorahISA
#define SorahISA
#include SorahISA __FILE__ SorahISA
const int maxc = 1 << 20;
struct Trie {
struct Node {
array<int, 2> ch;
vector<int> zeroes;
int is_end = 0;
};
vector<Node> trie;
int root;
void init() {
trie.clear(), trie.reserve(200);
root = new_node();
}
int new_node() {
trie.eb(Node{.ch{-1, -1}});
return SZ(trie) - 1;
}
void insert(int val, int trailing_zero) {
int now = root;
for (int b = __lg(val); b >= 0; --b) {
auto &tmp = trie[now].ch[val >> b & 1];
if (tmp == -1) tmp = new_node();
now = tmp;
}
trie[now].zeroes.eb(trailing_zero);
trie[now].is_end |= (trailing_zero == 0);
}
};
void solve() {
int L, R; cin >> L >> R;
if (L == 1 and R == 1) {
print(2);
print(1, 2, 1);
print(0);
return;
}
bool flag_has_one = false;
if (L == 1) ++L, flag_has_one = true;
Trie trie; trie.init();
int n_dont_care = 0;
function<void(int, int, int, int)> recur = [&](int qL, int qR, int nL, int nR) {
if (qL <= nL and nR <= qR) {
int meow = __lg(nR - nL + 1);
chmax(n_dont_care, meow);
// debug(nL, nR, nL >> meow, meow);
trie.insert(nL >> meow, meow);
return;
}
int nM = (nL + nR) >> 1;
if (qL <= nM) recur(qL, qR, nL, nM);
if (nM < qR) recur(qL, qR, nM+1, nR);
};
recur(L, R, 0, maxc-1);
vector<tuple<int, int, int>> edges;
if (flag_has_one) edges.eb(0, 1000, 1);
for (int i = 0; i < n_dont_care-1; ++i) {
edges.eb(1000-i-1, 1000-i, 0), edges.eb(1000-i-1, 1000-i, 1);
}
for (int i = 0; i < SZ(trie.trie); ++i) {
// debug(i, trie.trie[i].ch, trie.trie[i].zeroes);
if (trie.trie[i].ch[0] != -1) {
edges.eb(i, (trie.trie[trie.trie[i].ch[0]].is_end ? 1000 : trie.trie[i].ch[0]), 0);
}
if (trie.trie[i].ch[1] != -1) {
edges.eb(i, (trie.trie[trie.trie[i].ch[1]].is_end ? 1000 : trie.trie[i].ch[1]), 1);
}
for (int z : trie.trie[i].zeroes) {
if (z) edges.eb(i, 1000-z+1, 0), edges.eb(i, 1000-z+1, 1);
}
}
vector<int> used_id;
for (auto [u, v, w] : edges) used_id.eb(u), used_id.eb(v);
sort(ALL(used_id)), used_id.erase(unique(ALL(used_id)), end(used_id));
for (auto &[u, v, w] : edges) {
u = lower_bound(ALL(used_id), u) - begin(used_id);
v = lower_bound(ALL(used_id), v) - begin(used_id);
}
vector<vector<pii>> adj(SZ(used_id));
for (auto [u, v, w] : edges) adj[u].eb(v+1, w);
print(SZ(used_id));
for (int i = 0; i < SZ(used_id); ++i) {
print(SZ(adj[i]), adj[i]);
// cout << SZ(adj[i]);
// for (auto [x, w] : adj[i]) cout << " " << x+1 << " " << w;
// cout << "\n";
}
}
int32_t main() {
fastIO();
int t = 1; // cin >> t;
for (int _ = 1; _ <= t; ++_) {
// cout << "Case #" << _ << ": ";
solve();
}
return 0;
}
#else
#ifdef local
#define _GLIBCXX_DEBUG 1
#endif
#pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <bits/extc++.h>
// #include <tr2/dynamic_bitset>
#include <experimental/iterator>
using i64 = long long;
using i128 = __int128;
#define int i64
using f80 = long double;
using f128 = __float128;
#define double f80
using pii = pair<int, int>;
template <typename T> using Prior = std::priority_queue<T>;
template <typename T> using prior = std::priority_queue<T, vector<T>, greater<T>>;
// #define X first
// #define Y second
#define eb emplace_back
#define ef emplace_front
#define ee emplace
#define pb pop_back
#define pf pop_front
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define SZ(x) ((int)(x).size())
// template <size_t D, typename T> struct Vec : vector<Vec<D-1, T>> {
// static_assert(D >= 1, "Vector dimension must be greater than zero!");
// template <typename... Args> Vec(int n = 0, Args... args) : vector<Vec<D-1, T>>(n, Vec<D-1, T>(args...)) {}
// };
// template <typename T> struct Vec<1, T> : vector<T> {
// Vec(int n = 0, const T& val = T()) : vector<T>(n, val) {}
// };
template <typename T1, typename T2>
ostream& operator << (ostream &os, const pair<T1, T2> &p) {
return os << p.first << " " << p.second;
}
template <typename T>
ostream& operator << (ostream &os, const vector<T> &vec) {
for (size_t i = 0; i < size(vec); ++i) {
if (i) os << " ";
os << vec[i];
}
return os;
}
#ifdef local
#define fastIO() void()
#define debug(...) \
_color.emplace_back("\u001b[31m"), \
fprintf(stderr, "%sAt [%s], line %d: (%s) = ", _color.back().c_str(), __FUNCTION__, __LINE__, #__VA_ARGS__), \
_do(__VA_ARGS__), _color.pop_back(), \
fprintf(stderr, "%s", _color.back().c_str())
#define print(...) \
fprintf(stdout, "%s", "\u001b[36m"), \
_P(__VA_ARGS__), \
fprintf(stdout, "%s", "\u001b[0m")
deque<string> _color{"\u001b[0m"};
template <typename T> concept is_string = is_same_v<T, string&> or is_same_v<T, const string&>;
template <typename T> concept is_iterable = requires (T _t) { begin(_t); };
template <typename T> inline void _print_err(T &&_t);
template <typename T> inline void _print_err(T &&_t) requires is_iterable<T> and (not is_string<T>);
template <size_t I, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(const tuple<U...> &);
template <size_t I, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(const tuple<U...> &_t);
template <size_t I, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(tuple<U...> &);
template <size_t I, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(tuple<U...> &_t);
// template <typename T, typename U> ostream& operator << (ostream &os, const pair<T, U> &_tu);
inline void _do() { cerr << "\n"; }
template <typename T> inline void _do(T &&_t) { _print_err(_t), cerr << "\n"; }
template <typename T, typename ...U> inline void _do(T &&_t, U &&..._u) { _print_err(_t), cerr << ", ", _do(_u...); }
#else
#define fastIO() cin.tie(0)->sync_with_stdio(0)
#define debug(...) void()
#define print(...) _P(__VA_ARGS__)
#endif
inline void _P() { cout << "\n"; }
template <typename T> inline void _P(T &&_t) { cout << _t << "\n"; }
template <typename T, typename ...U> inline void _P(T &&_t, U &&..._u) { cout << _t << " ", _P(_u...); }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int getRand(int L, int R) {
if (L > R) swap(L, R);
return (int)(rng() % ((uint64_t)R - L + 1) + L);
}
template <typename T, typename U> bool chmin(T &lhs, U rhs) { return lhs > rhs ? lhs = rhs, 1 : 0; }
template <typename T, typename U> bool chmax(T &lhs, U rhs) { return lhs < rhs ? lhs = rhs, 1 : 0; }
/// below are Fast I/O and _print_err templates ///
/*
/// Fast I/O by FHVirus ///
/// https://fhvirus.github.io/blog/2020/fhvirus-io/ ///
#include <unistd.h>
const int S = 65536;
int OP = 0;
char OB[S];
inline char RC() {
static char buf[S], *p = buf, *q = buf;
return p == q and (q = (p = buf) + read(0, buf, S)) == buf ? -1 : *p++;
}
inline int RI() {
static char c;
int a;
while (((c = RC()) < '0' or c > '9') and c != '-' and c != -1);
if (c == '-') {
a = 0;
while ((c = RC()) >= '0' and c <= '9') a *= 10, a -= c ^ '0';
}
else {
a = c ^ '0';
while ((c = RC()) >= '0' and c <= '9') a *= 10, a += c ^ '0';
}
return a;
}
inline void WI(int n, char c = '\n') {
static char buf[20], p;
if (n == 0) OB[OP++] = '0';
p = 0;
if (n < 0) {
OB[OP++] = '-';
while (n) buf[p++] = '0' - (n % 10), n /= 10;
}
else {
while (n) buf[p++] = '0' + (n % 10), n /= 10;
}
for (--p; p >= 0; --p) OB[OP++] = buf[p];
OB[OP++] = c;
if (OP > S-20) write(1, OB, OP), OP = 0;
}
/// Fast I/O by FHVirus ///
/// https://fhvirus.github.io/blog/2020/fhvirus-io/ ///
*/
#ifdef local
template <typename T> inline void _print_err(T &&_t) { cerr << _t; }
template <typename T> inline void _print_err(T &&_t) requires is_iterable<T> and (not is_string<T>) {
_color.emplace_back(_color.back()), ++_color.back()[3];
cerr << _color.back() << "[";
for (bool _first = true; auto &_x : _t) {
if (!_first) cerr << ", ";
_print_err(_x), _first = false;
}
cerr << "]" << (_color.pop_back(), _color.back());
}
// template <typename T, typename U> ostream& operator << (ostream &os, const pair<T, U> &_tu) {
// _color.emplace_back(_color.back()), ++_color.back()[3];
// cerr << _color.back() << "(";
// _print_err(_tu.first), cerr << ", ", _print_err(_tu.second);
// cerr << ")" << (_color.pop_back(), _color.back());
// return os;
// }
template <size_t I = 0, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(const tuple<U...> &) {
cerr << ")" << (_color.pop_back(), _color.back());
}
template <size_t I = 0, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(const tuple<U...> &_t) {
if (!I) {
_color.emplace_back(_color.back()), ++_color.back()[3];
cerr << _color.back();
}
cerr << (I ? ", " : "("), _print_err(get<I>(_t)), _print_err<I+1, U...>(_t);
}
template <size_t I = 0, typename ...U> inline typename enable_if<I == sizeof...(U), void>::type _print_err(tuple<U...> &) {
cerr << ")" << (_color.pop_back(), _color.back());
}
template <size_t I = 0, typename ...U> inline typename enable_if<I < sizeof...(U), void>::type _print_err(tuple<U...> &_t) {
if (!I) {
_color.emplace_back(_color.back()), ++_color.back()[3];
cerr << _color.back();
}
cerr << (I ? ", " : "("), _print_err(get<I>(_t)), _print_err<I+1, U...>(_t);
}
#endif
#endif
/**
*
*
*
* iiiiii iiiiiiiiii iiiiiiiiiiiiii
* iiiiiiiiiiiii iiiiiii iiii iiiiiiiiiiiiiii ii iiii
* iiiiiiii iiiiiiiii iiii iiii iii iii iiiiiiiiii
* iiiiiii iiiiii iiii iiii ii iiiiiiiiii iiii iiii
* iiiiii iiiii iiii iiii iii iiii iiiiiiiiiiiiiiiii ii
* iiiiii iiiiiii iiiiiii iiiiiiii iii iiiiiiiiiiiiii iii iiii
* iiiiii iiiiiii iiiii ii iiii iiiiiiiiiii iiii iii iiii iiii iii
* iiiii iiiiiiii ii iiiii iiii iiiiiiiii iii iii iii iii ii iiii
* iiiiii iiiiiiii iiiii iiiii iiiiiiiiiiiiiiii iii iii ii iii iii iiii
* iiiii iiiiii iiii iiiiii iiiiiii iii iii iiii ii i ii iii iii
* iiiiii iiii iiiiiiiiiiiiiii iii iiii iiiii iii ii iii iii ii
* iiiii iiiiiiii iiiiiiiiii iiii iiiiiiiii ii iii ii
* iiiii iiiiii iiii iiiii iii ii ii i
* iiiiii iiiiiiii iiiii iiiii ii ii ii
* iiiii iiii iiii iiiiiiiiiiii ii
* iii iiii iiii iiiiiiii
* iiiii iiii
* iiii iiii
* iiii iiiii
* iii iiiii
* iii iiiii
* iii iiiiii
* iiiiiiiii
* iiiiii
*
*
*
**/
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3764kb
input:
5 7
output:
5 1 2 1 2 3 0 4 1 1 5 1 2 5 0 5 1 0
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3852kb
input:
10 27
output:
9 1 2 1 2 3 0 5 1 3 4 1 7 0 7 1 2 9 0 9 1 3 6 0 8 0 8 1 2 8 0 8 1 2 8 0 8 1 2 9 0 9 1 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
5 13
output:
7 1 2 1 2 3 0 4 1 3 7 1 6 0 6 1 3 5 0 7 0 7 1 2 7 0 7 1 2 7 0 7 1 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1 1000000
output:
44 2 44 1 2 1 38 3 0 4 1 44 0 44 1 43 0 43 1 42 0 42 1 41 0 41 1 40 0 40 1 39 0 39 1 38 0 38 1 37 0 37 1 36 0 36 1 35 0 35 1 34 0 34 1 33 0 33 1 32 0 32 1 31 0 31 1 30 0 30 1 29 0 29 1 28 0 28 1 27 0 27 1 2 27 0 27 1 2 5 0 6 1 2 28 0 28 1 2 7 0 8 1 2 29 0 29 1 1 9 0 2 10 0 11 1 2 31 0 31 1 1 12 0 1 ...
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
1 1
output:
2 1 2 1 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
7 9
output:
6 1 2 1 2 4 0 3 1 1 6 1 1 5 0 2 6 0 6 1 0
result:
ok ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
3 7
output:
4 1 2 1 3 4 1 3 0 3 1 2 4 0 4 1 0
result:
ok ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 5
output:
4 2 4 1 2 1 3 3 0 4 0 4 1 2 4 0 4 1 0
result:
ok ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3792kb
input:
1 4
output:
4 2 4 1 2 1 3 3 0 4 0 4 1 1 4 0 0
result:
ok ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
8 9
output:
5 1 2 1 1 3 0 1 4 0 2 5 0 5 1 0
result:
ok ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
7 51
output:
10 1 2 1 6 4 0 3 1 8 0 8 1 7 0 7 1 2 5 0 10 1 2 7 0 7 1 1 6 0 2 9 0 9 1 2 8 0 8 1 2 9 0 9 1 2 10 0 10 1 0
result:
ok ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
51 79
output:
14 1 2 1 2 9 0 3 1 2 4 0 8 1 2 5 0 7 1 1 6 1 1 14 1 2 13 0 13 1 2 12 0 12 1 1 10 0 2 11 0 11 1 2 12 0 12 1 2 13 0 13 1 2 14 0 14 1 0
result:
ok ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
92 99
output:
12 1 2 1 2 3 0 7 1 1 4 1 1 5 1 1 6 1 2 11 0 11 1 1 8 0 1 9 0 1 10 0 2 11 0 11 1 2 12 0 12 1 0
result:
ok ok
Test #14:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
27 36
output:
13 1 2 1 2 7 0 3 1 2 4 0 6 1 1 5 1 1 13 1 2 12 0 12 1 1 8 0 2 9 0 10 1 2 12 0 12 1 1 11 0 1 13 0 2 13 0 13 1 0
result:
ok ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
55 84
output:
18 1 2 1 2 8 0 3 1 2 4 0 7 1 1 5 1 1 6 1 1 18 1 2 16 0 16 1 2 9 0 10 1 2 15 0 15 1 1 11 0 2 12 0 13 1 2 17 0 17 1 1 14 0 1 18 0 2 16 0 16 1 2 17 0 17 1 2 18 0 18 1 0
result:
ok ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
297208 929600
output:
67 1 2 1 2 3 0 25 1 4 4 0 24 1 50 0 50 1 1 5 1 2 6 0 23 1 2 7 0 22 1 2 8 0 21 1 1 9 1 2 10 0 20 1 2 11 0 19 1 2 12 0 18 1 1 13 1 1 14 1 1 15 1 1 16 1 1 17 1 2 65 0 65 1 2 60 0 60 1 2 59 0 59 1 2 58 0 58 1 2 56 0 56 1 2 55 0 55 1 2 54 0 54 1 2 52 0 52 1 4 26 0 27 1 51 0 51 1 2 51 0 51 1 1 28 0 1 29 0...
result:
ok ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
45728 589156
output:
62 1 2 1 8 3 0 17 1 47 0 47 1 46 0 46 1 45 0 45 1 2 18 0 4 1 1 5 1 2 6 0 16 1 2 7 0 15 1 1 8 1 2 9 0 14 1 1 10 1 2 11 0 13 1 1 12 1 2 58 0 58 1 2 57 0 57 1 2 55 0 55 1 2 53 0 53 1 2 52 0 52 1 2 49 0 49 1 1 19 0 2 20 0 21 1 2 48 0 48 1 2 22 0 23 1 2 49 0 49 1 2 24 0 25 1 2 50 0 50 1 2 26 0 27 1 2 51 ...
result:
ok ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
129152 138000
output:
47 1 2 1 2 15 0 3 1 1 4 1 1 5 1 1 6 1 1 7 1 2 8 0 14 1 2 9 0 13 1 2 10 0 12 1 1 11 1 2 41 0 41 1 2 40 0 40 1 2 39 0 39 1 2 38 0 38 1 1 16 0 1 17 0 1 18 0 2 19 0 20 1 2 36 0 36 1 2 21 0 22 1 2 37 0 37 1 1 23 0 2 24 0 25 1 2 39 0 39 1 2 26 0 27 1 2 40 0 40 1 1 28 0 1 29 0 1 30 0 2 31 0 32 1 2 44 0 44 ...
result:
ok ok
Test #19:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
245280 654141
output:
66 1 2 1 4 19 0 3 1 49 0 49 1 1 4 1 2 5 0 18 1 1 6 1 1 7 1 1 8 1 1 9 1 1 10 1 2 11 0 17 1 2 12 0 16 1 2 13 0 15 1 1 14 1 2 62 0 62 1 2 61 0 61 1 2 60 0 60 1 2 59 0 59 1 2 53 0 53 1 1 20 0 2 21 0 22 1 2 51 0 51 1 2 23 0 24 1 2 52 0 52 1 2 25 0 26 1 2 53 0 53 1 2 27 0 28 1 2 54 0 54 1 2 29 0 30 1 2 55...
result:
ok ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
202985 296000
output:
62 1 2 1 2 28 0 3 1 2 4 0 27 1 2 5 0 26 1 2 6 0 25 1 1 7 1 1 8 1 2 9 0 24 1 2 10 0 23 1 2 11 0 22 1 1 12 1 1 13 1 1 14 1 2 15 0 21 1 1 16 1 2 17 0 20 1 2 18 0 19 1 1 62 1 2 62 0 62 1 2 61 0 61 1 2 59 0 59 1 2 55 0 55 1 2 54 0 54 1 2 53 0 53 1 2 50 0 50 1 2 49 0 49 1 2 48 0 48 1 1 29 0 2 30 0 31 1 2 ...
result:
ok ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
438671 951305
output:
65 1 2 1 2 28 0 3 1 2 4 0 27 1 3 5 1 49 0 49 1 2 6 0 26 1 1 7 1 1 8 1 2 9 0 25 1 2 10 0 24 1 2 11 0 23 1 1 12 1 1 13 1 2 14 0 22 1 2 15 0 21 1 2 16 0 20 1 1 17 1 1 18 1 1 19 1 1 65 1 2 62 0 62 1 2 61 0 61 1 2 60 0 60 1 2 57 0 57 1 2 56 0 56 1 2 55 0 55 1 2 52 0 52 1 3 29 0 50 0 50 1 2 48 0 48 1 2 30...
result:
ok ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3800kb
input:
425249 739633
output:
70 1 2 1 2 29 0 3 1 2 4 0 28 1 2 5 0 27 1 1 6 1 1 7 1 1 8 1 1 9 1 1 10 1 2 11 0 26 1 1 12 1 2 13 0 25 1 2 14 0 24 1 1 15 1 2 16 0 23 1 2 17 0 22 1 2 18 0 21 1 2 19 0 20 1 1 70 1 2 70 0 70 1 2 69 0 69 1 2 68 0 68 1 2 67 0 67 1 2 65 0 65 1 2 64 0 64 1 2 62 0 62 1 2 56 0 56 1 2 55 0 55 1 2 30 0 31 1 2 ...
result:
ok ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
551207 961718
output:
75 1 2 1 2 3 0 31 1 2 4 0 30 1 2 5 0 29 1 2 6 0 28 1 1 7 1 1 8 1 2 9 0 27 1 1 10 1 2 11 0 26 1 2 12 0 25 1 1 13 1 2 14 0 24 1 2 15 0 23 1 1 16 1 2 17 0 22 1 2 18 0 21 1 1 19 1 1 20 1 1 75 1 2 73 0 73 1 2 72 0 72 1 2 70 0 70 1 2 69 0 69 1 2 67 0 67 1 2 66 0 66 1 2 64 0 64 1 2 61 0 61 1 2 60 0 60 1 2 ...
result:
ok ok
Test #24:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
114691 598186
output:
71 1 2 1 6 30 0 3 1 55 0 55 1 54 0 54 1 1 4 1 2 5 0 29 1 2 6 0 28 1 2 7 0 27 1 2 8 0 26 1 2 9 0 25 1 2 10 0 24 1 2 11 0 23 1 2 12 0 22 1 2 13 0 21 1 2 14 0 20 1 2 15 0 19 1 2 16 0 18 1 1 17 1 1 71 1 2 70 0 70 1 2 69 0 69 1 2 68 0 68 1 2 67 0 67 1 2 66 0 66 1 2 65 0 65 1 2 64 0 64 1 2 63 0 63 1 2 62 ...
result:
ok ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
234654 253129
output:
57 1 2 1 1 3 1 1 4 1 2 5 0 25 1 2 6 0 24 1 1 7 1 2 8 0 23 1 1 9 1 2 10 0 22 1 2 11 0 21 1 1 12 1 2 13 0 20 1 2 14 0 19 1 1 15 1 1 16 1 1 17 1 1 18 1 2 57 0 57 1 2 53 0 53 1 2 52 0 52 1 2 50 0 50 1 2 49 0 49 1 2 47 0 47 1 2 45 0 45 1 1 26 0 2 27 0 28 1 2 46 0 46 1 2 29 0 30 1 2 47 0 47 1 2 31 0 32 1 ...
result:
ok ok
Test #26:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
554090 608599
output:
61 1 2 1 1 3 0 1 4 0 2 5 0 28 1 2 6 0 27 1 1 7 1 1 8 1 1 9 1 2 10 0 26 1 1 11 1 2 12 0 25 1 2 13 0 24 1 2 14 0 23 1 1 15 1 1 16 1 2 17 0 22 1 1 18 1 2 19 0 21 1 1 20 1 2 61 0 61 1 2 60 0 60 1 2 58 0 58 1 2 55 0 55 1 2 54 0 54 1 2 53 0 53 1 2 51 0 51 1 2 47 0 47 1 1 29 0 2 30 0 31 1 2 48 0 48 1 1 32 ...
result:
ok ok
Extra Test:
score: 0
Extra Test Passed