CSES - Datatähti 2026 alku

Submission details
Task:	Maalaus
Sender:	zli0122
Submission time:	2025-10-30 19:06:44 +0200
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	10
#2	ACCEPTED	16
#3	ACCEPTED	32
#4	ACCEPTED	42

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 3, 4	details
#2	ACCEPTED	0.00 s	3, 4	details
#3	ACCEPTED	0.00 s	1, 3, 4	details
#4	ACCEPTED	0.13 s	2, 4	details
#5	ACCEPTED	0.09 s	2, 4	details
#6	ACCEPTED	0.01 s	3, 4	details
#7	ACCEPTED	0.01 s	3, 4	details
#8	ACCEPTED	0.14 s	4	details
#9	ACCEPTED	0.12 s	4	details
#10	ACCEPTED	0.00 s	1, 3, 4	details
#11	ACCEPTED	0.00 s	1, 3, 4	details
#12	ACCEPTED	0.07 s	2, 4	details
#13	ACCEPTED	0.08 s	2, 4	details
#14	ACCEPTED	0.13 s	4	details
#15	ACCEPTED	0.10 s	4	details
#16	ACCEPTED	0.13 s	4	details
#17	ACCEPTED	0.10 s	4	details

Code

#include<bits/stdc++.h>

using namespace std;

#define Debug(x) cout << #x << ": " << (x) << "\n"
#define debug(x) cout << #x << ": " << (x) << "; "
#define int long long

const int M = 200000;
int color_counts[M];

void solve() {
    int n, m, k, q;
    cin >> n >> m >> k >> q;
    stack<bool> cmd_is_row;
    stack<pair<int, int>> row_cmd, col_cmd;

    char ch;
    int loc, color;
    for (int i=0; i<q; i++) {
        cin >> ch >> loc >> color;
        cmd_is_row.push(ch == 'R');
        if (ch == 'R') row_cmd.push({loc-1, color-1});
        else col_cmd.push({loc-1, color-1});
    }

    unordered_set<int> row_d, col_d;
    bool is_row;
    int row_cmd_count=0, col_cmd_count=0;
    while (!cmd_is_row.empty()) {
        is_row = cmd_is_row.top();
        cmd_is_row.pop();

        if (is_row) {
            loc = row_cmd.top().first;
            color = row_cmd.top().second;
            row_cmd.pop();

            if (row_d.count(loc)) continue;

            row_d.insert(loc);
            row_cmd_count++;
            color_counts[color]+=(m-col_cmd_count);
        } else {
            loc = col_cmd.top().first;
            color = col_cmd.top().second;
            col_cmd.pop();

            if (col_d.count(loc)) continue;

            col_d.insert(loc);
            col_cmd_count++;
            color_counts[color]+=(n-row_cmd_count);
        }
    }
    for (int i=0;i<k;i++) cout << color_counts[i] << " ";
    cout << "\n";

}

signed main() {
    cin.tie(0) -> ios::sync_with_stdio(0);
    solve();
}

Test details

Test 1 (public)

Group: 1, 3, 4

Verdict: ACCEPTED

input
`3 4 4 4 R 1 1 C 3 4 R 2 2 R 1 1` view save

correct output
`4 4 0 1` view save

user output
`4 4 0 1` view save

Test 2 (public)

Group: 3, 4

Verdict: ACCEPTED

input
`1000000000 1000000000 5 10 C 70724881 4 C 290904744 1 C 569311326 5 R 896293092 1 ...` view save

correct output
`3999999991 1999999998 19999999...` view save

user output
`3999999991 1999999998 19999999...` view save

Test 3

Group: 1, 3, 4

Verdict: ACCEPTED

input
`10 10 10 10 R 10 8 C 1 2 R 10 2 R 1 4 ...` view save

correct output
`0 13 0 8 7 20 0 0 10 7` view save

user output
`0 13 0 8 7 20 0 0 10 7` view save

Test 4

Group: 2, 4

Verdict: ACCEPTED

input
`1000000000 1000000000 1 200000 R 185082082 1 C 549662476 1 R 484749097 1 R 330334821 1 ...` view save

correct output
`199984000629575` view save

user output
`199984000629575` view save

Test 5

Group: 2, 4

Verdict: ACCEPTED

input
`1000000000 1000000000 1 200000 C 354072394 1 C 221236382 1 C 63527838 1 C 538599654 1 ...` view save

correct output
`126261014543986` view save

user output
`126261014543986` view save

Test 6

Group: 3, 4

Verdict: ACCEPTED

input
`1000000000 1000000000 2000 200...` view save

correct output
`999999400 2999997760 999999118...` view save

user output
`999999400 2999997760 999999118...` view save

Test 7

Group: 3, 4

Verdict: ACCEPTED

input
`1000000000 1000000000 2000 200...` view save

correct output
`999999481 0 999999445 0 0 0 0 ...` view save

user output
`999999481 0 999999445 0 0 0 0 ...` view save

Test 8

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 200000 2...` view save

correct output
`0 0 999997829 0 1999872519 199...` view save

user output
`0 0 999997829 0 1999872519 199...` view save

Test 9

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 200000 2...` view save

correct output
`999986843 0 0 999966411 999971...` view save

user output
`999986843 0 0 999966411 999971...` view save

Test 10

Group: 1, 3, 4

Verdict: ACCEPTED

input
`1 10 10 10 C 1 10 R 1 4 C 9 3 R 1 7 ...` view save

correct output
`1 0 0 0 0 0 0 9 0 0` view save

user output
`1 0 0 0 0 0 0 9 0 0` view save

Test 11

Group: 1, 3, 4

Verdict: ACCEPTED

input
`10 1 10 10 R 4 6 R 5 1 R 4 2 R 3 9 ...` view save

correct output
`0 0 0 0 0 0 0 10 0 0` view save

user output
`0 0 0 0 0 0 0 10 0 0` view save

Test 12

Group: 2, 4

Verdict: ACCEPTED

input
`1 1000000000 1 200000 C 298761159 1 R 1 1 C 831911362 1 C 25171734 1 ...` view save

correct output
`1000000000` view save

user output
`1000000000` view save

Test 13

Group: 2, 4

Verdict: ACCEPTED

input
`1000000000 1 1 200000 R 68306849 1 C 1 1 C 1 1 R 485427101 1 ...` view save

correct output
`1000000000` view save

user output
`1000000000` view save

Test 14

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 100 2000...` view save

correct output
`2003899199298 2016897879262 20...` view save

user output
`2003899199298 2016897879262 20...` view save

Test 15

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 100 2000...` view save

correct output
`1267960483393 1326958437362 12...` view save

user output
`1267960483393 1326958437362 12...` view save

Test 16

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 10000 20...` view save

correct output
`26998778013 13999380552 239989...` view save

user output
`26998778013 13999380552 239989...` view save

Test 17

Group: 4

Verdict: ACCEPTED

input
`1000000000 1000000000 10000 20...` view save

correct output
`7999699356 8999760379 12999665...` view save

user output
`7999699356 8999760379 12999665...` view save

Datatähti 2026 alku

Maalaus

Code

Test details

Test 1 (public)

Test 2 (public)

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

Tasks

Submissions (zli0122)