oj.uz

Submission #828573

# Submission time Handle Problem Language Result Execution time Memory
828573 2023-08-17T11:32:44 Z green_gold_dog Self Study (JOI22_ho_t2) C++17
10 / 100
 58 ms 6304 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 3'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void solve() {
        ll n, m;
        cin >> n >> m;
        vector<ll> a(n), b(n);
        for (ll i = 0; i < n; i++) {
                cin >> a[i];
        }
        for (ll i = 0; i < n; i++) {
                cin >> b[i];
        }
        ll ans = INF64;
        for (ll i = 0; i < n; i++) {
                assign_min(ans, max(a[i], b[i]));
        }
        cout << ans << '\n';
        return;
        ll l = 0, r = INF64;
        while (r - l > 1) {
                ll mid = (l + r) / 2;
                ll nc = 0;
                for (ll i = 0; i < n; i++) {
                        ll need = mid;
                        if (a[i] > b[i]) {
                                ll can = min(m, (need + a[i] - 1) / a[i]);
                                need -= can * a[i];
                                nc += can;
                        }
                        if (need > 0) {
                                nc += (need + b[i] - 1) / b[i];
                        }
                }
                if (nc <= n * m) {
                        l = mid;
                } else {
                        r = mid;
                }
        }
        cout << l << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:92:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
Main.cpp:93:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4948 KB Output is correct
12 Correct 53 ms 4948 KB Output is correct
13 Correct 36 ms 5024 KB Output is correct
14 Correct 35 ms 4948 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 24 ms 6172 KB Output is correct
17 Correct 53 ms 6304 KB Output is correct
18 Correct 58 ms 6300 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 24 ms 6172 KB Output is correct
3 Correct 53 ms 6304 KB Output is correct
4 Correct 58 ms 6300 KB Output is correct
5 Incorrect 0 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 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4948 KB Output is correct
12 Correct 53 ms 4948 KB Output is correct
13 Correct 36 ms 5024 KB Output is correct
14 Correct 35 ms 4948 KB Output is correct
15 Incorrect 0 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 0 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 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 45 ms 4948 KB Output is correct
12 Correct 53 ms 4948 KB Output is correct
13 Correct 36 ms 5024 KB Output is correct
14 Correct 35 ms 4948 KB Output is correct
15 Incorrect 0 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -