| Task: | slom |
| Sender: | eXeP |
| Submission time: | 2016-08-01 15:42:26 +0300 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 100 |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.06 s | details |
| #2 | ACCEPTED | 0.06 s | details |
| #3 | ACCEPTED | 0.06 s | details |
| #4 | ACCEPTED | 0.06 s | details |
| #5 | ACCEPTED | 0.06 s | details |
| #6 | ACCEPTED | 0.06 s | details |
| #7 | ACCEPTED | 0.06 s | details |
| #8 | ACCEPTED | 0.05 s | details |
| #9 | ACCEPTED | 0.06 s | details |
| #10 | ACCEPTED | 0.06 s | details |
| #11 | ACCEPTED | 0.06 s | details |
| #12 | ACCEPTED | 0.05 s | details |
| #13 | ACCEPTED | 0.06 s | details |
Code
#include <bits/stdc++.h>
#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ld long double
#define defmod 1000000007
#define mati64(a,b) vector<vector<i64>>(a, vector<i64>(b, 0));
using namespace std;
int main(){
cin.sync_with_stdio(0);
cin.tie(0);
int x; cin >> x;
string s; cin >> s;
int n = s.length();
set<string> lel;
int mm = 0;
while(true){
string lol(n, 'c');
int i = 0, j = n-1;
bool fak = 0;
for(int k = 0; k < n; ++k){
if(!fak){
lol[i] = s[k];
i++;
}
else{
lol[j] = s[k];
j--;
}
fak = !fak;
}
if(lel.count(lol))
break;
lel.insert(lol);
mm++;
s = lol;
}
//cout << "cycle " << mm << " jaa " << x%mm << endl;
x = x%mm;
while(x--){
string lol(n, 'c');
int i = 0, j = n-1;
bool fak = 0;
for(int k = 0; k < n; ++k){
if(!fak){
lol[i] = s[k];
i++;
}
else{
lol[j] = s[k];
j--;
}
fak = !fak;
}
s = lol;
//cout << s << endl;
}
cout << s << endl;
return 0;
}Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 4
acefdb |
| correct output |
|---|
| abcdef |
| user output |
|---|
| abcdef |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 1000
aaaaaa |
| correct output |
|---|
| aaaaaa |
| user output |
|---|
| aaaaaa |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 11
srama |
| correct output |
|---|
| sarma |
| user output |
|---|
| sarma |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 10
tbqhcahaje |
| correct output |
|---|
| tqchjeaahb |
| user output |
|---|
| tqchjeaahb |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 50
mvkaysdrpqkahelvtxwd |
| correct output |
|---|
| myphtdvaravsqexwlkdk |
| user output |
|---|
| myphtdvaravsqexwlkdk |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 60
hfhnhgjyqegacpwcvieckehtayuqgi... |
| correct output |
|---|
| hhqcvkagqtccaynfgepieyiuhewgjh... |
| user output |
|---|
| hhqcvkagqtccaynfgepieyiuhewgjh |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100
kqrminhwirfjvnliauxbnltmdxexqg... |
| correct output |
|---|
| kddjxfpoagwhrigjcifgqxwynfwckj... |
| user output |
|---|
| kddjxfpoagwhrigjcifgqxwynfwckj... |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100
renxibkpvavjnopqftypofrtfbfkke... |
| correct output |
|---|
| rpmkvedndjakqcrybmuywbnqspjraq... |
| user output |
|---|
| rpmkvedndjakqcrybmuywbnqspjraq... |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 98765322
pjbsuxmdxyoxmlfokhmgpcnebqcpyx... |
| correct output |
|---|
| pgypycmdmnjkrlkcaqtrwyhdswtmne... |
| user output |
|---|
| pgypycmdmnjkrlkcaqtrwyhdswtmne... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 33892018
bmrtldbdycikkknkifujppdldpqxee... |
| correct output |
|---|
| bwxqwwogalkjqrrarbqlrekfxoltkf... |
| user output |
|---|
| bwxqwwogalkjqrrarbqlrekfxoltkf... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 839254838
xjvoqfnjtgcscdexvaccdetxxppgsl... |
| correct output |
|---|
| xvuocylqxrdedqcirbveydcculfmev... |
| user output |
|---|
| xvuocylqxrdedqcirbveydcculfmev... |
Test 12
Verdict: ACCEPTED
| input |
|---|
| 1000000000
rsiufeylcjcvvyaxuknaxpjmelvugt... |
| correct output |
|---|
| rifyccvaunxjevgumtjieklaxggldh... |
| user output |
|---|
| rifyccvaunxjevgumtjieklaxggldh... |
Test 13
Verdict: ACCEPTED
| input |
|---|
| 997997997
pintfuxuddywgihkulppiuhwdpofbc... |
| correct output |
|---|
| pasfapecysfwqommqhotrublrmbpdn... |
| user output |
|---|
| pasfapecysfwqommqhotrublrmbpdn... |
