fork(2) download
copy 
  1. #include<stdio.h>
  2. #include<iostream>
  3. #include<limits.h>
  4. #include<string.h>
  5.  
  6. char s[100001];
  7. int n,flag;
  8. int ind[100000];
  9.  
  10. inline void scan_f(int *a)
  11. {
  12.     char c = 0;
  13.     while(c<33)
  14.         //c = fgetc_unlocked(stdin);
  15.         c = getc(stdin);
  16.     *a = 0;
  17.     while(c>33)
  18.         {
  19.             *a = (*a)*10 + c - '0';
  20.     //c = fgetc_unlocked(stdin);
  21.     c = getc(stdin);
  22.     }
  23. }
  24.  
  25. bool checkregular(int l){
  26.     int status=0,newstat=0;
  27.     n=0;
  28.     flag=0;
  29.     for(int i=0;i<l;i++){
  30.         if(s[i]=='('){
  31.             if(i>0&&s[i-1]==')'&&status!=0){
  32.                 ind[n]=i-1;
  33.                 n++;
  34.                 flag=1;
  35.                 newstat=status;
  36.             }
  37.             status++;
  38.         }
  39.         else{
  40.             status--;
  41.             if(status<0)
  42.                 return false;
  43.             else if((status==0&&flag==0)||(status==newstat&&flag==1)){
  44.                 ind[n]=i;
  45.                 n++;
  46.             }
  47.             else if(status==0&&flag==1){
  48.                 flag=0;
  49.                 newstat=0;
  50.             }
  51.         }
  52.     }
  53.     if(status==0)
  54.         return true;
  55.     return false;
  56. }
  57.  
  58. int finkth(int k,int l){
  59.     int excluded;
  60.     if(k>2*n){
  61.         return -1;
  62.     }
  63.     else if(k<=n){
  64.         excluded=ind[k-1];
  65.         //printf("%d %d %d",k,n,ind[n-k]);
  66.     }
  67.     else{
  68.         int k2=k-n;
  69.         int i=ind[n-k2];
  70.         if(n==k2){
  71.             excluded=i/2;
  72.             //printf("%d %d %d %d %d",k,n,ind[n-k],k2);
  73.         }
  74.         else{
  75.             int j=ind[n-k2-1];
  76.             excluded=i-((i-j)/2);
  77.         }
  78.     }
  79.     return excluded;
  80. }
  81.  
  82. int main(){
  83.     int l,k,res;
  84.     int t;
  85.     scan_f(&t);
  86.     while(t--){
  87.         scanf("%s",s);
  88.         l=strlen(s);
  89.         scan_f(&k);
  90.         if(checkregular(l)){
  91.             res=finkth(k,l);
  92.             if(res>=0){
  93.                 for(int i=0;i<l;i++){
  94.                     if(i!=res){
  95.                         printf("%c",s[i]);
  96.                     }
  97.                 }
  98.                 printf("\n");
  99.             }
  100.             else{
  101.                 printf("%d\n",res);
  102.             }
  103.         }
  104.         else if(k==1){
  105.             printf("%s\n",s);
  106.         }
  107.         else{
  108.             printf("%d\n",-1);
  109.         }
  110.     }
  111.     return 0;
  112. }
Success #stdin #stdout 0s 3632KB
comments ()
stdin
copy 
14
(())()((()))(())
1
(())()((()))(())
2
(())()((()))(())
3
(())()((()))(())
4
(())()((()))(())
5
(())()((()))(())
6
(())()((()))(())
7
(())()((()))(())
8
(())()((()))(())
9
()
2
(()
1
(()
2
(())
2
(())
3
stdout
copy 
(()()((()))(())
(())(((()))(())
(())()((())(())
(())()((()))(()
(())()((()))())
(())()(()))(())
(()))((()))(())
())()((()))(())
-1
)
(()
-1
())
-1
https://ideone.com/4PRXeG
language:
C++14 (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!