CSES - Datatähti 2021 loppu

CSES - Datatähti 2021 loppu - Results

Submission details
Task:	Murtoviiva
Sender:	Nanohenry
Submission time:	2021-01-23 19:58:27 +0200
Language:	C++ (C++11)
Status:	READY
Result:	0

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

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 4, 5	details
#2	TIME LIMIT EXCEEDED	--	1, 2, 4, 5	details
#3	ACCEPTED	0.01 s	1, 2, 4, 5	details
#4	TIME LIMIT EXCEEDED	--	1, 2, 4, 5	details
#5	ACCEPTED	0.01 s	1, 2, 4, 5	details
#6	ACCEPTED	0.01 s	2, 4, 5	details
#7	ACCEPTED	0.01 s	2, 4, 5	details
#8	ACCEPTED	0.01 s	2, 4, 5	details
#9	ACCEPTED	0.01 s	2, 4, 5	details
#10	TIME LIMIT EXCEEDED	--	2, 4, 5	details
#11	TIME LIMIT EXCEEDED	--	4, 5	details
#12	TIME LIMIT EXCEEDED	--	5	details
#13	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#14	TIME LIMIT EXCEEDED	--	3, 4, 5	details
#15	ACCEPTED	0.01 s	1, 2, 4, 5	details
#16	TIME LIMIT EXCEEDED	--	4, 5	details
#17	TIME LIMIT EXCEEDED	--	4, 5	details
#18	TIME LIMIT EXCEEDED	--	5	details
#19	TIME LIMIT EXCEEDED	--	1, 2, 4, 5	details
#20	ACCEPTED	0.01 s	2, 4, 5	details
#21	ACCEPTED	0.01 s	2, 4, 5	details
#22	ACCEPTED	0.01 s	2, 4, 5	details
#23	TIME LIMIT EXCEEDED	--	4, 5	details
#24	TIME LIMIT EXCEEDED	--	4, 5	details
#25	TIME LIMIT EXCEEDED	--	4, 5	details
#26	TIME LIMIT EXCEEDED	--	5	details
#27	TIME LIMIT EXCEEDED	--	5	details
#28	TIME LIMIT EXCEEDED	--	5	details
#29	TIME LIMIT EXCEEDED	--	5	details
#30	ACCEPTED	0.01 s	1, 2, 4, 5	details

Code

#include <iostream>
#include <setjmp.h>

using namespace std;

typedef struct point {
	int64_t x, y;
} point_t;

typedef struct line {
	point_t s, e;
} line_t;

inline bool cr(point_t _as, point_t _ae, point_t _bs, point_t _be) {
	line_t a = {_as, _ae}, b = {_bs, _be};
	if (a.s.x == a.e.x) {
		if (a.s.y > a.e.y) {
			point_t t = a.s;
			a.s = a.e;
			a.e = t;
		}
	} else {
		if (a.s.x > a.e.x) {
			point_t t = a.s;
			a.s = a.e;
			a.e = t;
		}
	}
	if (b.s.x == b.e.x) {
		if (b.s.y > b.e.y) {
			point_t t = b.s;
			b.s = b.e;
			b.e = t;
		}
	} else {
		if (b.s.x > b.e.x) {
			point_t t = b.s;
			b.s = b.e;
			b.e = t;
		}
	}
	if (a.s.x == a.e.x && b.s.x == b.e.x) {
		return a.s.x == b.s.x && ((a.s.y >= b.s.y && a.s.y <= b.e.y) || (a.e.y >= b.s.y && a.e.y <= b.e.y));
	} else if (a.s.x != a.e.x && b.s.x != b.e.x) {
		return a.s.y == b.s.y && ((a.s.x >= b.s.x && a.s.x <= b.e.x) || (a.e.x >= b.s.x && a.e.x <= b.e.x));
	} else if (a.s.x != a.e.x && b.s.x == b.e.x) {
		return a.s.x <= b.s.x && a.e.x >= b.s.x && b.s.y <= a.s.y && b.e.y >= a.s.y;
	} else /*if (a.s.x == a.e.x && b.s.x != b.e.x)*/ {
		return b.s.x <= a.s.x && b.e.x >= a.s.x && a.s.y <= b.s.y && a.e.y >= b.s.y;
	}
}

