# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982552 | blackslex | Bitaro’s Party (JOI18_bitaro) | C++17 | 930 ms | 420612 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using P = pair<pii, int>;
const int N = 1e5 + 5, K = 320;
int n, m, q, x, y, t, r, ptr[N], cdp[N];
vector<int> v[N], rev[N];
vector<pii> dp[N];
bool f[N], f2[N];
int main() {
scanf("%d %d %d", &n, &m, &q);
int k = K;
while (m--) scanf("%d %d", &x, &y), v[x].emplace_back(y), rev[y].emplace_back(x);
for (int i = 1; i <= n; i++) cdp[i] = -1e9;
auto mg = [&] (vector<pii> a, vector<pii> b) {
vector<pii> res;
for (int p1 = 0, p2 = 0; res.size() <= k && (p1 < a.size() || p2 < b.size());) {
if (p2 >= b.size() || (p1 < a.size() && a[p1] > b[p2])) {
res.emplace_back(a[p1]);
f2[a[p1++].second] = 1;
} else {
res.emplace_back(b[p2]);
f2[b[p2++].second] = 1;
}
while (p1 < a.size() && f2[a[p1].second]) p1++;
while (p2 < b.size() && f2[b[p2].second]) p2++;
}
Compilation message (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... |