Submission #941095

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
941095	2024-03-08T06:54:52 Z	Pring	Self Study (JOI22_ho_t2)	C++17	10 / 100	49 ms	11344 KB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("avx2","popcnt")
using namespace std;

#ifdef MIKU
#define debug(x...) cout << '[' << #x << "] : ", dout(x)
void dout() { cout << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 300005;
int n, m, a[MXN], b[MXN];

void miku() {
    cin >> n >> m;
    FOR(i, 0, n) cin >> a[i];
    FOR(i, 0, n) cin >> b[i];
    int ans = LLONG_MAX;
    FOR(i, 0, n) ans = min(ans, max(a[i], b[i]));
    cout << ans << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	45 ms	4956 KB	Output is correct
12	Correct	45 ms	4948 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	34 ms	4952 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	23 ms	6236 KB	Output is correct
17	Correct	49 ms	11344 KB	Output is correct
18	Correct	47 ms	10684 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	23 ms	6236 KB	Output is correct
3	Correct	49 ms	11344 KB	Output is correct
4	Correct	47 ms	10684 KB	Output is correct
5	Incorrect	1 ms	2396 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	45 ms	4956 KB	Output is correct
12	Correct	45 ms	4948 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	34 ms	4952 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	2396 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	2 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	2 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	45 ms	4956 KB	Output is correct
12	Correct	45 ms	4948 KB	Output is correct
13	Correct	35 ms	4956 KB	Output is correct
14	Correct	34 ms	4952 KB	Output is correct
15	Incorrect	1 ms	2396 KB	Output isn't correct
16	Halted	0 ms	0 KB	-