Submission details
Task:Tulkki
Sender:Verlet
Submission time:2025-10-29 11:23:03 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2, 3details
#20.00 s1, 2, 3details
#30.00 s1, 2, 3details
#4ACCEPTED0.00 s1, 2, 3details
#5ACCEPTED0.00 s1, 2, 3details
#6ACCEPTED0.00 s1, 2, 3details
#7ACCEPTED0.00 s2, 3details
#8ACCEPTED0.00 s2, 3details
#9ACCEPTED0.00 s2, 3details
#10ACCEPTED0.00 s2, 3details
#11ACCEPTED0.00 s2, 3details
#12ACCEPTED0.00 s2, 3details
#13ACCEPTED0.00 s3details
#14ACCEPTED0.00 s3details
#15ACCEPTED0.03 s3details
#16ACCEPTED0.00 s3details
#17ACCEPTED0.06 s3details
#180.00 s3details

Compiler report

input/code.cpp: In function 'int solve(int, int)':
input/code.cpp:21:38: 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]
   21 |     while (buffer[pos] != ")" && pos < buffer.size())
      |                                  ~~~~^~~~~~~~~~~~~~~
input/code.cpp:26:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   26 |         state[buffer[pos+1][0]] = 0; pos += 2;
      |                               ^
input/code.cpp:31:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   31 |         state[buffer[pos+1][0]]++; pos += 2;
      |                               ^
input/code.cpp:36:39: warning: array subscript has type 'char' [-Wchar-subscripts]
   36 |         cout << state[buffer[pos+1][0]] << " "; pos += 2;
      |                                       ^
input/code.cpp:41:52: warning: array subscript has type 'char' [-Wchar-s...

Code

#include<iostream>
#include<sstream>
#include<string>
#include<vector>

#define pb push_back

using namespace std;

vector<string> buffer;

int state[256];

int solve(int start, int rep)
{
  int pos;
  for (int i = 0; i < rep; i++)
  {
    pos = start;

    while (buffer[pos] != ")" && pos < buffer.size())
    {
      if (buffer[pos] == "CLEAR")
      {
        // cout << "Performing CLEAR" << endl;
        state[buffer[pos+1][0]] = 0; pos += 2;
      }
      else if (buffer[pos] == "INCREASE")
      {
        // cout << "Performing INCREASE" << endl;
        state[buffer[pos+1][0]]++; pos += 2;
      }
      else if (buffer[pos] == "PRINT")
      {
        // cout << "Performing PRINT" << endl;
        cout << state[buffer[pos+1][0]] << " "; pos += 2;
      }
      else if (buffer[pos] == "REPEAT")
      {
        // cout << "Performing REPEAT" << endl;
        pos = solve(pos + 4, state[buffer[pos+1][0]]);
      }
      else
      {
        cerr << "Error" << endl; exit(1);
      }
    }
  }
  return pos + 1;
}

int main()
{
  string line;
  while (getline(cin, line))
  {
    istringstream iss(line);
    string token;
    while (iss >> token)
    {
      if (token == "#")
        break;
      buffer.pb(token);
    }
  }

  // string token;
  // while (cin >> token)
  //   buffer.pb(token);
  
  // for (string & s : buffer)
  //   cout << s << endl;

  solve(0, 1);
}

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:

input
INCREASE
X
# aybabtu
   PRINT    X
INCREASE # test
...

correct output
1 3 

user output

Error:
Error

Test 3 (public)

Group: 1, 2, 3

Verdict:

input
# Create number 3
INCREASE X
INCREASE X
INCREASE X

...

correct output

user output
(empty)

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:

input
# Efficient algorithm for find...

correct output
2 3 5 7 11 13 17 19 23 29 31 3...

user output
(empty)

Error:
Error