Submission #3883374


Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 1<<19;
const int MM = 998244353;

char D[MX];
int main()
{
	int n;
	scanf("%s", D+1);
	n = strlen(D+1);
	if(D[n] == '1' || D[1] == '0') return !printf("-1\n");
	for(int i = 1; i <= n-1; i++){
		if(D[i] != D[n-i]) return !printf("-1\n");
	}

	int cur = 1, root = 1;
	for(int i = 1; i < n; i++){
		if(D[i] == '1'){
			printf("%d %d\n", ++cur, root);
			root = cur;
		}
		else{
			printf("%d %d\n", ++cur, root);
		}
	}
}

Submission Info

Submission Time
Task E - Tr/ee
User zigui
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1715 Byte
Status AC
Exec Time 15 ms
Memory 1536 KiB

Compile Error

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

Judge Result

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