이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())
#ifdef bbq
#include <experimental/iterator>
#define safe cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(auto s, auto ...a) {
cerr << "\e[1;32m(" << s << ") = (";
int f = 0;
(..., (cerr << (f++ ? ", " : "") << a));
cerr << ")\e[0m\n";
}
void orange_(auto s, auto L, auto R) {
cerr << "\e[1;33m[" << s << "] = [";
using namespace experimental;
copy(L, R, make_ostream_joiner(cerr, ", "));
cerr << "]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) safe
#define orange(...) safe
#endif
const int MAXN = 200005;
int bit[MAXN], n;
void modify(int x, int v) {
for (++x; x <= n; x += x & -x)
bit[x] = max(bit[x], v);
}
int query(int x) {
int res = 0;
for (++x; x; x -= x & -x)
res = max(res, bit[x]);
return res;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
vector<pii> arr(n);
for (auto &[l, r] : arr)
cin >> l >> r;
vector<int> idx(n + n);
iota(ALL(idx), 0);
sort(ALL(idx), [&](int a, int b) {
int vala = a < n ? a : a - n - arr[a - n].X;
int valb = b < n ? b : b - n - arr[b - n].X;
if (vala == valb) return a > b;
return vala < valb;
});
vector<int> dp(n);
orange(ALL(idx));
for (int i : idx) {
if (i < n) {
modify(i + arr[i].Y, dp[i]);
}
else {
dp[i - n] = query(i - n - 1) + 1;
}
}
cout << *max_element(ALL(dp)) << "\n";
}
컴파일 시 표준 에러 (stderr) 메시지
Main.cpp: In function 'int main()':
Main.cpp:54:16: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
54 | for (auto &[l, r] : arr)
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |