Hashiryo's Library
This documentation is automatically generated by competitive-verifier/competitive-verifier
test/aoj/0629.min_left.test.cpp
- View this file on GitHub
- Last update: 2024-10-11 11:35:48+09:00
- Problem: https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Final/0629
Depends on
detection idiom (src/Internal/detection_idiom.hpp)Code
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Final/0629
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// min_left
#include <iostream>
#include <vector>
#include "src/DataStructure/SegmentTree.hpp"
using namespace std;
struct M {
using T= long long;
using E= long long;
static T ti() { return 1ll << 60; }
static T op(T l, T r) { return min(l, r); }
static void mp(T &v, E y) { v+= y; }
static void cp(E &x, E y) { x+= y; }
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
int X[Q], D[Q], L[Q];
for (int q= 0; q < Q; ++q) cin >> X[q] >> D[q] >> L[q];
SegmentTree<M> seg1(N + 1, [&](int i) { return i; }), seg2(N + 1, [&](int i) { return i; });
for (int q= Q; q--;) {
if (D[q] == 1) {
int i= seg1.min_left(N + 1, [&](long long x) { return x > X[q]; });
seg2.apply(0, i, -2ll * L[q]);
} else {
int i= seg2.min_left(N + 1, [&](long long x) { return x > X[q]; });
seg1.apply(i, N + 1, 2ll * L[q]);
}
}
for (int i= 1; i <= N; ++i) cout << (seg1[i] - seg2[i]) / 2 << '\n';
return 0;
}
#line 1 "test/aoj/0629.min_left.test.cpp"
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Final/0629
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// min_left
#include <iostream>
#include <vector>
#line 2 "src/DataStructure/SegmentTree.hpp"
#include <memory>
#include <cassert>
#line 5 "src/DataStructure/SegmentTree.hpp"
#include <algorithm>
#line 2 "src/Internal/detection_idiom.hpp"
#include <type_traits>
#define _DETECT_BOOL(name, ...) \
template <class, class= void> struct name: std::false_type {}; \
template <class T> struct name<T, std::void_t<__VA_ARGS__>>: std::true_type {}; \
template <class T> static constexpr bool name##_v= name<T>::value
#define _DETECT_TYPE(name, type1, type2, ...) \
template <class T, class= void> struct name { \
using type= type2; \
}; \
template <class T> struct name<T, std::void_t<__VA_ARGS__>> { \
using type= type1; \
}
#line 7 "src/DataStructure/SegmentTree.hpp"
template <class M> class SegmentTree {
_DETECT_BOOL(monoid, typename T::T, decltype(&T::op), decltype(&T::ti));
_DETECT_BOOL(dual, typename T::T, typename T::E, decltype(&T::mp), decltype(&T::cp));
_DETECT_TYPE(nullptr_or_E, typename T::E, std::nullptr_t, typename T::E);
using T= typename M::T;
using E= typename nullptr_or_E<M>::type;
int n;
std::unique_ptr<T[]> dat;
std::unique_ptr<E[]> laz;
std::unique_ptr<bool[]> flg;
inline void update(int k) { dat[k]= M::op(dat[k << 1], dat[k << 1 | 1]); }
inline bool map(int k, E x, int sz) {
if constexpr (std::is_invocable_r_v<bool, decltype(M::mp), T &, E, int>) return M::mp(dat[k], x, sz);
else if constexpr (std::is_invocable_r_v<bool, decltype(M::mp), T &, E>) return M::mp(dat[k], x);
else if constexpr (std::is_invocable_r_v<void, decltype(M::mp), T &, E, int>) return M::mp(dat[k], x, sz), true;
else return M::mp(dat[k], x), true;
}
inline void prop(int k, E x, int sz) {
if (k < n) {
if (flg[k]) M::cp(laz[k], x);
else laz[k]= x;
flg[k]= true;
if constexpr (monoid_v<M>)
if (!map(k, x, sz)) push(k, sz), update(k);
} else {
if constexpr (monoid_v<M>) map(k, x, 1);
else map(k - n, x, 1);
}
}
inline void push(int k, int sz) {
if (flg[k]) prop(k << 1, laz[k], sz >> 1), prop(k << 1 | 1, laz[k], sz >> 1), flg[k]= false;
}
inline bool valid(int k) const {
int d= __builtin_clz(k) - __builtin_clz(n);
return (n >> d) != k || ((n >> d) << d) == n;
}
public:
SegmentTree() {}
SegmentTree(int n): n(n), dat(std::make_unique<T[]>(n << monoid_v<M>)) {
if constexpr (monoid_v<M>) std::fill_n(dat.get(), n << 1, M::ti());
if constexpr (dual_v<M>) laz= std::make_unique<E[]>(n), flg= std::make_unique<bool[]>(n), std::fill_n(flg.get(), n, false);
}
template <class F> SegmentTree(int n, const F &init): n(n), dat(std::make_unique<T[]>(n << monoid_v<M>)) {
auto a= dat.get() + (n & -monoid_v<M>);
for (int i= 0; i < n; ++i) a[i]= init(i);
if constexpr (monoid_v<M>) build();
if constexpr (dual_v<M>) laz= std::make_unique<E[]>(n), flg= std::make_unique<bool[]>(n), std::fill_n(flg.get(), n, false);
}
SegmentTree(int n, T x): SegmentTree(n, [x](int) { return x; }) {}
SegmentTree(const std::vector<T> &v): SegmentTree(v.size(), [&v](int i) { return v[i]; }) {}
SegmentTree(const T *bg, const T *ed): SegmentTree(ed - bg, [bg](int i) { return bg[i]; }) {}
void build() {
static_assert(monoid_v<M>, "\"build\" is not available\n");
for (int i= n; --i;) update(i);
}
inline void unsafe_set(int i, T x) {
static_assert(monoid_v<M>, "\"unsafe_set\" is not available\n");
dat[i + n]= x;
}
inline void set(int i, T x) {
get(i);
if constexpr (monoid_v<M>)
for (dat[i+= n]= x; i>>= 1;) update(i);
else dat[i]= x;
}
inline void mul(int i, T x) {
static_assert(monoid_v<M>, "\"mul\" is not available\n");
set(i, M::op(get(i), x));
}
inline T get(int i) {
i+= n;
if constexpr (dual_v<M>)
for (int j= 31 - __builtin_clz(i); j; --j) push(i >> j, 1 << j);
if constexpr (monoid_v<M>) return dat[i];
else return dat[i - n];
}
inline T operator[](int i) { return get(i); }
inline T prod(int l, int r) {
static_assert(monoid_v<M>, "\"prod\" is not available\n");
l+= n, r+= n;
if constexpr (dual_v<M>) {
for (int j= 31 - __builtin_clz(l); ((l >> j) << j) != l; --j) push(l >> j, 1 << j);
for (int j= 31 - __builtin_clz(r); ((r >> j) << j) != r; --j) push(r >> j, 1 << j);
}
T s1= M::ti(), s2= M::ti();
for (; l < r; l>>= 1, r>>= 1) {
if (l & 1) s1= M::op(s1, dat[l++]);
if (r & 1) s2= M::op(dat[--r], s2);
}
return M::op(s1, s2);
}
inline void apply(int l, int r, E x) {
static_assert(dual_v<M>, "\"apply\" is not available\n");
l+= n, r+= n;
for (int j= 31 - __builtin_clz(l); ((l >> j) << j) != l; j--) push(l >> j, 1 << j);
for (int j= 31 - __builtin_clz(r); ((r >> j) << j) != r; j--) push(r >> j, 1 << j);
for (int a= l, b= r, sz= 1; a < b; a>>= 1, b>>= 1, sz<<= 1) {
if (a & 1) prop(a++, x, sz);
if (b & 1) prop(--b, x, sz);
}
if constexpr (monoid_v<M>) {
for (int j= __builtin_ctz(l) + 1; l >> j; ++j) update(l >> j);
for (int j= __builtin_ctz(r) + 1; r >> j; ++j) update(r >> j);
}
}
template <class C> int max_right(int l, const C &check) {
static_assert(monoid_v<M>, "\"max_right\" is not available\n");
assert(check(M::ti()));
if (check(prod(l, n))) return n;
T s= M::ti(), t;
int sz= 1;
for (get(l), l+= n;; s= t, ++l) {
while (!(l & 1) && valid(l >> 1)) l>>= 1, sz<<= 1;
if (!check(t= M::op(s, dat[l]))) {
while (l < n) {
if constexpr (dual_v<M>) push(l, sz);
l<<= 1, sz>>= 1;
if (check(t= M::op(s, dat[l]))) s= t, ++l;
}
return l - n;
}
}
}
template <class C> int min_left(int r, const C &check) {
static_assert(monoid_v<M>, "\"min_left\" is not available\n");
assert(check(M::ti()));
if (check(prod(0, r))) return 0;
T s= M::ti(), t;
int sz= 1;
for (get(--r), r+= n;; s= t, --r) {
while (!valid(r)) r= r << 1 | 1, sz>>= 1;
while ((r & 1) && valid(r >> 1)) r>>= 1, sz<<= 1;
if (!check(t= M::op(dat[r], s))) {
while (r < n) {
if constexpr (dual_v<M>) push(r, sz);
r= r << 1 | 1, sz>>= 1;
if (check(t= M::op(dat[r], s))) s= t, --r;
}
return r + 1 - n;
}
}
}
};
#line 8 "test/aoj/0629.min_left.test.cpp"
using namespace std;
struct M {
using T= long long;
using E= long long;
static T ti() { return 1ll << 60; }
static T op(T l, T r) { return min(l, r); }
static void mp(T &v, E y) { v+= y; }
static void cp(E &x, E y) { x+= y; }
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
int X[Q], D[Q], L[Q];
for (int q= 0; q < Q; ++q) cin >> X[q] >> D[q] >> L[q];
SegmentTree<M> seg1(N + 1, [&](int i) { return i; }), seg2(N + 1, [&](int i) { return i; });
for (int q= Q; q--;) {
if (D[q] == 1) {
int i= seg1.min_left(N + 1, [&](long long x) { return x > X[q]; });
seg2.apply(0, i, -2ll * L[q]);
} else {
int i= seg2.min_left(N + 1, [&](long long x) { return x > X[q]; });
seg1.apply(i, N + 1, 2ll * L[q]);
}
}
for (int i= 1; i <= N; ++i) cout << (seg1[i] - seg2[i]) / 2 << '\n';
return 0;
}
Test cases
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++-13 | 01-01.txt |
AC |
9 ms | 4 MB |
| g++-13 | 01-02.txt |
AC |
7 ms | 3 MB |
| g++-13 | 01-03.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-04.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-05.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-06.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-07.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-08.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-09.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-10.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-11.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-12.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-13.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-14.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-15.txt |
AC |
7 ms | 3 MB |
| g++-13 | 01-16.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-17.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-18.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-19.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-20.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-21.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-22.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-23.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-24.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-25.txt |
AC |
7 ms | 4 MB |
| g++-13 | 01-26.txt |
AC |
7 ms | 3 MB |
| g++-13 | 01-27.txt |
AC |
7 ms | 4 MB |
| g++-13 | 02-01.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-02.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-03.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-04.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-05.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-06.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-07.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-08.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-09.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-10.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-11.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-12.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-13.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-14.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-15.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-16.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-17.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-18.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-19.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-20.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-21.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-22.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-23.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-24.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-25.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-26.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-27.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-28.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-29.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-30.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-31.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-32.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-33.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-34.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-35.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-36.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-37.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-38.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-39.txt |
AC |
8 ms | 4 MB |
| g++-13 | 02-40.txt |
AC |
9 ms | 4 MB |
| g++-13 | 02-41.txt |
AC |
9 ms | 4 MB |
| g++-13 | 02-42.txt |
AC |
9 ms | 4 MB |
| g++-13 | 02-43.txt |
AC |
7 ms | 4 MB |
| g++-13 | 02-44.txt |
AC |
7 ms | 4 MB |
| g++-13 | 02-45.txt |
AC |
7 ms | 4 MB |
| g++-13 | 03-01.txt |
AC |
139 ms | 15 MB |
| g++-13 | 03-02.txt |
AC |
143 ms | 16 MB |
| g++-13 | 03-03.txt |
AC |
137 ms | 16 MB |
| g++-13 | 03-04.txt |
AC |
137 ms | 15 MB |
| g++-13 | 03-05.txt |
AC |
132 ms | 16 MB |
| g++-13 | 03-06.txt |
AC |
129 ms | 15 MB |
| g++-13 | 03-07.txt |
AC |
130 ms | 16 MB |
| g++-13 | 03-08.txt |
AC |
109 ms | 15 MB |
| g++-13 | 03-09.txt |
AC |
98 ms | 15 MB |
| g++-13 | 03-10.txt |
AC |
96 ms | 15 MB |
| g++-13 | 03-11.txt |
AC |
96 ms | 15 MB |
| g++-13 | 03-12.txt |
AC |
95 ms | 16 MB |
| g++-13 | 03-13.txt |
AC |
95 ms | 15 MB |
| g++-13 | 03-14.txt |
AC |
96 ms | 15 MB |
| g++-13 | 03-15.txt |
AC |
98 ms | 15 MB |
| g++-13 | 03-16.txt |
AC |
103 ms | 16 MB |
| g++-13 | 03-17.txt |
AC |
103 ms | 16 MB |
| g++-13 | 03-18.txt |
AC |
103 ms | 15 MB |
| g++-13 | 03-19.txt |
AC |
93 ms | 15 MB |
| g++-13 | 03-20.txt |
AC |
95 ms | 15 MB |
| g++-13 | 03-21.txt |
AC |
112 ms | 15 MB |
| g++-13 | 03-22.txt |
AC |
108 ms | 15 MB |
| g++-13 | 03-23.txt |
AC |
111 ms | 15 MB |
| g++-13 | 03-24.txt |
AC |
106 ms | 15 MB |
| g++-13 | 03-25.txt |
AC |
106 ms | 15 MB |
| g++-13 | 03-26.txt |
AC |
114 ms | 16 MB |
| g++-13 | 03-27.txt |
AC |
116 ms | 15 MB |
| g++-13 | 03-28.txt |
AC |
108 ms | 15 MB |
| g++-13 | 03-29.txt |
AC |
107 ms | 16 MB |
| g++-13 | 03-30.txt |
AC |
114 ms | 15 MB |
| g++-13 | 03-31.txt |
AC |
114 ms | 15 MB |
| g++-13 | 03-32.txt |
AC |
104 ms | 16 MB |
| g++-13 | 03-33.txt |
AC |
103 ms | 15 MB |
| g++-13 | 03-34.txt |
AC |
102 ms | 15 MB |
| g++-13 | 03-35.txt |
AC |
102 ms | 16 MB |
| g++-13 | 03-36.txt |
AC |
113 ms | 15 MB |
| g++-13 | 03-37.txt |
AC |
101 ms | 16 MB |
| g++-13 | 03-38.txt |
AC |
100 ms | 15 MB |
| g++-13 | 03-39.txt |
AC |
108 ms | 15 MB |
| g++-13 | 03-40.txt |
AC |
101 ms | 15 MB |
| g++-13 | 03-41.txt |
AC |
113 ms | 15 MB |
| g++-13 | 03-42.txt |
AC |
107 ms | 15 MB |
| g++-13 | 03-43.txt |
AC |
107 ms | 15 MB |
| g++-13 | 03-44.txt |
AC |
106 ms | 15 MB |
| g++-13 | 03-45.txt |
AC |
131 ms | 15 MB |
| g++-13 | 03-46.txt |
AC |
109 ms | 15 MB |
| g++-13 | 03-47.txt |
AC |
30 ms | 13 MB |
| g++-13 | 03-48.txt |
AC |
35 ms | 13 MB |
| clang++-18 | 01-01.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-02.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-03.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-04.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-05.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-06.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-07.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-08.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-09.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-10.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-11.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-12.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-13.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-14.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-15.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 01-16.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-17.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-18.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-19.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-20.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-21.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-22.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-23.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-24.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-25.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-26.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 01-27.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 02-01.txt |
AC |
9 ms | 4 MB |
| clang++-18 | 02-02.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-03.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-04.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-05.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-06.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-07.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-08.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-09.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-10.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-11.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-12.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-13.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-14.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-15.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-16.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-17.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-18.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-19.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-20.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-21.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-22.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-23.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-24.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-25.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-26.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-27.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-28.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-29.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-30.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-31.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-32.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-33.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-34.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-35.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-36.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-37.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-38.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-39.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-40.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-41.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-42.txt |
AC |
8 ms | 4 MB |
| clang++-18 | 02-43.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 02-44.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 02-45.txt |
AC |
7 ms | 4 MB |
| clang++-18 | 03-01.txt |
AC |
135 ms | 15 MB |
| clang++-18 | 03-02.txt |
AC |
142 ms | 15 MB |
| clang++-18 | 03-03.txt |
AC |
138 ms | 15 MB |
| clang++-18 | 03-04.txt |
AC |
138 ms | 15 MB |
| clang++-18 | 03-05.txt |
AC |
134 ms | 15 MB |
| clang++-18 | 03-06.txt |
AC |
129 ms | 15 MB |
| clang++-18 | 03-07.txt |
AC |
128 ms | 15 MB |
| clang++-18 | 03-08.txt |
AC |
105 ms | 15 MB |
| clang++-18 | 03-09.txt |
AC |
92 ms | 15 MB |
| clang++-18 | 03-10.txt |
AC |
90 ms | 15 MB |
| clang++-18 | 03-11.txt |
AC |
93 ms | 15 MB |
| clang++-18 | 03-12.txt |
AC |
92 ms | 16 MB |
| clang++-18 | 03-13.txt |
AC |
92 ms | 15 MB |
| clang++-18 | 03-14.txt |
AC |
90 ms | 16 MB |
| clang++-18 | 03-15.txt |
AC |
92 ms | 16 MB |
| clang++-18 | 03-16.txt |
AC |
97 ms | 16 MB |
| clang++-18 | 03-17.txt |
AC |
98 ms | 15 MB |
| clang++-18 | 03-18.txt |
AC |
106 ms | 15 MB |
| clang++-18 | 03-19.txt |
AC |
93 ms | 15 MB |
| clang++-18 | 03-20.txt |
AC |
97 ms | 16 MB |
| clang++-18 | 03-21.txt |
AC |
118 ms | 15 MB |
| clang++-18 | 03-22.txt |
AC |
105 ms | 15 MB |
| clang++-18 | 03-23.txt |
AC |
114 ms | 15 MB |
| clang++-18 | 03-24.txt |
AC |
106 ms | 15 MB |
| clang++-18 | 03-25.txt |
AC |
109 ms | 15 MB |
| clang++-18 | 03-26.txt |
AC |
114 ms | 15 MB |
| clang++-18 | 03-27.txt |
AC |
114 ms | 15 MB |
| clang++-18 | 03-28.txt |
AC |
111 ms | 15 MB |
| clang++-18 | 03-29.txt |
AC |
104 ms | 15 MB |
| clang++-18 | 03-30.txt |
AC |
112 ms | 16 MB |
| clang++-18 | 03-31.txt |
AC |
109 ms | 16 MB |
| clang++-18 | 03-32.txt |
AC |
105 ms | 15 MB |
| clang++-18 | 03-33.txt |
AC |
97 ms | 15 MB |
| clang++-18 | 03-34.txt |
AC |
99 ms | 15 MB |
| clang++-18 | 03-35.txt |
AC |
98 ms | 15 MB |
| clang++-18 | 03-36.txt |
AC |
111 ms | 15 MB |
| clang++-18 | 03-37.txt |
AC |
104 ms | 15 MB |
| clang++-18 | 03-38.txt |
AC |
99 ms | 15 MB |
| clang++-18 | 03-39.txt |
AC |
108 ms | 15 MB |
| clang++-18 | 03-40.txt |
AC |
102 ms | 15 MB |
| clang++-18 | 03-41.txt |
AC |
111 ms | 16 MB |
| clang++-18 | 03-42.txt |
AC |
109 ms | 15 MB |
| clang++-18 | 03-43.txt |
AC |
108 ms | 15 MB |
| clang++-18 | 03-44.txt |
AC |
105 ms | 15 MB |
| clang++-18 | 03-45.txt |
AC |
112 ms | 15 MB |
| clang++-18 | 03-46.txt |
AC |
110 ms | 15 MB |
| clang++-18 | 03-47.txt |
AC |
27 ms | 13 MB |
| clang++-18 | 03-48.txt |
AC |
23 ms | 13 MB |