oj.uz

Submission #1083046

# Submission time Handle Problem Language Result Execution time Memory
1083046 2024-09-02T10:49:41 Z steveonalex Self Study (JOI22_ho_t2) C++17
0 / 100
 129 ms 5144 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

ll di(ll a, ll b){
    return a / b + ((a % b) > 0);
}

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n; ll m; cin >> n >> m;
    vector<ll> a(n), b(n);
    for(int i = 0; i<n; ++i) cin >> a[i];
    for(int i = 0; i<n; ++i) cin >> b[i];


    ll mi = 1e18;
    for(int i = 0; i<n; ++i) minimize(mi, max(a[i], b[i]));

    ll l = 1, r = 1e18; 
    while(l < r){
        ll mid = (l + r + 1) >> 1;
        ll cnt = 0;
        bool check = true;
        for(int i = 0; i<n; ++i){
            ll cur = di(mid, max(a[i], b[i]));
            if (cur == 0) exit(1);
            if (cur <= m){
                cnt += m - cur;
            }
            else{
                check = false;
                ll fr = mid - max(a[i], b[i]) * m;
                cnt -= di(fr, b[i]);
            }
        }
        // if (check == false && cnt >= 0) exit(1);

        if (cnt >= 0) l = mid;
        else r = mid - 1;
    }

    cout << l << "\n";

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:76:14: warning: variable 'check' set but not used [-Wunused-but-set-variable]
   76 |         bool check = true;
      |              ^~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 105 ms 5144 KB Output is correct
12 Correct 106 ms 4952 KB Output is correct
13 Correct 106 ms 4952 KB Output is correct
14 Incorrect 129 ms 4952 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 62 ms 2652 KB Output is correct
10 Correct 37 ms 1884 KB Output is correct
11 Correct 28 ms 1628 KB Output is correct
12 Correct 23 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Incorrect 2 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 105 ms 5144 KB Output is correct
12 Correct 106 ms 4952 KB Output is correct
13 Correct 106 ms 4952 KB Output is correct
14 Incorrect 129 ms 4952 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 62 ms 2652 KB Output is correct
10 Correct 37 ms 1884 KB Output is correct
11 Correct 28 ms 1628 KB Output is correct
12 Correct 23 ms 1368 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Incorrect 2 ms 348 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 600 KB Output is correct
11 Correct 105 ms 5144 KB Output is correct
12 Correct 106 ms 4952 KB Output is correct
13 Correct 106 ms 4952 KB Output is correct
14 Incorrect 129 ms 4952 KB Output isn't correct
15 Halted 0 ms 0 KB -