oj.uz

답안 #867845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
867845 2023-10-29T15:05:17 Z efedmrlr Self Study (JOI22_ho_t2) C++17
100 / 100
 363 ms 11604 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int unsigned long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 4e18;
const int N = 1e5+5;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q;
vector<int> a,b;

int ceil_div(int x, int y) {
    return (x - 1ll) / y + 1ll;
}

bool isPos(int mn) {
    int left = n * m + 1ll;
    for(int i = 0; i<n; i++) {
        int tmp = mn;
        int moves = 0ll;
        moves = min(ceil_div(tmp , a[i]) , m);
        left -= min(left, moves);
        tmp -= min(moves * a[i], tmp);
        if(tmp > 0) {
            moves = ceil_div(tmp , b[i]);
            tmp -= min(tmp, moves * b[i]);
            left -= min(left, moves);
            
        } 
        
    }
    if(left > 0ll) {
        return 1;
    }
    return 0;
}


inline void solve() {
    cin >> n >> m;
    a.resize(n); b.resize(n);
    REP(i,n) {
        cin>>a[i];
    }
    REP(i,n) {
        cin>>b[i];
    }
    REP(i,n) {
        a[i] = max(a[i], b[i]);
    }

    int l = 1ll, r = INF;
    while(l < r) {
        int tm = (l + r) >> 1ll;
        if(isPos(tm)) {
            l = tm + 1ll;
        }
        else {
            r = tm;
        }
    }
    if(isPos(l)) {
        cout<<l<<"\n";
    }
    else {
        cout<<l - 1ll<<"\n";
    }

}    
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:62:5: note: in expansion of macro 'REP'
   62 |     REP(i,n) {
      |     ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:65:5: note: in expansion of macro 'REP'
   65 |     REP(i,n) {
      |     ^~~
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:68:5: note: in expansion of macro 'REP'
   68 |     REP(i,n) {
      |     ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 212 ms 5136 KB Output is correct
12 Correct 213 ms 4952 KB Output is correct
13 Correct 219 ms 4952 KB Output is correct
14 Correct 272 ms 4952 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 349 ms 6236 KB Output is correct
17 Correct 247 ms 11344 KB Output is correct
18 Correct 218 ms 10948 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 349 ms 6236 KB Output is correct
3 Correct 247 ms 11344 KB Output is correct
4 Correct 218 ms 10948 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 111 ms 2652 KB Output is correct
14 Correct 73 ms 1884 KB Output is correct
15 Correct 54 ms 1628 KB Output is correct
16 Correct 47 ms 1388 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 6 ms 348 KB Output is correct
23 Correct 4 ms 632 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 212 ms 5136 KB Output is correct
12 Correct 213 ms 4952 KB Output is correct
13 Correct 219 ms 4952 KB Output is correct
14 Correct 272 ms 4952 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 111 ms 2652 KB Output is correct
24 Correct 73 ms 1884 KB Output is correct
25 Correct 54 ms 1628 KB Output is correct
26 Correct 47 ms 1388 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 6 ms 348 KB Output is correct
33 Correct 4 ms 632 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 349 ms 6236 KB Output is correct
36 Correct 247 ms 11344 KB Output is correct
37 Correct 218 ms 10948 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 452 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 4 ms 632 KB Output is correct
46 Correct 7 ms 604 KB Output is correct
47 Correct 1 ms 464 KB Output is correct
48 Correct 38 ms 2136 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 4 ms 464 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 110 ms 5644 KB Output is correct
56 Correct 75 ms 3160 KB Output is correct
57 Correct 91 ms 3164 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 111 ms 2652 KB Output is correct
10 Correct 73 ms 1884 KB Output is correct
11 Correct 54 ms 1628 KB Output is correct
12 Correct 47 ms 1388 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 6 ms 348 KB Output is correct
19 Correct 4 ms 632 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 349 ms 6236 KB Output is correct
22 Correct 247 ms 11344 KB Output is correct
23 Correct 218 ms 10948 KB Output is correct
24 Correct 36 ms 1884 KB Output is correct
25 Correct 104 ms 5144 KB Output is correct
26 Correct 25 ms 1368 KB Output is correct
27 Correct 217 ms 10832 KB Output is correct
28 Correct 226 ms 10832 KB Output is correct
29 Correct 220 ms 10936 KB Output is correct
30 Correct 226 ms 10944 KB Output is correct
31 Correct 220 ms 11008 KB Output is correct
32 Correct 343 ms 6236 KB Output is correct
33 Correct 317 ms 11604 KB Output is correct
34 Correct 361 ms 6232 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 3 ms 348 KB Output is correct
11 Correct 212 ms 5136 KB Output is correct
12 Correct 213 ms 4952 KB Output is correct
13 Correct 219 ms 4952 KB Output is correct
14 Correct 272 ms 4952 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 111 ms 2652 KB Output is correct
24 Correct 73 ms 1884 KB Output is correct
25 Correct 54 ms 1628 KB Output is correct
26 Correct 47 ms 1388 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 6 ms 348 KB Output is correct
33 Correct 4 ms 632 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 452 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 4 ms 632 KB Output is correct
42 Correct 7 ms 604 KB Output is correct
43 Correct 1 ms 464 KB Output is correct
44 Correct 38 ms 2136 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 4 ms 464 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 110 ms 5644 KB Output is correct
52 Correct 75 ms 3160 KB Output is correct
53 Correct 91 ms 3164 KB Output is correct
54 Correct 36 ms 1884 KB Output is correct
55 Correct 104 ms 5144 KB Output is correct
56 Correct 25 ms 1368 KB Output is correct
57 Correct 217 ms 10832 KB Output is correct
58 Correct 226 ms 10832 KB Output is correct
59 Correct 220 ms 10936 KB Output is correct
60 Correct 226 ms 10944 KB Output is correct
61 Correct 220 ms 11008 KB Output is correct
62 Correct 343 ms 6236 KB Output is correct
63 Correct 317 ms 11604 KB Output is correct
64 Correct 361 ms 6232 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 349 ms 6236 KB Output is correct
67 Correct 247 ms 11344 KB Output is correct
68 Correct 218 ms 10948 KB Output is correct
69 Correct 26 ms 1372 KB Output is correct
70 Correct 7 ms 600 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 34 ms 1772 KB Output is correct
73 Correct 9 ms 604 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 226 ms 10908 KB Output is correct
76 Correct 229 ms 11088 KB Output is correct
77 Correct 236 ms 10836 KB Output is correct
78 Correct 235 ms 10832 KB Output is correct
79 Correct 242 ms 10764 KB Output is correct
80 Correct 238 ms 10884 KB Output is correct
81 Correct 304 ms 8952 KB Output is correct
82 Correct 363 ms 8788 KB Output is correct