CSES - Putka Open 2020 – 4/5

CSES - Putka Open 2020 – 4/5 - Results

Submission details
Task:	Ruudukko
Sender:	tykkipeli
Submission time:	2020-11-08 22:15:01 +0200
Language:	C++ (C++11)
Status:	READY
Result:	72

Feedback
group	verdict	score
#1	ACCEPTED	5
#2	ACCEPTED	12
#3	ACCEPTED	27
#4	ACCEPTED	28
#5	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 5	details
#2	ACCEPTED	0.01 s	2, 5	details
#3	ACCEPTED	0.01 s	3, 5	details
#4	ACCEPTED	0.01 s	4, 5	details
#5	WRONG ANSWER	0.01 s	5	details
#6	WRONG ANSWER	0.01 s	5	details
#7	ACCEPTED	0.01 s	2, 5	details
#8	ACCEPTED	0.01 s	2, 5	details
#9	ACCEPTED	0.01 s	3, 5	details
#10	ACCEPTED	0.01 s	3, 5	details
#11	ACCEPTED	0.01 s	3, 5	details
#12	ACCEPTED	0.01 s	3, 5	details
#13	ACCEPTED	0.01 s	4, 5	details
#14	WRONG ANSWER	0.01 s	5	details
#15	ACCEPTED	0.01 s	3, 5	details
#16	ACCEPTED	0.01 s	5	details

Compiler report

input/code.cpp: In function 'void tulosta(std::__cxx11::string, bool, bool)':
input/code.cpp:14:40: warning: array subscript has type 'char' [-Wchar-subscripts]
                 cout << convert2[str[i]];
                                        ^
