CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	Karjalanp11rakka
Submission time:	2025-10-29 18:27:24 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#2	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#3	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#4	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#5	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#6	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#7	TIME LIMIT EXCEEDED	--	2, 3	details
#8	TIME LIMIT EXCEEDED	--	2, 3	details
#9	TIME LIMIT EXCEEDED	--	2, 3	details
#10	TIME LIMIT EXCEEDED	--	2, 3	details
#11	TIME LIMIT EXCEEDED	--	2, 3	details
#12	TIME LIMIT EXCEEDED	--	2, 3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	TIME LIMIT EXCEEDED	--	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	WRONG ANSWER	0.50 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details

Code

#include <bits/stdc++.h>
using namespace std;
long long t[26] = {};
struct N
{
  string l;
  int r {};
  vector<N> v;
};
void read(N& n, int B)
{ 
  istringstream g;
  if(n.r) g = istringstream(n.l);
#define I(X)string X;if(n.r) g >> X; else while(true) {cin >> X; auto p = X.find("#"); if(p != string::npos) {X = X.substr(0, p); cin.ignore(1000, '\n');if(!X.size()) continue;} n.l += " "; n.l += X; cin.get(); break;}
  size_t i {};
  while(true)
  {
    I(f);
    if(f == ")")
    {
      n.r = 1;
      return;
    }
    if(f == "PRINT")
    {
      I(x);
      if(!B) cout << t[x[0] - 'A'] << " " << flush;
    }
    else if(f == "INCREASE")
    {
      I(x);
      if(!B) ++t[x[0] - 'A'];
    }
    else if(f == "CLEAR")
    {
      I(x);
      if(!B) t[x[0] - 'A'] = 0;
    }
    if(f == "REPEAT")
    {
      I(x);
      I(ti);
      I(st);
      if(n.v.size() == i) n.v.resize(i + 1);
      if(t[x[0] - 'A'] == 0 || B)
        read(n.v[i], 1);
      else for(long long k = t[x[0] - 'A']; k != 0; --k)
        read(n.v[i], 0);
      ++i;
    }
  }
}
int main()
{
  cin.tie(nullptr);
  cin.sync_with_stdio(false);
  N n;
  thread w([&](){read(n, 0);});
  this_thread::sleep_for(std::chrono::milliseconds(500));
  pthread_cancel(w.native_handle());
  w.join();
  return 0;
}

Test details

Test 1 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`0 1 2 0` view save

user output
(empty)

Test 2 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`1 3` view save

user output
(empty)

Test 3 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`3` view save

user output
(empty)

Test 4 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 5 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`999` view save

user output
(empty)

Test 6 (public)

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 7 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`5 5 5 5 5` view save

user output
(empty)

Test 8 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`0 0 0 0 0` view save

user output
(empty)

Test 9 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`6 7 8 9 10` view save

user output
(empty)

Test 10 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`5 5` view save

user output
(empty)

Test 11 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`20` view save

user output
(empty)

Test 12 (public)

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`42` view save

user output
(empty)

Test 13 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 14 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`12` view save

user output
(empty)

Test 15 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`531441` view save

user output
(empty)

Test 16 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
`1337` view save

user output
(empty)

Test 17 (public)

Group: 3

Verdict: WRONG ANSWER

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

Feedback: Output is shorter than expected

Test 18 (public)

Group: 3

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Datatähti 2026 alku

Tulkki

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 (Karjalanp11rakka)