답안 #529437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
529437	2022-02-23T02:26:06 Z	fhvirus	Self Study (JOI22_ho_t2)	C++17	0 / 100	498 ms	5004 KB

Main

#include <bits/stdc++.h>
using namespace std;
typedef int64_t ll; typedef pair<int, int> pii;
#define pb emplace_back
#define AI(x) begin(x),end(x)
#define ff first
#define ss second
#ifdef OWO
#define debug(args...) LKJ("\033[0;32m[ " + string(#args) + " ]\033[0m", args)
template<class I> void LKJ(I&&x) { cerr << x << endl; }
template<class I, class...T> void LKJ(I&&x, T&&...t) { cerr << x << ", "; LKJ(t...); }
template<class I> void OI(I a, I b) { while (a < b) cerr << *a << " \n"[next(a) == b]; }
#else
#define debug(...) 0
#define OI(...) 0
#endif

signed main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

	ll N, M; cin >> N >> M;
	vector<ll> A(N), B(N);
	for (ll &i: A) cin >> i;
	for (ll &i: B) cin >> i;

	ll ans = 0;
	for (ll l = (1ll << 61); l > 0; l >>= 1) {
		ll threshold = ans + l;
		debug(threshold);
		ll empty = (ll) N * M;
		for (int i = 0; i < N; ++i) {
			ll tmp = threshold;
			if (A[i] >= B[i]) {
				ll chooseA = (tmp + A[i] - 1) / A[i];
				chooseA = min(chooseA,  M);
				tmp -= A[i] * chooseA;
				empty -= chooseA;
				debug(i, chooseA);
			}
			if (tmp > 0) {
				ll chooseB = (tmp + B[i] - 1) / B[i];
				debug(i, chooseB);
				empty -= chooseB;
			}
		}
		if (empty >= 0) ans = threshold;
	}
	cout << ans << '\n';

	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Main.cpp:29:3: note: in expansion of macro 'debug'
   29 |   debug(threshold);
      |   ^~~~~
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Main.cpp:38:5: note: in expansion of macro 'debug'
   38 |     debug(i, chooseA);
      |     ^~~~~
Main.cpp:14:20: warning: statement has no effect [-Wunused-value]
   14 | #define debug(...) 0
      |                    ^
Main.cpp:42:5: note: in expansion of macro 'debug'
   42 |     debug(i, chooseB);
      |     ^~~~~

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	248 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	4 ms	332 KB	Output is correct
11	Correct	204 ms	5004 KB	Output is correct
12	Correct	201 ms	4940 KB	Output is correct
13	Correct	162 ms	5000 KB	Output is correct
14	Incorrect	498 ms	4940 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	119 ms	2636 KB	Output is correct
10	Correct	80 ms	1868 KB	Output is correct
11	Correct	62 ms	1484 KB	Output is correct
12	Correct	52 ms	1228 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Incorrect	9 ms	376 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	248 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	4 ms	332 KB	Output is correct
11	Correct	204 ms	5004 KB	Output is correct
12	Correct	201 ms	4940 KB	Output is correct
13	Correct	162 ms	5000 KB	Output is correct
14	Incorrect	498 ms	4940 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	119 ms	2636 KB	Output is correct
10	Correct	80 ms	1868 KB	Output is correct
11	Correct	62 ms	1484 KB	Output is correct
12	Correct	52 ms	1228 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	0 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	0 ms	204 KB	Output is correct
17	Correct	0 ms	204 KB	Output is correct
18	Incorrect	9 ms	376 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	248 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	4 ms	332 KB	Output is correct
11	Correct	204 ms	5004 KB	Output is correct
12	Correct	201 ms	4940 KB	Output is correct
13	Correct	162 ms	5000 KB	Output is correct
14	Incorrect	498 ms	4940 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

답안 #529437

Compilation message

Subtask #1 0 / 10.0

Subtask #2 0 / 25.0

Subtask #3 0 / 27.0

Subtask #4 0 / 29.0

Subtask #5 0 / 9.0

Subtask #1
0 / 10.0

Subtask #2
0 / 25.0

Subtask #3
0 / 27.0

Subtask #4
0 / 29.0

Subtask #5
0 / 9.0