CSES - Datatähti 2024 qualification mirror

CSES - Datatähti 2024 qualification mirror - Results

Submission details
Task:	Uolevin kalansaalis
Sender:	martinm17
Submission time:	2023-11-02 23:03:30 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	ACCEPTED	0.00 s	1, 2	details
#4	WRONG ANSWER	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	ACCEPTED	0.00 s	1, 2	details
#7	ACCEPTED	0.00 s	1, 2	details
#8	ACCEPTED	0.00 s	1, 2	details
#9	ACCEPTED	0.00 s	1, 2	details
#10	ACCEPTED	0.00 s	1, 2	details
#11	ACCEPTED	0.00 s	1, 2	details
#12	ACCEPTED	0.00 s	1, 2	details
#13	ACCEPTED	0.00 s	1, 2	details
#14	ACCEPTED	0.00 s	1, 2	details
#15	WRONG ANSWER	0.00 s	1, 2	details
#16	ACCEPTED	0.07 s	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	WRONG ANSWER	0.55 s	2	details
#20	ACCEPTED	0.07 s	2	details
#21	ACCEPTED	0.04 s	2	details
#22	ACCEPTED	0.04 s	2	details
#23	ACCEPTED	0.02 s	2	details
#24	ACCEPTED	0.06 s	2	details

Code

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int triangleScan(vector<vector<int>> &grid, vector<vector<int>> &dp, int size, int n, int m)
{
    // cout << "///// size is " << size << endl;
    int minTriangle = 1000000;
    for (int i = 0; i < n - size + 1; i++)
    {
        for (int j = 0; j < m - size + 1; j++)
        {
            // cout << "looking at node " << i << " " << j << endl;
            int line = i;
            int column = j;
            int current_min = 0;
            int right_border = column + size - 1;
            int left_border = column;
            for (int k = line; k < line + size; k++)
            {
                // cout << "start " << left_border << " end " << right_border << endl;
                if (left_border > 0)
                {
                    // cout << "line is " << k << " left border is " << left_border << " right border is " << right_border << endl;
                    // cout << "**** sum is " << dp[k][right_border] << " - " << dp[k][left_border - 1] << " = " << dp[k][right_border] - dp[k][left_border - 1] << endl;
                    current_min += dp[k][right_border] - dp[k][left_border - 1];
                }
                else
                {
                    // cout << "**** sum is " << dp[k][right_border] << endl;
                    current_min += dp[k][right_border];
                }
                if (k % 2 == 1)
                    left_border++;
                else
                    right_border--;
                // cout << current_min << endl;
            }
            // cout << "current min is " << current_min << endl;
            minTriangle = min(minTriangle, current_min);
        }
    }
    for (int i = n - 1; i >= size - 1; i--)
    {
        for (int j = 0; j <= m - size; j++)
        {
            // cout << "looking at node " << i << " " << j << endl;
            int line = i;
            int column = j;
            int current_min = 0;
            int right_border = column + size - 1;
            int left_border = column;
            // cout << "right border is " << right_border << " left border is " << left_border << "line is " << line << endl;
            for (int k = size; k > 0; k--)
            {
                // cout << "start " << left_border << " end " << right_border << endl;
                if (left_border > 0)
                {
                    // cout << "line is " << line - size + k << " left border is " << left_border << " right border is " << right_border << endl;
                    // cout << "**** sum is " << dp[line - size + k][right_border] << " - " << dp[line - size + k][left_border - 1] << " = " << dp[line - size + k][right_border] - dp[line - size + k][left_border - 1] << endl;
                    current_min += dp[line - size + k][right_border] - dp[line - size + k][left_border - 1];
                }
                else
                {
                    // cout << "**** sum is " << dp[line - size + k][right_border] << endl;
                    current_min += dp[line - size + k][right_border];
                }
                if ((line - size + k) % 2 == 1)
                    left_border++;
                else
                    right_border--;
                // cout << current_min << endl;
            }
            // cout << "current min is " << current_min << endl;
            minTriangle = min(minTriangle, current_min);
        }
    }
    return minTriangle;
}

