QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#740204 | #6836. A Plus B Problem | maspy | AC ✓ | 599ms | 47900kb | C++23 | 21.3kb | 2024-11-13 03:41:34 | 2024-11-13 03:41:34 |
Judging History
answer
#line 1 "library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
ll SUM(vector<int> &A) {
ll sum = 0;
for (auto &&a: A) sum += a;
return sum;
}
template <typename T>
T SUM(vector<T> &A) {
T sum = T(0);
for (auto &&a: A) sum += a;
return sum;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T pick(deque<T> &que) {
assert(que.size());
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T pick(pq<T> &que) {
assert(que.size());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(pqg<T> &que) {
assert(que.size());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T pick(vc<T> &que) {
assert(que.size());
T a = que.back();
que.pop_back();
return a;
}
template <typename T, typename U>
T ceil(T x, U y) {
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
T q = floor(x, y);
return {q, x - q * y};
}
ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
if (check(x))
ok = x;
else
ng = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
if (check(x)) {
ok = x;
} else {
ng = x;
}
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
vi s_to_vi(const string &S, char first_char) {
vi A(S.size());
FOR(i, S.size()) { A[i] = S[i] - first_char; }
return A;
}
template <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
vc<CNT> C(size);
for (auto &&x: A) { ++C[x]; }
return C;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
// stable
vector<int> ids(A.size());
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
int n = len(I);
vc<T> B(n);
FOR(i, n) B[i] = A[I[i]];
return B;
}
#line 1 "library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>
namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail
template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;
struct Scanner {
FILE *fp;
char line[(1 << 15) + 1];
size_t st = 0, ed = 0;
void reread() {
memmove(line, line + st, ed - st);
ed -= st;
st = 0;
ed += fread(line + ed, 1, (1 << 15) - ed, fp);
line[ed] = '\0';
}
bool succ() {
while (true) {
if (st == ed) {
reread();
if (st == ed) return false;
}
while (st != ed && isspace(line[st])) st++;
if (st != ed) break;
}
if (ed - st <= 50) {
bool sep = false;
for (size_t i = st; i < ed; i++) {
if (isspace(line[i])) {
sep = true;
break;
}
}
if (!sep) reread();
}
return true;
}
template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
while (true) {
size_t sz = 0;
while (st + sz < ed && !isspace(line[st + sz])) sz++;
ref.append(line + st, sz);
st += sz;
if (!sz || st != ed) break;
reread();
}
return true;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
bool read_single(T &ref) {
if (!succ()) return false;
bool neg = false;
if (line[st] == '-') {
neg = true;
st++;
}
ref = T(0);
while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
if (neg) ref = -ref;
return true;
}
template <class T, is_modint_t<T> * = nullptr>
bool read_single(T &ref) {
long long val = 0;
bool f = read_single(val);
ref = T(val);
return f;
}
bool read_single(double &ref) {
string s;
if (!read_single(s)) return false;
ref = std::stod(s);
return true;
}
bool read_single(char &ref) {
string s;
if (!read_single(s) || s.size() != 1) return false;
ref = s[0];
return true;
}
template <class T>
bool read_single(vector<T> &ref) {
for (auto &d: ref) {
if (!read_single(d)) return false;
}
return true;
}
template <class T, class U>
bool read_single(pair<T, U> &p) {
return (read_single(p.first) && read_single(p.second));
}
template <class A, class B, class C>
bool read_single(tuple<A, B, C> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)));
}
template <class A, class B, class C, class D>
bool read_single(tuple<A, B, C, D> &p) {
return (read_single(get<0>(p)) && read_single(get<1>(p))
&& read_single(get<2>(p)) && read_single(get<3>(p)));
}
void read() {}
template <class H, class... T>
void read(H &h, T &... t) {
bool f = read_single(h);
assert(f);
read(t...);
}
Scanner(FILE *fp) : fp(fp) {}
};
struct Printer {
Printer(FILE *_fp) : fp(_fp) {}
~Printer() { flush(); }
static constexpr size_t SIZE = 1 << 15;
FILE *fp;
char line[SIZE], small[50];
size_t pos = 0;
void flush() {
fwrite(line, 1, pos, fp);
pos = 0;
}
void write(const char &val) {
if (pos == SIZE) flush();
line[pos++] = val;
}
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void write(T val) {
if (pos > (1 << 15) - 50) flush();
if (val == 0) {
write('0');
return;
}
if (val < 0) {
write('-');
val = -val; // todo min
}
size_t len = 0;
while (val) {
small[len++] = char(0x30 | (val % 10));
val /= 10;
}
for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
pos += len;
}
void write(const string &s) {
for (char c: s) write(c);
}
void write(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) write(s[i]);
}
void write(const double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
void write(const long double &x) {
ostringstream oss;
oss << fixed << setprecision(15) << x;
string s = oss.str();
write(s);
}
template <class T, is_modint_t<T> * = nullptr>
void write(T &ref) {
write(ref.val);
}
template <class T>
void write(const vector<T> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
template <class T, class U>
void write(const pair<T, U> &val) {
write(val.first);
write(' ');
write(val.second);
}
template <class A, class B, class C>
void write(const tuple<A, B, C> &val) {
auto &[a, b, c] = val;
write(a), write(' '), write(b), write(' '), write(c);
}
template <class A, class B, class C, class D>
void write(const tuple<A, B, C, D> &val) {
auto &[a, b, c, d] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
}
template <class A, class B, class C, class D, class E>
void write(const tuple<A, B, C, D, E> &val) {
auto &[a, b, c, d, e] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
}
template <class A, class B, class C, class D, class E, class F>
void write(const tuple<A, B, C, D, E, F> &val) {
auto &[a, b, c, d, e, f] = val;
write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
}
template <class T, size_t S>
void write(const array<T, S> &val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) write(' ');
write(val[i]);
}
}
void write(i128 val) {
string s;
bool negative = 0;
if(val < 0){
negative = 1;
val = -val;
}
while (val) {
s += '0' + int(val % 10);
val /= 10;
}
if(negative) s += "-";
reverse(all(s));
if (len(s) == 0) s = "0";
write(s);
}
};
Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);
void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
printer.write(head);
if (sizeof...(Tail)) printer.write(' ');
print(forward<Tail>(tail)...);
}
void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
scanner.read(head);
read(tail...);
}
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 1 "library/alg/group_cntsum.hpp"
template <typename E = long long>
struct Group_CntSum {
using value_type = pair<E, E>;
using X = value_type;
static constexpr X op(const X &x, const X &y) {
return {x.fi + y.fi, x.se + y.se};
}
static constexpr X inverse(const X &x) { return {-x.fi, -x.se}; }
static constexpr X unit() { return {0, 0}; }
static constexpr bool commute = true;
};
#line 1 "library/alg/monoid_set.hpp"
template <typename E, E none_val>
struct Monoid_Set {
using value_type = E;
using X = value_type;
static X op(X x, X y) { return (y == none_val ? x : y); }
static constexpr X unit() { return none_val; }
static constexpr bool commute = false;
};
#line 3 "library/alg/lazy_cntsum_set.hpp"
template <typename E, E none_val>
struct Lazy_CntSum_Set {
using X_structure = Group_CntSum<E>;
using A_structure = Monoid_Set<E, none_val>;
using X = typename X_structure::value_type;
using A = typename A_structure::value_type;
static constexpr X act(const X &x, const A &a) {
if (a == A_structure::unit()) return x;
return {x.fi, x.fi * a};
}
};
#line 2 "library/ds/lazysegtree.hpp"
template <typename Lazy>
struct LazySegTree {
using Monoid_X = typename Lazy::X_structure;
using Monoid_A = typename Lazy::A_structure;
using X = typename Monoid_X::value_type;
using A = typename Monoid_A::value_type;
int n, log, size;
vc<X> dat;
vc<A> laz;
LazySegTree() : LazySegTree(0) {}
LazySegTree(int n) : LazySegTree(vc<X>(n, Monoid_X::unit())) {}
LazySegTree(vc<X> v) : n(len(v)) {
log = 1;
while ((1 << log) < n) ++log;
size = 1 << log;
dat.assign(size << 1, Monoid_X::unit());
laz.assign(size, Monoid_A::unit());
FOR(i, n) dat[size + i] = v[i];
FOR3_R(i, 1, size) update(i);
}
template <typename F>
LazySegTree(int n, F f) : n(n) {
log = 1;
while ((1 << log) < n) ++log;
size = 1 << log;
dat.assign(size << 1, Monoid_X::unit());
laz.assign(size, Monoid_A::unit());
FOR(i, n) dat[size + i] = f(i);
FOR3_R(i, 1, size) update(i);
}
void reset() {
fill(all(dat), Monoid_X::unit());
fill(all(laz), Monoid_A::unit());
}
void reset(const vc<X>& v) {
assert(len(v) == n);
reset();
FOR(i, n) dat[size + i] = v[i];
FOR3_R(i, 1, size) update(i);
}
void update(int k) { dat[k] = Monoid_X::op(dat[2 * k], dat[2 * k + 1]); }
void all_apply(int k, A a) {
dat[k] = Lazy::act(dat[k], a);
if (k < size) laz[k] = Monoid_A::op(laz[k], a);
}
void push(int k) {
all_apply(2 * k, laz[k]);
all_apply(2 * k + 1, laz[k]);
laz[k] = Monoid_A::unit();
}
void set(int p, X x) {
assert(0 <= p && p < n);
p += size;
for (int i = log; i >= 1; i--) push(p >> i);
dat[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
X get(int p) {
assert(0 <= p && p < n);
p += size;
for (int i = log; i >= 1; i--) push(p >> i);
return dat[p];
}
vc<X> get_all() {
FOR(i, size) push(i);
return {dat.begin() + size, dat.begin() + size + n};
}
X prod(int l, int r) {
assert(0 <= l && l <= r && r <= n);
if (l == r) return Monoid_X::unit();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
X xl = Monoid_X::unit(), xr = Monoid_X::unit();
while (l < r) {
if (l & 1) xl = Monoid_X::op(xl, dat[l++]);
if (r & 1) xr = Monoid_X::op(dat[--r], xr);
l >>= 1;
r >>= 1;
}
return Monoid_X::op(xl, xr);
}
X prod_all() { return dat[1]; }
void apply(int p, A a) {
assert(0 <= p && p < n);
p += size;
dat[p] = Lazy::act(dat[p], a);
for (int i = 1; i <= log; i++) update(p >> i);
}
void apply(int l, int r, A a) {
assert(0 <= l && l <= r && r <= n);
if (l == r) return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1) all_apply(l++, a);
if (r & 1) all_apply(--r, a);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l) update(l >> i);
if (((r >> i) << i) != r) update((r - 1) >> i);
}
}
template <typename C>
int max_right(C& check, int l) {
assert(0 <= l && l <= n);
assert(check(Monoid_X::unit()));
if (l == n) return n;
l += size;
for (int i = log; i >= 1; i--) push(l >> i);
X sm = Monoid_X::unit();
do {
while (l % 2 == 0) l >>= 1;
if (!check(Monoid_X::op(sm, dat[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (check(Monoid_X::op(sm, dat[l]))) {
sm = Monoid_X::op(sm, dat[l]);
l++;
}
}
return l - size;
}
sm = Monoid_X::op(sm, dat[l]);
l++;
} while ((l & -l) != l);
return n;
}
template <typename C>
int min_left(C& check, int r) {
assert(0 <= r && r <= n);
assert(check(Monoid_X::unit()));
if (r == 0) return 0;
r += size;
for (int i = log; i >= 1; i--) push((r - 1) >> i);
X sm = Monoid_X::unit();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!check(Monoid_X::op(dat[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (check(Monoid_X::op(dat[r], sm))) {
sm = Monoid_X::op(dat[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = Monoid_X::op(dat[r], sm);
} while ((r & -r) != r);
return 0;
}
void debug() { print("lazysegtree getall:", get_all()); }
};
#line 5 "main.cpp"
using Lazy = Lazy_CntSum_Set<int, -1>;
void solve() {
LL(N, Q);
vi A, B;
{
STR(S);
STR(T);
A = s_to_vi(S, '0');
B = s_to_vi(T, '0');
}
vi C(N);
FOR_R(i, N) {
C[i] += A[i] + B[i];
if (C[i] >= 10) {
C[i] -= 10;
if (i) C[i - 1] += 1;
}
}
LazySegTree<Lazy> seg(N, [&](int i) -> Lazy::X_structure::value_type {
return {1, C[i]};
});
FOR(Q) {
LL(t, i, c);
--i;
ll& x = (t == 1 ? A[i] : B[i]);
ll add = c - x;
x = c;
pi ANS = {0, 0};
ll now = seg.get(i).se;
if (add > 0) {
if (now + add <= 9) {
// 足すだけ
ANS.fi = 1;
seg.apply(i, now + add);
} else {
// 繰り上がる
ANS.fi = 1;
seg.apply(i, now + add - 10);
// 直前の 9 ラッシュのところ
auto check = [&](auto e) -> bool {
auto [c, s] = e;
return s == c * 9;
};
int j = seg.min_left(check, i);
// [j, i) が全部 9
ANS.fi += i - j;
seg.apply(j, i, 0);
// j-1 をインクリメント
if (j) {
ANS.fi += 1;
seg.apply(j - 1, seg.get(j - 1).se + 1);
}
}
}
if (add < 0) {
if (now + add >= 0) {
ANS.fi += 1;
seg.apply(i, now + add);
} else {
ANS.fi += 1;
seg.apply(i, now + add + 10);
// 直前の 0
auto check = [&](auto e) -> bool {
auto [c, s] = e;
return s == 0;
};
int j = seg.min_left(check, i);
ANS.fi += i - j;
seg.apply(j, i, 9);
if (j) {
ANS.fi += 1;
seg.apply(j - 1, seg.get(j - 1).se - 1);
}
}
}
swap(ANS.fi, ANS.se);
ANS.fi = seg.prod(i, i + 1).se;
if (add != 0) ANS.se++;
print(ANS);
}
}
signed main() {
cout << fixed << setprecision(15);
solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
5 5 01234 56789 2 1 0 2 2 1 2 3 2 2 4 3 2 5 4
output:
0 2 3 2 5 3 7 3 8 3
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3868kb
input:
1 1 1 1 1 1 9
output:
0 2
result:
ok single line: '0 2'
Test #3:
score: 0
Accepted
time: 91ms
memory: 3644kb
input:
10 1000000 6869373857 3130626142 1 9 2 1 10 0 2 7 6 1 1 0 1 7 6 2 10 4 2 3 9 2 4 2 2 4 4 2 7 0 1 2 4 1 9 8 1 3 7 1 7 1 1 1 5 2 1 6 1 3 5 2 5 8 2 6 5 1 6 3 1 3 8 2 4 2 2 6 3 2 2 6 1 10 9 2 1 1 2 5 4 1 1 8 2 4 0 1 9 1 1 1 8 2 4 2 2 9 2 1 10 3 1 8 9 1 4 6 2 3 0 1 1 6 1 7 1 1 10 9 2 4 4 2 5 9 2 1 8 1 9 ...
output:
6 2 2 2 9 0 3 2 2 8 4 2 6 2 2 2 4 2 6 5 6 3 2 4 7 2 2 2 8 2 1 2 5 2 1 3 2 3 8 3 8 2 2 2 6 2 1 3 3 3 7 2 7 3 0 2 9 3 6 4 0 0 1 3 4 2 7 3 0 3 8 3 8 3 8 2 2 0 3 3 0 3 2 3 5 2 9 2 4 2 8 2 3 3 5 3 3 2 5 0 4 2 3 2 1 2 4 2 7 3 0 2 5 2 6 2 0 3 4 2 4 2 3 2 5 3 6 3 3 0 8 2 9 3 9 3 1 2 1 4 7 2 5 2 5 2 4 0 0 2 ...
result:
ok 1000000 lines
Test #4:
score: 0
Accepted
time: 90ms
memory: 3640kb
input:
10 1000000 8702774998 9088637390 1 3 3 2 4 7 1 4 0 1 6 7 1 1 1 1 4 0 2 3 8 1 7 7 2 4 5 2 4 2 1 8 2 2 6 7 1 1 2 1 1 4 1 10 3 1 2 3 1 2 5 1 4 8 1 6 5 1 9 8 1 1 9 1 2 1 1 8 5 1 8 3 1 7 1 1 9 7 1 10 7 1 8 5 1 5 1 2 6 4 1 6 1 2 10 2 1 10 5 2 10 1 1 9 3 2 2 0 1 1 0 1 6 6 2 2 5 2 4 4 2 5 6 2 7 4 1 2 5 2 4 ...
output:
2 3 0 2 8 3 1 0 0 2 8 0 1 0 5 2 6 2 3 2 6 3 5 2 1 2 3 2 3 2 4 2 6 2 1 3 3 2 7 2 8 2 2 2 9 2 7 2 8 3 6 2 7 2 9 2 8 3 9 3 5 2 9 2 7 2 6 2 2 2 2 0 9 2 0 3 7 2 2 2 8 0 5 2 1 3 0 2 2 3 3 2 0 2 3 3 2 2 0 2 2 0 5 2 1 2 3 2 4 3 6 0 6 2 2 2 1 2 6 3 0 2 7 2 7 3 4 0 3 2 8 2 3 2 4 0 8 3 8 2 4 2 5 2 5 2 5 2 7 2 ...
result:
ok 1000000 lines
Test #5:
score: 0
Accepted
time: 85ms
memory: 3636kb
input:
10 1000000 6869373857 3130626142 1 3 2 1 8 6 1 8 8 1 3 6 1 1 6 1 1 6 2 5 3 2 5 6 2 4 2 2 5 7 2 5 6 2 4 0 2 5 0 2 5 6 1 3 7 1 3 6 2 7 0 2 1 6 2 1 3 2 7 6 2 5 8 2 6 6 2 5 2 2 5 8 2 3 3 2 2 1 2 2 1 2 3 3 2 4 0 2 5 4 2 5 8 2 4 0 2 6 2 2 1 2 2 1 3 1 1 8 2 3 9 2 3 3 1 1 6 2 5 6 2 7 7 1 4 6 1 1 2 1 1 6 1 4...
output:
5 2 7 2 9 2 9 2 9 0 9 0 6 2 9 2 1 5 0 3 9 3 9 5 3 2 9 2 0 4 9 4 3 2 2 2 9 2 9 2 1 6 3 3 6 6 2 6 0 0 0 0 0 0 0 0 0 0 8 6 2 6 0 0 9 3 9 2 0 2 2 2 6 2 0 2 0 2 9 6 0 8 7 5 5 2 9 2 0 5 9 8 5 2 3 5 5 2 9 2 9 5 9 2 8 2 9 2 7 2 9 2 3 10 8 3 0 3 9 10 8 2 5 2 2 4 6 2 4 4 6 3 3 3 9 3 3 2 5 4 7 2 6 2 8 2 1 3 9 ...
result:
ok 1000000 lines
Test #6:
score: 0
Accepted
time: 104ms
memory: 3696kb
input:
10 1000000 6869373857 3130626142 1 9 6 1 9 5 1 10 8 1 10 7 2 7 8 2 7 6 1 6 8 1 6 7 1 7 8 1 7 3 2 10 4 2 10 2 2 8 3 2 8 1 2 9 7 2 9 4 2 9 9 2 9 4 2 7 7 2 7 6 1 7 4 1 7 3 1 9 6 1 9 5 1 8 9 1 8 8 1 7 5 1 7 3 1 6 9 1 6 7 2 6 8 2 6 2 1 8 9 1 8 8 2 10 6 2 10 2 2 6 9 2 6 2 1 6 9 1 6 7 1 8 9 1 8 8 2 9 7 2 9...
output:
0 10 9 10 0 11 9 11 1 8 9 8 0 7 9 7 4 8 9 8 1 11 9 11 1 9 9 9 2 10 9 10 4 10 9 10 0 8 9 8 0 8 9 8 0 10 9 10 0 9 9 9 1 8 9 8 1 7 9 7 5 7 9 7 0 9 9 9 3 11 9 11 6 7 9 7 1 7 9 7 0 9 9 9 2 10 9 10 2 7 9 7 1 8 9 8 1 11 9 11 4 7 9 7 5 11 9 11 0 7 9 7 0 10 9 10 1 10 9 10 0 7 9 7 2 10 9 10 2 10 9 10 1 11 9 1...
result:
ok 1000000 lines
Test #7:
score: 0
Accepted
time: 484ms
memory: 47624kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
4 2 6 2 4 2 5 2 7 97772 8 2 0 140233 6 2 5 2 1 2 1 70008 8 2 1 987 0 138405 5 2 6 138113 1 121002 2 35285 4 2 0 2 3 25467 5 2 8 2 4 5543 6 2 1 3862 8 2 3 107304 6 81700 0 0 2 2 0 0 0 15551 5 14120 3 4872 7 2 0 0 6 58933 6 2 9 7954 4 2 4 2 3 63166 0 0 8 38562 1 349 6 10624 3 2 3 2 4 2 8 65159 4 21435...
result:
ok 1000000 lines
Test #8:
score: 0
Accepted
time: 492ms
memory: 47892kb
input:
1000000 1000000 61693798575862907668150369943297325385708140884272416052068257423550554279326571150943024493087202814853321120702792765522060610138341594081829639894344885616853227782222149213319781393275876306231911209117574815406667384452247691376587753208747407802994802745837490373194507888042646...
output:
9 6 6 4 0 3 0 2 6 2 4 2 9 3 2 3 1 6 3 2 2 2 9 4 0 5 4 2 9 4 0 2 9 3 9 2 6 2 8 0 7 3 8 5 0 0 4 4 9 3 9 3 0 3 4 3 9 2 5 2 9 3 0 0 6 3 1 7 0 3 9 0 0 0 9 2 3 2 0 2 9 3 5 2 6 0 1 2 5 2 9 3 2 0 1 2 9 9 0 3 3 6 9 0 9 3 1 5 0 0 9 2 8 3 0 3 0 2 0 3 1 2 9 2 9 3 0 2 6 3 0 3 9 2 9 2 0 3 3 2 0 3 0 4 6 2 0 2 6 3 ...
result:
ok 1000000 lines
Test #9:
score: 0
Accepted
time: 573ms
memory: 47796kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
3 958194 6 349300 6 259789 4 2 1 77093 6 2 9 2 8 2 9 2 5 133811 5 2 0 8254 9 0 9 0 9 8254 9 2 4 5608 4 2 3 328452 6 97720 7 8629 0 0 7 13938 9 113207 0 113207 4 2 0 0 4 2 9 2 1 2 6 2 9 2 0 2 0 0 1 2 0 2 0 2 4 2808 9 2808 0 13938 2 206652 0 206652 9 115835 0 115835 0 0 2 2 9 2 2 2 3 2 0 2 0 2 9 8629 ...
result:
ok 1000000 lines
Test #10:
score: 0
Accepted
time: 599ms
memory: 47900kb
input:
1000000 1000000 68693738574822907668000669943297325347608140886272616051068251483556534289323531160993017440087302814083329820936792365202060610991343493080865626095241885616863256382251749215319751373247876361270911203617554820406029584474249635378527788208607403822974202545637490373196507887743784...
output:
0 832279 9 832279 9 0 9 0 0 754544 9 754544 1 609087 9 609087 4 930049 9 930049 0 809411 9 809411 0 749318 9 749318 0 582458 9 582458 9 0 9 0 0 868657 9 868657 9 0 9 0 2 707359 9 707359 1 869642 9 869642 0 568452 9 568452 0 735732 9 735732 2 568160 9 568160 0 551049 9 551049 1 535285 9 535285 0 8651...
result:
ok 1000000 lines