oj.uz

답안 #583603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
583603 2022-06-25T18:34:32 Z HIR180 Bulldozer (JOI17_bulldozer) C++17
100 / 100
 1129 ms 102140 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];
P dir[2005][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));
			dir[i][j] = mp(dx, dy);
		}
		else{
			ev.eb(atan2((d)dy*-1, (d)dx*-1), mp(i, j));
			dir[i][j] = mp(-dx, -dy);
		}
	}
	
	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]]);
		}
		bool ok = (_+1 == ev.size());
		if(!ok){
			P p = dir[ev[_].b.a][ev[_].b.b];
			P q = dir[ev[_+1].b.a][ev[_+1].b.b];
			
			if(p.b * q.a != p.a * q.b) ok = true;
			if(p.a * q.a + p.b * q.b < 0) ok = true;
		}
		if(ok){
			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++)
......
  337 |  rep(i, vec.size()){
      |      ~~~~~~~~~~~~~             
bulldozer.cpp:337:2: note: in expansion of macro 'rep'
  337 |  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++)
......
  344 |  rep(_, ev.size()){
      |      ~~~~~~~~~~~~              
bulldozer.cpp:344:2: note: in expansion of macro 'rep'
  344 |  rep(_, ev.size()){
      |  ^~~
bulldozer.cpp:357:18: 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]
  357 |   bool ok = (_+1 == ev.size());
      |              ~~~~^~~~~~~~~~~~
bulldozer.cpp:345:5: warning: unused variable 'deg' [-Wunused-variable]
  345 |   d deg = ev[_].a;
      |     ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 1044 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 3 ms 980 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 3 ms 1092 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 1044 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 3 ms 980 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 3 ms 1092 KB Output is correct
33 Correct 1033 ms 101968 KB Output is correct
34 Correct 1028 ms 101940 KB Output is correct
35 Correct 1008 ms 101932 KB Output is correct
36 Correct 1006 ms 101928 KB Output is correct
37 Correct 1045 ms 102060 KB Output is correct
38 Correct 1060 ms 101980 KB Output is correct
39 Correct 1016 ms 102008 KB Output is correct
40 Correct 1024 ms 101936 KB Output is correct
41 Correct 1086 ms 101932 KB Output is correct
42 Correct 1018 ms 101940 KB Output is correct
43 Correct 1000 ms 101928 KB Output is correct
44 Correct 964 ms 101952 KB Output is correct
45 Correct 955 ms 101992 KB Output is correct
46 Correct 987 ms 102052 KB Output is correct
47 Correct 905 ms 101936 KB Output is correct
48 Correct 998 ms 101928 KB Output is correct
49 Correct 967 ms 101936 KB Output is correct
50 Correct 988 ms 101940 KB Output is correct
51 Correct 955 ms 101928 KB Output is correct
52 Correct 1040 ms 102056 KB Output is correct
53 Correct 1074 ms 102028 KB Output is correct
54 Correct 1004 ms 101936 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 1108 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 1044 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 980 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 980 KB Output is correct
26 Correct 2 ms 980 KB Output is correct
27 Correct 2 ms 980 KB Output is correct
28 Correct 2 ms 980 KB Output is correct
29 Correct 3 ms 980 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 2 ms 1108 KB Output is correct
32 Correct 3 ms 1092 KB Output is correct
33 Correct 1033 ms 101968 KB Output is correct
34 Correct 1028 ms 101940 KB Output is correct
35 Correct 1008 ms 101932 KB Output is correct
36 Correct 1006 ms 101928 KB Output is correct
37 Correct 1045 ms 102060 KB Output is correct
38 Correct 1060 ms 101980 KB Output is correct
39 Correct 1016 ms 102008 KB Output is correct
40 Correct 1024 ms 101936 KB Output is correct
41 Correct 1086 ms 101932 KB Output is correct
42 Correct 1018 ms 101940 KB Output is correct
43 Correct 1000 ms 101928 KB Output is correct
44 Correct 964 ms 101952 KB Output is correct
45 Correct 955 ms 101992 KB Output is correct
46 Correct 987 ms 102052 KB Output is correct
47 Correct 905 ms 101936 KB Output is correct
48 Correct 998 ms 101928 KB Output is correct
49 Correct 967 ms 101936 KB Output is correct
50 Correct 988 ms 101940 KB Output is correct
51 Correct 955 ms 101928 KB Output is correct
52 Correct 1040 ms 102056 KB Output is correct
53 Correct 1074 ms 102028 KB Output is correct
54 Correct 1004 ms 101936 KB Output is correct
55 Correct 1049 ms 102028 KB Output is correct
56 Correct 1046 ms 101932 KB Output is correct
57 Correct 987 ms 101928 KB Output is correct
58 Correct 1038 ms 101936 KB Output is correct
59 Correct 1020 ms 101932 KB Output is correct
60 Correct 977 ms 101880 KB Output is correct
61 Correct 1043 ms 102076 KB Output is correct
62 Correct 995 ms 101932 KB Output is correct
63 Correct 998 ms 101936 KB Output is correct
64 Correct 970 ms 101932 KB Output is correct
65 Correct 1026 ms 101996 KB Output is correct
66 Correct 1008 ms 101928 KB Output is correct
67 Correct 1032 ms 101932 KB Output is correct
68 Correct 1041 ms 101988 KB Output is correct
69 Correct 1010 ms 102036 KB Output is correct
70 Correct 966 ms 101952 KB Output is correct
71 Correct 998 ms 101944 KB Output is correct
72 Correct 985 ms 101992 KB Output is correct
73 Correct 994 ms 101944 KB Output is correct
74 Correct 989 ms 101976 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 2 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 296 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 2 ms 980 KB Output is correct
19 Correct 2 ms 980 KB Output is correct
20 Correct 2 ms 1108 KB Output is correct
21 Correct 3 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 2 ms 1044 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 1108 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 2 ms 980 KB Output is correct
37 Correct 2 ms 1108 KB Output is correct
38 Correct 2 ms 980 KB Output is correct
39 Correct 2 ms 1108 KB Output is correct
40 Correct 2 ms 980 KB Output is correct
41 Correct 2 ms 980 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 2 ms 980 KB Output is correct
44 Correct 3 ms 980 KB Output is correct
45 Correct 2 ms 1108 KB Output is correct
46 Correct 2 ms 1108 KB Output is correct
47 Correct 3 ms 1092 KB Output is correct
48 Correct 1033 ms 101968 KB Output is correct
49 Correct 1028 ms 101940 KB Output is correct
50 Correct 1008 ms 101932 KB Output is correct
51 Correct 1006 ms 101928 KB Output is correct
52 Correct 1045 ms 102060 KB Output is correct
53 Correct 1060 ms 101980 KB Output is correct
54 Correct 1016 ms 102008 KB Output is correct
55 Correct 1024 ms 101936 KB Output is correct
56 Correct 1086 ms 101932 KB Output is correct
57 Correct 1018 ms 101940 KB Output is correct
58 Correct 1000 ms 101928 KB Output is correct
59 Correct 964 ms 101952 KB Output is correct
60 Correct 955 ms 101992 KB Output is correct
61 Correct 987 ms 102052 KB Output is correct
62 Correct 905 ms 101936 KB Output is correct
63 Correct 998 ms 101928 KB Output is correct
64 Correct 967 ms 101936 KB Output is correct
65 Correct 988 ms 101940 KB Output is correct
66 Correct 955 ms 101928 KB Output is correct
67 Correct 1040 ms 102056 KB Output is correct
68 Correct 1074 ms 102028 KB Output is correct
69 Correct 1004 ms 101936 KB Output is correct
70 Correct 1049 ms 102028 KB Output is correct
71 Correct 1046 ms 101932 KB Output is correct
72 Correct 987 ms 101928 KB Output is correct
73 Correct 1038 ms 101936 KB Output is correct
74 Correct 1020 ms 101932 KB Output is correct
75 Correct 977 ms 101880 KB Output is correct
76 Correct 1043 ms 102076 KB Output is correct
77 Correct 995 ms 101932 KB Output is correct
78 Correct 998 ms 101936 KB Output is correct
79 Correct 970 ms 101932 KB Output is correct
80 Correct 1026 ms 101996 KB Output is correct
81 Correct 1008 ms 101928 KB Output is correct
82 Correct 1032 ms 101932 KB Output is correct
83 Correct 1041 ms 101988 KB Output is correct
84 Correct 1010 ms 102036 KB Output is correct
85 Correct 966 ms 101952 KB Output is correct
86 Correct 998 ms 101944 KB Output is correct
87 Correct 985 ms 101992 KB Output is correct
88 Correct 994 ms 101944 KB Output is correct
89 Correct 989 ms 101976 KB Output is correct
90 Correct 1040 ms 101932 KB Output is correct
91 Correct 1022 ms 101932 KB Output is correct
92 Correct 1077 ms 101928 KB Output is correct
93 Correct 1129 ms 102016 KB Output is correct
94 Correct 1088 ms 101960 KB Output is correct
95 Correct 1074 ms 101932 KB Output is correct
96 Correct 1029 ms 101932 KB Output is correct
97 Correct 974 ms 101932 KB Output is correct
98 Correct 1029 ms 101932 KB Output is correct
99 Correct 1044 ms 101928 KB Output is correct
100 Correct 784 ms 101936 KB Output is correct
101 Correct 801 ms 102044 KB Output is correct
102 Correct 757 ms 102040 KB Output is correct
103 Correct 819 ms 102012 KB Output is correct
104 Correct 795 ms 101980 KB Output is correct
105 Correct 809 ms 102032 KB Output is correct
106 Correct 860 ms 102048 KB Output is correct
107 Correct 830 ms 101980 KB Output is correct
108 Correct 853 ms 101980 KB Output is correct
109 Correct 887 ms 101984 KB Output is correct
110 Correct 933 ms 101972 KB Output is correct
111 Correct 895 ms 102024 KB Output is correct
112 Correct 934 ms 102096 KB Output is correct
113 Correct 925 ms 101964 KB Output is correct
114 Correct 895 ms 102012 KB Output is correct
115 Correct 932 ms 101980 KB Output is correct
116 Correct 924 ms 102124 KB Output is correct
117 Correct 989 ms 101972 KB Output is correct
118 Correct 978 ms 102072 KB Output is correct
119 Correct 1012 ms 101984 KB Output is correct
120 Correct 1 ms 340 KB Output is correct
121 Correct 2 ms 340 KB Output is correct
122 Correct 1097 ms 102004 KB Output is correct
123 Correct 929 ms 102020 KB Output is correct
124 Correct 942 ms 102088 KB Output is correct
125 Correct 954 ms 102140 KB Output is correct
126 Correct 998 ms 102064 KB Output is correct
127 Correct 1056 ms 102096 KB Output is correct
128 Correct 983 ms 102008 KB Output is correct
129 Correct 1039 ms 101936 KB Output is correct
130 Correct 938 ms 102056 KB Output is correct
131 Correct 973 ms 102056 KB Output is correct
132 Correct 947 ms 102008 KB Output is correct
133 Correct 990 ms 102052 KB Output is correct