input/code.cpp:21:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i = 0; i < str.size(); i++) {
                             ~~^~~~~~~~~~~~
input/code.cpp:22:39: warning: array subscript has type 'char' [-Wchar-subscripts]
                 cout << convert[str[i]];
                                       ^
input/code.cpp:27:48: warning: array subscript has type 'char' [-Wchar-subscripts]
                 cout << convert2[convert[str[i]]];
                                                ^
input/code.cpp:27:49: warning: array subscript has type 'char' [-Wchar-subscripts]
                 cout << convert2[convert[str[i]]];
                                                 ^
input/code.cpp...

Code

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
char convert[256];
char convert2[256];
 
void tulosta(string str, bool rotate, bool backwards) {
    if (!rotate) {
        if (!backwards) cout << str << "\n";
        else {
            for (int i = str.size()-1; i >= 0; i--) {
                cout << convert2[str[i]];
            }
            cout << "\n";
        }
    }
    else {
        if (!backwards) {
            for (int i = 0; i < str.size(); i++) {
                cout << convert[str[i]];
            }
            cout << "\n";
        } else {
            for (int i = str.size()-1; i >= 0; i--) {
                cout << convert2[convert[str[i]]];
            }
            cout << "\n";
        }
    }
}
 
string oddthree(int m, int x1, int y1, int x2, int y2) {
    if (x1 == x2) {
        string ans = "";
        if (y1 == 3) {
            for (int i = 0; i < x1-1; i++) ans += "L";
            ans += "U";
            for (int i = 0; i < (x1-1)/2; i++) ans += "URDR";
            for (int i = 0; i < (m-x1)/2; i++) ans += "RDRU";
            ans += "U";
            for (int i = 0; i < m-x1; i++) ans += "L";
            return ans;
        } else {
            for (int i = 0; i < x1-1; i++) ans += "L";
            ans += "D";
            for (int i = 0; i < (x1-1)/2; i++) ans += "DRUR";
            for (int i = 0; i < (m-x1)/2; i++) ans += "RURD";
            ans += "D";
            for (int i = 0; i < m-x1; i++) ans += "L";
            return ans;
        }
    }
    string ans = "";
    if (y1 == 2) {
        if (x2 != x1+1 || y2 != 3) {
            ans += "ULD";
            for (int i = 0; i < (x1-2)/2; i++) ans += "LULD";
            ans += "D";
            for (int i = 0; i < x1; i++) ans += "R";
            return ans + oddthree(m-x1, 1, 3, x2-x1, y2);
        } else {
            ans += "DLU";
            for (int i = 0; i < (x1-2)/2; i++) ans += "LDLU";
            ans += "U";
            for (int i = 0; i < x1; i++) ans += "R";
            return ans + oddthree(m-x1, 1, 1, x2-x1, y2);
        }
    }
    if (y2 == 2 && x2 == x1+1) {
        if (y1 == 3) {
            ans += "U";
            for (int i = 0; i < (x1-1)/2; i++) ans += "LDLU";
            ans += "U";
            for (int i = 0; i < m-1; i++) ans += "R";
            ans += "DDLU";
            for (int i = 0; i < (m-1-x2)/2; i++) ans += "LDLU";
            return ans;
        } else {
            ans += "D";
            for (int i = 0; i < (x1-1)/2; i++) ans += "LULD";
            ans += "D";
            for (int i = 0; i < m-1; i++) ans += "R";
            ans += "UULD";
            for (int i = 0; i < (m-1-x2)/2; i++) ans += "LULD";
            return ans;
        }
    }
    if (y1 == 1) {
        if (y2 != 3 || x2 != x1+2) {
            ans += "RDL";
            for (int i = 0; i < (x1-1)/2; i++) ans += "LULD";
            ans += "D";
            for (int i = 0; i < x1+1; i++) ans += "R";
            return ans + oddthree(m-x1-1, 1, 3, x2-x1-1, y2);
        } else {
            for (int i = 0; i < x1-1; i++) ans += "L";
            ans += "D";
            for (int i = 0; i < (x1-1)/2; i++) ans += "DRUR";
            ans += "DRUUR";
            return ans + oddthree(m-x1-1, 1, 1, x2-x1-1, y2);
        }
    } else {
        if (y2 != 1 || x2 != x1+2) {
            ans += "RUL";
            for (int i = 0; i < (x1-1)/2; i++) ans += "LDLU";
            ans += "U";
            for (int i = 0; i < x1+1; i++) ans += "R";
            return ans + oddthree(m-x1-1, 1, 1, x2-x1-1, y2);
        } else {
            for (int i = 0; i < x1-1; i++) ans += "L";
            ans += "U";
            for (int i = 0; i < (x1-1)/2; i++) ans += "URDR";
            ans += "URDDR";
            return ans + oddthree(m-x1-1, 1, 3, x2-x1-1, y2);
        }
    }
}
 
string eventhree(int m, int x1, int y1, int x2, int y2) {
    string ans = "";
    bool backwards = false;
    if (x1 == x2) {
        if (y1 > y2) {
            swap(y1,y2);
            backwards = !backwards;
        }
        if (y1 == 1) {
            if (x1%2 == 0) {
                ans += "L";
                for (int i = 0; i < (x1-2)/2; i++) ans += "DLUL";
                ans += "DD";
                for (int i = 0; i < m-1; i++) ans += "R";
                ans += "U";
                for (int i = 0; i < (m-x1)/2; i++) ans += "ULDL";
            } else {
                backwards = !backwards;
                for (int i = 0; i < (x1-1)/2; i++) ans += "LULD";
                ans += "D";
                for (int i = 0; i < m-1; i++) ans += "R";
                ans += "UUL";
                for (int i = 0; i < (m-x1-1)/2; i++) ans += "DLUL";
            }
        } else {
            if (x1%2 == 0) {
                backwards = !backwards;
                ans += "L";
                for (int i = 0; i < (x1-2)/2; i++) ans += "ULDL";
                ans += "UU";
                for (int i = 0; i < m-1; i++) ans += "R";
                ans += "D";
                for (int i = 0; i < (m-x1)/2; i++) ans += "DLUL";
            } else {
                for (int i = 0; i < (x1-1)/2; i++) ans += "LDLU";
                ans += "U";
                for (int i = 0; i < m-1; i++) ans += "R";
                ans += "DDL";
                for (int i = 0; i < (m-x1-1)/2; i++) ans += "ULDL";
            }
        }
        if (backwards) {
            string uusi = "";
            for (int i = ans.size()-1; i >= 0; i--) {
                uusi += convert2[ans[i]];
            }
            ans = uusi;
        }
        return ans;
    } else {
        /*
        if ((x1%2 == 1 && y1 == 2) || (x2%2 == 0 && y2 == 2)) {
            cout << "NO\n";
            return;
        }
        */
        //if (musta) täytä vasemmalta päädy nurkkaan; ratkaise partion keissi;
        if ((x1+y1)%2 == 0) {
            if (y1 == 1) {
                if (y2 == 3 && x2 == x1+1) {
                    for (int i = 0; i < m-x1; i++) ans += "R";
                    ans += "D";
                    for (int i = 0; i < (m-x1-1)/2; i++) ans += "DLUL";
                    ans += "L";
                    for (int i = 0; i < (x1-1)/2; i++) ans += "LULD";
                    ans += "D";
                    for (int i = 0; i < x1; i++) ans += "R";
                    return ans;
                } else {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "D";
                    for (int i = 0; i < (x1-1)/2; i++) ans += "DRUR";
                    ans += "DR";
                    ans += oddthree(m-x1, 1, 3, x2-x1, y2);
                    return ans;
                }
            } else if (y1 == 2) {
                ans += "U";
                for (int i = 0; i < x1-1; i++) ans += "L";
                ans += "D";
                for (int i = 0; i < (x1-2)/2; i++) ans += "DRUR";
                ans += "DRR";
                ans += eventhree(m-x1, 1, 3, x2-x1, y2);
                return ans;
            } else {
                if (y2 == 1 && x2 == x1+1) {
                    for (int i = 0; i < m-x1; i++) ans += "R";
                    ans += "U";
                    for (int i = 0; i < (m-x1-1)/2; i++) ans += "ULDL";
                    ans += "L";
                    for (int i = 0; i < (x1-1)/2; i++) ans += "LDLU";
                    ans += "U";
                    for (int i = 0; i < x1; i++) ans += "R";
                    return ans;
                } else {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "U";
                    for (int i = 0; i < (x1-1)/2; i++) ans += "URDR";
                    ans += "UR";
                    ans += oddthree(m-x1, 1, 1, x2-x1, y2);
                    return ans;
                }
            }
        //if (valkoinen) täytä vasemmalta päädy keskele, toisen pisteen pakko olla vieressä
        } else {
            if (y1 == 1) {
                if (y2 == 1) {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "DD";
                    for (int i = 0; i < m/2 - 1; i++) ans += "RURD";
                    ans += "RUU";
                    for (int i = 0; i < m-x2; i++) ans += "L"; 
                    return ans;
                } else {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "D";
                    for (int i = 0; i < x1/2; i++) ans += "DRUR";
                    for (int i = 0; i < (m-x2-1)/2; i++) ans += "URDR";
                    ans += "URDD";
                    for (int i = 0; i < m-x2; i++) ans += "L"; 
                    return ans;
                }
            } else if (y1 == 2) {
                //Not possible?
            } else {
                if (y2 == 1) {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "U";
                    for (int i = 0; i < x1/2; i++) ans += "URDR";
                    for (int i = 0; i < (m-x2-1)/2; i++) ans += "DRUR";
                    ans += "DRUU";
                    for (int i = 0; i < m-x2; i++) ans += "L"; 
                    return ans;
                } else {
                    for (int i = 0; i < x1-1; i++) ans += "L";
                    ans += "UU";
                    for (int i = 0; i < m/2 - 1; i++) ans += "RDRU";
                    ans += "RDD";
                    for (int i = 0; i < m-x2; i++) ans += "L"; 
                    return ans;
                }
            }
        }
        
    }
}
 
string solvetwo(int m, int x1, int y1, int x2, int y2) {
    //cout << "here " << m << " " << x1 << " " << y1 << " " << x2 << " " << y2 <<  endl;
    string ans = "";
    if (x1 == 1 && x2 == 1) {
        if (y1 == 1) {
            for (int i = 0; i < m-1; i++) ans += "R";
            ans += "D";
            for (int i = 0; i < m-1; i++) ans += "L";
        } else {
            for (int i = 0; i < m-1; i++) ans += "R";
            ans += "U";
            for (int i = 0; i < m-1; i++) ans += "L";
        }
        return ans;
    }
    if (x1 == m && x2 == m) {
        if (y1 == 1) {
            for (int i = 0; i < m-1; i++) ans += "L";
            ans += "D";
            for (int i = 0; i < m-1; i++) ans += "R";
        } else {
            for (int i = 0; i < m-1; i++) ans += "L";
            ans += "U";
            for (int i = 0; i < m-1; i++) ans += "R";
        }
        return ans;
    }
    for (int i = 1; i < x1; i++) ans += "L";
    if (y1 == 1) ans += "D";
    else ans += "U";
    for (int i = 1; i < x1; i++) ans += "R";
    int x = x1;
    int y = 3-y1;
    bool ylhaalla = true;
    if (y1 == 1) ylhaalla = false;
    while (true) {
        ans += "R";
        x++;
        int newy = y;
        if (ylhaalla) newy++;
        else newy--;
        if (x == x2 && newy == y2) break;
        y = newy;
        if (ylhaalla) ans += "D";
        else ans += "U";
        ylhaalla = !ylhaalla;
    }
    for (int i = 0; i < m-x2; i++) ans += "R";
    if (ylhaalla) ans += "D";
    else ans += "U";
    for (int i = 0; i < m-x2; i++) ans += "L";
    return ans;
}
 
string ymirror(string str) {
    string ans = "";
    for (int i = 0; i < str.size(); i++) {
        if (str[i] == 'U') ans += "D";
        else if (str[i] == 'D') ans += "U";
        else ans += str[i];
    }
    return ans;
}
 
string takaperin(string str) {
    string ans = "";
    for (int i = str.size()-1; i >= 0; i--) {
        ans += convert2[str[i]];
    }
    return ans;
}
 
string solveeven(int n, int m, int x1, int y1, int x2, int y2) {
    //cout << "rekursive start: " << n << " " << m << " " <<  x1 << " " << y1 << " " << x2 << " " << y2 << endl;
    if (n == 2) return solvetwo(m,x1,y1,x2,y2);
    if (y1 == y2) {
        if (y1 == n || (y1 != 1 && y1%2 == 1)) {
            string ans = solveeven(n,m, x1, n-y1+1, x2, n-y2+1);
            return ymirror(ans);
        }
        if (y1 == 1) {
            string ans = "";
            for (int i = 0; i < x1-1; i++) ans += "L";
            for (int i = 0; i < n-1; i++) ans += "D";
            ans += "R";
            for (int j = 0; j < (n-2)/2; j++) {
                for (int i = 0; i < m-2; i++) ans += "R";
                ans += "U";
                for (int i = 0; i < m-2; i++) ans += "L";
                ans += "U";
            }
            for (int i = 0; i < x1-1; i++) ans += "R";
            for (int i = 0; i < (x2-x1-1)/2; i++) ans += "URDR";
            for (int i = 0; i < m-x2; i++) ans += "R";
            ans += "U";
            for (int i = 0; i < m-x2; i++) ans += "L";
            return ans;
        }
        if (x2 < m) {
            string ans = "";
            for (int i = 0; i < x1-1; i++) ans += "L";
            for (int i = 0; i < y1-1; i++) ans += "U";
            ans += "R";
            for (int j = 0; j < y1/2 -1; j++) {
                for (int i = 0; i < m-2; i++) ans += "R";
                ans += "D";
                for (int i = 0; i < m-2; i++) ans += "L";
                ans += "D";
            }
            for (int i = 0; i < m-2; i++) ans += "R";
            ans += "D";
            for (int i = 0; i < m-x2-1; i++) ans += "L";
            ans += "D";
            
            string ans2 = "U";
            for (int i = 0; i < x2-x1-1; i++) ans2 += "R";
            return ans + takaperin(solveeven(n-y1,m, x1+1, 1, x2+1, 1)) + ans2;
        } else {
            // x2 == m
            if (x1 == 1) {
                string ans = "";
                ans += "U";
                if (y1 > 2) {
                    ans += "U";
                    ans += solveeven(y1-2,m, 1, y1-2, 2, y1-2);
                    ans += "D";
                } else {
                    ans += "R";
                }
                ans += "D";
                if (y1 < m) {
                    ans += "D";
                    ans += solveeven(n-y1, m, 2,1, 3,1);
                    ans += "U";
                } else {
                    ans += "R";
                }
                for (int i = 0; i < (m-4)/2; i++) ans += "URDR"; 
                ans += "URD";
                return ans;
                /*
                for (int i = 0; i < y1-1; i++) ans += "U";
                for (int i = 0; i < m-1; i++) ans += "R";
                for (int i = 0; i < y1-2; i++) ans += "D";
                for (int i = 0; i < (m-2)/2; i++) ans += "LULD";
                ans += "DD";
                string ans2 = "U";
                for (int i = 0; i < m-3; i++) ans2 += "R";
                return ans + solveeven(n-y1, m, 2, 1, 3, 1) + ans2;
                */
            } else {
                string ans = "";
                for (int i = 0; i < y1-1; i++) ans += "U";
                ans += "L";
                for (int j = 0; j < y1/2 -1; j++) {
                    for (int i = 0; i < m-2; i++) ans += "L";
                    ans += "D";
                    for (int i = 0; i < m-2; i++) ans += "R";
                    ans += "D";
                }
                for (int i = 0; i < m-2; i++) ans += "L";
                ans += "D";
                for (int i = 0; i < x1-2; i++) ans += "R";
                ans += "D";
                string ans2 = "";
                for (int i = 0; i < x2-x1-1; i++) ans2 += "R";
                ans2 += "D";
                return ans2 + takaperin(solveeven(n-y1,m, x1-1, 1, x2-1, 1)) + takaperin(ans);
            }
        }
    }
    if (y1 > y2) {
        string ans = solveeven(n,m,x1,n-y1+1,x2,n-y2+1);
        return ymirror(ans);
    }
    if (y1%2 == 0) {
        if (x1 > 1) {
            //goto x1-1
            //cout << y1 << " " << m << " " << x1 << " " << y1 << " " << x1-1 << " " << y1 << endl;
            string ans = takaperin(solveeven(y1,m,x1-1,y1, x1, y1));
            ans += "D";
            ans += solveeven(n-y1,m,x1-1,1, x2, y2-y1);
            return ans;
        } else {
            // x1 == 1
            if (x2 != 2) {
                //goto 2
                if (x2 < 2) return solveeven(y1,m,x1,y1, 2, y1) + "D" + takaperin(solveeven(n-y1,m,x2,y2-y1, 2,1));
                else return solveeven(y1,m,x1,y1, 2, y1) + "D" + solveeven(n-y1,m,2,1, x2, y2-y1);
            } else {
                // x2 == 2
                // goto 4
                return solveeven(y1,m,x1,y1, 4, y1) + "D" + takaperin(solveeven(n-y1,m,x2,y2-y1, 4, 1));
            }
        }
    } else if (y2 != y1+1) {
        if (x1 > 2) {
            return takaperin(solveeven(y1+1,m,x1-2,y1+1, x1, y1)) + "D" + solveeven(n-y1-1,m,x1-2,1, x2, y2-y1-1);
        } else {
            // x1 <= 2
            if (x2 != x1+2 || x2 == m) {
                //return solveeven(y1+1,m,x1,y1, x1+2, y1+1) + "D" + solveeven(n-y1-1,m,x1+2,1, x2, y2-y1-1);
                if (x2 >= x1+2) return solveeven(y1+1,m,x1,y1, x1+2, y1+1) + "D" + solveeven(n-y1-1,m,x1+2,1, x2, y2-y1-1);
                else return solveeven(y1+1,m,x1,y1, x1+2, y1+1) + "D" + takaperin(solveeven(n-y1-1,m,x2, y2-y1-1, x1+2, 1));
            } else {
                // x2 == x1+2 eli x1 kelpaa
                //return solveeven(y1+1,m,x1,y1, x1, y1+1) + "D" + takaperin(solveeven(n-y1-1,m, x2,y2-y1-1, x1+4, 1));
                if (x1 == 1) return solveeven(y1+1,m,x1,y1, x1, y1+1) + "D" + solveeven(n-y1-1,m, x1,1, x2, y2-y1-1);
                else {
                    //return solveeven(y1+1,m,x1,y1, x1, y1+1) + "D" + solveeven(n-y1-1,m, x1,1, x2, y2-y1-1);
                    return solveeven(y1+1,m,x1,y1, x1+4, y1+1) + "D" + takaperin(solveeven(n-y1-1,m, x2, y2-y1-1, x1+4, 1));
                }
            }
        }
    } else {
        if (x1 == x2) {
            if (x1 == 1) {
                string ans = "";
                if (y1 > 1) {
                    ans += "U";
                    ans += solveeven(y1-1,m,x1,y1-1, x1+1, y1-1);
                    ans += "D";
                } else {
                    ans += "R";
                }
                for (int i = 0; i < m-2; i++) ans += "R";
                ans += "D";
                for (int i = 0; i < m-2; i++) ans += "L";
                if (y2 == n) return ans + "L";
                else return ans + "D" + takaperin(solveeven(n-y2,m, 1,1, 2,1)) + "U";
            } else if (x1 == m) {
                string ans = "";
                if (y1 > 1) {
                    ans += "U";
                    ans += takaperin(solveeven(y1-1,m,x1-1,y1-1, x1, y1-1));
                    ans += "D";
                } else {
                    ans += "L";
                }
                for (int i = 0; i < m-2; i++) ans += "L";
                ans += "D";
                for (int i = 0; i < m-2; i++) ans += "R";
                if (y2 == n) return ans + "R";
                else return ans + "D" + solveeven(n-y2,m, m-1,1, m,1) + "U";
            } else {
                if (y2 == n) {
                    return takaperin(ymirror(solveeven(n,m,x1,n-y2+1,x2,n-y1+1)));
                } else {
                    if (x1 -1 < m-x1) {
                        string ans = "";
                        if (y1 > 1) {
                            ans += "U";
                            ans += takaperin(solveeven(y1-1, m, x1-1, y1-1, x1, y1-1));
                            ans += "D";
                        } else {
                            ans += "L";
                        }
                        for (int i = 0; i < x1-2; i++) ans += "L";
                        ans += "D";
                        for (int i = 0; i<  x1-2; i++) ans += "R";
                        ans += "D";
                        
                        string ans2 = "";
                        ans2 += "U";
                        for (int i = 0; i < m-x2-2; i++) ans2 += "R";
                        ans2 += "U";
                        for (int i = 0; i < m-x2-1; i++) ans2 += "L";
                        ans2 += "D";
                        ans2 += "L";
                        
                        string lol = solveeven(n-y2,m, x1-1,1, x1+2,1) ;
                        //cout << "ans: " << ans << endl;
                        //cout << "ans: " << ans << endl;
                        //cout << "ans2: " << ans << endl;
                        return ans + lol + ans2;
                    } else {
                        string ans = "";
                        if (y1 > 1) {
                            ans += "U";
                            ans += solveeven(y1-1, m, x1, y1-1, x1+1, y1-1);
                            ans += "D";
                        } else {
                            ans += "R";
                        }
                        for (int i = 0; i < m-x1-1; i++) ans += "R";
                        ans += "D";
                        for (int i = 0; i < m-x1-1; i++) ans += "L";
                        ans += "D";
                        
                        string ans2 = "";
                        ans2 += "U";
                        for (int i = 0; i < x1-3; i++) ans2 += "L";
                        ans2 += "U";
                        for (int i = 0; i < x1-2; i++) ans2 += "R";
                        ans2 += "D";
                        ans2 += "R";
                        return ans + takaperin(solveeven(n-y2,m, x1-2,1, x1+1,1)) + ans2;
                    }
                }
            }
        } else {
            if (x2 != m) {
                string ans = "";
                for (int i = 0; i < x1-1; i++) ans += "L";
                ans += "D";
                for (int i = 0; i < x1; i++) ans += "R";
                for (int i = 0; i < (x2-x1-2)/2; i++) ans += "URDR";
                ans += "U";
                
                if (y1 > 1) {
                    ans += "U";
                    ans += solveeven(y1-1,m,x2-1,y1-1, x2, y1-1);
                    ans += "D";
                } else {
                    ans += "R";
                }
                for (int i = 0; i < m-x2; i++) ans += "R";
                ans += "D";
                for (int i = 0; i < m-x2-1; i++) ans += "L";
                if (y2 == n) return ans + "L";
                else return ans + "D" + takaperin(solveeven(n-y2,m,x2,1, x2+1, 1)) + "U";
            } else {
                string ans = "";
                for (int i = 0; i < x1-1; i++) ans += "L";
                ans += "D";
                for (int i = 0; i < x1-1; i++) ans += "R";
                if (y2 < n) {
                    ans += "D";
                    ans += solveeven(n-y2,m,x1,1, x1+1, 1);
                    ans += "U";
                } else {
                    ans += "R";
                }
                ans += "U";
                if (y1 > 1) {
                    ans += "U";
                    ans += solveeven(y1-1,m,x1+1,y1-1, x1+2, y1-1);
                    ans += "D";
                } else {
                    ans += "R";
                }
                for (int i = 0; i < (x2-x1-2)/2; i++) ans += "DRUR";
                ans += "D";
                return ans;
            }
        }
    }
    /*
    if (y1 even) ratkaise even laatikko rekursiivisesti
    else if (y2 ei seuraavalla rivillä) y1+1-laatiko rekursiivisesti
    else if y2 on seuraavalla rivillä: ratkaise rekursiivisesti yläosa, jos on
    poikkeustapaus jos päällekkäin
    */
}
 
void testCase() {           
    int n,m,y1,x1,y2,x2;
    cin >> n >> m >> y1 >> x1 >> y2 >> x2;
    bool rotate = false;
    bool backwards = false;
    if (n > m) {
        int newy1 = x1;
        int newx1 = n-y1+1;
        y1 = newy1;
        x1 = newx1;
        int newy2 = x2;
        int newx2 = n-y2+1;
        y2 = newy2;
        x2 = newx2;
        rotate = true;
        swap(n,m);
    }
    if (n == 4 && m == 5 && y1 == 1 && x1 == 4 && y2 == 4 && x2 == 2) {
        cout << "YES\n";
        cout << "RDLDRDLLUUULLDRDLDR\n";
        return;
    }
    if (n == 4 && m == 5 && y1 == 4 && x1 == 2 && y2 == 1 && x2 == 4) {
        cout << "YES\n";
        tulosta("RDLDRDLLUUULLDRDLDR", false, true);
        return;
    }
    if (n == 4 && m == 5 && y1 == 1 && x1 == 2 && y2 == 4 && x2 == 4) {
        cout << "YES\n";
        cout << "LDRDLDRRURULURRDDDL\n";
        return;
    }
    if (n == 4 && m == 5 && y1 == 4 && x1 == 4 && y2 == 1 && x2 == 2) {
        cout << "YES\n";
        tulosta("LDRDLDRRURULURRDDDL", false, true);
        return;
    }
    if (x1 > x2) {
        swap(x1,x2);
        swap(y1,y2);
        backwards = true;
    }
    if ((abs(x1-x2) + abs(y1-y2)) % 2 == (n*m)%2) {
        cout << "NO\n";
        return;
    }
    if (n == 1) {
        if (x1 == 1 && x2 == m) {
            cout << "YES\n";
            string ans = "";
            for (int i = 0; i < x2-x1; i++) ans += "R";
            tulosta(ans, rotate, backwards);
        } else {
            cout << "NO\n";
        }
        return;
    }
    if (n == 2) {
        if (((x1 == x2 || x2 == x1+1) && y1 != y2) && !(x1 == 1 && x2 == 1) && !(x1 == m && x2 == m)) {
            cout << "NO\n";
            return;
        }
        string ans = solvetwo(m, x1,y1,x2,y2);
        cout << "YES\n";
        tulosta(ans, rotate, backwards);
        return;
    }
    if (n == 3) {
        string ans = "";
        //pariton ja valkoiset ruudut
        if (m%2 == 1 && (x1 + y1)%2 == 1) {
            cout << "NO\n";
            return;
        }
        if (m%2 == 0 && x1 != x2 && ((x1%2 == 1 && y1 == 2) || (x2%2 == 0 && y2 == 2))) {
            cout << "NO\n";
            return;
        }
        //parillinen ja valkoiset ruudut
        if (m%2 == 0 && (x1+y1)%2 == 1 && x2-x1 > 2) {
            cout << "NO\n";
            return;
        }
        if (m%2 == 0) {
            ans = eventhree(m,x1,y1,x2,y2);
            cout << "YES\n";
            tulosta(ans,rotate,backwards);
            return;
        } else {
            ans = oddthree(m,x1,y1,x2,y2);
            cout << "YES\n";
            tulosta(ans, rotate, backwards);
            return;
        }
    }
    //pariton ja valkoiset ruudut
    if ((m*n)%2 == 1 && (x1 + y1)%2 == 1) {
        cout << "NO\n";
        return;
    }
    if (n%2 == 0) {
        string ans = solveeven(n,m, x1,y1,x2,y2);
        cout << "YES\n";
        tulosta(ans, rotate, backwards);
        return;
    } else {
        
    }
}
 
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    convert['U'] = 'L';
    convert['R'] = 'U';
    convert['D'] = 'R';
    convert['L'] = 'D';
    convert2['U'] = 'D';
    convert2['R'] = 'L';
    convert2['D'] = 'U';
    convert2['L'] = 'R';
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        testCase();
    }
}

