結果

問題 No.1778 括弧列クエリ / Bracketed Sequence Query
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-12-07 00:13:48
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 145 ms / 2,000 ms
コード長 4,874 bytes
コンパイル時間 4,800 ms
コンパイル使用メモリ 266,916 KB
実行使用メモリ 9,800 KB
最終ジャッジ日時 2023-09-21 16:09:22
合計ジャッジ時間 10,185 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 60 ms
4,376 KB
testcase_01 AC 60 ms
4,376 KB
testcase_02 AC 60 ms
4,380 KB
testcase_03 AC 52 ms
4,380 KB
testcase_04 AC 62 ms
4,376 KB
testcase_05 AC 62 ms
5,988 KB
testcase_06 AC 38 ms
4,376 KB
testcase_07 AC 4 ms
4,728 KB
testcase_08 AC 130 ms
9,016 KB
testcase_09 AC 13 ms
5,992 KB
testcase_10 AC 55 ms
8,728 KB
testcase_11 AC 48 ms
6,308 KB
testcase_12 AC 68 ms
6,048 KB
testcase_13 AC 123 ms
8,968 KB
testcase_14 AC 48 ms
8,500 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 129 ms
8,944 KB
testcase_17 AC 128 ms
8,952 KB
testcase_18 AC 127 ms
9,012 KB
testcase_19 AC 129 ms
9,004 KB
testcase_20 AC 128 ms
8,944 KB
testcase_21 AC 2 ms
4,376 KB
testcase_22 AC 1 ms
4,380 KB
testcase_23 AC 93 ms
8,688 KB
testcase_24 AC 100 ms
8,944 KB
testcase_25 AC 145 ms
9,080 KB
testcase_26 AC 111 ms
9,796 KB
testcase_27 AC 65 ms
9,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int,int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
typedef string::const_iterator State;
class ParseError {};
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>void print(T a){cout<<a<<endl;}
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout() {
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
ll X;
ll e(){
  return -inf;
}
ll op(ll a,ll b){
  return max(a,b);
}
bool f(ll x){
  return x<X;
}
int main() {
  cincout();
  ll n,q;
  cin>>n>>q;
  string s;
  cin>>s;
  vector<ll> a(n);
  vector<ll> v;
  for(int i=0;i<n;i++){
    if(s[i]=='(') v.pb(i);
    else{
      ll x=v[int(v.size())-1];
      v.pop_back();
      a[x]=i;
      a[i]=x;
    }
  }
  segtree<ll,op,e> seg(a);
  while(q--){
    ll x,y;
    cin>>x>>y;
    x--;
    y--;
    ll p=max(a[x],a[y]);
    chmax(p,x);
    chmax(p,y);
    X=p;
    ll q=min(a[x],a[y]);
    chmin(q,x);
    chmin(q,y);
   // cout<<p<<" "<<q<<endl;
    ll l=seg.min_left<f>(q+1);
    l--;
    if(l<0){
      cout<<-1<<endl;
      continue;
    }
    cout<<l+1<<" "<<a[l]+1<<endl;
  }
}
0