oj.uz

답안 #1089465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1089465 2024-09-16T14:45:14 Z vjudge1 푸드 코트 (JOI21_foodcourt) C++17
100 / 100
 633 ms 106076 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()
 
const ll N = 3e5 + 100;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll blocks = 350;
int n,m,q;
vector<pll>t[N], ask[N];
int g[N], res[N];
bool add[N], ok[N];
struct segment_tree_min{
    ll n;
    vector<pair<ll,ll>>st;
	vector<ll> lz;
    void init(int _n){
        n = _n;
        st.clear(); st.resize(4 * n + 10);
        lz.clear(); lz.resize(4 * n + 10, 0);
		build(1,1,n);
    }
	void build(int id, int l, int r){
		if(l == r){
			st[id] = {0, l};
			return;
		}
		int mid = (l + r) / 2;
		build(2 * id, l, mid); build(2 * id + 1, mid + 1, r);
		st[id] = min(st[2 * id], st[2 * id + 1]);
	}
    void down(int id, int l, int r){
        st[id].F += lz[id];
        if(l != r) lz[2 * id] += lz[id], lz[2 * id + 1] += lz[id];
        lz[id] = 0;
    }
    void update(int id, int l, int r, int left, int right, ll val){
        down(id, l, r);
        if(l > right || r < left) return;
        if(left <= l && r <= right){
            lz[id] += val;
            down(id, l, r);
            return;
        }
        int mid = (l + r) / 2;
        update(2 * id, l, mid, left, right, val);
        update(2 * id + 1, mid + 1, r, left, right, val);
        st[id] = min(st[2 * id], st[2 * id + 1]);
    }
    pair<ll,ll> get(int id, int l, int r, int left, int right){
        down(id, l, r);
        if(l > right || r < left) return {inf, 0};
        if(left <= l && r <= right) return st[id];
        int mid = (l + r) / 2;
        return min(get(2 * id, l, mid, left, right), get(2 * id + 1, mid + 1, r, left, right));
    }
    void update(ll l, ll r, ll val){update(1,1,n,l,r,val);}
    pll get(ll l, ll r){return get(1,1,n,l,r);}
} stmin;
struct segment_tree_sum{
	ll n;
    vector<ll>st, mx, lz;
    void init(int _n){
        n = _n;
        st.clear(); st.resize(4 * n + 10, 0);
        lz.clear(); lz.resize(4 * n + 10, 0);
		mx.resize(4 * n + 10);
    }
    void down(int id, ll l, ll r){
        st[id] += lz[id] * (r - l + 1);
		mx[id] += lz[id];
        if(l != r) lz[2 * id] += lz[id], lz[2 * id + 1] += lz[id];
        lz[id] = 0;
    }
    void update(int id, int l, int r, int left, int right, ll val){
        down(id, l, r);
        if(l > right || r < left) return;
        if(left <= l && r <= right){
            lz[id] += val;
            down(id, l, r);
            return;
        }
        int mid = (l + r) / 2;
        update(2 * id, l, mid, left, right, val);
        update(2 * id + 1, mid + 1, r, left, right, val);
        st[id] = st[2 * id] + st[2 * id + 1];
		mx[id] = max(mx[2 * id], mx[2 * id + 1]);
    }
    ll get(int id, int l, int r, int left, int right){
        down(id, l, r);
        if(l > right || r < left) return 0;
        if(left <= l && r <= right) return st[id];
        int mid = (l + r) / 2;
        return get(2 * id, l, mid, left, right) + get(2 * id + 1, mid + 1, r, left, right);
    }
	int walk(int id, ll l, int r, int pos, ll val){
		down(id, l, r);
		if(r < pos || mx[id] < val) return -1;
		if(l == r) return l;
		ll mid = (l + r) / 2;
		int res = -1;
		res = walk(2 * id, l, mid, pos, val);
		if(res == -1) res = walk(2 * id + 1, mid + 1, r, pos, val);
		return res;
	}
	int walk(int pos, ll val){return walk(1,1,n,pos,val);}
    void update(int l, int r, ll val){update(1,1,n,l,r,val);}
    ll get(int l, int r){return get(1,1,n,l,r);}
} st1, st2;
void to_thic_cau(){
	cin >> n >> m >> q;
	st1.init(q); st2.init(q); stmin.init(q);
	for(int i = 1; i <= q;i++){
		int typ; cin >> typ;
		if(typ == 1){
			int l,r,c; ll k; cin >> l >> r >> c >> k;
			g[i] = c; add[i] = 1;
			t[l].pb({i, k}); t[r + 1].pb({i, -k});
		}
		else if(typ == 2){
			int l,r; ll k; cin >> l >> r >> k;
			t[l].pb({i, -k}); t[r+1].pb({i, k});
		}
		else{
			ok[i] = 1;
			ll a,b; cin >> a >> b;
			ask[a].pb({b, i});
		}
	}	
	for(int i = 1; i <= n;i++){
		for(auto x : t[i]){
			int j = x.F; ll k = x.S;
			stmin.update(j, q, k);
			if(add[j]) st1.update(j, q, k); 
			else st2.update(j, q, -k);
		}
		for(auto x : ask[i]){
			ll v = x.F, j = x.S;
			pair<ll,int> cur = min(make_pair(0ll,0ll), stmin.get(1, j));
			if(stmin.get(j, j).F < cur.F + v) continue;
			if(m == 1){
				res[j] = 1;
				continue;
			}
			v += st2.get(j, j) + cur.F;
			res[j] = g[st1.walk(cur.S + 1, v)];	
		}
	}
	for(int i = 1; i <= q;i++) if(ok[i]) cout << res[i] << " ";
	cout << '\n';
}
 
