| Task: | Maalaus |
| Sender: | rendes |
| Submission time: | 2025-10-29 18:21:22 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | TIME LIMIT EXCEEDED | 0 |
| #3 | WRONG ANSWER | 0 |
| #4 | TIME LIMIT EXCEEDED | 0 |
| 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 | TIME LIMIT EXCEEDED | -- | 2, 4 | details |
| #5 | TIME LIMIT EXCEEDED | -- | 2, 4 | details |
| #6 | WRONG ANSWER | 0.03 s | 3, 4 | details |
| #7 | ACCEPTED | 0.01 s | 3, 4 | details |
| #8 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #9 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #10 | ACCEPTED | 0.00 s | 1, 3, 4 | details |
| #11 | WRONG ANSWER | 0.00 s | 1, 3, 4 | details |
| #12 | ACCEPTED | 0.16 s | 2, 4 | details |
| #13 | ACCEPTED | 0.16 s | 2, 4 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 4 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 4 | details |
Compiler report
input/code.cpp: In function 'void getNums(std::string, int**, uint)':
input/code.cpp:10:31: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
10 | for (int i = 0; in.length() > i; i++) {
| ~~~~~~~~~~~~^~~
input/code.cpp:11:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
11 | if (in[i] == ' ' || i == in.length() - 1) {
| ~~^~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:66:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
66 | for (int i = 1; i < cli.size(); i++) {
| ~~^~~~~~~~~~~~
input/code.cpp:9...Code
#include <iostream>
#include <map>
#include <string>
#include <sys/types.h>
#include <vector>
void getNums(const std::string in, int **values,
uint vcount) { // reverse order lmao
uint lastIndex = 0;
for (int i = 0; in.length() > i; i++) {
if (in[i] == ' ' || i == in.length() - 1) {
if (vcount == 0)
return;
vcount--;
*values[vcount] = std::stoi(in.substr(lastIndex, i));
lastIndex = i;
} else if (in[i] > 64 && in[i] < 91) {
vcount--;
*values[vcount] = in[i];
i++;
lastIndex = i;
}
}
}
struct Used {
uint pos;
bool isRow;
uint index;
Used(uint position, bool isrow, uint idex)
: pos(position), isRow(isrow), index(idex) {}
};
struct Cai {
uint color;
uint index;
Cai(uint c, uint i) : color(c), index(i) {}
Cai() {}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::string line;
std::vector<std::string> cli;
while (std::getline(std::cin, line)) {
cli.push_back(line);
}
int w, h, ck;
int **vals;
vals = new int *[3];
vals[2] = &h;
vals[1] = &w;
vals[0] = &ck;
getNums(cli[0], vals, 3);
uint cc = ck;
uint width = w;
uint height = h;
std::map<uint, Cai> columns; // row and color
std::map<uint, Cai> rows;
std::map<uint, std::vector<Used>> usedColors;
for (int i = 1; i < cli.size(); i++) {
getNums(cli[i], vals, 3);
if (h == 'R') {
rows[w] = Cai(ck, i);
usedColors[ck].push_back(Used(w, true, i));
} else {
columns[w] = Cai(ck, i);
usedColors[ck].push_back(Used(w, false, i));
}
}
#define PRINT(x) std::cout << x << " "
uint columncount = columns.size();
uint rowcount = rows.size();
uint lastNum = 0;
for (auto it = usedColors.begin(); it != usedColors.end(); it++) {
#define co it->first
#define us it->second
uint skipCount = co - lastNum;
if (skipCount > 1) { // print all colors that were skipped
for (int i = lastNum + 1; i < co; i++) {
PRINT(0);
}
}
uint num = 0;
for (auto d : us) {
if (d.isRow) {
if (rows[d.pos].color == co && rows[d.pos].index == d.index) {
num += width;
for (auto cl : columns) {
if (cl.second.index > d.index) {
num -= 1;
}
}
}
} else {
if (columns[d.pos].color == co && columns[d.pos].index == d.index) {
num += height;
for (auto cl : rows) {
if (cl.second.index > d.index) {
num -= 1;
}
}
}
}
}
PRINT(num);
lastNum = co;
}
if (cc - 1 != lastNum) {
for (int i = lastNum; i < cc; i++)
PRINT(i);
}
std::cout << "\n";
}
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: TIME LIMIT EXCEEDED
| 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: TIME LIMIT EXCEEDED
| 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: WRONG ANSWER
| input |
|---|
| 1000000000 1000000000 2000 200... |
| correct output |
|---|
| 999999400 2999997760 999999118... |
| user output |
|---|
| 999999400 2999997760 999999118... |
Feedback: Incorrect character on line 1 col 1251: expected "4999997617", got "705030321"
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: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000000000 200000 2... |
| correct output |
|---|
| 0 0 999997829 0 1999872519 199... |
| user output |
|---|
| (empty) |
Test 9
Group: 4
Verdict: TIME LIMIT EXCEEDED
| 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: WRONG ANSWER
| 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 |
Feedback: Output is shorter than expected
Test 12
Group: 2, 4
Verdict: ACCEPTED
| input |
|---|
| 1 1000000000 1 200000 C 298761159 1 R 1 1 C 831911362 1 C 25171734 1 ... |
| correct output |
|---|
| 1000000000 |
| user output |
|---|
| 1000000000 |
Test 13
Group: 2, 4
Verdict: ACCEPTED
| input |
|---|
| 1000000000 1 1 200000 R 68306849 1 C 1 1 C 1 1 R 485427101 1 ... |
| correct output |
|---|
| 1000000000 |
| user output |
|---|
| 1000000000 |
Test 14
Group: 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000000000 100 2000... |
| correct output |
|---|
| 2003899199298 2016897879262 20... |
| user output |
|---|
| (empty) |
Test 15
Group: 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000000000 100 2000... |
| correct output |
|---|
| 1267960483393 1326958437362 12... |
| user output |
|---|
| (empty) |
Test 16
Group: 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000000000 10000 20... |
| correct output |
|---|
| 26998778013 13999380552 239989... |
| user output |
|---|
| (empty) |
Test 17
Group: 4
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000000000 1000000000 10000 20... |
| correct output |
|---|
| 7999699356 8999760379 12999665... |
| user output |
|---|
| (empty) |
