Submission #1520149
Source Code Expand
#include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<queue> #include<vector> #include<functional> #include<cmath> #include<map> #include<stack> #include<set> #include<numeric> #include<limits> #include<iterator> #include<iterator> #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define rep(i,n) for(int i=0; i<n; i++) #define INF (1<<20) using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef pair<ll, ll> pl; typedef pair<ll, char> plc; int main() { string s1,s2=""; cin >> s1; for (int i =s1.size()-1; i >=0; i--) { if (s1[i] == 'b') s2 += 'd'; else if (s1[i] == 'd')s2 += 'b'; else if (s1[i] == 'p')s2 += 'q'; else if (s1[i] == 'q') s2 += 'p'; else s2[i] += s1[i]; } if (s1 == s2)cout << "Yes" << endl; else cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Mirror String |
User | jj |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 894 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 640 KB |
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, 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 | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 3 ms | 384 KB |
subtask1_02.txt | AC | 5 ms | 512 KB |
subtask1_03.txt | AC | 4 ms | 512 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 5 ms | 512 KB |
subtask1_06.txt | AC | 2 ms | 384 KB |
subtask1_07.txt | AC | 2 ms | 384 KB |
subtask1_08.txt | AC | 2 ms | 384 KB |
subtask1_09.txt | AC | 4 ms | 512 KB |
subtask1_10.txt | AC | 5 ms | 640 KB |
subtask1_11.txt | AC | 5 ms | 640 KB |
subtask1_12.txt | AC | 5 ms | 640 KB |
subtask1_13.txt | AC | 5 ms | 640 KB |
subtask1_14.txt | AC | 5 ms | 512 KB |
subtask1_15.txt | AC | 5 ms | 512 KB |
subtask1_16.txt | AC | 5 ms | 640 KB |
subtask1_17.txt | AC | 5 ms | 640 KB |
subtask1_18.txt | AC | 5 ms | 512 KB |
subtask1_19.txt | AC | 5 ms | 512 KB |