Submission #32155305

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,n) for (ll i=a;i<(ll)n;i++)
ll read(){ll r;scanf("%lld",&r);return r;} // read
int p[400010];
int q[400010];
char s[400010];
char sets(int i,char ch){
  return (s[i] && s[i] != ch) ? 0 : (s[i] = ch);
}
bool work(){
  int n = read() * 2; // 2e5 * 2
  rep(i,0,n) p[i] = read() - 1;
  rep(i,0,n) q[i] = read() - 1;
  for(auto [arr, cmp]:vector<pair<int *,int> > {{p, 1},{q,-1}}){
    rep(i,0,n-1) {
      if((arr[i] - arr[i+1]) * cmp <= 0) continue; // 出现反序列
      if(!sets(arr[i],'(') || !sets(arr[i+1],')')) return false;
    }
  }
  rep(i,0,n) if(!s[i]) return false; // 不唯一
  // check 可能一个合法 另一个不合法
  for(auto [arr,st,d]:vector<tuple<int*,int,int> >{{p,0,1},{q,n-1,-1}}){
    // 双指针
    int i0 = st; // 找所有值
    int i1 = st; // 只找左括号
    int cnt = 0;
    vector<bool> vis(n,false);
    rep(i,0,n){
      int pos ; // 选取的位置
      if(cnt == 0){
        while(vis[i1] || s[i1] != '(') i1+=d;
        pos = i1;
      }else{ // cnt > 0
        while(vis[i0])i0+=d;
        pos = i0;
      }
      if(arr[i] != pos) return false; // 和提供的不一致
      vis[pos] = true;
      cnt += s[pos] == '('?1:-1;
    }
    if(cnt) return false;
  }
  printf("%s\n",s);
  return true;
}
int main(){
  if(!work()) printf("-1\n");
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘ll read()’:
./Main.cpp:5:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    5 | ll read(){ll r;scanf("%lld",&r);return r;} // read
      |                ~~~~~^~~~~~~~~~~

Judge Result