oj.uz

Submission #712695

# Submission time Handle Problem Language Result Execution time Memory
712695 2023-03-19T13:39:22 Z epicci23 Self Study (JOI22_ho_t2) C++17
25 / 100
 813 ms 11460 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((mid+h-1)/h>n*m) ok=0;
     if(arr[i].ss>arr[i].ff)
     {
      ekstra+=m;
      need+=(mid+arr[i].ss-1)/arr[i].ss;
     }
     else
     {
       if((mid+arr[i].ff-1)/arr[i].ff>m)
       {
        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 1 ms 212 KB Output is correct
3 Correct 1 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 1 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 5 ms 340 KB Output is correct
11 Correct 320 ms 5004 KB Output is correct
12 Correct 326 ms 4988 KB Output is correct
13 Correct 297 ms 5000 KB Output is correct
14 Incorrect 577 ms 4992 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 1 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 0 ms 216 KB Output is correct
9 Correct 185 ms 2648 KB Output is correct
10 Correct 134 ms 1884 KB Output is correct
11 Correct 90 ms 1468 KB Output is correct
12 Correct 73 ms 1236 KB Output is correct
13 Correct 2 ms 212 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 1 ms 212 KB Output is correct
18 Correct 11 ms 392 KB Output is correct
19 Correct 8 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 598 ms 6164 KB Output is correct
22 Correct 420 ms 11460 KB Output is correct
23 Correct 381 ms 10808 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 1 ms 212 KB Output is correct
3 Correct 1 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 1 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 5 ms 340 KB Output is correct
11 Correct 320 ms 5004 KB Output is correct
12 Correct 326 ms 4988 KB Output is correct
13 Correct 297 ms 5000 KB Output is correct
14 Incorrect 577 ms 4992 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 1 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 0 ms 216 KB Output is correct
9 Correct 185 ms 2648 KB Output is correct
10 Correct 134 ms 1884 KB Output is correct
11 Correct 90 ms 1468 KB Output is correct
12 Correct 73 ms 1236 KB Output is correct
13 Correct 2 ms 212 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 1 ms 212 KB Output is correct
18 Correct 11 ms 392 KB Output is correct
19 Correct 8 ms 468 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 598 ms 6164 KB Output is correct
22 Correct 420 ms 11460 KB Output is correct
23 Correct 381 ms 10808 KB Output is correct
24 Correct 71 ms 1916 KB Output is correct
25 Correct 198 ms 5000 KB Output is correct
26 Correct 46 ms 1400 KB Output is correct
27 Correct 402 ms 10804 KB Output is correct
28 Correct 398 ms 10800 KB Output is correct
29 Correct 409 ms 10800 KB Output is correct
30 Correct 412 ms 10796 KB Output is correct
31 Correct 458 ms 10808 KB Output is correct
32 Incorrect 813 ms 6168 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 1 ms 212 KB Output is correct
3 Correct 1 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 1 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 5 ms 340 KB Output is correct
11 Correct 320 ms 5004 KB Output is correct
12 Correct 326 ms 4988 KB Output is correct
13 Correct 297 ms 5000 KB Output is correct
14 Incorrect 577 ms 4992 KB Output isn't correct
15 Halted 0 ms 0 KB -