답안 #718120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718120	2023-04-03T11:32:21 Z	mychecksedad	Self Study (JOI22_ho_t2)	C++17	0 / 100	484 ms	13304 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{
      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(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:87:14: warning: unused variable 'aa' [-Wunused-variable]
   87 |   int T = 1, aa;
      |              ^~

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	1 ms	256 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	236 ms	11292 KB	Output is correct
12	Correct	218 ms	11384 KB	Output is correct
13	Correct	162 ms	13304 KB	Output is correct
14	Incorrect	484 ms	13248 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	133 ms	6912 KB	Output is correct
10	Correct	85 ms	4040 KB	Output is correct
11	Correct	64 ms	3684 KB	Output is correct
12	Correct	55 ms	2328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	10 ms	596 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	1 ms	256 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	236 ms	11292 KB	Output is correct
12	Correct	218 ms	11384 KB	Output is correct
13	Correct	162 ms	13304 KB	Output is correct
14	Incorrect	484 ms	13248 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #4
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 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	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	133 ms	6912 KB	Output is correct
10	Correct	85 ms	4040 KB	Output is correct
11	Correct	64 ms	3684 KB	Output is correct
12	Correct	55 ms	2328 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Incorrect	10 ms	596 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #5
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	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	1 ms	256 KB	Output is correct
10	Correct	4 ms	468 KB	Output is correct
11	Correct	236 ms	11292 KB	Output is correct
12	Correct	218 ms	11384 KB	Output is correct
13	Correct	162 ms	13304 KB	Output is correct
14	Incorrect	484 ms	13248 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

답안 #718120

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