/*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.o:--...```..---+/`
`/y+o/---....---:+o.
`...````-os+/:---:/+o/--.`
`-/+++++/:. `...` :h+d+oooo+/+-` ...
`/++//:::://++-`....` -.`//````````:` `..`
`o+/::------://o/` `-` -. -` `..`
`---.-o/:./o/::-..``..-ЗАПУСКАЕМ .. .. -` `... ``..``
`....o+:-++/:--.```..-://s. `-` .- -` `-o: .-//::::/:-`
`:s+/:--....-::/+s-` .- `- -` -///:--------:/:`
./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ `+:--........--:/`
.:ooo+++++osso-` `.:-...`/` ./::-------:/:` -` :+--..``````.--:+:...-+:-`
`.-/+++++/+-.-` -. ``:so:/:--.......--:+` `-```````o+/+--..`````..--:o/-..:s+:.
```````:``.. `-` -` `+:--..`````..--/+-.../.`````..-o:--.......---/o. `
`: `:- -. .o:--..`` ``..--:o` `-` `:o+:--------:+o-`
`-`-... .. .o/--...```..--:+/` `-` `oy/so/////++o/.`
-/` `-` `- ``+s/o/:---...---:++. `-` .-../d://///:-.`
`.---..``-..- .-/..`````-oo+/:::::/+o+- `-``-` `-. ````
`:++++/+++++- ..``.-/:` /y-:/++o++/:.`..` ./. `-
-++/::::::://+/..:-``:` .. `-.` ```.``` `..` `..`-` `-
`` -o//:--....-::/++` -.-` `-`.-` `..`..` `-.-
-----ss+:++/:--.```..-://s. /. `:: `-:. ./`
`````/:..+o/::-..``.--:/+s. ..-` `-``-` ..` `-` `-`-`
`-s+/::-----::/+oo---``-` .. .:- ``` .-` .-.- `-`
`:oo+//::://+os/..:`..-/:` :y.-:::::::.`.-` ./-` `-`
`./+oooooooo+/.`- .-:...`.. .//:-------://` `- `..` `:.
``.-::::-.``-/` `-` `- `oo:+:--.......--:/` `- `.:--h.``..```
-.-`.- .- `+:--..`````..--//` `- /s-//::::::::.
-` `/- .. .o:--..`` ``..--:o.```.- `//:--------://`
-` .-`.-` -.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`
..`-. `-. ``:os:o/:---...---:++. `- ``///+:-..``````.--:+-````-.`
`.:///////.-` .:-..` -``-+o+/:::::/+o/. `- `:+:-..`````..--:o/:--/ys+-
`-++///////+o/. ``....`-. :` `.:++++++/:.` .- -o/---......---/o. `.`
`++//:-----::/+o:..` .-` : ``````` .- `+so+:--------:++-`
`````:-``:o/::-..`..--:/+o` -. `- .- `../../+o+////+o+:.`
-----syo/o+/:--.```..-://s. .-` `- .- `... ``-:////:-``
.` `/s//:--....-::/+s. -. `-` .- `..`
.+o+/:::--:://+s/-..` .::+y ``` .- `..`
./oo++////+oso-` `.... :y-+:::::::/` ...
`.:+oooooo/-` `....-. .//:-------:/:-.`
``...`` /+:+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.+/--...```..--:+/`
`-o/:---...---:++.
`-+o+/:---:/+o/.
`.:+oooo+/-.`
``````
*/
#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif
#define hur(f, g) template<class c> int f(c a) {if (sizeof(c) == 8) return g##ll(a); else return g(a);}
hur(popc, __builtin_popcount) hur(ctz, __builtin_ctz) hur(clz, __builtin_clz)
/*
- place bitset modifications here
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>
#include <chrono>
#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define le(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)
#define apply(v, act) for (auto &x : v) { act; }
#define log(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}
inline int min(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^x; }
inline int max(const int &x, const int &y) { return (((y-x)>>(32-1))&(x^y))^y; }
inline long long min(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^x; }
inline long long max(const long long &x, const long long &y) { return (((y-x)>>(64-1))&(x^y))^y; }
#define print \
smart_io::precall_print(); \
cout,
#define scan cin,
#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
scanf("%c", &x);
if (x == '\n') {
fast_scan(x);
}
}
void fast_scan(string &x) {
scanf("%s", string_in_buffer);
x = string(string_in_buffer);
}
template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
fast_scan(p.first);
fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
for (auto &x : v) fast_scan(x);
}
void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const char &x) { printf("%c", x); };
// void fast_print(__int128 x) {
// if (x == 0) { fast_print('0'); return; }
// if (x < 0) {
// fast_print('-');
// x = -x;
// }
// __int128 p = 1;
// while (x / (p * 10)) p *= 10;
// while (p) {
// __int128 symb = x / p;
// fast_print((int)symb);
// x -= p * symb;
// p /= 10;
// }
// };
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }
template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
fast_print(p.first);
fast_print(' ');
fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print(' ');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print('\n');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const T &v) {
for (const auto &x : v) {
fast_print(x);
fast_print(' ');
}
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
fast_print(print_start);
print_start = "\n";
first_print = true;
}
void _print(deque<string>) {}
template<class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
if (!first_print) {
fast_print("\n");
} else {
first_print = false;
}
fast_print(names.front());
fast_print(" = ");
fast_print(elem);
names.pop_front();
_print(names, args...);
}
} //namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
if (!smart_io::first_print) {
fast_print(smart_io::sep);
} else {
smart_io::first_print = false;
}
fast_print(object);
return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
fast_scan(object);
return is;
}
namespace random {
using namespace std::chrono;
mt19937 rng(duration_cast< milliseconds >(
system_clock::now().time_since_epoch()
).count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};
namespace typedefs {
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long double ld;
}
namespace numbers_operation {
template<class T>
inline T floor_mod(T a, const T &b) {
a %= b;
if (a < 0) a += b;
return a;
}
}
using namespace numbers_operation;
using namespace typedefs;
using namespace random;
struct Node {
Node *l = NULL, *r = NULL;
int prior; int size = 0;
ll val = 0; ll mod = 0;
Node() {
prior = rng();
size = 1;
}
};
int get_size(Node *node) {
return node ? node->size : 0;
}
void update(Node *node) {
if (!node) return;
node->size = get_size(node->l) + get_size(node->r) + 1;
}
void push(Node *node) {
if (!node) return;
if (node->mod) {
node->val += node->mod;
if (node->l) node->l->mod += node->mod;
if (node->r) node->r->mod += node->mod;
node->mod = 0;
}
}
struct Elem {
Elem *l = NULL, *r = NULL;
int prior; int x; int y;
ll cost;
int min_y;
Elem(int _x, int _y, ll _cost) {
x = _x, y = _y, cost = _cost;
min_y = y;
prior = rng();
}
};
int get_min_y(Elem *e) {
if (!e) return 1e9;
return e->min_y;
}
void push(Elem *elem) {}
void update(Elem *elem) {
if (!elem) return;
elem->min_y = min({elem->y, get_min_y(elem->l), get_min_y(elem->r)});
}
template<class Node>
Node *merge(Node *l, Node *r) {
if (!l) return r;
if (!r) return l;
if (l->prior > r->prior) {
push(l);
l->r = merge(l->r, r);
update(l);
return l;
} else {
push(r);
r->l = merge(l, r->l);
update(r);
return r;
}
}
ll get_val(Node *node, int i) {
// random access
assert(node);
push(node);
if (i < get_size(node->l)) {
return get_val(node->l, i);
} else if (i == get_size(node->l)) {
return node->val;
} else {
return get_val(node->r, i - get_size(node->l) - 1);
}
}
void add_val(Node *node, int i, ll D) {
// random access
assert(node);
push(node);
if (i < get_size(node->l)) {
add_val(node->l, i, D);
} else if (i == get_size(node->l)) {
node->val += D;
} else {
add_val(node->r, i - get_size(node->l) - 1, D);
}
}
pair<Elem*, Elem*> split(Elem *elem, int key) {
// splits <= key, > key
if (!elem) return mp(elem, elem);
if (elem->x <= key) {
auto t = split(elem->r, key);
elem->r = t.x;
update(elem);
return mp(elem, t.y);
} else {
auto t = split(elem->l, key);
elem->l = t.y;
update(elem);
return mp(t.x, elem);
}
}
int n;
vector<int> h;
Elem *extract_min(Elem *elem) {
if (elem->y <= get_min_y(elem->l)
&& elem->y <= get_min_y(elem->r)) {
assert(elem->y != 1e9);
elem->y = 1e9;
update(elem);
return elem;
}
if (get_min_y(elem->l) < get_min_y(elem->r)) {
auto t = extract_min(elem->l);
update(elem);
return t;
} else {
auto t = extract_min(elem->r);
update(elem);
return t;
}
}
Node *dp(int l, int r, int bord, Elem *stars) {
if (l == r) return new Node();
int low = *min_element(h.begin() + l, h.begin() + r);
vector<int> pos{l - 1};
for (int j = l; j < r; j++)
if (h[j] == low) pos.pb(j);
pos.pb(r); // positions of minimums
// vector<ll> cur(r - l + 1);
vector<pair<int, ll>> inter;
while (get_min_y(stars) < low) {
Elem *e = extract_min(stars);
// print l, r, e->y, low; fflush(stdout);
assert(l <= e->x && e->x < r);
inter.emplace_back(e->x, e->cost);
}
Node *cur = NULL;
ll all = 0;
for (int j = 0; j < le(pos) - 1; j++) {
int sl = pos[j] + 1, sr = pos[j + 1];
auto tt = split(stars, sr - 1);
Node *sub = dp(sl, sr, low, split(tt.x, sl - 1).y);
stars = tt.y;
ll val = get_val(sub, get_size(sub) - 1);
all += val;
// add_val(sub, get_size(sub) - 1, -val);
if (sub) sub->mod -= val;
cur = merge(cur, sub);
// for (int t = 0; t < sr - sl; t++) {
// cur[sl + t - l] += sub[t] - sub.back();
// }
}
// for (ll &x : cur) x += all;
if (cur) cur->mod += all;
// vector<Star> inter;
// for (Star star : stars) {
// if (l <= star.x && star.x < r
// && star.y >= bord && star.y < low) {
// inter.pb(star);
// }
// }
ll S = 0;
for (auto star : inter)
S += star.y;
if (cur) cur->mod += S;
// apply(cur, x += S);
// print r - l, get_size(cur);
for (auto star : inter) {
// assert(0 <= star.x - l && star.x - l < get_size(cur));
ll pref = get_val(cur, get_size(cur) - 1);
ll alt = get_val(cur, star.x - l) - star.y;
ll ch = min(0LL, alt - pref);
add_val(cur, get_size(cur) - 1, ch);
// cur.back() = min(cur.back(), cur[star.x - l] - star.c);
}
return cur;
}
signed main(signed argc, char *argv[]) {
scan n;
h.resize(n);
scan h;
int U = n;
apply(h, x = U - x + 1);
// print h;
int m;
scan m;
Elem *stars = NULL;
vector<tuple<int, int, ll>> pool;
f(i, m) {
int x, y, c;
scan x, y, c;
x--; y = U - y + 1;
pool.emplace_back(x, y, c);
// print x, y;
// stars.pb({x, y, c});
// at[x].emplace_back(y, c);
// stars = merge(stars,
// new Elem(x, y, c));
}
sort(pool.begin(), pool.end());
for (auto ttt : pool) {
stars = merge(stars,
new Elem(get<0>(ttt), get<1>(ttt), get<2>(ttt))
);
}
// return 0;
// print dp(0, 2, 1);
auto t = dp(0, n, 0, stars);
print get_val(t, get_size(t) - 1);
}
Compilation message
constellation3.cpp: In function 'void fast_scan(int&)':
constellation3.cpp:141:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(int &x) { scanf("%d", &x); }
~~~~~^~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(long long int&)':
constellation3.cpp:142:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(long long &x) { scanf("%lld", &x); }
~~~~~^~~~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(long long unsigned int&)':
constellation3.cpp:143:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
~~~~~^~~~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(double&)':
constellation3.cpp:144:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(double &x) { scanf("%lf", &x); }
~~~~~^~~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(long double&)':
constellation3.cpp:145:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(long double &x) { scanf("%Lf", &x); }
~~~~~^~~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(char&)':
constellation3.cpp:147:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%c", &x);
~~~~~^~~~~~~~~~
constellation3.cpp: In function 'void fast_scan(std::__cxx11::string&)':
constellation3.cpp:153:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", string_in_buffer);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
5 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct |
| 19 |
Correct |
5 ms |
384 KB |
Output is correct |
| 20 |
Correct |
5 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
384 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
5 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct |
| 19 |
Correct |
5 ms |
384 KB |
Output is correct |
| 20 |
Correct |
5 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
384 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
7 ms |
512 KB |
Output is correct |
| 24 |
Correct |
9 ms |
512 KB |
Output is correct |
| 25 |
Correct |
7 ms |
640 KB |
Output is correct |
| 26 |
Correct |
8 ms |
640 KB |
Output is correct |
| 27 |
Correct |
7 ms |
640 KB |
Output is correct |
| 28 |
Correct |
8 ms |
512 KB |
Output is correct |
| 29 |
Correct |
9 ms |
512 KB |
Output is correct |
| 30 |
Correct |
8 ms |
512 KB |
Output is correct |
| 31 |
Correct |
9 ms |
512 KB |
Output is correct |
| 32 |
Correct |
13 ms |
768 KB |
Output is correct |
| 33 |
Correct |
12 ms |
768 KB |
Output is correct |
| 34 |
Correct |
11 ms |
768 KB |
Output is correct |
| 35 |
Correct |
11 ms |
768 KB |
Output is correct |
| 36 |
Correct |
7 ms |
640 KB |
Output is correct |
| 37 |
Correct |
7 ms |
640 KB |
Output is correct |
| 38 |
Correct |
18 ms |
1024 KB |
Output is correct |
| 39 |
Correct |
8 ms |
512 KB |
Output is correct |
| 40 |
Correct |
13 ms |
768 KB |
Output is correct |
| 41 |
Correct |
7 ms |
512 KB |
Output is correct |
| 42 |
Correct |
7 ms |
640 KB |
Output is correct |
| 43 |
Correct |
15 ms |
896 KB |
Output is correct |
| 44 |
Correct |
7 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
Output is correct |
| 2 |
Correct |
5 ms |
384 KB |
Output is correct |
| 3 |
Correct |
5 ms |
384 KB |
Output is correct |
| 4 |
Correct |
5 ms |
384 KB |
Output is correct |
| 5 |
Correct |
5 ms |
376 KB |
Output is correct |
| 6 |
Correct |
5 ms |
384 KB |
Output is correct |
| 7 |
Correct |
5 ms |
384 KB |
Output is correct |
| 8 |
Correct |
5 ms |
384 KB |
Output is correct |
| 9 |
Correct |
5 ms |
384 KB |
Output is correct |
| 10 |
Correct |
5 ms |
384 KB |
Output is correct |
| 11 |
Correct |
5 ms |
384 KB |
Output is correct |
| 12 |
Correct |
5 ms |
384 KB |
Output is correct |
| 13 |
Correct |
5 ms |
384 KB |
Output is correct |
| 14 |
Correct |
5 ms |
384 KB |
Output is correct |
| 15 |
Correct |
5 ms |
384 KB |
Output is correct |
| 16 |
Correct |
5 ms |
384 KB |
Output is correct |
| 17 |
Correct |
5 ms |
384 KB |
Output is correct |
| 18 |
Correct |
5 ms |
384 KB |
Output is correct |
| 19 |
Correct |
5 ms |
384 KB |
Output is correct |
| 20 |
Correct |
5 ms |
384 KB |
Output is correct |
| 21 |
Correct |
5 ms |
384 KB |
Output is correct |
| 22 |
Correct |
5 ms |
384 KB |
Output is correct |
| 23 |
Correct |
7 ms |
512 KB |
Output is correct |
| 24 |
Correct |
9 ms |
512 KB |
Output is correct |
| 25 |
Correct |
7 ms |
640 KB |
Output is correct |
| 26 |
Correct |
8 ms |
640 KB |
Output is correct |
| 27 |
Correct |
7 ms |
640 KB |
Output is correct |
| 28 |
Correct |
8 ms |
512 KB |
Output is correct |
| 29 |
Correct |
9 ms |
512 KB |
Output is correct |
| 30 |
Correct |
8 ms |
512 KB |
Output is correct |
| 31 |
Correct |
9 ms |
512 KB |
Output is correct |
| 32 |
Correct |
13 ms |
768 KB |
Output is correct |
| 33 |
Correct |
12 ms |
768 KB |
Output is correct |
| 34 |
Correct |
11 ms |
768 KB |
Output is correct |
| 35 |
Correct |
11 ms |
768 KB |
Output is correct |
| 36 |
Correct |
7 ms |
640 KB |
Output is correct |
| 37 |
Correct |
7 ms |
640 KB |
Output is correct |
| 38 |
Correct |
18 ms |
1024 KB |
Output is correct |
| 39 |
Correct |
8 ms |
512 KB |
Output is correct |
| 40 |
Correct |
13 ms |
768 KB |
Output is correct |
| 41 |
Correct |
7 ms |
512 KB |
Output is correct |
| 42 |
Correct |
7 ms |
640 KB |
Output is correct |
| 43 |
Correct |
15 ms |
896 KB |
Output is correct |
| 44 |
Correct |
7 ms |
512 KB |
Output is correct |
| 45 |
Correct |
332 ms |
25956 KB |
Output is correct |
| 46 |
Correct |
330 ms |
25316 KB |
Output is correct |
| 47 |
Correct |
335 ms |
25824 KB |
Output is correct |
| 48 |
Correct |
323 ms |
25440 KB |
Output is correct |
| 49 |
Correct |
320 ms |
25312 KB |
Output is correct |
| 50 |
Correct |
324 ms |
25056 KB |
Output is correct |
| 51 |
Correct |
325 ms |
25568 KB |
Output is correct |
| 52 |
Correct |
332 ms |
25968 KB |
Output is correct |
| 53 |
Correct |
323 ms |
25568 KB |
Output is correct |
| 54 |
Execution timed out |
1593 ms |
17376 KB |
Time limit exceeded |
| 55 |
Halted |
0 ms |
0 KB |
- |
