Submission #914864

# Submission time Handle Problem Language Result Execution time Memory
914864 2024-01-22T19:03:54 Z andrei_iorgulescu Self Study (JOI22_ho_t2) C++14
10 / 100
48 ms 11600 KB
#include <bits/stdc++.h>

using namespace std;

#define int long long

int n,m,a[300005],b[300005],nev[300005];

int nrparti(int x,int y)
{
    if (x % y == 0)
        return x / y;
    return x / y + 1;
}

bool pot(int x)
{
    /*int extra = 0;
    for (int i = 1; i <= n; i++)
    {
        nev[i] = x;
        if (a[i] <= b[i])
            extra += m;
        else
        {
            if (x <= m * a[i])
            {
                extra += m - nrparti(x,a[i]);
                nev[i] = 0;
            }
            else
            {
                nev[i] = x - m * a[i];
            }
        }
    }
    for (int i = 1; i <= n; i++)
        extra -= nrparti(nev[i],b[i]);
    if (extra >= 0)
        return true;
    return false;*/
    int op = 0;
    for (int i = 1; i <= n; i++)
        op += nrparti(x,b[i]);
    if (op <= n * m)
        return true;
    return false;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> b[i];
    /*int st = 0,pas = 1ll << 60;
    while (pas != 0)
    {
        if (pot(st + pas) == true)
            st += pas;
        pas /= 2;
    }
    cout << st;*/
    int ans = 1e9;
    for (int i = 1; i <= n; i++)
        ans = min(ans,max(a[i],b[i]));
    cout << ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 45 ms 5240 KB Output is correct
12 Correct 46 ms 5248 KB Output is correct
13 Correct 34 ms 5208 KB Output is correct
14 Correct 34 ms 5208 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 24 ms 6408 KB Output is correct
17 Correct 48 ms 11600 KB Output is correct
18 Correct 47 ms 11000 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 24 ms 6408 KB Output is correct
3 Correct 48 ms 11600 KB Output is correct
4 Correct 47 ms 11000 KB Output is correct
5 Incorrect 1 ms 4444 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 45 ms 5240 KB Output is correct
12 Correct 46 ms 5248 KB Output is correct
13 Correct 34 ms 5208 KB Output is correct
14 Correct 34 ms 5208 KB Output is correct
15 Incorrect 1 ms 4444 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4444 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 2 ms 4692 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 2 ms 4444 KB Output is correct
11 Correct 45 ms 5240 KB Output is correct
12 Correct 46 ms 5248 KB Output is correct
13 Correct 34 ms 5208 KB Output is correct
14 Correct 34 ms 5208 KB Output is correct
15 Incorrect 1 ms 4444 KB Output isn't correct
16 Halted 0 ms 0 KB -