oj.uz

답안 #1098639

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098639 2024-10-09T16:18:52 Z flyingkite 푸드 코트 (JOI21_foodcourt) C++17
100 / 100
 716 ms 105916 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 12 ms 15088 KB Output is correct
2 Correct 10 ms 15228 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 15196 KB Output is correct
5 Correct 9 ms 14936 KB Output is correct
6 Correct 8 ms 14984 KB Output is correct
7 Correct 12 ms 15084 KB Output is correct
8 Correct 9 ms 15196 KB Output is correct
9 Correct 12 ms 15100 KB Output is correct
10 Correct 12 ms 15192 KB Output is correct
11 Correct 15 ms 15148 KB Output is correct
12 Correct 11 ms 15268 KB Output is correct
13 Correct 12 ms 15156 KB Output is correct
14 Correct 10 ms 15204 KB Output is correct
15 Correct 10 ms 14940 KB Output is correct
16 Correct 11 ms 15484 KB Output is correct
17 Correct 12 ms 15152 KB Output is correct
18 Correct 11 ms 15280 KB Output is correct
19 Correct 10 ms 15196 KB Output is correct
20 Correct 10 ms 15196 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 15088 KB Output is correct
2 Correct 10 ms 15228 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 15196 KB Output is correct
5 Correct 9 ms 14936 KB Output is correct
6 Correct 8 ms 14984 KB Output is correct
7 Correct 12 ms 15084 KB Output is correct
8 Correct 9 ms 15196 KB Output is correct
9 Correct 12 ms 15100 KB Output is correct
10 Correct 12 ms 15192 KB Output is correct
11 Correct 15 ms 15148 KB Output is correct
12 Correct 11 ms 15268 KB Output is correct
13 Correct 12 ms 15156 KB Output is correct
14 Correct 10 ms 15204 KB Output is correct
15 Correct 10 ms 14940 KB Output is correct
16 Correct 11 ms 15484 KB Output is correct
17 Correct 12 ms 15152 KB Output is correct
18 Correct 11 ms 15280 KB Output is correct
19 Correct 10 ms 15196 KB Output is correct
20 Correct 10 ms 15196 KB Output is correct
21 Correct 11 ms 15196 KB Output is correct
22 Correct 11 ms 15056 KB Output is correct
23 Correct 9 ms 15188 KB Output is correct
24 Correct 9 ms 15076 KB Output is correct
25 Correct 12 ms 15196 KB Output is correct
26 Correct 13 ms 15196 KB Output is correct
27 Correct 11 ms 15292 KB Output is correct
28 Correct 10 ms 15192 KB Output is correct
29 Correct 11 ms 15248 KB Output is correct
30 Correct 11 ms 15200 KB Output is correct
31 Correct 10 ms 15060 KB Output is correct
32 Correct 9 ms 15200 KB Output is correct
33 Correct 10 ms 15184 KB Output is correct
34 Correct 9 ms 15196 KB Output is correct
35 Correct 9 ms 15448 KB Output is correct
36 Correct 11 ms 15232 KB Output is correct
37 Correct 11 ms 14936 KB Output is correct
38 Correct 15 ms 15196 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 37400 KB Output is correct
2 Correct 111 ms 37552 KB Output is correct
3 Correct 138 ms 37200 KB Output is correct
4 Correct 103 ms 37204 KB Output is correct
5 Correct 114 ms 37372 KB Output is correct
6 Correct 103 ms 37532 KB Output is correct
7 Correct 51 ms 34572 KB Output is correct
8 Correct 56 ms 35264 KB Output is correct
9 Correct 116 ms 37444 KB Output is correct
10 Correct 98 ms 37536 KB Output is correct
11 Correct 105 ms 37456 KB Output is correct
12 Correct 108 ms 37456 KB Output is correct
13 Correct 93 ms 35152 KB Output is correct
14 Correct 100 ms 37460 KB Output is correct
15 Correct 102 ms 37592 KB Output is correct
16 Correct 110 ms 37716 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 487 ms 97004 KB Output is correct
2 Correct 420 ms 80584 KB Output is correct
3 Correct 612 ms 104572 KB Output is correct
4 Correct 459 ms 79952 KB Output is correct
5 Correct 472 ms 81336 KB Output is correct
6 Correct 714 ms 105128 KB Output is correct
7 Correct 238 ms 100356 KB Output is correct
8 Correct 257 ms 99220 KB Output is correct
9 Correct 584 ms 103808 KB Output is correct
10 Correct 528 ms 103988 KB Output is correct
11 Correct 563 ms 104528 KB Output is correct
12 Correct 623 ms 105032 KB Output is correct
13 Correct 558 ms 104340 KB Output is correct
14 Correct 634 ms 105060 KB Output is correct
15 Correct 716 ms 104900 KB Output is correct
16 Correct 690 ms 104904 KB Output is correct
17 Correct 637 ms 104900 KB Output is correct
18 Correct 680 ms 104944 KB Output is correct
19 Correct 652 ms 104920 KB Output is correct
20 Correct 637 ms 104744 KB Output is correct
21 Correct 617 ms 105040 KB Output is correct
22 Correct 617 ms 104916 KB Output is correct
23 Correct 648 ms 104968 KB Output is correct
24 Correct 552 ms 104884 KB Output is correct
25 Correct 536 ms 103132 KB Output is correct
26 Correct 536 ms 104848 KB Output is correct
27 Correct 537 ms 104900 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 15088 KB Output is correct
2 Correct 10 ms 15228 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 15196 KB Output is correct
5 Correct 9 ms 14936 KB Output is correct
6 Correct 8 ms 14984 KB Output is correct
7 Correct 12 ms 15084 KB Output is correct
8 Correct 9 ms 15196 KB Output is correct
9 Correct 12 ms 15100 KB Output is correct
10 Correct 12 ms 15192 KB Output is correct
11 Correct 15 ms 15148 KB Output is correct
12 Correct 11 ms 15268 KB Output is correct
13 Correct 12 ms 15156 KB Output is correct
14 Correct 10 ms 15204 KB Output is correct
15 Correct 10 ms 14940 KB Output is correct
16 Correct 11 ms 15484 KB Output is correct
17 Correct 12 ms 15152 KB Output is correct
18 Correct 11 ms 15280 KB Output is correct
19 Correct 10 ms 15196 KB Output is correct
20 Correct 10 ms 15196 KB Output is correct
21 Correct 121 ms 37400 KB Output is correct
22 Correct 111 ms 37552 KB Output is correct
23 Correct 138 ms 37200 KB Output is correct
24 Correct 103 ms 37204 KB Output is correct
25 Correct 114 ms 37372 KB Output is correct
26 Correct 103 ms 37532 KB Output is correct
27 Correct 51 ms 34572 KB Output is correct
28 Correct 56 ms 35264 KB Output is correct
29 Correct 116 ms 37444 KB Output is correct
30 Correct 98 ms 37536 KB Output is correct
31 Correct 105 ms 37456 KB Output is correct
32 Correct 108 ms 37456 KB Output is correct
33 Correct 93 ms 35152 KB Output is correct
34 Correct 100 ms 37460 KB Output is correct
35 Correct 102 ms 37592 KB Output is correct
36 Correct 110 ms 37716 KB Output is correct
37 Correct 132 ms 35088 KB Output is correct
38 Correct 100 ms 32848 KB Output is correct
39 Correct 54 ms 32204 KB Output is correct
40 Correct 83 ms 34620 KB Output is correct
41 Correct 130 ms 37460 KB Output is correct
42 Correct 182 ms 37588 KB Output is correct
43 Correct 133 ms 37636 KB Output is correct
44 Correct 127 ms 37456 KB Output is correct
45 Correct 164 ms 37412 KB Output is correct
46 Correct 129 ms 37408 KB Output is correct
47 Correct 90 ms 36416 KB Output is correct
48 Correct 118 ms 37456 KB Output is correct
49 Correct 90 ms 30800 KB Output is correct
50 Correct 122 ms 34112 KB Output is correct
51 Correct 138 ms 37456 KB Output is correct
52 Correct 142 ms 37460 KB Output is correct
53 Correct 80 ms 32852 KB Output is correct
54 Correct 143 ms 37824 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 34236 KB Output is correct
2 Correct 128 ms 37460 KB Output is correct
3 Correct 150 ms 37832 KB Output is correct
4 Correct 86 ms 30940 KB Output is correct
5 Correct 134 ms 34640 KB Output is correct
6 Correct 117 ms 37788 KB Output is correct
7 Correct 76 ms 34052 KB Output is correct
8 Correct 67 ms 32864 KB Output is correct
9 Correct 84 ms 37008 KB Output is correct
10 Correct 75 ms 30552 KB Output is correct
11 Correct 108 ms 37468 KB Output is correct
12 Correct 150 ms 37460 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 15088 KB Output is correct
2 Correct 10 ms 15228 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 15196 KB Output is correct
5 Correct 9 ms 14936 KB Output is correct
6 Correct 8 ms 14984 KB Output is correct
7 Correct 12 ms 15084 KB Output is correct
8 Correct 9 ms 15196 KB Output is correct
9 Correct 12 ms 15100 KB Output is correct
10 Correct 12 ms 15192 KB Output is correct
11 Correct 15 ms 15148 KB Output is correct
12 Correct 11 ms 15268 KB Output is correct
13 Correct 12 ms 15156 KB Output is correct
14 Correct 10 ms 15204 KB Output is correct
15 Correct 10 ms 14940 KB Output is correct
16 Correct 11 ms 15484 KB Output is correct
17 Correct 12 ms 15152 KB Output is correct
18 Correct 11 ms 15280 KB Output is correct
19 Correct 10 ms 15196 KB Output is correct
20 Correct 10 ms 15196 KB Output is correct
21 Correct 11 ms 15196 KB Output is correct
22 Correct 11 ms 15056 KB Output is correct
23 Correct 9 ms 15188 KB Output is correct
24 Correct 9 ms 15076 KB Output is correct
25 Correct 12 ms 15196 KB Output is correct
26 Correct 13 ms 15196 KB Output is correct
27 Correct 11 ms 15292 KB Output is correct
28 Correct 10 ms 15192 KB Output is correct
29 Correct 11 ms 15248 KB Output is correct
30 Correct 11 ms 15200 KB Output is correct
31 Correct 10 ms 15060 KB Output is correct
32 Correct 9 ms 15200 KB Output is correct
33 Correct 10 ms 15184 KB Output is correct
34 Correct 9 ms 15196 KB Output is correct
35 Correct 9 ms 15448 KB Output is correct
36 Correct 11 ms 15232 KB Output is correct
37 Correct 11 ms 14936 KB Output is correct
38 Correct 15 ms 15196 KB Output is correct
39 Correct 121 ms 37400 KB Output is correct
40 Correct 111 ms 37552 KB Output is correct
41 Correct 138 ms 37200 KB Output is correct
42 Correct 103 ms 37204 KB Output is correct
43 Correct 114 ms 37372 KB Output is correct
44 Correct 103 ms 37532 KB Output is correct
45 Correct 51 ms 34572 KB Output is correct
46 Correct 56 ms 35264 KB Output is correct
47 Correct 116 ms 37444 KB Output is correct
48 Correct 98 ms 37536 KB Output is correct
49 Correct 105 ms 37456 KB Output is correct
50 Correct 108 ms 37456 KB Output is correct
51 Correct 93 ms 35152 KB Output is correct
52 Correct 100 ms 37460 KB Output is correct
53 Correct 102 ms 37592 KB Output is correct
54 Correct 110 ms 37716 KB Output is correct
55 Correct 132 ms 35088 KB Output is correct
56 Correct 100 ms 32848 KB Output is correct
57 Correct 54 ms 32204 KB Output is correct
58 Correct 83 ms 34620 KB Output is correct
59 Correct 130 ms 37460 KB Output is correct
60 Correct 182 ms 37588 KB Output is correct
61 Correct 133 ms 37636 KB Output is correct
62 Correct 127 ms 37456 KB Output is correct
63 Correct 164 ms 37412 KB Output is correct
64 Correct 129 ms 37408 KB Output is correct
65 Correct 90 ms 36416 KB Output is correct
66 Correct 118 ms 37456 KB Output is correct
67 Correct 90 ms 30800 KB Output is correct
68 Correct 122 ms 34112 KB Output is correct
69 Correct 138 ms 37456 KB Output is correct
70 Correct 142 ms 37460 KB Output is correct
71 Correct 80 ms 32852 KB Output is correct
72 Correct 143 ms 37824 KB Output is correct
73 Correct 123 ms 34236 KB Output is correct
74 Correct 128 ms 37460 KB Output is correct
75 Correct 150 ms 37832 KB Output is correct
76 Correct 86 ms 30940 KB Output is correct
77 Correct 134 ms 34640 KB Output is correct
78 Correct 117 ms 37788 KB Output is correct
79 Correct 76 ms 34052 KB Output is correct
80 Correct 67 ms 32864 KB Output is correct
81 Correct 84 ms 37008 KB Output is correct
82 Correct 75 ms 30552 KB Output is correct
83 Correct 108 ms 37468 KB Output is correct
84 Correct 150 ms 37460 KB Output is correct
85 Correct 154 ms 35716 KB Output is correct
86 Correct 129 ms 37972 KB Output is correct
87 Correct 115 ms 35240 KB Output is correct
88 Correct 122 ms 38192 KB Output is correct
89 Correct 84 ms 30292 KB Output is correct
90 Correct 145 ms 37972 KB Output is correct
91 Correct 99 ms 33876 KB Output is correct
92 Correct 103 ms 32924 KB Output is correct
93 Correct 128 ms 38296 KB Output is correct
94 Correct 124 ms 37856 KB Output is correct
95 Correct 129 ms 37596 KB Output is correct
96 Correct 124 ms 38080 KB Output is correct
97 Correct 144 ms 37968 KB Output is correct
98 Correct 125 ms 34580 KB Output is correct
99 Correct 76 ms 36920 KB Output is correct
100 Correct 88 ms 34056 KB Output is correct
101 Correct 134 ms 38060 KB Output is correct
102 Correct 101 ms 38224 KB Output is correct

