Competitions » Main CodeFu Competitons » CodeFu 2023 » Qualification Results

Qualification Results

These are the final qualification results.
The first 32 competitors will qualify for the finals.
In case of non eligible competitors or competitors who can't compete in the finals, the following competitors (from 33th position onwards) will take their place in the finals.

iletavcioski's solution for 200: Bouncing Factory Balls, written in C++, submitted on 09.04.2023 12:45:55

#include <string>

#include <vector>
using namespace std;

class BouncingFactoryBalls
{
public:
    int numberOfBounces(int x, int y, int M, int N, string direction)
    {
        int mat[M + 1][N + 1][4];
        for (int i = 0; i <= M; i++) {
            for (int j = 0; j <= N; j++) {
                mat[i][j][0] = mat[i][j][1] = mat[i][j][2] = mat[i][j][3] = 0;
            }
        }

        int dir = 0;
        if (direction == "topRight") {
            dir = 1;
        } else if (direction == "bottomRight") {
            dir = 2;
        } else if (direction == "bottomLeft") {
            dir = 3;
        }
        int brojac = 0;

        while (dir != -1) {
            if (mat[x][y][dir]) {
                return -1;
            }

            mat[x][y][dir] = 1;

            if (dir == 0) {
                int moves = min(x, N - y);
                x -= moves;
                y += moves;
                if (x == 0) {
                    dir = 1;
                }
                if (y == N) {
                    dir = 3;
                }
                if (x == 0 and y == N) {
                    dir = 2;
                }
            } else if (dir == 1) {
                int moves = min(M - x, N - y);
                x += moves;
                y += moves;
                if (x == M) {
                    dir = 0;
                }
                if (y == N) {
                    dir = 2;
                }
                if (x == M and y == N) {
                    dir = 3;
                }
            } else if (dir == 2) {
                int moves = min(M - x, y);
                x += moves;
                y -= moves;
                if (x == M) {
                    dir = 3;
                }
                if (y == 0) {
                    dir = 1;
                }
                if (x == M and y == 0) {
                    dir = 0;
                }
            } else {
                int moves = min(x, y);
                x -= moves;
                y -= moves;
                if (x == 0) {
                    dir = 2;
                }
                if (y == 0) {
                    dir = 0;
                }
                if (x == 0 and y == 0) {
                    dir = 1;
                }
            }
            if (x == M && y == 0 && dir == 0) {
                break;
            }
            brojac++;
        }
        return brojac;
    }
};

Test cases result

