CSES - HIIT Open 2017

CSES - HIIT Open 2017 - Results

Submission details
Task:	Median string
Sender:	Ace of Spades
Submission time:	2017-05-27 15:12:02 +0300
Language:	C++
Status:	READY
Result:	ACCEPTED

Test results
test	verdict	time
#1	ACCEPTED	0.07 s	details
#2	ACCEPTED	0.06 s	details
#3	ACCEPTED	0.03 s	details
#4	ACCEPTED	0.05 s	details
#5	ACCEPTED	0.11 s	details
#6	ACCEPTED	0.06 s	details
#7	ACCEPTED	0.05 s	details
#8	ACCEPTED	0.04 s	details
#9	ACCEPTED	0.05 s	details
#10	ACCEPTED	0.05 s	details
#11	ACCEPTED	0.04 s	details
#12	ACCEPTED	0.05 s	details
#13	ACCEPTED	0.07 s	details
#14	ACCEPTED	0.05 s	details
#15	ACCEPTED	0.07 s	details
#16	ACCEPTED	0.05 s	details
#17	ACCEPTED	0.05 s	details
#18	ACCEPTED	0.05 s	details
#19	ACCEPTED	0.04 s	details
#20	ACCEPTED	0.04 s	details
#21	ACCEPTED	0.07 s	details
#22	ACCEPTED	0.05 s	details
#23	ACCEPTED	0.04 s	details
#24	ACCEPTED	0.05 s	details
#25	ACCEPTED	0.07 s	details
#26	ACCEPTED	0.10 s	details
#27	ACCEPTED	0.08 s	details
#28	ACCEPTED	0.10 s	details
#29	ACCEPTED	0.11 s	details
#30	ACCEPTED	0.08 s	details
#31	ACCEPTED	0.09 s	details
#32	ACCEPTED	0.13 s	details
#33	ACCEPTED	0.10 s	details
#34	ACCEPTED	0.10 s	details
#35	ACCEPTED	0.08 s	details
#36	ACCEPTED	0.10 s	details
#37	ACCEPTED	0.12 s	details
#38	ACCEPTED	0.07 s	details
#39	ACCEPTED	0.11 s	details
#40	ACCEPTED	0.10 s	details
#41	ACCEPTED	0.07 s	details
#42	ACCEPTED	0.09 s	details
#43	ACCEPTED	0.08 s	details
#44	ACCEPTED	0.09 s	details
#45	ACCEPTED	0.09 s	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:50:21: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(a1) t[a[i]]++;
                     ^
input/code.cpp:51:21: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(b1) t[b[j]]++;
                     ^
input/code.cpp:52:21: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(c1) t[c[k]]++;
                     ^
input/code.cpp:54:23: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(a1 && t[a[i]] > 1) q = a[i];
                       ^
input/code.cpp:55:23: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(b1 && t[b[j]] > 1) q = b[j];
                       ^
input/code.cpp:56:23: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(c1 && t[c[k]] > 1) q = c[k];
                       ^
input/code.cpp:71:21: warning: array subscript has type 'char' [-Wchar-subscripts]
        if(a1) t[a[i]]--;...

Code

