Submission #718117

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
718117	2023-04-03T11:28:30 Z	mychecksedad	Self Study (JOI22_ho_t2)	C++17	0 / 100	490 ms	15452 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 = 3e5+100, 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]);
  }

  sort(all(lt), [&](const array<ll, 2> &x, const array<ll, 2> &y){
    return x[0] > y[0];
  });

  sort(all(rt), [&](const array<ll, 2> &x, const array<ll, 2> &y){
    return x[1] > y[1];
  });

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

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

  while(l <= r){
    ll mid = (l+r) >> 1;
    bool ok = 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;
      }
    }
    if(rs == 0){
      if(s < 0){
        ok = 0;
      }else{
        ok = 1;
      }
    }else{
      ll req = 0;
      for(int i = 0; i < rs; ++i){
        ll q = (mid - m * rt[i][1] + (rt[i][1] - 1)) / rt[i][1];
        if(q >= 0)
          req += q;
        else
          s += -q;
      }
      s -= req;
    }


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

  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();
    cout << '\n';
  }
  return 0;
 
}

Compilation message

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

Subtask #1

0 / 10.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	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	4 ms	596 KB	Output is correct
11	Correct	222 ms	13420 KB	Output is correct
12	Correct	231 ms	13600 KB	Output is correct
13	Correct	170 ms	15452 KB	Output is correct
14	Incorrect	490 ms	15380 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
9	Correct	143 ms	9052 KB	Output is correct
10	Correct	84 ms	5960 KB	Output is correct
11	Correct	65 ms	5108 KB	Output is correct
12	Correct	55 ms	3528 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	0 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	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	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	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	4 ms	596 KB	Output is correct
11	Correct	222 ms	13420 KB	Output is correct
12	Correct	231 ms	13600 KB	Output is correct
13	Correct	170 ms	15452 KB	Output is correct
14	Incorrect	490 ms	15380 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	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 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	1 ms	212 KB	Output is correct
9	Correct	143 ms	9052 KB	Output is correct
10	Correct	84 ms	5960 KB	Output is correct
11	Correct	65 ms	5108 KB	Output is correct
12	Correct	55 ms	3528 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Correct	0 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	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	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	1 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	4 ms	596 KB	Output is correct
11	Correct	222 ms	13420 KB	Output is correct
12	Correct	231 ms	13600 KB	Output is correct
13	Correct	170 ms	15452 KB	Output is correct
14	Incorrect	490 ms	15380 KB	Output isn't correct
15	Halted	0 ms	0 KB	-