Subtask #8
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 15088 KB Output is correct
2 Correct 10 ms 15228 KB Output is correct
3 Correct 12 ms 14828 KB Output is correct
4 Correct 10 ms 15196 KB Output is correct
5 Correct 9 ms 14936 KB Output is correct
6 Correct 8 ms 14984 KB Output is correct
7 Correct 12 ms 15084 KB Output is correct
8 Correct 9 ms 15196 KB Output is correct
9 Correct 12 ms 15100 KB Output is correct
10 Correct 12 ms 15192 KB Output is correct
11 Correct 15 ms 15148 KB Output is correct
12 Correct 11 ms 15268 KB Output is correct
13 Correct 12 ms 15156 KB Output is correct
14 Correct 10 ms 15204 KB Output is correct
15 Correct 10 ms 14940 KB Output is correct
16 Correct 11 ms 15484 KB Output is correct
17 Correct 12 ms 15152 KB Output is correct
18 Correct 11 ms 15280 KB Output is correct
19 Correct 10 ms 15196 KB Output is correct
20 Correct 10 ms 15196 KB Output is correct
21 Correct 11 ms 15196 KB Output is correct
22 Correct 11 ms 15056 KB Output is correct
23 Correct 9 ms 15188 KB Output is correct
24 Correct 9 ms 15076 KB Output is correct
25 Correct 12 ms 15196 KB Output is correct
26 Correct 13 ms 15196 KB Output is correct
27 Correct 11 ms 15292 KB Output is correct
28 Correct 10 ms 15192 KB Output is correct
29 Correct 11 ms 15248 KB Output is correct
30 Correct 11 ms 15200 KB Output is correct
31 Correct 10 ms 15060 KB Output is correct
32 Correct 9 ms 15200 KB Output is correct
33 Correct 10 ms 15184 KB Output is correct
34 Correct 9 ms 15196 KB Output is correct
35 Correct 9 ms 15448 KB Output is correct
36 Correct 11 ms 15232 KB Output is correct
37 Correct 11 ms 14936 KB Output is correct
38 Correct 15 ms 15196 KB Output is correct
39 Correct 121 ms 37400 KB Output is correct
40 Correct 111 ms 37552 KB Output is correct
41 Correct 138 ms 37200 KB Output is correct
42 Correct 103 ms 37204 KB Output is correct
43 Correct 114 ms 37372 KB Output is correct
44 Correct 103 ms 37532 KB Output is correct
45 Correct 51 ms 34572 KB Output is correct
46 Correct 56 ms 35264 KB Output is correct
47 Correct 116 ms 37444 KB Output is correct
48 Correct 98 ms 37536 KB Output is correct
49 Correct 105 ms 37456 KB Output is correct
50 Correct 108 ms 37456 KB Output is correct
51 Correct 93 ms 35152 KB Output is correct
52 Correct 100 ms 37460 KB Output is correct
53 Correct 102 ms 37592 KB Output is correct
54 Correct 110 ms 37716 KB Output is correct
55 Correct 487 ms 97004 KB Output is correct
56 Correct 420 ms 80584 KB Output is correct
57 Correct 612 ms 104572 KB Output is correct
58 Correct 459 ms 79952 KB Output is correct
59 Correct 472 ms 81336 KB Output is correct
60 Correct 714 ms 105128 KB Output is correct
61 Correct 238 ms 100356 KB Output is correct
62 Correct 257 ms 99220 KB Output is correct
63 Correct 584 ms 103808 KB Output is correct
64 Correct 528 ms 103988 KB Output is correct
65 Correct 563 ms 104528 KB Output is correct
66 Correct 623 ms 105032 KB Output is correct
67 Correct 558 ms 104340 KB Output is correct
68 Correct 634 ms 105060 KB Output is correct
69 Correct 716 ms 104900 KB Output is correct
70 Correct 690 ms 104904 KB Output is correct
71 Correct 637 ms 104900 KB Output is correct
72 Correct 680 ms 104944 KB Output is correct
73 Correct 652 ms 104920 KB Output is correct
74 Correct 637 ms 104744 KB Output is correct
75 Correct 617 ms 105040 KB Output is correct
76 Correct 617 ms 104916 KB Output is correct
77 Correct 648 ms 104968 KB Output is correct
78 Correct 552 ms 104884 KB Output is correct
79 Correct 536 ms 103132 KB Output is correct
80 Correct 536 ms 104848 KB Output is correct
81 Correct 537 ms 104900 KB Output is correct
82 Correct 132 ms 35088 KB Output is correct
83 Correct 100 ms 32848 KB Output is correct
84 Correct 54 ms 32204 KB Output is correct
85 Correct 83 ms 34620 KB Output is correct
86 Correct 130 ms 37460 KB Output is correct
87 Correct 182 ms 37588 KB Output is correct
88 Correct 133 ms 37636 KB Output is correct
89 Correct 127 ms 37456 KB Output is correct
90 Correct 164 ms 37412 KB Output is correct
91 Correct 129 ms 37408 KB Output is correct
92 Correct 90 ms 36416 KB Output is correct
93 Correct 118 ms 37456 KB Output is correct
94 Correct 90 ms 30800 KB Output is correct
95 Correct 122 ms 34112 KB Output is correct
96 Correct 138 ms 37456 KB Output is correct
97 Correct 142 ms 37460 KB Output is correct
98 Correct 80 ms 32852 KB Output is correct
99 Correct 143 ms 37824 KB Output is correct
100 Correct 123 ms 34236 KB Output is correct
101 Correct 128 ms 37460 KB Output is correct
102 Correct 150 ms 37832 KB Output is correct
103 Correct 86 ms 30940 KB Output is correct
104 Correct 134 ms 34640 KB Output is correct
105 Correct 117 ms 37788 KB Output is correct
106 Correct 76 ms 34052 KB Output is correct
107 Correct 67 ms 32864 KB Output is correct
108 Correct 84 ms 37008 KB Output is correct
109 Correct 75 ms 30552 KB Output is correct
110 Correct 108 ms 37468 KB Output is correct
111 Correct 150 ms 37460 KB Output is correct
112 Correct 154 ms 35716 KB Output is correct
113 Correct 129 ms 37972 KB Output is correct
114 Correct 115 ms 35240 KB Output is correct
115 Correct 122 ms 38192 KB Output is correct
116 Correct 84 ms 30292 KB Output is correct
117 Correct 145 ms 37972 KB Output is correct
118 Correct 99 ms 33876 KB Output is correct
119 Correct 103 ms 32924 KB Output is correct
120 Correct 128 ms 38296 KB Output is correct
121 Correct 124 ms 37856 KB Output is correct
122 Correct 129 ms 37596 KB Output is correct
123 Correct 124 ms 38080 KB Output is correct
124 Correct 144 ms 37968 KB Output is correct
125 Correct 125 ms 34580 KB Output is correct
126 Correct 76 ms 36920 KB Output is correct
127 Correct 88 ms 34056 KB Output is correct
128 Correct 134 ms 38060 KB Output is correct
129 Correct 101 ms 38224 KB Output is correct
130 Correct 636 ms 105044 KB Output is correct
131 Correct 413 ms 80516 KB Output is correct
132 Correct 587 ms 105060 KB Output is correct
133 Correct 575 ms 101792 KB Output is correct
134 Correct 538 ms 92224 KB Output is correct
135 Correct 581 ms 105916 KB Output is correct
136 Correct 638 ms 104884 KB Output is correct
137 Correct 662 ms 104928 KB Output is correct
138 Correct 688 ms 105044 KB Output is correct
139 Correct 577 ms 105608 KB Output is correct
140 Correct 637 ms 105276 KB Output is correct
141 Correct 630 ms 105552 KB Output is correct
142 Correct 673 ms 105552 KB Output is correct
143 Correct 685 ms 105560 KB Output is correct
144 Correct 627 ms 105320 KB Output is correct
145 Correct 654 ms 105640 KB Output is correct
146 Correct 618 ms 105480 KB Output is correct
147 Correct 646 ms 105508 KB Output is correct
148 Correct 684 ms 105596 KB Output is correct
149 Correct 621 ms 105540 KB Output is correct
150 Correct 330 ms 101040 KB Output is correct
151 Correct 546 ms 105300 KB Output is correct
152 Correct 587 ms 105520 KB Output is correct
153 Correct 559 ms 105704 KB Output is correct