CSES - Datatähti 2026 alku

Submission details
Task:	Tulkki
Sender:	sandyy
Submission time:	2025-10-27 20:45:45 +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.00 s	1, 2, 3	details
#7	WRONG ANSWER	0.00 s	2, 3	details
#8	WRONG ANSWER	0.00 s	2, 3	details
#9	OUTPUT LIMIT EXCEEDED	0.00 s	2, 3	details
#10	WRONG ANSWER	0.01 s	2, 3	details
#11	TIME LIMIT EXCEEDED	--	2, 3	details
#12	TIME LIMIT EXCEEDED	--	2, 3	details
#13	WRONG ANSWER	0.00 s	3	details
#14	WRONG ANSWER	0.00 s	3	details
#15	WRONG ANSWER	0.10 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	WRONG ANSWER	0.00 s	3	details
#18	TIME LIMIT EXCEEDED	--	3	details

Compiler report

input/code.cpp: In function 'Node* parse(std::vector<std::__cxx11::basic_string<char> >&, 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(i<program.size()) {
      |               ~^~~~~~~~~~~~~~~
input/code.cpp: In function 'void run(Node*)':
input/code.cpp:38:37: warning: array subscript has type 'char' [-Wchar-subscripts]
   38 |         if(n->func == "CLEAR") c[n->var]=0;
      |                                  ~~~^~~
input/code.cpp:39:50: warning: array subscript has type 'char' [-Wchar-subscripts]
   39 |         else if(n->func == "PRINT") cout << c[n->var] << " ";
      |                                               ~~~^~~
input/code.cpp:40:45: warning: array subscript has type 'char' [-Wchar-subscripts]
   40 |         else if(n->func == "INCREASE") c[n->var]++;
      |...

Code

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pb push_back
#define ar array

int c[128];

struct Node {
	string func;
	char var;
	vector<Node*> children;
};

Node* parse(vector<string>& program, int i) {
	vector<Node*> block;
	while(i<program.size()) {
		string t = program[i++];
		if(t==")") {
			break;
		}
		if(t=="PRINT" || t=="INCREASE" || t=="CLEAR") {
			char var=program[i++][0];
			block.pb(new Node{t, var});
		}
		else if(t=="REPEAT") {
			char var=program[i++][0];
			i+=2;
			Node* m = parse(program, i);
			block.pb(new Node{"REPEAT", var, {m}});
		}
	}
	return new Node{"B", 0, block};
}

void run(Node* n) {
	if(n->func == "CLEAR") c[n->var]=0;
	else if(n->func == "PRINT") cout << c[n->var] << " ";
	else if(n->func == "INCREASE") c[n->var]++;
	else if(n->func == "REPEAT") {
		for(int i=0; i<c[n->var]; i++) {
			for(auto child:n->children) run(child);
		}
	} else if(n->func == "B"){
		for(auto child:n->children) run(child);
	}
}

void solve() {
	// tokenize
	string s, opcode;
	vector<string> program;
	while(getline(cin, s)) {
		int pos=s.find('#');
		if(pos!=s.size()) {
			s = s.substr(0, pos);
		}
		stringstream ss(s);
		while(ss>>opcode) {
			program.pb(opcode);
		}
	}
	Node* AST = parse(program, 0);
	run(AST);
}


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int T=1;
	//cin >> T;
	while(T--) {
		solve();
	}
}

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

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 5` view save

Feedback: Output is longer than expected

Test 8 (public)

Group: 2, 3

Verdict: WRONG ANSWER

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` view save

Feedback: Output is shorter than expected

Test 9 (public)

Group: 2, 3

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

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

correct output
`5 5` view save

user output
(empty)

Feedback: Output is shorter than expected

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

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 1 2 2 2 3 3 3 3 4 4 4 4 4 5 ...` view save

Feedback: Output is longer than expected

Test 14 (public)

Group: 3

Verdict: WRONG ANSWER

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

correct output
`12` view save

user output
(empty)

Feedback: Output is shorter than expected

Test 15 (public)

Group: 3

Verdict: WRONG ANSWER

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

correct output
`531441` view save

user output
(empty)

Feedback: Output is shorter than expected

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

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

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