Test details

Test 1

Group: 1, 5

Verdict: ACCEPTED

input
`100 1 45 1 45 1 1 1 18 1 1 1 10 1 47 1 17 1 30 1 33 1 28 1 20 ...` view save

correct output
`YES LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...` view save

user output
`YES LLLLLLLLLLLLLLLLLLLLLLLLLLLLLL...` Truncated

Test 2

Group: 2, 5

Verdict: ACCEPTED

input
`100 2 43 1 33 1 21 2 2 1 1 2 2 2 32 1 1 2 8 2 14 1 12 1 14 ...` view save

correct output
`NO NO NO NO YES ...` view save

user output
`NO NO NO NO YES ...` Truncated

Test 3

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 4 2 1 2 4 3 38 2 24 1 22 3 29 2 23 2 3 3 8 3 1 1 2 ...` view save

correct output
`NO NO NO YES RRRRRRRUULDLULDLULDLLUR ...` view save

user output
`NO NO NO YES RRRRRRRUULDLULDLULDLLUR ...` Truncated

Test 4

Group: 4, 5

Verdict: ACCEPTED

input
`100 4 25 2 19 1 5 4 13 3 10 4 12 4 7 3 1 4 2 4 23 1 19 2 5 ...` view save

correct output
`YES DDRRRRRRULLLLLURRRRRULLLLLLLDD...` view save

user output
`YES DLLLLLLLLLLLLLLLLLLDRRRRRRRRRR...` Truncated

Test 5

Group: 5

Verdict: WRONG ANSWER

input
`100 16 8 13 1 14 8 41 21 19 11 32 12 46 17 13 7 6 11 8 41 4 32 4 12 ...` view save

correct output
`NO YES LURULURULURULURULURRDDDDDDDDDR...` view save

user output
`NO NO NO NO NO ...` Truncated

Test 6

Group: 5

Verdict: WRONG ANSWER

input
`100 31 38 18 35 31 37 35 48 7 13 21 21 46 21 25 2 4 19 35 2 13 2 35 1 ...` view save

correct output
`YES LLLLLLLLLLLLDRRRRRRRRRRRRDLLLL...` view save

user output
`NO NO YES UUUUUUUUUUUULDDDDDDDDDDDDDRDLD...` Truncated

Test 7

Group: 2, 5

Verdict: ACCEPTED

input
`100 2 4 1 3 1 4 2 4 2 2 1 1 2 4 2 3 1 2 2 4 2 3 1 4 ...` view save

correct output
`YES LLDRRRU NO NO NO ...` view save

user output
`YES LLDRRRU NO NO NO ...` Truncated

Test 8

Group: 2, 5

Verdict: ACCEPTED

input
`100 2 5 1 2 2 4 2 5 1 2 1 1 2 5 2 1 1 2 2 5 1 1 1 5 ...` view save

correct output
`YES LDRRURRDL YES RRRDLLLLU NO ...` view save

user output
`YES LDRRURRDL YES RRRDLLLLU NO ...` Truncated

Test 9

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 4 1 1 2 3 3 4 2 4 3 2 3 4 2 1 3 1 3 4 1 4 3 4 ...` view save

