제출 #823061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
823061		makrav	Advertisement 2 (JOI23_ho_t2)	C++14	100 / 100	526 ms	43252 KiB

Main

#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 coa               \
            for (auto i : a) {    \
                cout << i << ' '; \
            }                     \
            cout << '\n';
#define cia             \
            for (auto& i : a) { \
                cin >> a;       \
            }
#define cna                       \
            int n;                        \
            cin >> n;                     \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }
#define cnka                      \
            int n, k;                     \
            cin >> n >> k;                \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }
#define cnab                      \
            int n;                        \
            cin >> n;                     \
            vector<int> a(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> a[i];              \
            }                             \
            vector<int> b(n);             \
            for (int i = 0; i < n; i++) { \
                cin >> b[i];              \
            }
#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 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

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n; cin >> n;
    vector<pair<int, int>> a(n);
    for (int i = 0; i < n; i++) cin >> a[i].ff >> a[i].sc;
    vector<pair<pii, int>> b(n);
    f(i, 0, n) {
        b[i] = { {a[i].sc - a[i].ff, (a[i].ff + a[i].sc)}, i };
    }
    sort(all(b), [](pair<pii, int> a, pair<pii, int> b) {
        return (a.ff.ff < b.ff.ff || (a.ff.ff == b.ff.ff & a.ff.sc < b.ff.sc));
        });
    set<int> st;
    int ans = 0;
    for (int i = n - 1; i >= 0; i--) {
        auto it = st.lower_bound(a[b[i].sc].ff + a[b[i].sc].sc);
        if (it == st.end()) {
            ans++;
        }
        st.insert(a[b[i].sc].ff + a[b[i].sc].sc);
    }
    cout << ans << '\n';
    return 0;
}

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

Main.cpp: In lambda function:
Main.cpp:73:47: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   73 |         return (a.ff.ff < b.ff.ff || (a.ff.ff == b.ff.ff & a.ff.sc < b.ff.sc));
      |                                               ^

• Subtask 1: 10 / 10
• Subtask 2: 23 / 23
• Subtask 3: 36 / 36
• Subtask 4: 31 / 31