結果
| 問題 | No.1914 Directed by Two Sequences |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2022-04-09 08:45:12 |
| 言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,937 bytes |
| コンパイル時間 | 1,985 ms |
| コンパイル使用メモリ | 210,308 KB |
| 最終ジャッジ日時 | 2024-11-15 02:15:42 |
| 合計ジャッジ時間 | 3,318 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of 'void printn(const std::vector<_Tp>&, T) [with T = std::pair<int, int>]':
main.cpp:354:11: required from here
main.cpp:43:46: error: no match for 'operator+' (operand types are 'const __gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> >, std::pair<int, int> >::value_type' {aka 'const std::pair<int, int>'} and 'std::pair<int, int>')
43 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_algobase.h:67,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/specfun.h:45,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/cmath:1935,
from /home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/x86_64-pc-linux-gnu/bits/stdc++.h:41,
from main.cpp:1:
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: candidate: 'template<class _Iterator> constexpr std::reverse_iterator<_Iterator> std::operator+(typename reverse_iterator<_Iterator>::difference_type, const reverse_iterator<_Iterator>&)'
630 | operator+(typename reverse_iterator<_Iterator>::difference_type __n,
| ^~~~~~~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:630:5: note: template argument deduction/substitution failed:
main.cpp:43:46: note: 'std::pair<int, int>' is not derived from 'const std::reverse_iterator<_Iterator>'
43 | for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
| ~~~~~^~~
/home/linuxbrew/.linuxbrew/Cellar/gcc@12/12.3.0/include/c++/12/bits/stl_iterator.h:1804:5: note: candidate: 'template<class _Iterator> constexpr std::move_iterator<_IteratorL> std::operator+(typename move_iterator<_IteratorL>::difference_type, const move_iterator<_Iterat
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
template <typename T>
bool chmax(T &x, const T &y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T>
bool chmin(T &x, const T &y) {
return (x > y) ? (x = y, true) : false;
}
template <typename T>
int flg(T x, int i) {
return (x >> i) & 1;
}
template <typename T>
void print(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
if (v.empty()) cout << '\n';
}
template <typename T>
void printn(const vector<T> &v, T x = 0) {
int n = v.size();
for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}
template <typename T>
int lb(const vector<T> &v, T x) {
return lower_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, T x) {
return upper_bound(begin(v), end(v), x) - begin(v);
}
template <typename T>
void rearrange(vector<T> &v) {
sort(begin(v), end(v));
v.erase(unique(begin(v), end(v)), end(v));
}
template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
int n = v.size();
vector<int> ret(n);
iota(begin(ret), end(ret), 0);
sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
return ret;
}
template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first + q.first, p.second + q.second);
}
template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
return make_pair(p.first - q.first, p.second - q.second);
}
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
S a;
T b;
is >> a >> b;
p = make_pair(a, b);
return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << p.first << ' ' << p.second;
}
struct io_setup {
io_setup() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;
template <typename Monoid>
struct Segment_Tree {
using F = function<Monoid(Monoid, Monoid)>;
int n;
vector<Monoid> seg;
const F f;
const Monoid e1;
// f(f(a,b),c) = f(a,f(b,c)), f(e1,a) = f(a,e1) = a
Segment_Tree(const vector<Monoid> &v, const F &f, const Monoid &e1) : f(f), e1(e1) {
int m = v.size();
n = 1;
while (n < m) n <<= 1;
seg.assign(2 * n, e1);
copy(begin(v), end(v), seg.begin() + n);
for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
}
Segment_Tree(int m, const Monoid &x, const F &f, const Monoid &e1) : f(f), e1(e1) {
n = 1;
while (n < m) n <<= 1;
seg.assign(2 * n, e1);
vector<Monoid> v(m, x);
copy(begin(v), end(v), begin(seg) + n);
for (int i = n - 1; i > 0; i--) seg[i] = f(seg[2 * i], seg[2 * i + 1]);
}
void change(int i, const Monoid &x, bool update = true) {
if (update) {
seg[i + n] = x;
} else {
seg[i + n] = f(seg[i + n], x);
}
i += n;
while (i >>= 1) { seg[i] = f(seg[2 * i], seg[2 * i + 1]); }
}
Monoid query(int l, int r) const {
Monoid L = e1, R = e1;
l += n, r += n;
while (l < r) {
if (l & 1) L = f(L, seg[l++]);
if (r & 1) R = f(seg[--r], R);
l >>= 1, r >>= 1;
}
return f(L, R);
}
Monoid operator[](int i) const { return seg[n + i]; }
template <typename C>
int find_subtree(int i, const C &check, const Monoid &x, Monoid &M, int type) const {
while (i < n) {
Monoid nxt = type ? f(seg[2 * i + type], M) : f(M, seg[2 * i + type]);
if (check(nxt, x)) {
i = 2 * i + type;
} else {
M = nxt;
i = 2 * i + (type ^ 1);
}
}
return i - n;
}
template <typename C>
int find_first(int l, const C &check, const Monoid &x) const { // check((区間 [l,r] での演算結果), x) を満たす最小の r
Monoid L = e1;
int a = l + n, b = n + n;
while (a < b) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt, x)) return find_subtree(a, check, x, L, 0);
L = nxt, a++;
}
a >>= 1, b >>= 1;
}
return n;
}
template <typename C>
int find_last(int r, const C &check, const Monoid &x) const { // check((区間 [l,r) での演算結果), x) を満たす最大の l
Monoid R = e1;
int a = n, b = r + n;
while (a < b) {
if ((b & 1) || a == 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt, x)) return find_subtree(b, check, x, R, 1);
R = nxt;
}
a >>= 1, b >>= 1;
}
return -1;
}
};
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
rep(i, N) {
cin >> A[i];
A[i]--;
}
rep(i, N) {
cin >> B[i];
B[i]--;
}
set<pii> ng;
rep(i, M) {
int u, v;
cin >> u >> v;
u--, v--;
ng.emplace(u, v);
}
auto f = [](int a, int b) { return max(a, b); };
auto c = [](int a, int b) { return a > b; };
Segment_Tree<int> seg1(A, f, -inf), seg2(B, f, -inf);
vector<int> vs;
vector<int> comp(N, -1);
function<void(int)> dfs = [&](int now) {
if (comp[now] != -1) return;
comp[now] = 1;
seg1.change(now, -inf), seg2.change(now, -inf);
int p = now + 1;
while (p < N) {
int np = seg2.find_first(p, c, A[now]);
if (np >= N) break;
if (!ng.count(pii(now, np))) dfs(np);
p = np + 1;
}
p = now;
while (p > 0) {
int np = seg1.find_last(p, c, B[now]);
if (np < 0) break;
if (!ng.count(pii(np, now))) dfs(np);
p = np;
}
vs.eb(now);
};
function<void(int, int)> rdfs = [&](int now, int col) {
if (comp[now] != -1) return;
comp[now] = col;
seg1.change(now, -inf), seg2.change(now, -inf);
int p = now + 1;
while (p < N) {
int np = seg2.find_first(p, c, -A[now]);
if (np >= N) break;
if (!ng.count(pii(now, np))) rdfs(np, col);
p = np + 1;
}
p = now;
while (p > 0) {
int np = seg1.find_last(p, c, -B[now]);
if (np < 0) break;
if (!ng.count(pii(np, now))) rdfs(np, col);
p = np;
}
};
rep(i, N) dfs(i);
fill(all(comp), -1);
reverse(all(vs));
rep(i, N) seg1.change(i, -A[i]), seg2.change(i, -B[i]);
int K = 0;
each(e, vs) {
if (comp[e] == -1) rdfs(e, K++);
}
vector<vector<int>> ids(K);
rep(i, N) ids[comp[i]].eb(i);
// rep(i, K) cout << sz(ids[i]) << '\n';
vector<vector<int>> es(K);
vector<int> deg(K, 0);
set<int> rem;
rep(i, N) seg1.change(i, -inf), seg2.change(i, -inf);
rep3(i, K - 1, 0) {
priority_queue<int, vector<int>, greater<int>> que;
each(e, rem) que.emplace(e);
vector<int> check;
each(u, ids[i]) seg1.change(u, -A[u]), seg2.change(u, -B[u]);
while (!empty(que)) {
int j = que.top();
que.pop();
bool flag = false;
each(v, ids[j]) {
int p = v + 1;
while (p < N) {
int np = seg2.find_first(p, c, -A[v]);
if (np >= N) break;
if (!ng.count(pii(v, np))) {
flag = true;
break;
}
p = np + 1;
}
p = v;
while (p > 0) {
int np = seg1.find_last(p, c, -B[v]);
if (np < 0) break;
if (!ng.count(pii(np, v))) {
flag = true;
break;
}
p = np;
}
}
if (flag) {
if (rem.count(j)) rem.erase(j);
es[i].eb(j);
} else {
check.eb(j);
each(e, es[j]) {
if (--deg[e] == 0) que.emplace(e);
}
}
}
check.eb(i);
each(j, check) {
each(e, es[j]) deg[e]++; //
}
rem.emplace(i);
each(u, ids[i]) seg1.change(u, -inf), seg2.change(u, -inf);
}
vector<pii> ans;
rep(i, K) {
int L = sz(ids[i]);
if (L > 1) {
rep(j, L) {
int u = ids[i][j], v = ids[i][(j + 1) % L];
ans.eb(u, v);
}
}
each(e, es[i]) ans.eb(ids[i][0], ids[e][0]);
}
cout << sz(ans) << '\n';
printn(ans, pii(1, 1));
}
// TODO
// que のところを DAG 上の DP っぽくする（このままだと辺が多くなる場合がある）
// 強連結成分 i から強連結成分 j への辺があるかの判定の高速化（セグ木など）