Skip to content

Instantly share code, notes, and snippets.

@uwi

uwi/REPEATS.java Secret

Created Dec 13, 2013
Embed
What would you like to do?
SPOJ REPEATS
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public class REPEATS {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
for(int T = ni();T >= 1;T--){
int n = ni();
char[] s = new char[n];
for(int i = 0;i < n;i++){
s[i] = nc();
}
SuffixAutomaton sa = SuffixAutomaton.build(s).sortTopologically();
int[] fo = sa.enumFirstOccurences();
int[] f = sa.factor(s, fo);
out.println(sa.enumType1Runs(f, s));
}
}
public static class SuffixAutomaton {
public Node t0;
public int len;
public Node[] nodes;
public int gen;
private SuffixAutomaton(int n)
{
gen = 0;
nodes = new Node[2*n];
this.t0 = makeNode(0, false);
}
private Node makeNode(int len, boolean isCloned)
{
Node node = new Node();
node.id = gen;
node.isCloned = isCloned;
node.len = len;
nodes[gen++] = node;
return node;
}
public static class Node
{
public int id;
public int len;
public char key;
public Node link;
private Node[] next = new Node[3];
public boolean isCloned;
public int np = 0;
public int hit = 0;
public void putNext(char c, Node to)
{
to.key = c;
if(hit<<31-(c-'a')<0){
for(int i = 0;i < np;i++){
if(next[i].key == c){
next[i] = to;
return;
}
}
}
hit |= 1<<c-'a';
if(np == next.length){
next = Arrays.copyOf(next, np*2);
}
next[np++] = to;
}
public boolean containsKeyNext(char c)
{
return hit<<31-(c-'a')<0;
// for(int i = 0;i < np;i++){
// if(next[i].key == c)return true;
// }
// return false;
}
public Node getNext(char c)
{
if(hit<<31-(c-'a')<0){
for(int i = 0;i < np;i++){
if(next[i].key == c)return next[i];
}
}
return null;
}
}
public static SuffixAutomaton build(char[] str)
{
int n = str.length;
SuffixAutomaton sa = new SuffixAutomaton(n);
sa.len = str.length;
Node last = sa.t0;
for(char c : str){
last = sa.extend(last, c);
// System.out.println(sa.toDot(true, false));
}
return sa;
}
public Node extend(Node last, char c)
{
Node cur = makeNode(last.len+1, false);
Node p;
for(p = last; p != null && !p.containsKeyNext(c);p = p.link){
p.putNext(c, cur);
}
if(p == null){
cur.link = t0;
}else{
Node q = p.getNext(c); // not null
if(p.len + 1 == q.len){
cur.link = q;
}else{
// Node clone = new Node(p.len+1, true); // TODO understand
Node clone = makeNode(p.len+1, true);
clone.next = Arrays.copyOf(q.next, q.next.length);
clone.hit = q.hit;
clone.np = q.np;
clone.link = q.link;
for(;p != null && q.equals(p.getNext(c)); p = p.link){ // TODO understand
p.putNext(c, clone);
}
q.link = cur.link = clone;
}
}
return cur;
}
public SuffixAutomaton lexSort()
{
for(int i = 0;i < gen;i++){
Node node = nodes[i];
Arrays.sort(node.next, 0, node.np, new Comparator<Node>() {
public int compare(Node a, Node b) {
return a.key - b.key;
}
});
}
return this;
}
public SuffixAutomaton sortTopologically()
{
int[] indeg = new int[gen];
for(int i = 0;i < gen;i++){
for(int j = 0;j < nodes[i].np;j++){
indeg[nodes[i].next[j].id]++;
}
}
Node[] sorted = new Node[gen];
sorted[0] = t0;
int p = 1;
for(int i = 0;i < gen;i++){
Node cur = sorted[i];
for(int j = 0;j < cur.np;j++){
if(--indeg[cur.next[j].id] == 0){
sorted[p++] = cur.next[j];
}
}
}
for(int i = 0;i < gen;i++)sorted[i].id = i;
nodes = sorted;
return this;
}
public String toString()
{
StringBuilder sb = new StringBuilder();
for(Node n : nodes){
if(n != null){
sb.append(String.format("{id:%d, len:%d, link:%d, cloned:%b, ",
n.id,
n.len,
n.link != null ? n.link.id : null,
n.isCloned));
sb.append("next:{");
for(int i = 0;i < n.np;i++){
sb.append(n.next[i].key + ":" + n.next[i].id + ",");
}
sb.append("}");
sb.append("}");
sb.append("\n");
}
}
return sb.toString();
}
public String toGraphviz(boolean next, boolean suffixLink)
{
StringBuilder sb = new StringBuilder("http://chart.apis.google.com/chart?cht=gv:dot&chl=");
sb.append("digraph{");
for(Node n : nodes){
if(n != null){
if(suffixLink && n.link != null){
sb.append(n.id)
.append("->")
.append(n.link.id)
.append("[style=dashed],");
}
if(next && n.next != null){
for(int i = 0;i < n.np;i++){
sb.append(n.id)
.append("->")
.append(n.next[i].id)
.append("[label=")
.append(n.next[i].key)
.append("],");
}
}
}
}
sb.append("}");
return sb.toString();
}
public String label(Node n)
{
if(n.isCloned){
return n.id + "C";
}else{
return n.id + "";
}
}
public String toDot(boolean next, boolean suffixLink)
{
StringBuilder sb = new StringBuilder("digraph{\n");
sb.append("graph[rankdir=LR];\n");
sb.append("node[shape=circle];\n");
for(Node n : nodes){
if(n != null){
if(suffixLink && n.link != null){
sb.append("\"" + label(n) + "\"")
.append("->")
.append("\"" + label(n.link) + "\"")
.append("[style=dashed];\n");
}
if(next && n.next != null){
for(int i = 0;i < n.np;i++){
sb.append("\"" + label(n) + "\"")
.append("->")
.append("\"" + label(n.next[i]) + "\"")
.append("[label=\"")
.append(n.next[i].key)
.append("\"];\n");
}
}
}
}
sb.append("}\n");
return sb.toString();
}
/**
* 相異なる連続部分文字列の個数
* @return
*/
public long numberOfDistinctSubstrings(){
long[] dp = new long[gen];
dp[0] = 1;
long ret = 0;
for(int i = 0;i < gen;i++){
Node n = this.nodes[i];
ret += dp[i];
for(int j = 0;j < n.np;j++){
dp[n.next[j].id] += dp[i];
}
}
return ret-1; // remove empty
}
public int lcslen(char[] t)
{
if(t.length == 0)return 0;
Node v = t0;
int l = 0, best = 0;
for(int i = 0;i < t.length;i++){
while(v != t0 && !v.containsKeyNext(t[i])){
v = v.link;
l = v.len;
}
if(v.containsKeyNext(t[i])){
v = v.getNext(t[i]);
l++;
}
if(l > best){
best = l;
}
}
return best;
}
public long[] preprocessDistinctSubstring()
{
int n = gen;
// preprocess
long[] dp = new long[n];
for(int i = n-1;i >= 0;i--){
dp[i] = 1;
Node node = nodes[i];
for(int j = 0;j < node.np;j++){
int toid = node.next[j].id;
dp[i] += dp[toid];
}
}
// U.tr(dp);
return dp;
}
public String kthDistinctSubstring(long K, long[] dp)
{
if(K <= 0)return null;
if(K >= dp[0])return null;
// greedy
Node cur = t0;
StringBuilder sb = new StringBuilder();
while(K > 0){
K--;
for(int j = 0;j < cur.np;j++){
Node next = cur.next[j];
int toid = next.id;
if(K-dp[toid] < 0){
sb.append(next.key);
cur = next;
break;
}else{
K -= dp[toid];
}
}
}
return sb.toString();
}
/**
* 各nodeについて、initial->nodeの連続部分文字列が元の文字列に何回出現するかカウントした配列を返す。
* cloneされていないノードに1をつけて、トポロジカルオーダー降順に走査してlinkに加算していく。
* あるnodeへのsuffixで終わる連続部分文字列はすべてsuffix linkをたどって
* nodeまでのprefixにlinkが集まる仕掛けになっている。
* original node->cloned nodeに必ずsuffix linkがはられる?
* -> original nodeなsuffix linkはない?
* @return
*/
public int[] enumNumberOfOccurrences()
{
int n = nodes.length;
int[] dp = new int[n];
for(int i = n-1;i >= 1;i--){
if(!nodes[i].isCloned)dp[i]++;
dp[nodes[i].link.id] += dp[i];
}
return dp;
}
public int[] enumFirstOccurences()
{
int[] fo = new int[gen];
Arrays.fill(fo, Integer.MAX_VALUE);
for(int i = gen-1;i >= 0;i--){
if(!nodes[i].isCloned){
fo[i] = nodes[i].len;
}
if(i > 0 && nodes[i].link.isCloned && fo[i] < fo[nodes[i].link.id]){
fo[nodes[i].link.id] = fo[i];
}
}
return fo;
}
public int[] factor(char[] s, int[] fo)
{
int[] f = new int[len+1];
int p = 0;
f[p++] = 0;
Node cur = t0;
int llen = 0;
for(int i = 0;i < len;i++){
if(i > 0){
Node next = cur.getNext(s[i]);
cur = next == null ? t0 : next;
}
while(fo[cur.id] >= i+1 && cur.len >= llen+1)cur = cur.link;
if(cur.len <= llen){
if(llen == 0){
if(i+1 < len)f[p++] = i+1;
llen = 0;
}else{
f[p++] = i;
llen = 1;
}
}else{
llen++;
}
// U.tr(u.id, cur.id, i, llen, f);
}
return Arrays.copyOf(f, p);
}
public int enumType1Runs(int[] f, char[] s)
{
int ret = 0;
for(int i = 0;i < f.length-1;i++){
// U.tr("i", i);
int left = f[i], mid = f[i+1], right = i+2 < f.length ? f[i+2] : s.length;
int start = Math.max(0, left-(right-left));
char[] t = new char[mid-start+right-start];
int tp = 0;
for(int j = mid-1;j >= start;j--)t[tp++] = s[j];
for(int j = right-1;j >= start;j--)t[tp++] = s[j];
int[] LS = Z(t);
char[] u = Arrays.copyOfRange(s, mid, right);
// U.tr(u);
int[] LP = Z(u);
// U.tr(LS);
// U.tr(LP);
for(int j = 0;j < right-mid;j++){
int lpv = j+1 == right-mid ? 0 : LP[j+1];
int lsv = Math.min(mid-start, LS[(mid-start)+(right-mid)-1-j]);
// U.tr(lsv, lpv, j+1);
if(lsv + lpv >= j+1){
ret = Math.max(ret, ((mid+j+lpv)-(mid-lsv)+1)/(j+1));
// gct++;
// U.tr("RUN", mid-lsv, mid+j+lpv, j+1, new String(s, mid-lsv, (mid+j+lpv+1)-(mid-lsv)));
}
}
}
return ret;
}
public static int[] Z(char[] str)
{
int n = str.length;
int[] z = new int[n];
if(n == 0)return z;
z[0] = n;
int l = 0, r = 0;
for(int i = 1;i < n;i++){
if(i > r){
l = r = i;
while(r < n && str[r-l] == str[r])r++;
z[i] = r-l; r--;
}else{
int k = i-l;
if(z[k] < r-i+1){
z[i] = z[k];
}else{
l = i;
while(r < n && str[r-l] == str[r])r++;
z[i] = r-l; r--;
}
}
}
return z;
}
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment