3A - Shortest path of the king - CodeForces Solution


greedy shortest paths *1000

Please click on ads to support us..

Python Code:

start = input()
end = input()
start = (ord(start[0]) - ord('a'), int(start[1]) - 1)
end = (ord(end[0]) - ord('a'), int(end[1]) - 1)
dx = end[0] - start[0]
dy = end[1] - start[1]
print(max(abs(dx), abs(dy)))
while dx or dy:
    move = ""
    if dx > 0:
        dx -= 1
        move += "R"
    if dx < 0:
        dx += 1
        move += "L"
    if dy > 0:
        dy -= 1
        move += "U"
    if dy < 0:
        dy += 1
        move += "D"
    print(move)

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string s,t;
    cin >> s >> t;
    cout << max(abs(s[0]-t[0]),abs(s[1]-t[1])) << "\n";
    while(s!=t){
        if(s[0]<t[0]){
            cout << 'R';
            s[0]++;
        }
        else if(s[0]>t[0]){
            cout << 'L';
            s[0]--;
        }
        if(s[1]<t[1]){
            cout << 'U';
            s[1]++;
        }
        else if(s[1]>t[1]){
            cout << 'D';
            s[1]--;
        }
        cout << "\n";
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

80A - Panoramix's Prediction
1354B - Ternary String
122B - Lucky Substring
266B - Queue at the School
1490A - Dense Array
1650B - DIV + MOD
1549B - Gregor and the Pawn Game
553A - Kyoya and Colored Balls
1364A - XXXXX
1499B - Binary Removals
1569C - Jury Meeting
108A - Palindromic Times
46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture