Submission #998850
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define Fst first
#define Snd second
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#define M4P(a , b , c , d) make_pair(make_pair((a) , (b)) , make_pair((c) , (d)))
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
#define repv(t,it,v) for(vector<t>::iterator it = v.begin() ; it != v.end() ; ++it)
char s[100010];
char m[100010];
int main(){
scanf("%s" , s);
int n = 0;
for(; s[n] != 0 ; ++n){
if(s[n] == 'b'){
m[n] = 'd';
} else if(s[n] == 'd'){
m[n] = 'b';
} else if(s[n] == 'p'){
m[n] = 'q';
} else {
m[n] = 'p';
}
}
repp(i,0,n){
if(s[i] != m[n-i-1]){
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
Submission Info
Submission Time
2016-11-27 14:29:17+0900
Task
B - Mirror String
User
PIandS
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1128 Byte
Status
AC
Exec Time
2 ms
Memory
384 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:28:17: 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
100 / 100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
128 KB
sample_02.txt
AC
1 ms
128 KB
subtask1_01.txt
AC
2 ms
256 KB
subtask1_02.txt
AC
2 ms
384 KB
subtask1_03.txt
AC
2 ms
256 KB
subtask1_04.txt
AC
1 ms
128 KB
subtask1_05.txt
AC
2 ms
384 KB
subtask1_06.txt
AC
2 ms
256 KB
subtask1_07.txt
AC
2 ms
256 KB
subtask1_08.txt
AC
2 ms
256 KB
subtask1_09.txt
AC
2 ms
256 KB
subtask1_10.txt
AC
2 ms
384 KB
subtask1_11.txt
AC
2 ms
384 KB
subtask1_12.txt
AC
2 ms
384 KB
subtask1_13.txt
AC
2 ms
384 KB
subtask1_14.txt
AC
2 ms
384 KB
subtask1_15.txt
AC
2 ms
384 KB
subtask1_16.txt
AC
2 ms
384 KB
subtask1_17.txt
AC
2 ms
384 KB
subtask1_18.txt
AC
2 ms
384 KB
subtask1_19.txt
AC
2 ms
384 KB