Submission #331457
Source Code Expand
#include<iostream>
#include<string>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
#define INF 10000000
char s[102];
int n;
int l;
int r;
char t;
int main()
{
cin>>s;
cin>>n;
rep(i,n)
{
cin>>l>>r;
l--;
rep2(j,l,r)
{
if(j>=r-1-(j-l))break;
t=s[r-1-(j-l)];
s[r-1-(j-l)]=s[j];
s[j]=t;
}
}
cout<<s<<endl;
return 0;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - 文字列の反転 |
| User | tainohimono |
| Language | C++ (G++ 4.6.4) |
| Score | 100 |
| Code Size | 432 Byte |
| Status | AC |
| Exec Time | 26 ms |
| Memory | 924 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 100 / 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 | AC | 26 ms | 796 KiB |
| subtask0-sample02.txt | AC | 24 ms | 924 KiB |
| subtask1-01.txt | AC | 23 ms | 920 KiB |
| subtask1-02.txt | AC | 26 ms | 920 KiB |
| subtask1-03.txt | AC | 25 ms | 664 KiB |
| subtask1-04.txt | AC | 24 ms | 920 KiB |
| subtask1-05.txt | AC | 25 ms | 916 KiB |
| subtask1-06.txt | AC | 25 ms | 920 KiB |
| subtask1-07.txt | AC | 24 ms | 788 KiB |
| subtask1-08.txt | AC | 24 ms | 788 KiB |
| subtask1-09.txt | AC | 25 ms | 916 KiB |
| subtask1-10.txt | AC | 26 ms | 792 KiB |
| subtask1-11.txt | AC | 26 ms | 728 KiB |
| subtask1-12.txt | AC | 26 ms | 796 KiB |
| subtask1-13.txt | AC | 24 ms | 800 KiB |
| subtask1-14.txt | AC | 23 ms | 672 KiB |
| subtask1-15.txt | AC | 23 ms | 800 KiB |