Tasks Details
hard
1.
LetterCover
Given two strings P and Q, find the minimum number of distinct letters in a string constructed by selecting, for each position, a letter from either P or Q.
Task Score
100%
Correctness
100%
Performance
100%
We are given two strings P and Q, each consisting of N lowercase English letters. For each position in the strings, we have to choose one letter from either P or Q, in order to construct a new string S, such that the number of distinct letters in S is minimal. Our task is to find the number of distinct letters in the resulting string S.
For example, if P = "ca" and Q = "ab", S can be equal to: "ca", "cb", "aa" or "ab". String "aa" has only one distinct letter ('a'), so the answer is 1 (which is minimal among those strings).
Write a function:
class Solution { public int solution(String P, String Q); }
that, given two strings P and Q, both of length N, returns the minimum number of distinct letters of a string S, that can be constructed from P and Q as described above.
Examples:
1. Given P = "abc", Q = "bcd", your function should return 2. All possible strings S that can be constructed are: "abc", "abd", "acc", "acd", "bbc", "bbd", "bcc", "bcd". The minimum number of distinct letters is 2, which be obtained by constructing the following strings: "acc", "bbc", "bbd", "bcc".
2. Given P = "axxz", Q = "yzwy", your function should return 2. String S must consist of at least two distinct letters in this case. We can construct S = "yxxy", where the number of distinct letters is equal to 2, and this is the only optimal solution.
3. Given P = "bacad", Q = "abada", your function should return 1. We can choose the letter 'a' in each position, so S can be equal to "aaaaa".
4. Given P = "amz", Q = "amz", your function should return 3. The input strings are identical, so the only possible S that can be constructed is "amz", and its number of distinct letters is 3.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..200,000];
- strings P and Q are both of length N;
- strings P and Q are made only of lowercase letters (a−z);
- strings P and Q contain a total of at most 20 distinct letters.
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 21
Time spent on task 39 minutes
Notes
not defined yet
Code: 13:52:14 UTC,
java,
autosave
Code: 13:52:34 UTC,
java,
autosave
Code: 13:53:05 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> elements
}
}
Code: 13:53:24 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>()
}
}
Code: 13:53:48 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
}
}
Code: 13:54:01 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
return 0;
}
}
Code: 13:54:16 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
for(int i=0; i<)
return 0;
}
}
Code: 13:54:44 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
}
return 0;
}
}
Code: 13:55:15 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new )
}
return 0;
}
}
Code: 13:55:31 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
}
return 0;
}
}
Code: 13:56:01 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get
}
}
return 0;
}
}
Code: 13:56:15 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
return 0;
}
}
Code: 13:56:26 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int
return 0;
}
}
Code: 13:56:49 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len =
return 0;
}
}
Code: 13:57:19 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
}
return 0;
}
}
Code: 13:57:36 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i)
}
return 0;
}
}
Code: 13:58:00 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
}
return 0;
}
}
Code: 13:58:20 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q)
}
return 0;
}
}
Code: 13:58:50 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q)
}
return 0;
}
}
Code: 13:59:01 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
return 0;
}
}
Code: 13:59:31 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
}
return 0;
}
}
Code: 13:59:57 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
}
}
return 0;
}
}
Code: 14:00:07 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
}
}
return 0;
}
}
Code: 14:00:37 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i)
}
}
}
return 0;
}
}
Code: 14:01:07 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
return 0;
}
}
Code: 14:01:19 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int
return 0;
}
}
Code: 14:02:36 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int curr
return 0;
}
}
Code: 14:03:02 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
return 0;
}
}
Code: 14:03:13 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i< )
return 0;
}
}
Code: 14:03:34 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
}
}
return 0;
}
}
Code: 14:03:56 UTC,
java,
autosave
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j))
}
}
return 0;
}
}
Code: 14:04:26 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
return 0;
}
}
Code: 14:04:54 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
return 0;
}
}
Code: 14:05:24 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
dist
return 0;
}
}
Code: 14:05:37 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctSearch
return 0;
}
}
Code: 14:05:52 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch
return 0;
}
}
Code: 14:06:13 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveE)
return 0;
}
}
Code: 14:06:32 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element)
return 0;
}
}
Code: 14:07:10 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, )
return 0;
}
}
Code: 14:07:34 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
return 0;
}
}
Code: 14:08:04 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int )
}
Code: 14:08:29 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, )
}
Code: 14:09:00 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer)
}
Code: 14:09:29 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0])
}
}
Code: 14:09:41 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
}
}
Code: 14:10:12 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement)
}
}
Code: 14:10:29 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0]=num;
}
}
}
Code: 14:10:47 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if()
}
}
Code: 14:11:07 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch()
}
}
}
Code: 14:11:36 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
}
}
Code: 14:12:06 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for()
}
}
}
Code: 14:12:17 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=0; )
}
}
}
Code: 14:12:27 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; )
}
}
}
Code: 14:12:49 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i))
}
}
}
}
Code: 14:13:00 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now))
}
}
}
}
Code: 14:13:13 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && haveElement)
}
}
}
}
Code: 14:13:23 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement)
}
}
}
}
Code: 14:13:45 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i))
}
}
}
}
Code: 14:14:14 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
}
}
}
Code: 14:14:44 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, )
}
}
}
Code: 14:15:07 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch()
}
}
}
Code: 14:15:34 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num)
}
}
}
Code: 14:15:45 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:16:20 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:16:27 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 1, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
Code: 14:16:50 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:17:11 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(26);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 1, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
Code: 14:18:26 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:18:37 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<l; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:18:47 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
public int solution(String P, String Q) {
// Implement your solution here
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:18:54 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
expand all
Example tests
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 1, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
Code: 14:19:25 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:19:39 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
expand all
Example tests
1.
0.008 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 1, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
1.
0.004 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Exception in thread "main" java.lang.IndexOutOfBoundsException: Index: 0, Size: 0 at java.util.ArrayList.rangeCheck(ArrayList.java:659) at java.util.ArrayList.get(ArrayList.java:435) at Solution.solution(Solution.java:29) at Exec.run(exec.java:45) at Exec.main(exec.java:34)
Code: 14:29:48 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
/ int l = element.size();
for(int i=0; i<l; i++){
element.add(new ArrayList<>(l));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:30:00 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
// int l = element.size();
for(int i=0; i<30; i++){
element.add(new ArrayList<>(30));
for(int j=0; j<l; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<l; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<l; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<l; i++){
for(int j=0; j<l; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:30:14 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
// int l = element.size();
for(int i=0; i<30; i++){
element.add(new ArrayList<>(30));
for(int j=0; j<30; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<30; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<30; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<30; i++){
for(int j=0; j<30; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Code: 14:30:18 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
// int l = element.size();
for(int i=0; i<30; i++){
element.add(new ArrayList<>(30));
for(int j=0; j<30; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<30; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<30; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<30; i++){
for(int j=0; j<30; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
Code: 14:30:32 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
// int l = element.size();
for(int i=0; i<30; i++){
element.add(new ArrayList<>(30));
for(int j=0; j<30; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<30; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<30; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<30; i++){
for(int j=0; j<30; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis
Code: 14:30:37 UTC,
java,
final,
score:
100
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
import java.util.*;
// you can also use imports, for example:
// import java.util.*;
// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
class Solution {
public static int solution(String P, String Q) {
// Implement your solution here
List<List<Boolean>> element = new ArrayList<>(30);
// int l = element.size();
for(int i=0; i<30; i++){
element.add(new ArrayList<>(30));
for(int j=0; j<30; j++){
element.get(i).add(false);
}
}
int len = P.length();
for(int i=0; i<len; i++){
int p = P.charAt(i) - 'a';
int q = Q.charAt(i) - 'a';
element.get(p).set(q, true);
element.get(q).set(p, true);
}
int temp = 0;
for(int i=0; i<30; i++){
if(element.get(i).get(i)){
temp++;
for(int j=0; j<30; j++){
element.get(i).set(j, false);
element.get(j).set(i, false);
}
}
}
int haveElement = 0;
for(int i=0; i<30; i++){
for(int j=0; j<30; j++){
if(element.get(i).get(j)){
haveElement |= 1 << i;
break;
}
}
}
int[] answer = {P.length()};
distinctElementSearch(haveElement, 0, 0, element, temp, answer);
return answer[0];
}
private static void distinctElementSearch(int haveElement, int now, int state, List<List<Boolean>> element, int num, int[] answer){
if(num >= answer[0]){
return;
}
int mask = 1 << now;
if(mask>haveElement){
answer[0] = num;
return;
}
if((mask & haveElement) == 0){
distinctElementSearch(haveElement, now+1, state, element, num, answer);
}
else
{
int temp = 0, d = 0;
for(int i=now+1; i<30; i++){
if(element.get(i).get(now) && (haveElement & (1<<i)) > 0){
temp |= 1 << i;
d++;
}
}
distinctElementSearch(haveElement^temp, now+1, state|temp, element, num+d, answer);
distinctElementSearch(haveElement, now+1, state|mask, element, num+1, answer);
}
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(2**A * A**2 + N) or O(2**A * A**2 + N * A**2)
Time complexity parameters:
A - size of the alphabet
A - size of the alphabet
expand all
Correctness tests
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
7.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
7.
0.008 s
OK
8.
0.008 s
OK
9.
0.008 s
OK
10.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.008 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
7.
0.004 s
OK
small_freq
Small tests where some letters have big but similar frequencies, N <= 17, A <= 12.
Small tests where some letters have big but similar frequencies, N <= 17, A <= 12.
✔
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
7.
0.004 s
OK
8.
0.008 s
OK
expand all
Correctness/performance tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.004 s
OK
1.
0.012 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.012 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
5.
0.012 s
OK
expand all
Performance tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
1.
0.484 s
OK
2.
0.484 s
OK
3.
0.488 s
OK
1.
0.484 s
OK
2.
0.492 s
OK
3.
0.008 s
OK
4.
0.484 s
OK