int64_t n, l[100000];
string d;

point_t sp = {0, 0};
line_t fl[100000];
int64_t ll[100000];
int64_t li = 0, lcl = -1;

jmp_buf ex;

void s() {
	if (li == n + n - 1) {
		//cout << "Finish" << endl;
		longjmp(ex, 1);
	}
	point_t rp = sp;
	//cout << "Entered " << sp.x << " " << sp.y << endl;
	if (li % 2 == 0) {
		point_t t = sp;
		if (li % 4 == 0) {
			t.x += l[li / 2];
			//cout << "Right" << endl;
		} else {
			t.x -= l[li / 2];
			//cout << "Left" << endl;
		}
		for (int64_t j = 0; j < li - 1; j++) {
			if (cr(fl[j].s, fl[j].e, sp, t)) {
				//cout << "Crossed with " << j << endl;
				return;
			}
		}
		fl[li] = {sp, t};
		sp = t;
		li++;
		s();
		li--;
		sp = rp;
		//cout << "Back to " << sp.x << " " << sp.y << endl;
	} else {
		for (int64_t i = 1; i < 1e9; i++) {
			point_t t = sp;
			if (d[li / 2] == 'U') {
				t.y -= i;
				//cout << "Up" << endl;
			} else {
				t.y += i;
				//cout << "Down" << endl;
			}
			for (int64_t j = 0; j < li - 1; j++) {
				if (cr(fl[j].s, fl[j].e, sp, t)) {
					//cout << "Crossed with " << j << endl;
					return;
				}
			}
			fl[li] = {sp, t};
			ll[li / 2] = i;
			sp = t;
			li++;
			s();
			li--;
			sp = rp;
			//cout << "Back to " << sp.x << " " << sp.y << endl;
		}
	}
}

int main() {
	cin >> n;
	for (int64_t i = 0; i < n; i++) {
		cin >> l[i];
	}
	cin >> d;
	if (!setjmp(ex)) {
		s();
	}
	cout << "YES" << endl;
	for (int64_t i = 0; i < n - 1; i++) {
		cout << ll[i] << ' ';
	}
	cout << endl;
}

Test details

Test 1

Group: 1, 2, 4, 5

Verdict: ACCEPTED

input
`2 2 10 D` view save

correct output
`YES 1` view save

user output
`YES 1` view save

Test 2

Group: 1, 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`8 5 8 7 5 6 5 3 4 DUUUDDD` view save

correct output
`YES 1 5 1 1 3 1 1` view save

user output
(empty)

Test 3

Group: 1, 2, 4, 5

Verdict: ACCEPTED

input
`8 9 8 8 10 10 8 9 10 DDDUUUD` view save

correct output
`YES 1 1 1 4 1 1 7` view save

user output
`YES 1 1 1 4 1 1 7` view save

Test 4

Group: 1, 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`8 9 10 8 8 9 9 7 8 DDDDUUU` view save

correct output
`NO` view save

user output
(empty)

Test 5

Group: 1, 2, 4, 5

Verdict: ACCEPTED

input
`8 10 2 8 3 10 2 10 10 DDUUUUD` view save

correct output
`YES 1 1 3 1 1 1 7` view save

user output
`YES 1 1 1 1 1 1 3` view save

Test 6

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 73 74 97 82 19 50 26 51 56 93 ...` view save

correct output
`YES 1 2 3 1 1 3 1 1 1 10 1 3 1 1` view save

user output
`YES 1 2 3 1 1 1 1 1 1 3 1 6 1 1` view save

Test 7

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 95 71 97 77 98 76 100 62 96 69...` view save

correct output
`YES 1 1 3 1 1 1 1 1 9 1 11 1 13 1` view save

user output
`YES 1 1 3 1 1 1 1 1 5 1 7 1 9 1` view save

Test 8

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 79 81 84 86 88 90 92 92 91 89 ...` view save

correct output
`YES 1 2 3 4 5 6 14 1 6 5 4 3 2 1` view save

user output
`YES 1 2 3 4 5 6 14 1 6 5 4 3 2 1` view save

Test 9

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 97 90 87 83 79 76 74 23 24 76 ...` view save