#include <bits/stdc++.h>
using namespace std;
string dp2[51][51][51];
int dp[51][51][51];
int main() {
    for(int i = 0; i < 51; ++i) {
	for(int j = 0; j < 51; ++j) {
	    for(int k = 0; k < 51; ++k) {
		dp[i][j][k] = 1e9;
	    }
	}
    }
    string a,b,c;
    cin>>a>>b>>c;
    int an, bn, cn;
    an = a.size();
    bn = b.size();
    cn = c.size();
    int t[200] = {0};
    dp[0][0][0] = 0;
    for(int i = 0; i <= an; ++i) {
	for(int j = 0; j <= bn; ++j) {
	    for(int k = 0; k <= cn; ++k) {
		if(i < an) {
		    if(dp[i+1][j][k] > dp[i][j][k]+1) {
			dp[i+1][j][k] = dp[i][j][k]+1;
			dp2[i+1][j][k] = dp2[i][j][k];
		    }
		}
		if(j < bn) {
		    if(dp[i][j+1][k] > dp[i][j][k]+1) {
			dp[i][j+1][k] = dp[i][j][k]+1;
			dp2[i][j+1][k] = dp2[i][j][k];
		    }
		}
		if(k < cn) {
		    if(dp[i][j][k+1] > dp[i][j][k]+1) {
			dp[i][j][k+1] = dp[i][j][k]+1;
			dp2[i][j][k+1] = dp2[i][j][k];
		    }
		}
		for(int a1 = 0; a1 < 2; ++a1) {
		    for(int b1 = 0; b1 < 2; ++b1) {
			for(int c1 = 0; c1 < 2; ++c1) {
			    if(i+a1 > an || j+b1 > bn || k+c1 > cn) continue;
			    int cost = 0;
			    if(a1 == 0) ++cost;
			    if(b1 == 0) ++cost;
			    if(c1 == 0) ++cost;
			    if(a1) t[a[i]]++;
			    if(b1) t[b[j]]++;
			    if(c1) t[c[k]]++;
			    char q = 0;
			    if(a1 && t[a[i]] > 1) q = a[i];
			    if(b1 && t[b[j]] > 1) q = b[j];
			    if(c1 && t[c[k]] > 1) q = c[k];
			    if(q == 0) {
				if(a1) q = a[i];
				if(b1) q = b[j];
				if(c1) q = c[k];
			    }
			    if(a1) cost += (a[i] != q);
			    if(b1) cost += (b[j] != q);
			    if(c1) cost += (c[k] != q);
			    if(dp[i+a1][j+b1][k+c1] > dp[i][j][k] + cost) {
				dp[i+a1][j+b1][k+c1] = dp[i][j][k] + cost;
				dp2[i+a1][j+b1][k+c1] = dp2[i][j][k];
				dp2[i+a1][j+b1][k+c1].push_back(q);

			    }
			    if(a1) t[a[i]]--;
			    if(b1) t[b[j]]--;
			    if(c1) t[c[k]]--;
			}
		    }
		}
		if(i != an || j != bn || k != cn) 
		dp2[i][j][k].clear();
	    }
	}
    }
    cout<<dp2[an][bn][cn]<<endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
`A A A` view save

correct output
`A` view save

user output
`A` view save

Test 2

Verdict: ACCEPTED

input
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`A` view save

user output
`A` view save

Test 3

Verdict: ACCEPTED

input
`A AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`A` view save

user output
`A` view save

Test 4

Verdict: ACCEPTED

input
`A A AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`A` view save

user output
`A` view save

Test 5

Verdict: ACCEPTED

input
`EEBAKAUUFWHXAHYEANNASFUDNDZXXL...` view save

correct output
`EGBAKBBMFTHFJHEAKDASLFHBNZGXVM...` view save

user output
`JGBBKBMLIYHFJHEZKSESLFPBNZIAVB...` view save

Test 6

Verdict: ACCEPTED

input
`BABAAAAB BBAAAAAAB BBBABABB` view save

correct output
`BBABAAAAB` view save

user output
`BABAAAAB` view save

Test 7

Verdict: ACCEPTED

input
`AAAAA AAABAAA BBAAAA` view save

correct output
`AAAAAA` view save

user output
`BAAAAA` view save

Test 8

Verdict: ACCEPTED

input
`AABAABB ABAAAB BBABAABA` view save

correct output
`ABABAABA` view save

user output
`BABAABB` view save

Test 9

Verdict: ACCEPTED

input
`BAABAB BBAAABAAAA ABAAABBB` view save

correct output
`BBAAABAB` view save

user output
`ABAAABAB` view save

Test 10

Verdict: ACCEPTED

input
`BABAB AABABBBA BABABBB` view save

correct output
`BABABBB` view save

user output
`BABABBB` view save

Test 11

Verdict: ACCEPTED

input
`AAABBBABBB BABBABABB ABBBB` view save

correct output
`AABBBABB` view save

user output
`BABBBABB` view save

Test 12

Verdict: ACCEPTED

input
`AABAAABBAA BABAB BBBAA` view save

correct output
`BABBAA` view save

user output
`BBBAA` view save

Test 13

Verdict: ACCEPTED

input
`BBBBBBBBA AABABAABA ABBBAAA` view save

correct output
`ABBBBAABA` view save

user output
`AABBBAABA` view save

Test 14

Verdict: ACCEPTED

input
`BABBBABAA AABBBBABB AABBBAB` view save

correct output
`AABBBABA` view save

user output
`AABBBABB` view save

Test 15

Verdict: ACCEPTED

input
`ABBBBBBB ABBABABBA BBBBABBBA` view save

correct output
`ABBBBABBBA` view save

user output
`ABBBBBBA` view save

Test 16

Verdict: ACCEPTED

input
`BBABABAB BBBBBA AABAAA` view save

correct output
`BBABABA` view save

user output
`BABABA` view save

Test 17

Verdict: ACCEPTED

input
`AAABAAAA ABABAB BBBBBBB` view save

correct output
`ABABABA` view save

user output
`BABABAB` view save

Test 18

Verdict: ACCEPTED

input
`BBABABA BABAAAABAA BABBB` view save

correct output
`BABABABA` view save

user output
`BBABABA` view save

Test 19

Verdict: ACCEPTED

input
`AABBABB BBBBAABBBA BAABBAA` view save

correct output
`BAABBABA` view save

user output
`BAABBBA` view save

Test 20

Verdict: ACCEPTED

input
`BBBBBAA AAABAAAA AAABBABB` view save

correct output
`AAABBAAA` view save

user output
`AAABBAAA` view save

Test 21

Verdict: ACCEPTED

input
`AAAABBA ABAABA BBABBBBBA` view save

correct output
`ABAABBA` view save

user output
`ABAABBA` view save

Test 22

Verdict: ACCEPTED

input
`BBBABAB ABBABBBAA ABBBAABABB` view save

correct output
`ABBBABAB` view save

user output
`ABBBABAB` view save

Test 23

Verdict: ACCEPTED

input
`BBAAA BBABAB ABBBBABBB` view save

correct output
`BBABAB` view save

user output
`BBABAB` view save

Test 24

Verdict: ACCEPTED

input
`AABABBBAAB BBBABBBA ABBAAAB` view save

correct output
`ABBABBBAAB` view save

user output
`ABBABBAAB` view save

Test 25

Verdict: ACCEPTED

input
`ABBBBBBBB BAABAABAAA BAAAABAAAB` view save

correct output
`BAABAABAAAB` view save

user output
`BAABABBAAB` view save

Test 26

Verdict: ACCEPTED

input
`BBDDCBBCDBAABAACBAADACABBDDABB...` view save

correct output
`BADACCBCDBADBAACBAADACBABBCABB...` view save

user output
`CADACCBCDBADBAACBAADCBABBCABBD...` view save

Test 27

Verdict: ACCEPTED

input
`ADCDADBDDDCACBCCBCACDCDBCBCDBB...` view save

correct output
`DCAADADCDACBDBBDABDCCDBCABCBAC...` view save

user output
`DCAADADCDACBDBBDABCCCDBCBCBACA...` view save

Test 28

Verdict: ACCEPTED

input
`CBCBABACDDACDCBCBBBADACDCDCBCA...` view save

correct output
`DCACBABDCABCCACBCCBCBADABCDDCC...` view save

user output
`DCACBCBDCBCACBCCBCBADBCDDCCABA...` view save

Test 29

Verdict: ACCEPTED

input
`CCBADBAACDDCBAABCADBDBDCCBCCDC...` view save

correct output
`CABCBBABBDBAAACBDDABDAABCABBDB...` view save

user output
`CABCDBABBDDCAAABDDABBDBADCABCC...` view save

Test 30

Verdict: ACCEPTED

input
`DCBDBABAADBDCDCDDDCCDACADDCCAC...` view save

correct output
`DCBABACDDBACDCBDDACAACADDCCACD...` view save

user output
`DBABACBDDBCCDCBDDACAACADDCCACD...` view save

Test 31

Verdict: ACCEPTED

input
`BCBACAADABAACACADCADCDAAACDDDD...` view save

correct output
`BCDCCBADDBBACDCADCDAADACDBDADA...` view save

user output
`BCDCCBCDDBBBCDCADCDAADACDBDADA...` view save

Test 32

Verdict: ACCEPTED

input
`ACDCDACCABADADABADDAAACBDCABBB...` view save

correct output
`ACDADACCABABACABADAABACBDCABBA...` view save

user output
`ACDADACCABABAAABADBCAACDDCABBD...` view save

Test 33

Verdict: ACCEPTED

input
`ABCCDCADCDADAADBDDBBABDACBBAAC...` view save

correct output
`BCDADCDBABDBDDCBDABDACBBAAADCA...` view save

user output
`BCDADCDDABDBDCBDABDACBBAADDCAB...` view save

Test 34

Verdict: ACCEPTED

input
`DABDBACDBADABBDDBAACCAADABDBBD...` view save

correct output
`DABDCBACADBDADCAABDBDBAACDAADA...` view save

user output
`DCBDCBAACDBDACACBDCDBABACDAADA...` view save

Test 35

Verdict: ACCEPTED

input
`BCBABDCADCBADCAABCACCBDAABBCBD...` view save

correct output
`BCBDBDCADBBBBCCABCDADBDAADBCBD...` view save

user output
`BCBDBCADBBBBCCABCDADBDAADBCBDB...` view save

Test 36

Verdict: ACCEPTED

input
`TFWRLHNANNYROWCGQJUHNIAHQTQMJF...` view save

correct output
`TFCRBHJANDNYJOCGQPJAHNIACFJCMJ...` view save

user output
`TXCRBPJENDRYJOCGQPJAHWIACSJCMJ...` view save

Test 37

Verdict: ACCEPTED

input
`HLQGBFZAPEMVFIDMBTZLKOSTCSBKPX...` view save

correct output
`HKVGBAKAWEACFIBHCMNBTALCLSTSBJ...` view save

user output
`PKAWBAUFUOFHCMBTYRWTSTJDLQPXNH...` view save

Test 38

Verdict: ACCEPTED

input
`BURAOHCWCRFABWYQTGIDCIJZGAGOQH...` view save

correct output
`BUMIHPWFBAAMWREPGDCIJIGGGQHJAJ...` view save

user output
`VUMIHPWFBAAMWRWXGPCOJSGGGVHJCP...` view save

Test 39

Verdict: ACCEPTED

input
`JHLXFPNXFCWAXXBNOOKKAAOYCAJQNC...` view save

correct output
`FHPNDFCWABLINDFGCAAFYCMJNCCHYE...` view save

user output
`ZHUNGFIWABVINHRCQUVFYCMJNEPHYX...` view save

Test 40

Verdict: ACCEPTED

input
`XPRJAEQNVMRJPRONUEBLIRWTWQLPCT...` view save

correct output
`XRIAEFBHMDICDNJEBLIJDTHQCXRNAA...` view save

user output
`XRYCEFBHMDICSNJZJUIJETHQCXRNPA...` view save

Test 41

Verdict: ACCEPTED

input
`LIFBDNCQAUIBFDBQWYQYHHIHTILAGL...` view save

correct output
`GLGNIKBDNSQAJIUDBJYFIILAGJCEAK...` view save

user output
`GLGTIKEFNSQHZIUDBJYFIILAGRMRQC...` view save

Test 42

Verdict: ACCEPTED

input
`XVRPEIHNUVILHOMUZVSDUBCCWFCUPR...` view save

correct output
`XHJPIADTKEFHOUZSDUYCBAFCAHBGEU...` view save

user output
`XHWPVTDWXEFHOUZSDUMYLBFHHQBOEI...` view save

Test 43

Verdict: ACCEPTED

input
`NVXEUOKZUBIPREENTXKZNJCKOJWSZX...` view save

correct output
`NVEUJFZJNGPJUEVTJHNJCKOAWSFZUA...` view save

user output
`FNHXHUIVZJNGPAJDLOWRZAWCKYTKRZ...` view save

Test 44

Verdict: ACCEPTED

input
`TPMZYIOLFNHUYUTQEGXKDUVWIIGPZR...` view save

correct output
`TEDBKIWELFIHKUYBOANEGDCBJIBBEZ...` view save

user output
`YEDBUIWLPTXUYWOWTGQKOIEWIFJPUR...` view save

Test 45

Verdict: ACCEPTED

input
`OPTIBHSPIKWOVIIAJSDRGAHPPSWHGZ...` view save

correct output
`BHSPICWOJIIENAGODCGAHKGDWHGCAB...` view save

user output
`GHWQYCWOKILMNAGXDCMMHKIDWHGCAB...` view save

HIIT Open 2017

Median string

Compiler report

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

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Tasks

Submissions (Ace of Spades)