oj.uz

답안 #1091767

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1091767 2024-09-22T04:27:50 Z binminh01 Copy and Paste 3 (JOI22_copypaste3) C++17
100 / 100
 216 ms 69824 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#ifdef ONLINE_JUDGE
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#endif

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);
 
const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;
 
ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
 
template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

vi z_function(const string &s) {
    int n = sz(s), l = 0, r = 0;
    vi z(n);
    For(i,1,n){
        if (i < r) z[i] = min(r - i, z[i - l]);
        while (s[z[i]] == s[i + z[i]]) z[i]++;
        if (i + z[i] > r) l = i, r = i + z[i];
    }
    return z;
}
ll f[2505][2505];
int p[2505][2505];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int n; string s; ll a, b, c; cin >> n >> s >> a >> b >> c;
    For(i,0,n){
        vi a = z_function(s.substr(i));
        int k = 0;
        For(j,i+1,n){
            int t = min(j - i, a[j - i]);
            while (k < t) {
                p[i][i + k] = j;
                ++k;
            }
        }
        while (i + k < n) {
            p[i][i + k] = n;
            ++k;
        }
    }
    memset(f, 0x3f, sizeof(f));
    For(i,0,n) f[i][i] = a + b;
    For(d,0,n-1){
        For(i,0,n-d){
            int j = i + d;
            if (i) f[i - 1][j] = min(f[i - 1][j], f[i][j] + a);
            if (j < n - 1) f[i][j + 1] = min(f[i][j + 1], f[i][j] + a);
            int k = p[i][j] + d, t = 2;
            while (k < n) {
                f[i][k] = min(f[i][k], f[i][j] + a*(k - i + 1 - (d + 1)*t) + b + c*t);
                k = p[k - d][k] + d; ++t;
            }
        }
    }
    cout << f[0][n - 1] - b;
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 51288 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct
3 Correct 19 ms 51292 KB Output is correct
4 Correct 19 ms 51256 KB Output is correct
5 Correct 21 ms 51292 KB Output is correct
6 Correct 19 ms 51292 KB Output is correct
7 Correct 19 ms 51292 KB Output is correct
8 Correct 18 ms 51388 KB Output is correct
9 Correct 19 ms 51292 KB Output is correct
10 Correct 18 ms 51228 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 51292 KB Output is correct
2 Correct 19 ms 51292 KB Output is correct
3 Correct 104 ms 63164 KB Output is correct
4 Correct 120 ms 64596 KB Output is correct
5 Correct 144 ms 66164 KB Output is correct
6 Correct 173 ms 67920 KB Output is correct
7 Correct 205 ms 69772 KB Output is correct
8 Correct 209 ms 69724 KB Output is correct
9 Correct 207 ms 69812 KB Output is correct
10 Correct 19 ms 51292 KB Output is correct
11 Correct 19 ms 51288 KB Output is correct
12 Correct 22 ms 51280 KB Output is correct
13 Correct 20 ms 51292 KB Output is correct
14 Correct 22 ms 51344 KB Output is correct
15 Correct 21 ms 51292 KB Output is correct
16 Correct 21 ms 51548 KB Output is correct
17 Correct 20 ms 51164 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 51288 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct
3 Correct 19 ms 51292 KB Output is correct
4 Correct 19 ms 51256 KB Output is correct
5 Correct 21 ms 51292 KB Output is correct
6 Correct 19 ms 51292 KB Output is correct
7 Correct 19 ms 51292 KB Output is correct
8 Correct 18 ms 51388 KB Output is correct
9 Correct 19 ms 51292 KB Output is correct
10 Correct 18 ms 51228 KB Output is correct
11 Correct 22 ms 51292 KB Output is correct
12 Correct 21 ms 51292 KB Output is correct
13 Correct 20 ms 51344 KB Output is correct
14 Correct 19 ms 51292 KB Output is correct
15 Correct 22 ms 51472 KB Output is correct
16 Correct 26 ms 51400 KB Output is correct
17 Correct 26 ms 51292 KB Output is correct
18 Correct 21 ms 51224 KB Output is correct
19 Correct 20 ms 51284 KB Output is correct
20 Correct 21 ms 51292 KB Output is correct
21 Correct 21 ms 51548 KB Output is correct
22 Correct 22 ms 51536 KB Output is correct
23 Correct 23 ms 51548 KB Output is correct
24 Correct 23 ms 53336 KB Output is correct
25 Correct 21 ms 51616 KB Output is correct
26 Correct 21 ms 51548 KB Output is correct
27 Correct 19 ms 51652 KB Output is correct
28 Correct 21 ms 51552 KB Output is correct
29 Correct 21 ms 51536 KB Output is correct
30 Correct 22 ms 51540 KB Output is correct
31 Correct 21 ms 51548 KB Output is correct
32 Correct 21 ms 53444 KB Output is correct
33 Correct 19 ms 51592 KB Output is correct
34 Correct 20 ms 51292 KB Output is correct
35 Correct 20 ms 51292 KB Output is correct
36 Correct 21 ms 51292 KB Output is correct
37 Correct 20 ms 51348 KB Output is correct
38 Correct 20 ms 51292 KB Output is correct
39 Correct 20 ms 51544 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 51288 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct
3 Correct 19 ms 51292 KB Output is correct
4 Correct 19 ms 51256 KB Output is correct
5 Correct 21 ms 51292 KB Output is correct
6 Correct 19 ms 51292 KB Output is correct
7 Correct 19 ms 51292 KB Output is correct
8 Correct 18 ms 51388 KB Output is correct
9 Correct 19 ms 51292 KB Output is correct
10 Correct 18 ms 51228 KB Output is correct
11 Correct 22 ms 51292 KB Output is correct
12 Correct 21 ms 51292 KB Output is correct
13 Correct 20 ms 51344 KB Output is correct
14 Correct 19 ms 51292 KB Output is correct
15 Correct 22 ms 51472 KB Output is correct
16 Correct 26 ms 51400 KB Output is correct
17 Correct 26 ms 51292 KB Output is correct
18 Correct 21 ms 51224 KB Output is correct
19 Correct 20 ms 51284 KB Output is correct
20 Correct 21 ms 51292 KB Output is correct
21 Correct 21 ms 51548 KB Output is correct
22 Correct 22 ms 51536 KB Output is correct
23 Correct 23 ms 51548 KB Output is correct
24 Correct 23 ms 53336 KB Output is correct
25 Correct 21 ms 51616 KB Output is correct
26 Correct 21 ms 51548 KB Output is correct
27 Correct 19 ms 51652 KB Output is correct
28 Correct 21 ms 51552 KB Output is correct
29 Correct 21 ms 51536 KB Output is correct
30 Correct 22 ms 51540 KB Output is correct
31 Correct 21 ms 51548 KB Output is correct
32 Correct 21 ms 53444 KB Output is correct
33 Correct 19 ms 51592 KB Output is correct
34 Correct 20 ms 51292 KB Output is correct
35 Correct 20 ms 51292 KB Output is correct
36 Correct 21 ms 51292 KB Output is correct
37 Correct 20 ms 51348 KB Output is correct
38 Correct 20 ms 51292 KB Output is correct
39 Correct 20 ms 51544 KB Output is correct
40 Correct 21 ms 51552 KB Output is correct
41 Correct 20 ms 51564 KB Output is correct
42 Correct 21 ms 51664 KB Output is correct
43 Correct 20 ms 51744 KB Output is correct
44 Correct 23 ms 51544 KB Output is correct
45 Correct 20 ms 51636 KB Output is correct
46 Correct 19 ms 53532 KB Output is correct
47 Correct 20 ms 51548 KB Output is correct
48 Correct 19 ms 51548 KB Output is correct
49 Correct 20 ms 51544 KB Output is correct
50 Correct 20 ms 51544 KB Output is correct
51 Correct 20 ms 51548 KB Output is correct
52 Correct 19 ms 51540 KB Output is correct
53 Correct 19 ms 51548 KB Output is correct

