Submission #3300352


Source Code Expand

Copy
#include<bits/stdc++.h>
using namespace std;
//==========================head template==========================
const int N=100010;
int rt=2;
char s[N];
int n;
int X[N],Y[N],ind=0;
inline void adde(int x,int y) {
  X[++ind]=x; Y[ind]=y;
}
signed main() {
  scanf("%s",s+1); n=strlen(s+1);
  for(int i=1;i<=n;i++) s[i]-='0';
  if(!s[1] || s[n]) {puts("-1"); return 0;}
  for(int i=1;i<n-i;i++)
    if(s[i]!=s[n-i]) {
      puts("-1"); return 0;
    } else s[n-i]=0;
  adde(1,2);
  for(int i=2;i<n;i++) {
    if(!s[i]) adde(rt,i+1);
    else {
      adde(rt,i+1);
      rt=i+1;
    }
  }
  for(int i=1;i<=ind;i++)
    printf("%d %d\n",X[i],Y[i]);
  return 0;
}

Submission Info

Submission Time
Task E - Tr/ee
User functionendless
Language C++14 (GCC 5.4.1)
Score 700
Code Size 693 Byte
Status
Exec Time 16 ms
Memory 2304 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",s+1); n=strlen(s+1);
                  ^

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample1_1111.txt, sample2_1110.txt, sample3_1010.txt
All 700 / 700 00-0.txt, 000.txt, 11-1.txt, 110.txt, bin.txt, bins.txt, fib.txt, one_0.txt, one_1.txt, one_2.txt, one_3.txt, rndNO1.txt, rndNO_0.txt, rndNO_1.txt, rndNO_2.txt, rndNO_3.txt, rndNO_4.txt, rndNO_5.txt, rndNOeven.txt, rndNOn.txt, rndNOodd.txt, rndYESeven_0.txt, rndYESeven_1.txt, rndYESeven_2.txt, rndYESeven_3.txt, rndYESeven_4.txt, rndYESeven_5.txt, rndYESeven_6.txt, rndYESeven_7.txt, rndYESeven_8.txt, rndYESeven_9.txt, rndYESodd_0.txt, rndYESodd_1.txt, rndYESodd_2.txt, rndYESodd_3.txt, rndYESodd_4.txt, rndYESodd_5.txt, rndYESodd_6.txt, rndYESodd_7.txt, rndYESodd_8.txt, rndYESodd_9.txt, sample1_1111.txt, sample2_1110.txt, sample3_1010.txt, star_0.txt, star_1.txt, star_2.txt, star_3.txt
Case Name Status Exec Time Memory
00-0.txt 2 ms 384 KB
000.txt 1 ms 256 KB
11-1.txt 2 ms 384 KB
110.txt 1 ms 256 KB
bin.txt 11 ms 1536 KB
bins.txt 1 ms 256 KB
fib.txt 15 ms 2176 KB
one_0.txt 16 ms 2304 KB
one_1.txt 16 ms 2304 KB
one_2.txt 16 ms 2304 KB
one_3.txt 16 ms 2304 KB
rndNO1.txt 2 ms 384 KB
rndNO_0.txt 1 ms 256 KB
rndNO_1.txt 1 ms 256 KB
rndNO_2.txt 1 ms 256 KB
rndNO_3.txt 1 ms 256 KB
rndNO_4.txt 1 ms 256 KB
rndNO_5.txt 1 ms 256 KB
rndNOeven.txt 2 ms 256 KB
rndNOn.txt 2 ms 384 KB
rndNOodd.txt 2 ms 384 KB
rndYESeven_0.txt 2 ms 256 KB
rndYESeven_1.txt 1 ms 256 KB
rndYESeven_2.txt 2 ms 256 KB
rndYESeven_3.txt 1 ms 256 KB
rndYESeven_4.txt 2 ms 384 KB
rndYESeven_5.txt 6 ms 896 KB
rndYESeven_6.txt 1 ms 256 KB
rndYESeven_7.txt 1 ms 256 KB
rndYESeven_8.txt 1 ms 256 KB
rndYESeven_9.txt 1 ms 256 KB
rndYESodd_0.txt 1 ms 256 KB
rndYESodd_1.txt 6 ms 896 KB
rndYESodd_2.txt 2 ms 256 KB
rndYESodd_3.txt 1 ms 256 KB
rndYESodd_4.txt 1 ms 256 KB
rndYESodd_5.txt 1 ms 256 KB
rndYESodd_6.txt 1 ms 256 KB
rndYESodd_7.txt 3 ms 512 KB
rndYESodd_8.txt 1 ms 256 KB
rndYESodd_9.txt 1 ms 256 KB
sample1_1111.txt 1 ms 256 KB
sample2_1110.txt 1 ms 256 KB
sample3_1010.txt 1 ms 256 KB
star_0.txt 15 ms 1920 KB
star_1.txt 15 ms 1920 KB
star_2.txt 15 ms 1920 KB
star_3.txt 15 ms 2048 KB