Code Submission Evaluation System Login

Datatähti 2015 loppu

Start:2015-01-29 12:15:00
End:2015-01-29 17:15:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2015 loppu - Results
History
2015-01-29 15:31:5617
2015-01-29 15:30:300
2015-01-29 13:59:100
2015-01-29 13:03:170
Task:Ruudukko
Sender:Dentosal
Submission time:2015-01-29 15:30:30
Language:C++
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1WRONG ANSWER0.06 / 3.001details
#2WRONG ANSWER0.06 / 3.001details
#3WRONG ANSWER0.06 / 3.001details
#4WRONG ANSWER0.06 / 3.001details
#5WRONG ANSWER0.06 / 3.001details
#6TIME LIMIT EXCEEDED-- / 3.002details
#7TIME LIMIT EXCEEDED-- / 3.002details
#8WRONG ANSWER0.06 / 3.002details
#9WRONG ANSWER0.07 / 3.002details
#10WRONG ANSWER0.21 / 3.002details
#11TIME LIMIT EXCEEDED-- / 3.003details
#12TIME LIMIT EXCEEDED-- / 3.003details
#13TIME LIMIT EXCEEDED-- / 3.003details
#14TIME LIMIT EXCEEDED-- / 3.003details
#15TIME LIMIT EXCEEDED-- / 3.003details

Code

/* ALSO CRASH SOMETIMES */
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>

using namespace std;

char map[500][500];
int n;




string findp(int cursor_x, int cursor_y) {
	string path="";

	path += map[cursor_x][cursor_y];

	while (cursor_x < n-1 && cursor_y < n-1) {
		if (map[cursor_x+1][cursor_y] < map[cursor_x][cursor_y+1]) {
			cursor_x+=1;
		}
		else if (map[cursor_x+1][cursor_y] > map[cursor_x][cursor_y+1]) {
			cursor_y+=1;
		}
		else {
			if (findp(cursor_x+1, cursor_y) < findp(cursor_x, cursor_y+1)) {
				cursor_x+=1;
			}
			else {
				cursor_y+=1;
			}
		}
		path += map[cursor_x][cursor_y];
	}

	if (cursor_x == n-1) {
		while (cursor_y < n) {
			++cursor_y;
			path += map[cursor_x][cursor_y];
		}
	}
	if (cursor_y == n-1) {
		while (cursor_x < n) {
			++cursor_x;
			path += map[cursor_x][cursor_y];
		}
	}
	path += map[cursor_x][cursor_y];

	return path;
}

int main() {
	string temps;
	cin >> n;
	int cursor_x = 0;
	int cursor_y = 0;


	for (int i=0; i < n; i++) {
		cin >> temps;
		for (int q=0; q < n; ++q) {
			map[i][q] = temps.at(q);
		}
	}

	cout << findp(cursor_x, cursor_y) << endl;

	return 0;
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
5
AAAAA
AAAAA
AAAAA
AAAAA
...
view   save

correct output
AAAAAAAAB

view   save

user output
AAAAAAAAB

view   save

Test 2

Group: 1

Verdict: WRONG ANSWER

input
5
ABABA
BABAB
ABABA
BABAB
...
view   save

correct output
ABABABABA

view   save

user output
ABABABABA

view   save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
5
WRYIU
TWLKH
UJMJC
GRDJW
...
view   save

correct output
WRWJMDJWK

view   save

user output
WRWJMDJWK

view   save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
5
RUEAE
ZYHHW
KDBPD
DXREW
...
view   save

correct output
RUEAEWDWX

view   save

user output
RUEAEWDWX

view   save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
5
SRGYR
MYDOB
GNOVM
SZOZK
...
view   save

correct output
SMGNOOLTU

view   save

user output
SMGNOOLTU

view   save

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
view   save

correct output
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
view   save

user output
(empty)

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
100
ABABABABABABABABABABABABABABAB...
view   save

correct output
ABABABABABABABABABABABABABABAB...
view   save

user output
(empty)

Test 8

Group: 2

Verdict: WRONG ANSWER

input
100
FWOVNYKNMMQCNHJGUYPNEDXGVVGONC...
view   save

correct output
FWDBDECKBHKIACOVUCJGDJOHAYIBHO...
view   save

user output
FWDBDECKBHKIACOVUCJGDJOHAYIBHO...
view   save

Test 9

Group: 2

Verdict: WRONG ANSWER

input
100
ETGCJABWKMAAEOQXWFFYMDJBMNKMQK...
view   save

correct output
EAARGLBRLHCDHHBPABHDAJBEEBHQBE...
view   save

user output
EAARGLBRLHCDHHBPABHDAJBEEBHQBE...
view   save

Test 10

Group: 2

Verdict: WRONG ANSWER

input
100
GNWMLJNHSBAADUFCSGIZMWHZTVDHNR...
view   save

correct output
GEGOFRDKBNLLEUOPOEQCEFMTKANLNC...
view   save

user output
GEGOFRDKBNLLEUOPOEQCEFMTKANLNC...
view   save

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
view   save

correct output
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...
view   save

user output
(empty)

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
ABABABABABABABABABABABABABABAB...
view   save

correct output
ABABABABABABABABABABABABABABAB...
view   save

user output
(empty)

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
HGADXTSFXYIEMDWMFIVQGHTACFUPYI...
view   save

correct output
HGADEJOGAKPJCRAHTABRSDLAVGBFAG...
view   save

user output
(empty)

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
SBLNMAZESQVGWAPZYHQJMQTNGMEZWS...
view   save

correct output
SBLCAMDHILGIDRCIDUNMMAHFYCENOS...
view   save

user output
(empty)

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
500
AOXYXRYFWPYWQDPWXQITLHQQUAYZAJ...
view   save

correct output
AOJLDOAPBGEKSGCNKBUMKAJCCWCOOD...
view   save

user output
(empty)