oj.uz

Submission #712731

# Submission time Handle Problem Language Result Execution time Memory
712731 2023-03-19T15:22:27 Z epicci23 Self Study (JOI22_ho_t2) C++17
100 / 100
 385 ms 5000 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in(),m=in();

  pii arr[n+1];
  for(int i=1;i<=n;i++) arr[i].ff=in();
  for(int i=1;i<=n;i++) arr[i].ss=in();
  
  for(int i=1;i<=n;i++) arr[i].ff=max(arr[i].ff,arr[i].ss);

  int l=0,r=INF;
  while(l<r)
  {
    int mid=(l+r+1)/2;
    int tot=n*m;
    bool ok=1;
    for(int i=1;i<=n;i++)
    {
       int hf=min(m,(mid+arr[i].ff-1)/arr[i].ff);
       int x=hf*arr[i].ff;
       tot-=hf;
       if(mid>x) tot-=(mid-x+arr[i].ss-1)/arr[i].ss;
       if(tot<0) ok=0;
    }
    if(ok) l=mid;
    else r=mid-1;
  }

  cout << l << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
10.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 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 1 ms 212 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 240 ms 4996 KB Output is correct
12 Correct 237 ms 4992 KB Output is correct
13 Correct 249 ms 4992 KB Output is correct
14 Correct 296 ms 4996 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 367 ms 4948 KB Output is correct
17 Correct 266 ms 4992 KB Output is correct
18 Correct 265 ms 4992 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 367 ms 4948 KB Output is correct
3 Correct 266 ms 4992 KB Output is correct
4 Correct 265 ms 4992 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 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 130 ms 2644 KB Output is correct
14 Correct 84 ms 1876 KB Output is correct
15 Correct 58 ms 1468 KB Output is correct
16 Correct 49 ms 1236 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 7 ms 340 KB Output is correct
23 Correct 5 ms 388 KB Output is correct

Subtask #3
27.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 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 1 ms 212 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 240 ms 4996 KB Output is correct
12 Correct 237 ms 4992 KB Output is correct
13 Correct 249 ms 4992 KB Output is correct
14 Correct 296 ms 4996 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 130 ms 2644 KB Output is correct
24 Correct 84 ms 1876 KB Output is correct
25 Correct 58 ms 1468 KB Output is correct
26 Correct 49 ms 1236 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 5 ms 388 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 367 ms 4948 KB Output is correct
36 Correct 266 ms 4992 KB Output is correct
37 Correct 265 ms 4992 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 5 ms 340 KB Output is correct
46 Correct 8 ms 340 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 41 ms 1108 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 5 ms 388 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 127 ms 2636 KB Output is correct
56 Correct 81 ms 1876 KB Output is correct
57 Correct 98 ms 1876 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory 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 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 130 ms 2644 KB Output is correct
10 Correct 84 ms 1876 KB Output is correct
11 Correct 58 ms 1468 KB Output is correct
12 Correct 49 ms 1236 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 7 ms 340 KB Output is correct
19 Correct 5 ms 388 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 367 ms 4948 KB Output is correct
22 Correct 266 ms 4992 KB Output is correct
23 Correct 265 ms 4992 KB Output is correct
24 Correct 40 ms 1100 KB Output is correct
25 Correct 117 ms 2400 KB Output is correct
26 Correct 27 ms 724 KB Output is correct
27 Correct 229 ms 4948 KB Output is correct
28 Correct 243 ms 4996 KB Output is correct
29 Correct 266 ms 4992 KB Output is correct
30 Correct 244 ms 4992 KB Output is correct
31 Correct 258 ms 4988 KB Output is correct
32 Correct 368 ms 4948 KB Output is correct
33 Correct 259 ms 4992 KB Output is correct
34 Correct 385 ms 5000 KB Output is correct

Subtask #5
9.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 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 1 ms 212 KB Output is correct
10 Correct 4 ms 340 KB Output is correct
11 Correct 240 ms 4996 KB Output is correct
12 Correct 237 ms 4992 KB Output is correct
13 Correct 249 ms 4992 KB Output is correct
14 Correct 296 ms 4996 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 130 ms 2644 KB Output is correct
24 Correct 84 ms 1876 KB Output is correct
25 Correct 58 ms 1468 KB Output is correct
26 Correct 49 ms 1236 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 7 ms 340 KB Output is correct
33 Correct 5 ms 388 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 5 ms 340 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 41 ms 1108 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 5 ms 388 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 127 ms 2636 KB Output is correct
52 Correct 81 ms 1876 KB Output is correct
53 Correct 98 ms 1876 KB Output is correct
54 Correct 40 ms 1100 KB Output is correct
55 Correct 117 ms 2400 KB Output is correct
56 Correct 27 ms 724 KB Output is correct
57 Correct 229 ms 4948 KB Output is correct
58 Correct 243 ms 4996 KB Output is correct
59 Correct 266 ms 4992 KB Output is correct
60 Correct 244 ms 4992 KB Output is correct
61 Correct 258 ms 4988 KB Output is correct
62 Correct 368 ms 4948 KB Output is correct
63 Correct 259 ms 4992 KB Output is correct
64 Correct 385 ms 5000 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 367 ms 4948 KB Output is correct
67 Correct 266 ms 4992 KB Output is correct
68 Correct 265 ms 4992 KB Output is correct
69 Correct 28 ms 724 KB Output is correct
70 Correct 7 ms 340 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 41 ms 980 KB Output is correct
73 Correct 9 ms 468 KB Output is correct
74 Correct 1 ms 212 KB Output is correct
75 Correct 266 ms 4992 KB Output is correct
76 Correct 239 ms 4948 KB Output is correct
77 Correct 251 ms 4988 KB Output is correct
78 Correct 254 ms 4948 KB Output is correct
79 Correct 266 ms 4996 KB Output is correct
80 Correct 259 ms 4988 KB Output is correct
81 Correct 230 ms 4992 KB Output is correct
82 Correct 243 ms 4988 KB Output is correct