— Dark mode

Putka Open 2020 – 4/5

Ruudukko

  • Start: 2020-11-06 18:00:00
  • End: 2020-11-08 23:00:00
CSES - Putka Open 2020 – 4/5 - Results
Submission details
Task:Ruudukko
Sender:Lieska
Submission time:2020-11-08 21:57:01 +0200
Language:C++11
Status:READY
Result:17
Feedback
groupverdictscore
#1ACCEPTED5
#2ACCEPTED12
#30
#40
#50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 5details
#2ACCEPTED0.01 s2, 5details
#30.01 s3, 5details
#40.01 s4, 5details
#50.01 s5details
#60.01 s5details
#7ACCEPTED0.01 s2, 5details
#8ACCEPTED0.01 s2, 5details
#90.01 s3, 5details
#100.01 s3, 5details
#110.01 s3, 5details
#120.01 s3, 5details
#130.01 s4, 5details
#140.01 s5details
#150.01 s3, 5details
#160.01 s5details

Compiler report

input/code.cpp: In function 'void test()':
input/code.cpp:115:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i=0; i<ans.size(); ++i){
                           ~^~~~~~~~~~~
input/code.cpp:120:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i=0; i<ans.size(); ++i){
                           ~^~~~~~~~~~~
input/code.cpp:127:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for (int i=0; i<ans.size(); ++i){
                           ~^~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;

#define PB push_back

void test(){
    int n, m, y1, x1, y2, x2;
    cin >> n >> m >> y1 >> x1 >> y2 >> x2;
    if (n==1){
        if (x1==1 && x2==m){
            cout << "YES\n";
            for (int i=1; i<m; ++i) cout << 'R';
            cout << "\n";
        }
        else if (x1==m && x2==1){
            cout << "YES\n";
            for (int i=1; i<m; ++i) cout << 'L';
            cout << "\n";
        }
        else cout << "NO\n";
        return;
    }
    if (n==2){
        vector<int> ans;
        int a=0, b=0, c=0;
        // a: alun ja lopun paikat vaihdettu. b: peilattu y-akselin suunnassa. c: peilattu x-akselin suunnassa.
        if ((abs(x2-x1)+abs(y2-y1))%2==0) {
            cout << "NO\n";
            return;
        }
        if (x1==x2){
            if (x1!=1 && x1!=m){
                cout << "NO\n";
                return;
            }
            if (y2<y1){
                a=1;
            }
            if (x1==m){
                c=1;
            }
            for (int i=1; i<=m-1; ++i){
                ans.PB(1);
            }
            ans.PB(2);
            for (int i=m; i>=2; --i){
                ans.PB(3);
            }
        }
        else if (y1==y2){
            if (x1>x2){
                a=1;
                swap(x1, x2);
            }
            if (y1==2){
                b=1;
            }
            for (int i=x1; i>=2; --i){
                ans.PB(3);
            }
            ans.PB(2);
            for (int i=1; i<=x1-1; ++i){
                ans.PB(1);
            }
            for (int i=x1+1; i<x2; i+=2){
                ans.PB(1);
                ans.PB(0);
                ans.PB(1);
                ans.PB(2);
            }
            ans.PB(1);
            for (int i=x2; i<=m-1; ++i){
                ans.PB(1);
            }
            ans.PB(0);
            for (int i=m; i>=x2+1; --i){
                ans.PB(3);
            }
        }
        else{
            if (x1>x2){
                a=1;
                swap(x1, x2);
                swap(y1, y2);
            }
            if (y1==2){
                b=1;
            }
            for (int i=x1; i>=2; --i){
                ans.PB(3);
            }
            ans.PB(2);
            for (int i=1; i<=x1-1; ++i){
                ans.PB(1);
            }
            for (int i=1; i<=(x2-x1)/2-1; ++i){
                ans.PB(1);
                ans.PB(0);
                ans.PB(1);
                ans.PB(2);
            }
            ans.PB(1);
            ans.PB(0);
            ans.PB(1);
            for (int i=x2; i<=m-1; ++i){
                ans.PB(1);
            }
            ans.PB(2);
            for (int i=m; i>=x2+1; --i){
                ans.PB(3);
            }
        }
        if (a){
            reverse(ans.begin(), ans.end());
            for (int i=0; i<ans.size(); ++i){
                ans[i]=(ans[i]+2)%4;
            }
        }
        if (b){
            for (int i=0; i<ans.size(); ++i){
                if (ans[i]%2==0){
                    ans[i]=(ans[i]+2)%4;
                }
            }
        }
        if (c){
            for (int i=0; i<ans.size(); ++i){
                if (ans[i]%2==1){
                    ans[i]=(ans[i]+2)%4;
                }
            }
        }
        cout << "YES\n";
        for (auto u:ans){
            if (u==0) cout << "U";
            if (u==1) cout << "R";
            if (u==2) cout << "D";
            if (u==3) cout << "L";
        }
        cout << "\n";
    }
}


int main(){
    int tests;
    cin >> tests;
    while (tests--) test();
}

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...
view save

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
...
view save

Test 3

Group: 3, 5

Verdict:

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
(empty)

Test 4

Group: 4, 5

Verdict:

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
(empty)

Test 5

Group: 5

Verdict:

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
YES
RRRRRRRRRRRRRDLLLLLLLLLLLLLLUL...
view save

Test 6

Group: 5

Verdict:

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
YES
RRRRRDLLLLLLULDLULDLULDLULDLUL...
view save

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
...
view save

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
...
view save

Test 9

Group: 3, 5

Verdict:

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
(empty)

Test 10

Group: 3, 5

Verdict:

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
(empty)

Test 11

Group: 3, 5

Verdict:

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
(empty)

Test 12

Group: 3, 5

Verdict:

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
(empty)

Test 13

Group: 4, 5

Verdict:

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
(empty)

Test 14

Group: 5

Verdict:

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
(empty)

Test 15

Group: 3, 5

Verdict:

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
(empty)

Test 16

Group: 5

Verdict:

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
(empty)

Tasks

A Neliöt-B Peli-C Tekijät-D Ruudukko-

Submissions (Lieska)

2020-11-08 22:13:03 52020-11-08 21:57:01 172020-11-08 21:44:19 52020-11-08 21:39:08 52020-11-08 21:27:42 52020-11-08 21:10:12 02020-11-08 19:49:44 02020-11-08 19:48:50 02020-11-08 19:17:53 02020-11-08 19:12:33 02020-11-08 18:53:32 02020-11-08 18:50:46 02020-11-08 18:48:45