제출 #875032

#제출 시각아이디문제언어결과실행 시간메모리
875032makravSelf Study (JOI22_ho_t2)C++14
컴파일 에러
0 ms0 KiB
#define _USE_MATH_DEFINES#include <bits/stdc++.h> using namespace std; typedef long long ll;typedef long double ld;typedef vector<int> vei;typedef vector<vei> vevei; #define all(a) (a).begin(), (a).end()#define sz(a) (int) a.size()#define con cout << "NO\n"#define coe cout << "YES\n";#define str string#define pb push_back#define ff first#define sc second#define ss second#define pii pair<int, int>#define mxe max_element#define mne min_element#define stf shrink_to_fit#define f(i, l, r) for (int i = (l); i < (r); i++)#define double ld#define int __int128 signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); ll n, m; cin >> n >> m; vector<ll> a(n), b(n); f(i, 0, n) cin >> a[i]; f(i, 0, n) cin >> b[i]; int ans = 1e18; f(i, 0, n) { ans = min(ans, max(a[i], b[i])); } int L = -1, R = 1e14; while (R - L > 1) { int M = (L + R) / 2; int need = 0; f(i, 0, n) { if (b[i] > a[i]) { need += (M + b[i] - 1) / b[i]; } else { if ((M + a[i] - 1) / a[i] <= m) { need += (M + a[i] - 1) / a[i]; } else { need += m + (M - a[i] * m + b[i] - 1) / b[i]; } } } if (need > m * n) R = M; else L = M; } if (L > ans) assert(false); cout << (ll)L << '\n'; return 0;}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp:1:9: warning: ISO C++11 requires whitespace after the macro name
    1 | #define _USE_MATH_DEFINES#include <bits/stdc++.h> using namespace std; typedef long long ll;typedef long double ld;typedef vector<int> vei;typedef vector<vei> vevei; #define all(a) (a).begin(), (a).end()#define sz(a) (int) a.size()#define con cout << "NO\n"#define coe cout << "YES\n";#define str string#define pb push_back#define ff first#define sc second#define ss second#define pii pair<int, int>#define mxe max_element#define mne min_element#define stf shrink_to_fit#define f(i, l, r) for (int i = (l); i < (r); i++)#define double ld#define int __int128 signed main() {    ios_base::sync_with_stdio(false);    cin.tie(nullptr);    cout.tie(nullptr);     ll n, m; cin >> n >> m;    vector<ll> a(n), b(n);    f(i, 0, n) cin >> a[i];    f(i, 0, n) cin >> b[i];    int ans = 1e18;    f(i, 0, n) {        ans = min(ans, max(a[i], b[i]));    }    int L = -1, R = 1e14;    while (R - L > 1) {        int M = (L + R) / 2;        int need = 0;        f(i, 0, n) {            if (b[i] > a[i]) {                need += (M + b[i] - 1) / b[i];            }            else {                if ((M + a[i] - 1) / a[i] <= m) {                    need += (M + a[i] - 1) / a[i];                }                else {                    need += m + (M - a[i] * m + b[i] - 1) / b[i];                }            }        }        if (need > m * n) R = M;        else L = M;    }    if (L > ans) assert(false);    cout << (ll)L << '\n';     return 0;}
      |         ^~~~~~~~~~~~~~~~~
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/10/../../../x86_64-linux-gnu/crt1.o: in function `_start':
(.text+0x24): undefined reference to `main'
collect2: error: ld returned 1 exit status