signed main()   
{ 
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15196 KB Output is correct
3 Correct 7 ms 14828 KB Output is correct
4 Correct 7 ms 15192 KB Output is correct
5 Correct 7 ms 14940 KB Output is correct
6 Correct 8 ms 15084 KB Output is correct
7 Correct 8 ms 15192 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 8 ms 15196 KB Output is correct
10 Correct 8 ms 15192 KB Output is correct
11 Correct 8 ms 15088 KB Output is correct
12 Correct 8 ms 15196 KB Output is correct
13 Correct 8 ms 14940 KB Output is correct
14 Correct 7 ms 15108 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 8 ms 15196 KB Output is correct
17 Correct 10 ms 14940 KB Output is correct
18 Correct 8 ms 15284 KB Output is correct
19 Correct 8 ms 15188 KB Output is correct
20 Correct 8 ms 15196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15196 KB Output is correct
3 Correct 7 ms 14828 KB Output is correct
4 Correct 7 ms 15192 KB Output is correct
5 Correct 7 ms 14940 KB Output is correct
6 Correct 8 ms 15084 KB Output is correct
7 Correct 8 ms 15192 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 8 ms 15196 KB Output is correct
10 Correct 8 ms 15192 KB Output is correct
11 Correct 8 ms 15088 KB Output is correct
12 Correct 8 ms 15196 KB Output is correct
13 Correct 8 ms 14940 KB Output is correct
14 Correct 7 ms 15108 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 8 ms 15196 KB Output is correct
17 Correct 10 ms 14940 KB Output is correct
18 Correct 8 ms 15284 KB Output is correct
19 Correct 8 ms 15188 KB Output is correct
20 Correct 8 ms 15196 KB Output is correct
21 Correct 8 ms 15212 KB Output is correct
22 Correct 8 ms 15196 KB Output is correct
23 Correct 8 ms 15196 KB Output is correct
24 Correct 9 ms 15196 KB Output is correct
25 Correct 8 ms 15196 KB Output is correct
26 Correct 7 ms 15196 KB Output is correct
27 Correct 8 ms 15084 KB Output is correct
28 Correct 8 ms 15196 KB Output is correct
29 Correct 9 ms 15192 KB Output is correct
30 Correct 8 ms 15196 KB Output is correct
31 Correct 8 ms 15196 KB Output is correct
32 Correct 8 ms 15284 KB Output is correct
33 Correct 7 ms 15196 KB Output is correct
34 Correct 7 ms 15196 KB Output is correct
35 Correct 9 ms 15160 KB Output is correct
36 Correct 8 ms 15196 KB Output is correct
37 Correct 7 ms 14968 KB Output is correct
38 Correct 8 ms 15196 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 37344 KB Output is correct
2 Correct 94 ms 37456 KB Output is correct
3 Correct 100 ms 37456 KB Output is correct
4 Correct 94 ms 37200 KB Output is correct
5 Correct 99 ms 37452 KB Output is correct
6 Correct 102 ms 37468 KB Output is correct
7 Correct 62 ms 34768 KB Output is correct
8 Correct 53 ms 35264 KB Output is correct
9 Correct 95 ms 37436 KB Output is correct
10 Correct 93 ms 37420 KB Output is correct
11 Correct 93 ms 37460 KB Output is correct
12 Correct 100 ms 37520 KB Output is correct
13 Correct 80 ms 35152 KB Output is correct
14 Correct 101 ms 37460 KB Output is correct
15 Correct 90 ms 37520 KB Output is correct
16 Correct 103 ms 37968 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 468 ms 97104 KB Output is correct
2 Correct 392 ms 80576 KB Output is correct
3 Correct 518 ms 104528 KB Output is correct
4 Correct 410 ms 79912 KB Output is correct
5 Correct 387 ms 81496 KB Output is correct
6 Correct 516 ms 105044 KB Output is correct
7 Correct 217 ms 100340 KB Output is correct
8 Correct 242 ms 99236 KB Output is correct
9 Correct 441 ms 104016 KB Output is correct
10 Correct 443 ms 104020 KB Output is correct
11 Correct 493 ms 104412 KB Output is correct
12 Correct 488 ms 104932 KB Output is correct
13 Correct 475 ms 104500 KB Output is correct
14 Correct 515 ms 105044 KB Output is correct
15 Correct 513 ms 104772 KB Output is correct
16 Correct 511 ms 104884 KB Output is correct
17 Correct 542 ms 104836 KB Output is correct
18 Correct 550 ms 104788 KB Output is correct
19 Correct 530 ms 104884 KB Output is correct
20 Correct 484 ms 104696 KB Output is correct
21 Correct 494 ms 104784 KB Output is correct
22 Correct 511 ms 104808 KB Output is correct
23 Correct 517 ms 104788 KB Output is correct
24 Correct 532 ms 104780 KB Output is correct
25 Correct 439 ms 103248 KB Output is correct
26 Correct 438 ms 104872 KB Output is correct
27 Correct 423 ms 104932 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15196 KB Output is correct
3 Correct 7 ms 14828 KB Output is correct
4 Correct 7 ms 15192 KB Output is correct
5 Correct 7 ms 14940 KB Output is correct
6 Correct 8 ms 15084 KB Output is correct
7 Correct 8 ms 15192 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 8 ms 15196 KB Output is correct
10 Correct 8 ms 15192 KB Output is correct
11 Correct 8 ms 15088 KB Output is correct
12 Correct 8 ms 15196 KB Output is correct
13 Correct 8 ms 14940 KB Output is correct
14 Correct 7 ms 15108 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 8 ms 15196 KB Output is correct
17 Correct 10 ms 14940 KB Output is correct
18 Correct 8 ms 15284 KB Output is correct
19 Correct 8 ms 15188 KB Output is correct
20 Correct 8 ms 15196 KB Output is correct
21 Correct 103 ms 37344 KB Output is correct
22 Correct 94 ms 37456 KB Output is correct
23 Correct 100 ms 37456 KB Output is correct
24 Correct 94 ms 37200 KB Output is correct
25 Correct 99 ms 37452 KB Output is correct
26 Correct 102 ms 37468 KB Output is correct
27 Correct 62 ms 34768 KB Output is correct
28 Correct 53 ms 35264 KB Output is correct
29 Correct 95 ms 37436 KB Output is correct
30 Correct 93 ms 37420 KB Output is correct
31 Correct 93 ms 37460 KB Output is correct
32 Correct 100 ms 37520 KB Output is correct
33 Correct 80 ms 35152 KB Output is correct
34 Correct 101 ms 37460 KB Output is correct
35 Correct 90 ms 37520 KB Output is correct
36 Correct 103 ms 37968 KB Output is correct
37 Correct 90 ms 35156 KB Output is correct
38 Correct 86 ms 32856 KB Output is correct
39 Correct 47 ms 32260 KB Output is correct
40 Correct 58 ms 34628 KB Output is correct
41 Correct 98 ms 37456 KB Output is correct
42 Correct 101 ms 37668 KB Output is correct
43 Correct 106 ms 37464 KB Output is correct
44 Correct 102 ms 37456 KB Output is correct
45 Correct 105 ms 37452 KB Output is correct
46 Correct 102 ms 37456 KB Output is correct
47 Correct 65 ms 36412 KB Output is correct
48 Correct 96 ms 37460 KB Output is correct
49 Correct 76 ms 30800 KB Output is correct
50 Correct 94 ms 34132 KB Output is correct
51 Correct 103 ms 37456 KB Output is correct
52 Correct 116 ms 37460 KB Output is correct
53 Correct 75 ms 32852 KB Output is correct
54 Correct 96 ms 37860 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 89 ms 35348 KB Output is correct
2 Correct 109 ms 37456 KB Output is correct
3 Correct 108 ms 37972 KB Output is correct
4 Correct 77 ms 31008 KB Output is correct
5 Correct 86 ms 34644 KB Output is correct
6 Correct 115 ms 37968 KB Output is correct
7 Correct 56 ms 33980 KB Output is correct
8 Correct 58 ms 32832 KB Output is correct
9 Correct 75 ms 37016 KB Output is correct
10 Correct 63 ms 30656 KB Output is correct
11 Correct 99 ms 37452 KB Output is correct
12 Correct 94 ms 37432 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15196 KB Output is correct
3 Correct 7 ms 14828 KB Output is correct
4 Correct 7 ms 15192 KB Output is correct
5 Correct 7 ms 14940 KB Output is correct
6 Correct 8 ms 15084 KB Output is correct
7 Correct 8 ms 15192 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 8 ms 15196 KB Output is correct
10 Correct 8 ms 15192 KB Output is correct
11 Correct 8 ms 15088 KB Output is correct
12 Correct 8 ms 15196 KB Output is correct
13 Correct 8 ms 14940 KB Output is correct
14 Correct 7 ms 15108 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 8 ms 15196 KB Output is correct
17 Correct 10 ms 14940 KB Output is correct
18 Correct 8 ms 15284 KB Output is correct
19 Correct 8 ms 15188 KB Output is correct
20 Correct 8 ms 15196 KB Output is correct
21 Correct 8 ms 15212 KB Output is correct
22 Correct 8 ms 15196 KB Output is correct
23 Correct 8 ms 15196 KB Output is correct
24 Correct 9 ms 15196 KB Output is correct
25 Correct 8 ms 15196 KB Output is correct
26 Correct 7 ms 15196 KB Output is correct
27 Correct 8 ms 15084 KB Output is correct
28 Correct 8 ms 15196 KB Output is correct
29 Correct 9 ms 15192 KB Output is correct
30 Correct 8 ms 15196 KB Output is correct
31 Correct 8 ms 15196 KB Output is correct
32 Correct 8 ms 15284 KB Output is correct
33 Correct 7 ms 15196 KB Output is correct
34 Correct 7 ms 15196 KB Output is correct
35 Correct 9 ms 15160 KB Output is correct
36 Correct 8 ms 15196 KB Output is correct
37 Correct 7 ms 14968 KB Output is correct
38 Correct 8 ms 15196 KB Output is correct
39 Correct 103 ms 37344 KB Output is correct
40 Correct 94 ms 37456 KB Output is correct
41 Correct 100 ms 37456 KB Output is correct
42 Correct 94 ms 37200 KB Output is correct
43 Correct 99 ms 37452 KB Output is correct
44 Correct 102 ms 37468 KB Output is correct
45 Correct 62 ms 34768 KB Output is correct
46 Correct 53 ms 35264 KB Output is correct
47 Correct 95 ms 37436 KB Output is correct
48 Correct 93 ms 37420 KB Output is correct
49 Correct 93 ms 37460 KB Output is correct
50 Correct 100 ms 37520 KB Output is correct
51 Correct 80 ms 35152 KB Output is correct
52 Correct 101 ms 37460 KB Output is correct
53 Correct 90 ms 37520 KB Output is correct
54 Correct 103 ms 37968 KB Output is correct
55 Correct 90 ms 35156 KB Output is correct
56 Correct 86 ms 32856 KB Output is correct
57 Correct 47 ms 32260 KB Output is correct
58 Correct 58 ms 34628 KB Output is correct
59 Correct 98 ms 37456 KB Output is correct
60 Correct 101 ms 37668 KB Output is correct
61 Correct 106 ms 37464 KB Output is correct
62 Correct 102 ms 37456 KB Output is correct
63 Correct 105 ms 37452 KB Output is correct
64 Correct 102 ms 37456 KB Output is correct
65 Correct 65 ms 36412 KB Output is correct
66 Correct 96 ms 37460 KB Output is correct
67 Correct 76 ms 30800 KB Output is correct
68 Correct 94 ms 34132 KB Output is correct
69 Correct 103 ms 37456 KB Output is correct
70 Correct 116 ms 37460 KB Output is correct
71 Correct 75 ms 32852 KB Output is correct
72 Correct 96 ms 37860 KB Output is correct
73 Correct 89 ms 35348 KB Output is correct
74 Correct 109 ms 37456 KB Output is correct
75 Correct 108 ms 37972 KB Output is correct
76 Correct 77 ms 31008 KB Output is correct
77 Correct 86 ms 34644 KB Output is correct
78 Correct 115 ms 37968 KB Output is correct
79 Correct 56 ms 33980 KB Output is correct
80 Correct 58 ms 32832 KB Output is correct
81 Correct 75 ms 37016 KB Output is correct
82 Correct 63 ms 30656 KB Output is correct
83 Correct 99 ms 37452 KB Output is correct
84 Correct 94 ms 37432 KB Output is correct
85 Correct 109 ms 35772 KB Output is correct
86 Correct 108 ms 37972 KB Output is correct
87 Correct 95 ms 35152 KB Output is correct
88 Correct 109 ms 38156 KB Output is correct
89 Correct 70 ms 30288 KB Output is correct
90 Correct 101 ms 37968 KB Output is correct
91 Correct 91 ms 33876 KB Output is correct
92 Correct 90 ms 32848 KB Output is correct
93 Correct 107 ms 37980 KB Output is correct
94 Correct 115 ms 37972 KB Output is correct
95 Correct 114 ms 37456 KB Output is correct
96 Correct 110 ms 37972 KB Output is correct
97 Correct 125 ms 38136 KB Output is correct
98 Correct 89 ms 34644 KB Output is correct
99 Correct 65 ms 36916 KB Output is correct
100 Correct 82 ms 34128 KB Output is correct
101 Correct 110 ms 37968 KB Output is correct
102 Correct 92 ms 38224 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 15188 KB Output is correct
2 Correct 8 ms 15196 KB Output is correct
3 Correct 7 ms 14828 KB Output is correct
4 Correct 7 ms 15192 KB Output is correct
5 Correct 7 ms 14940 KB Output is correct
6 Correct 8 ms 15084 KB Output is correct
7 Correct 8 ms 15192 KB Output is correct
8 Correct 8 ms 15196 KB Output is correct
9 Correct 8 ms 15196 KB Output is correct
10 Correct 8 ms 15192 KB Output is correct
11 Correct 8 ms 15088 KB Output is correct
12 Correct 8 ms 15196 KB Output is correct
13 Correct 8 ms 14940 KB Output is correct
14 Correct 7 ms 15108 KB Output is correct
15 Correct 9 ms 15196 KB Output is correct
16 Correct 8 ms 15196 KB Output is correct
17 Correct 10 ms 14940 KB Output is correct
18 Correct 8 ms 15284 KB Output is correct
19 Correct 8 ms 15188 KB Output is correct
20 Correct 8 ms 15196 KB Output is correct
21 Correct 8 ms 15212 KB Output is correct
22 Correct 8 ms 15196 KB Output is correct
23 Correct 8 ms 15196 KB Output is correct
24 Correct 9 ms 15196 KB Output is correct
25 Correct 8 ms 15196 KB Output is correct
26 Correct 7 ms 15196 KB Output is correct
27 Correct 8 ms 15084 KB Output is correct
28 Correct 8 ms 15196 KB Output is correct
29 Correct 9 ms 15192 KB Output is correct
30 Correct 8 ms 15196 KB Output is correct
31 Correct 8 ms 15196 KB Output is correct
32 Correct 8 ms 15284 KB Output is correct
33 Correct 7 ms 15196 KB Output is correct
34 Correct 7 ms 15196 KB Output is correct
35 Correct 9 ms 15160 KB Output is correct
36 Correct 8 ms 15196 KB Output is correct
37 Correct 7 ms 14968 KB Output is correct
38 Correct 8 ms 15196 KB Output is correct
39 Correct 103 ms 37344 KB Output is correct
40 Correct 94 ms 37456 KB Output is correct
41 Correct 100 ms 37456 KB Output is correct
42 Correct 94 ms 37200 KB Output is correct
43 Correct 99 ms 37452 KB Output is correct
44 Correct 102 ms 37468 KB Output is correct
45 Correct 62 ms 34768 KB Output is correct
46 Correct 53 ms 35264 KB Output is correct
47 Correct 95 ms 37436 KB Output is correct
48 Correct 93 ms 37420 KB Output is correct
49 Correct 93 ms 37460 KB Output is correct
50 Correct 100 ms 37520 KB Output is correct
51 Correct 80 ms 35152 KB Output is correct
52 Correct 101 ms 37460 KB Output is correct
53 Correct 90 ms 37520 KB Output is correct
54 Correct 103 ms 37968 KB Output is correct
55 Correct 468 ms 97104 KB Output is correct
56 Correct 392 ms 80576 KB Output is correct
57 Correct 518 ms 104528 KB Output is correct
58 Correct 410 ms 79912 KB Output is correct
59 Correct 387 ms 81496 KB Output is correct
60 Correct 516 ms 105044 KB Output is correct
61 Correct 217 ms 100340 KB Output is correct
62 Correct 242 ms 99236 KB Output is correct
63 Correct 441 ms 104016 KB Output is correct
64 Correct 443 ms 104020 KB Output is correct
65 Correct 493 ms 104412 KB Output is correct
66 Correct 488 ms 104932 KB Output is correct
67 Correct 475 ms 104500 KB Output is correct
68 Correct 515 ms 105044 KB Output is correct
69 Correct 513 ms 104772 KB Output is correct
70 Correct 511 ms 104884 KB Output is correct
71 Correct 542 ms 104836 KB Output is correct
72 Correct 550 ms 104788 KB Output is correct
73 Correct 530 ms 104884 KB Output is correct
74 Correct 484 ms 104696 KB Output is correct
75 Correct 494 ms 104784 KB Output is correct
76 Correct 511 ms 104808 KB Output is correct
77 Correct 517 ms 104788 KB Output is correct
78 Correct 532 ms 104780 KB Output is correct
79 Correct 439 ms 103248 KB Output is correct
80 Correct 438 ms 104872 KB Output is correct
81 Correct 423 ms 104932 KB Output is correct
82 Correct 90 ms 35156 KB Output is correct
83 Correct 86 ms 32856 KB Output is correct
84 Correct 47 ms 32260 KB Output is correct
85 Correct 58 ms 34628 KB Output is correct
86 Correct 98 ms 37456 KB Output is correct
87 Correct 101 ms 37668 KB Output is correct
88 Correct 106 ms 37464 KB Output is correct
89 Correct 102 ms 37456 KB Output is correct
90 Correct 105 ms 37452 KB Output is correct
91 Correct 102 ms 37456 KB Output is correct
92 Correct 65 ms 36412 KB Output is correct
93 Correct 96 ms 37460 KB Output is correct
94 Correct 76 ms 30800 KB Output is correct
95 Correct 94 ms 34132 KB Output is correct
96 Correct 103 ms 37456 KB Output is correct
97 Correct 116 ms 37460 KB Output is correct
98 Correct 75 ms 32852 KB Output is correct
99 Correct 96 ms 37860 KB Output is correct
100 Correct 89 ms 35348 KB Output is correct
101 Correct 109 ms 37456 KB Output is correct
102 Correct 108 ms 37972 KB Output is correct
103 Correct 77 ms 31008 KB Output is correct
104 Correct 86 ms 34644 KB Output is correct
105 Correct 115 ms 37968 KB Output is correct
106 Correct 56 ms 33980 KB Output is correct
107 Correct 58 ms 32832 KB Output is correct
108 Correct 75 ms 37016 KB Output is correct
109 Correct 63 ms 30656 KB Output is correct
110 Correct 99 ms 37452 KB Output is correct
111 Correct 94 ms 37432 KB Output is correct
112 Correct 109 ms 35772 KB Output is correct
113 Correct 108 ms 37972 KB Output is correct
114 Correct 95 ms 35152 KB Output is correct
115 Correct 109 ms 38156 KB Output is correct
116 Correct 70 ms 30288 KB Output is correct
117 Correct 101 ms 37968 KB Output is correct
118 Correct 91 ms 33876 KB Output is correct
119 Correct 90 ms 32848 KB Output is correct
120 Correct 107 ms 37980 KB Output is correct
121 Correct 115 ms 37972 KB Output is correct
122 Correct 114 ms 37456 KB Output is correct
123 Correct 110 ms 37972 KB Output is correct
124 Correct 125 ms 38136 KB Output is correct
125 Correct 89 ms 34644 KB Output is correct
126 Correct 65 ms 36916 KB Output is correct
127 Correct 82 ms 34128 KB Output is correct
128 Correct 110 ms 37968 KB Output is correct
129 Correct 92 ms 38224 KB Output is correct
130 Correct 547 ms 105168 KB Output is correct
131 Correct 378 ms 80468 KB Output is correct
132 Correct 568 ms 105048 KB Output is correct
133 Correct 533 ms 101808 KB Output is correct
134 Correct 489 ms 91980 KB Output is correct
135 Correct 568 ms 106076 KB Output is correct
136 Correct 525 ms 104784 KB Output is correct
137 Correct 518 ms 104792 KB Output is correct
138 Correct 534 ms 105092 KB Output is correct
139 Correct 541 ms 105556 KB Output is correct
140 Correct 548 ms 105300 KB Output is correct
141 Correct 573 ms 105476 KB Output is correct
142 Correct 574 ms 105592 KB Output is correct
143 Correct 567 ms 105552 KB Output is correct
144 Correct 563 ms 105296 KB Output is correct
145 Correct 633 ms 105644 KB Output is correct
146 Correct 563 ms 105612 KB Output is correct
147 Correct 551 ms 105388 KB Output is correct
148 Correct 545 ms 105580 KB Output is correct
149 Correct 555 ms 105812 KB Output is correct
150 Correct 314 ms 101092 KB Output is correct
151 Correct 497 ms 105416 KB Output is correct
152 Correct 573 ms 105332 KB Output is correct
153 Correct 465 ms 105808 KB Output is correct