Submission #766425

# Submission time Handle Problem Language Result Execution time Memory
766425 2023-06-25T16:02:40 Z HoriaHaivas Self Study (JOI22_ho_t2) C++14
10 / 100
93 ms 5256 KB
/*
    "TLE is like the wind, always by my side"
    - Yasuo - 2022 -
*/
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast")
#define int long long

using namespace std;

int n,m,i,j,r,pas;
int a[300005];
int b[300005];

int courseneed(int val, int course, int study)
{
    int ans;
    ans=0;
    if (course*m<val)
    {
        ans+=m;
        val-=course*m;
        if (val%study==0)
            ans+=val/study;
        else
            ans+=val/study+1;
    }
    else
    {
        if (val%course==0)
            ans+=val/course;
        else
            ans+=val/course+1;
    }
    return ans;
}

bool possible(int minimum)
{
    int sum;
    sum=0;
    for (i=1;i<=n;i++)
    {
         sum+=courseneed(minimum,a[i],b[i]);
    }
    if (sum<=n*m)
        return 1;
    return 0;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for (i=1;i<=n;i++)
    {
         cin >> a[i];
    }
    for (i=1;i<=n;i++)
    {
         cin >> b[i];
    }
    for (i=1;i<=n;i++)
    {
         a[i]=max(a[i],b[i]);
    }
    r=0;
    pas=(1LL<<32);
    while (pas)
    {
         if (possible(r+pas))
             r+=pas;
         pas=pas/2;
    }
    cout << r;
}
# 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 1 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 2 ms 340 KB Output is correct
11 Correct 87 ms 4968 KB Output is correct
12 Correct 87 ms 5004 KB Output is correct
13 Correct 78 ms 5000 KB Output is correct
14 Correct 90 ms 5004 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 91 ms 5200 KB Output is correct
17 Correct 93 ms 5176 KB Output is correct
18 Correct 89 ms 5256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 91 ms 5200 KB Output is correct
3 Correct 93 ms 5176 KB Output is correct
4 Correct 89 ms 5256 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 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 51 ms 2668 KB Output is correct
14 Correct 29 ms 1900 KB Output is correct
15 Correct 22 ms 1388 KB Output is correct
16 Correct 18 ms 1276 KB Output is correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Halted 0 ms 0 KB -
# 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 1 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 2 ms 340 KB Output is correct
11 Correct 87 ms 4968 KB Output is correct
12 Correct 87 ms 5004 KB Output is correct
13 Correct 78 ms 5000 KB Output is correct
14 Correct 90 ms 5004 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 51 ms 2668 KB Output is correct
24 Correct 29 ms 1900 KB Output is correct
25 Correct 22 ms 1388 KB Output is correct
26 Correct 18 ms 1276 KB Output is correct
27 Incorrect 1 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 51 ms 2668 KB Output is correct
10 Correct 29 ms 1900 KB Output is correct
11 Correct 22 ms 1388 KB Output is correct
12 Correct 18 ms 1276 KB Output is correct
13 Incorrect 1 ms 340 KB Output isn't correct
14 Halted 0 ms 0 KB -
# 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 1 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 2 ms 340 KB Output is correct
11 Correct 87 ms 4968 KB Output is correct
12 Correct 87 ms 5004 KB Output is correct
13 Correct 78 ms 5000 KB Output is correct
14 Correct 90 ms 5004 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 51 ms 2668 KB Output is correct
24 Correct 29 ms 1900 KB Output is correct
25 Correct 22 ms 1388 KB Output is correct
26 Correct 18 ms 1276 KB Output is correct
27 Incorrect 1 ms 340 KB Output isn't correct
28 Halted 0 ms 0 KB -