| Task: | Tulkki |
| Sender: | 3lv11ra |
| Submission time: | 2025-11-09 14:04:50 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 12 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 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 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
| #13 | ACCEPTED | 0.00 s | 3 | details |
| #14 | WRONG ANSWER | 0.00 s | 3 | details |
| #15 | WRONG ANSWER | 0.11 s | 3 | details |
| #16 | WRONG ANSWER | 0.01 s | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #18 | WRONG ANSWER | 0.01 s | 3 | details |
Compiler report
input/code.cpp: In function 'void execute(const std::vector<std::__cxx11::basic_string<char> >&, int&)':
input/code.cpp:31:16: 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]
31 | while (pos < tokens.size()) {
| ~~~~^~~~~~~~~~~~~~~
input/code.cpp:55:37: 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]
55 | while (depth > 0 && pos < tokens.size()) {
| ~~~~^~~~~~~~~~~~~~~
input/code.cpp:50:17: warning: unused variable 'start' [-Wunused-variable]
50 | int start = pos;
| ^~~~~Code
#include <bits/stdc++.h>
using namespace std;
unordered_map<char,int> vars; // Muuttujat A-Z
// Poistaa riviltä kommentit
string remove_comment(const string &line) {
size_t pos = line.find('#');
if (pos != string::npos) return line.substr(0, pos);
return line;
}
// Pilkkoo rivin sanoiksi
vector<string> split(const string &s) {
vector<string> res;
string word;
for (char c : s) {
if (isspace(c)) {
if (!word.empty()) res.push_back(word);
word.clear();
} else {
word.push_back(c);
}
}
if (!word.empty()) res.push_back(word);
return res;
}
// Suorittaa komennot
void execute(const vector<string>& tokens, int &pos) {
while (pos < tokens.size()) {
string cmd = tokens[pos];
if (cmd == "CLEAR") {
pos++;
vars[tokens[pos][0]] = 0;
pos++;
} else if (cmd == "INCREASE") {
pos++;
vars[tokens[pos][0]]++;
pos++;
} else if (cmd == "PRINT") {
pos++;
cout << vars[tokens[pos][0]] << " ";
pos++;
} else if (cmd == "REPEAT") {
pos++;
char var = tokens[pos][0];
pos++; // Siirry "TIMES"
pos++; // Siirry "("
int start = pos;
int count = vars[var];
int depth = 1;
vector<string> inner;
// Kerätään sisäkkäiset komennot sulkujen välistä
while (depth > 0 && pos < tokens.size()) {
if (tokens[pos] == "(") depth++;
else if (tokens[pos] == ")") depth--;
if (depth > 0) inner.push_back(tokens[pos]);
pos++;
}
for (int i = 0; i < count; i++) {
int inner_pos = 0;
execute(inner, inner_pos);
}
} else {
pos++; // Ohitetaan tuntemattomat tokenit
}
}
}
int main() {
vars.clear();
for (char c = 'A'; c <= 'Z'; c++) vars[c] = 0;
string line, code;
while (getline(cin, line)) {
line = remove_comment(line);
if (!line.empty()) code += line + " ";
}
vector<string> tokens = split(code);
int pos = 0;
execute(tokens, pos);
cout << endl;
return 0;
}
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: ACCEPTED
| input |
|---|
| INCREASE X # aybabtu PRINT X INCREASE # test ... |
| correct output |
|---|
| 1 3 |
| user output |
|---|
| 1 3 |
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: WRONG ANSWER
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 5 5 |
| user output |
|---|
| 1 1 2 2 3 3 4 4 5 5 |
Feedback: Output is longer than expected
Test 11 (public)
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 20 |
| user output |
|---|
| 7 8 9 10 11 12 14 15 16 17 18 ... |
Feedback: Output is longer than expected
Test 12 (public)
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| INCREASE A INCREASE A INCREASE B INCREASE B ... |
| correct output |
|---|
| 42 |
| user output |
|---|
| (empty) |
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: WRONG ANSWER
| input |
|---|
| # Create number 3 INCREASE A INCREASE A INCREASE... |
| correct output |
|---|
| 12 |
| user output |
|---|
| 4 8 12 |
Feedback: Output is longer than expected
Test 15 (public)
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ... |
| correct output |
|---|
| 531441 |
| user output |
|---|
| 59049 118098 177147 236196 295... |
Feedback: Output is longer than expected
Test 16 (public)
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1337 |
| user output |
|---|
| 15 30 45 60 75 90 105 150 195 ... |
Feedback: Output is longer than expected
Test 17 (public)
Group: 3
Verdict: TIME LIMIT EXCEEDED
| 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 |
|---|
| (empty) |
Test 18 (public)
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| # Efficient algorithm for find... |
| correct output |
|---|
| 2 3 5 7 11 13 17 19 23 29 31 3... |
| user output |
|---|
| (empty) |
Feedback: Output is shorter than expected
