CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	Verlet
Submission time:	2025-10-29 13:07:56 +0200
Language:	C++ (C++17)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	ACCEPTED	32
#3	ACCEPTED	56

Test results
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.04 s	3	details
#16	ACCEPTED	0.00 s	3	details
#17	ACCEPTED	0.07 s	3	details
#18	ACCEPTED	0.02 s	3	details

Compiler report

input/code.cpp: In function 'int findClosingBracket(int)':
input/code.cpp:18: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]
   18 |   while (++pos < buffer.size() && b != 0)
      |          ~~~~~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'int solve(int, int)':
input/code.cpp:33: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]
   33 |     while (pos < buffer.size() && buffer[pos] != ")")
      |            ~~~~^~~~~~~~~~~~~~~
input/code.cpp:38:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |         state[buffer[pos+1][0]] = 0; pos += 2;
      |                               ^
input/code.cpp:43:31: warning: array subscript has type 'char' [-Wchar-subscripts]
   43 |         state[buffer[pos+...

Code

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

#define pb push_back

using namespace std;

vector<string> buffer;

int state[256];

int findClosingBracket(int pos)
{
  int b = 1;
  while (++pos < buffer.size() && b != 0)
  {
    if (buffer[pos] == "(") b++;
    if (buffer[pos] == ")") b--;
  }
  return --pos;
}

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

    while (pos < buffer.size() && buffer[pos] != ")")
    {
      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. Position: " << pos << " Token: " << buffer[pos] << endl; exit(1);
      }
    }
  }
  
  if (rep == 0)
    pos = findClosingBracket(start);

  return pos + 1;
}

int main()
{
  string line;
  while (getline(cin, line))
  { 
    string processed = "";
    for (char & c : line)
    {
      if (c == '#')
        break;
      processed += c;
    }

    istringstream iss(processed);

    string token;
    while (iss >> token)
      buffer.pb(token);
  }

  // string token;
  // while (cin >> token)
  //   buffer.pb(token);
  
  // for (int i = 0; i < buffer.size(); i++)
  //   cout << setw(3) << i << " " << buffer[i] << 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 ...` view save

correct output
`0 1 2 0` view save

user output
`0 1 2 0` view save

Test 2 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X # aybabtu PRINT X INCREASE # test ...` view save

correct output
`1 3` view save

user output
`1 3` view save

Test 3 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE X INCREASE X INCREASE X ...` view save

correct output
`3` view save

user output
`3` view save

Test 4 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE A PRINT A INCREASE B PRINT B INCREASE C ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

Test 5 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`999` view save

user output
`999` view save

Test 6 (public)

Group: 1, 2, 3

Verdict: ACCEPTED

input
`PRINT X PRINT X PRINT X PRINT X PRINT X ...` view save

correct output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

user output
`0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

Test 7 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5 5 5 5` view save

user output
`5 5 5 5 5` view save

Test 8 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`0 0 0 0 0` view save

user output
`0 0 0 0 0` view save

Test 9 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`6 7 8 9 10` view save

user output
`6 7 8 9 10` view save

Test 10 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`5 5` view save

user output
`5 5` view save

Test 11 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`20` view save

user output
`20` view save

Test 12 (public)

Group: 2, 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE B INCREASE B ...` view save

correct output
`42` view save

user output
`42` view save

Test 13 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

user output
`1 2 2 3 3 3 4 4 4 4 5 5 5 5 5` view save

Test 14 (public)

Group: 3

Verdict: ACCEPTED

input
`# Create number 3 INCREASE A INCREASE A INCREASE...` view save

correct output
`12` view save

user output
`12` view save

Test 15 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE X INCREASE X INCREASE X INCREASE X INCREASE X ...` view save

correct output
`531441` view save

user output
`531441` view save

Test 16 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A INCREASE A INCREASE A INCREASE A ...` view save

correct output
`1337` view save

user output
`1337` view save

Test 17 (public)

Group: 3

Verdict: ACCEPTED

input
`INCREASE A INCREASE A REPEAT A TIMES ( REPEAT A TIMES ( ...` view save

correct output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

user output
`1 2 1 2 1 1 3 4 3 4 3 4 3 4 3 ...` view save

Test 18 (public)

Group: 3

Verdict: ACCEPTED

input
`# Efficient algorithm for find...` view save

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

user output
`2 3 5 7 11 13 17 19 23 29 31 3...` view save

Datatähti 2026 alku

Tulkki

Compiler report

Code

Test details

Test 1 (public)

Test 2 (public)

Test 3 (public)

Test 4 (public)

Test 5 (public)

Test 6 (public)

Test 7 (public)

Test 8 (public)

Test 9 (public)

Test 10 (public)

Test 11 (public)

Test 12 (public)

Test 13 (public)

Test 14 (public)

Test 15 (public)

Test 16 (public)

Test 17 (public)

Test 18 (public)

Tasks

Submissions (Verlet)