oj.uz

답안 #712709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712709 2023-03-19T14:00:40 Z epicci23 Self Study (JOI22_ho_t2) C++17
25 / 100
 440 ms 5068 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

# 결과 실행 시간 메모리 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 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 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 217 ms 4948 KB Output is correct
12 Correct 218 ms 4948 KB Output is correct
13 Correct 159 ms 4992 KB Output is correct
14 Incorrect 440 ms 5068 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 95 ms 2648 KB Output is correct
10 Correct 65 ms 1876 KB Output is correct
11 Correct 43 ms 1472 KB Output is correct
12 Correct 34 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 1 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 Correct 4 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 211 ms 4996 KB Output is correct
22 Correct 204 ms 4992 KB Output is correct
23 Correct 167 ms 4992 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 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 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 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 217 ms 4948 KB Output is correct
12 Correct 218 ms 4948 KB Output is correct
13 Correct 159 ms 4992 KB Output is correct
14 Incorrect 440 ms 5068 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 95 ms 2648 KB Output is correct
10 Correct 65 ms 1876 KB Output is correct
11 Correct 43 ms 1472 KB Output is correct
12 Correct 34 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 1 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 Correct 4 ms 340 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 211 ms 4996 KB Output is correct
22 Correct 204 ms 4992 KB Output is correct
23 Correct 167 ms 4992 KB Output is correct
24 Correct 33 ms 980 KB Output is correct
25 Correct 89 ms 2400 KB Output is correct
26 Correct 18 ms 724 KB Output is correct
27 Correct 171 ms 4996 KB Output is correct
28 Correct 168 ms 4948 KB Output is correct
29 Correct 190 ms 4948 KB Output is correct
30 Correct 178 ms 4948 KB Output is correct
31 Correct 229 ms 4992 KB Output is correct
32 Incorrect 270 ms 4992 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 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 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 0 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 217 ms 4948 KB Output is correct
12 Correct 218 ms 4948 KB Output is correct
13 Correct 159 ms 4992 KB Output is correct
14 Incorrect 440 ms 5068 KB Output isn't correct
15 Halted 0 ms 0 KB -