Task: | Merkkijono |
Sender: | valokoodari |
Submission time: | 2018-01-18 15:28:19 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.05 s | details |
#2 | ACCEPTED | 0.05 s | details |
#3 | ACCEPTED | 0.04 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.05 s | details |
Code
#include <bits/stdc++.h> using namespace std; vector<char> al = { 'A','B','C','D','E','F','G', 'H','I','J','K','L','M','N', 'O','P','Q','R','S','T','U', 'V','W','X','Y','Z'}; int main() { string n; cin >> n; vector<int> a(al.size()); for (unsigned int i = 0; i < al.size(); i++) for (unsigned int j = 0; j < al.size(); j++) if (n[i] == al[j]) { a[i] = j; break; } vector<int> b = a; sort(b.begin(), b.end()); int k = 0; int s; vector<int> m; while(b != a) { k++; if (a[0] > a[1] && a[1] != 0) { m.push_back(0); s = a[1]; a.erase(a.begin() + 1); a.insert(a.begin(), s); } else { m.push_back(1); a.insert(a.begin(), a.back()); a.pop_back(); } if (k > 100000) return 1; } // Output cout << k << endl; for (unsigned int i = 0; i < m.size(); i++) cout << ((m[i])?"MOVE":"SWAP") << endl; return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
ABCDEFGHIJKLMNOPQRSTUVWXYZ |
correct output |
---|
0 |
user output |
---|
0 |
Test 2
Verdict: ACCEPTED
input |
---|
ZYXWVUTSRQPONMLKJIHGFEDCBA |
correct output |
---|
923 MOVE MOVE SWAP MOVE ... |
user output |
---|
899 SWAP MOVE MOVE MOVE ... |
Test 3
Verdict: ACCEPTED
input |
---|
RPJMFWBHYQOTXUAENLDGZISCVK |
correct output |
---|
611 SWAP MOVE MOVE SWAP ... |
user output |
---|
593 SWAP MOVE MOVE SWAP ... |
Test 4
Verdict: ACCEPTED
input |
---|
GWJSPBHANMXYFLKIDORVUCEZQT |
correct output |
---|
659 MOVE SWAP MOVE SWAP ... |
user output |
---|
675 MOVE SWAP MOVE SWAP ... |
Test 5
Verdict: ACCEPTED
input |
---|
BJYNFLKEIUCZMQHRAXOGWPSDTV |
correct output |
---|
624 MOVE SWAP MOVE SWAP ... |
user output |
---|
720 MOVE SWAP MOVE SWAP ... |