412A - Poster - CodeForces Solution

greedy implementation *900

Please click on ads to support us..

Python Code: 

n, k = map(int, input().split())
a, b, c, t = 'LEFT\n', 'RIGHT\n', 'PRINT ', input()
if 2 * k > n: k, a, b, t = n - k + 1, b, a, t[:: -1]
print(a * (k - 1) + c + ('\n' + b + c).join(t))

C++ Code: 

#include <iostream>
using namespace std;
 
int main() {
    int n, k;
    cin >> n >> k;
    string slogan;
    cin >> slogan;
    if (k - 1 <= n - k) {
        for (int i = 0; i < k - 1; i++) {
            cout << "LEFT" << endl;
        }
        for (int i = 0; i < n - 1; i++) {
            cout << "PRINT " << slogan[i] << endl;
            cout << "RIGHT" << endl;
        }
        cout << "PRINT " << slogan[n - 1] << endl;
    } else {
        for (int i = 0; i < n - k; i++) {
            cout << "RIGHT" << endl;
        }
        for (int i = n - 1; i > 0; i--) {
            cout << "PRINT " << slogan[i] << endl;
            cout << "LEFT" << endl;
        }
        cout << "PRINT " << slogan[0] << endl;
    }
    return 0;
}/*1690241573.9866326*/


Comments

Submit
0 Comments
More Questions

1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing