Submission #766433

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
766433	2023-06-25T16:09:41 Z	HoriaHaivas	Self Study (JOI22_ho_t2)	C++14	0 / 100	146 ms	4996 KB

Main

/*
    "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<<59);
    while (pas)
    {
         if (r+pas<=(1LL<<59) && possible(r+pas))
             r+=pas;
         pas=pas/2;
    }
    cout << r;
}

Subtask #1

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	1 ms	212 KB	Output is correct
7	Correct	0 ms	224 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	3 ms	340 KB	Output is correct
11	Correct	146 ms	4920 KB	Output is correct
12	Correct	144 ms	4996 KB	Output is correct
13	Correct	134 ms	4880 KB	Output is correct
14	Incorrect	39 ms	4996 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2

0 / 25.0

#	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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	72 ms	2664 KB	Output is correct
10	Correct	48 ms	1892 KB	Output is correct
11	Correct	37 ms	1504 KB	Output is correct
12	Correct	29 ms	1236 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	4 ms	340 KB	Output isn't correct
19	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	1 ms	212 KB	Output is correct
7	Correct	0 ms	224 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	3 ms	340 KB	Output is correct
11	Correct	146 ms	4920 KB	Output is correct
12	Correct	144 ms	4996 KB	Output is correct
13	Correct	134 ms	4880 KB	Output is correct
14	Incorrect	39 ms	4996 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	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	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	72 ms	2664 KB	Output is correct
10	Correct	48 ms	1892 KB	Output is correct
11	Correct	37 ms	1504 KB	Output is correct
12	Correct	29 ms	1236 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	4 ms	340 KB	Output isn't correct
19	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	1 ms	212 KB	Output is correct
7	Correct	0 ms	224 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	3 ms	340 KB	Output is correct
11	Correct	146 ms	4920 KB	Output is correct
12	Correct	144 ms	4996 KB	Output is correct
13	Correct	134 ms	4880 KB	Output is correct
14	Incorrect	39 ms	4996 KB	Output isn't correct
15	Halted	0 ms	0 KB	-