#	Test Case input	Expected	Received	Status
1.	1, 1, 4, 5, "bottomRight"	4	4	Correct
2.	1, 2, 3, 5, "bottomLeft"	10	10	Correct
3.	0, 0, 3, 1, "bottomRight"	-1	-1	Correct
4.	1, 0, 2, 1, "bottomLeft"	-1	-1	Correct
5.	1, 4, 3, 5, "topLeft"	7	7	Correct
6.	1, 2, 4, 4, "bottomLeft"	-1	-1	Correct
7.	1, 0, 3, 3, "bottomRight"	-1	-1	Correct
8.	0, 1, 1, 2, "bottomRight"	0	0	Correct
9.	0, 3, 1, 4, "bottomLeft"	3	3	Correct
10.	1, 0, 2, 1, "topRight"	-1	-1	Correct
11.	347, 12, 429, 37, "bottomLeft"	600	600	Correct
12.	4, 117, 141, 122, "topLeft"	359	359	Correct
13.	38, 42, 42, 107, "topLeft"	287	287	Correct
14.	17, 250, 437, 497, "bottomRight"	1717	1717	Correct
15.	195, 47, 302, 427, "topLeft"	172	172	Correct
16.	404, 224, 458, 271, "topRight"	1032	1032	Correct
17.	2, 189, 5, 286, "bottomLeft"	502	502	Correct
18.	70, 90, 100, 174, "topRight"	216	216	Correct
19.	4, 35, 5, 487, "topLeft"	188	188	Correct
20.	412, 29, 481, 426, "bottomRight"	987	987	Correct
21.	23, 1, 302, 16, "bottomLeft"	61	61	Correct
22.	400, 87, 467, 158, "bottomRight"	1059	1059	Correct
23.	236, 114, 446, 275, "bottomLeft"	1292	1292	Correct
24.	120, 111, 231, 128, "topRight"	398	398	Correct
25.	384, 58, 420, 83, "bottomRight"	629	629	Correct
26.	4, 171, 143, 387, "bottomRight"	104	104	Correct
27.	143, 287, 310, 330, "topLeft"	10	10	Correct
28.	187, 104, 385, 107, "topRight"	57	57	Correct
29.	13, 82, 95, 260, "bottomRight"	0	0	Correct
30.	125, 211, 432, 269, "bottomLeft"	315	315	Correct
31.	338, 9, 405, 122, "topLeft"	58	58	Correct
32.	99, 367, 332, 387, "bottomLeft"	1022	1022	Correct
33.	62, 164, 250, 344, "bottomLeft"	219	219	Correct
34.	4, 449, 225, 463, "bottomRight"	899	899	Correct
35.	210, 52, 220, 267, "bottomLeft"	473	473	Correct
36.	1, 65, 68, 258, "bottomLeft"	278	278	Correct
37.	108, 43, 115, 450, "topRight"	87	87	Correct
38.	50, 155, 211, 201, "bottomRight"	246	246	Correct
39.	122, 46, 286, 87, "topLeft"	553	553	Correct
40.	87, 37, 464, 327, "topLeft"	742	742	Correct
41.	115, 13, 300, 94, "topLeft"	80	80	Correct
42.	186, 191, 355, 217, "topRight"	143	143	Correct
43.	12, 43, 17, 317, "bottomLeft"	159	159	Correct
44.	66, 125, 75, 191, "topRight"	436	436	Correct
45.	90, 151, 119, 380, "topRight"	550	550	Correct
46.	1, 222, 155, 267, "topLeft"	797	797	Correct
47.	198, 184, 294, 379, "topLeft"	775	775	Correct
48.	23, 216, 49, 412, "topLeft"	314	314	Correct
49.	5, 38, 55, 107, "topLeft"	10	10	Correct
50.	6, 221, 17, 453, "bottomRight"	509	509	Correct
51.	21, 176, 163, 221, "bottomLeft"	424	424	Correct
52.	43, 116, 149, 187, "topRight"	664	664	Correct
53.	68, 21, 131, 174, "bottomRight"	158	158	Correct
54.	34, 175, 67, 247, "topLeft"	24	24	Correct
55.	287, 325, 360, 361, "topLeft"	502	502	Correct
56.	256, 62, 414, 255, "topLeft"	218	218	Correct
57.	338, 35, 409, 130, "topLeft"	346	346	Correct
58.	82, 7, 345, 31, "bottomLeft"	620	620	Correct
59.	451, 90, 467, 342, "topLeft"	1109	1109	Correct
60.	12, 9, 61, 108, "bottomRight"	88	88	Correct
61.	13, 145, 286, 149, "topLeft"	545	545	Correct
62.	15, 39, 54, 42, "topLeft"	29	29	Correct
63.	153, 376, 287, 467, "topRight"	633	633	Correct
64.	74, 133, 195, 319, "bottomLeft"	169	169	Correct
65.	140, 181, 249, 220, "topRight"	916	916	Correct
66.	106, 0, 300, 19, "topRight"	344	344	Correct
67.	300, 270, 444, 345, "topLeft"	377	377	Correct
68.	72, 393, 185, 412, "topRight"	1086	1086	Correct
69.	157, 48, 461, 54, "topLeft"	184	184	Correct
70.	78, 7, 159, 11, "topRight"	7	7	Correct
71.	0, 254, 254, 397, "topRight"	1298	1298	Correct
72.	89, 16, 383, 18, "bottomRight"	60	60	Correct
73.	268, 17, 303, 84, "bottomRight"	120	120	Correct
74.	256, 12, 282, 121, "topLeft"	663	663	Correct
75.	132, 83, 199, 170, "topRight"	65	65	Correct
76.	68, 37, 81, 106, "topRight"	3	3	Correct
77.	245, 170, 279, 271, "topLeft"	514	514	Correct
78.	62, 57, 199, 273, "bottomLeft"	924	924	Correct
79.	87, 47, 220, 189, "topRight"	778	778	Correct
80.	289, 15, 318, 241, "bottomLeft"	638	638	Correct
81.	20, 132, 28, 395, "bottomLeft"	426	426	Correct
82.	10, 55, 115, 263, "topRight"	654	654	Correct
83.	6, 66, 16, 234, "bottomLeft"	35	35	Correct
84.	18, 267, 487, 469, "topRight"	767	767	Correct
85.	21, 22, 37, 75, "bottomLeft"	109	109	Correct
86.	192, 41, 221, 376, "bottomRight"	1085	1085	Correct
87.	0, 83, 1, 278, "topLeft"	473	473	Correct
88.	14, 369, 71, 419, "topLeft"	945	945	Correct
89.	124, 206, 202, 342, "bottomLeft"	468	468	Correct
90.	148, 172, 170, 183, "bottomLeft"	295	295	Correct
91.	83, 147, 116, 490, "bottomLeft"	11	11	Correct
92.	36, 66, 118, 102, "topRight"	172	172	Correct
93.	81, 216, 85, 382, "bottomRight"	464	464	Correct
94.	148, 158, 254, 447, "bottomLeft"	1390	1390	Correct
95.	147, 179, 160, 212, "topRight"	35	35	Correct
96.	8, 99, 59, 351, "topLeft"	705	705	Correct
97.	106, 24, 198, 62, "topLeft"	64	64	Correct
98.	129, 43, 272, 397, "topLeft"	264	264	Correct
99.	190, 2, 470, 71, "topRight"	323	323	Correct
100.	22, 25, 25, 88, "bottomLeft"	198	198	Correct