correct output
`YES DDRRRUULLDR NO YES URRRDDLULDL ...` view save

user output
`YES DDRUURRDDLU NO YES URRRDDLULDL ...` Truncated

Test 10

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 5 3 4 3 2 3 5 3 5 2 3 3 5 3 1 2 2 3 5 3 1 3 2 ...` view save

correct output
`NO NO YES UURRRRDDLULDLU NO ...` view save

user output
`NO NO YES UURRRRDDLULDLU NO ...` Truncated

Test 11

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 8 2 8 1 2 3 8 2 4 1 7 3 8 3 4 2 7 3 8 2 5 3 1 ...` view save

correct output
`NO NO NO YES LLLDRRRRURDRUULLLLLLLDD ...` view save

user output
`NO NO NO YES DRURDRUULLLLDDLLURULLDD ...` Truncated

Test 12

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 9 1 3 2 9 3 9 1 6 1 5 3 9 3 6 2 8 3 9 3 2 3 4 ...` view save

correct output
`NO NO NO NO NO ...` view save

user output
`NO NO NO NO NO ...` Truncated

Test 13

Group: 4, 5

Verdict: ACCEPTED

input
`100 4 4 2 2 1 4 4 4 4 1 2 2 4 4 2 1 4 3 4 4 3 1 3 3 ...` view save

correct output
`YES DDLUUURRDDDRUUU YES UUURRRDLDRDLLUU NO ...` view save

user output
`YES LURRDDLLDRRRUUU YES URDRRULURULLLDR NO ...` Truncated

Test 14

Group: 5

Verdict: WRONG ANSWER

input
`100 12 27 6 22 1 8 6 25 3 2 4 4 6 16 4 6 5 2 36 33 8 6 1 6 ...` view save

correct output
`YES DLDDDDDRUUUURDDDDRUURDDRRULURU...` view save

user output
`YES DLLLLLLLLLLLLLLLLLLLLLDDDDDRRR...` Truncated

Test 15

Group: 3, 5

Verdict: ACCEPTED

input
`100 3 12 3 5 1 4 3 20 3 19 2 19 3 34 3 9 2 9 3 38 2 15 3 15 ...` view save

correct output
`YES RRRRRRRUULDLULDLULDLULDLDLULDL...` view save

user output
`YES RRRRRRRUULDLULDLULDLULDLDLULDL...` Truncated

Test 16

Group: 5

Verdict: ACCEPTED

input
`100 50 50 29 1 16 21 50 50 37 5 23 48 50 50 32 22 45 24 50 50 6 28 12 37 ...` view save

correct output
`YES DDDDDDDDDDDDDDDDDDDDDRUUUUUUUU...` view save

user output
`YES DDDDDDDDDDDDDDDDDDDDDRRRRRRRRR...` Truncated

Putka Open 2020 – 4/5

Ruudukko

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Tasks

Submissions (tykkipeli)