Submission #6003806


Source Code Expand

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
char s[100010];
int n;
int main(){
    scanf("%s",s);
    n=strlen(s);
    if(s[0]!='1'||s[n-1]!='0'){
        //cout<<"asd"<<endl;
        puts("-1");
        return 0;
    }
    for(int i=1;i<n-1;++i){
        if(s[n-i-1]!=s[i]){
            //cout<<i<<" asd"<<endl;
            //cout<<s[i]<<" "<<s[n-i]<<endl;
            puts("-1");
            return 0;
        }
    }
    for(int i=2,rt=1;i<=n;++i){
        printf("%d %d\n",rt,i);
        if(s[i-1]=='1')rt=i;
    }
    return 0;
}

Submission Info

Submission Time
Task E - Tr/ee
User ndqzhang1111
Language C++14 (GCC 5.4.1)
Score 0
Code Size 592 Byte
Status WA
Exec Time 15 ms
Memory 1536 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 2
WA × 1
AC × 20
WA × 28
Set Name Test Cases
Sample sample1_1111.txt, sample2_1110.txt, sample3_1010.txt
All 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 AC 1 ms 384 KB
000.txt AC 1 ms 256 KB
11-1.txt AC 1 ms 384 KB
110.txt AC 1 ms 256 KB
bin.txt WA 1 ms 256 KB
bins.txt WA 1 ms 256 KB
fib.txt WA 1 ms 384 KB
one_0.txt AC 15 ms 1536 KB
one_1.txt AC 15 ms 1536 KB
one_2.txt AC 15 ms 1536 KB
one_3.txt AC 15 ms 1536 KB
rndNO1.txt AC 1 ms 384 KB
rndNO_0.txt AC 1 ms 256 KB
rndNO_1.txt AC 1 ms 256 KB
rndNO_2.txt AC 1 ms 256 KB
rndNO_3.txt AC 1 ms 256 KB
rndNO_4.txt AC 1 ms 256 KB
rndNO_5.txt AC 1 ms 256 KB
rndNOeven.txt AC 1 ms 256 KB
rndNOn.txt AC 1 ms 256 KB
rndNOodd.txt AC 1 ms 384 KB
rndYESeven_0.txt WA 1 ms 256 KB
rndYESeven_1.txt WA 1 ms 256 KB
rndYESeven_2.txt WA 1 ms 256 KB
rndYESeven_3.txt WA 1 ms 256 KB
rndYESeven_4.txt WA 1 ms 256 KB
rndYESeven_5.txt WA 1 ms 256 KB
rndYESeven_6.txt WA 1 ms 256 KB
rndYESeven_7.txt WA 1 ms 256 KB
rndYESeven_8.txt WA 1 ms 256 KB
rndYESeven_9.txt WA 1 ms 256 KB
rndYESodd_0.txt WA 1 ms 256 KB
rndYESodd_1.txt WA 1 ms 256 KB
rndYESodd_2.txt WA 1 ms 256 KB
rndYESodd_3.txt WA 1 ms 256 KB
rndYESodd_4.txt WA 1 ms 256 KB
rndYESodd_5.txt WA 1 ms 256 KB
rndYESodd_6.txt WA 1 ms 256 KB
rndYESodd_7.txt WA 1 ms 256 KB
rndYESodd_8.txt WA 1 ms 256 KB
rndYESodd_9.txt WA 1 ms 256 KB
sample1_1111.txt AC 1 ms 256 KB
sample2_1110.txt AC 1 ms 256 KB
sample3_1010.txt WA 1 ms 256 KB
star_0.txt WA 1 ms 384 KB
star_1.txt WA 1 ms 384 KB
star_2.txt WA 1 ms 384 KB
star_3.txt WA 1 ms 384 KB