Submission #1873455
Source Code Expand
#include <iostream> #include <string> #include <algorithm> int main() { std::string s; int n, a[200]; std::cin >> s >> n; for (int i = 0;i < n;i++) { std::cin >> a[i]; } for (int i = 0;i < n/2;i+2) { s[a[i]] = s[a[i] + 1]; s[a[i] + 1] = s[a[i]]; } std::cout << s << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 文字列の反転 |
User | kakakakaneko |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 325 Byte |
Status | WA |
Exec Time | 2103 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0-sample01.txt, subtask0-sample02.txt |
All | subtask0-sample01.txt, subtask0-sample02.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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0-sample01.txt | TLE | 2103 ms | 256 KB |
subtask0-sample02.txt | TLE | 2103 ms | 256 KB |
subtask1-01.txt | WA | 1 ms | 256 KB |
subtask1-02.txt | TLE | 2103 ms | 256 KB |
subtask1-03.txt | TLE | 2103 ms | 256 KB |
subtask1-04.txt | TLE | 2103 ms | 256 KB |
subtask1-05.txt | TLE | 2103 ms | 256 KB |
subtask1-06.txt | TLE | 2103 ms | 256 KB |
subtask1-07.txt | TLE | 2103 ms | 256 KB |
subtask1-08.txt | TLE | 2103 ms | 256 KB |
subtask1-09.txt | TLE | 2103 ms | 256 KB |
subtask1-10.txt | TLE | 2103 ms | 256 KB |
subtask1-11.txt | TLE | 2103 ms | 256 KB |
subtask1-12.txt | TLE | 2103 ms | 256 KB |
subtask1-13.txt | TLE | 2103 ms | 256 KB |
subtask1-14.txt | TLE | 2103 ms | 256 KB |
subtask1-15.txt | TLE | 2103 ms | 256 KB |