Submission #3452402

---

Source Code Expand

#include<bits/stdc++.h>
#define MAX 10005
using namespace std;
 
int main(){
  string s;
  bool nt = false;
  cin >> s;
  int n = s.size(), t = 1, a[MAX];
  s = '.' + s;
  if(s[1] == '0' || s[n] == '1') nt = true;
  for(int i = 1; i < (n+1)/2; i++){
    if(s[i] != s[n-i]) nt = true;
    if(s[i] == '1') while(t < i) a[t++] = i;
  }
  while(t < (n+1)/2) a[t++] = (n+1)/2;
  if(nt){
    printf("-1\n");
    return 0;
  }
  for(int i = 1; i < (n+1)/2; i++)
    printf("%d %d\n%d %d\n", i, a[i], n+1-i, n+1-a[i]-(!(n&1) && a[i] == n/2 && s[n/2] == '0'));
  if(!(n&1)) printf("%d %d\n", n/2, n/2+1);
}

Submission Info

Judge Result