oj.uz

Submission #896779

# Submission time Handle Problem Language Result Execution time Memory
896779 2024-01-02T06:14:08 Z thunopro Self Study (JOI22_ho_t2) C++14
100 / 100
 275 ms 9260 KB 
#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 (b[i] >= a[i]) day -= (mid + b[i] - 1) / b[i];
        else {
            ll take = min(1ll*m, (mid + a[i] - 1) / a[i]);
            day -= take + (max(mid - take * a[i], 0LL) + b[i] - 1) / b[i];
        }
        if ( day < 0 ) return false ; 
	}
	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 = 1 , r = 1e18; 
	ll res = 1 ; 
	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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 3 ms 2396 KB Output is correct
11 Correct 97 ms 2652 KB Output is correct
12 Correct 100 ms 2652 KB Output is correct
13 Correct 67 ms 2648 KB Output is correct
14 Correct 75 ms 2788 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 25 ms 2788 KB Output is correct
17 Correct 91 ms 9260 KB Output is correct
18 Correct 80 ms 8396 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 25 ms 2788 KB Output is correct
3 Correct 91 ms 9260 KB Output is correct
4 Correct 80 ms 8396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 41 ms 2516 KB Output is correct
14 Correct 28 ms 2652 KB Output is correct
15 Correct 20 ms 2648 KB Output is correct
16 Correct 17 ms 2688 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 2 ms 2532 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 3 ms 2396 KB Output is correct
11 Correct 97 ms 2652 KB Output is correct
12 Correct 100 ms 2652 KB Output is correct
13 Correct 67 ms 2648 KB Output is correct
14 Correct 75 ms 2788 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 41 ms 2516 KB Output is correct
24 Correct 28 ms 2652 KB Output is correct
25 Correct 20 ms 2648 KB Output is correct
26 Correct 17 ms 2688 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 2532 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 25 ms 2788 KB Output is correct
36 Correct 91 ms 9260 KB Output is correct
37 Correct 80 ms 8396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 3 ms 2396 KB Output is correct
46 Correct 4 ms 2692 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 19 ms 3664 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 2 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2392 KB Output is correct
54 Correct 2 ms 2392 KB Output is correct
55 Correct 53 ms 5536 KB Output is correct
56 Correct 26 ms 3948 KB Output is correct
57 Correct 28 ms 3932 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 41 ms 2516 KB Output is correct
10 Correct 28 ms 2652 KB Output is correct
11 Correct 20 ms 2648 KB Output is correct
12 Correct 17 ms 2688 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 2 ms 2532 KB Output is correct
20 Correct 0 ms 2396 KB Output is correct
21 Correct 25 ms 2788 KB Output is correct
22 Correct 91 ms 9260 KB Output is correct
23 Correct 80 ms 8396 KB Output is correct
24 Correct 26 ms 3420 KB Output is correct
25 Correct 62 ms 5212 KB Output is correct
26 Correct 12 ms 3248 KB Output is correct
27 Correct 80 ms 8584 KB Output is correct
28 Correct 83 ms 8528 KB Output is correct
29 Correct 86 ms 8528 KB Output is correct
30 Correct 108 ms 8528 KB Output is correct
31 Correct 179 ms 8532 KB Output is correct
32 Correct 103 ms 4148 KB Output is correct
33 Correct 207 ms 9044 KB Output is correct
34 Correct 107 ms 4080 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 3 ms 2396 KB Output is correct
11 Correct 97 ms 2652 KB Output is correct
12 Correct 100 ms 2652 KB Output is correct
13 Correct 67 ms 2648 KB Output is correct
14 Correct 75 ms 2788 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2392 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 41 ms 2516 KB Output is correct
24 Correct 28 ms 2652 KB Output is correct
25 Correct 20 ms 2648 KB Output is correct
26 Correct 17 ms 2688 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 2 ms 2532 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2392 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 3 ms 2396 KB Output is correct
42 Correct 4 ms 2692 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 19 ms 3664 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 2 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2392 KB Output is correct
50 Correct 2 ms 2392 KB Output is correct
51 Correct 53 ms 5536 KB Output is correct
52 Correct 26 ms 3948 KB Output is correct
53 Correct 28 ms 3932 KB Output is correct
54 Correct 26 ms 3420 KB Output is correct
55 Correct 62 ms 5212 KB Output is correct
56 Correct 12 ms 3248 KB Output is correct
57 Correct 80 ms 8584 KB Output is correct
58 Correct 83 ms 8528 KB Output is correct
59 Correct 86 ms 8528 KB Output is correct
60 Correct 108 ms 8528 KB Output is correct
61 Correct 179 ms 8532 KB Output is correct
62 Correct 103 ms 4148 KB Output is correct
63 Correct 207 ms 9044 KB Output is correct
64 Correct 107 ms 4080 KB Output is correct
65 Correct 0 ms 2396 KB Output is correct
66 Correct 25 ms 2788 KB Output is correct
67 Correct 91 ms 9260 KB Output is correct
68 Correct 80 ms 8396 KB Output is correct
69 Correct 23 ms 3160 KB Output is correct
70 Correct 6 ms 2652 KB Output is correct
71 Correct 1 ms 2392 KB Output is correct
72 Correct 34 ms 3420 KB Output is correct
73 Correct 7 ms 2516 KB Output is correct
74 Correct 2 ms 2396 KB Output is correct
75 Correct 107 ms 8408 KB Output is correct
76 Correct 120 ms 8528 KB Output is correct
77 Correct 132 ms 8364 KB Output is correct
78 Correct 174 ms 8532 KB Output is correct
79 Correct 226 ms 8528 KB Output is correct
80 Correct 236 ms 8532 KB Output is correct
81 Correct 194 ms 6744 KB Output is correct
82 Correct 275 ms 6348 KB Output is correct