int main()
{
    int n, m, k;
    cin >> n >> m >> k;
    vector<vector<int>> adj(n, vector<int>(m, 0));
    int total_points = 0;
    for (int i = 0; i < k; i++)
    {
        int a, b;
        char c;
        cin >> a >> b >> c;
        if (c == 'K')
        {
            adj[a - 1][b - 1] = -10;
            total_points -= 10;
        }
        else if (c == 'H')
        {
            adj[a - 1][b - 1] = 1;
            total_points += 1;
        }
        else
        {
            cout << "Invalid input" << endl;
            return 0;
        }
    }
    int size = min(n, m);
    vector<vector<int>> dp(n, vector<int>(m, 0));
    // scan the graph to caclulate the toatal points from each cell and the beginning of the row
    for (int i = 0; i < n; i++)
    {
        int sum = 0;
        for (int j = 0; j < m; j++)
        {
            sum += adj[i][j];
            dp[i][j] = sum;
        }
    }
    // loop to display dp table
    // for (int i = 0; i < n; i++)
    // {
    //     for (int j = 0; j < m; j++)
    //     {
    //         cout << dp[i][j] << " ";
    //     }
    //     cout << endl;
    // }
    // for a triangle of size "size" use the dp table to calculate the sum of the triangle using substraction
    int result = triangleScan(adj, dp, size, n, m);
    for (int i = size - 1; i >= 1; i--)
    {
        int current = triangleScan(adj, dp, i, n, m);
        if (current >= result)
        {
            break;
        }
        result = current;
    }
    cout << total_points - result << endl;
    // for (int i = size; i > 0; i--)
    // {
    //     minSum = min(minSum, triangleScan(adj, i));
    // }
    // cout << minSum << endl;

    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 13 1 1 K 5 1 K 2 2 H 4 2 H ...` view save

correct output
`-16` view save

user output
`-16` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 1 5 K 4 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`5 6 7 5 5 K 2 6 K 2 4 H 2 5 H ...` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

input
`10 10 51 3 3 H 6 3 H 9 5 H 5 10 H ...` view save

correct output
`50` view save

user output
`48` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 52 3 5 H 3 1 H 9 6 H 2 8 H ...` view save

correct output
`40` view save

user output
`40` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 6 10 H 2 8 H 5 8 H 8 10 H ...` view save

correct output
`-15` view save

user output
`-15` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 60 4 7 H 7 4 H 4 10 H 3 6 H ...` view save

correct output
`60` view save

user output
`60` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 40 9 9 H 5 10 H 5 6 H 4 9 H ...` view save

correct output
`2` view save

user output
`2` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 0` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 K` view save

correct output
`0` view save

user output
`0` view save

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
`1 1 1 1 1 H` view save

correct output
`0` view save

user output
`0` view save

Test 12

Group: 1, 2

Verdict: ACCEPTED

input
`10 5 32 10 3 H 4 4 H 3 3 H 5 4 H ...` view save

correct output
`20` view save

user output
`20` view save

Test 13

Group: 1, 2

Verdict: ACCEPTED

input
`5 10 32 5 9 H 2 4 H 2 9 H 2 5 H ...` view save

correct output
`28` view save

user output
`28` view save

Test 14

Group: 1, 2

Verdict: ACCEPTED

input
`10 10 100 2 9 H 5 4 H 5 9 K 6 1 K ...` view save

correct output
`-439` view save

user output
`-439` view save

Test 15

Group: 1, 2

Verdict: WRONG ANSWER

input
`10 10 100 8 9 H 5 10 H 5 4 H 3 9 H ...` view save

correct output
`88` view save

user output
`85` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`500 500 125000 125 261 K 84 78 K 11 200 K 481 246 K ...` view save

correct output
`-624270` view save

user output
`-624270` view save

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 125100 16 61 H 37 62 H 459 125 H 318 476 H ...` view save

correct output
`124020` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`500 500 249999 22 214 H 356 145 H 341 29 H 393 262 H ...` view save

correct output
`249999` view save

user output
(empty)

Test 19

Group: 2

Verdict: WRONG ANSWER

input
`500 500 32000 30 81 H 315 34 H 78 112 H 367 166 H ...` view save

correct output
`10126` view save

user output
`6846` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`500 500 126745 164 390 H 126 331 H 164 126 H 55 92 H ...` view save

correct output
`-104692` view save

user output
`-104692` view save

Test 21

Group: 2

Verdict: ACCEPTED

input
`500 500 71200 106 191 H 314 189 H 482 485 H 344 401 H ...` view save

correct output
`-335853` view save

user output
`-335853` view save

Test 22

Group: 2

Verdict: ACCEPTED

input
`500 500 67772 421 277 H 428 470 H 169 142 H 256 345 H ...` view save

correct output
`-208567` view save

user output
`-208567` view save

Test 23

Group: 2

Verdict: ACCEPTED

input
`500 500 27434 366 481 H 38 22 H 126 107 H 135 169 H ...` view save

correct output
`-57100` view save

user output
`-57100` view save

Test 24

Group: 2

Verdict: ACCEPTED

input
`500 500 93982 183 13 H 463 230 H 264 351 H 399 290 H ...` view save

correct output
`-52800` view save

user output
`-52800` view save

Datatähti 2024 qualification mirror

Uolevin kalansaalis

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

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Tasks

Submissions (martinm17)