CSES - Datatähti 2018 alku

CSES - Datatähti 2018 alku - Results

Submission details
Task:	Bittijono
Sender:	tuomask
Submission time:	2017-10-15 23:57:24 +0300
Language:	Java
Status:	READY
Result:	22

Feedback
group	verdict	score
#1	ACCEPTED	7
#2	ACCEPTED	15
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.15 s	1	details
#2	ACCEPTED	0.21 s	1	details
#3	ACCEPTED	0.15 s	1	details
#4	ACCEPTED	0.17 s	1	details
#5	ACCEPTED	0.16 s	1	details
#6	ACCEPTED	0.17 s	1	details
#7	ACCEPTED	0.15 s	1	details
#8	ACCEPTED	0.15 s	1	details
#9	ACCEPTED	0.18 s	1	details
#10	ACCEPTED	0.14 s	1	details
#11	ACCEPTED	0.22 s	2	details
#12	ACCEPTED	0.15 s	2	details
#13	ACCEPTED	0.36 s	2	details
#14	ACCEPTED	0.23 s	2	details
#15	ACCEPTED	0.28 s	2	details
#16	ACCEPTED	0.55 s	2	details
#17	ACCEPTED	0.47 s	2	details
#18	ACCEPTED	0.35 s	2	details
#19	ACCEPTED	0.32 s	2	details
#20	ACCEPTED	0.36 s	2	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	TIME LIMIT EXCEEDED	--	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details
#31	TIME LIMIT EXCEEDED	--	4	details
#32	TIME LIMIT EXCEEDED	--	4	details
#33	TIME LIMIT EXCEEDED	--	4	details
#34	TIME LIMIT EXCEEDED	--	4	details
#35	TIME LIMIT EXCEEDED	--	4	details
#36	TIME LIMIT EXCEEDED	--	4	details
#37	TIME LIMIT EXCEEDED	--	4	details
#38	TIME LIMIT EXCEEDED	--	4	details
#39	TIME LIMIT EXCEEDED	--	4	details
#40	TIME LIMIT EXCEEDED	--	4	details

Code

import java.util.*;
/*
 * Datatähti 2018
 * Tuomas Karjalainen, Nurmeksen lukio
 */
public class Bittijono {
  public static void main(String[] args) {
    Scanner input = new Scanner(System.in);

    int n = input.nextInt();
    findArray(n);
  }


  public static List<boolean[]> list = new ArrayList<>();

  public static void findArray(int n) {
    int length = 1;
    // käydään läpi ratkaisun pituuksia
    while (true) {
      // Luodaan ensin lista kaikista ratkaisun pituisista bittijonoista
      // Ei listaa luotuna
      if (list.size() == 0) {
        // Luodaan lista, pituus alussa 1
        appendBoth(new boolean[]{}, length);
      } else { // Lista luotuna
        List<boolean[]> oldList = list; // luodaan kopio listasta
        list = new ArrayList<>(); // Lista on nyt uusi lista
        //System.out.println(oldList.size());
        //System.out.println(list.size());
        for (boolean[] item : oldList) { // Käydään läpi kaikki vanhan listan alkiot
          appendBoth(item, length); // Jatketaan uutta listaa rekursiolla
        }
      }
      // Käydään läpi listatut bittijonot
      for (boolean[] arr : list) {
        // Lasketaan kaikki bittijonon alijonot
        //invertArray(arr);
        if (arr[0]) continue;
        int count = countSubArrays(arr, list);
        if (count == n) {
          printArray(arr);
          return;
        }
      }
      length++;
    }
  }

  //public static HashMap<String, Integer> cacheCounted = new HashMap<String, Integer>();

  public static int countSubArrays(boolean[] array, List<boolean[]> list) {
    //printArray(array);
    //System.out.println(cacheCounted.size());
    /*String arrayString = arrayToString(array);
    String invertedArrayString = arrayToString(invertArray(array));
    if (cacheCounted.containsKey(arrayString)) {
      return cacheCounted.get(arrayString);
    }
    if (cacheCounted.containsKey(invertedArrayString)) {
      return cacheCounted.get(invertedArrayString);
    }
    invertArray(array);*/
    List<List<Boolean>> found = new ArrayList<>();
    for (boolean[] mask : list) {
      List<Boolean> masked = new ArrayList<>();
      for (int i=0; i < array.length; i++) {
        if (mask[i]) {
          masked.add(array[i]);
        }
      }
      if (!found.contains(masked) && masked.size() > 0) {
        found.add(masked);
      }
    }
    //cacheCounted.put(arrayString, found.size());
    return found.size();
  }

