oj.uz

Submission #583599

# Submission time Handle Problem Language Result Execution time Memory
583599 2022-06-25T18:25:59 Z HIR180 Bulldozer (JOI17_bulldozer) C++17
80 / 100
 901 ms 66292 KB 
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#include <algorithm>

#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder

#include <cassert>
#include <vector>

namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using namespace std;
using namespace atcoder;
#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
//#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define pcnt(x) __builtin_popcountll(x)

#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
 
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
 
template<class t> using vc=vector<t>;
 
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
ll F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;
	R[_sz-1] = modpow(F[_sz-1], mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;
}
ll C(int a,int b){
	if(b < 0 || a < b) return 0;
	return F[a]*R[b]%mod*R[a-b]%mod;
}
//o(ans?"Yes":"No");
//internal, prefix, suffix, sum
using S = array<int, 4>;
S op(S a, S b){
	S c{};
	c[3] = a[3] + b[3];
	c[2] = max(b[2], a[2]+b[3]);
	c[1] = max(a[1], a[3]+b[1]);
	c[0] = max(max(a[0], b[0]), a[2]+b[1]);
	return c;
}
S e(){
	return S{(int)-1e18, (int)-1e18, (int)-1e18, 0};
}
int n, x[2005], y[2005], c[2005];
void solve(){
	cin >> n;
	vc<P1>vec(n);
	rep(i, n) cin >> vec[i].b.a >> vec[i].b.b >> vec[i].a;
	
	sort(all(vec), [](P1 a, P1 b){
		return mp(a.b.b, a.b.a) < mp(b.b.b, b.b.a);
	});
	
	using d = long double;
	vc<pair<d,P>>ev;
	
	rep(i, n) for(int j=i+1;j<n;j++){
		auto p1 = vec[i].b;
		auto p2 = vec[j].b;
		if(p1 > p2) swap(p1, p2);
		int dx = p2.a - p1.a;
		int dy = p2.b - p1.b;
		
		if(p1.b <= p2.b){
			ev.eb(atan2((d)dy, (d)dx), mp(i, j));
		}
		else{
			ev.eb(atan2((d)dy*-1, (d)dx*-1), mp(i, j));
		}
	}
	
	SORT(ev);
	
	segtree<S, op, e>seg(n+2);
	rep(i, vec.size()){
		int a = vec[i].a;
		seg.set(i, S{max(0LL,a), max(0LL,a), max(0LL,a), a});
	}
	vc<int>ar(n), rev(n);
	rep(i, n) ar[i] = rev[i] = i;
	int ans = seg.all_prod().at(0);
	rep(_, ev.size()){
		d deg = ev[_].a;
		int u = ev[_].b.a;
		int v = ev[_].b.b;
		
		if(rev[u] < rev[v]){
			//swap
			seg.set(rev[u], S{max(0LL, vec[v].a), max(0LL, vec[v].a), max(0LL, vec[v].a), vec[v].a});
			seg.set(rev[v], S{max(0LL, vec[u].a), max(0LL, vec[u].a), max(0LL, vec[u].a), vec[u].a});
			
			swap(rev[u], rev[v]);
			swap(ar[rev[u]], ar[rev[v]]);
		}
		
		if(_+1 == ev.size() or ev[_].a+1e-12 < ev[_+1].a){
			chmax(ans, seg.all_prod().at(0));
		}
	}
	o(ans);
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	int t; t = 1; //cin >> t;
	while(t--) solve();
}

Compilation message

