oj.uz

Submission #773849

# Submission time Handle Problem Language Result Execution time Memory
773849 2023-07-05T09:06:41 Z bachhoangxuan Self Study (JOI22_ho_t2) C++17
100 / 100
 334 ms 11484 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m;cin >> n >> m;
    vector<int> a(n),b(n);
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<n;i++) cin >> b[i];
    auto check = [&](int x){
        if(x==0) return true;
        int ans=0;
        for(int i=0;i<n;i++){
            if(a[i]>b[i]){
                int c=min(m,(x-1)/a[i]+1),nx=x-c*a[i];
                ans+=c+(nx>0)*((nx-1)/b[i]+1);
            }
            else ans+=(x-1)/b[i]+1;
            if(ans>n*m) return false;
        }
        return ans<=n*m;
    };
    int l=0,r=inf;
    while(r>l){
        int mid=(l+r+1)>>1;
        if(check(mid)) l=mid;
        else r=mid-1;
    }
    cout << l << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
10.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 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 102 ms 10764 KB Output is correct
12 Correct 110 ms 10772 KB Output is correct
13 Correct 68 ms 8836 KB Output is correct
14 Correct 86 ms 8728 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 26 ms 6164 KB Output is correct
17 Correct 81 ms 11484 KB Output is correct
18 Correct 83 ms 10820 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 26 ms 6164 KB Output is correct
3 Correct 81 ms 11484 KB Output is correct
4 Correct 83 ms 10820 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 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 0 ms 324 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 43 ms 5492 KB Output is correct
14 Correct 34 ms 3832 KB Output is correct
15 Correct 21 ms 2900 KB Output is correct
16 Correct 18 ms 2424 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 500 KB Output is correct

Subtask #3
27.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 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 102 ms 10764 KB Output is correct
12 Correct 110 ms 10772 KB Output is correct
13 Correct 68 ms 8836 KB Output is correct
14 Correct 86 ms 8728 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
20 Correct 0 ms 324 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 43 ms 5492 KB Output is correct
24 Correct 34 ms 3832 KB Output is correct
25 Correct 21 ms 2900 KB Output is correct
26 Correct 18 ms 2424 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 500 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 26 ms 6164 KB Output is correct
36 Correct 81 ms 11484 KB Output is correct
37 Correct 83 ms 10820 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 0 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 3 ms 464 KB Output is correct
46 Correct 4 ms 596 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 23 ms 2132 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 3 ms 492 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 53 ms 5528 KB Output is correct
56 Correct 27 ms 3180 KB Output is correct
57 Correct 32 ms 3164 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 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 0 ms 324 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 43 ms 5492 KB Output is correct
10 Correct 34 ms 3832 KB Output is correct
11 Correct 21 ms 2900 KB Output is correct
12 Correct 18 ms 2424 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 324 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 500 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 26 ms 6164 KB Output is correct
22 Correct 81 ms 11484 KB Output is correct
23 Correct 83 ms 10820 KB Output is correct
24 Correct 29 ms 1948 KB Output is correct
25 Correct 64 ms 5024 KB Output is correct
26 Correct 11 ms 1364 KB Output is correct
27 Correct 90 ms 10768 KB Output is correct
28 Correct 87 ms 10768 KB Output is correct
29 Correct 89 ms 10828 KB Output is correct
30 Correct 112 ms 10760 KB Output is correct
31 Correct 187 ms 10828 KB Output is correct
32 Correct 109 ms 6188 KB Output is correct
33 Correct 214 ms 11404 KB Output is correct
34 Correct 110 ms 6192 KB Output is correct

Subtask #5
9.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 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 102 ms 10764 KB Output is correct
12 Correct 110 ms 10772 KB Output is correct
13 Correct 68 ms 8836 KB Output is correct
14 Correct 86 ms 8728 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 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 1 ms 212 KB Output is correct
20 Correct 0 ms 324 KB Output is correct
21 Correct 0 ms 324 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 43 ms 5492 KB Output is correct
24 Correct 34 ms 3832 KB Output is correct
25 Correct 21 ms 2900 KB Output is correct
26 Correct 18 ms 2424 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 324 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 500 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 0 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 3 ms 464 KB Output is correct
42 Correct 4 ms 596 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 23 ms 2132 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 53 ms 5528 KB Output is correct
52 Correct 27 ms 3180 KB Output is correct
53 Correct 32 ms 3164 KB Output is correct
54 Correct 29 ms 1948 KB Output is correct
55 Correct 64 ms 5024 KB Output is correct
56 Correct 11 ms 1364 KB Output is correct
57 Correct 90 ms 10768 KB Output is correct
58 Correct 87 ms 10768 KB Output is correct
59 Correct 89 ms 10828 KB Output is correct
60 Correct 112 ms 10760 KB Output is correct
61 Correct 187 ms 10828 KB Output is correct
62 Correct 109 ms 6188 KB Output is correct
63 Correct 214 ms 11404 KB Output is correct
64 Correct 110 ms 6192 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 26 ms 6164 KB Output is correct
67 Correct 81 ms 11484 KB Output is correct
68 Correct 83 ms 10820 KB Output is correct
69 Correct 26 ms 1364 KB Output is correct
70 Correct 7 ms 588 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 37 ms 1776 KB Output is correct
73 Correct 7 ms 596 KB Output is correct
74 Correct 1 ms 340 KB Output is correct
75 Correct 110 ms 10824 KB Output is correct
76 Correct 123 ms 10776 KB Output is correct
77 Correct 134 ms 10764 KB Output is correct
78 Correct 171 ms 10764 KB Output is correct
79 Correct 242 ms 10896 KB Output is correct
80 Correct 240 ms 10820 KB Output is correct
81 Correct 201 ms 8728 KB Output is correct
82 Correct 334 ms 8844 KB Output is correct