Submission #940321

# Submission time Handle Problem Language Result Execution time Memory
940321 2024-03-07T08:00:02 Z vjudge1 Self Study (JOI22_ho_t2) C++17
10 / 100
56 ms 6188 KB
#include <bits/stdc++.h>

using namespace std;

#ifdef ngu
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = (int) 3e5 + 5;

int n, m;
int a[N];
int b[N];

namespace sub1 {
    bool valid_input() {
        return m == 1;
    }

    void solve() {
        int res = 1e9;
        for (int i = 1; i <= n; ++i) {
            res = min(res, max(a[i], b[i]));
        }
        cout << res;
        exit(0);
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef ngu
    freopen("test.inp", "r", stdin);
    freopen("test.out", "w", stdout);
    #endif
    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; ++i) {
        cin >> b[i];
    }
    if (sub1::valid_input()) {
        sub1::solve();
    }
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2512 KB Output is correct
4 Correct 1 ms 2508 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 55 ms 5688 KB Output is correct
12 Correct 50 ms 5684 KB Output is correct
13 Correct 39 ms 4828 KB Output is correct
14 Correct 41 ms 4752 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 27 ms 3396 KB Output is correct
17 Correct 56 ms 6188 KB Output is correct
18 Correct 54 ms 5856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 27 ms 3396 KB Output is correct
3 Correct 56 ms 6188 KB Output is correct
4 Correct 54 ms 5856 KB Output is correct
5 Incorrect 1 ms 2396 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2512 KB Output is correct
4 Correct 1 ms 2508 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 55 ms 5688 KB Output is correct
12 Correct 50 ms 5684 KB Output is correct
13 Correct 39 ms 4828 KB Output is correct
14 Correct 41 ms 4752 KB Output is correct
15 Incorrect 1 ms 2396 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2512 KB Output is correct
4 Correct 1 ms 2508 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2392 KB Output is correct
11 Correct 55 ms 5688 KB Output is correct
12 Correct 50 ms 5684 KB Output is correct
13 Correct 39 ms 4828 KB Output is correct
14 Correct 41 ms 4752 KB Output is correct
15 Incorrect 1 ms 2396 KB Output isn't correct
16 Halted 0 ms 0 KB -