correct output
`YES 13 11 9 7 5 3 1 1 3 5 7 9 11 1...` view save

user output
`YES 13 11 9 7 5 3 1 1 3 5 7 9 11 1...` view save

Test 10

Group: 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`15 100 2 99 1 78 4 93 2 100 1 15 ...` view save

correct output
`NO` view save

user output
(empty)

Test 11

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 999997 999995 999993 999991 99...` view save

correct output
`YES 997 995 993 991 989 987 985 98...` view save

user output
(empty)

Test 12

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 999999998 999999996 999999994 ...` view save

correct output
`YES 99997 99995 99993 99991 99989 ...` view save

user output
(empty)

Test 13

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

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

user output
(empty)

Test 14

Group: 3, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`NO` view save

user output
(empty)

Test 15

Group: 1, 2, 4, 5

Verdict: ACCEPTED

input
`5 6 7 7 6 6 UDUU` view save

correct output
`YES 1 4 1 1` view save

user output
`YES 1 4 1 1` view save

Test 16

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`30 15 12 9 88 10 26 78 23 67 14 9...` view save

correct output
`YES 1 1 1 4 1 3 1 1 7 1 19 1 1 3 1...` view save

user output
(empty)

Test 17

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 1000000 1 146324 146324 289287...` view save

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

user output
(empty)

Test 18

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 1000000000 1 421262579 4212625...` view save

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

user output
(empty)

Test 19

Group: 1, 2, 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`8 1 3 1 2 5 1 1 2 DUUUDUU` view save

correct output
`NO` view save

user output
(empty)

Test 20

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 3 1 33 13 1 11 32 8 1 19 15 25...` view save

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

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

Test 21

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 10 2 39 41 42 34 31 28 26 24 2...` view save

correct output
`YES 1 1 1 1 10 9 8 7 6 1 4 1 1 1` view save

user output
`YES 1 1 1 1 10 9 8 7 6 1 4 1 1 1` view save

Test 22

Group: 2, 4, 5

Verdict: ACCEPTED

input
`15 27 4 6 23 26 37 40 38 44 27 3 ...` view save

correct output
`YES 1 1 1 1 5 1 7 1 3 1 1 3 1 1` view save

user output
`YES 1 1 1 1 5 1 7 1 3 1 1 1 1 1` view save

Test 23

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 3246 3562 197273 197429 197755...` view save

correct output
`YES 1 1 1 4 5 10 3 1 1 3 7 12 1 1 ...` view save

user output
(empty)

Test 24

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 503981 503487 503350 502673 50...` view save

correct output
`YES 999 1 997 1 1 994 989 1 1 1 1 ...` view save

user output
(empty)

Test 25

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

input
`1000 1445 1363 1749 1084 262408 263...` view save

correct output
`NO` view save

user output
(empty)

Test 26

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 209655 9167 9389 191291 198294...` view save

correct output
`NO` view save

user output
(empty)

Test 27

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 16295 14904 5103 13337 26939 3...` view save

correct output
`YES 1 1 1 1 5 6 1 1 1 10 11 1 13 1...` view save

user output
(empty)

Test 28

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 1859 174288 15040 4631 4993844...` view save

correct output
`YES 1 3 1 1 99997 99992 1 1 5 1 1 ...` view save

user output
(empty)

Test 29

Group: 5

Verdict: TIME LIMIT EXCEEDED

input
`100000 959817 958289 966165 922369 92...` view save

correct output
`YES 1 1 1 1 1 1 1 1 1 1 11 14 1 1 ...` view save

user output
(empty)

Test 30

Group: 1, 2, 4, 5

Verdict: ACCEPTED

input
`8 2 3 2 3 5 6 7 8 UDDDUDU` view save

correct output
`YES 1 2 1 1 5 6 7` view save

user output
`YES 1 2 1 1 5 6 7` view save

Datatähti 2021 loppu

Murtoviiva

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

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Tasks

Submissions (Nanohenry)