結果
問題 | No.1778 括弧列クエリ / Bracketed Sequence Query |
ユーザー |
![]() |
提出日時 | 2021-12-11 00:03:16 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 383 ms / 2,000 ms |
コード長 | 2,412 bytes |
コンパイル時間 | 2,183 ms |
コンパイル使用メモリ | 210,200 KB |
最終ジャッジ日時 | 2025-01-26 07:32:39 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>using namespace std;struct iofast_t {iofast_t() {ios::sync_with_stdio(false);cin.tie(nullptr);}} iofast;struct uns_t {} uns;template <typename Element, typename Head, typename ...Args>auto vec(Element init, Head arg, Args ...args) {if constexpr (sizeof...(Args) == 0) return vector(arg, init);else return vector(arg, vec(init, args...));}template <typename Element, typename Head, typename ...Args>auto vec(uns_t, Head arg, Args ...args) {return vec(Element(), arg, args...);}template <typename T, typename Compare = less<T>>T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }template <typename T, typename Compare = less<T>>T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }#include <atcoder/segtree>int op(int x, int y) {return max(x, y);}int elem() {return -1;}using segtree = atcoder::segtree<int, op, elem>;int main() {int n, q; cin >> n >> q;string s; cin >> s;auto query = vec<array<int, 2>>(uns, q);for (auto &[x, y] : query) {cin >> x >> y; --x; --y;}auto p = [&] {auto p = vec<int>(uns, n);stack<int> l;for (int i = 0; i < n; ++i) {if (s[i] == '(') {l.push(i);continue;}int v = l.top(); l.pop();p[v] = i;p[i] = v;}return p;}();auto range = [&](int x, int y) {return make_tuple(min({ x, y, p[x], p[y] }),max({ x, y, p[x], p[y] }));};auto idx = vec<int>(uns, q);iota(begin(idx), end(idx), 0);sort(begin(idx), end(idx), [&](auto x, auto y) {auto [l1, r1] = apply(range, query[x]);auto [l2, r2] = apply(range, query[y]);return l1 < l2;});auto ans = vec<int>(uns, q);segtree seg(n);int last = 0;for (auto i : idx) {auto [l, r] = apply(range, query[i]);while (last <= l) {if (s[last] == '(') {seg.set(p[last], last);}++last;}ans[i] = seg.prod(r, n);}for (auto v : ans) {if (v < 0) {cout << -1 << endl;continue;}cout << min(v, p[v]) + 1 << ' ' << max(v, p[v]) + 1 << endl;}}