Submission #920341

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
920341	2024-02-02T13:21:29 Z	KiaRez	Self Study (JOI22_ho_t2)	C++17	62 / 100	345 ms	14532 KB

Main

/*
    IN THE NAME OF GOD
*/
#include <bits/stdc++.h>

// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

using namespace std;

typedef __int128 ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;

#define F                                      first
#define S                                      second
#define Mp                                     make_pair
#define pb                                     push_back
#define pf                                     push_front
#define size(x)                                ((ll)x.size())
#define all(x)                                 (x).begin(),(x).end()
#define kill(x)		                           cout << x << '\n', exit(0);
#define fuck(x)                                cout << "(" << #x << " , " << x << ")" << endl
#define endl                                   '\n'

const int N = 3e5+23, lg = 18;
ll Mod = 1e9+7; //998244353;

inline ll MOD(ll a, ll mod=Mod) {a%=mod; (a<0)&&(a+=mod); return a;}
inline ll poww(ll a, ll b, ll mod=Mod) {
    ll ans = 1;
    a=MOD(a, mod);
    while (b) {
        if (b & 1) ans = MOD(ans*a, mod);
        b >>= 1;
        a = MOD(a*a, mod);
    }
    return ans;
}

long long nn, mm, A[N], B[N];
ll n, m, a[N], b[N];
int main () {
	ios_base::sync_with_stdio(false), cin.tie(0);

	cin>>nn>>mm;
	for(int i=1; i<=nn; i++) cin>>A[i];
	for(int i=1; i<=nn; i++) cin>>B[i];
	n=nn, m=mm;
	for(int i=1; i<=n; i++) a[i]=A[i], b[i]=B[i];

	ll l=0, r=1e18+10;
	while(r-l > 1) {
		ll mid = (l+r)/2;
		ll num = 0, yey = 1;
		for(int i=1; i<=n; i++) {
			if(a[i] >= b[i]) {
				ll x = (mid+a[i]-1)/a[i];
				x = min(x, m);
				num -= (m-x);
				ll f = mid - x*a[i];
				num += max((ll)0, (f-1+b[i])/b[i]);
			} else {
				ll x = (mid+b[i]-1)/b[i];
				x = min(x, m);
				num -= (m-x);
				ll f = mid - x*b[i];
				num += max((ll)0, (f-1+b[i])/b[i]);
			}
		}
		if(num <= (ll)0) l=mid;
		else r=mid;
	}

	cout<<(long long)l<<endl;

	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:57:15: warning: unused variable 'yey' [-Wunused-variable]
   57 |   ll num = 0, yey = 1;
      |               ^~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	6488 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6744 KB	Output is correct
6	Correct	2 ms	6488 KB	Output is correct
7	Correct	1 ms	6492 KB	Output is correct
8	Correct	1 ms	6488 KB	Output is correct
9	Correct	1 ms	6488 KB	Output is correct
10	Correct	6 ms	6488 KB	Output is correct
11	Correct	329 ms	14520 KB	Output is correct
12	Correct	339 ms	14416 KB	Output is correct
13	Correct	234 ms	14416 KB	Output is correct
14	Correct	300 ms	14416 KB	Output is correct
15	Correct	1 ms	6488 KB	Output is correct
16	Correct	336 ms	14524 KB	Output is correct
17	Correct	259 ms	14528 KB	Output is correct
18	Correct	260 ms	14524 KB	Output is correct

Subtask #2
25.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	336 ms	14524 KB	Output is correct
3	Correct	259 ms	14528 KB	Output is correct
4	Correct	260 ms	14524 KB	Output is correct
5	Correct	1 ms	6488 KB	Output is correct
6	Correct	1 ms	6488 KB	Output is correct
7	Correct	1 ms	6488 KB	Output is correct
8	Correct	1 ms	6492 KB	Output is correct
9	Correct	1 ms	6488 KB	Output is correct
10	Correct	1 ms	6488 KB	Output is correct
11	Correct	1 ms	6492 KB	Output is correct
12	Correct	1 ms	6488 KB	Output is correct
13	Correct	133 ms	13392 KB	Output is correct
14	Correct	86 ms	8856 KB	Output is correct
15	Correct	65 ms	8792 KB	Output is correct
16	Correct	53 ms	8792 KB	Output is correct
17	Correct	2 ms	6488 KB	Output is correct
18	Correct	1 ms	6488 KB	Output is correct
19	Correct	1 ms	6488 KB	Output is correct
20	Correct	1 ms	6492 KB	Output is correct
21	Correct	1 ms	6492 KB	Output is correct
22	Correct	7 ms	6488 KB	Output is correct
23	Correct	5 ms	6492 KB	Output is correct

Subtask #3
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	6488 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6744 KB	Output is correct
6	Correct	2 ms	6488 KB	Output is correct
7	Correct	1 ms	6492 KB	Output is correct
8	Correct	1 ms	6488 KB	Output is correct
9	Correct	1 ms	6488 KB	Output is correct
10	Correct	6 ms	6488 KB	Output is correct
11	Correct	329 ms	14520 KB	Output is correct
12	Correct	339 ms	14416 KB	Output is correct
13	Correct	234 ms	14416 KB	Output is correct
14	Correct	300 ms	14416 KB	Output is correct
15	Correct	1 ms	6488 KB	Output is correct
16	Correct	1 ms	6488 KB	Output is correct
17	Correct	1 ms	6488 KB	Output is correct
18	Correct	1 ms	6492 KB	Output is correct
19	Correct	1 ms	6488 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	1 ms	6492 KB	Output is correct
22	Correct	1 ms	6488 KB	Output is correct
23	Correct	133 ms	13392 KB	Output is correct
24	Correct	86 ms	8856 KB	Output is correct
25	Correct	65 ms	8792 KB	Output is correct
26	Correct	53 ms	8792 KB	Output is correct
27	Correct	2 ms	6488 KB	Output is correct
28	Correct	1 ms	6488 KB	Output is correct
29	Correct	1 ms	6488 KB	Output is correct
30	Correct	1 ms	6492 KB	Output is correct
31	Correct	1 ms	6492 KB	Output is correct
32	Correct	7 ms	6488 KB	Output is correct
33	Correct	5 ms	6492 KB	Output is correct
34	Correct	1 ms	6488 KB	Output is correct
35	Correct	336 ms	14524 KB	Output is correct
36	Correct	259 ms	14528 KB	Output is correct
37	Correct	260 ms	14524 KB	Output is correct
38	Correct	1 ms	6492 KB	Output is correct
39	Correct	1 ms	6488 KB	Output is correct
40	Correct	1 ms	6488 KB	Output is correct
41	Correct	1 ms	6488 KB	Output is correct
42	Correct	1 ms	6688 KB	Output is correct
43	Correct	1 ms	6488 KB	Output is correct
44	Correct	1 ms	6488 KB	Output is correct
45	Correct	7 ms	6488 KB	Output is correct
46	Correct	11 ms	6744 KB	Output is correct
47	Correct	2 ms	6488 KB	Output is correct
48	Correct	62 ms	9044 KB	Output is correct
49	Correct	1 ms	6492 KB	Output is correct
50	Correct	1 ms	6488 KB	Output is correct
51	Correct	6 ms	6488 KB	Output is correct
52	Correct	1 ms	6488 KB	Output is correct
53	Correct	1 ms	6492 KB	Output is correct
54	Correct	1 ms	6488 KB	Output is correct
55	Correct	165 ms	13348 KB	Output is correct
56	Correct	79 ms	8796 KB	Output is correct
57	Correct	99 ms	8792 KB	Output is correct

Subtask #4
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	6488 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	6488 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6488 KB	Output is correct
6	Correct	1 ms	6488 KB	Output is correct
7	Correct	1 ms	6492 KB	Output is correct
8	Correct	1 ms	6488 KB	Output is correct
9	Correct	133 ms	13392 KB	Output is correct
10	Correct	86 ms	8856 KB	Output is correct
11	Correct	65 ms	8792 KB	Output is correct
12	Correct	53 ms	8792 KB	Output is correct
13	Correct	2 ms	6488 KB	Output is correct
14	Correct	1 ms	6488 KB	Output is correct
15	Correct	1 ms	6488 KB	Output is correct
16	Correct	1 ms	6492 KB	Output is correct
17	Correct	1 ms	6492 KB	Output is correct
18	Correct	7 ms	6488 KB	Output is correct
19	Correct	5 ms	6492 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	336 ms	14524 KB	Output is correct
22	Correct	259 ms	14528 KB	Output is correct
23	Correct	260 ms	14524 KB	Output is correct
24	Correct	45 ms	8796 KB	Output is correct
25	Correct	128 ms	11344 KB	Output is correct
26	Correct	30 ms	8796 KB	Output is correct
27	Correct	254 ms	14524 KB	Output is correct
28	Correct	266 ms	14524 KB	Output is correct
29	Correct	260 ms	14520 KB	Output is correct
30	Correct	267 ms	14416 KB	Output is correct
31	Correct	282 ms	14416 KB	Output is correct
32	Correct	345 ms	14528 KB	Output is correct
33	Incorrect	287 ms	14532 KB	Output isn't correct
34	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	6488 KB	Output is correct
2	Correct	1 ms	6488 KB	Output is correct
3	Correct	1 ms	6492 KB	Output is correct
4	Correct	1 ms	6492 KB	Output is correct
5	Correct	1 ms	6744 KB	Output is correct
6	Correct	2 ms	6488 KB	Output is correct
7	Correct	1 ms	6492 KB	Output is correct
8	Correct	1 ms	6488 KB	Output is correct
9	Correct	1 ms	6488 KB	Output is correct
10	Correct	6 ms	6488 KB	Output is correct
11	Correct	329 ms	14520 KB	Output is correct
12	Correct	339 ms	14416 KB	Output is correct
13	Correct	234 ms	14416 KB	Output is correct
14	Correct	300 ms	14416 KB	Output is correct
15	Correct	1 ms	6488 KB	Output is correct
16	Correct	1 ms	6488 KB	Output is correct
17	Correct	1 ms	6488 KB	Output is correct
18	Correct	1 ms	6492 KB	Output is correct
19	Correct	1 ms	6488 KB	Output is correct
20	Correct	1 ms	6488 KB	Output is correct
21	Correct	1 ms	6492 KB	Output is correct
22	Correct	1 ms	6488 KB	Output is correct
23	Correct	133 ms	13392 KB	Output is correct
24	Correct	86 ms	8856 KB	Output is correct
25	Correct	65 ms	8792 KB	Output is correct
26	Correct	53 ms	8792 KB	Output is correct
27	Correct	2 ms	6488 KB	Output is correct
28	Correct	1 ms	6488 KB	Output is correct
29	Correct	1 ms	6488 KB	Output is correct
30	Correct	1 ms	6492 KB	Output is correct
31	Correct	1 ms	6492 KB	Output is correct
32	Correct	7 ms	6488 KB	Output is correct
33	Correct	5 ms	6492 KB	Output is correct
34	Correct	1 ms	6492 KB	Output is correct
35	Correct	1 ms	6488 KB	Output is correct
36	Correct	1 ms	6488 KB	Output is correct
37	Correct	1 ms	6488 KB	Output is correct
38	Correct	1 ms	6688 KB	Output is correct
39	Correct	1 ms	6488 KB	Output is correct
40	Correct	1 ms	6488 KB	Output is correct
41	Correct	7 ms	6488 KB	Output is correct
42	Correct	11 ms	6744 KB	Output is correct
43	Correct	2 ms	6488 KB	Output is correct
44	Correct	62 ms	9044 KB	Output is correct
45	Correct	1 ms	6492 KB	Output is correct
46	Correct	1 ms	6488 KB	Output is correct
47	Correct	6 ms	6488 KB	Output is correct
48	Correct	1 ms	6488 KB	Output is correct
49	Correct	1 ms	6492 KB	Output is correct
50	Correct	1 ms	6488 KB	Output is correct
51	Correct	165 ms	13348 KB	Output is correct
52	Correct	79 ms	8796 KB	Output is correct
53	Correct	99 ms	8792 KB	Output is correct
54	Correct	45 ms	8796 KB	Output is correct
55	Correct	128 ms	11344 KB	Output is correct
56	Correct	30 ms	8796 KB	Output is correct
57	Correct	254 ms	14524 KB	Output is correct
58	Correct	266 ms	14524 KB	Output is correct
59	Correct	260 ms	14520 KB	Output is correct
60	Correct	267 ms	14416 KB	Output is correct
61	Correct	282 ms	14416 KB	Output is correct
62	Correct	345 ms	14528 KB	Output is correct
63	Incorrect	287 ms	14532 KB	Output isn't correct
64	Halted	0 ms	0 KB	-

Submission #920341

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 0 / 29.0

Subtask #5 0 / 9.0

Subtask #1
10.0 / 10.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
0 / 29.0

Subtask #5
0 / 9.0