Subtask #5
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 51288 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct
3 Correct 19 ms 51292 KB Output is correct
4 Correct 19 ms 51256 KB Output is correct
5 Correct 21 ms 51292 KB Output is correct
6 Correct 19 ms 51292 KB Output is correct
7 Correct 19 ms 51292 KB Output is correct
8 Correct 18 ms 51388 KB Output is correct
9 Correct 19 ms 51292 KB Output is correct
10 Correct 18 ms 51228 KB Output is correct
11 Correct 22 ms 51292 KB Output is correct
12 Correct 21 ms 51292 KB Output is correct
13 Correct 20 ms 51344 KB Output is correct
14 Correct 19 ms 51292 KB Output is correct
15 Correct 22 ms 51472 KB Output is correct
16 Correct 26 ms 51400 KB Output is correct
17 Correct 26 ms 51292 KB Output is correct
18 Correct 21 ms 51224 KB Output is correct
19 Correct 20 ms 51284 KB Output is correct
20 Correct 21 ms 51292 KB Output is correct
21 Correct 21 ms 51548 KB Output is correct
22 Correct 22 ms 51536 KB Output is correct
23 Correct 23 ms 51548 KB Output is correct
24 Correct 23 ms 53336 KB Output is correct
25 Correct 21 ms 51616 KB Output is correct
26 Correct 21 ms 51548 KB Output is correct
27 Correct 19 ms 51652 KB Output is correct
28 Correct 21 ms 51552 KB Output is correct
29 Correct 21 ms 51536 KB Output is correct
30 Correct 22 ms 51540 KB Output is correct
31 Correct 21 ms 51548 KB Output is correct
32 Correct 21 ms 53444 KB Output is correct
33 Correct 19 ms 51592 KB Output is correct
34 Correct 20 ms 51292 KB Output is correct
35 Correct 20 ms 51292 KB Output is correct
36 Correct 21 ms 51292 KB Output is correct
37 Correct 20 ms 51348 KB Output is correct
38 Correct 20 ms 51292 KB Output is correct
39 Correct 20 ms 51544 KB Output is correct
40 Correct 21 ms 51552 KB Output is correct
41 Correct 20 ms 51564 KB Output is correct
42 Correct 21 ms 51664 KB Output is correct
43 Correct 20 ms 51744 KB Output is correct
44 Correct 23 ms 51544 KB Output is correct
45 Correct 20 ms 51636 KB Output is correct
46 Correct 19 ms 53532 KB Output is correct
47 Correct 20 ms 51548 KB Output is correct
48 Correct 19 ms 51548 KB Output is correct
49 Correct 20 ms 51544 KB Output is correct
50 Correct 20 ms 51544 KB Output is correct
51 Correct 20 ms 51548 KB Output is correct
52 Correct 19 ms 51540 KB Output is correct
53 Correct 19 ms 51548 KB Output is correct
54 Correct 21 ms 52568 KB Output is correct
55 Correct 40 ms 55900 KB Output is correct
56 Correct 34 ms 55900 KB Output is correct
57 Correct 28 ms 56660 KB Output is correct
58 Correct 27 ms 55900 KB Output is correct
59 Correct 27 ms 55888 KB Output is correct
60 Correct 28 ms 55892 KB Output is correct
61 Correct 30 ms 55896 KB Output is correct
62 Correct 37 ms 55892 KB Output is correct
63 Correct 27 ms 55900 KB Output is correct
64 Correct 34 ms 56156 KB Output is correct
65 Correct 42 ms 55880 KB Output is correct
66 Correct 36 ms 55896 KB Output is correct
67 Correct 26 ms 55896 KB Output is correct

