oj.uz

Submission #712722

# Submission time Handle Problem Language Result Execution time Memory
712722 2023-03-19T14:33:36 Z epicci23 Self Study (JOI22_ho_t2) C++17
25 / 100
 494 ms 5004 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();

  int l=0,r=4*INF;
  while(l<r)
  {
    int mid=(l+r+1)/2;
    bool ok=1;
    //cout << "l: " << l << " r: " << r << " mid: " << mid << endl;  
    int need=0,ekstra=0;
    for(int i=1;i<=n;i++)
    {
     int h=max(arr[i].ss,arr[i].ff);
     if(n*m<mid/h) ok=0;
     if(arr[i].ss>=arr[i].ff)
     {
      ekstra+=m;
      need+=(mid+arr[i].ss-1)/arr[i].ss;
     }
     else
     {
       if(mid>m*arr[i].ff)
       {
        int kalan=mid-arr[i].ff*m;
        need+=(kalan+arr[i].ss-1)/arr[i].ss;
       }
       else ekstra += m- (mid + arr[i].ff - 1)/arr[i].ff ;
     } 
    }
    if(need>n*m) ok=0;
    if(ekstra>=need && 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
0 / 10.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 0 ms 212 KB Output is correct
6 Correct 0 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 5 ms 340 KB Output is correct
11 Correct 276 ms 5000 KB Output is correct
12 Correct 275 ms 5000 KB Output is correct
13 Correct 274 ms 4992 KB Output is correct
14 Incorrect 419 ms 4988 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
25.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 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 1 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 147 ms 2652 KB Output is correct
10 Correct 97 ms 1876 KB Output is correct
11 Correct 69 ms 1364 KB Output is correct
12 Correct 55 ms 1140 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 7 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 375 ms 4988 KB Output is correct
22 Correct 289 ms 4948 KB Output is correct
23 Correct 307 ms 4992 KB Output is correct

Subtask #3
0 / 27.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 0 ms 212 KB Output is correct
6 Correct 0 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 5 ms 340 KB Output is correct
11 Correct 276 ms 5000 KB Output is correct
12 Correct 275 ms 5000 KB Output is correct
13 Correct 274 ms 4992 KB Output is correct
14 Incorrect 419 ms 4988 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 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 1 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 147 ms 2652 KB Output is correct
10 Correct 97 ms 1876 KB Output is correct
11 Correct 69 ms 1364 KB Output is correct
12 Correct 55 ms 1140 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 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 7 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 375 ms 4988 KB Output is correct
22 Correct 289 ms 4948 KB Output is correct
23 Correct 307 ms 4992 KB Output is correct
24 Correct 58 ms 1016 KB Output is correct
25 Correct 152 ms 2400 KB Output is correct
26 Correct 34 ms 788 KB Output is correct
27 Correct 286 ms 5004 KB Output is correct
28 Correct 284 ms 4996 KB Output is correct
29 Correct 292 ms 4988 KB Output is correct
30 Correct 307 ms 4988 KB Output is correct
31 Correct 392 ms 4948 KB Output is correct
32 Incorrect 494 ms 4988 KB Output isn't correct
33 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 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 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 5 ms 340 KB Output is correct
11 Correct 276 ms 5000 KB Output is correct
12 Correct 275 ms 5000 KB Output is correct
13 Correct 274 ms 4992 KB Output is correct
14 Incorrect 419 ms 4988 KB Output isn't correct
15 Halted 0 ms 0 KB -