CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	menta
Submission time:	2025-10-28 21:26:21 +0200
Language:	C++ (C++17)
Status:	READY
Result:	12

Feedback
group	verdict	score
#1	ACCEPTED	12
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

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.01 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	WRONG ANSWER	0.00 s	2, 3	details
#12	WRONG ANSWER	0.00 s	2, 3	details
#13	TIME LIMIT EXCEEDED	--	3	details
#14	ACCEPTED	0.00 s	3	details
#15	ACCEPTED	0.19 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details

Code

#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>

using namespace std;
string a, b, skibidi, hedelmat, kaka, skibidi2, scawy;
int inside, k;
vector<bool> stored(16, false);
vector<int> meow(8, 0), mau(8, 0);
unordered_map<string, int> hashMap;
unordered_map<int, string> mapHash;
vector<stringstream> thing(8);
int reapeat(string g, int big) {
  for (int j = hashMap[g]; j > 0; j--) {
    while (true) {
      if (!stored.at(big)) {
        cin >> a;
      } else {
        thing[big] << mapHash[big];
        getline(thing[big], a, ' ');
      }
      if (a.find("PRINT") != std::string::npos) {
        if (!stored.at(big)) {
          cin >> skibidi;
          if (skibidi == "#") {
            getline(cin, skibidi);
            cin >> skibidi;
          }
          mapHash[big].append(a + " " + skibidi + " ");
        } else {
          getline(thing[big], skibidi, ' ');
        }

        cout << hashMap[skibidi] << " ";
        continue;
      }
      if (a.find("INCREASE") != std::string::npos) {
        if (!stored.at(big)) {
          cin >> skibidi;
          if (skibidi == "#") {
            getline(cin, skibidi);
            cin >> skibidi;
          }
          mapHash[big].append(a + " " + skibidi + " ");
        } else {
          getline(thing[big], skibidi, ' ');
        }
        hashMap[skibidi] = hashMap[skibidi] + 1;

        continue;
      }
      if (a.find("REPEAT") != std::string::npos) {
        if (!stored.at(big)) {
          cin >> hedelmat >> skibidi >> skibidi2;
          if (skibidi == "#") {
            getline(cin, skibidi);
            cin >> hedelmat >> skibidi >> skibidi2;
          }
          mapHash[big].append(a + " " + hedelmat + " " + skibidi + " " +
                              skibidi2);
        } else {
          getline(thing[big], hedelmat, ' ');
          getline(thing[big], skibidi, ' ');
          getline(thing[big], skibidi2, ' ');
        }
        reapeat(hedelmat, big + 1);
      }
      if (a.find("CLEAR") != std::string::npos) {
        if (!stored.at(big)) {
          cin >> skibidi;
          if (skibidi == "#") {
            getline(cin, skibidi);
            cin >> skibidi;
          } else {
          }
          mapHash[big].append(a + " " + skibidi + " ");
        } else {
          getline(thing[big], skibidi, ' ');
        }
        meow.at(big)++;
        hashMap[skibidi] = 0;
        continue;
      }
      if ('#' == a[0]) {
        getline(cin, skibidi);
        continue;
      }
      if (a.find(")") != std::string::npos) {
        if (!stored.at(big)) {
          mapHash[big].append(a + " ");
        }
        mau[big]++;
        stored.at(big) = true;
        break;
      } else {
        cout << "massii\n" << a;
        break;
      }
    }
  }
  if (big > 0 && mau[big] < hashMap[g]) {
    big--;
  }
  return 67;
}

int main() {
meow:
  while (cin >> a) {
    while (a.find(")") != std::string::npos) {
      cin >> a;
    }
    if (a.find("PRINT") != std::string::npos) {
      cin >> skibidi;
      if (skibidi == "#") {
        getline(cin, skibidi);
        cin >> skibidi;
      }
      cout << hashMap[skibidi] << " ";

      continue;
    }
    if (a.find("INCREASE") != std::string::npos) {
      cin >> skibidi;
      if (skibidi == "#") {
        getline(cin, skibidi);
        cin >> skibidi;
      }
      hashMap[skibidi] = hashMap[skibidi] + 1;
      goto meow;
    }
    if (a.find("REPEAT") != std::string::npos) {
      cin >> hedelmat >> skibidi >> skibidi2;
      reapeat(hedelmat, 0);
      goto meow;
    }
    if (a.find("CLEAR") != std::string::npos) {
      cin >> skibidi;
      hashMap[skibidi] = 0;
      goto meow;
    }
    if ('#' == a[0]) {
      getline(cin, skibidi);
      goto meow;
    } else {
      cout << "massiivinen tuuab\n" << a << "\n";
      break;
    }
  }
}

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: WRONG ANSWER

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

correct output
`20` view save

user output
`21` view save

Feedback: Incorrect character on line 1 col 2: expected "20", got "21"

Test 12 (public)

Group: 2, 3

Verdict: WRONG ANSWER

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

correct output
`42` view save

user output
`27` view save

Feedback: Incorrect character on line 1 col 1: expected "42", got "27"

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: 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: 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: TIME LIMIT EXCEEDED

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

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