oj.uz

답안 #619260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
619260 2022-08-02T10:48:57 Z StrawHatWess Self Study (JOI22_ho_t2) C++17
100 / 100
 286 ms 11500 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 3e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


ll N,M; 
vector<ll> a(MX), b(MX);

int check(ll L){
	ll n=0; 

	FOR(i,0,N){
        ll needed=(L+a[i]-1)/a[i]; 
    
        if(a[i]*M>=L){
            assert(M>=needed); 
            n-=M-(L+a[i]-1)/a[i];
        }
        else{
            n+=(L-a[i]*M+b[i]-1)/b[i]; 
        }

        if(n>N*M) return 0; 
	}

	return (n<=0); 
}

int main() {
    boost; IO();

    cin>>N>>M; 
    
    FOR(i,0,N) cin>>a[i]; 
    FOR(i,0,N) cin>>b[i]; 

    FOR(i,0,N) ckmax(a[i],b[i]); 

    ll l=0, r=INF, ans; 
    while(l<=r){
    	ll m=(l+r)/2; 

    	if(check(m)) ans=m, l=m+1; 
    	else r=m-1;
    }
    assert(ans>0); 
    cout << ans << endl;
    

    return 0;
}
//Change your approach

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 96 ms 5012 KB Output is correct
12 Correct 123 ms 5008 KB Output is correct
13 Correct 110 ms 5020 KB Output is correct
14 Correct 74 ms 4948 KB Output is correct
15 Correct 4 ms 4948 KB Output is correct
16 Correct 39 ms 5524 KB Output is correct
17 Correct 128 ms 11500 KB Output is correct
18 Correct 156 ms 10820 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 39 ms 5524 KB Output is correct
3 Correct 128 ms 11500 KB Output is correct
4 Correct 156 ms 10820 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 60 ms 4948 KB Output is correct
14 Correct 34 ms 4948 KB Output is correct
15 Correct 32 ms 4948 KB Output is correct
16 Correct 23 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 5 ms 5076 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 96 ms 5012 KB Output is correct
12 Correct 123 ms 5008 KB Output is correct
13 Correct 110 ms 5020 KB Output is correct
14 Correct 74 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 60 ms 4948 KB Output is correct
24 Correct 34 ms 4948 KB Output is correct
25 Correct 32 ms 4948 KB Output is correct
26 Correct 23 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 2 ms 4948 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 5 ms 5076 KB Output is correct
34 Correct 4 ms 4948 KB Output is correct
35 Correct 39 ms 5524 KB Output is correct
36 Correct 128 ms 11500 KB Output is correct
37 Correct 156 ms 10820 KB Output is correct
38 Correct 3 ms 5032 KB Output is correct
39 Correct 3 ms 4948 KB Output is correct
40 Correct 4 ms 5032 KB Output is correct
41 Correct 4 ms 5004 KB Output is correct
42 Correct 3 ms 4948 KB Output is correct
43 Correct 2 ms 4948 KB Output is correct
44 Correct 3 ms 5032 KB Output is correct
45 Correct 6 ms 5076 KB Output is correct
46 Correct 7 ms 5204 KB Output is correct
47 Correct 4 ms 5040 KB Output is correct
48 Correct 29 ms 5912 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 4 ms 4948 KB Output is correct
51 Correct 5 ms 5044 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 4 ms 4948 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct
55 Correct 66 ms 7840 KB Output is correct
56 Correct 41 ms 6172 KB Output is correct
57 Correct 40 ms 6280 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 60 ms 4948 KB Output is correct
10 Correct 34 ms 4948 KB Output is correct
11 Correct 32 ms 4948 KB Output is correct
12 Correct 23 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 5 ms 5076 KB Output is correct
20 Correct 4 ms 4948 KB Output is correct
21 Correct 39 ms 5524 KB Output is correct
22 Correct 128 ms 11500 KB Output is correct
23 Correct 156 ms 10820 KB Output is correct
24 Correct 39 ms 5848 KB Output is correct
25 Correct 91 ms 7616 KB Output is correct
26 Correct 18 ms 5616 KB Output is correct
27 Correct 118 ms 10768 KB Output is correct
28 Correct 125 ms 10824 KB Output is correct
29 Correct 124 ms 10828 KB Output is correct
30 Correct 151 ms 10776 KB Output is correct
31 Correct 245 ms 10824 KB Output is correct
32 Correct 137 ms 6192 KB Output is correct
33 Correct 286 ms 11476 KB Output is correct
34 Correct 123 ms 6188 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 96 ms 5012 KB Output is correct
12 Correct 123 ms 5008 KB Output is correct
13 Correct 110 ms 5020 KB Output is correct
14 Correct 74 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 60 ms 4948 KB Output is correct
24 Correct 34 ms 4948 KB Output is correct
25 Correct 32 ms 4948 KB Output is correct
26 Correct 23 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 2 ms 4948 KB Output is correct
29 Correct 2 ms 4948 KB Output is correct
30 Correct 2 ms 4948 KB Output is correct
31 Correct 2 ms 4948 KB Output is correct
32 Correct 3 ms 4948 KB Output is correct
33 Correct 5 ms 5076 KB Output is correct
34 Correct 3 ms 5032 KB Output is correct
35 Correct 3 ms 4948 KB Output is correct
36 Correct 4 ms 5032 KB Output is correct
37 Correct 4 ms 5004 KB Output is correct
38 Correct 3 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 3 ms 5032 KB Output is correct
41 Correct 6 ms 5076 KB Output is correct
42 Correct 7 ms 5204 KB Output is correct
43 Correct 4 ms 5040 KB Output is correct
44 Correct 29 ms 5912 KB Output is correct
45 Correct 3 ms 4948 KB Output is correct
46 Correct 4 ms 4948 KB Output is correct
47 Correct 5 ms 5044 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 4 ms 4948 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 66 ms 7840 KB Output is correct
52 Correct 41 ms 6172 KB Output is correct
53 Correct 40 ms 6280 KB Output is correct
54 Correct 39 ms 5848 KB Output is correct
55 Correct 91 ms 7616 KB Output is correct
56 Correct 18 ms 5616 KB Output is correct
57 Correct 118 ms 10768 KB Output is correct
58 Correct 125 ms 10824 KB Output is correct
59 Correct 124 ms 10828 KB Output is correct
60 Correct 151 ms 10776 KB Output is correct
61 Correct 245 ms 10824 KB Output is correct
62 Correct 137 ms 6192 KB Output is correct
63 Correct 286 ms 11476 KB Output is correct
64 Correct 123 ms 6188 KB Output is correct
65 Correct 4 ms 4948 KB Output is correct
66 Correct 39 ms 5524 KB Output is correct
67 Correct 128 ms 11500 KB Output is correct
68 Correct 156 ms 10820 KB Output is correct
69 Correct 31 ms 5660 KB Output is correct
70 Correct 8 ms 5172 KB Output is correct
71 Correct 2 ms 4948 KB Output is correct
72 Correct 35 ms 5852 KB Output is correct
73 Correct 11 ms 5176 KB Output is correct
74 Correct 3 ms 4948 KB Output is correct
75 Correct 113 ms 10832 KB Output is correct
76 Correct 139 ms 10940 KB Output is correct
77 Correct 148 ms 10820 KB Output is correct
78 Correct 162 ms 10824 KB Output is correct
79 Correct 214 ms 10700 KB Output is correct
80 Correct 221 ms 10772 KB Output is correct
81 Correct 219 ms 8728 KB Output is correct
82 Correct 233 ms 8840 KB Output is correct