Submission #896768

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
896768	2024-01-02T06:04:46 Z	thunopro	Self Study (JOI22_ho_t2)	C++14	0 / 100	199 ms	8788 KB

Main

#include<bits/stdc++.h>
using namespace std ; 
#define maxn 300009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1

const int mod = 1e9+7 ; 
const int INF = 1e9 ;
const int LOG = 18 ; 

typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 

void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}

void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}

int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow ( a , n / 2 ) ; 
	if ( n % 2 ) return ( 1ll * res * res % mod * a % mod ) ; 
	else return ( 1ll * res * res % mod ) ; 
}

int n , m ; 
int a [maxn] , b [maxn] ; 

bool check ( ll mid ) 
{
	ll day = 1ll*n*m ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( a [i] < b [i] ) 
		{
			day -= (mid+b[i]-1)/b[i] ;  
		}
		else 
		{
			if ( 1ll*m*a[i] >= mid ) 
			{
				day -= (mid+a[i]-1)/a[i] ; 
			}
			else 
			{
				day -= m ; 
				ll remain = mid - 1ll*a [i]*m ; 
				day -= (remain+b[i]-1)/b[i] ; 
			}
		}
	}
	return (day>=0) ; 
}
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ;
	cin >> n >> m ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	for ( int i = 1 ; i <= n ; i ++ ) cin >> b [i] ; 
	
	ll l = 0 , r = 1e15 ; 
	ll res = 0 ; 
	while ( l <= r ) 
	{
		ll mid = (l+r)/2 ; 
		if ( check (mid) ) res = mid , l = mid + 1 ; 
		else r = mid - 1 ; 
	}
	cout << res ; 
}




//-std=c++11 
// check special 
// range , time , error , stay hard stay hard 
// there is no tomorrow

Compilation message

Main.cpp: In function 'void rf()':
Main.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2396 KB	Output is correct
11	Correct	122 ms	8596 KB	Output is correct
12	Correct	126 ms	8788 KB	Output is correct
13	Correct	107 ms	6480 KB	Output is correct
14	Incorrect	199 ms	6484 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	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2508 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	2 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	60 ms	5368 KB	Output is correct
10	Correct	46 ms	4600 KB	Output is correct
11	Correct	30 ms	3928 KB	Output is correct
12	Correct	24 ms	3676 KB	Output is correct
13	Correct	1 ms	2516 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2484 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	3 ms	2396 KB	Output is correct
19	Correct	3 ms	2392 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Incorrect	188 ms	3956 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #3
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2396 KB	Output is correct
11	Correct	122 ms	8596 KB	Output is correct
12	Correct	126 ms	8788 KB	Output is correct
13	Correct	107 ms	6480 KB	Output is correct
14	Incorrect	199 ms	6484 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	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	0 ms	2508 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	2 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	0 ms	2396 KB	Output is correct
9	Correct	60 ms	5368 KB	Output is correct
10	Correct	46 ms	4600 KB	Output is correct
11	Correct	30 ms	3928 KB	Output is correct
12	Correct	24 ms	3676 KB	Output is correct
13	Correct	1 ms	2516 KB	Output is correct
14	Correct	1 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	1 ms	2484 KB	Output is correct
17	Correct	1 ms	2392 KB	Output is correct
18	Correct	3 ms	2396 KB	Output is correct
19	Correct	3 ms	2392 KB	Output is correct
20	Correct	1 ms	2392 KB	Output is correct
21	Incorrect	188 ms	3956 KB	Output isn't correct
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2392 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	0 ms	2396 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	2 ms	2396 KB	Output is correct
11	Correct	122 ms	8596 KB	Output is correct
12	Correct	126 ms	8788 KB	Output is correct
13	Correct	107 ms	6480 KB	Output is correct
14	Incorrect	199 ms	6484 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Submission #896768

Compilation message

Subtask #1 0 / 10.0

Subtask #2 0 / 25.0

Subtask #3 0 / 27.0

Subtask #4 0 / 29.0

Subtask #5 0 / 9.0

Subtask #1
0 / 10.0

Subtask #2
0 / 25.0

Subtask #3
0 / 27.0

Subtask #4
0 / 29.0

Subtask #5
0 / 9.0