Submission #815923

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
815923	2023-08-09T02:34:58 Z	vjudge1	Self Study (JOI22_ho_t2)	C++17	10 / 100	50 ms	11400 KB

Main

#include <bits/stdc++.h>
#define int long long

using namespace std;

void open(){
	if(fopen("input.inp", "r")){
		freopen("input.inp", "r", stdin);
		//freopen("output.out", "w", stdout);
	}
}

const int maxn = 3e5 + 5;
int n, m;
int A[maxn], B[maxn];

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	open();
	cin >> n >> m;
	for(int i = 1; i <= n; i++){
		cin >> A[i];
	}

	for(int i = 1; i <= n; i++){
		cin >> B[i];
	}

	if(m == 1){
		int result = 1e9 + 7;
		for(int i = 1; i <= n; i++){
			result = min(result, max(A[i], B[i]));
		}

		cout << result << endl;
		return 0;
	}

	return 0;
}

Compilation message

Main.cpp: In function 'void open()':
Main.cpp:8:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |   freopen("input.inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	49 ms	8560 KB	Output is correct
12	Correct	48 ms	10800 KB	Output is correct
13	Correct	37 ms	8760 KB	Output is correct
14	Correct	38 ms	8700 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	24 ms	6128 KB	Output is correct
17	Correct	50 ms	11400 KB	Output is correct
18	Correct	47 ms	10700 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	24 ms	6128 KB	Output is correct
3	Correct	50 ms	11400 KB	Output is correct
4	Correct	47 ms	10700 KB	Output is correct
5	Incorrect	1 ms	212 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	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	49 ms	8560 KB	Output is correct
12	Correct	48 ms	10800 KB	Output is correct
13	Correct	37 ms	8760 KB	Output is correct
14	Correct	38 ms	8700 KB	Output is correct
15	Incorrect	1 ms	212 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	212 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	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	49 ms	8560 KB	Output is correct
12	Correct	48 ms	10800 KB	Output is correct
13	Correct	37 ms	8760 KB	Output is correct
14	Correct	38 ms	8700 KB	Output is correct
15	Incorrect	1 ms	212 KB	Output isn't correct
16	Halted	0 ms	0 KB	-