Submission details
Task:Maalaus
Sender:nikke5
Submission time:2025-11-06 18:21:00 +0200
Language:C++ (C++11)
Status:READY
Result:42
Feedback
groupverdictscore
#1ACCEPTED10
#20
#3ACCEPTED32
#40
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 3, 4details
#2ACCEPTED0.01 s3, 4details
#3ACCEPTED0.00 s1, 3, 4details
#4--2, 4details
#5--2, 4details
#6ACCEPTED0.01 s3, 4details
#7ACCEPTED0.01 s3, 4details
#8--4details
#9--4details
#10ACCEPTED0.00 s1, 3, 4details
#11ACCEPTED0.00 s1, 3, 4details
#12--2, 4details
#13--2, 4details
#14--4details
#15--4details
#16--4details
#17--4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:49:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<row>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |             for (int c = 0; c < rivit.size(); c++)
      |                             ~~^~~~~~~~~~~~~~
input/code.cpp:73:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<row>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             for (int c = 0; c < rivit.size(); c++)
      |                             ~~^~~~~~~~~~~~~~
input/code.cpp:99:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<row>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (int i = 0; i < rivit.size(); i++)
      |                     ~~^~~~~~~~~~~~~~

Code

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>

typedef long long ll;
using namespace std;

struct row
{
    int color = 0;
    int x = -1;
    int y = -1;
};

int main()
{

    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int height, width, colorAmount, operationAmount;

    cin >> height >> width >> colorAmount >> operationAmount;

    vector<row> rivit;

    int columnAmount = 0;
    int rowAmount = 0;

    vector<ll> colorResults(colorAmount + 1);

    for (int i = 0; i < operationAmount; i++)
    {
        string operation;
        int location, color;
        cin >> operation >> location >> color;
        location--;

        if (operation == "R")
        {

            bool dupeFound = false;

            for (int c = 0; c < rivit.size(); c++)
            {
                if (rivit[c].y == location)
                {
                    rivit.erase(rivit.begin() + c);
                    i--;
                    operationAmount--;
                    dupeFound = true;
                    break;
                }
            }

            row rivi;
            rivi.color = color;
            rivi.y = location;
            rivit.push_back(rivi);

            if (!dupeFound)
                rowAmount++;
        }
        if (operation == "C")
        {
            bool dupeFound = false;

            for (int c = 0; c < rivit.size(); c++)
            {
                if (rivit[c].x == location)
                {
                    rivit.erase(rivit.begin() + c);
                    i--;
                    operationAmount--;
                    dupeFound = true;
                    break;
                }
            }

            row sarake;
            sarake.color = color;
            sarake.x = location;
            rivit.push_back(sarake);

            if (!dupeFound)
                columnAmount++;
        }
    }

    int currentRowsUnder = 0;
    int currentColumsUnder = 0;

    // lasku
    for (int i = 0; i < rivit.size(); i++)
    {
        if (rivit[i].x == -1)
        {
            //cout << currentColumsUnder << " rivi " << rivit[i].color << "\n";
            // lisätään kaikki rivit, miinustetaan kaikki täydet poikkirivit ja lisätään takaisin ne kohdat joissa tämä rivi on poikkirivin yläpuolella
            colorResults[rivit[i].color] += width - columnAmount + currentColumsUnder;

            currentRowsUnder++;

            // lisätään tyhjät sarakkeet: ( ei tarvii uuella takulla)
            // colorResults[rivit[i].color] += width - columnAmount;
        }
        if (rivit[i].y == -1)
        {
            //cout << currentRowsUnder << " sarake " << rivit[i].color << "\n";
            // lisätään kaikki rivit, miinustetaan kaikki täydet poikkirivit ja lisätään takaisin ne kohdat joissa tämä rivi on poikkirivin yläpuolella
            colorResults[rivit[i].color] += height - rowAmount + currentRowsUnder;

            currentColumsUnder++;

            // lisätään tyhjät rivit:
            //colorResults[rivit[i].color] += height - rowAmount;
        }
    }

    for (int i = 1; i <= colorAmount; i++)
    {
        cout << colorResults[i] << " ";
    }
}

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: ACCEPTED

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

correct output
3999999991 1999999998 19999999...

user output
3999999991 1999999998 19999999...

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: ACCEPTED

input
1000000000 1000000000 2000 200...

correct output
999999400 2999997760 999999118...

user output
999999400 2999997760 999999118...

Test 7

Group: 3, 4

Verdict: ACCEPTED

input
1000000000 1000000000 2000 200...

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

user output
999999481 0 999999445 0 0 0 0 ...

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)