Submission #718126

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
718126	2023-04-03T11:42:03 Z	mychecksedad	Self Study (JOI22_ho_t2)	C++17	0 / 100	502 ms	13332 KB

Main

/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e6, M = 1e5+10, K = 20;


ll n, m, c, ls, rs, s;
array<ll, 2> a[N];
vector<array<ll, 2>> lt, rt;
void solve(){
  cin >> n >> m;
  for(int i = 0; i < n; ++i) cin >> a[i][0];
  for(int i = 0; i < n; ++i) cin >> a[i][1];

  for(int i = 0; i < n; ++i){
    if(a[i][0] >= a[i][1])
      lt.pb(a[i]);
    else
      rt.pb(a[i]);
  }

  ls = lt.size();
  rs = rt.size();

  ll l = 0, r = 2e18, ans = 0;

  while(l <= r){
    ll mid = (l+r) >> 1;

    s = 0;
    for(int i = 0; i < ls; ++i){
      c = (mid + lt[i][0] - 1) / lt[i][0]; 
      if(c > m){
        s -= (mid - lt[i][0] * m + (lt[i][1] - 1)) / lt[i][1];
      }else{
        s += m - c;
      }
    }

    for(int i = 0; i < rs; ++i){
      if(mid - m * rt[i][1] > 0){
        s -= (mid - m * rt[i][1] + (rt[i][1] - 1)) / rt[i][1];
      }else{
        s += m - (mid + rt[i][1] - 1) / rt[i][1];
      }
    }


    if(s >= 0){
      l = mid + 1;
      ans = mid;
    }else{
      r = mid - 1;
    }
  }

  cout << ans;
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int T = 1, aa;
  // cin >> T;aa=T;
  while(T--){
    // cout << "Case #" << aa-T << ": ";
    solve();
  }
  return 0;
 
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:69:14: warning: unused variable 'aa' [-Wunused-variable]
   69 |   int T = 1, aa;
      |              ^~

Subtask #1

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	226 ms	11296 KB	Output is correct
12	Correct	206 ms	11376 KB	Output is correct
13	Correct	165 ms	13332 KB	Output is correct
14	Incorrect	502 ms	13312 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	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	1 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	121 ms	6876 KB	Output is correct
10	Correct	80 ms	4048 KB	Output is correct
11	Correct	60 ms	3600 KB	Output is correct
12	Correct	49 ms	2388 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	Incorrect	9 ms	596 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	226 ms	11296 KB	Output is correct
12	Correct	206 ms	11376 KB	Output is correct
13	Correct	165 ms	13332 KB	Output is correct
14	Incorrect	502 ms	13312 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	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	1 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	121 ms	6876 KB	Output is correct
10	Correct	80 ms	4048 KB	Output is correct
11	Correct	60 ms	3600 KB	Output is correct
12	Correct	49 ms	2388 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 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	Incorrect	9 ms	596 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	226 ms	11296 KB	Output is correct
12	Correct	206 ms	11376 KB	Output is correct
13	Correct	165 ms	13332 KB	Output is correct
14	Incorrect	502 ms	13312 KB	Output isn't correct
15	Halted	0 ms	0 KB	-