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 17:00:1717
2015-01-29 14:47:1617
2015-01-29 12:58:3717
Task:Ruudukko
Sender:SampoH
Submission time:2015-01-29 17:00:17
Language:C++
Status:READY
Score:17

Feedback

groupverdictscore
#1ACCEPTED17
#2TIME LIMIT EXCEEDED0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.11 / 3.001details
#2ACCEPTED0.06 / 3.001details
#3ACCEPTED0.08 / 3.001details
#4ACCEPTED0.05 / 3.001details
#5ACCEPTED0.06 / 3.001details
#6TIME LIMIT EXCEEDED-- / 3.002details
#7TIME LIMIT EXCEEDED-- / 3.002details
#8ACCEPTED0.06 / 3.002details
#9WRONG ANSWER0.08 / 3.002details
#10ACCEPTED1.19 / 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

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

#define ll long long

const char * sortstr(const char * v, int l) {
	int * j = new int[l];
	for (int i = 0; i < l; i++) {
		j[i] = int(v[i]);
	}
	sort(j,j+l);
	char * c = new char[l];
	for (int i = 0; i < l; i++) {
		c[i] = char(j[i]);
	}
	return c;
}
const char * pathfind(string * s, int x, int y, ll f) {
	string v = "";
	while (!((x==f) && (y==f))) {
		v = v + s[x][y];
		if (x == f)
			y++;
		else if (y == f)
			x++;
		else {
			int a = (int) s[x][y+1];
			int b = (int) s[x+1][y];
			if (a < b) {
				y++;
			} else if (a > b) {
				x++;
			} else {
				if (strcmp(pathfind(s,x+1,y,f), pathfind(s,x,y+1,f)) < 0) x++;
				else y++;
			}
		}
	}	
	return sortstr(v.c_str(),v.length());
}	

int main(int argc, char ** argv) {
	cin.sync_with_stdio(false);

	ll n;
	cin >> n;
	ll f = n - 1;
	int x = 0;
	int y = 0;
	string * s = new string[n];
	for (int i = 0; i < n; i++)
		cin >> s[i];
	
	string tulos = "";
	while (!((x==f) && (y==f))) {
		tulos = tulos + s[x][y];
		if (x == f)
			y++;
		else if (y == f)
			x++;
		else {
			int a = (int) s[x][y+1];
			int b = (int) s[x+1][y];
			
			if (a < b) {
				y++;
			} else if (a > b) {
				x++;
			} else {
				if (strcmp(pathfind(s,x+1,y,f), pathfind(s,x,y+1,f)) < 0) x++;
				else y++;
			}
		}
	}	
	tulos = tulos + s[x][y];
	
	cout << tulos << "\n";
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
5
AAAAA
AAAAA
AAAAA
AAAAA
...
view   save

correct output
AAAAAAAAB

view   save

user output
AAAAAAAAB

view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
5
ABABA
BABAB
ABABA
BABAB
...
view   save

correct output
ABABABABA

view   save

user output
ABABABABA

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
5
WRYIU
TWLKH
UJMJC
GRDJW
...
view   save

correct output
WRWJMDJWK

view   save

user output
WRWJMDJWK

view   save

Test 4

Group: 1

Verdict: ACCEPTED

input
5
RUEAE
ZYHHW
KDBPD
DXREW
...
view   save

correct output
RUEAEWDWX

view   save

user output
RUEAEWDWX

view   save

Test 5

Group: 1

Verdict: ACCEPTED

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: ACCEPTED

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: ACCEPTED

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)