| Task: | Tulkki |
| Sender: | nikke5 |
| Submission time: | 2025-11-05 21:32:58 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 44 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 12 |
| #2 | ACCEPTED | 32 |
| #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 | 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.27 s | 3 | details |
| #16 | WRONG ANSWER | 0.00 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 repeatNested(int, std::vector<std::__cxx11::basic_string<char> >)':
input/code.cpp:37:23: 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]
37 | for (int i = 0; i < comingInputs.size(); i++)
| ~~^~~~~~~~~~~~~~~~~~~~~
input/code.cpp:93:27: 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]
93 | for (int i = 0; i < inputs.size(); i++)
| ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'void repeat(int)':
input/code.cpp:229:27: 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]
229 | for (int...Code
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <chrono>
#include <iomanip>
typedef long long ll;
using namespace std;
void clear(int &var)
{
var = 0;
}
void increase(int &var)
{
var++;
}
void print(int &var)
{
cout << var << " ";
}
int variables[25] = {0};
void repeatNested(int repeattimes, vector<string> comingInputs)
{
vector<string> inputs;
vector<char> inputs2;
vector<string> repeatInputs[1000];
for (int i = 0; i < comingInputs.size(); i++)
{
string input = comingInputs[i];
if (input == "CLEAR")
{
i++;
char input2 = comingInputs[i][0];
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "INCREASE")
{
i++;
char input2 = comingInputs[i][0];
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "PRINT")
{
i++;
char input2 = comingInputs[i][0];
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "REPEAT")
{
i++;
char input2 = comingInputs[i][0];
inputs.push_back(input);
inputs2.push_back(input2);
int nestAmount = 1;
while (nestAmount > 0)
{
i++;
repeatInputs[inputs.size() - 1].push_back(comingInputs[i]);
// cout << comingInputs[i] << " - ";
if (comingInputs[i] == "(")
{
nestAmount++;
}
if (comingInputs[i] == ")")
{
nestAmount--;
}
}
}
}
for (int c = 0; c < repeattimes; c++)
{
for (int i = 0; i < inputs.size(); i++)
{
string input = inputs[i];
if (input == "CLEAR")
{
char input2 = inputs2[i];
clear(variables[input2 - 65]);
}
if (input == "INCREASE")
{
char input2 = inputs2[i];
increase(variables[input2 - 65]);
}
if (input == "PRINT")
{
char input2 = inputs2[i];
print(variables[input2 - 65]);
}
if (input == "REPEAT")
{
char input2 = inputs2[i];
repeatNested(variables[input2 - 65], repeatInputs[i]);
}
}
}
}
void repeat(int repeattimes)
{
string input;
cin >> input; // lukee TIMES
cin >> input; // lukee (
vector<string> inputs;
vector<char> inputs2;
vector<string> repeatInputs[1000];
while (cin >> input)
{
int commentPos = input.find("#");
if (commentPos != -1)
{
input.erase(commentPos);
string temp;
getline(cin, temp);
}
if (input == ")")
{
break;
}
if (input == "CLEAR")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "INCREASE")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "PRINT")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
inputs.push_back(input);
inputs2.push_back(input2);
}
if (input == "REPEAT")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
inputs.push_back(input);
inputs2.push_back(input2);
while (cin >> input)
{
int commentPos = input.find("#");
if (commentPos != -1)
{
input.erase(commentPos);
string temp;
getline(cin, temp);
}
if (input == "(")
{
continue;
}
if (input == "TIMES")
{
continue;
}
repeatInputs[inputs.size() - 1].push_back(input);
if (input == ")")
{
break;
}
}
}
}
for (int c = 0; c < repeattimes; c++)
{
for (int i = 0; i < inputs.size(); i++)
{
input = inputs[i];
if (input == "CLEAR")
{
char input2 = inputs2[i];
clear(variables[input2 - 65]);
}
if (input == "INCREASE")
{
char input2 = inputs2[i];
increase(variables[input2 - 65]);
}
if (input == "PRINT")
{
char input2 = inputs2[i];
print(variables[input2 - 65]);
}
if (input == "REPEAT")
{
char input2 = inputs2[i];
repeatNested(variables[input2 - 65], repeatInputs[i]);
}
}
}
// cout << "\n escaped loop \n";
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string input;
while (cin >> input)
{
if (input == "stop")
{
break;
}
int commentPos = input.find("#");
if (commentPos != -1)
{
input.erase(commentPos);
string temp;
getline(cin, temp);
}
if (input == "#")
{
getline(cin, input);
continue;
}
if (input == "CLEAR")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
clear(variables[input2 - 65]);
}
if (input == "INCREASE")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
increase(variables[input2 - 65]);
}
if (input == "PRINT")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
print(variables[input2 - 65]);
}
if (input == "REPEAT")
{
char input2;
cin >> input2;
while (input2 == '#')
{
getline(cin, input);
cin >> input2;
}
/* repeat(variables[input2 - 65]); */
vector<string> repeatInputs;
int nestAmount = 0;
while (cin >> input)
{
int commentPos = input.find("#");
if (commentPos != -1)
{
input.erase(commentPos);
string temp;
getline(cin, temp);
}
if (input == "(")
{
nestAmount++;
if (nestAmount == 1)
{
continue;
}
}
if (input == "TIMES")
{
continue;
}
repeatInputs.push_back(input);
/* cout << " nestAmount : " << nestAmount << "\n"; */
if (input == ")")
{
if (nestAmount == 1)
break;
else
nestAmount--;
}
}
repeatNested(variables[input2 - 65], repeatInputs);
/* for (int i = 0; i < repeatInputs.size(); i++)
{
cout << repeatInputs[i] << "\n";
} */
}
}
// cout << "loppu" << variables[0] << variables[1] << "\n";
}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: 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: WRONG ANSWER
| input |
|---|
| INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ... |
| correct output |
|---|
| 1337 |
| user output |
|---|
| 8505 |
Feedback: Incorrect character on line 1 col 1: expected "1337", got "8505"
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
