Submission details
Task:Maalaus
Sender:Nyno
Submission time:2025-10-27 12:43:45 +0200
Language:C
Status:READY
Result:10
Feedback
groupverdictscore
#1ACCEPTED10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4details
#2--3, 4details
#3ACCEPTED0.00 s1, 3, 4details
#40.41 s2, 4details
#50.43 s2, 4details
#6--3, 4details
#7--3, 4details
#80.41 s4details
#90.44 s4details
#10ACCEPTED0.00 s1, 3, 4details
#11ACCEPTED0.00 s1, 3, 4details
#12--2, 4details
#13--2, 4details
#140.41 s4details
#150.43 s4details
#160.41 s4details
#170.43 s4details

Compiler report

input/code.c: In function 'main':
input/code.c:11:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d %d", &korkeus, &leveys, &värien_lkm, &operaatioiden_lkm);
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:20:9: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         scanf(" %c %d %d", &c, &t, &väri);
      |         ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <stdio.h>
#include <stdlib.h>

typedef struct {
    int väri;
    int aika;
} Operaatio;

int main() {
    int korkeus, leveys, värien_lkm, operaatioiden_lkm;
    scanf("%d %d %d %d", &korkeus, &leveys, &värien_lkm, &operaatioiden_lkm);

    Operaatio *rivit = calloc(korkeus, sizeof(Operaatio));
    Operaatio *sarakkeet = calloc(leveys, sizeof(Operaatio));
    long long *lkm = calloc(värien_lkm + 1, sizeof(long long));

    for (int i = 1; i <= operaatioiden_lkm; i++) {
        char c;
        int t, väri;
        scanf(" %c %d %d", &c, &t, &väri);
        t--; 

        if (c == 'R' && t >= 0 && t < korkeus)
            rivit[t].väri = väri, rivit[t].aika = i;
        else if (c == 'C' && t >= 0 && t < leveys)
            sarakkeet[t].väri = väri, sarakkeet[t].aika = i;
    }

    for (int i = 0; i < korkeus; i++) {
        for (int j = 0; j < leveys; j++) {
            if (rivit[i].aika == 0 && sarakkeet[j].aika == 0) continue;
            if (rivit[i].aika > sarakkeet[j].aika)
                lkm[rivit[i].väri]++;
            else
                lkm[sarakkeet[j].väri]++;
        }
    }

    for (int v = 1; v <= värien_lkm; v++) {
        printf("%lld%c", lkm[v], v == värien_lkm ? '\n' : ' ');
    }

    free(rivit);
    free(sarakkeet);
    free(lkm);
    return 0;
}

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

correct output
4 4 0 1

user output
4 4 0 1

Test 2 (public)

Group: 3, 4

Verdict:

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

correct output
3999999991 1999999998 19999999...

user output
(empty)

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

correct output
0 13 0 8 7 20 0 0 10 7

user output
0 13 0 8 7 20 0 0 10 7

Test 4

Group: 2, 4

Verdict:

input
1000000000 1000000000 1 200000
R 185082082 1
C 549662476 1
R 484749097 1
R 330334821 1
...

correct output
199984000629575

user output
(empty)

Test 5

Group: 2, 4

Verdict:

input
1000000000 1000000000 1 200000
C 354072394 1
C 221236382 1
C 63527838 1
C 538599654 1
...

correct output
126261014543986

user output
(empty)

Test 6

Group: 3, 4

Verdict:

input
1000000000 1000000000 2000 200...

correct output
999999400 2999997760 999999118...

user output
(empty)

Test 7

Group: 3, 4

Verdict:

input
1000000000 1000000000 2000 200...

correct output
999999481 0 999999445 0 0 0 0 ...

user output
(empty)

Test 8

Group: 4

Verdict:

input
1000000000 1000000000 200000 2...

correct output
0 0 999997829 0 1999872519 199...

user output
(empty)

Test 9

Group: 4

Verdict:

input
1000000000 1000000000 200000 2...

correct output
999986843 0 0 999966411 999971...

user output
(empty)

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

correct output
1 0 0 0 0 0 0 9 0 0

user output
1 0 0 0 0 0 0 9 0 0

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

correct output
0 0 0 0 0 0 0 10 0 0

user output
0 0 0 0 0 0 0 10 0 0

Test 12

Group: 2, 4

Verdict:

input
1 1000000000 1 200000
C 298761159 1
R 1 1
C 831911362 1
C 25171734 1
...

correct output
1000000000

user output
(empty)

Test 13

Group: 2, 4

Verdict:

input
1000000000 1 1 200000
R 68306849 1
C 1 1
C 1 1
R 485427101 1
...

correct output
1000000000

user output
(empty)

Test 14

Group: 4

Verdict:

input
1000000000 1000000000 100 2000...

correct output
2003899199298 2016897879262 20...

user output
(empty)

Test 15

Group: 4

Verdict:

input
1000000000 1000000000 100 2000...

correct output
1267960483393 1326958437362 12...

user output
(empty)

Test 16

Group: 4

Verdict:

input
1000000000 1000000000 10000 20...

correct output
26998778013 13999380552 239989...

user output
(empty)

Test 17

Group: 4

Verdict:

input
1000000000 1000000000 10000 20...

correct output
7999699356 8999760379 12999665...

user output
(empty)