bulldozer.cpp: In function 'void solve()':
bulldozer.cpp:194:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, std::pair<long long int, long long int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 | #define rep(i,x) for(int i=0;i<x;i++)
......
  334 |  rep(i, vec.size()){
      |      ~~~~~~~~~~~~~             
bulldozer.cpp:334:2: note: in expansion of macro 'rep'
  334 |  rep(i, vec.size()){
      |  ^~~
bulldozer.cpp:194:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long double, std::pair<long long int, long long int> >, std::allocator<std::pair<long double, std::pair<long long int, long long int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  194 | #define rep(i,x) for(int i=0;i<x;i++)
......
  341 |  rep(_, ev.size()){
      |      ~~~~~~~~~~~~              
bulldozer.cpp:341:2: note: in expansion of macro 'rep'
  341 |  rep(_, ev.size()){
      |  ^~~
bulldozer.cpp:355:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long double, std::pair<long long int, long long int> >, std::allocator<std::pair<long double, std::pair<long long int, long long int> > > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  355 |   if(_+1 == ev.size() or ev[_].a+1e-12 < ev[_+1].a){
      |      ~~~~^~~~~~~~~~~~
bulldozer.cpp:342:5: warning: unused variable 'deg' [-Wunused-variable]
  342 |   d deg = ev[_].a;
      |     ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 2 ms 712 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 712 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 708 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 712 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 2 ms 712 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 712 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 708 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 712 KB Output is correct
33 Correct 839 ms 66128 KB Output is correct
34 Correct 825 ms 66200 KB Output is correct
35 Correct 866 ms 66160 KB Output is correct
36 Correct 901 ms 66260 KB Output is correct
37 Correct 834 ms 66220 KB Output is correct
38 Correct 817 ms 66148 KB Output is correct
39 Correct 790 ms 66164 KB Output is correct
40 Correct 809 ms 66116 KB Output is correct
41 Correct 786 ms 66156 KB Output is correct
42 Correct 772 ms 66184 KB Output is correct
43 Correct 804 ms 66176 KB Output is correct
44 Correct 793 ms 66224 KB Output is correct
45 Correct 780 ms 66244 KB Output is correct
46 Correct 773 ms 66156 KB Output is correct
47 Correct 809 ms 66156 KB Output is correct
48 Correct 776 ms 66244 KB Output is correct
49 Correct 790 ms 66152 KB Output is correct
50 Correct 783 ms 66156 KB Output is correct
51 Correct 766 ms 66156 KB Output is correct
52 Correct 814 ms 66156 KB Output is correct
53 Correct 798 ms 66148 KB Output is correct
54 Correct 815 ms 66268 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 2 ms 712 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 712 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 2 ms 712 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 2 ms 724 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 2 ms 708 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 2 ms 712 KB Output is correct
33 Correct 839 ms 66128 KB Output is correct
34 Correct 825 ms 66200 KB Output is correct
35 Correct 866 ms 66160 KB Output is correct
36 Correct 901 ms 66260 KB Output is correct
37 Correct 834 ms 66220 KB Output is correct
38 Correct 817 ms 66148 KB Output is correct
39 Correct 790 ms 66164 KB Output is correct
40 Correct 809 ms 66116 KB Output is correct
41 Correct 786 ms 66156 KB Output is correct
42 Correct 772 ms 66184 KB Output is correct
43 Correct 804 ms 66176 KB Output is correct
44 Correct 793 ms 66224 KB Output is correct
45 Correct 780 ms 66244 KB Output is correct
46 Correct 773 ms 66156 KB Output is correct
47 Correct 809 ms 66156 KB Output is correct
48 Correct 776 ms 66244 KB Output is correct
49 Correct 790 ms 66152 KB Output is correct
50 Correct 783 ms 66156 KB Output is correct
51 Correct 766 ms 66156 KB Output is correct
52 Correct 814 ms 66156 KB Output is correct
53 Correct 798 ms 66148 KB Output is correct
54 Correct 815 ms 66268 KB Output is correct
55 Correct 840 ms 66200 KB Output is correct
56 Correct 796 ms 66228 KB Output is correct
57 Correct 800 ms 66104 KB Output is correct
58 Correct 822 ms 66208 KB Output is correct
59 Correct 807 ms 66156 KB Output is correct
60 Correct 793 ms 66148 KB Output is correct
61 Correct 820 ms 66240 KB Output is correct
62 Correct 841 ms 66144 KB Output is correct
63 Correct 828 ms 66156 KB Output is correct
64 Correct 810 ms 66124 KB Output is correct
65 Correct 824 ms 66292 KB Output is correct
66 Correct 800 ms 66156 KB Output is correct
67 Correct 827 ms 66156 KB Output is correct
68 Correct 784 ms 66184 KB Output is correct
69 Correct 801 ms 66196 KB Output is correct
70 Correct 798 ms 66200 KB Output is correct
71 Correct 807 ms 66152 KB Output is correct
72 Correct 828 ms 66208 KB Output is correct
73 Correct 791 ms 66156 KB Output is correct
74 Correct 837 ms 66216 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 2 ms 712 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 2 ms 724 KB Output is correct
22 Correct 2 ms 724 KB Output is correct
23 Correct 3 ms 712 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 2 ms 724 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 724 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 2 ms 712 KB Output is correct
42 Correct 2 ms 724 KB Output is correct
43 Correct 2 ms 724 KB Output is correct
44 Correct 2 ms 724 KB Output is correct
45 Correct 2 ms 708 KB Output is correct
46 Correct 2 ms 724 KB Output is correct
47 Correct 2 ms 712 KB Output is correct
48 Correct 839 ms 66128 KB Output is correct
49 Correct 825 ms 66200 KB Output is correct
50 Correct 866 ms 66160 KB Output is correct
51 Correct 901 ms 66260 KB Output is correct
52 Correct 834 ms 66220 KB Output is correct
53 Correct 817 ms 66148 KB Output is correct
54 Correct 790 ms 66164 KB Output is correct
55 Correct 809 ms 66116 KB Output is correct
56 Correct 786 ms 66156 KB Output is correct
57 Correct 772 ms 66184 KB Output is correct
58 Correct 804 ms 66176 KB Output is correct
59 Correct 793 ms 66224 KB Output is correct
60 Correct 780 ms 66244 KB Output is correct
61 Correct 773 ms 66156 KB Output is correct
62 Correct 809 ms 66156 KB Output is correct
63 Correct 776 ms 66244 KB Output is correct
64 Correct 790 ms 66152 KB Output is correct
65 Correct 783 ms 66156 KB Output is correct
66 Correct 766 ms 66156 KB Output is correct
67 Correct 814 ms 66156 KB Output is correct
68 Correct 798 ms 66148 KB Output is correct
69 Correct 815 ms 66268 KB Output is correct
70 Correct 840 ms 66200 KB Output is correct
71 Correct 796 ms 66228 KB Output is correct
72 Correct 800 ms 66104 KB Output is correct
73 Correct 822 ms 66208 KB Output is correct
74 Correct 807 ms 66156 KB Output is correct
75 Correct 793 ms 66148 KB Output is correct
76 Correct 820 ms 66240 KB Output is correct
77 Correct 841 ms 66144 KB Output is correct
78 Correct 828 ms 66156 KB Output is correct
79 Correct 810 ms 66124 KB Output is correct
80 Correct 824 ms 66292 KB Output is correct
81 Correct 800 ms 66156 KB Output is correct
82 Correct 827 ms 66156 KB Output is correct
83 Correct 784 ms 66184 KB Output is correct
84 Correct 801 ms 66196 KB Output is correct
85 Correct 798 ms 66200 KB Output is correct
86 Correct 807 ms 66152 KB Output is correct
87 Correct 828 ms 66208 KB Output is correct
88 Correct 791 ms 66156 KB Output is correct
89 Correct 837 ms 66216 KB Output is correct
90 Correct 821 ms 66160 KB Output is correct
91 Correct 819 ms 66120 KB Output is correct
92 Correct 847 ms 66216 KB Output is correct
93 Correct 872 ms 66212 KB Output is correct
94 Correct 812 ms 66156 KB Output is correct
95 Correct 855 ms 66220 KB Output is correct
96 Correct 837 ms 66176 KB Output is correct
97 Correct 820 ms 66156 KB Output is correct
98 Correct 831 ms 66264 KB Output is correct
99 Correct 811 ms 66196 KB Output is correct
100 Incorrect 726 ms 66108 KB Output isn't correct
101 Halted 0 ms 0 KB -