CSES - UKIEPC 2016

Submission details
Task:	Compiler
Sender:	Game of Nolife
Submission time:	2016-11-12 16:20:15 +0200
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.06 s	details
#2	ACCEPTED	0.06 s	details
#3	ACCEPTED	0.05 s	details
#4	ACCEPTED	0.05 s	details
#5	ACCEPTED	0.05 s	details
#6	ACCEPTED	0.05 s	details
#7	ACCEPTED	0.06 s	details
#8	ACCEPTED	0.05 s	details
#9	ACCEPTED	0.06 s	details
#10	ACCEPTED	0.06 s	details
#11	ACCEPTED	0.06 s	details
#12	ACCEPTED	0.05 s	details
#13	ACCEPTED	0.06 s	details
#14	ACCEPTED	0.05 s	details
#15	ACCEPTED	0.06 s	details
#16	ACCEPTED	0.06 s	details
#17	ACCEPTED	0.06 s	details
#18	ACCEPTED	0.06 s	details
#19	ACCEPTED	0.05 s	details
#20	ACCEPTED	0.06 s	details

Code

#include <bits/stdc++.h>
#define F first
#define S second
#define X real()
#define Y imag()
using namespace std;
typedef long long ll;
typedef long double ld;

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	if (__builtin_popcount(n)<7 || n==127) {
		if (n==0) {
			cout<<"ZE A\nDI A\n";
			return 0;
		}
		if (n==1) {
			cout<<"ST A\nDI A\n";
			return 0;
		}
		int hlp=0;
		cout<<"ST X\n";
		hlp++;
		vector<int> asd;
		while (n) {
			asd.push_back(n%2);
			n/=2;
		}
		reverse(asd.begin(),asd.end());
		cout<<"PH X\nPH X\nAD\n";
		hlp+=3;
		if (asd[1]==1) {
			cout<<"PH X\nAD\n";
			hlp+=2;
		}
		cout<<"PL Y\n";
		hlp++;
		for (unsigned int j=2;j<asd.size();j++) {
			cout<<"PH Y\nPH Y\nAD\n";
			hlp+=3;
			if (asd[j]==1) {
				cout<<"PH X\nAD\n";
				hlp+=2;
			}
			cout<<"PL Y\n";
			hlp++;
		}
		hlp++;
		cout<<"DI Y\n";
//		cerr<<hlp<<endl;
	}
	if (n==255) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL X\n";
		cout<<"PH X\nPH X\nAD\n";
		cout<<"PH Y\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPL X\n";
		cout<<"PH X\nPH X\nAD\nPL X\n";
		cout<<"PH X\nPH X\nAD\nPL X\n";
		cout<<"PH X\nPH X\nAD\nPH Y\nAD\nPL A\n";
		cout<<"DI A\n";
	}
	if (n==254) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nPH X\nAD\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPH A\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPH X\n AD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==253) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nPH X\nAD\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPH A\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPH X\n AD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==251) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nPH X\nAD\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\n AD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==247) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH X\n AD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==239) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\nPH X\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH X\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\n AD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==223) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH X\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"DI A\n";
	}
	if (n==191) {
		cout<<"ST X\n";
		cout<<"PH X\nPH X\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nPH X\nAD\nAD\n";
		cout<<"PL Y\n";
		cout<<"PH Y\nPH Y\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH A\nPH Y\nAD\nAD\n";
		cout<<"PL A\n";
		cout<<"PH A\nPH X\nAD\n";
		cout<<"PL X\n";
		cout<<"PH X\nPH X\nAD\nPH A\nAD\n";
		cout<<"PL A\nDI A\n";
	}
}

Test details

Test 1

Verdict: ACCEPTED

input
`1` view save

correct output
`ST X ST A DI A` view save

user output
`ST A DI A` view save

Test 2

Verdict: ACCEPTED

input
`63` view save

correct output
`ST X ST A PH A PH A PH A ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 3

Verdict: ACCEPTED

input
`127` view save

correct output
`ST X ST A PH A PH A PH A ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 4

Verdict: ACCEPTED

input
`65` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PL Y ...` view save

Test 5

Verdict: ACCEPTED

input
`192` view save

correct output
`ST X ST A PH A PH A AD ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 6

Verdict: ACCEPTED

input
`254` view save

correct output
`ST X ST A PH A PH A PH A ...` view save

user output
`ST X PH X PH X PH X AD ...` view save

Test 7

Verdict: ACCEPTED

input
`11` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PL Y ...` view save

Test 8

Verdict: ACCEPTED

input
`99` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 9

Verdict: ACCEPTED

input
`4` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PL Y ...` view save

Test 10

Verdict: ACCEPTED

input
`239` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X PH X AD ...` view save

Test 11

Verdict: ACCEPTED

input
`6` view save

correct output
`ST X ST A PH A PH A AD ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 12

Verdict: ACCEPTED

input
`7` view save

correct output
`ST X ST A PH A PH A AD ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 13

Verdict: ACCEPTED

input
`245` view save

correct output
`ST X ST A PH A PH A PH A ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 14

Verdict: ACCEPTED

input
`200` view save

correct output
`ST X ST A PH A PH A AD ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 15

Verdict: ACCEPTED

input
`255` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X PH X AD ...` view save

Test 16

Verdict: ACCEPTED

input
`251` view save

correct output
`ST X ST A PH A PH A PH A ...` view save

user output
`ST X PH X PH X PH X AD ...` view save

Test 17

Verdict: ACCEPTED

input
`133` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PL Y ...` view save

Test 18

Verdict: ACCEPTED

input
`128` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PL Y ...` view save

Test 19

Verdict: ACCEPTED

input
`15` view save

correct output
`ST X PH X PH X AD PL A ...` view save

user output
`ST X PH X PH X AD PH X ...` view save

Test 20

Verdict: ACCEPTED

input
`0` view save

correct output
`ZE A DI A` view save

user output
`ZE A DI A` view save

UKIEPC 2016

Compiler

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Game of Nolife)