oj.uz

Submission #952932

# Submission time Handle Problem Language Result Execution time Memory
952932 2024-03-25T05:22:32 Z resting The short shank; Redemption (BOI21_prison) C++17
80 / 100
 2000 ms 77260 KB 
/*
*       ___
*   _ /    _\_
*  / |    |___|
*  | |       |
*  \_|   __  |
*     \_/  \_/
*   uwu amogus
*/
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 #include <immintrin.h>
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define die(...)      \
  do {                \
    out(__VA_ARGS__); \
    return;           \
  } while (0)
using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}

#ifdef NyaanDebug
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
template <typename T>
void _cout(const T &c) {
  cerr << c;
}
void _cout(const int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else if (c == -1001001001)
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else
    cerr << c;
}
void _cout(const long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else if (c == -1001001001 || c == -((1LL << 61) - 1))
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else
    cerr << c;
}
template <typename T, typename U>
void _cout(const pair<T, U> &p) {
  cerr << "{ ";
  _cout(p.fi);
  cerr << ", ";
  _cout(p.se);
  cerr << " } ";
}
template <typename T>
void _cout(const vector<T> &v) {
  int s = v.size();
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } ";
}
template <typename T>
void _cout(const vector<vector<T>> &v) {
  cerr << "[ ";
  for (const auto &x : v) {
    cerr << endl;
    _cout(x);
    cerr << ", ";
  }
  cerr << endl << " ] ";
}
void dbg_out() { cerr << endl; }
template <typename T, class... U>
void dbg_out(const T &t, const U &... u) {
  _cout(t);
  if (sizeof...(u)) cerr << ", ";
  dbg_out(u...);
}
template <typename T>
void array_out(const T &v, int s) {
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } " << endl;
}
template <typename T>
void array_out(const T &v, int H, int W) {
  cerr << "[ ";
  for (int i = 0; i < H; i++) {
    cerr << (i ? ", " : "");
    array_out(v[i], W);
  }
  cerr << " ] " << endl;
}
#else
#define trc(...)
#define trca(...)
#define trcc(...)
#endif

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int btw(T a, T x, T b) {
  return a <= x && x < b;
}
template <typename T, typename U>
T ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}
template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
  vector<int> inv(v.size());
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x7FFFFFFF
#define llinf 0x7FFFFFFFFFFFFFFF
#define ff first
#define ss second
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a - 1; i >= b; i--)
//#define assert void
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
//#define int ll
struct dsu {
	dsu(int n) {
		p.resize(n, -1);
		pp.resize(n); for (int i = 0; i < n; i++) pp[i] = i;
		r.resize(n, 0);
	}
	inline int par(int x) {
		return pp[_par(x)];
	}
	inline int _par(int x) {
		return p[x] == -1 ? x : p[x] = _par(p[x]);
	}
	inline void merge(int a, int b) {
		a = _par(a); b = _par(b);
		if (a == b)return;
		if (r[a] < r[b]) {
			swap(a, b);
			swap(pp[a], pp[b]);
		}
		if (r[a] == r[b]) r[a]++;
		p[b] = a;
	}
	vector<int> p, r, pp;
};
 
signed main() {
  ios_base::sync_with_stdio(false); cin.tie(NULL);
	int N, D, T; cin >> N >> D >> T;
	vector<int> t(N); for (auto& x : t) cin >> x;
	int l = 0, r = 2e6, m = 0;
	int ans = 0;
	while (l < r) {//aliens HAHAHAhaha ha ha :sob:
		m = (l + r) / 2;
		vector<pair<int,int>> st; st.reserve(N);
		struct node {
			int p = -1;//prev
			int n = -1;//next
			int lz = 0;
			int v = 0;
			int c = 0; // count owo!!!
			node() {};
			node(int v, int c) : v(v), c(c) {};
		};
		vector<node> st2; st2.reserve(N);
		dsu pls(N);
		int start = 0; 
		int amt = 0;//amount added
		function<void(int)> kill = [&](int i) {
			int n = st2[i].n;
			//assert(n != -1); 
			if (n == -1) return;
			if ((st2[i].v + (int)st2[i].lz > st2[n].v)) {
				int p = st2[i].p;
				st2[n].p = p;
				if (p != -1) {
					st2[p].lz += st2[i].lz;
					st2[p].n = n;
					pls.merge(p, i); //merge i to p
					kill(p);
				}
				else {
					// DEAD
					amt -= st2[i].lz; //recycle owo
					start = n;
				}
			}
		};
		for (int i = 0; i < N; i++) {
			//create and then upd
			if (st2.size()) {
				st2.push_back(node(st2[start].v + (int)amt + m, st2[start].c+1));
				st2[i - 1].n = i; st2[i].p = i - 1;
				kill(i - 1);
			}
			else {
				st2.push_back(node());
			}
 
			int o = i;
			if (t[i] <= T) {
				while (st.size() && st.back().ff >= t[i] - i) {
					st.pop_back();
				}
				st.push_back({ t[i] - i, i});
			}
			else {
				while (st.size() && st.back().ff > T - i) st.pop_back();
				if (st.size()) {
					o = st.back().ss;
				}
				else o = -1;
			}
			//cout << o << ",";
			if(o >= start){
				int t = pls.par(o);
				st2[t].lz++; amt++;
				kill(t);
			}
			//cout << amt << ",";
		}
		//cout << endl;
		int c = st2[start].c;
		//cout << c << endl;
		if (c <= D) {
			r = m;
			ans = round((int)st2[start].v + (int)amt - (int)D * m);
		}
		else {
			//cout << "fuck" << endl;
			l = m + 1;
		}
	}
	cout << ans << endl;
	// n log n inverse ackermann n please pass i swear to god
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 621 ms 18080 KB Output is correct
3 Correct 575 ms 18244 KB Output is correct
4 Correct 577 ms 22844 KB Output is correct
5 Correct 538 ms 18076 KB Output is correct
6 Correct 439 ms 29028 KB Output is correct
7 Correct 633 ms 77232 KB Output is correct
8 Correct 467 ms 18996 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 2 ms 356 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 5 ms 596 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 4 ms 604 KB Output is correct
26 Correct 6 ms 600 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 5 ms 612 KB Output is correct
29 Correct 4 ms 356 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 4 ms 624 KB Output is correct
32 Correct 3 ms 612 KB Output is correct
33 Correct 3 ms 612 KB Output is correct
34 Correct 5 ms 608 KB Output is correct
35 Correct 4 ms 608 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 86 ms 3084 KB Output is correct
3 Correct 92 ms 3116 KB Output is correct
4 Correct 82 ms 3192 KB Output is correct
5 Correct 58 ms 6228 KB Output is correct
6 Correct 62 ms 5480 KB Output is correct
7 Correct 67 ms 5364 KB Output is correct
8 Correct 75 ms 6736 KB Output is correct
9 Correct 77 ms 12276 KB Output is correct
10 Correct 61 ms 3244 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 352 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 2 ms 356 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 356 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 5 ms 596 KB Output is correct
24 Correct 6 ms 604 KB Output is correct
25 Correct 4 ms 604 KB Output is correct
26 Correct 6 ms 600 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 5 ms 612 KB Output is correct
29 Correct 4 ms 356 KB Output is correct
30 Correct 3 ms 612 KB Output is correct
31 Correct 4 ms 624 KB Output is correct
32 Correct 3 ms 612 KB Output is correct
33 Correct 3 ms 612 KB Output is correct
34 Correct 5 ms 608 KB Output is correct
35 Correct 4 ms 608 KB Output is correct
36 Correct 1 ms 352 KB Output is correct
37 Correct 86 ms 3084 KB Output is correct
38 Correct 92 ms 3116 KB Output is correct
39 Correct 82 ms 3192 KB Output is correct
40 Correct 58 ms 6228 KB Output is correct
41 Correct 62 ms 5480 KB Output is correct
42 Correct 67 ms 5364 KB Output is correct
43 Correct 75 ms 6736 KB Output is correct
44 Correct 77 ms 12276 KB Output is correct
45 Correct 61 ms 3244 KB Output is correct
46 Correct 0 ms 356 KB Output is correct
47 Correct 1 ms 352 KB Output is correct
48 Correct 1 ms 356 KB Output is correct
49 Correct 1 ms 360 KB Output is correct
50 Correct 1 ms 360 KB Output is correct
51 Correct 1 ms 360 KB Output is correct
52 Correct 1 ms 488 KB Output is correct
53 Correct 1 ms 360 KB Output is correct
54 Correct 1 ms 360 KB Output is correct
55 Correct 1 ms 360 KB Output is correct
56 Correct 1 ms 360 KB Output is correct
57 Correct 5 ms 616 KB Output is correct
58 Correct 4 ms 612 KB Output is correct
59 Correct 4 ms 608 KB Output is correct
60 Correct 5 ms 612 KB Output is correct
61 Correct 6 ms 360 KB Output is correct
62 Correct 5 ms 616 KB Output is correct
63 Correct 4 ms 360 KB Output is correct
64 Correct 3 ms 616 KB Output is correct
65 Correct 3 ms 616 KB Output is correct
66 Correct 3 ms 616 KB Output is correct
67 Correct 3 ms 616 KB Output is correct
68 Correct 4 ms 616 KB Output is correct
69 Correct 4 ms 616 KB Output is correct
70 Correct 0 ms 360 KB Output is correct
71 Correct 94 ms 3152 KB Output is correct
72 Correct 92 ms 3144 KB Output is correct
73 Correct 66 ms 3184 KB Output is correct
74 Correct 68 ms 6188 KB Output is correct
75 Correct 57 ms 5508 KB Output is correct
76 Correct 65 ms 5348 KB Output is correct
77 Correct 82 ms 6748 KB Output is correct
78 Correct 73 ms 12228 KB Output is correct
79 Correct 59 ms 3296 KB Output is correct
80 Correct 98 ms 3112 KB Output is correct
81 Correct 100 ms 3120 KB Output is correct
82 Correct 89 ms 3220 KB Output is correct
83 Correct 81 ms 5104 KB Output is correct
84 Correct 85 ms 3124 KB Output is correct
85 Correct 58 ms 4452 KB Output is correct
86 Correct 71 ms 4276 KB Output is correct
87 Correct 71 ms 3504 KB Output is correct
88 Correct 63 ms 11420 KB Output is correct
89 Correct 81 ms 12000 KB Output is correct
90 Correct 70 ms 9752 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 621 ms 18080 KB Output is correct
14 Correct 575 ms 18244 KB Output is correct
15 Correct 577 ms 22844 KB Output is correct
16 Correct 538 ms 18076 KB Output is correct
17 Correct 439 ms 29028 KB Output is correct
18 Correct 633 ms 77232 KB Output is correct
19 Correct 467 ms 18996 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 352 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 2 ms 356 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 1 ms 356 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 1 ms 352 KB Output is correct
31 Correct 5 ms 596 KB Output is correct
32 Correct 6 ms 604 KB Output is correct
33 Correct 4 ms 604 KB Output is correct
34 Correct 6 ms 600 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 5 ms 612 KB Output is correct
37 Correct 4 ms 356 KB Output is correct
38 Correct 3 ms 612 KB Output is correct
39 Correct 4 ms 624 KB Output is correct
40 Correct 3 ms 612 KB Output is correct
41 Correct 3 ms 612 KB Output is correct
42 Correct 5 ms 608 KB Output is correct
43 Correct 4 ms 608 KB Output is correct
44 Correct 1 ms 352 KB Output is correct
45 Correct 86 ms 3084 KB Output is correct
46 Correct 92 ms 3116 KB Output is correct
47 Correct 82 ms 3192 KB Output is correct
48 Correct 58 ms 6228 KB Output is correct
49 Correct 62 ms 5480 KB Output is correct
50 Correct 67 ms 5364 KB Output is correct
51 Correct 75 ms 6736 KB Output is correct
52 Correct 77 ms 12276 KB Output is correct
53 Correct 61 ms 3244 KB Output is correct
54 Correct 0 ms 356 KB Output is correct
55 Correct 1 ms 352 KB Output is correct
56 Correct 1 ms 356 KB Output is correct
57 Correct 1 ms 360 KB Output is correct
58 Correct 1 ms 360 KB Output is correct
59 Correct 1 ms 360 KB Output is correct
60 Correct 1 ms 488 KB Output is correct
61 Correct 1 ms 360 KB Output is correct
62 Correct 1 ms 360 KB Output is correct
63 Correct 1 ms 360 KB Output is correct
64 Correct 1 ms 360 KB Output is correct
65 Correct 5 ms 616 KB Output is correct
66 Correct 4 ms 612 KB Output is correct
67 Correct 4 ms 608 KB Output is correct
68 Correct 5 ms 612 KB Output is correct
69 Correct 6 ms 360 KB Output is correct
70 Correct 5 ms 616 KB Output is correct
71 Correct 4 ms 360 KB Output is correct
72 Correct 3 ms 616 KB Output is correct
73 Correct 3 ms 616 KB Output is correct
74 Correct 3 ms 616 KB Output is correct
75 Correct 3 ms 616 KB Output is correct
76 Correct 4 ms 616 KB Output is correct
77 Correct 4 ms 616 KB Output is correct
78 Correct 0 ms 360 KB Output is correct
79 Correct 94 ms 3152 KB Output is correct
80 Correct 92 ms 3144 KB Output is correct
81 Correct 66 ms 3184 KB Output is correct
82 Correct 68 ms 6188 KB Output is correct
83 Correct 57 ms 5508 KB Output is correct
84 Correct 65 ms 5348 KB Output is correct
85 Correct 82 ms 6748 KB Output is correct
86 Correct 73 ms 12228 KB Output is correct
87 Correct 59 ms 3296 KB Output is correct
88 Correct 98 ms 3112 KB Output is correct
89 Correct 100 ms 3120 KB Output is correct
90 Correct 89 ms 3220 KB Output is correct
91 Correct 81 ms 5104 KB Output is correct
92 Correct 85 ms 3124 KB Output is correct
93 Correct 58 ms 4452 KB Output is correct
94 Correct 71 ms 4276 KB Output is correct
95 Correct 71 ms 3504 KB Output is correct
96 Correct 63 ms 11420 KB Output is correct
97 Correct 81 ms 12000 KB Output is correct
98 Correct 70 ms 9752 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 2 ms 472 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 1 ms 344 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 344 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 647 ms 18088 KB Output is correct
112 Correct 575 ms 18076 KB Output is correct
113 Correct 563 ms 22892 KB Output is correct
114 Correct 545 ms 18056 KB Output is correct
115 Correct 462 ms 29244 KB Output is correct
116 Correct 653 ms 77260 KB Output is correct
117 Correct 475 ms 18940 KB Output is correct
118 Correct 4 ms 348 KB Output is correct
119 Correct 5 ms 356 KB Output is correct
120 Correct 6 ms 612 KB Output is correct
121 Correct 4 ms 604 KB Output is correct
122 Correct 4 ms 352 KB Output is correct
123 Correct 4 ms 352 KB Output is correct
124 Correct 6 ms 596 KB Output is correct
125 Correct 3 ms 604 KB Output is correct
126 Correct 4 ms 604 KB Output is correct
127 Correct 3 ms 608 KB Output is correct
128 Correct 4 ms 604 KB Output is correct
129 Correct 5 ms 604 KB Output is correct
130 Correct 6 ms 604 KB Output is correct
131 Correct 0 ms 348 KB Output is correct
132 Correct 84 ms 3120 KB Output is correct
133 Correct 88 ms 3108 KB Output is correct
134 Correct 67 ms 3228 KB Output is correct
135 Correct 60 ms 6148 KB Output is correct
136 Correct 54 ms 5464 KB Output is correct
137 Correct 75 ms 5356 KB Output is correct
138 Correct 82 ms 6780 KB Output is correct
139 Correct 68 ms 12224 KB Output is correct
140 Correct 61 ms 3272 KB Output is correct
141 Correct 91 ms 3112 KB Output is correct
142 Correct 93 ms 3116 KB Output is correct
143 Correct 99 ms 3112 KB Output is correct
144 Correct 82 ms 5076 KB Output is correct
145 Correct 78 ms 3124 KB Output is correct
146 Correct 57 ms 4480 KB Output is correct
147 Correct 70 ms 4300 KB Output is correct
148 Correct 85 ms 3520 KB Output is correct
149 Correct 66 ms 11476 KB Output is correct
150 Correct 70 ms 11996 KB Output is correct
151 Correct 64 ms 9752 KB Output is correct
152 Execution timed out 2053 ms 71128 KB Time limit exceeded
153 Halted 0 ms 0 KB -