  public static void appendBoth(boolean[] base, int max) {
    if (base.length >= max) {
      list.add(base);
      return;
    }

    //System.out.print(base.length + " / " + max + "    ");
    //printArray(base);

    boolean[] add0 = new boolean[base.length + 1];
    boolean[] add1 = new boolean[base.length + 1];
    System.arraycopy(base, 0, add0, 0, base.length);
    System.arraycopy(base, 0, add1, 0, base.length);
    add0[base.length] = false;
    add1[base.length] = true;

    appendBoth(add0, max);
    appendBoth(add1, max);
  }

  public static boolean[] invertArray(boolean[] arr) {
    for (int i=0; i < arr.length; i++) {
      arr[i] = !arr[i];
    }
    return arr;
  }

  /*public static List<boolean[]> appendBoth(boolean[] base, int max) {
    List<boolean[]> list = new ArrayList<>();

    if (base.length >= max) {
      list.add(base);
      return list;
    }

    boolean[] add0 = new boolean[base.length + 1];
    boolean[] add1 = new boolean[base.length + 1];
    System.arraycopy(base, 0, add0, 0, base.length);
    System.arraycopy(base, 0, add1, 0, base.length);
    add0[base.length] = false;
    add1[base.length] = true;

    for (boolean[] item : appendBoth(add0, max)) {
      list.add(item);
    }
    for (boolean[] item : appendBoth(add1, max)) {
      list.add(item);
    }
    return list;
  }*/

  public static void printArray(boolean[] arr) {
    for (int i=0; i<arr.length; i++) {
      System.out.print(arr[i] ? '1' : '0');
    }
    System.out.println();
  }
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`1` view save

correct output
`1` view save

user output
`0` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`2` view save

correct output
`11` view save

user output
`00` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`3` view save

correct output
`10` view save

user output
`01` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4` view save

correct output
`1111` view save

user output
`0000` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`5` view save

correct output
`110` view save

user output
`001` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`6` view save

correct output
`101` view save

user output
`010` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`7` view save

correct output
`1110` view save

user output
`0001` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`8` view save

correct output
`1100` view save

user output
`0011` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`9` view save

correct output
`1101` view save

user output
`0010` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`10` view save

correct output
`1001` view save

user output
`0110` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`38` view save

correct output
`1101011` view save

user output
`0010100` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`13` view save

correct output
`11011` view save

user output
`00100` view save

Test 13

Group: 2

Verdict: ACCEPTED

input
`90` view save

correct output
`111001010` view save

user output
`000110101` view save

Test 14

Group: 2

Verdict: ACCEPTED

input
`25` view save

correct output
`110010` view save

user output
`001101` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`82` view save

correct output
`111001101` view save

user output
`000110010` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`94` view save

correct output
`1100011110` view save

user output
`0011100001` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`100` view save

correct output
`1111001001` view save

user output
`0000110110` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`99` view save

correct output
`110010010` view save

user output
`001101101` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`98` view save

correct output
`110110010` view save

user output
`001001101` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`92` view save

correct output
`100110001` view save

user output
`011001110` view save

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1666` view save

correct output
`101101100100101` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`897` view save

correct output
`11101001101010` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4466` view save

correct output
`111101010110100101` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4240` view save

correct output
`11011001011010101` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`3089` view save

correct output
`1011001010100101` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4697` view save

correct output
`11010101101010110` view save

user output
(empty)

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4608` view save

correct output
`11010110101001010` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4625` view save

correct output
`111011001100101001` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4611` view save

correct output
`11010101010101100` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`4917` view save

correct output
`10110100101010110` view save

user output
(empty)

Test 31

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`178555` view save

correct output
`1011010110110101010110110` view save

user output
(empty)

Test 32

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`864856` view save

correct output
`10111010110110100100101010010` view save

user output
(empty)

Test 33

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`112146` view save

correct output
`1101110101011001100100110` view save

user output
(empty)

Test 34

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`741124` view save

correct output
`1011010011010101100101011010` view save

user output
(empty)

Test 35

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`511902` view save

correct output
`1011010100011010100101001110` view save

user output
(empty)

Test 36

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`920019` view save

correct output
`11100100101101010101001101010` view save

user output
(empty)

Test 37

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`933943` view save

correct output
`10101011010100100110100111001` view save

user output
(empty)

Test 38

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`973410` view save

correct output
`1011010101011010101010101001` view save

user output
(empty)

Test 39

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`954943` view save

correct output
`10110110010011010100100110101` view save

user output
(empty)

Test 40

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`911674` view save

correct output
`1010110010110101010101010110` view save

user output
(empty)

Datatähti 2018 alku

Bittijono

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

Tasks

Submissions (tuomask)