| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332516 | retarde | Exhibition (JOI19_ho_t2) | C++20 | 157 ms | 26264 KiB |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()
typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;
inline void solve() {
int n, m;
cin >> n >> m;
vector<pii> fl(n); // {v, s}
for (int i = 0; i < n; i++) cin >> fl[i].se >> fl[i].fi;
sort(all(fl));
vi p(m); for (int i = 0; i < m; i++) cin >> p[i];
sort(all(p));
vector<pii> fl2; for (auto &x : fl) if (x.se <= p[m - 1]) fl2.pb(x);
fl = fl2; n = fl2.size();
map<int, vi> pos; set<int> active;
for (int i = 0; i < n; i++) {pos[fl2[i].se].pb(i); active.insert(i);}
vector<pair<int, vi>> pos2; for (auto &x : pos) pos2.pb(x); // {thing, vector of positions}
int ans = 0; int rt = n - 1; int ptr = pos2.size() - 1;
for (int i = m - 1; i >= 0; i--) {
int x = p[i]; // painting size
// deactivate anything unusable
while (ptr >= 0) {
if (pos2[ptr].fi <= x) break;
for (auto &x : pos2[ptr].se) active.erase(x);
ptr--;
}
// deactivate anything from this
// for (auto &y : pos[x]) active.erase(y);
if (!active.size()) break;
active.erase(*active.rbegin());
ans++;
}
cout << ans << '\n';
}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
signed main() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
//setIO();
int t = 1;
if (tc) {
cin >> t;
}
while (t--) {
solve();
}
}컴파일 시 표준 에러 (stderr) 메시지
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