Subtask #6
38.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 51288 KB Output is correct
2 Correct 20 ms 51292 KB Output is correct
3 Correct 19 ms 51292 KB Output is correct
4 Correct 19 ms 51256 KB Output is correct
5 Correct 21 ms 51292 KB Output is correct
6 Correct 19 ms 51292 KB Output is correct
7 Correct 19 ms 51292 KB Output is correct
8 Correct 18 ms 51388 KB Output is correct
9 Correct 19 ms 51292 KB Output is correct
10 Correct 18 ms 51228 KB Output is correct
11 Correct 21 ms 51292 KB Output is correct
12 Correct 19 ms 51292 KB Output is correct
13 Correct 104 ms 63164 KB Output is correct
14 Correct 120 ms 64596 KB Output is correct
15 Correct 144 ms 66164 KB Output is correct
16 Correct 173 ms 67920 KB Output is correct
17 Correct 205 ms 69772 KB Output is correct
18 Correct 209 ms 69724 KB Output is correct
19 Correct 207 ms 69812 KB Output is correct
20 Correct 19 ms 51292 KB Output is correct
21 Correct 19 ms 51288 KB Output is correct
22 Correct 22 ms 51280 KB Output is correct
23 Correct 20 ms 51292 KB Output is correct
24 Correct 22 ms 51344 KB Output is correct
25 Correct 21 ms 51292 KB Output is correct
26 Correct 21 ms 51548 KB Output is correct
27 Correct 20 ms 51164 KB Output is correct
28 Correct 22 ms 51292 KB Output is correct
29 Correct 21 ms 51292 KB Output is correct
30 Correct 20 ms 51344 KB Output is correct
31 Correct 19 ms 51292 KB Output is correct
32 Correct 22 ms 51472 KB Output is correct
33 Correct 26 ms 51400 KB Output is correct
34 Correct 26 ms 51292 KB Output is correct
35 Correct 21 ms 51224 KB Output is correct
36 Correct 20 ms 51284 KB Output is correct
37 Correct 21 ms 51292 KB Output is correct
38 Correct 21 ms 51548 KB Output is correct
39 Correct 22 ms 51536 KB Output is correct
40 Correct 23 ms 51548 KB Output is correct
41 Correct 23 ms 53336 KB Output is correct
42 Correct 21 ms 51616 KB Output is correct
43 Correct 21 ms 51548 KB Output is correct
44 Correct 19 ms 51652 KB Output is correct
45 Correct 21 ms 51552 KB Output is correct
46 Correct 21 ms 51536 KB Output is correct
47 Correct 22 ms 51540 KB Output is correct
48 Correct 21 ms 51548 KB Output is correct
49 Correct 21 ms 53444 KB Output is correct
50 Correct 19 ms 51592 KB Output is correct
51 Correct 20 ms 51292 KB Output is correct
52 Correct 20 ms 51292 KB Output is correct
53 Correct 21 ms 51292 KB Output is correct
54 Correct 20 ms 51348 KB Output is correct
55 Correct 20 ms 51292 KB Output is correct
56 Correct 20 ms 51544 KB Output is correct
57 Correct 21 ms 51552 KB Output is correct
58 Correct 20 ms 51564 KB Output is correct
59 Correct 21 ms 51664 KB Output is correct
60 Correct 20 ms 51744 KB Output is correct
61 Correct 23 ms 51544 KB Output is correct
62 Correct 20 ms 51636 KB Output is correct
63 Correct 19 ms 53532 KB Output is correct
64 Correct 20 ms 51548 KB Output is correct
65 Correct 19 ms 51548 KB Output is correct
66 Correct 20 ms 51544 KB Output is correct
67 Correct 20 ms 51544 KB Output is correct
68 Correct 20 ms 51548 KB Output is correct
69 Correct 19 ms 51540 KB Output is correct
70 Correct 19 ms 51548 KB Output is correct
71 Correct 21 ms 52568 KB Output is correct
72 Correct 40 ms 55900 KB Output is correct
73 Correct 34 ms 55900 KB Output is correct
74 Correct 28 ms 56660 KB Output is correct
75 Correct 27 ms 55900 KB Output is correct
76 Correct 27 ms 55888 KB Output is correct
77 Correct 28 ms 55892 KB Output is correct
78 Correct 30 ms 55896 KB Output is correct
79 Correct 37 ms 55892 KB Output is correct
80 Correct 27 ms 55900 KB Output is correct
81 Correct 34 ms 56156 KB Output is correct
82 Correct 42 ms 55880 KB Output is correct
83 Correct 36 ms 55896 KB Output is correct
84 Correct 26 ms 55896 KB Output is correct
85 Correct 60 ms 60752 KB Output is correct
86 Correct 129 ms 69820 KB Output is correct
87 Correct 102 ms 69716 KB Output is correct
88 Correct 81 ms 69716 KB Output is correct
89 Correct 84 ms 69716 KB Output is correct
90 Correct 76 ms 69824 KB Output is correct
91 Correct 160 ms 69820 KB Output is correct
92 Correct 179 ms 69824 KB Output is correct
93 Correct 80 ms 69716 KB Output is correct
94 Correct 109 ms 69744 KB Output is correct
95 Correct 216 ms 69712 KB Output is correct
96 Correct 215 ms 69712 KB Output is correct
97 Correct 72 ms 69716 KB Output is correct