結果

問題 No.1778 括弧列クエリ / Bracketed Sequence Query
ユーザー oteraotera
提出日時 2021-12-07 01:06:14
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 304 ms / 2,000 ms
コード長 6,353 bytes
コンパイル時間 2,684 ms
コンパイル使用メモリ 222,780 KB
実行使用メモリ 53,128 KB
最終ジャッジ日時 2024-07-07 10:03:17
合計ジャッジ時間 8,546 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 63 ms
5,248 KB
testcase_01 AC 66 ms
5,376 KB
testcase_02 AC 58 ms
5,376 KB
testcase_03 AC 51 ms
5,376 KB
testcase_04 AC 63 ms
5,376 KB
testcase_05 AC 88 ms
22,784 KB
testcase_06 AC 40 ms
7,552 KB
testcase_07 AC 13 ms
13,184 KB
testcase_08 AC 203 ms
51,392 KB
testcase_09 AC 31 ms
19,712 KB
testcase_10 AC 97 ms
39,604 KB
testcase_11 AC 77 ms
28,160 KB
testcase_12 AC 94 ms
22,912 KB
testcase_13 AC 198 ms
50,120 KB
testcase_14 AC 86 ms
35,820 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 211 ms
51,584 KB
testcase_17 AC 209 ms
51,612 KB
testcase_18 AC 211 ms
51,616 KB
testcase_19 AC 206 ms
51,584 KB
testcase_20 AC 204 ms
51,584 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 82 ms
38,784 KB
testcase_24 AC 85 ms
48,128 KB
testcase_25 AC 218 ms
51,936 KB
testcase_26 AC 304 ms
53,128 KB
testcase_27 AC 104 ms
53,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/**
 *    author:  otera
 *    created: 07.12.2021 00:22:09 
**/
#include<bits/stdc++.h>
#include<atcoder/dsu>
using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
#define repa(i, n) for(int i = 0; i < n; ++ i)
#define repb(i, a, b) for(int i = a; i < b; ++ i)
#define repc(i, a, b, c) for(int i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)
#define rep1a(i, n) for(int i = 0; i <= n; ++ i)
#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)
#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)
#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>=1;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define eb emplace_back
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
#define si(c) (int)(c).size()
inline ll popcnt(ull a){ return __builtin_popcountll(a); }
#define tpow(n) (1LL<<(n))
#define unless(A) if(!(A))
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)
#define vec(type,name,...) vector<type>name(__VA_ARGS__)
#define VEC(type,name,size) vector<type>name(size);in(name)
#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)
#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vc<T>>;
template <class T> using vvvc = vector<vvc<T>>;
template <class T> using vvvvc = vector<vvvc<T>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> void scan(T& a){ cin >> a; }
template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }
void print(){ cout << ' '; }
template<class T> void print(const T& a){ cout << a; }
template<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }
int out(){ cout << '\n'; return 0; }
template<class T> int out(const T& t){ print(t); cout << '\n'; return 0; }
template<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x3,x4) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<endl
#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<", "#x4<<": "<<x4<<", "#x5<<": "<<x5<<endl
#ifdef DEBUG
#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)
#define dump(...) { print(#__VA_ARGS__); print(":"); out(__VA_ARGS__); }
#else
#define debug(...)
#define dump(...)
#endif

#define int long long

const int N = 20;

void solve() {
    INT(n, q);
    STR(s);
    stack<P> st;
    vc<int> p(n);
    vc<int> num(n);
    int now = 0;
    vvc<int> g(n);
    atcoder::dsu uf(n);
    vc<P> mp(n);
    rep(i, n) {
        if(s[i] == '(') {
            st.push({i, now});
            num[i] = now;
            ++ now;
        } else {
            assert(si(st) >= 1);
            auto [v, id] = st.top(); st.pop();
            p[v] = i, p[i] = v;
            num[i] = id;
            mp[id] = {v, i};
            if(st.size()) {
                g[st.top().sc].pb(id);
                g[id].pb(st.top().sc);
                uf.merge(st.top().sc, id);
            }
        }
    }
    vc<int> dep(n, -1);
    vvc<int> par(N, vc<int>(n, -1));
    auto dfs = [&](auto &&self, int v, int pa, int d) -> void {
        par[0][v] = pa;
        dep[v] = d;
        for(int nv: g[v]) {
            if(nv == pa) continue;
            self(self, nv, v, d + 1);
        }
    };
    rep(i, n) {
        if(dep[i] == -1) dfs(dfs, i, -1, 0);
    }
    for(int i = 1; i < N; ++ i) {
        rep(j, n) {
            par[i][j] = (par[i - 1][j] == -1 ? -1 : par[i - 1][par[i - 1][j]]);
        }
    }
    auto lca = [&](int x, int y) -> int {
        if(dep[x] > dep[y]) swap(x, y);
        rep(i, N) {
            if((dep[y] - dep[x]) & (1<<i)) {
                y = par[i][y];
            }
        }
        if(x == y) return x;
        per(i, N) {
            if(par[i][x] != par[i][y]) {
                x = par[i][x];
                y = par[i][y];
            }
        }
        return par[0][x];
    };
    rep(i, q) {
        INT(x, y); -- x, -- y;
        int idx = num[x], idy = num[y];
        if(!uf.same(idx, idy)) out(-1);
        else {
            // LCA
            int idz = lca(idx, idy);
            auto [px, py] = mp[idz];
            out(px + 1, py + 1);
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    // cout << fixed << setprecision(20);
    // INT(t); rep(i, t)solve();
    solve();
    return 0;
}
0