oj.uz

Submission #969473

# Submission time Handle Problem Language Result Execution time Memory
969473 2024-04-25T08:26:33 Z modwwe Self Study (JOI22_ho_t2) C++17
0 / 100
 84 ms 6208 KB 
//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,sse,sse2")
#include<bits/stdc++.h>
#define int long long
//#define ll long long
#define down cout<<'\n';
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
void ngha();
const int mod2 = 1e9 + 7;
const int  mod1 = 998244353;
struct ib
{
    int a;
    int b;
};
struct icd
{
    int a, b;
};
struct ic
{
    int a, b, c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
int n, m, s1, s2, s4, s3, sf, k, r, mid, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, l;
int  i, s10, s12;
int el = 29;
main()
{
//#ifndef ONLINE_JUDGE
    //   fin(task),fou(task);
//#endif
    NHP
//modwwe
    //  cin>>res;
    ngha(), down
    checktime
}
int a[300001];
int b[300001];
 bool check(int x)
 { int sss=0;
      for(int i=1;i<=n;i++)
      {
           int ss2=x/a[i];
            if(x%a[i]!=0)ss2++;
             if(ss2<=m) sss+=m-ss2;
             else
             {
                int ss3=x-a[i]*m;

                int ss4=ss3/b[i];
                if(ss3%b[i]!=0)ss4++;
                sss-=ss4;
             }
      }
      return sss>=0;
 }
void ngha()
{
    cin >> n >> m;
    for(int i=1;i<=n;i++)
         cin>>a[i];
         s2=0;
     for(int i=1;i<=n;i++)
         cin>>b[i],
         a[i]=max(a[i],b[i]),s2=max(s2,a[i]);
     l=n;
     r=s2*m;
     while(l<=r)
     {
         int mid=l+r>>1;
          if(check(mid)) l=mid+1;
          else r=mid-1;
     }
     cout<<l-1;

}

Compilation message

Main.cpp:45:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   45 | main()
      | ^~~~
Main.cpp: In function 'void ngha()':
Main.cpp:79:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   79 |     for(int i=1;i<=n;i++)
      |     ^~~
Main.cpp:81:10: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   81 |          s2=0;
      |          ^~
Main.cpp:89:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   89 |          int mid=l+r>>1;
      |                  ~^~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 84 ms 4948 KB Output is correct
12 Correct 83 ms 4956 KB Output is correct
13 Correct 73 ms 4952 KB Output is correct
14 Correct 76 ms 4948 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 23 ms 6208 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 23 ms 6208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 84 ms 4948 KB Output is correct
12 Correct 83 ms 4956 KB Output is correct
13 Correct 73 ms 4952 KB Output is correct
14 Correct 76 ms 4948 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 23 ms 6208 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 23 ms 6208 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 84 ms 4948 KB Output is correct
12 Correct 83 ms 4956 KB Output is correct
13 Correct 73 ms 4952 KB Output is correct
14 Correct 76 ms 4948 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 23 ms 6208 KB Output isn't correct
17 Halted 0 ms 0 KB -