| Task: | Tulkki |
| Sender: | Luhpossu |
| Submission time: | 2025-10-28 14:24:56 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.00 s | 2, 3 | details |
| #8 | ACCEPTED | 0.00 s | 2, 3 | details |
| #9 | ACCEPTED | 0.00 s | 2, 3 | details |
| #10 | ACCEPTED | 0.00 s | 2, 3 | details |
| #11 | ACCEPTED | 0.00 s | 2, 3 | details |
| #12 | ACCEPTED | 0.00 s | 2, 3 | details |
| #13 | ACCEPTED | 0.00 s | 3 | details |
| #14 | ACCEPTED | 0.00 s | 3 | details |
| #15 | ACCEPTED | 0.03 s | 3 | details |
| #16 | ACCEPTED | 0.00 s | 3 | details |
| #17 | ACCEPTED | 0.05 s | 3 | details |
| #18 | ACCEPTED | 0.02 s | 3 | details |
Code
#include <algorithm>
#include <cstdlib>
#include <future>
#include <iostream>
#include <map>
#include <memory>
#include <stack>
#include <stdexcept>
#include <string>
#include <vector>
// #define DEBUG
namespace Variables {
std::map<std::string, long long> variables;
long long get(const std::string& key) {
auto it = variables.find(key);
if (it == variables.end()) {
variables.insert({key, 0});
return 0;
}
return it->second;
}
void increase(const std::string& key) {
long long value = get(key) + 1;
variables[key] = value;
}
void clear(const std::string& key) {
variables[key] = 0;
}
};
class Instruction {
public:
virtual void handle() = 0;
virtual ~Instruction() = default;
};
class PrintInstruction : public Instruction {
std::string variable;
public:
PrintInstruction(const std::string& variable) : variable(variable) { }
void handle() override {
std::cout << Variables::get(variable) << " ";
}
};
class ClearInstruction : public Instruction {
std::string variable;
public:
ClearInstruction(const std::string& variable) : variable(variable) { }
void handle() override {
Variables::clear(variable);
}
};
class IncreaseInstruction : public Instruction {
std::string variable;
public:
IncreaseInstruction(const std::string& variable) : variable(variable) { }
void handle() override {
Variables::increase(variable);
}
};
class RepeatInstruction : public Instruction {
std::string variable;
public:
std::vector<std::shared_ptr<Instruction>> instructions;
void handle() override {
auto guh = variable == "" ? 1 : Variables::get(variable);
for (int i = 0; i < guh; i++) {
for (auto ins : instructions) {
ins->handle();
}
}
}
RepeatInstruction(std::string variable = "") : variable(variable) { }
};
std::shared_ptr<Instruction> readPrint() {
std::string str; std::cin >> str;
return std::make_shared<PrintInstruction>(str);
}
std::shared_ptr<Instruction> readClear() {
std::string str; std::cin >> str;
return std::make_shared<ClearInstruction>(str);
}
std::shared_ptr<Instruction> readIncrease() {
std::string str; std::cin >> str;
return std::make_shared<IncreaseInstruction>(str);
}
std::shared_ptr<RepeatInstruction> readRepeat() {
std::string times; std::cin >> times;
std::string trash; std::cin >> trash >> trash; // this is the "TIMES (" text
return std::make_shared<RepeatInstruction>(times);
}
int main([[maybe_unused]] int argc, [[maybe_unused]] char *argv[]) {
auto base = std::make_shared<RepeatInstruction>();
std::stack<std::shared_ptr<RepeatInstruction>> stack;
stack.push(base);
std::string temp;
while (std::cin >> temp) {
switch (temp.at(0)) {
case '#' : {
std::string line;
std::getline(std::cin, line);
break;
}
case 'P' /* Print */: {
stack.top()->instructions.push_back(readPrint());
break;
}
case 'C' /* Clear */: {
stack.top()->instructions.push_back(readClear());
break;
}
case 'I' /* Increase */: {
stack.top()->instructions.push_back(readIncrease());
break;
}
case 'R' /* Repeat */: {
auto guh = readRepeat();
stack.top()->instructions.push_back(guh);
stack.push(guh);
break;
}
case ')' /* Repeat end */: {
stack.pop();
break;
}
case 'E': {
goto END;
}
}
}
END:
base->handle();
}
Test details
Test 1 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| PRINT X INCREASE X PRINT X INCREASE X PRINT X ... |
| correct output |
|---|
| 0 1 2 0 |
| user output |
|---|
| 0 1 2 0 |
Test 2 (public)
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| INCREASE X # aybabtu PRINT X INCREASE # test ... |
| correct output |
|---|
| 1 3 |
| user output |
|---|
| 1 2 |
Feedback: Incorrect character on line 1 col 3: expected "3", got "2"
Test 3 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| # Create number 3 INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 4 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A PRINT A INCREASE B PRINT B INCREASE C ... |
| correct output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| user output |
|---|
| 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
Test 5 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 999 |
| user output |
|---|
| 999 |
Test 6 (public)
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| PRINT X PRINT X PRINT X PRINT X PRINT X ... |
| correct output |
|---|
| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
| user output |
|---|
| 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 7 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 5 5 5 5 5 |
| user output |
|---|
| 5 5 5 5 5 |
Test 8 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 0 0 0 0 0 |
| user output |
|---|
| 0 0 0 0 0 |
Test 9 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 6 7 8 9 10 |
| user output |
|---|
| 6 7 8 9 10 |
Test 10 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 5 5 |
| user output |
|---|
| 5 5 |
Test 11 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 20 |
| user output |
|---|
| 20 |
Test 12 (public)
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE B INCREASE B ... |
| correct output |
|---|
| 42 |
| user output |
|---|
| 42 |
Test 13 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 |
| user output |
|---|
| 1 2 2 3 3 3 4 4 4 4 5 5 5 5 5 |
Test 14 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| # Create number 3 INCREASE A INCREASE A INCREASE... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 12 |
Test 15 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 531441 |
| user output |
|---|
| 531441 |
Test 16 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1337 |
| user output |
|---|
| 1337 |
Test 17 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ... |
| correct output |
|---|
| 1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ... |
| user output |
|---|
| 1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ... |
Test 18 (public)
Group: 3
Verdict: ACCEPTED
| input |
|---|
| # Efficient algorithm for find... |
| correct output |
|---|
| 2 3 5 7 11 13 17 19 23 29 31 3... |
| user output |
|---|
| 2 3 5 7 11 13 17 19 23 29 31 3... |
