207922026-01-09 08:59:06KosAKosRobbanó robotcpp17Wrong answer 40/10021ms580 KiB
#include <iostream>
#include <string>

using namespace std;
int tabla[100][100];
int N,M,K,X,Z;
string P;





int main()
{
    cin >> N;
    cin >> M;
    cin >> K;
    cin >> P;

    int j=0,k=0;

    X = P.length()+2;

    for (int i=0;i<P.length();i++)
    {
        if (P[i] == 'R') {
            k++;
            if (tabla[j][k] == 0) tabla[j][k] = i+2;
        }
        if (P[i] == 'D') {
            j++;
            if (tabla[j][k] == 0) tabla[j][k] = i+2;
        }
        if (P[i] == 'L') {
            k--;
            if (tabla[j][k] == 0) tabla[j][k] = i+2;
        }
        if (P[i] == 'U') {
            j--;
            if (tabla[j][k] == 0) tabla[j][k] = i+2;
        }
    }

    for (int i=0;i<N;i++)
    {
        for (int l=0;l<M;l++)
        {
            if (tabla[i][l] == 0 && i+l != 0 && K > 0)
            {
                tabla[i][l] = 1;
                K--;
            }
        }
    }

    while (K>0)
    {
        int Y=0;
        for (int i=0;i<N;i++)
        {
            for (int l=0;l<M;l++)
            {
                if (tabla[i][l]+1 == X && i+l != 0)
                {
                    tabla[i][l] = 1;
                    K--;
                    X--;
                }
                if (tabla[i][l] > Y) Y = tabla[i][l];
            }
        }

        if (K > 0) {
            for (int i=0;i<N;i++)
            {
                for (int l=0;l<M;l++)
                {
                    if (tabla[i][l] == Y) {
                        tabla[i][l] = 1;
                        K--;
                        X--;
                    }
                }
            }
        }
    }

    k=0;
    j=0;

    for (int i=0;i<P.length();i++)
    {
        if (P[i] == 'R') {
            k++;
            Z++;
            if (tabla[j][k] == 1) {
                cout << Z-1;
                return 0;
            }
        }
        if (P[i] == 'D') {
            j++;
            Z++;
            if (tabla[j][k] == 1) {
                cout << Z-1;
                return 0;
            }
        }
        if (P[i] == 'L') {
            k--;
            Z++;
            if (tabla[j][k] == 1) {
                cout << Z-1;
                return 0;
            }
        }
        if (P[i] == 'U') {
            j--;
            Z++;
            if (tabla[j][k] == 1) {
                cout << Z-1;
                return 0;
            }
        }
    }

    cout << Z;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted1ms316 KiB
2Accepted1ms316 KiB
3Accepted1ms316 KiB
subtask20/25
4Wrong answer1ms316 KiB
5Accepted1ms316 KiB
6Accepted1ms316 KiB
7Accepted1ms316 KiB
8Accepted1ms408 KiB
9Wrong answer1ms316 KiB
10Accepted1ms316 KiB
11Accepted1ms324 KiB
12Accepted1ms316 KiB
13Accepted1ms380 KiB
14Accepted1ms316 KiB
subtask340/40
15Accepted1ms316 KiB
16Accepted1ms316 KiB
17Accepted1ms412 KiB
18Accepted3ms316 KiB
19Accepted3ms316 KiB
20Accepted1ms316 KiB
21Accepted1ms316 KiB
22Accepted1ms316 KiB
23Accepted1ms316 KiB
24Accepted4ms316 KiB
25Accepted2ms444 KiB
subtask40/35
26Accepted1ms316 KiB
27Accepted1ms552 KiB
28Accepted1ms316 KiB
29Wrong answer1ms316 KiB
30Accepted1ms316 KiB
31Accepted1ms316 KiB
32Accepted1ms316 KiB
33Accepted1ms408 KiB
34Wrong answer1ms316 KiB
35Accepted1ms316 KiB
36Accepted1ms324 KiB
37Accepted1ms316 KiB
38Accepted1ms380 KiB
39Accepted1ms316 KiB
40Accepted1ms316 KiB
41Accepted1ms316 KiB
42Accepted1ms412 KiB
43Accepted3ms316 KiB
44Accepted3ms316 KiB
45Accepted1ms316 KiB
46Accepted1ms316 KiB
47Accepted1ms316 KiB
48Accepted1ms316 KiB
49Accepted4ms316 KiB
50Accepted2ms444 KiB
51Wrong answer8ms316 KiB
52Accepted1ms316 KiB
53Accepted1ms316 KiB
54Accepted3ms316 KiB
55Accepted17ms580 KiB
56Accepted1ms316 KiB
57Wrong answer2ms316 KiB
58Accepted1ms508 KiB
59Accepted17ms316 KiB
60Wrong answer21ms548 KiB
61Accepted2ms316 KiB
62Accepted1ms316 KiB
63Wrong answer1ms316 KiB