Submission #534081

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
534081	2022-03-08T00:34:53 Z	Cookie197	Self Study (JOI22_ho_t2)	C++14	10 / 100	70 ms	5912 KB

Main

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define ll long long
#define pii pair<ll,ll> 
#define mp make_pair
#define endl "\n"
#define out(x) cout << #x << " = " << x << endl
#define outp(x) cout << #x << ".first = " << x.first << "  " << #x << ".second = " << x.second << endl
#pragma GCC optimize("Ofast")

ll n,m;
ll a[300005],b[300005];
signed main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>m;
    for (int i=1;i<=n;i++) cin>>a[i];
    for (int i=1;i<=n;i++) cin>>b[i];
    ll ans = 1e18;
    for (int i=1;i<=n;i++) ans = min(ans, max(a[i],b[i]));
    cout<<ans<<endl;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 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	1 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	0 ms	204 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	55 ms	5496 KB	Output is correct
12	Correct	57 ms	5552 KB	Output is correct
13	Correct	50 ms	5524 KB	Output is correct
14	Correct	51 ms	5508 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	28 ms	5828 KB	Output is correct
17	Correct	70 ms	5828 KB	Output is correct
18	Correct	55 ms	5912 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	28 ms	5828 KB	Output is correct
3	Correct	70 ms	5828 KB	Output is correct
4	Correct	55 ms	5912 KB	Output is correct
5	Incorrect	0 ms	204 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 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	1 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	0 ms	204 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	55 ms	5496 KB	Output is correct
12	Correct	57 ms	5552 KB	Output is correct
13	Correct	50 ms	5524 KB	Output is correct
14	Correct	51 ms	5508 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

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

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	332 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	1 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	0 ms	204 KB	Output is correct
10	Correct	2 ms	332 KB	Output is correct
11	Correct	55 ms	5496 KB	Output is correct
12	Correct	57 ms	5552 KB	Output is correct
13	Correct	50 ms	5524 KB	Output is correct
14	Correct	51 ms	5508 KB	Output is correct
15	Incorrect	0 ms	204 KB	Output isn't correct
16	Halted	0 ms	0 KB	-