id stringlengths 22 25 | content stringlengths 327 628k | max_stars_repo_path stringlengths 49 49 |
|---|---|---|
condefects-java_data_1201 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static int[] a;
static int n, m, k;
static void solve(PrintWriter o) {
try {
n = fReader.nextInt();
m = fReader.nextInt();
k = fReader.nextInt();
a = new int[n];
for(int i=0;i<n;i++) a[i] = fReader.nextInt();
int ans = 0;
for(int i=30;i>=0;i--) if(check(ans|(1<<i))) ans |= 1<<i;
o.println(ans);
} catch (Exception e){e.printStackTrace();}
}
static boolean check(int left) {
List<Integer> li = new ArrayList<>();
for(int i=0;i<n;i++) {
if(a[i] <= left) {
li.add(left - a[i]);
continue;
}
int right = 0;
for(int j=30;j>=0;j--) {
if((left & 1<<j) > 0) right |= 1<<j;
else {
if(((left|1<<j)-1) < a[i]) right |= 1<<j;
}
}
int cnt = right - a[i];
li.add(cnt);
}
Collections.sort(li);
long total = 0l;
for(int i=0;i<k;i++) total += li.get(i);
return total <= m;
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static boolean isPrime(long x){
boolean ok = true;
for(long i=2;i<=Math.sqrt(x);i++){
if(x % i == 0){
ok = false;
break;
}
}
return ok;
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % mod;
}
n >>= 1;
a = a * a % mod;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
public int getSize(int i){
return size[find(i)];
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static int[] a;
static int n, m, k;
static void solve(PrintWriter o) {
try {
n = fReader.nextInt();
m = fReader.nextInt();
k = fReader.nextInt();
a = new int[n];
for(int i=0;i<n;i++) a[i] = fReader.nextInt();
int ans = 0;
for(int i=30;i>=0;i--) if(check(ans|(1<<i))) ans |= 1<<i;
o.println(ans);
} catch (Exception e){e.printStackTrace();}
}
static boolean check(int left) {
List<Integer> li = new ArrayList<>();
for(int i=0;i<n;i++) {
if(a[i] <= left) {
li.add(left - a[i]);
continue;
}
int right = 0;
for(int j=30;j>=0;j--) {
if((left & 1<<j) > 0) right |= 1<<j;
else {
if(((right|1<<j)-1) < a[i]) right |= 1<<j;
}
}
int cnt = right - a[i];
li.add(cnt);
}
Collections.sort(li);
long total = 0l;
for(int i=0;i<k;i++) total += li.get(i);
return total <= m;
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static boolean isPrime(long x){
boolean ok = true;
for(long i=2;i<=Math.sqrt(x);i++){
if(x % i == 0){
ok = false;
break;
}
}
return ok;
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % mod;
}
n >>= 1;
a = a * a % mod;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
public int getSize(int i){
return size[find(i)];
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
} | ConDefects/ConDefects/Code/arc146_b/Java/34339610 |
condefects-java_data_1202 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int A = Integer.parseInt(sc.next());
int B = Integer.parseInt(sc.next());
TreeSet<Integer> days = new TreeSet<>();
for (int i = 0; i < N; i++) {
int d = Integer.parseInt(sc.next());
days.add(d % (A + B));
if (d % (A + B) == 0) {
days.add(A + B);
}
}
TreeSet<Integer> interval = new TreeSet<>();
int i = 0;
int y = 0;
for (int x: days) {
if (i == 0) {
y = x;
i++;
} else {
interval.add((x - y) % (A + B));
y = x;
}
}
interval.add((A + B) - days.last() + days.first() - 1);
if (interval.last() >= B) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int A = Integer.parseInt(sc.next());
int B = Integer.parseInt(sc.next());
TreeSet<Integer> days = new TreeSet<>();
for (int i = 0; i < N; i++) {
int d = Integer.parseInt(sc.next());
days.add(d % (A + B));
if (d % (A + B) == 0) {
days.add(A + B);
}
}
TreeSet<Integer> interval = new TreeSet<>();
int i = 0;
int y = 0;
for (int x: days) {
if (i == 0) {
y = x;
i++;
} else {
interval.add((x - y - 1) % (A + B));
y = x;
}
}
interval.add((A + B) - days.last() + days.first() - 1);
if (interval.last() >= B) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
} | ConDefects/ConDefects/Code/abc347_c/Java/53987475 |
condefects-java_data_1203 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.Arrays;
import java.util.StringJoiner;
import java.util.function.DoublePredicate;
public class Main {
static int N, M;
static Edge[] E;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
M = sc.nextInt();
E = new Edge[M];
for (int i = 0; i < M; i++) {
E[i] = new Edge(sc.nextInt()-1, sc.nextInt()-1, sc.nextInt(), sc.nextInt());
}
System.out.println(solve());
}
static class Edge {
final int u, v, b, c;
public Edge(int u, int v, int b, int c) {
this.u = u;
this.v = v;
this.b = b;
this.c = c;
}
}
static Edge[][] G;
static double[] dp;
static boolean[] dp2;
static String solve() {
// 以前やった濃度の問題と一緒の考えでいける
// 最初 u < v が見えてなくて解けなくない？ってなってた
G = adjD(N, E);
dp = new double[N];
dp2 = new boolean[N];
var ans = maximaizeD(0, 10000, Main::isOk);
return BigDecimal.valueOf(ans).toPlainString();
}
static boolean isOk(double x) {
// コスト毎美しさをxとするのにどれだけ美しさが余剰するか、でdp
Arrays.fill(dp, -1000000.0); // ここで Double.MIN_VALUE/2とやって苦しんだ(Double.MIN_VALUEは0以上で最小の"正の"数値)
Arrays.fill(dp2, false);
dp[0] = 0;
dp2[0] = true;
for (int i = 0; i < N; i++) {
if( !dp2[i] ) continue;
for (Edge e : G[i]) {
int j = e.v;
// (b-s)/c = x
// -> b-s = xc
// -> s = b-xc
double s = (double)e.b - x*e.c;
dp[j] = Math.max(dp[j], dp[i]+s);
dp2[j] = true;
}
}
return dp[N-1] > 0;
}
static Edge[][] adjD(int n, Edge[] es) {
Edge[][] adj = new Edge[n][];
int[] cnt = new int[n];
for (Edge e : es) {
cnt[e.u]++;
}
for (int i = 0; i < n; i++) {
adj[i] = new Edge[cnt[i]];
}
for (Edge e : es) {
adj[e.u][--cnt[e.u]] = e;
}
return adj;
}
static double maximaizeD(double lo, double hi, DoublePredicate p) {
int time = 0;
while(time++ < 100) {
double x = (hi + lo) / 2;
if( p.test(x) ) {
lo = x;
} else {
hi = x;
}
}
return lo;
}
static void writeLines(int[] as) {
var pw = new PrintWriter(System.out);
for (var a : as) pw.println(a);
pw.flush();
}
static void writeLines(long[] as) {
var pw = new PrintWriter(System.out);
for (var a : as) pw.println(a);
pw.flush();
}
static void writeSingleLine(int[] as) {
var pw = new PrintWriter(System.out);
for (var i = 0; i < as.length; i++) {
if (i != 0) pw.print(" ");
pw.print(as[i]);
}
pw.println();
pw.flush();
}
static void debug(Object... args) {
var j = new StringJoiner(" ");
for (var arg : args) {
if (arg == null) j.add("null");
else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
else j.add(arg.toString());
}
System.err.println(j);
}
@SuppressWarnings("unused")
private static class FastScanner {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public FastScanner(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (curbuf >= lenbuf) {
curbuf = 0;
try {
lenbuf = in.read(buffer);
} catch (IOException e) {
throw new RuntimeException();
}
if (lenbuf <= 0)
return false;
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[curbuf++];
else
return -1;
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (hasNextByte() && isSpaceChar(buffer[curbuf]))
curbuf++;
}
public boolean hasNext() {
skip();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new RuntimeException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (!isSpaceChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new RuntimeException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new RuntimeException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public long nextLong() {
if (!hasNext())
throw new RuntimeException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new RuntimeException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++)
map[i] = next().toCharArray();
return map;
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.util.Arrays;
import java.util.StringJoiner;
import java.util.function.DoublePredicate;
public class Main {
static int N, M;
static Edge[] E;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
M = sc.nextInt();
E = new Edge[M];
for (int i = 0; i < M; i++) {
E[i] = new Edge(sc.nextInt()-1, sc.nextInt()-1, sc.nextInt(), sc.nextInt());
}
System.out.println(solve());
}
static class Edge {
final int u, v, b, c;
public Edge(int u, int v, int b, int c) {
this.u = u;
this.v = v;
this.b = b;
this.c = c;
}
}
static Edge[][] G;
static double[] dp;
static boolean[] dp2;
static String solve() {
// 以前やった濃度の問題と一緒の考えでいける
// 最初 u < v が見えてなくて解けなくない？ってなってた
G = adjD(N, E);
dp = new double[N];
dp2 = new boolean[N];
var ans = maximaizeD(0, 10000, Main::isOk);
return BigDecimal.valueOf(ans).toPlainString();
}
static boolean isOk(double x) {
// コスト毎美しさをxとするのにどれだけ美しさが余剰するか、でdp
Arrays.fill(dp, Double.NEGATIVE_INFINITY/2); // ここで Double.MIN_VALUE/2とやって苦しんだ(Double.MIN_VALUEは0以上で最小の"正の"数値)
Arrays.fill(dp2, false);
dp[0] = 0;
dp2[0] = true;
for (int i = 0; i < N; i++) {
if( !dp2[i] ) continue;
for (Edge e : G[i]) {
int j = e.v;
// (b-s)/c = x
// -> b-s = xc
// -> s = b-xc
double s = (double)e.b - x*e.c;
dp[j] = Math.max(dp[j], dp[i]+s);
dp2[j] = true;
}
}
return dp[N-1] > 0;
}
static Edge[][] adjD(int n, Edge[] es) {
Edge[][] adj = new Edge[n][];
int[] cnt = new int[n];
for (Edge e : es) {
cnt[e.u]++;
}
for (int i = 0; i < n; i++) {
adj[i] = new Edge[cnt[i]];
}
for (Edge e : es) {
adj[e.u][--cnt[e.u]] = e;
}
return adj;
}
static double maximaizeD(double lo, double hi, DoublePredicate p) {
int time = 0;
while(time++ < 100) {
double x = (hi + lo) / 2;
if( p.test(x) ) {
lo = x;
} else {
hi = x;
}
}
return lo;
}
static void writeLines(int[] as) {
var pw = new PrintWriter(System.out);
for (var a : as) pw.println(a);
pw.flush();
}
static void writeLines(long[] as) {
var pw = new PrintWriter(System.out);
for (var a : as) pw.println(a);
pw.flush();
}
static void writeSingleLine(int[] as) {
var pw = new PrintWriter(System.out);
for (var i = 0; i < as.length; i++) {
if (i != 0) pw.print(" ");
pw.print(as[i]);
}
pw.println();
pw.flush();
}
static void debug(Object... args) {
var j = new StringJoiner(" ");
for (var arg : args) {
if (arg == null) j.add("null");
else if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg));
else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg));
else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg));
else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg));
else j.add(arg.toString());
}
System.err.println(j);
}
@SuppressWarnings("unused")
private static class FastScanner {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public FastScanner(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (curbuf >= lenbuf) {
curbuf = 0;
try {
lenbuf = in.read(buffer);
} catch (IOException e) {
throw new RuntimeException();
}
if (lenbuf <= 0)
return false;
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[curbuf++];
else
return -1;
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (hasNextByte() && isSpaceChar(buffer[curbuf]))
curbuf++;
}
public boolean hasNext() {
skip();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new RuntimeException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (!isSpaceChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new RuntimeException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new RuntimeException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public long nextLong() {
if (!hasNext())
throw new RuntimeException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new RuntimeException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++)
map[i] = next().toCharArray();
return map;
}
}
}
| ConDefects/ConDefects/Code/abc324_f/Java/46658942 |
condefects-java_data_1204 | import java.util.Scanner;
import java.util.HashMap;
import java.util.Arrays;
class Main{
public static void main(String[] args){
long start = System.nanoTime();
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[][] path = new int[M][];
for(int i=0;i<M;i++){
int u = sc.nextInt();
int v = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
path[i] = new int[]{u,v,b,c};
}
Arrays.sort(path,(a,b)->Integer.compare(a[0],b[0]));
double a = 0;
double b = 10000;
while((System.nanoTime()-start)/1e9<3){
double c = (a+b)/2;
HashMap<Integer,Double> map = new HashMap<>();
map.put(1,0.0);
for(int[] p:path)
if(map.containsKey(p[0]))
map.merge(p[1],map.get(p[0])+p[2]-c*p[3],Double::max);
if(0<=map.get(N))
a = c;
else
b = c;
}
System.out.printf("%.10f",a);
}
}
import java.util.Scanner;
import java.util.HashMap;
import java.util.Arrays;
class Main{
public static void main(String[] args){
long start = System.nanoTime();
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[][] path = new int[M][];
for(int i=0;i<M;i++){
int u = sc.nextInt();
int v = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
path[i] = new int[]{u,v,b,c};
}
Arrays.sort(path,(a,b)->Integer.compare(a[0],b[0]));
double a = 0;
double b = 10000;
while(a!=(a+b)/2&&b!=(a+b)/2){
double c = (a+b)/2;
HashMap<Integer,Double> map = new HashMap<>();
map.put(1,0.0);
for(int[] p:path)
if(map.containsKey(p[0]))
map.merge(p[1],map.get(p[0])+p[2]-c*p[3],Double::max);
if(0<=map.get(N))
a = c;
else
b = c;
}
System.out.printf("%.10f",a);
}
}
| ConDefects/ConDefects/Code/abc324_f/Java/48229002 |
condefects-java_data_1205 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
BufferedWriter wr=new BufferedWriter(new OutputStreamWriter(System.out));
String[]temp;
int N= Integer.parseInt(br.readLine()),mod=998244353;
int[]a=new int[N],b=new int[N];
temp=br.readLine().split(" ");
for (int i = 0; i <N ; i++)
a[i]= Integer.parseInt(temp[i]);
temp=br.readLine().split(" ");
for (int i = 0; i <N ; i++)
b[i]= Integer.parseInt(temp[i]);
int[][]dp=new int[N+1][3001];
Arrays.fill(dp[0],1);
for (int i = 0; i <N ; i++) {
int pre=0;
for (int j =a[i]; j <3000; j++) {
if (j>b[i]){
dp[i+1][j]=dp[i+1][j-1];
continue;
}
dp[i+1][j]=dp[i][j]+pre;
dp[i+1][j]%=mod;
pre=dp[i+1][j];
}
}
wr.write(String.valueOf(dp[N][b[N-1]]));
wr.flush();
br.close();
wr.close();
}
}
/*
dp[i][j]
* */
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
BufferedWriter wr=new BufferedWriter(new OutputStreamWriter(System.out));
String[]temp;
int N= Integer.parseInt(br.readLine()),mod=998244353;
int[]a=new int[N],b=new int[N];
temp=br.readLine().split(" ");
for (int i = 0; i <N ; i++)
a[i]= Integer.parseInt(temp[i]);
temp=br.readLine().split(" ");
for (int i = 0; i <N ; i++)
b[i]= Integer.parseInt(temp[i]);
int[][]dp=new int[N+1][3001];
Arrays.fill(dp[0],1);
for (int i = 0; i <N ; i++) {
int pre=0;
for (int j =a[i]; j <=3000; j++) {
if (j>b[i]){
dp[i+1][j]=dp[i+1][j-1];
continue;
}
dp[i+1][j]=dp[i][j]+pre;
dp[i+1][j]%=mod;
pre=dp[i+1][j];
}
}
wr.write(String.valueOf(dp[N][b[N-1]]));
wr.flush();
br.close();
wr.close();
}
}
/*
dp[i][j]
* */ | ConDefects/ConDefects/Code/abc222_d/Java/46182551 |
condefects-java_data_1206 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String strL = "L";
StringBuilder strO = new StringBuilder("o");
String strN = "n";
String strG = "g";
// 整数の入力
int inputNum = 2024;
// スペース区切りの整数の入力
for (int i = 1; i < inputNum; i++) {
strO.append("o");
}
// 出力
System.out.println(strL + strO + strN + strG);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String strL = "L";
StringBuilder strO = new StringBuilder("o");
String strN = "n";
String strG = "g";
// 整数の入力
int inputNum = sc.nextInt();;
// スペース区切りの整数の入力
for (int i = 1; i < inputNum; i++) {
strO.append("o");
}
// 出力
System.out.println(strL + strO + strN + strG);
}
} | ConDefects/ConDefects/Code/abc336_a/Java/52232105 |
condefects-java_data_1207 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String o = "";
for (int i = 0; i < n; i++){
o += "o";
}
System.out.print("l" + o + "ng");
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String o = "";
for (int i = 0; i < n; i++){
o += "o";
}
System.out.print("L" + o + "ng");
}
} | ConDefects/ConDefects/Code/abc336_a/Java/53239314 |
condefects-java_data_1208 | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
String ans = "l";
for(int i=0; i<n; i++) {
ans += "o";
}
ans += "ng";
System.out.println(ans);
input.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
String ans = "L";
for(int i=0; i<n; i++) {
ans += "o";
}
ans += "ng";
System.out.println(ans);
input.close();
}
}
| ConDefects/ConDefects/Code/abc336_a/Java/50445683 |
condefects-java_data_1209 | import java.io.*;
import java.util.*;
public class Main {
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static int mod = (int) (1e9 + 7);
// static int mod = 998244353;
static int INF = 0x3f3f3f3f;
static int[][] d = new int[][]{{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
static int N = 101010, idx = 1;
public static void main(String[] args) {
AReader sc = new AReader();
int t = 1;
// t = sc.nextInt();
while (t-- > 0) {
String s = sc.next();
char[] c = s.toCharArray();
if (c[0] != '<' || c[s.length() - 1] != '>' || s.length() <= 2) {
pw.println("No");
} else {
boolean flag = true;
for (int i = 1; i < s.length() - 1; i++) {
if (c[i] != '=') {
flag = false;
break;
}
}
pw.println(flag ? "Yes" : "NO");
}
pw.close();
}
}
static class AReader {
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNext() {
try {
return br.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = innerNext();
if (s == null) {
return false;
}
tokenizer = new StringTokenizer(s);
}
return true;
}
public String nextLine() {
return innerNext();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static int mod = (int) (1e9 + 7);
// static int mod = 998244353;
static int INF = 0x3f3f3f3f;
static int[][] d = new int[][]{{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
static int N = 101010, idx = 1;
public static void main(String[] args) {
AReader sc = new AReader();
int t = 1;
// t = sc.nextInt();
while (t-- > 0) {
String s = sc.next();
char[] c = s.toCharArray();
if (c[0] != '<' || c[s.length() - 1] != '>' || s.length() <= 2) {
pw.println("No");
} else {
boolean flag = true;
for (int i = 1; i < s.length() - 1; i++) {
if (c[i] != '=') {
flag = false;
break;
}
}
pw.println(flag ? "Yes" : "No");
}
pw.close();
}
}
static class AReader {
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNext() {
try {
return br.readLine();
} catch (Exception e) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String s = innerNext();
if (s == null) {
return false;
}
tokenizer = new StringTokenizer(s);
}
return true;
}
public String nextLine() {
return innerNext();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| ConDefects/ConDefects/Code/abc345_a/Java/52463282 |
condefects-java_data_1210 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
if (n % 3 == 2 || n <= 4) {
pw.println("No");
pw.close();
return;
}
int[] color = new int[3];
int[] c = new int[n];
int max = n * (n-1) / 6;
for (int i = n-1; i >= 0; i--) {
LABEL : {
for (int j = 0; j < 3; j++) {
if (color[j] + i <= max) {
color[j] += i;
c[i] = j;
break LABEL;
}
}
}
}
pw.println("Yes");
for (int i = n-1; i >= 0; i--) {
if (c[i] == 0) {
for (int j = 0; j < i; j++) pw.print("R");
pw.println();
}
if (c[i] == 1) {
for (int j = 0; j < i; j++) pw.print("B");
pw.println();
}
if (c[i] == 2) {
for (int j = 0; j < i; j++) pw.print("G");
pw.println();
}
}
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
if (n % 3 == 2 || n <= 4) {
pw.println("No");
pw.close();
return;
}
int[] color = new int[3];
int[] c = new int[n];
int max = n * (n-1) / 6;
for (int i = n-1; i >= 0; i--) {
LABEL : {
for (int j = 0; j < 3; j++) {
if (color[j] + i <= max) {
color[j] += i;
c[i] = j;
break LABEL;
}
}
}
}
pw.println("Yes");
for (int i = n-1; i >= 0; i--) {
if (c[i] == 0) {
for (int j = 0; j < i; j++) pw.print("R");
pw.println();
}
if (c[i] == 1) {
for (int j = 0; j < i; j++) pw.print("B");
pw.println();
}
if (c[i] == 2) {
for (int j = 0; j < i; j++) pw.print("W");
pw.println();
}
}
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
| ConDefects/ConDefects/Code/arc131_e/Java/27729233 |
condefects-java_data_1211 | import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
solve();
pw.flush();
}
public static void solve() {
int N = sc.nextInt();
if(N <= 5 || N % 3 == 2){
pw.println("No");
return;
}
pw.println("Yes");
int total = (N*(N-1))/2;
int norm = total/3;
char[] paint = new char[N-1];
int r = norm;
for(int i = N-1; i >= 1; i--){
if(r >= i){
paint[(N-1)-i] = 'R';
r -= i;
}
}
int b = norm;
for(int i = N-1; i >= 1; i--){
if(paint[N-i-1] != 'R' && b >= i){
paint[N-i-1] = 'B';
b -= i;
}
}
for(int i = N-1; i >= 1; i--){
if(paint[N-i-1] != 'R' && paint[N-i-1] != 'B'){
paint[N-i-1] = 'G';
}
}
for(int i = 0; i < N-1; i++){
char c = paint[i];
for(int j = i+1; j < N; j++){
sb.append(c);
}
pw.println(sb.toString());
sb.setLength(0);
}
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
solve();
pw.flush();
}
public static void solve() {
int N = sc.nextInt();
if(N <= 5 || N % 3 == 2){
pw.println("No");
return;
}
pw.println("Yes");
int total = (N*(N-1))/2;
int norm = total/3;
char[] paint = new char[N-1];
int r = norm;
for(int i = N-1; i >= 1; i--){
if(r >= i){
paint[(N-1)-i] = 'R';
r -= i;
}
}
int b = norm;
for(int i = N-1; i >= 1; i--){
if(paint[N-i-1] != 'R' && b >= i){
paint[N-i-1] = 'B';
b -= i;
}
}
for(int i = N-1; i >= 1; i--){
if(paint[N-i-1] != 'R' && paint[N-i-1] != 'B'){
paint[N-i-1] = 'W';
}
}
for(int i = 0; i < N-1; i++){
char c = paint[i];
for(int j = i+1; j < N; j++){
sb.append(c);
}
pw.println(sb.toString());
sb.setLength(0);
}
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
| ConDefects/ConDefects/Code/arc131_e/Java/27720248 |
condefects-java_data_1212 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String string = scan.next();
string = string + ('a'-'A');
System.out.println(string);
scan.close();
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String string = scan.next();
string = string.toUpperCase();
System.out.println(string);
scan.close();
}
} | ConDefects/ConDefects/Code/abc292_a/Java/40155956 |
condefects-java_data_1213 | import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
String input = sc.next();
char[] letters = input.toCharArray();
int counter = letters.length-1;
long ans = 0;
for (int i = 0; i < letters.length; i++)
{
char set = letters[i];
int ascii = set;
ans += (ascii - 64) * (Math.pow(26,counter));
counter--;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
String input = sc.next();
char[] letters = input.toCharArray();
int counter = letters.length-1;
long ans = 0;
for (int i = 0; i < letters.length; i++)
{
char set = letters[i];
int ascii = set;
ans += (ascii - 64) * (long)(Math.pow(26,counter));
counter--;
}
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc285_c/Java/38934695 |
condefects-java_data_1214 | import java.util.Scanner;
public class Main {
final static String ATOZ ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner scan = new Scanner(System.in);
String str = scan.next();
long ans = 0;
ans = (ATOZ.indexOf(str.charAt(str.length() -1)) + 1);
//System.out.println(ans);
for(int i = str.length() - 2; i >= 0;i--) {
//System.out.println((ATOZ.indexOf(str.charAt(i)) + 1) * Math.pow(26,str.length() - i - 1));
ans += (ATOZ.indexOf(str.charAt(i)) + 1) * Math.pow(26,str.length() - i - 1);
}
System.out.print(ans);
}
}
import java.util.Scanner;
public class Main {
final static String ATOZ ="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner scan = new Scanner(System.in);
String str = scan.next();
long ans = 0;
ans = (ATOZ.indexOf(str.charAt(str.length() -1)) + 1);
//System.out.println(ans);
for(int i = str.length() - 2; i >= 0;i--) {
//System.out.println((ATOZ.indexOf(str.charAt(i)) + 1) * Math.pow(26,str.length() - i - 1));
ans += (ATOZ.indexOf(str.charAt(i)) + 1) * (long)Math.pow(26,str.length() - i - 1);
}
System.out.print(ans);
}
}
| ConDefects/ConDefects/Code/abc285_c/Java/39358419 |
condefects-java_data_1215 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int N = input.nextInt();
int minAge = 101;
int minAgeIndex = 0;
String[] nameList = new String[N];
for (int i = 0; i < N; i++) {
nameList[i] = input.next();
int currentAge = input.nextInt();
if (currentAge < minAge) {
minAge = currentAge;
minAgeIndex = i;
}
}
for (int i = minAgeIndex; i < minAgeIndex + N; i++) {
System.out.println(nameList[(i + N)%N]);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int N = input.nextInt();
double minAge = Math.pow(10, 9);
int minAgeIndex = 0;
String[] nameList = new String[N];
for (int i = 0; i < N; i++) {
nameList[i] = input.next();
int currentAge = input.nextInt();
if (currentAge < minAge) {
minAge = currentAge;
minAgeIndex = i;
}
}
for (int i = minAgeIndex; i < minAgeIndex + N; i++) {
System.out.println(nameList[(i + N)%N]);
}
}
} | ConDefects/ConDefects/Code/abc304_a/Java/45344300 |
condefects-java_data_1216 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int X = sc.nextInt();
int Y = sc.nextInt();
if(-3 <= X-Y && X-Y <= 2){
System.out.print("Yes");
}else{
System.out.print("No");
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int X = sc.nextInt();
int Y = sc.nextInt();
if(-2 <= X-Y && X-Y <= 3){
System.out.print("Yes");
}else{
System.out.print("No");
}
}
} | ConDefects/ConDefects/Code/abc326_a/Java/49046375 |
condefects-java_data_1217 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
if ( (a>b && a-b == 2 ) || ( a<b && b-a == 3)) System.out.println("Yes");
else System.out.println("No");
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
if ( (a>b && a-b <=3 ) || ( a<b && b-a <= 2)) System.out.println("Yes");
else System.out.println("No");
}
}
| ConDefects/ConDefects/Code/abc326_a/Java/49036308 |
condefects-java_data_1218 | import java.math.BigInteger;
import java.util.*;
public class Main {
static int N=(int)110;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int l1=sc.nextInt(),r1=sc.nextInt();
int l2=sc.nextInt(),r2=sc.nextInt();
int max=Math.max(l1,l2);
int min=0;
if (r1>=l2){
min=Math.min(r1,r2);
System.out.println(min-max);
return;
}
System.out.println(0);
}
}
import java.math.BigInteger;
import java.util.*;
public class Main {
static int N=(int)110;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int l1=sc.nextInt(),r1=sc.nextInt();
int l2=sc.nextInt(),r2=sc.nextInt();
int max=Math.max(l1,l2);
int min=0;
if (l2<r1&&r1<=r2||l1<r2&&r2<=r1){
min=Math.min(r1,r2);
System.out.println(min-max);
return;
}
System.out.println(0);
}
}
| ConDefects/ConDefects/Code/abc261_a/Java/37743068 |
condefects-java_data_1219 |
import java.util.*;
public class Main {
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int l1=sc.nextInt();
int r1=sc.nextInt();
int l2=sc.nextInt();
int r2=sc.nextInt();
int ans=0;
if(l2<r1&&l1<r1){
ans+=(Math.min(r1, r2)-Math.max(l1, l2));
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int l1=sc.nextInt();
int r1=sc.nextInt();
int l2=sc.nextInt();
int r2=sc.nextInt();
int ans=0;
if(l2<r1&&l1<r2){
ans+=(Math.min(r1, r2)-Math.max(l1, l2));
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc261_a/Java/37579490 |
condefects-java_data_1220 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
/**
*
* @author Yaseen
*/
public class Main {
static class FastScanner {
static BufferedReader br;
static StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public static int[] readArr(int n) {
int[] input = new int[n];
for (int i = 0; i < n; i++) {
input[i] = nextInt();
}
return input;
}
static String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
static int nextInt() {
return Integer.parseInt(next());
}
static long nextLong() {
return Long.parseLong(next());
}
static double nextDouble() {
return Double.parseDouble(next());
}
static String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
public static void main(String[] args) throws IOException{
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
//int testCases = sc.nextInt();
int x1,y1,x2,y2;
String s;
//for (int tt = 0; tt < testCases; tt++) {
x1 = sc.nextInt();
y1 = sc.nextInt();
x2 = sc.nextInt();
y2 = sc.nextInt();
int res = y1 - x2;
if(res < 0){
out.println(0);
}else{
out.println(res);
}
//}
out.flush();
out.close();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.StringTokenizer;
/**
*
* @author Yaseen
*/
public class Main {
static class FastScanner {
static BufferedReader br;
static StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public static int[] readArr(int n) {
int[] input = new int[n];
for (int i = 0; i < n; i++) {
input[i] = nextInt();
}
return input;
}
static String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
static int nextInt() {
return Integer.parseInt(next());
}
static long nextLong() {
return Long.parseLong(next());
}
static double nextDouble() {
return Double.parseDouble(next());
}
static String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
public static void main(String[] args) throws IOException{
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
//int testCases = sc.nextInt();
int x1,y1,x2,y2;
String s;
//for (int tt = 0; tt < testCases; tt++) {
x1 = sc.nextInt();
y1 = sc.nextInt();
x2 = sc.nextInt();
y2 = sc.nextInt();
int res = Math.min(y1, y2) - Math.max(x1, x2);
if(res < 0){
out.println(0);
}else{
out.println(res);
}
//}
out.flush();
out.close();
}
} | ConDefects/ConDefects/Code/abc261_a/Java/40789642 |
condefects-java_data_1221 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int L1 = in.nextInt();
int R1 = in.nextInt();
int L2 = in.nextInt();
int R2 = in.nextInt();
int ans = 0;
for(int i = 0 ; i < 100; i++){
if(L1 <= i && i <= R1){
if(L2 <= i && i <= R2){
ans++;
}
}
}
if(ans > 0){
ans--;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int L1 = in.nextInt();
int R1 = in.nextInt();
int L2 = in.nextInt();
int R2 = in.nextInt();
int ans = 0;
for(int i = 0 ; i <= 100; i++){
if(L1 <= i && i <= R1){
if(L2 <= i && i <= R2){
ans++;
}
}
}
if(ans > 0){
ans--;
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc261_a/Java/41703534 |
condefects-java_data_1222 | import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int[] f = new int[110];
for (int i = Math.min(a,b); i < Math.max(a,b); i++) {
f[i]++;
}
for (int i = Math.min(c,d); i <= Math.max(c,d); i++) {
f[i]++;
}
int res=0;
for (int i = 0; i < f.length; i++) {
if(f[i]==2)res++;
}
System.out.println(res);
}
}
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
int[] f = new int[110];
for (int i = Math.min(a,b); i < Math.max(a,b); i++) {
f[i]++;
}
for (int i = Math.min(c,d); i <Math.max(c,d); i++) {
f[i]++;
}
int res=0;
for (int i = 0; i < f.length; i++) {
if(f[i]==2)res++;
}
System.out.println(res);
}
} | ConDefects/ConDefects/Code/abc261_a/Java/37735588 |
condefects-java_data_1223 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for (int i = 1; i <= n; i ++) {
int a = sc.nextInt();
sum += a;
if (i % 7 == 0) {
System.out.println(sum);
sum = 0;
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for (int i = 1; i <= 7 * n; i ++) {
int a = sc.nextInt();
sum += a;
if (i % 7 == 0) {
System.out.println(sum);
sum = 0;
}
}
}
} | ConDefects/ConDefects/Code/abc307_a/Java/45108072 |
condefects-java_data_1224 | // import static org.junit.jupiter.api.Assertions.assertEquals;
// import org.junit.jupiter.api.Test;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N=sc.nextInt();
int M=sc.nextInt();
String[] S=new String[N];
for(int i=0;i<N;i++){
S[i]=sc.next();
}
int ans=N;
for(int bit=0;bit<(1<<N);bit++){
boolean[] exist=new boolean[M];
int cnt=0;
for(int i=0;i<N;i++){
if(bit>>(i&1)==1){
cnt++;
for(int j=0;j<M;j++){
if(S[i].charAt(j)=='o'){
exist[j]=true;
}
}
}
}
boolean allExist=true;
for(int j=0;j<M;j++){
if(!exist[j]){
allExist=false;
break;
}
}
if(allExist){
ans=Math.min(ans,cnt);
}
}
System.out.println(ans);
// @Test
// void addition() {
// assertEquals(2, 1 + 1);
}
}
// import static org.junit.jupiter.api.Assertions.assertEquals;
// import org.junit.jupiter.api.Test;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N=sc.nextInt();
int M=sc.nextInt();
String[] S=new String[N];
for(int i=0;i<N;i++){
S[i]=sc.next();
}
int ans=N;
for(int bit=0;bit<(1<<N);bit++){
boolean[] exist=new boolean[M];
int cnt=0;
for(int i=0;i<N;i++){
if((bit>>i&1)==1){
cnt++;
for(int j=0;j<M;j++){
if(S[i].charAt(j)=='o'){
exist[j]=true;
}
}
}
}
boolean allExist=true;
for(int j=0;j<M;j++){
if(!exist[j]){
allExist=false;
break;
}
}
if(allExist){
ans=Math.min(ans,cnt);
}
}
System.out.println(ans);
// @Test
// void addition() {
// assertEquals(2, 1 + 1);
}
} | ConDefects/ConDefects/Code/abc358_c/Java/54720697 |
condefects-java_data_1225 |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
MyScanner in = new MyScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
int n = in.nextInt();
String[] s=new String[n];
for(int i=0;i<n;i++){
s[i]=in.next();
}
// for(String ss:s){
// out.print(ss);
// }
int[] sum=new int[n];
int[] x=new int[n];
long ans=0L;
for(int i=0;i<n;i++){
for(char c:s[i].toCharArray()){
if(c=='X'){
x[i]++;
}else{
ans+=(c-'0')*x[i];
sum[i]+=(c-'0');
}
}
}
Integer[] ids= IntStream.range(0,n).boxed().toArray(Integer[]::new);
Arrays.sort(ids,(a,b)-> (sum[a]*x[b]==sum[b]*x[a])? (x[b] - x[a]) :(sum[a]*x[b]-sum[b]*x[a]));
long temp=0L;
for(int id:ids){
ans+=temp*sum[id];
temp+=x[id];
}
out.print(ans);
out.close();
}
static class MyScanner {
private BufferedReader br;
private StringTokenizer tokenizer;
public MyScanner(InputStream is) {
br = new BufferedReader(new InputStreamReader(is));
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(br.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
MyScanner in = new MyScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
int n = in.nextInt();
String[] s=new String[n];
for(int i=0;i<n;i++){
s[i]=in.next();
}
// for(String ss:s){
// out.print(ss);
// }
int[] sum=new int[n];
int[] x=new int[n];
long ans=0L;
for(int i=0;i<n;i++){
for(char c:s[i].toCharArray()){
if(c=='X'){
x[i]++;
}else{
ans+=(c-'0')*x[i];
sum[i]+=(c-'0');
}
}
}
Integer[] ids= IntStream.range(0,n).boxed().toArray(Integer[]::new);
Arrays.sort(ids,(a,b)-> (1L*sum[a]*x[b]==1L*sum[b]*x[a])? (x[b] - x[a]) :Long.compare(1L*sum[a]*x[b],1L*sum[b]*x[a]));
long temp=0L;
for(int id:ids){
ans+=temp*sum[id];
temp+=x[id];
}
out.print(ans);
out.close();
}
static class MyScanner {
private BufferedReader br;
private StringTokenizer tokenizer;
public MyScanner(InputStream is) {
br = new BufferedReader(new InputStreamReader(is));
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(br.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| ConDefects/ConDefects/Code/abc268_f/Java/37596413 |
condefects-java_data_1226 | import java.util.*;
public class Main {
public static void main(String[] args) {
IOHandler io = new IOHandler();
int n = io.nextInt();
int m = io.nextInt();
int x = io.nextInt();
int t = io.nextInt();
int d = io.nextInt();
io.close();
io.output(m >= x ? t : d*(m-n) + t);
}
private static class IOHandler {
private Scanner sc = new Scanner(System.in);
private void close() {this.sc.close();}
private int nextInt() {return this.sc.nextInt();}
private void output(int result) {System.out.println(result);}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
IOHandler io = new IOHandler();
int n = io.nextInt();
int m = io.nextInt();
int x = io.nextInt();
int t = io.nextInt();
int d = io.nextInt();
io.close();
io.output(m >= x ? t : d*(m-x) + t);
}
private static class IOHandler {
private Scanner sc = new Scanner(System.in);
private void close() {this.sc.close();}
private int nextInt() {return this.sc.nextInt();}
private void output(int result) {System.out.println(result);}
}
} | ConDefects/ConDefects/Code/abc259_a/Java/37085130 |
condefects-java_data_1227 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
int m=scanner.nextInt();
int x=scanner.nextInt();
int t=scanner.nextInt();
int d=scanner.nextInt();
if(m>=x){
System.out.println(t);
} else if(m<x){
int first=t-n*d;
first+=d*m;
System.out.println(first);
}
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
int m=scanner.nextInt();
int x=scanner.nextInt();
int t=scanner.nextInt();
int d=scanner.nextInt();
if(m>=x){
System.out.println(t);
} else if(m<x){
int first=t-x*d;
first+=d*m;
System.out.println(first);
}
}
} | ConDefects/ConDefects/Code/abc259_a/Java/41480560 |
condefects-java_data_1228 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int x = sc.nextInt();
int t = sc.nextInt();
int d = sc.nextInt();
if ((m < n) && (m > x))
System.out.println(t);
if (m < x) {
System.out.println(t - (d * (x - m)));
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int x = sc.nextInt();
int t = sc.nextInt();
int d = sc.nextInt();
if ((m >= x))
System.out.println(t);
if (m < x) {
System.out.println(t - (d * (x - m)));
}
}
} | ConDefects/ConDefects/Code/abc259_a/Java/35969509 |
condefects-java_data_1229 | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int v1 = sc.nextInt();
int v2 = sc.nextInt();
int v3 = sc.nextInt();
sc.close();
for (int a2 = 0; a2 < 15; a2++) {
for (int b2 = 0; b2 < 15; b2++) {
for (int c2 = 0; c2 < 15; c2++) {
for (int a3 = 0; a3 < 15; a3++) {
for (int b3 = 0; b3 < 15; b3++) {
for (int c3 = 0; c3 < 15; c3++) {
int d3 = calc(7, 7, 7, a2, b2, c2, a3, b3, c3);
int d21 = calc(7, 7, 7, a2, b2, c2);
int d22 = calc(7, 7, 7, a3, b3, c3);
int d23 = calc(a2, b2, c2, a3, b3, c3);
int d2 = d21 + d22 + d23 - d3 * 3;
int d1 = 1029 - d2 * 2 - d3 * 3;
if (d1 == v1 && d2 == v2 && d3 == v3) {
System.out.println("Yes");
StringBuilder sb = new StringBuilder();
sb.append("0 0 0 ");
sb.append(a2).append(' ');
sb.append(b2).append(' ');
sb.append(c2).append(' ');
sb.append(a3).append(' ');
sb.append(b3).append(' ');
sb.append(c3);
System.out.println(sb.toString());
return;
}
}
}
}
}
}
}
System.out.println("No");
}
static int calc(int a1, int b1, int c1, int a2, int b2, int c2) {
int ret = 1;
ret *= Math.max(Math.min(a1, a2) + 7 - Math.max(a1, a2), 0);
ret *= Math.max(Math.min(b1, b2) + 7 - Math.max(b1, b2), 0);
ret *= Math.max(Math.min(c1, c2) + 7 - Math.max(c1, c2), 0);
return ret;
}
static int calc(int a1, int b1, int c1, int a2, int b2, int c2,
int a3, int b3, int c3) {
int ret = 1;
ret *= Math.max(Math.min(a1, Math.min(a2, a3)) + 7 - Math.max(a1, Math.max(a2, a3)), 0);
ret *= Math.max(Math.min(b1, Math.min(b2, b3)) + 7 - Math.max(b1, Math.max(b2, b3)), 0);
ret *= Math.max(Math.min(c1, Math.min(c2, c3)) + 7 - Math.max(c1, Math.max(c2, c3)), 0);
return ret;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int v1 = sc.nextInt();
int v2 = sc.nextInt();
int v3 = sc.nextInt();
sc.close();
for (int a2 = 0; a2 < 15; a2++) {
for (int b2 = 0; b2 < 15; b2++) {
for (int c2 = 0; c2 < 15; c2++) {
for (int a3 = 0; a3 < 15; a3++) {
for (int b3 = 0; b3 < 15; b3++) {
for (int c3 = 0; c3 < 15; c3++) {
int d3 = calc(7, 7, 7, a2, b2, c2, a3, b3, c3);
int d21 = calc(7, 7, 7, a2, b2, c2);
int d22 = calc(7, 7, 7, a3, b3, c3);
int d23 = calc(a2, b2, c2, a3, b3, c3);
int d2 = d21 + d22 + d23 - d3 * 3;
int d1 = 1029 - d2 * 2 - d3 * 3;
if (d1 == v1 && d2 == v2 && d3 == v3) {
System.out.println("Yes");
StringBuilder sb = new StringBuilder();
sb.append("7 7 7 ");
sb.append(a2).append(' ');
sb.append(b2).append(' ');
sb.append(c2).append(' ');
sb.append(a3).append(' ');
sb.append(b3).append(' ');
sb.append(c3);
System.out.println(sb.toString());
return;
}
}
}
}
}
}
}
System.out.println("No");
}
static int calc(int a1, int b1, int c1, int a2, int b2, int c2) {
int ret = 1;
ret *= Math.max(Math.min(a1, a2) + 7 - Math.max(a1, a2), 0);
ret *= Math.max(Math.min(b1, b2) + 7 - Math.max(b1, b2), 0);
ret *= Math.max(Math.min(c1, c2) + 7 - Math.max(c1, c2), 0);
return ret;
}
static int calc(int a1, int b1, int c1, int a2, int b2, int c2,
int a3, int b3, int c3) {
int ret = 1;
ret *= Math.max(Math.min(a1, Math.min(a2, a3)) + 7 - Math.max(a1, Math.max(a2, a3)), 0);
ret *= Math.max(Math.min(b1, Math.min(b2, b3)) + 7 - Math.max(b1, Math.max(b2, b3)), 0);
ret *= Math.max(Math.min(c1, Math.min(c2, c3)) + 7 - Math.max(c1, Math.max(c2, c3)), 0);
return ret;
}
}
| ConDefects/ConDefects/Code/abc343_e/Java/50849570 |
condefects-java_data_1230 |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
void solve() {
int v1=nextInt(),v2=nextInt(),v3=nextInt();
for (int i = 0; i <= 7; i++) {
for (int j = 0; j <= 7; j++) {
for (int k = 0; k <= 7; k++) {
for (int a = -7; a <= i+7; a++) {
for (int b = -7; b <= j+7; b++) {
for (int c = -7; c <= k+7; c++) {
int u2 = sec2(i, j, k);
u2+=sec2(a,b,c);
u2+=sec2(a-i,b-j,c-k);
//[i,7]
int dx = Math.max(0, Math.min(a + 7, 7) - Math.max(i, a));
int dy = Math.max(0, Math.min(b + 7, 7) - Math.max(j, b));
int dz = Math.max(0, Math.min(c + 7, 7) - Math.max(k, c));
int u3=dx*dy*dz;
u2 -= u3 * 3;
int u1 = 7*7*7*3 - u2 * 2 - u3 * 3;
if (u1==v1&&u2==v2&&u3==v3){
out.println("Yes");
for (Integer integer : Arrays.asList(0, 0, 0, i, j, k, a, b, c)) {
out.print(integer + " ");
}
out.println();
return;
}
}
}
}
}
}
}
out.println("No");
}
int sec2(int a,int b,int c) {
int dx=Math.min(a+7,7) - Math.max(a,0);
int dy=Math.min(b+7,7) - Math.max(b,0);
int dz=Math.min(c+7,7) - Math.max(c,0);
return dx*dy*dz;
}
public static void main(String[] args) throws Exception {
new Thread(null, new Main(), "CustomThread", 1024 * 1024 * 100).start();
}
@Override
public void run() {
new Main().solve();
out.flush();
}
static PrintWriter out = new PrintWriter(System.out, false);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
import java.io.*;
import java.util.*;
public class Main implements Runnable {
void solve() {
int v1=nextInt(),v2=nextInt(),v3=nextInt();
for (int i = 0; i <= 7; i++) {
for (int j = 0; j <= 7; j++) {
for (int k = 0; k <= 7; k++) {
for (int a = -7; a <= i+7; a++) {
for (int b = -7; b <= j+7; b++) {
for (int c = -7; c <= k+7; c++) {
int u2 = sec2(i, j, k);
u2+=sec2(a,b,c);
u2+=sec2(a-i,b-j,c-k);
//[i,7]
int dx = Math.max(0, Math.min(a + 7, 7) - Math.max(i, a));
int dy = Math.max(0, Math.min(b + 7, 7) - Math.max(j, b));
int dz = Math.max(0, Math.min(c + 7, 7) - Math.max(k, c));
int u3=dx*dy*dz;
u2 -= u3 * 3;
int u1 = 7*7*7*3 - u2 * 2 - u3 * 3;
if (u1==v1&&u2==v2&&u3==v3){
out.println("Yes");
for (Integer integer : Arrays.asList(0, 0, 0, i, j, k, a, b, c)) {
out.print(integer + " ");
}
out.println();
return;
}
}
}
}
}
}
}
out.println("No");
}
int sec2(int a,int b,int c) {
int dx=Math.min(a+7,7) - Math.max(a,0);
int dy=Math.min(b+7,7) - Math.max(b,0);
int dz=Math.min(c+7,7) - Math.max(c,0);
return Math.max(dx*dy*dz,0);
}
public static void main(String[] args) throws Exception {
new Thread(null, new Main(), "CustomThread", 1024 * 1024 * 100).start();
}
@Override
public void run() {
new Main().solve();
out.flush();
}
static PrintWriter out = new PrintWriter(System.out, false);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
| ConDefects/ConDefects/Code/abc343_e/Java/50858339 |
condefects-java_data_1231 | import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.TreeSet;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var n = sc.nextInt();
var k = sc.nextInt();
var a = IntStream.range(0, n).map(i -> sc.nextInt()).toArray();
sc.close();
var list = new ArrayList<Integer>();
var min = 1;
var max = n * (n + 1) / 2;
var st = new Main().new SegmentTree(n + 1);
for (var i = 1; i <= n; i++) {
st.update(i, 1);
}
for (var i = 0; i < n; i++) {
var c1 = st.get(1, a[i]);
var c2 = st.get(a[i] + 1, n + 1);
var v = -1;
if (k <= min + c1 - 1) {
var set = new TreeSet<Integer>();
for (var j = i + 1; j < n; j++) {
if (a[j] < a[i]) {
set.add(a[j]);
}
}
v = new ArrayList<Integer>(set).get(min + set.size() - 1 - k);
} else if (k >= max - c2 + 1) {
var set = new TreeSet<Integer>();
for (var j = i + 1; j < n; j++) {
if (a[j] > a[i]) {
set.add(a[j]);
}
}
v = new ArrayList<Integer>(set).get(set.size() - max + k - 1);
}
//System.out.printf("%d %d %d %d %d\r\n", min, max, c1, c2, v);
if (v != -1) {
var check = false;
var list1 = new ArrayList<Integer>();
var list2 = new ArrayList<Integer>();
var list3 = new ArrayList<Integer>();
for (var j = 0; j < n; j++) {
if (j < i) {
list1.add(a[j]);
} else if (j >= i && !check) {
list2.add(a[j]);
if (a[j] == v) {
check = true;
}
} else {
list3.add(a[j]);
}
}
Collections.reverse(list2);
list.addAll(list1);
list.addAll(list2);
list.addAll(list3);
break;
}
min += c1;
max -= c2;
st.update(a[i], 0);
}
if (list.isEmpty()) {
for (var i = 0; i < n; i++) {
list.add(a[i]);
}
}
var sb = new StringBuilder();
for (var i = 0; i < list.size(); i++) {
var result = list.get(i);
sb.append(result);
sb.append(" ");
}
System.out.print(sb.toString());
}
public class SegmentTree {
private int n;
private long[] values;
public SegmentTree(int n) {
this.n = (int) Math.pow(2, Math.ceil(Math.log10(n) / Math.log10(2)));
this.values = new long[2 * this.n];
}
public void update(int i, long v) {
var index = i + n - 1;
values[index] = v;
while (index > 0) {
index = (index - 1) / 2;
values[index] = func(values[index * 2 + 1], values[index * 2 + 2]);
}
}
public long get(int i) {
return get(i, i + 1, 0, 0, n);
}
public long get(int l, int r) {
return get(l, r, 0, 0, n);
}
private long get(int l, int r, int k, int l2, int r2) {
if (r2 <= l || r <= l2) {
return init();
} else if (l <= l2 && r2 <= r) {
return values[k];
} else {
var v1 = get(l, r, k * 2 + 1, l2, (l2 + r2) / 2);
var v2 = get(l, r, k * 2 + 2, (l2 + r2) / 2, r2);
return func(v1, v2);
}
}
private long func(long a, long b) {
return a + b;
}
private long init() {
return 0L;
}
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.TreeSet;
import java.util.stream.IntStream;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var n = sc.nextInt();
var k = sc.nextInt();
var a = IntStream.range(0, n).map(i -> sc.nextInt()).toArray();
sc.close();
var list = new ArrayList<Integer>();
var min = 1;
var max = n * (n + 1) / 2;
var st = new Main().new SegmentTree(n + 1);
for (var i = 1; i <= n; i++) {
st.update(i, 1);
}
for (var i = 0; i < n; i++) {
var c1 = st.get(1, a[i]);
var c2 = st.get(a[i] + 1, n + 1);
var v = -1;
if (k <= min + c1 - 1) {
var set = new TreeSet<Integer>();
for (var j = i + 1; j < n; j++) {
if (a[j] < a[i]) {
set.add(a[j]);
}
}
v = new ArrayList<Integer>(set).get(k - min);
} else if (k >= max - c2 + 1) {
var set = new TreeSet<Integer>();
for (var j = i + 1; j < n; j++) {
if (a[j] > a[i]) {
set.add(a[j]);
}
}
v = new ArrayList<Integer>(set).get(set.size() - max + k - 1);
}
//System.out.printf("%d %d %d %d %d\r\n", min, max, c1, c2, v);
if (v != -1) {
var check = false;
var list1 = new ArrayList<Integer>();
var list2 = new ArrayList<Integer>();
var list3 = new ArrayList<Integer>();
for (var j = 0; j < n; j++) {
if (j < i) {
list1.add(a[j]);
} else if (j >= i && !check) {
list2.add(a[j]);
if (a[j] == v) {
check = true;
}
} else {
list3.add(a[j]);
}
}
Collections.reverse(list2);
list.addAll(list1);
list.addAll(list2);
list.addAll(list3);
break;
}
min += c1;
max -= c2;
st.update(a[i], 0);
}
if (list.isEmpty()) {
for (var i = 0; i < n; i++) {
list.add(a[i]);
}
}
var sb = new StringBuilder();
for (var i = 0; i < list.size(); i++) {
var result = list.get(i);
sb.append(result);
sb.append(" ");
}
System.out.print(sb.toString());
}
public class SegmentTree {
private int n;
private long[] values;
public SegmentTree(int n) {
this.n = (int) Math.pow(2, Math.ceil(Math.log10(n) / Math.log10(2)));
this.values = new long[2 * this.n];
}
public void update(int i, long v) {
var index = i + n - 1;
values[index] = v;
while (index > 0) {
index = (index - 1) / 2;
values[index] = func(values[index * 2 + 1], values[index * 2 + 2]);
}
}
public long get(int i) {
return get(i, i + 1, 0, 0, n);
}
public long get(int l, int r) {
return get(l, r, 0, 0, n);
}
private long get(int l, int r, int k, int l2, int r2) {
if (r2 <= l || r <= l2) {
return init();
} else if (l <= l2 && r2 <= r) {
return values[k];
} else {
var v1 = get(l, r, k * 2 + 1, l2, (l2 + r2) / 2);
var v2 = get(l, r, k * 2 + 2, (l2 + r2) / 2, r2);
return func(v1, v2);
}
}
private long func(long a, long b) {
return a + b;
}
private long init() {
return 0L;
}
}
}
| ConDefects/ConDefects/Code/arc160_a/Java/41425243 |
condefects-java_data_1232 |
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 160 A問題
* 考察メモ
* 順列なのか
* l番目にxが来る→[l, A_x]を選ぶ、の関係
* 自分をそのままにする方法はN(N-1)/2+1通り、それ以外は1通り
*
* f(A, K)
* 現状維持と中の変更、どう区別付けるか？
* 現状維持数Xを管理すると、これを引いてあげる必要があるのかな
*/
int N = io.nextInt(), K = io.nextInt();
int[] A = io.nextInt(N);
solve(A, 0, K);
io.println(A, " ");
}
void solve(int[] A, int L, int K) {
// io.debug(A);
// io.debugln(" : " + L + "," + K);
int N = A.length - L;
if (N <= 1) return;
int top = A[L];
if (top > K) { // 値Kと入れ替える
int right = -1;
for (int i = L + 1;i < A.length;++ i) if (A[i] == K) right = i;
ArrayUtility.reverse(A, L, right + 1);
return;
}
K -= top - 1;
int range = N * (N - 1) / 2 + L;
if (K <= range) { // 残りの部分から再計算
for (int i = L + 1;i < A.length;++ i) if (A[i] > top) -- A[i];
solve(A, L + 1, K);
for (int i = L + 1;i < A.length;++ i) if (A[i] >= top) ++ A[i];
return;
}
K -= range;
int right = -1;
for (int i = L + 1;i < A.length;++ i) if (A[i] == K + top) right = i;
ArrayUtility.reverse(A, L, right + 1);
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 160 A問題
* 考察メモ
* 順列なのか
* l番目にxが来る→[l, A_x]を選ぶ、の関係
* 自分をそのままにする方法はN(N-1)/2+1通り、それ以外は1通り
*
* f(A, K)
* 現状維持と中の変更、どう区別付けるか？
* 現状維持数Xを管理すると、これを引いてあげる必要があるのかな
*/
int N = io.nextInt(), K = io.nextInt();
int[] A = io.nextInt(N);
solve(A, 0, K);
io.println(A, " ");
}
void solve(int[] A, int L, int K) {
// io.debug(A);
// io.debugln(" : " + L + "," + K);
int N = A.length - L;
if (N <= 1) return;
int top = A[L];
if (top > K) { // 値Kと入れ替える
int right = -1;
for (int i = L + 1;i < A.length;++ i) if (A[i] == K) right = i;
ArrayUtility.reverse(A, L, right + 1);
return;
}
K -= top - 1;
int range = N * (N - 1) / 2 + L + 1;
if (K <= range) { // 残りの部分から再計算
for (int i = L + 1;i < A.length;++ i) if (A[i] > top) -- A[i];
solve(A, L + 1, K);
for (int i = L + 1;i < A.length;++ i) if (A[i] >= top) ++ A[i];
return;
}
K -= range;
int right = -1;
for (int i = L + 1;i < A.length;++ i) if (A[i] == K + top) right = i;
ArrayUtility.reverse(A, L, right + 1);
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
| ConDefects/ConDefects/Code/arc160_a/Java/41418835 |
condefects-java_data_1233 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int n = sc.nextInt();
int min = -1;
for(int i=0; i<=n; i++){
int sta = n-3*i;
if( sta>0 ){
int c = sta*x+i*y;
if( min==-1 )
min = c;
else
min = c<min ? c : min;
}
}
System.out.print(min);
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int n = sc.nextInt();
int min = -1;
for(int i=0; i<=n; i++){
int sta = n-3*i;
if( sta>=0 ){
int c = sta*x+i*y;
if( min==-1 )
min = c;
else
min = c<min ? c : min;
}
}
System.out.print(min);
}
} | ConDefects/ConDefects/Code/abc265_a/Java/37653468 |
condefects-java_data_1234 | import java.io.PrintWriter;
import java.math.*;
import java.util.*;
class Main {
static void solve (Scanner in, PrintWriter out) {
int x = in.nextInt(), y = in.nextInt(), n = in.nextInt();
out.println(n/3*y + n%3*x);
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
in.close();
out.close();
}
}
import java.io.PrintWriter;
import java.math.*;
import java.util.*;
class Main {
static void solve (Scanner in, PrintWriter out) {
int x = in.nextInt(), y = in.nextInt(), n = in.nextInt();
out.println(Math.min(n/3*y + n%3*x, n*x));
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
in.close();
out.close();
}
}
| ConDefects/ConDefects/Code/abc265_a/Java/37215676 |
condefects-java_data_1235 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int total = 0;
Scanner scanner = new Scanner(System.in);
int X = scanner.nextInt();
int Y = scanner.nextInt();
int N = scanner.nextInt();
if(Y > X * 3){
int m = N / 3;
int l = N % 3;
total = m * Y + l * X;
}else{
total = X * N;
}
System.out.println(total);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int total = 0;
Scanner scanner = new Scanner(System.in);
int X = scanner.nextInt();
int Y = scanner.nextInt();
int N = scanner.nextInt();
if(Y < X * 3){
int m = N / 3;
int l = N % 3;
total = m * Y + l * X;
}else{
total = X * N;
}
System.out.println(total);
}
}
| ConDefects/ConDefects/Code/abc265_a/Java/46199947 |
condefects-java_data_1236 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
//1
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int x = Integer.parseInt(scanner.next());
int y = Integer.parseInt(scanner.next());
int n = Integer.parseInt(scanner.next());
int tmp = 0;
if((double)x > (double)y/3) {
while(n-3 > 0) {
tmp++;
n = n-3;
}
System.out.println(y*tmp + x*n);
}else {
System.out.println(x*n);
}
}
}
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
//1
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int x = Integer.parseInt(scanner.next());
int y = Integer.parseInt(scanner.next());
int n = Integer.parseInt(scanner.next());
int tmp = 0;
if((double)x > (double)y/3) {
while(n-3 >= 0) {
tmp++;
n = n-3;
}
System.out.println(y*tmp + x*n);
}else {
System.out.println(x*n);
}
}
} | ConDefects/ConDefects/Code/abc265_a/Java/41141941 |
condefects-java_data_1237 | import java.util.*;
public class Main {
public static void main(String[] args) {
// 自分の得意な言語で
// Let's チャレンジ！！
Scanner sc = new Scanner(System.in);
int N = sc.nextInt(), A = sc.nextInt();
int[] T = new int[N + 1];
for (int i = 1; i <= N; i++) {
T[i] = sc.nextInt();
}
for (int i = 1; i <= N; i++) {
if (T[i] - T[i - 1] >= A) {
T[i] = T[i] + A;
} else {
T[i] = T[i - 1] + A;
}
System.out.println(T[i]);
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// 自分の得意な言語で
// Let's チャレンジ！！
Scanner sc = new Scanner(System.in);
int N = sc.nextInt(), A = sc.nextInt();
int[] T = new int[N + 1];
for (int i = 1; i <= N; i++) {
T[i] = sc.nextInt();
}
for (int i = 1; i <= N; i++) {
if (T[i] >= T[i - 1]) {
T[i] = T[i] + A;
} else {
T[i] = T[i - 1] + A;
}
System.out.println(T[i]);
}
}
} | ConDefects/ConDefects/Code/abc358_b/Java/54730602 |
condefects-java_data_1238 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int A = sc.nextInt();
int[] T = new int[N];
int ansT = 0;
for (int i=0; i<N; i++) {
T[i]=sc.nextInt();
}
ansT = T[0] + A;
System.out.println(ansT);
for (int i=1; i<N; i++) {
if (ansT>=T[i]) {
System.out.println(ansT+A);
ansT = T[i] + A;
}else {
ansT = T[i] + A;
System.out.println(ansT);
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int A = sc.nextInt();
int[] T = new int[N];
int ansT = 0;
for (int i=0; i<N; i++) {
T[i]=sc.nextInt();
}
ansT = T[0] + A;
System.out.println(ansT);
for (int i=1; i<N; i++) {
if (ansT>=T[i]) {
System.out.println(ansT+A);
ansT = ansT + A;
}else {
ansT = T[i] + A;
System.out.println(ansT);
}
}
}
} | ConDefects/ConDefects/Code/abc358_b/Java/54700053 |
condefects-java_data_1239 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int a=sc.nextInt();
int[] t = new int[n];
int t1=0;
for(int i=0;i<n;i++){
t[i]=sc.nextInt();
}
for(int i=0;i<n;i++){
if(i>=1 && t[i]<a+t[i-1]){
t[i]=t[i-1]+a;
System.out.println(t[i]);
}
else{
t[i]=t[i]+a;
System.out.println(t[i]);
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int a=sc.nextInt();
int[] t = new int[n];
int t1=0;
for(int i=0;i<n;i++){
t[i]=sc.nextInt();
}
for(int i=0;i<n;i++){
if(i>=1 && t[i]<t[i-1]){
t[i]=t[i-1]+a;
System.out.println(t[i]);
}
else{
t[i]=t[i]+a;
System.out.println(t[i]);
}
}
}
} | ConDefects/ConDefects/Code/abc358_b/Java/55133003 |
condefects-java_data_1240 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static long solve(int[] arr, int x, int y) {
int ans = 0;
int xn = -1, yn = -1;
int j = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] > x || arr[i] < y) {
j = i + 1;
xn = yn = -1;
} else {
if (arr[i] == x) xn = i;
if (arr[i] == y) yn = i;
if (xn >= 0 && yn >= 0) {
int t = Math.min(xn, yn);
ans += (t - j + 1);
}
}
}
return ans;
}
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
System.out.println(solve(arr, x, y));
}
static
class AReader {
private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return reader.readLine();
} catch (IOException ex) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String nextLine = innerNextLine();
if (nextLine == null) {
return false;
}
tokenizer = new StringTokenizer(nextLine);
}
return true;
}
public String nextLine() {
tokenizer = new StringTokenizer("");
return innerNextLine();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
// public BigInteger nextBigInt() {
// return new BigInteger(next());
// }
// 若需要nextDouble等方法，请自行调用Double.parseDouble包装
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static long solve(int[] arr, int x, int y) {
long ans = 0;
int xn = -1, yn = -1;
int j = 0;
for (int i = 0; i < arr.length; i++) {
if (arr[i] > x || arr[i] < y) {
j = i + 1;
xn = yn = -1;
} else {
if (arr[i] == x) xn = i;
if (arr[i] == y) yn = i;
if (xn >= 0 && yn >= 0) {
int t = Math.min(xn, yn);
ans += (t - j + 1);
}
}
}
return ans;
}
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextInt();
}
System.out.println(solve(arr, x, y));
}
static
class AReader {
private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return reader.readLine();
} catch (IOException ex) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String nextLine = innerNextLine();
if (nextLine == null) {
return false;
}
tokenizer = new StringTokenizer(nextLine);
}
return true;
}
public String nextLine() {
tokenizer = new StringTokenizer("");
return innerNextLine();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
// public BigInteger nextBigInt() {
// return new BigInteger(next());
// }
// 若需要nextDouble等方法，请自行调用Double.parseDouble包装
}
}
| ConDefects/ConDefects/Code/abc247_e/Java/38022241 |
condefects-java_data_1241 | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int count = 0;
String s = br.readLine();
s += br.readLine();
for(char c: s.toCharArray()){
if(c == '#'){
count++;
}
}
if(count == 2 && ((s.charAt(1) == '#' && s.charAt(2) == '#') ||(s.charAt(1) == '#' && s.charAt(3) == '#') )){
System.out.println("No");
} else {
System.out.println("Yes");
}
br.close();
}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int count = 0;
String s = br.readLine();
s += br.readLine();
for(char c: s.toCharArray()){
if(c == '#'){
count++;
}
}
if(count == 2 && ((s.charAt(1) == '#' && s.charAt(2) == '#') ||(s.charAt(0) == '#' && s.charAt(3) == '#') )){
System.out.println("No");
} else {
System.out.println("Yes");
}
br.close();
}
} | ConDefects/ConDefects/Code/abc229_a/Java/40574325 |
condefects-java_data_1242 | import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
char[] s1 = in.nextCharArray();
char[] s2 = in.nextCharArray();
out.println(ans(!(s1[0] != s1[1] && s1[0] != s2[0])));
}
String ans(boolean a){
return a ? "Yes" : "No";
}
String ans(boolean a,String t,String f){
return a ? t : f;
}
long pow(long a,long b){
long n = 1;
for (long i = 0; i < Math.abs(b); i++) {
n *= a;
}
return b > 0 ? n : 1/n;
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
char[] s1 = in.nextCharArray();
char[] s2 = in.nextCharArray();
out.println(ans(!(s1[0] != s1[1] && s1[0] != s2[0] && s1[0] == s2[1])));
}
String ans(boolean a){
return a ? "Yes" : "No";
}
String ans(boolean a,String t,String f){
return a ? t : f;
}
long pow(long a,long b){
long n = 1;
for (long i = 0; i < Math.abs(b); i++) {
n *= a;
}
return b > 0 ? n : 1/n;
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
} | ConDefects/ConDefects/Code/abc229_a/Java/38303537 |
condefects-java_data_1243 | import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Arrays;
import java.util.Map;
import java.util.HashMap;
class Main{
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
ArrayList<String> list = new ArrayList<>();
list = lib.inputProcess();
int N = Integer.parseInt(lib.arrayString(list.get(0), " ")[0]);
int M = Integer.parseInt(lib.arrayString(list.get(0), " ")[1]);
boolean[][] a = new boolean[N+1][N+1];
for( int i = 1 ; i <= M ; i++){
int[] t = lib.StringToIntArray(lib.arrayString(list.get(i), " "));
int k = t[0];
for( int j = 1 ; j <= k ; j++){
for( int l = 1 ; l <= k; l++){
a[t[j]][t[l]] = true;
a[t[l]][t[j]] = true;
}
}
}
String ans = "Yes";
r:for( int i = 1 ; i <= N ;i++){
for( int j = i ; i <= N ;i++ ){
if( i == j) continue;
if( !a[i][j]){
ans = "No";
break r;
}
}
}
out.println(ans);
out.flush();
}
}
class lib{
boolean[] seen;
public static void outputData(List<String> list){
for( String str: list){
System.out.println(str);
}
}
public static ArrayList<String> inputProcess(){
InputStreamReader input = new InputStreamReader(System.in);
BufferedReader buff = new BufferedReader(input);
ArrayList<String> list = new ArrayList<>();
try {
while( true ){
String str = buff.readLine();
if( str == null) break;
list.add(str);
}
buff.close();
} catch (IOException e) {
System.out.println(e.getMessage());
}
return list;
}
public static int[] changeIntArray(ArrayList<String> list){
final int N = list.size();
int[] array = new int[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Integer.parseInt( list.get(i));
}
return array;
}
public static double[] changeDoubleArray(ArrayList<String> list){
final int N = list.size();
double[] array = new double[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Double.parseDouble( list.get(i));
}
return array;
}
//標準入力をString型に置換
public static String createString(ArrayList<String> list){
final int N = list.size();
StringBuilder stb = new StringBuilder();
for( int i = 0 ; i < N ; i++ ){
stb.append( list.get(i));
}
return stb.toString();
}
public static String[] arrayString(String str, String s){
String[] array = str.split(s);
return array;
}
//標準入力をint型配列に置換
public static int[] StringToIntArray(String[] str){
int N = str.length;
int[] array = new int[N];
for( int i = 0 ; i < N ; i++){
array[i] = Integer.parseInt(str[i]);
}
return array;
}
//標準入力をLong型配列に置換
public static long[] StringToLongArray(String[] str){
int N = str.length;
long[] array = new long[N];
for( int i = 0 ; i < N ; i++){
array[i] = Long.parseLong(str[i]);
}
return array;
}
//隣接リストの作成
public static void graph(Map<Integer, List<Integer>> map, int v, int u){
if( !map.containsKey(v)){
List<Integer> li = new ArrayList<>();
li.add(u);
map.put(v, li);
}else{
List<Integer> li = map.get(v);
li.add(u);
map.put(v, li);
}
}
}
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Arrays;
import java.util.Map;
import java.util.HashMap;
class Main{
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
ArrayList<String> list = new ArrayList<>();
list = lib.inputProcess();
int N = Integer.parseInt(lib.arrayString(list.get(0), " ")[0]);
int M = Integer.parseInt(lib.arrayString(list.get(0), " ")[1]);
boolean[][] a = new boolean[N+1][N+1];
for( int i = 1 ; i <= M ; i++){
int[] t = lib.StringToIntArray(lib.arrayString(list.get(i), " "));
int k = t[0];
for( int j = 1 ; j <= k ; j++){
for( int l = 1 ; l <= k; l++){
a[t[j]][t[l]] = true;
a[t[l]][t[j]] = true;
}
}
}
String ans = "Yes";
r:for( int i = 1 ; i <= N ;i++){
for( int j = 1 ; j <= N ;j++ ){
if( i == j) continue;
if( !a[i][j]){
ans = "No";
break r;
}
}
}
out.println(ans);
out.flush();
}
}
class lib{
boolean[] seen;
public static void outputData(List<String> list){
for( String str: list){
System.out.println(str);
}
}
public static ArrayList<String> inputProcess(){
InputStreamReader input = new InputStreamReader(System.in);
BufferedReader buff = new BufferedReader(input);
ArrayList<String> list = new ArrayList<>();
try {
while( true ){
String str = buff.readLine();
if( str == null) break;
list.add(str);
}
buff.close();
} catch (IOException e) {
System.out.println(e.getMessage());
}
return list;
}
public static int[] changeIntArray(ArrayList<String> list){
final int N = list.size();
int[] array = new int[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Integer.parseInt( list.get(i));
}
return array;
}
public static double[] changeDoubleArray(ArrayList<String> list){
final int N = list.size();
double[] array = new double[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Double.parseDouble( list.get(i));
}
return array;
}
//標準入力をString型に置換
public static String createString(ArrayList<String> list){
final int N = list.size();
StringBuilder stb = new StringBuilder();
for( int i = 0 ; i < N ; i++ ){
stb.append( list.get(i));
}
return stb.toString();
}
public static String[] arrayString(String str, String s){
String[] array = str.split(s);
return array;
}
//標準入力をint型配列に置換
public static int[] StringToIntArray(String[] str){
int N = str.length;
int[] array = new int[N];
for( int i = 0 ; i < N ; i++){
array[i] = Integer.parseInt(str[i]);
}
return array;
}
//標準入力をLong型配列に置換
public static long[] StringToLongArray(String[] str){
int N = str.length;
long[] array = new long[N];
for( int i = 0 ; i < N ; i++){
array[i] = Long.parseLong(str[i]);
}
return array;
}
//隣接リストの作成
public static void graph(Map<Integer, List<Integer>> map, int v, int u){
if( !map.containsKey(v)){
List<Integer> li = new ArrayList<>();
li.add(u);
map.put(v, li);
}else{
List<Integer> li = map.get(v);
li.add(u);
map.put(v, li);
}
}
}
| ConDefects/ConDefects/Code/abc272_b/Java/48624717 |
condefects-java_data_1244 |
import java.io.*;
import java.util.*;
public class Main {
static int[][] dp = new int[101][101];
static int inf = Integer.MAX_VALUE / 10;
static int dfs(String[][] arr,int n,int m,int i,int j){
if(j == m){
return 0;
}
if(i == n){
return inf;
}
if(dp[i][j] != -1){
return dp[i][j];
}
//不选
int ans = dfs(arr,n,m,i+1,j);
//选
String[] cur = arr[i];
int len = cur.length;
for (int k = 1; k < len; k++) {
String str = cur[k];
int length = str.length();
if(m - j >= length && check(length,j,str)){
ans = Math.min(ans,dfs(arr,n,m,i,j+length) + 1);
}
}
dp[i][j] = ans;
return ans;
}
static char[] t;
static boolean check(int n,int start,String str){
for (int i = 0,j = start; i < n; i++,j++) {
if(t[j] != str.charAt(i)){
return false;
}
}
return true;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
t = br.readLine().toCharArray();
int n = Integer.parseInt(br.readLine());
String[][] arr = new String[n][];
for (int i = 0; i < n; i++) {
arr[i] = br.readLine().split(" ");
}
int m = t.length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
dp[i][j] = -1;
}
}
int ans = dfs(arr,n,m,0,0);
if(ans > m){
pw.println(-1);
}else{
pw.println(ans);
}
pw.flush();
pw.close();
}
}
import java.io.*;
import java.util.*;
public class Main {
static int[][] dp = new int[101][101];
static int inf = Integer.MAX_VALUE / 10;
static int dfs(String[][] arr,int n,int m,int i,int j){
if(j == m){
return 0;
}
if(i == n){
return inf;
}
if(dp[i][j] != -1){
return dp[i][j];
}
//不选
int ans = dfs(arr,n,m,i+1,j);
//选
String[] cur = arr[i];
int len = cur.length;
for (int k = 1; k < len; k++) {
String str = cur[k];
int length = str.length();
if(m - j >= length && check(length,j,str)){
ans = Math.min(ans,dfs(arr,n,m,i+1,j+length) + 1);
}
}
dp[i][j] = ans;
return ans;
}
static char[] t;
static boolean check(int n,int start,String str){
for (int i = 0,j = start; i < n; i++,j++) {
if(t[j] != str.charAt(i)){
return false;
}
}
return true;
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
t = br.readLine().toCharArray();
int n = Integer.parseInt(br.readLine());
String[][] arr = new String[n][];
for (int i = 0; i < n; i++) {
arr[i] = br.readLine().split(" ");
}
int m = t.length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
dp[i][j] = -1;
}
}
int ans = dfs(arr,n,m,0,0);
if(ans > m){
pw.println(-1);
}else{
pw.println(ans);
}
pw.flush();
pw.close();
}
}
| ConDefects/ConDefects/Code/abc344_d/Java/51206023 |
condefects-java_data_1245 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({"unused"})
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final String T = getNext();
final int Tlen = T.length();
final int N = getNextInt();
final String[][] S = new String[N][];
for(int row = 0; row < N; row++) {
final int A = getNextInt();
S[row] = new String[A];
for(int col = 0; col < A; col++) {
S[row][col] = getNext();
}
}
final int[][] dp = Stream.generate(
() -> IntStream.generate(() -> Integer.MAX_VALUE).limit(Tlen + 1).toArray()
).limit(N).toArray(int[][]::new);
dp[0][0] = 0;
for(int col = 0; col < S[0].length; col++) {
if(T.startsWith(S[0][col])) {
dp[0][S[0][col].length()] = 1;
}
}
for(int row = 1; row < N; row++) {
for(int tPos = 0; tPos < Tlen; tPos++) {
if(dp[row - 1][tPos] < Integer.MAX_VALUE) {
dp[row][tPos] = Math.min(dp[row][tPos], dp[row - 1][tPos]);
for(int col = 0; col < S[row].length; col++) {
if(T.substring(tPos).startsWith(S[row][col])) {
dp[row][tPos + S[row][col].length()] = Math.min(dp[row][tPos + S[row][col].length()], dp[row - 1][tPos] + 1);
}
}
}
}
dp[row - 1][Tlen] = Math.min(dp[row][Tlen], dp[row - 1][Tlen]);
}
println(dp[N - 1][Tlen] < Integer.MAX_VALUE ? dp[N - 1][Tlen] : -1);
flush();
}
// 以下Utility
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static int[] concat(int[]... arys) {
return Arrays.stream(arys).flatMapToInt(ary -> Arrays.stream(ary)).toArray();
// IntStream st = Arrays.stream(arys[0]);
// for(int idx = 1; idx < arys.length; idx++) {
// st = IntStream.concat(st, Arrays.stream(arys[idx]));
// }
// return st.toArray();
}
@SafeVarargs
private static <E> List<E> concat(List<E>... lists) {
return Arrays.stream(lists).flatMap(list -> list.stream()).toList();
// Stream<E> st = lists[0].stream();
// for(int idx = 1; idx < lists.length; idx++) {
// st = Stream.concat(st, lists[idx].stream());
// }
// return st.collect(Collectors.toList());
}
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if(readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for(int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for(int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for(int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for(int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for(Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({"unused"})
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final String T = getNext();
final int Tlen = T.length();
final int N = getNextInt();
final String[][] S = new String[N][];
for(int row = 0; row < N; row++) {
final int A = getNextInt();
S[row] = new String[A];
for(int col = 0; col < A; col++) {
S[row][col] = getNext();
}
}
final int[][] dp = Stream.generate(
() -> IntStream.generate(() -> Integer.MAX_VALUE).limit(Tlen + 1).toArray()
).limit(N).toArray(int[][]::new);
dp[0][0] = 0;
for(int col = 0; col < S[0].length; col++) {
if(T.startsWith(S[0][col])) {
dp[0][S[0][col].length()] = 1;
}
}
for(int row = 1; row < N; row++) {
for(int tPos = 0; tPos < Tlen; tPos++) {
if(dp[row - 1][tPos] < Integer.MAX_VALUE) {
dp[row][tPos] = Math.min(dp[row][tPos], dp[row - 1][tPos]);
for(int col = 0; col < S[row].length; col++) {
if(T.substring(tPos).startsWith(S[row][col])) {
dp[row][tPos + S[row][col].length()] = Math.min(dp[row][tPos + S[row][col].length()], dp[row - 1][tPos] + 1);
}
}
}
}
dp[row][Tlen] = Math.min(dp[row][Tlen], dp[row - 1][Tlen]);
}
println(dp[N - 1][Tlen] < Integer.MAX_VALUE ? dp[N - 1][Tlen] : -1);
flush();
}
// 以下Utility
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static int[] concat(int[]... arys) {
return Arrays.stream(arys).flatMapToInt(ary -> Arrays.stream(ary)).toArray();
// IntStream st = Arrays.stream(arys[0]);
// for(int idx = 1; idx < arys.length; idx++) {
// st = IntStream.concat(st, Arrays.stream(arys[idx]));
// }
// return st.toArray();
}
@SafeVarargs
private static <E> List<E> concat(List<E>... lists) {
return Arrays.stream(lists).flatMap(list -> list.stream()).toList();
// Stream<E> st = lists[0].stream();
// for(int idx = 1; idx < lists.length; idx++) {
// st = Stream.concat(st, lists[idx].stream());
// }
// return st.collect(Collectors.toList());
}
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if(readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for(int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for(int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for(int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for(int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for(Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
| ConDefects/ConDefects/Code/abc344_d/Java/52675533 |
condefects-java_data_1246 | import java.util.*;
import java.io.*;
public class Main {
static int[][] dp = new int[101][101];
public static void main(String[] args) {
String s = sc.next();
int len = s.length();
for (int i = 0; i <= 100; i++) {
Arrays.fill(dp[i],Integer.MAX_VALUE);
}
int n = sc.nextInt();
dp[0][0] = 0;
for (int i=1;i<=n;i++) {
int t = sc.nextInt();
//遍历物品
while (t-->0) {
String th = sc.next();
for (int j = 0; j <= len-th.length(); j++) {
dp[i][j] = Math.min(dp[i-1][j],dp[i][j]);
if (dp[i-1][j]==Integer.MAX_VALUE) continue;
if (s.startsWith(th, j))
dp[i][j+th.length()] = Math.min(dp[i-1][j]+1,dp[i][j+th.length()]);
}
}
}
System.out.println(dp[n][s.length()]==Integer.MAX_VALUE?-1:dp[n][s.length()]);
}
static class FastReader {
StringTokenizer st;
BufferedReader br;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
static FastReader sc = new FastReader();
}
import java.util.*;
import java.io.*;
public class Main {
static int[][] dp = new int[101][101];
public static void main(String[] args) {
String s = sc.next();
int len = s.length();
for (int i = 0; i <= 100; i++) {
Arrays.fill(dp[i],Integer.MAX_VALUE);
}
int n = sc.nextInt();
dp[0][0] = 0;
for (int i=1;i<=n;i++) {
int t = sc.nextInt();
//遍历物品
while (t-->0) {
String th = sc.next();
for (int j = 0; j <= len; j++) {
dp[i][j] = Math.min(dp[i-1][j],dp[i][j]);
if (dp[i-1][j]==Integer.MAX_VALUE) continue;
if (s.startsWith(th, j))
dp[i][j+th.length()] = Math.min(dp[i-1][j]+1,dp[i][j+th.length()]);
}
}
}
System.out.println(dp[n][s.length()]==Integer.MAX_VALUE?-1:dp[n][s.length()]);
}
static class FastReader {
StringTokenizer st;
BufferedReader br;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
static FastReader sc = new FastReader();
}
| ConDefects/ConDefects/Code/abc344_d/Java/51493596 |
condefects-java_data_1247 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String strT = sc.next();
int n = sc.nextInt();
String[][] strArray = new String[100][10];
for(int i = 0; i < n; i++) {
int m = sc.nextInt();
for(int j = 0; j < m; j++) {
strArray[i][j] = sc.next();
}
for(int j = m; j < 10; j++) {
strArray[i][j] = "";
}
}
int dp[][] = new int[n + 1][strT.length() + 1];
int INF = 1_000_000_000;
for(int i = 0; i <= n; i++) {
Arrays.fill(dp[i], INF);
}
dp[0][0] = 0;
for(int i = 1; i <= n; i++) {
for(int j = 0; j < strT.length(); j++) {
dp[i][j] = dp[i - 1][j];
}
for(int j = 0; j < strT.length(); j++) {
for(int k = 0; k < 10; k++) {
if(strArray[i - 1][k].equals("")) {
break;
}
int tmpLen = j + strArray[i - 1][k].length();
if(tmpLen > strT.length()) {
continue;
}
// System.out.println(strT.substring(j, tmpLen) + " " + strArray[i - 1][k]);
if(strT.substring(j, tmpLen).equals(strArray[i - 1][k])) {
// System.out.println("update i = " + i + " j = " + j + " k = " + k + " tmpLen " + tmpLen + " substr " + strT.substring(j, tmpLen));
dp[i][tmpLen] = Math.min(Math.min(dp[i - 1][tmpLen], dp[i - 1][j] + 1), dp[i][tmpLen]);
// System.out.println("A " + dp[i - 1][tmpLen] + " B " + dp[i - 1][j] + " result " + dp[i][tmpLen]);
}
}
}
}
// for(int i = 0; i <= n; i++) {
// for(int j = 0; j <= strT.length(); j++) {
// System.out.print(dp[i][j] + " ");
// }
// System.out.println();
// }
System.out.println(dp[n][strT.length()] < INF ? dp[n][strT.length()] : -1);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
String strT = sc.next();
int n = sc.nextInt();
String[][] strArray = new String[100][10];
for(int i = 0; i < n; i++) {
int m = sc.nextInt();
for(int j = 0; j < m; j++) {
strArray[i][j] = sc.next();
}
for(int j = m; j < 10; j++) {
strArray[i][j] = "";
}
}
int dp[][] = new int[n + 1][strT.length() + 1];
int INF = 1_000_000_000;
for(int i = 0; i <= n; i++) {
Arrays.fill(dp[i], INF);
}
dp[0][0] = 0;
for(int i = 1; i <= n; i++) {
for(int j = 0; j <= strT.length(); j++) {
dp[i][j] = dp[i - 1][j];
}
for(int j = 0; j < strT.length(); j++) {
for(int k = 0; k < 10; k++) {
if(strArray[i - 1][k].equals("")) {
break;
}
int tmpLen = j + strArray[i - 1][k].length();
if(tmpLen > strT.length()) {
continue;
}
// System.out.println(strT.substring(j, tmpLen) + " " + strArray[i - 1][k]);
if(strT.substring(j, tmpLen).equals(strArray[i - 1][k])) {
// System.out.println("update i = " + i + " j = " + j + " k = " + k + " tmpLen " + tmpLen + " substr " + strT.substring(j, tmpLen));
dp[i][tmpLen] = Math.min(Math.min(dp[i - 1][tmpLen], dp[i - 1][j] + 1), dp[i][tmpLen]);
// System.out.println("A " + dp[i - 1][tmpLen] + " B " + dp[i - 1][j] + " result " + dp[i][tmpLen]);
}
}
}
}
// for(int i = 0; i <= n; i++) {
// for(int j = 0; j <= strT.length(); j++) {
// System.out.print(dp[i][j] + " ");
// }
// System.out.println();
// }
System.out.println(dp[n][strT.length()] < INF ? dp[n][strT.length()] : -1);
}
} | ConDefects/ConDefects/Code/abc344_d/Java/51482781 |
condefects-java_data_1248 |
import java.io.*;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.Vector;
//implements Runnable
public class Main{
static long md=(long)20020219;
static long Linf=Long.MAX_VALUE/2;
static int inf=Integer.MAX_VALUE/2;
static int M=10000;
static int N=300;
static int n=0;
static int m=0;
static int k=0;
public static void main(String[] args) throws Exception{
AReader input=new AReader();
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
String string=input.next();
HashMap<String, Integer> hs=new HashMap<String, Integer>();
for(int i=0;i<string.length();++i) {
String now=string.substring(0,i+1);
hs.put(now, inf);
}hs.put("", 0);
n=input.nextInt();
for(int i=1;i<=n;++i) {
int x=input.nextInt();
HashMap<String, Integer> may=new HashMap<String, Integer>();
for(int j=1;j<=x;++j) {
String string2=input.next();
for(String y:hs.keySet()) {
String now=y+string2;
if(hs.get(now)==null)continue;
int z=hs.get(y);
if(may.get(now)==null) {
may.put(now, z+1);
}else {
int t=may.get(now);
if(t>z+1)
may.put(now, z+1);
}
}
}
for(String now:may.keySet()) {
int y=may.get(now);
int z=hs.get(now);
if(y<z)hs.put(now, y);
}
}
if(hs.get(string)==null) {
out.print("-1");
}else out.print(hs.get(string));
out.flush();
out.close();
}
// public static final void main(String[] args) throws Exception {
// new Thread(null, new Main(), "线程名字", 1 << 27).start();
// }
// @Override
// public void run() {
// try {
// //原本main函数的内容
// solve();
//
// } catch (Exception e) {
// }
// }
// static
// class Node{
// int x;
// int y;
// public Node(int u,int v) {
// x=u;
// y=v;
// }
// @Override
// public boolean equals(Object o) {
// if (this == o) return true;
// if (o == null || getClass() != o.getClass()) return false;
// Node may = (Node) o;
// return x == may.x && y==may.y;
// }
//
// @Override
// public int hashCode() {
// return Objects.hash(x, y);
// }
// }
static
class AReader{
BufferedReader bf;
StringTokenizer st;
BufferedWriter bw;
public AReader(){
bf=new BufferedReader(new InputStreamReader(System.in));
st=new StringTokenizer("");
bw=new BufferedWriter(new OutputStreamWriter(System.out));
}
public String nextLine() throws IOException{
return bf.readLine();
}
public String next() throws IOException{
while(!st.hasMoreTokens()){
st=new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public char nextChar() throws IOException{
//确定下一个token只有一个字符的时候再用
return next().charAt(0);
}
public int nextInt() throws IOException{
return Integer.parseInt(next());
}
public long nextLong() throws IOException{
return Long.parseLong(next());
}
public double nextDouble() throws IOException{
return Double.parseDouble(next());
}
public float nextFloat() throws IOException{
return Float.parseFloat(next());
}
public byte nextByte() throws IOException{
return Byte.parseByte(next());
}
public short nextShort() throws IOException{
return Short.parseShort(next());
}
public BigInteger nextBigInteger() throws IOException{
return new BigInteger(next());
}
public void println() throws IOException {
bw.newLine();
}
public void println(int[] arr) throws IOException{
for (int value : arr) {
bw.write(value + " ");
}
println();
}
public void println(int l, int r, int[] arr) throws IOException{
for (int i = l; i <= r; i ++) {
bw.write(arr[i] + " ");
}
println();
}
public void println(int a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(int a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(String a) throws IOException{
bw.write(a);
bw.newLine();
}
public void print(String a) throws IOException{
bw.write(a);
}
public void println(long a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(long a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(double a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(double a) throws IOException{
bw.write(String.valueOf(a));
}
public void print(char a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(char a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.Vector;
//implements Runnable
public class Main{
static long md=(long)20020219;
static long Linf=Long.MAX_VALUE/2;
static int inf=Integer.MAX_VALUE/2;
static int M=10000;
static int N=300;
static int n=0;
static int m=0;
static int k=0;
public static void main(String[] args) throws Exception{
AReader input=new AReader();
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
String string=input.next();
HashMap<String, Integer> hs=new HashMap<String, Integer>();
for(int i=0;i<string.length();++i) {
String now=string.substring(0,i+1);
hs.put(now, inf);
}hs.put("", 0);
n=input.nextInt();
for(int i=1;i<=n;++i) {
int x=input.nextInt();
HashMap<String, Integer> may=new HashMap<String, Integer>();
for(int j=1;j<=x;++j) {
String string2=input.next();
for(String y:hs.keySet()) {
String now=y+string2;
if(hs.get(now)==null)continue;
int z=hs.get(y);
if(may.get(now)==null) {
may.put(now, z+1);
}else {
int t=may.get(now);
if(t>z+1)
may.put(now, z+1);
}
}
}
for(String now:may.keySet()) {
int y=may.get(now);
int z=hs.get(now);
if(y<z)hs.put(now, y);
}
}
if(hs.get(string)==inf) {
out.print("-1");
}else out.print(hs.get(string));
out.flush();
out.close();
}
// public static final void main(String[] args) throws Exception {
// new Thread(null, new Main(), "线程名字", 1 << 27).start();
// }
// @Override
// public void run() {
// try {
// //原本main函数的内容
// solve();
//
// } catch (Exception e) {
// }
// }
// static
// class Node{
// int x;
// int y;
// public Node(int u,int v) {
// x=u;
// y=v;
// }
// @Override
// public boolean equals(Object o) {
// if (this == o) return true;
// if (o == null || getClass() != o.getClass()) return false;
// Node may = (Node) o;
// return x == may.x && y==may.y;
// }
//
// @Override
// public int hashCode() {
// return Objects.hash(x, y);
// }
// }
static
class AReader{
BufferedReader bf;
StringTokenizer st;
BufferedWriter bw;
public AReader(){
bf=new BufferedReader(new InputStreamReader(System.in));
st=new StringTokenizer("");
bw=new BufferedWriter(new OutputStreamWriter(System.out));
}
public String nextLine() throws IOException{
return bf.readLine();
}
public String next() throws IOException{
while(!st.hasMoreTokens()){
st=new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public char nextChar() throws IOException{
//确定下一个token只有一个字符的时候再用
return next().charAt(0);
}
public int nextInt() throws IOException{
return Integer.parseInt(next());
}
public long nextLong() throws IOException{
return Long.parseLong(next());
}
public double nextDouble() throws IOException{
return Double.parseDouble(next());
}
public float nextFloat() throws IOException{
return Float.parseFloat(next());
}
public byte nextByte() throws IOException{
return Byte.parseByte(next());
}
public short nextShort() throws IOException{
return Short.parseShort(next());
}
public BigInteger nextBigInteger() throws IOException{
return new BigInteger(next());
}
public void println() throws IOException {
bw.newLine();
}
public void println(int[] arr) throws IOException{
for (int value : arr) {
bw.write(value + " ");
}
println();
}
public void println(int l, int r, int[] arr) throws IOException{
for (int i = l; i <= r; i ++) {
bw.write(arr[i] + " ");
}
println();
}
public void println(int a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(int a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(String a) throws IOException{
bw.write(a);
bw.newLine();
}
public void print(String a) throws IOException{
bw.write(a);
}
public void println(long a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(long a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(double a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
public void print(double a) throws IOException{
bw.write(String.valueOf(a));
}
public void print(char a) throws IOException{
bw.write(String.valueOf(a));
}
public void println(char a) throws IOException{
bw.write(String.valueOf(a));
bw.newLine();
}
}
}
| ConDefects/ConDefects/Code/abc344_d/Java/51122085 |
condefects-java_data_1249 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({ "unused" })
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final IO io = new IO();
final String T = io.getNext();
final int TLen = T.length();
final int[][] dp = new int[2][TLen + 1];
Arrays.fill(dp[1], Integer.MAX_VALUE);
dp[1][0] = 1;
final int N = io.getNextInt();
for(int bag = 0; bag < N; bag++) {
Arrays.fill(dp[bag % 2], Integer.MAX_VALUE);
final int A = io.getNextInt();
for(int sIdx = 0; sIdx < A; sIdx++) {
final String S = io.getNext();
for(int tPos = 0; tPos < TLen; tPos++) {
if(dp[(bag + 1) % 2][tPos] < Integer.MAX_VALUE) {
dp[bag % 2][tPos] = Math.min(dp[(bag + 1) % 2][tPos], dp[bag % 2][tPos]);
if(tPos + S.length() <= TLen && T.substring(tPos).startsWith(S)) {
dp[bag % 2][tPos + S.length()] = Math.min(dp[bag % 2][tPos + S.length()], dp[(bag + 1) % 2][tPos] + 1);
}
}
}
}
}
io.println(dp[(N - 1) % 2][TLen] < Integer.MAX_VALUE ? dp[(N - 1) % 2][TLen] - 1 : -1);
io.flush();
}
private static final class IO {
private final BufferedReader reader;
private final PrintWriter writer;
private String[] readBuffer;
private int readBufferCursor;
private IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(System.out);
readBuffer = new String[] {};
readBufferCursor = 0;
// try {
// reader = new BufferedReader(new InputStreamReader(new
// FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
}
private String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private String getNext() {
// return scanner.next();
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for (int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private int getNextInt() {
return Integer.parseInt(getNext());
}
private long getNextLong() {
return Long.parseLong(getNext());
}
private double getNextDouble() {
return Double.parseDouble(getNext());
}
private int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private void print(char[] ary) {
print(String.valueOf(ary));
}
private void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private void print(Object obj) {
writer.print(obj);
}
private void println(int... ary) {
print(ary);
println();
}
private void println(int[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(long... ary) {
print(ary);
println();
}
private void println(long[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(char[] ary) {
print(ary);
println();
}
private void println(char[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(Collection<?> list) {
print(list);
println();
}
private void println(Object obj) {
print(obj);
println();
}
private void println() {
writer.println();
}
private void printf(String format, Object... args) {
print(String.format(format, args));
}
private void flush() {
writer.flush();
}
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({ "unused" })
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final IO io = new IO();
final String T = io.getNext();
final int TLen = T.length();
final int[][] dp = new int[2][TLen + 1];
Arrays.fill(dp[1], Integer.MAX_VALUE);
dp[1][0] = 1;
final int N = io.getNextInt();
for(int bag = 0; bag < N; bag++) {
Arrays.fill(dp[bag % 2], Integer.MAX_VALUE);
final int A = io.getNextInt();
for(int sIdx = 0; sIdx < A; sIdx++) {
final String S = io.getNext();
for(int tPos = 0; tPos <= TLen; tPos++) {
if(dp[(bag + 1) % 2][tPos] < Integer.MAX_VALUE) {
dp[bag % 2][tPos] = Math.min(dp[(bag + 1) % 2][tPos], dp[bag % 2][tPos]);
if(tPos + S.length() <= TLen && T.substring(tPos).startsWith(S)) {
dp[bag % 2][tPos + S.length()] = Math.min(dp[bag % 2][tPos + S.length()], dp[(bag + 1) % 2][tPos] + 1);
}
}
}
}
}
io.println(dp[(N - 1) % 2][TLen] < Integer.MAX_VALUE ? dp[(N - 1) % 2][TLen] - 1 : -1);
io.flush();
}
private static final class IO {
private final BufferedReader reader;
private final PrintWriter writer;
private String[] readBuffer;
private int readBufferCursor;
private IO() {
reader = new BufferedReader(new InputStreamReader(System.in));
writer = new PrintWriter(System.out);
readBuffer = new String[] {};
readBufferCursor = 0;
// try {
// reader = new BufferedReader(new InputStreamReader(new
// FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
}
private String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private String getNext() {
// return scanner.next();
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for (int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private int getNextInt() {
return Integer.parseInt(getNext());
}
private long getNextLong() {
return Long.parseLong(getNext());
}
private double getNextDouble() {
return Double.parseDouble(getNext());
}
private int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private void print(char[] ary) {
print(String.valueOf(ary));
}
private void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private void print(Object obj) {
writer.print(obj);
}
private void println(int... ary) {
print(ary);
println();
}
private void println(int[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(long... ary) {
print(ary);
println();
}
private void println(long[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(char[] ary) {
print(ary);
println();
}
private void println(char[][] arys) {
Arrays.stream(arys).forEach(ary -> println(ary));
}
private void println(Collection<?> list) {
print(list);
println();
}
private void println(Object obj) {
print(obj);
println();
}
private void println() {
writer.println();
}
private void printf(String format, Object... args) {
print(String.format(format, args));
}
private void flush() {
writer.flush();
}
}
}
| ConDefects/ConDefects/Code/abc344_d/Java/54004366 |
condefects-java_data_1250 | import java.io.*;
import java.util.Arrays;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static StreamTokenizer stmInput = new StreamTokenizer(br);
static String str;
static int N = 110;
static int f[][] = new int[N][N];
static int n, m, INF = 0x3f3f3f3f;
public static String readString() throws IOException{
stmInput.nextToken();
return stmInput.sval;
}
public static int readInt() throws IOException {
stmInput.nextToken();
return (int) stmInput.nval;
}
public static void solve() throws IOException {
str = readString();
n = readInt();
m = str.length();
for (int i = 0; i < N; i++) Arrays.fill(f[i], INF);
f[0][0] = 0;
for (int i = 1; i <= n; i++) {
int cnt = readInt();
while (cnt-- != 0) {
String s = readString();
for (int j = 1; j <= m; j++) {
f[i][j] = Math.min(f[i][j], f[i - 1][j]);
if (s.equals(str.substring(Math.max(0, j - s.length()), j))) {
f[i][j] = Math.min(f[i][j], f[i - 1][j - s.length()] + 1);
}
}
}
}
pw.println(f[n][m] == INF ? -1 : f[n][m]);
}
public static void main(String[] args) throws IOException {
// 按照ascii码范围设置为普通字符
stmInput.ordinaryChars('a', 'z');
stmInput.wordChars('a', 'z');
int T = 1;
while(T-- != 0){
solve();
}
pw.flush();
pw.close();
br.close();
}
}
import java.io.*;
import java.util.Arrays;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static StreamTokenizer stmInput = new StreamTokenizer(br);
static String str;
static int N = 110;
static int f[][] = new int[N][N];
static int n, m, INF = 0x3f3f3f3f;
public static String readString() throws IOException{
stmInput.nextToken();
return stmInput.sval;
}
public static int readInt() throws IOException {
stmInput.nextToken();
return (int) stmInput.nval;
}
public static void solve() throws IOException {
str = readString();
n = readInt();
m = str.length();
for (int i = 0; i < N; i++) Arrays.fill(f[i], INF);
f[0][0] = 0;
for (int i = 1; i <= n; i++) {
int cnt = readInt();
while (cnt-- != 0) {
String s = readString();
for (int j = 0; j <= m; j++) {
f[i][j] = Math.min(f[i][j], f[i - 1][j]);
if (s.equals(str.substring(Math.max(0, j - s.length()), j))) {
f[i][j] = Math.min(f[i][j], f[i - 1][j - s.length()] + 1);
}
}
}
}
pw.println(f[n][m] == INF ? -1 : f[n][m]);
}
public static void main(String[] args) throws IOException {
// 按照ascii码范围设置为普通字符
stmInput.ordinaryChars('a', 'z');
stmInput.wordChars('a', 'z');
int T = 1;
while(T-- != 0){
solve();
}
pw.flush();
pw.close();
br.close();
}
}
| ConDefects/ConDefects/Code/abc344_d/Java/51693286 |
condefects-java_data_1251 |
import java.io.*;
import java.util.*;
public class Main {
static IOHandler sc = new IOHandler();
static List<Integer> [] graph;
public static void main(String[] args) {
// TODO Auto-generated method stub
int r = sc.nextInt();
int c = sc.nextInt();
int [][] arr = new int [r][c];
for (int i = 0; i < r; ++i) {
for (int j = 0; j < c; ++j) {
arr[i][j] = sc.nextInt();
}
}
int min, max;
List<int []> list1 = new ArrayList<>();
for (int i = 0; i < r; ++i) {
min = 1_000_001;
max = 0;
for (int num : arr[i]) {
if (num == 0) continue;
min = Math.min(min, num);
max = Math.max(max, num);
}
if (max == 0) continue;
list1.add(new int [] {i, min, max});
}
Collections.sort(list1, (a, b) -> a[1] == b[1] ? a[2] - b[2] : a[1] - b[1]);
int cR;
int [] currentPos = new int [c];
Arrays.fill(currentPos, 0);
int maxV = 0;
List<int []> list2 = new ArrayList<>();
int idx;
List<List<Integer>> groups = new ArrayList<>();
boolean [] wait = new boolean [r*c+2];
int [] groupsLeft = new int [c];
graph = new List[c];
for (int i = 0; i < c; ++i) {
graph[i] = new ArrayList<>();
}
int cG = 0;
int s,e;
for (int [] tArr : list1 ) {
cR = tArr[0];
if (tArr[1] < maxV) {
System.out.println("No");
return;
}else if (tArr[1] == tArr[2]) {
continue;
}
maxV = tArr[1];
list2 = new ArrayList<>();
for (int j = 0; j < c; ++j) {
if (arr[cR][j] == 0)
continue;
list2.add(new int [] {j,arr[cR][j]} );
}
Collections.sort(list2, (a, b) -> a[1] - b[1]);
idx = 0;
int maxB = -1;
int val;
s = cG;
for (int j = 0; j < list2.size(); ++j) {
if (j > 0 && list2.get(j)[1] != list2.get(j - 1)[1] ) {
cG++;
}
if (groups.size() == cG)
groups.add(new ArrayList<>());
groups.get(cG).add(list2.get(j)[0]);
graph[list2.get(j)[0]].add(cG);
groupsLeft[list2.get(j)[0]]++;
}
for (int j = s + 1; j <= cG; ++j) {
wait[j] = true;
}
e = cG++;
}
int [] groupsCount = new int [cG];
for (int i = 0; i < groupsCount.length; ++i) {
groupsCount[i] = groups.get(i) == null ? 0 : groups.get(i).size();
}
Queue<Integer> groupsQueue = new LinkedList<>();
Queue<Integer> numQueue = new LinkedList<>();
for (int i = 0; i < c; ++i) {
if (groupsLeft[i] == 0) {
numQueue.add(i);
}
}
for (int i = 0; i < cG; ++i) {
if (!wait[i]) {
groupsQueue.add(i);
}
}
int curG, curE;
int count = 0;
/*
System.out.println(groups.get(0));
System.out.println(groups.get(1));
System.out.println(Arrays.toString(wait));
System.out.println(numQueue);
System.out.println(groupsQueue);
*/
while (!numQueue.isEmpty() || !groupsQueue.isEmpty()) {
while (!groupsQueue.isEmpty()) {
curG = groupsQueue.remove();
for (int num : groups.get(curG) ) {
--groupsLeft[num];
if (groupsLeft[num] == 0) {
numQueue.add(num);
}
}
}
while (!numQueue.isEmpty()) {
curE = numQueue.remove();
++count;
for (int num : graph[curE]) {
groupsCount[num]--;
if (groupsCount[num] == 0) {
if (wait[num + 1]) {
groupsQueue.add(num + 1);
}
}
}
}
}
System.out.println(count == c ? "Yes" : "No");
}
private static class IOHandler {
BufferedReader br;
StringTokenizer st;
public IOHandler() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int [] readArray(int n) {
int [] res = new int [n];
for (int i = 0; i < n; ++i)
res[i] = nextInt();
return res;
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.io.*;
import java.util.*;
public class Main {
static IOHandler sc = new IOHandler();
static List<Integer> [] graph;
public static void main(String[] args) {
// TODO Auto-generated method stub
int r = sc.nextInt();
int c = sc.nextInt();
int [][] arr = new int [r][c];
for (int i = 0; i < r; ++i) {
for (int j = 0; j < c; ++j) {
arr[i][j] = sc.nextInt();
}
}
int min, max;
List<int []> list1 = new ArrayList<>();
for (int i = 0; i < r; ++i) {
min = 1_000_001;
max = 0;
for (int num : arr[i]) {
if (num == 0) continue;
min = Math.min(min, num);
max = Math.max(max, num);
}
if (max == 0) continue;
list1.add(new int [] {i, min, max});
}
Collections.sort(list1, (a, b) -> a[1] == b[1] ? a[2] - b[2] : a[1] - b[1]);
int cR;
int [] currentPos = new int [c];
Arrays.fill(currentPos, 0);
int maxV = 0;
List<int []> list2 = new ArrayList<>();
int idx;
List<List<Integer>> groups = new ArrayList<>();
boolean [] wait = new boolean [r*c+2];
int [] groupsLeft = new int [c];
graph = new List[c];
for (int i = 0; i < c; ++i) {
graph[i] = new ArrayList<>();
}
int cG = 0;
int s,e;
for (int [] tArr : list1 ) {
cR = tArr[0];
if (tArr[1] < maxV) {
System.out.println("No");
return;
}else if (tArr[1] == tArr[2]) {
continue;
}
maxV = tArr[2];
list2 = new ArrayList<>();
for (int j = 0; j < c; ++j) {
if (arr[cR][j] == 0)
continue;
list2.add(new int [] {j,arr[cR][j]} );
}
Collections.sort(list2, (a, b) -> a[1] - b[1]);
idx = 0;
int maxB = -1;
int val;
s = cG;
for (int j = 0; j < list2.size(); ++j) {
if (j > 0 && list2.get(j)[1] != list2.get(j - 1)[1] ) {
cG++;
}
if (groups.size() == cG)
groups.add(new ArrayList<>());
groups.get(cG).add(list2.get(j)[0]);
graph[list2.get(j)[0]].add(cG);
groupsLeft[list2.get(j)[0]]++;
}
for (int j = s + 1; j <= cG; ++j) {
wait[j] = true;
}
e = cG++;
}
int [] groupsCount = new int [cG];
for (int i = 0; i < groupsCount.length; ++i) {
groupsCount[i] = groups.get(i) == null ? 0 : groups.get(i).size();
}
Queue<Integer> groupsQueue = new LinkedList<>();
Queue<Integer> numQueue = new LinkedList<>();
for (int i = 0; i < c; ++i) {
if (groupsLeft[i] == 0) {
numQueue.add(i);
}
}
for (int i = 0; i < cG; ++i) {
if (!wait[i]) {
groupsQueue.add(i);
}
}
int curG, curE;
int count = 0;
/*
System.out.println(groups.get(0));
System.out.println(groups.get(1));
System.out.println(Arrays.toString(wait));
System.out.println(numQueue);
System.out.println(groupsQueue);
*/
while (!numQueue.isEmpty() || !groupsQueue.isEmpty()) {
while (!groupsQueue.isEmpty()) {
curG = groupsQueue.remove();
for (int num : groups.get(curG) ) {
--groupsLeft[num];
if (groupsLeft[num] == 0) {
numQueue.add(num);
}
}
}
while (!numQueue.isEmpty()) {
curE = numQueue.remove();
++count;
for (int num : graph[curE]) {
groupsCount[num]--;
if (groupsCount[num] == 0) {
if (wait[num + 1]) {
groupsQueue.add(num + 1);
}
}
}
}
}
System.out.println(count == c ? "Yes" : "No");
}
private static class IOHandler {
BufferedReader br;
StringTokenizer st;
public IOHandler() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int [] readArray(int n) {
int [] res = new int [n];
for (int i = 0; i < n; ++i)
res[i] = nextInt();
return res;
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
| ConDefects/ConDefects/Code/abc277_f/Java/36497189 |
condefects-java_data_1252 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final int[] array_p = new int[2 * n];
final StringTokenizer st_p = new StringTokenizer(br.readLine());
for(int i = 0; i < 2 * n; i++) {
array_p[i] = Integer.parseInt(st_p.nextToken());
}
br.close();
List<Integer> ans = new ArrayList<>();
for(int i = 1; i < n - 1; i++) {
int a = (i * 2) - 1, b = i * 2;
if(array_p[a] < array_p[b]) {
int tmp = array_p[a];
array_p[a] = array_p[b];
array_p[b] = tmp;
ans.add(b);
}
}
for(int i = 0; i < n; i++) {
int a = i * 2, b = (i * 2) + 1;
if(array_p[a] > array_p[b]) {
int tmp = array_p[a];
array_p[a] = array_p[b];
array_p[b] = tmp;
ans.add(b);
}
}
PrintWriter pw = new PrintWriter(System.out);
pw.println(ans.size());
if(ans.size() > 0) {
StringBuilder sb = new StringBuilder();
for(int a : ans) {
sb.append(a).append(' ');
}
pw.println(sb.deleteCharAt(sb.length() - 1));
}
pw.close();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final int[] array_p = new int[2 * n];
final StringTokenizer st_p = new StringTokenizer(br.readLine());
for(int i = 0; i < 2 * n; i++) {
array_p[i] = Integer.parseInt(st_p.nextToken());
}
br.close();
List<Integer> ans = new ArrayList<>();
for(int i = 1; i < n; i++) {
int a = (i * 2) - 1, b = i * 2;
if(array_p[a] < array_p[b]) {
int tmp = array_p[a];
array_p[a] = array_p[b];
array_p[b] = tmp;
ans.add(b);
}
}
for(int i = 0; i < n; i++) {
int a = i * 2, b = (i * 2) + 1;
if(array_p[a] > array_p[b]) {
int tmp = array_p[a];
array_p[a] = array_p[b];
array_p[b] = tmp;
ans.add(b);
}
}
PrintWriter pw = new PrintWriter(System.out);
pw.println(ans.size());
if(ans.size() > 0) {
StringBuilder sb = new StringBuilder();
for(int a : ans) {
sb.append(a).append(' ');
}
pw.println(sb.deleteCharAt(sb.length() - 1));
}
pw.close();
}
}
| ConDefects/ConDefects/Code/agc058_a/Java/34046798 |
condefects-java_data_1253 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int D = sc.nextInt();
String[][] str = new String[N][D];
String[] str2 = new String[D];
for (int i = 0; i < N; i++) {
String s = sc.next();
String str3[] = s.split("");
for (int j = 0; j < D; j++) {
str[i][j] = str3[j];
}
}
for (int i = 0; i < D; i++) {
int count = 0;
for (int j = 0; j < N; j++) {
if (str[j][i].equals("o")){
count++;
}
}
if (count == N) {
str2[i] = "o";
} else {
str2[i] = "x";
}
}
int ans = 0;
for (int i = 0; i < D; i++) {
if (str2[i].equals("o")) {
int ans2 = 1;
if (i < D - 1) {
for (int j = i + 1; j < D - i;j++) {
if (str2[j].equals("o")) {
ans2++;
} else {
break;
}
}
}
ans = Math.max(ans, ans2);
}
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int D = sc.nextInt();
String[][] str = new String[N][D];
String[] str2 = new String[D];
for (int i = 0; i < N; i++) {
String s = sc.next();
String str3[] = s.split("");
for (int j = 0; j < D; j++) {
str[i][j] = str3[j];
}
}
for (int i = 0; i < D; i++) {
int count = 0;
for (int j = 0; j < N; j++) {
if (str[j][i].equals("o")){
count++;
}
}
if (count == N) {
str2[i] = "o";
} else {
str2[i] = "x";
}
}
int ans = 0;
for (int i = 0; i < D; i++) {
if (str2[i].equals("o")) {
int ans2 = 1;
if (i < D - 1) {
for (int j = i + 1; j < D;j++) {
if (str2[j].equals("o")) {
ans2++;
} else {
break;
}
}
}
ans = Math.max(ans, ans2);
}
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc311_b/Java/44580588 |
condefects-java_data_1254 | import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int d = Integer.parseInt(sc.next());
String s[] = new String[n];
for (int i=0;i<n;++i){
s[i] = sc.next();
}
int cnt = 0;
int cntf = 0;
for (int i=0;i<d;++i){
for (int j=0;j<n;++j){
if(s[j].charAt(i) != '○'){
cnt = 0;
break;
}
++cnt;
if (cnt % n == 0 && (cnt / n) > cntf){
cntf = cnt/n;
}
}
}
System.out.println(cntf);
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int d = Integer.parseInt(sc.next());
String s[] = new String[n];
for (int i=0;i<n;++i){
s[i] = sc.next();
}
int cnt = 0;
int cntf = 0;
for (int i=0;i<d;++i){
for (int j=0;j<n;++j){
if(s[j].charAt(i) !='o'){
cnt = 0;
break;
}
++cnt;
if (cnt % n == 0 && (cnt / n) > cntf){
cntf = cnt/n;
}
}
}
System.out.println(cntf);
}
} | ConDefects/ConDefects/Code/abc311_b/Java/44326344 |
condefects-java_data_1255 | import java.util.*;
@SuppressWarnings("unused")
public class Main {
private static void solve() {
int h = ni();
int w = ni();
char[][] a = new char[h][w];
for (int i = 0; i < h; i++) {
a[i] = ns();
}
int y = 0;
int x = 0;
int q = ni();
for (int i = 0; i < q; i++) {
int s = ni() - 1;
int t = ni() - 1;
if (y <= s) {
y = s - y;
} else {
y = h + s - y;
}
if (x <= t) {
x = t - x;
} else {
x = w + t - y;
}
}
char[][] ret = new char[h][w];
if (q % 2 == 0) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
ret[(i + y) % h][(j + x) % w] = a[i][j];
}
}
} else {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
ret[(i + y) % h][(j + x) % w] = a[(h-i) % h][(w-j) % w];
}
}
}
for (var v : ret) {
out.println(v);
}
}
public static void main(String[] args) {
new Thread(null, new Runnable() {
@Override
public void run() {
long start = System.currentTimeMillis();
String debug = args.length > 0 ? args[0] : null;
if (debug != null) {
try {
is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
} catch (Exception e) {
throw new RuntimeException(e);
}
}
reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
solve();
out.flush();
tr((System.currentTimeMillis() - start) + "ms");
}
}, "", 64000000).start();
}
private static java.io.InputStream is = System.in;
private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
private static java.util.StringTokenizer tokenizer = null;
private static java.io.BufferedReader reader;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new java.util.StringTokenizer(reader.readLine());
} catch (Exception e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private static double nd() {
return Double.parseDouble(next());
}
private static long nl() {
return Long.parseLong(next());
}
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 char[] ns() {
return next().toCharArray();
}
private static long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nl();
return a;
}
private static int[][] ntable(int n, int m) {
int[][] table = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[i][j] = ni();
}
}
return table;
}
private static int[][] nlist(int n, int m) {
int[][] table = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[j][i] = ni();
}
}
return table;
}
private static int ni() {
return Integer.parseInt(next());
}
private static void tr(Object... o) {
if (is != System.in)
System.out.println(java.util.Arrays.deepToString(o));
}
}
import java.util.*;
@SuppressWarnings("unused")
public class Main {
private static void solve() {
int h = ni();
int w = ni();
char[][] a = new char[h][w];
for (int i = 0; i < h; i++) {
a[i] = ns();
}
int y = 0;
int x = 0;
int q = ni();
for (int i = 0; i < q; i++) {
int s = ni() - 1;
int t = ni() - 1;
if (y <= s) {
y = s - y;
} else {
y = h + s - y;
}
if (x <= t) {
x = t - x;
} else {
x = w + t - x;
}
}
char[][] ret = new char[h][w];
if (q % 2 == 0) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
ret[(i + y) % h][(j + x) % w] = a[i][j];
}
}
} else {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
ret[(i + y) % h][(j + x) % w] = a[(h-i) % h][(w-j) % w];
}
}
}
for (var v : ret) {
out.println(v);
}
}
public static void main(String[] args) {
new Thread(null, new Runnable() {
@Override
public void run() {
long start = System.currentTimeMillis();
String debug = args.length > 0 ? args[0] : null;
if (debug != null) {
try {
is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
} catch (Exception e) {
throw new RuntimeException(e);
}
}
reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
solve();
out.flush();
tr((System.currentTimeMillis() - start) + "ms");
}
}, "", 64000000).start();
}
private static java.io.InputStream is = System.in;
private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
private static java.util.StringTokenizer tokenizer = null;
private static java.io.BufferedReader reader;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new java.util.StringTokenizer(reader.readLine());
} catch (Exception e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private static double nd() {
return Double.parseDouble(next());
}
private static long nl() {
return Long.parseLong(next());
}
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 char[] ns() {
return next().toCharArray();
}
private static long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nl();
return a;
}
private static int[][] ntable(int n, int m) {
int[][] table = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[i][j] = ni();
}
}
return table;
}
private static int[][] nlist(int n, int m) {
int[][] table = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[j][i] = ni();
}
}
return table;
}
private static int ni() {
return Integer.parseInt(next());
}
private static void tr(Object... o) {
if (is != System.in)
System.out.println(java.util.Arrays.deepToString(o));
}
}
| ConDefects/ConDefects/Code/arc153_b/Java/38011667 |
condefects-java_data_1256 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int h = fReader.nextInt(), w = fReader.nextInt();
char[][] a = new char[h][w];
for(int i=0;i<h;i++) {
String s = fReader.nextString();
for(int j=0;j<w;j++) {
a[i][j] = s.charAt(j);
}
}
int x = 0, y = 0, k = 1;
int q = fReader.nextInt();
for(int i=0;i<q;i++) {
int x0 = fReader.nextInt()-1, y0 = fReader.nextInt()-1;
x = (x0-x+h)%h;
y = (y0-y+w)%w;
k *= -1;
}
char[][] res = new char[h][w];
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
res[(k*x+i+h)%h][(k*y+j+w)%w] = a[i][j];
}
}
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) o.print(res[i][j]);
o.println();
}
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int m){
long ret = 1l;
a %= m;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % m;
}
n >>= 1;
a = a * a % m;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
static class Pair implements Comparable<Pair>{
Long x, y;
public Pair(long x, long y) {
this.x = x;
this.y = y;
}
@Override
public int hashCode() {
int prime = 131, ret = 1;
ret = ret*prime + x.hashCode();
ret = ret*prime + y.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return x.equals(((Pair) obj).x) && y.equals(((Pair) obj).y);
}
return false;
}
@Override
public int compareTo(Pair node) {
int cp1 = Long.compare(x, node.x);
int cp2 = Long.compare(y, node.y);
return cp1 == 0 ? cp2 : cp1;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int h = fReader.nextInt(), w = fReader.nextInt();
char[][] a = new char[h][w];
for(int i=0;i<h;i++) {
String s = fReader.nextString();
for(int j=0;j<w;j++) {
a[i][j] = s.charAt(j);
}
}
int x = 0, y = 0, k = 1;
int q = fReader.nextInt();
for(int i=0;i<q;i++) {
int x0 = fReader.nextInt()-1, y0 = fReader.nextInt()-1;
x = (x0-x+h)%h;
y = (y0-y+w)%w;
k *= -1;
}
char[][] res = new char[h][w];
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) {
res[(k*i+x+h)%h][(k*j+y+w)%w] = a[i][j];
}
}
for(int i=0;i<h;i++) {
for(int j=0;j<w;j++) o.print(res[i][j]);
o.println();
}
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int m){
long ret = 1l;
a %= m;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % m;
}
n >>= 1;
a = a * a % m;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
static class Pair implements Comparable<Pair>{
Long x, y;
public Pair(long x, long y) {
this.x = x;
this.y = y;
}
@Override
public int hashCode() {
int prime = 131, ret = 1;
ret = ret*prime + x.hashCode();
ret = ret*prime + y.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return x.equals(((Pair) obj).x) && y.equals(((Pair) obj).y);
}
return false;
}
@Override
public int compareTo(Pair node) {
int cp1 = Long.compare(x, node.x);
int cp2 = Long.compare(y, node.y);
return cp1 == 0 ? cp2 : cp1;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
} | ConDefects/ConDefects/Code/arc153_b/Java/38097552 |
condefects-java_data_1257 | import java.io.*;
import java.util.*;
class Main{
final static long INF = Long.MAX_VALUE / 2;
final static int MOD = 1_000_000_007;
final static int SIZE = 1_000_000;
long[] fac = new long[SIZE];
long[] inv = new long[SIZE];
long[] finv = new long[SIZE];
FastScanner sc = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
void solve(){
int N = sc.nextInt();
long[] A = new long[N];
for(int i = 0; i < N; i++){
A[i] = sc.nextLong();
}
long[] v = new long[N + 1];
for(int i = 1; i < N + 1; i++){
for(int j = 0; j < (i - 1) / 2; j++){
v[i] += A[j] * 2;
}
if((i - 1) % 2 != 0) v[i] += A[(i - 1) / 2];
}
long[][] dp = new long[N + 1][N + 1];
for(int i = 1; i < N + 1; i++){
for(int c = 1; c < N + 1; c++){
if(c >= i) dp[i][c] = Math.max(dp[i - 1][c - i] + v[i], dp[i - 1][c]);
else dp[i][c] = dp[i - 1][c];
}
}
System.out.println(dp[N][N]);
}
long gcd(long a, long b){ // return aとbの最大公約数
if(b == 0){
return a;
}
return gcd(b, a % b);
}
long lcm(long a, long b){ // return aとbの最小公倍数
return a * b / gcd(a, b);
}
long inv(long a){ // return aの逆元 (mod MOD)
return pow(a, MOD - 2);
}
long pow(long a, long r){ // return a^r (mod MOD)
long sum = 1;
while(r > 0){
if((r & 1) == 1){ // 2進数表記で末尾1の時
sum *= a;
sum %= MOD;
}
a *= a;
a %= MOD;
r >>= 1;
}
return sum;
}
long modFact(long n){ // retur n! (mod MOD)
if(n == 0){
return 1;
}
return n * modFact(n - 1) % MOD;
}
long fact(long n){ // return n!
if(n == 0){
return 1;
}
return n * fact(n - 1);
}
void initCOMB(){
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for(int i = 2; i < SIZE; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long modComb(int n, int r){ // return nCr (先にinitCOMB()必要)
if(n < r || n < 0 || r < 0) return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
long comb(long n, long r){ // return nCr
long num = 1;
for(long i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
boolean isPrime(long a){ // aの素数判定
if(a <= 1) return false;
for(int i = 2; i * i <= a; i++){
if(a % i == 0) return false;
}
return true;
}
int lowerBound(long[] a, long v){ // return 配列a内のv以上の要素の内最低の要素のイテレータ
int r = a.length;
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a[mid] >= v){
r = mid;
}else{
l = mid;
}
}
return r;
}
int lowerBound(List<Long> a, long v){ // return 配列a内のv以上の要素の内最低の要素のイテレータ
int r = a.size();
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a.get(mid) >= v){
r = mid;
}else{
l = mid;
}
}
return r;
}
int upperBound(long[] a, long v){ // return 配列a内のvより大きい要素の内最低の要素のイテレータ
int r = a.length;
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a[mid] > v){
r = mid;
}else{
l = mid;
}
}
return r;
}
String nextPermutation(String s){ // return sの次の順列
ArrayList<Character> list = new ArrayList<>();
for(int i = 0; i < s.length(); i++) list.add(s.charAt(i));
int pivotPos = -1;
char pivot = 0;
for(int i = list.size() - 2; i >= 0; i--){
if(list.get(i) < list.get(i+1)){
pivotPos = i;
pivot = list.get(i);
break;
}
}
if(pivotPos == -1 && pivot == 0) return null;
int L = pivotPos + 1;
int R = list.size() - 1;
int minPos = -1;
char min = Character.MAX_VALUE;
for(int i = R; i >= L; i--){
if(pivot < list.get(i)){
if(list.get(i) < min){
min = list.get(i);
minPos = i;
}
}
}
Collections.swap(list, pivotPos, minPos);
Collections.sort(list.subList(L, R + 1));
StringBuilder sb = new StringBuilder();
for(int i=0; i<list.size(); i++) sb.append(list.get(i));
return sb.toString();
}
boolean nextPermutation(long[] a){
for(int i = a.length - 1; i > 0; i--){
if(a[i - 1] < a[i]){
int swapIndex = find(a[i - 1], a, i, a.length - 1);
long temp = a[swapIndex];
a[swapIndex] = a[i - 1];
a[i - 1] = temp;
Arrays.sort(a, i, a.length);
return true;
}
}
return false;
}
int find(long dest, long[] a, int s, int e){
if(s == e){
return s;
}
int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
void elimination(int[][] a, int[] b) {
int n = a.length;
double f;
for(int k = 0; k < n - 1; k++){
for(int i = k + 1; i < n; i++){
f = - a[i][k] / a[k][k];
for(int j = k + 1; j < n; j++){
a[i][j] += f * a[k][j];
}
b[i] += f * b[k];
}
for(int i = n - 1; i >= 0; i--){
for(int j = i + 1; j < n; j++){
b[i] -= a[i][j] * b[j];
}
b[i] = b[i] / a[i][i];
}
}
}
}
class SegmentTree{
//------------------------------------------------------------
// 2 * n - 1 : 木全体のノード数
// i + n - 1 : 配列のi番目が対応するノードの番号
// 2 * i + 1, 2 * i + 2 : i番目のノードの子ノードの番号
// (i - 1) / 2 : i番目のノードの親ノードの番号
//
// int n = sc.nextInt();
// long[] a = new long[n];
// for(int i = 0; i < n; i++) a[i] = sc.nextLong();
// SegmentTree st = new SegmentTree(a);
// int l = sc.nextInt() - 1;
// int r = sc.nextInt() - 1;
// System.out.println(st.query(l, r));
//------------------------------------------------------------
final static long INF = Long.MAX_VALUE / 2;
// long e = INF; // 単位元
long e = 0;
long func(long a, long b){ // 処理
// return Math.min(a, b);
return a + b;
}
int n; // 配列の要素数を超える最小の2のべき乗
long[] node;
SegmentTree(long[] a){
init(a);
}
void init(long[] a){ // 配列aで初期化
n = 1;
while(n < a.length){
n *= 2;
}
node = new long[2 * n - 1];
Arrays.fill(node, e);
for(int i = 0; i < a.length; i++){
node[i + n - 1] = a[i];
}
for(int i = n - 2; i >= 0; i--){
node[i] = func(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int p, long v){ // 配列のp番目をvに変更し、木全体を更新
p = p + n - 1;
node[p] = v;
while(p > 0){
p = (p - 1) / 2;
node[p] = func(node[2 * p + 1], node[2 * p + 2]);
}
}
long query(int a, int b){ // 区間[a, b)についてクエリを処理
return query(a, b, 0, 0, n);
}
long query(int a, int b, int k, int l, int r){
if(r <= a || b <= l) return e;
if(a <= l && r <= b) return node[k];
return func(query(a, b, 2 * k + 1, l, (l + r) / 2), query(a, b, 2 * k + 2, (l + r) / 2, r));
}
}
class UnionFindTree{
//------------------------------------------------------------
// int n = sc.nextInt();
// int q = sc.nextInt();
// UnionFindTree uft = new UnionFindTree(n);
// List<String> ans = new ArrayList<>();
// for(int i = 0; i < q; i++){
// int p = sc.nextInt(); // 0 : union, 1 : same
// if(p == 0){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// uft.union(a, b);
// }else if(p == 1){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// if(uft.same(a, b)) ans.add("Yes");
// else ans.add("No");
// }
// }
// for(String s : ans){
// System.out.println(s);
// }
//------------------------------------------------------------
int[] parent; // インデックスにとノードを対応させ、そのルートノードのインデックスを格納
int[] rank; // parentと同様に、木の高さを格納
UnionFindTree(int size){
parent = new int[size];
rank = new int[size];
for(int i = 0; i < size; i++){
makeSet(i);
}
}
void makeSet(int i){
parent[i] = i;
rank[i] = 0;
}
void union(int x, int y){
int xRoot = find(x);
int yRoot = find(y);
if(rank[xRoot] > rank[yRoot]){ // xが属する木の方が大きい場合
parent[yRoot] = xRoot;
}else if(rank[xRoot] < rank[yRoot]){
parent[xRoot] = yRoot; // yの親をxに更新
}else{
parent[yRoot] = xRoot;
rank[xRoot]++; // 同じ高さの木がルートの子として着くから大きさ++;
}
}
int find(int i){ // iの属するルートを返す
if(i != parent[i]){
parent[i] = find(parent[i]);
}
return parent[i];
}
boolean same(int x, int y){ // xとyが同じ木に属しているかを返す
return find(x) == find(y);
}
}
class FordFulkerson {
//------------------------------------------------------------
// int n = sc.nextInt();
// int m = sc.nextInt();
// FordFulkerson ff = new FordFulkerson(n);
//
// for(int i = 0; i < m; i++){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// long c = sc.nextLong();
// ff.addEdge(a, b, c);
// }
//
// System.out.println(ff.solve(0, n - 1));
//------------------------------------------------------------
final static long INF = Long.MAX_VALUE / 2;
List<HashMap<Integer, Long>> l;
boolean[] seen;
FordFulkerson(int n) {
l = new ArrayList<>();
for (int i = 0; i < n; i++) l.add(new HashMap<>());
seen = new boolean[n];
}
void addEdge(int from, int to, long cap) {
l.get(from).put(to, cap);
l.get(to).put(from, 0L);
}
void runFlow(int from, int to, long flow) {
l.get(from).put(to, l.get(from).get(to) - flow);
l.get(to).put(from, l.get(to).get(from) + flow);
}
long ffdfs(int v, int t, long f) {
if (v == t) return f;
seen[v] = true;
for (int next: l.get(v).keySet()) {
if (seen[next]) continue;
if (l.get(v).get(next) == 0) continue;
long flow = ffdfs(next, t, Math.min(f, l.get(v).get(next)));
if (flow == 0) continue;
runFlow(v, next, flow);
return flow;
}
return 0;
}
int solve(int s, int t) {
int res = 0;
while (true) {
Arrays.fill(seen, false);
long flow = ffdfs(s, t, INF);
if(flow == 0) return res;
res += flow;
}
}
}
class Pair implements Comparable<Pair>{
long a, b;
public Pair(long a, long b){
this.a = a;
this.b = b;
}
@Override
public int compareTo(Pair p){
if(this.b < p.b) return -1;
else if(this.b > p.b) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b;
}
}
class Triple implements Comparable<Triple>{
long a, b, c;
public Triple(long a, long b, long c){
this.a = a;
this.b = b;
this.c = c;
}
@Override
public int compareTo(Triple t){
if(this.c < t.c) return -1;
else if(this.c > t.c) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b + " " + c;
}
}
class Quadruple implements Comparable<Quadruple>{
long a, b, c, d;
public Quadruple(long a, long b, long c, long d){
this.a = a;
this.b = b;
this.c = c;
this.d = d;
}
@Override
public int compareTo(Quadruple q){
if(this.d < q.d) return -1;
else if(this.d > q.d) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b + " " + c + " " + d;
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte(){
if(ptr < buflen){
return true;
}else{
ptr = 0;
try{
buflen = in.read(buffer);
}catch(IOException e){
e.printStackTrace();
}
if(buflen <= 0){
return false;
}
}
return true;
}
private int readByte(){
if(hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c){
return 33 <= c && c <= 126;
}
public boolean hasNext(){
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next(){
if(!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong(){
if(!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if(b == '-'){
minus = true;
b = readByte();
}
if(b < '0' || '9' < b){
throw new NumberFormatException();
}
while(true){
if('0' <= b && b <= '9'){
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt(){
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble(){
return Double.parseDouble(next());
}
}
import java.io.*;
import java.util.*;
class Main{
final static long INF = Long.MAX_VALUE / 2;
final static int MOD = 1_000_000_007;
final static int SIZE = 1_000_000;
long[] fac = new long[SIZE];
long[] inv = new long[SIZE];
long[] finv = new long[SIZE];
FastScanner sc = new FastScanner();
public static void main(String[] args) {
new Main().solve();
}
void solve(){
int N = sc.nextInt();
long[] A = new long[N];
for(int i = 0; i < N; i++){
A[i] = sc.nextLong();
}
long[] v = new long[N + 1];
for(int i = 1; i < N + 1; i++){
for(int j = 0; j < (i - 1) / 2; j++){
v[i] += A[j] * 2;
}
if((i - 1) % 2 != 0) v[i] += A[(i - 1) / 2];
}
long[][] dp = new long[N + 1][N + 1];
for(int i = 1; i < N + 1; i++){
for(int c = 1; c < N + 1; c++){
if(c >= i) dp[i][c] = Math.max(dp[i][c - i] + v[i], dp[i - 1][c]);
else dp[i][c] = dp[i - 1][c];
}
}
System.out.println(dp[N][N]);
}
long gcd(long a, long b){ // return aとbの最大公約数
if(b == 0){
return a;
}
return gcd(b, a % b);
}
long lcm(long a, long b){ // return aとbの最小公倍数
return a * b / gcd(a, b);
}
long inv(long a){ // return aの逆元 (mod MOD)
return pow(a, MOD - 2);
}
long pow(long a, long r){ // return a^r (mod MOD)
long sum = 1;
while(r > 0){
if((r & 1) == 1){ // 2進数表記で末尾1の時
sum *= a;
sum %= MOD;
}
a *= a;
a %= MOD;
r >>= 1;
}
return sum;
}
long modFact(long n){ // retur n! (mod MOD)
if(n == 0){
return 1;
}
return n * modFact(n - 1) % MOD;
}
long fact(long n){ // return n!
if(n == 0){
return 1;
}
return n * fact(n - 1);
}
void initCOMB(){
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for(int i = 2; i < SIZE; i++){
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long modComb(int n, int r){ // return nCr (先にinitCOMB()必要)
if(n < r || n < 0 || r < 0) return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
long comb(long n, long r){ // return nCr
long num = 1;
for(long i = 1; i <= r; i++){
num = num * (n - i + 1) / i;
}
return num;
}
boolean isPrime(long a){ // aの素数判定
if(a <= 1) return false;
for(int i = 2; i * i <= a; i++){
if(a % i == 0) return false;
}
return true;
}
int lowerBound(long[] a, long v){ // return 配列a内のv以上の要素の内最低の要素のイテレータ
int r = a.length;
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a[mid] >= v){
r = mid;
}else{
l = mid;
}
}
return r;
}
int lowerBound(List<Long> a, long v){ // return 配列a内のv以上の要素の内最低の要素のイテレータ
int r = a.size();
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a.get(mid) >= v){
r = mid;
}else{
l = mid;
}
}
return r;
}
int upperBound(long[] a, long v){ // return 配列a内のvより大きい要素の内最低の要素のイテレータ
int r = a.length;
int l = -1;
while(r - l > 1){
int mid = (r + l) / 2;
if(a[mid] > v){
r = mid;
}else{
l = mid;
}
}
return r;
}
String nextPermutation(String s){ // return sの次の順列
ArrayList<Character> list = new ArrayList<>();
for(int i = 0; i < s.length(); i++) list.add(s.charAt(i));
int pivotPos = -1;
char pivot = 0;
for(int i = list.size() - 2; i >= 0; i--){
if(list.get(i) < list.get(i+1)){
pivotPos = i;
pivot = list.get(i);
break;
}
}
if(pivotPos == -1 && pivot == 0) return null;
int L = pivotPos + 1;
int R = list.size() - 1;
int minPos = -1;
char min = Character.MAX_VALUE;
for(int i = R; i >= L; i--){
if(pivot < list.get(i)){
if(list.get(i) < min){
min = list.get(i);
minPos = i;
}
}
}
Collections.swap(list, pivotPos, minPos);
Collections.sort(list.subList(L, R + 1));
StringBuilder sb = new StringBuilder();
for(int i=0; i<list.size(); i++) sb.append(list.get(i));
return sb.toString();
}
boolean nextPermutation(long[] a){
for(int i = a.length - 1; i > 0; i--){
if(a[i - 1] < a[i]){
int swapIndex = find(a[i - 1], a, i, a.length - 1);
long temp = a[swapIndex];
a[swapIndex] = a[i - 1];
a[i - 1] = temp;
Arrays.sort(a, i, a.length);
return true;
}
}
return false;
}
int find(long dest, long[] a, int s, int e){
if(s == e){
return s;
}
int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
void elimination(int[][] a, int[] b) {
int n = a.length;
double f;
for(int k = 0; k < n - 1; k++){
for(int i = k + 1; i < n; i++){
f = - a[i][k] / a[k][k];
for(int j = k + 1; j < n; j++){
a[i][j] += f * a[k][j];
}
b[i] += f * b[k];
}
for(int i = n - 1; i >= 0; i--){
for(int j = i + 1; j < n; j++){
b[i] -= a[i][j] * b[j];
}
b[i] = b[i] / a[i][i];
}
}
}
}
class SegmentTree{
//------------------------------------------------------------
// 2 * n - 1 : 木全体のノード数
// i + n - 1 : 配列のi番目が対応するノードの番号
// 2 * i + 1, 2 * i + 2 : i番目のノードの子ノードの番号
// (i - 1) / 2 : i番目のノードの親ノードの番号
//
// int n = sc.nextInt();
// long[] a = new long[n];
// for(int i = 0; i < n; i++) a[i] = sc.nextLong();
// SegmentTree st = new SegmentTree(a);
// int l = sc.nextInt() - 1;
// int r = sc.nextInt() - 1;
// System.out.println(st.query(l, r));
//------------------------------------------------------------
final static long INF = Long.MAX_VALUE / 2;
// long e = INF; // 単位元
long e = 0;
long func(long a, long b){ // 処理
// return Math.min(a, b);
return a + b;
}
int n; // 配列の要素数を超える最小の2のべき乗
long[] node;
SegmentTree(long[] a){
init(a);
}
void init(long[] a){ // 配列aで初期化
n = 1;
while(n < a.length){
n *= 2;
}
node = new long[2 * n - 1];
Arrays.fill(node, e);
for(int i = 0; i < a.length; i++){
node[i + n - 1] = a[i];
}
for(int i = n - 2; i >= 0; i--){
node[i] = func(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int p, long v){ // 配列のp番目をvに変更し、木全体を更新
p = p + n - 1;
node[p] = v;
while(p > 0){
p = (p - 1) / 2;
node[p] = func(node[2 * p + 1], node[2 * p + 2]);
}
}
long query(int a, int b){ // 区間[a, b)についてクエリを処理
return query(a, b, 0, 0, n);
}
long query(int a, int b, int k, int l, int r){
if(r <= a || b <= l) return e;
if(a <= l && r <= b) return node[k];
return func(query(a, b, 2 * k + 1, l, (l + r) / 2), query(a, b, 2 * k + 2, (l + r) / 2, r));
}
}
class UnionFindTree{
//------------------------------------------------------------
// int n = sc.nextInt();
// int q = sc.nextInt();
// UnionFindTree uft = new UnionFindTree(n);
// List<String> ans = new ArrayList<>();
// for(int i = 0; i < q; i++){
// int p = sc.nextInt(); // 0 : union, 1 : same
// if(p == 0){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// uft.union(a, b);
// }else if(p == 1){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// if(uft.same(a, b)) ans.add("Yes");
// else ans.add("No");
// }
// }
// for(String s : ans){
// System.out.println(s);
// }
//------------------------------------------------------------
int[] parent; // インデックスにとノードを対応させ、そのルートノードのインデックスを格納
int[] rank; // parentと同様に、木の高さを格納
UnionFindTree(int size){
parent = new int[size];
rank = new int[size];
for(int i = 0; i < size; i++){
makeSet(i);
}
}
void makeSet(int i){
parent[i] = i;
rank[i] = 0;
}
void union(int x, int y){
int xRoot = find(x);
int yRoot = find(y);
if(rank[xRoot] > rank[yRoot]){ // xが属する木の方が大きい場合
parent[yRoot] = xRoot;
}else if(rank[xRoot] < rank[yRoot]){
parent[xRoot] = yRoot; // yの親をxに更新
}else{
parent[yRoot] = xRoot;
rank[xRoot]++; // 同じ高さの木がルートの子として着くから大きさ++;
}
}
int find(int i){ // iの属するルートを返す
if(i != parent[i]){
parent[i] = find(parent[i]);
}
return parent[i];
}
boolean same(int x, int y){ // xとyが同じ木に属しているかを返す
return find(x) == find(y);
}
}
class FordFulkerson {
//------------------------------------------------------------
// int n = sc.nextInt();
// int m = sc.nextInt();
// FordFulkerson ff = new FordFulkerson(n);
//
// for(int i = 0; i < m; i++){
// int a = sc.nextInt() - 1;
// int b = sc.nextInt() - 1;
// long c = sc.nextLong();
// ff.addEdge(a, b, c);
// }
//
// System.out.println(ff.solve(0, n - 1));
//------------------------------------------------------------
final static long INF = Long.MAX_VALUE / 2;
List<HashMap<Integer, Long>> l;
boolean[] seen;
FordFulkerson(int n) {
l = new ArrayList<>();
for (int i = 0; i < n; i++) l.add(new HashMap<>());
seen = new boolean[n];
}
void addEdge(int from, int to, long cap) {
l.get(from).put(to, cap);
l.get(to).put(from, 0L);
}
void runFlow(int from, int to, long flow) {
l.get(from).put(to, l.get(from).get(to) - flow);
l.get(to).put(from, l.get(to).get(from) + flow);
}
long ffdfs(int v, int t, long f) {
if (v == t) return f;
seen[v] = true;
for (int next: l.get(v).keySet()) {
if (seen[next]) continue;
if (l.get(v).get(next) == 0) continue;
long flow = ffdfs(next, t, Math.min(f, l.get(v).get(next)));
if (flow == 0) continue;
runFlow(v, next, flow);
return flow;
}
return 0;
}
int solve(int s, int t) {
int res = 0;
while (true) {
Arrays.fill(seen, false);
long flow = ffdfs(s, t, INF);
if(flow == 0) return res;
res += flow;
}
}
}
class Pair implements Comparable<Pair>{
long a, b;
public Pair(long a, long b){
this.a = a;
this.b = b;
}
@Override
public int compareTo(Pair p){
if(this.b < p.b) return -1;
else if(this.b > p.b) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b;
}
}
class Triple implements Comparable<Triple>{
long a, b, c;
public Triple(long a, long b, long c){
this.a = a;
this.b = b;
this.c = c;
}
@Override
public int compareTo(Triple t){
if(this.c < t.c) return -1;
else if(this.c > t.c) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b + " " + c;
}
}
class Quadruple implements Comparable<Quadruple>{
long a, b, c, d;
public Quadruple(long a, long b, long c, long d){
this.a = a;
this.b = b;
this.c = c;
this.d = d;
}
@Override
public int compareTo(Quadruple q){
if(this.d < q.d) return -1;
else if(this.d > q.d) return 1;
else return 0;
}
@Override
public String toString(){
return a + " " + b + " " + c + " " + d;
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte(){
if(ptr < buflen){
return true;
}else{
ptr = 0;
try{
buflen = in.read(buffer);
}catch(IOException e){
e.printStackTrace();
}
if(buflen <= 0){
return false;
}
}
return true;
}
private int readByte(){
if(hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c){
return 33 <= c && c <= 126;
}
public boolean hasNext(){
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next(){
if(!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong(){
if(!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if(b == '-'){
minus = true;
b = readByte();
}
if(b < '0' || '9' < b){
throw new NumberFormatException();
}
while(true){
if('0' <= b && b <= '9'){
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt(){
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble(){
return Double.parseDouble(next());
}
}
| ConDefects/ConDefects/Code/abc285_e/Java/38072500 |
condefects-java_data_1258 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner scn = new Scanner(System.in);
OutputWriter out = new OutputWriter(System.out);
// Always print a trailing "\n" and close the OutputWriter as shown at the end of your output
// example:
int n = scn.nextInt();
int[] a=new int[n+1];
for(int i=1;i<=n;i++){
a[i]=scn.nextInt();
}
long[] s=new long[n+1];
for(int i=1;i<=n;i++){
s[i]=s[i-1]+a[i/2];
}
long[] ans=new long[n+1];
for(int i=1;i<=n;i++){
ans[i]=s[i];
for(int j=1;j<=i-2;j++){
ans[i]=Math.max(ans[i],s[j+1]+s[i-j-1]);
}
}
out.print(Long.toString(ans[n])+" ");
/*for(int i1=0;i1<t;i1++){
int n=scn.nextInt();int[] a=new int[n or n+1];
for(int i=0;i<n;i++){
a[i]=scn.nextInt();
}
}*/
out.close();
}
// fast input
static class Scanner {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Scanner(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
String line = reader.readLine();
if (line == null)
return null;
tokenizer = new StringTokenizer(line);
} catch (Exception e) {
throw(new RuntimeException());
}
}
return tokenizer.nextToken();
}
public int nextInt() { return Integer.parseInt(next()); }
public long nextLong() { return Long.parseLong(next()); }
public double nextDouble() { return Double.parseDouble(next()); }
}
// fast output
static class OutputWriter {
BufferedWriter writer;
public OutputWriter(OutputStream stream) {
writer = new BufferedWriter(new OutputStreamWriter(stream));
}
public void print(int i) throws IOException { writer.write(i); }
public void print(String s) throws IOException { writer.write(s); }
public void print(char[] c) throws IOException { writer.write(c); }
public void close() throws IOException { writer.close(); }
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner scn = new Scanner(System.in);
OutputWriter out = new OutputWriter(System.out);
// Always print a trailing "\n" and close the OutputWriter as shown at the end of your output
// example:
int n = scn.nextInt();
int[] a=new int[n+1];
for(int i=1;i<=n;i++){
a[i]=scn.nextInt();
}
long[] s=new long[n+1];
for(int i=1;i<=n;i++){
s[i]=s[i-1]+a[i/2];
}
long[] ans=new long[n+1];
for(int i=1;i<=n;i++){
ans[i]=s[i];
for(int j=1;j<=i-2;j++){
ans[i]=Math.max(ans[i],ans[j+1]+ans[i-j-1]);
}
}
out.print(Long.toString(ans[n])+" ");
/*for(int i1=0;i1<t;i1++){
int n=scn.nextInt();int[] a=new int[n or n+1];
for(int i=0;i<n;i++){
a[i]=scn.nextInt();
}
}*/
out.close();
}
// fast input
static class Scanner {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Scanner(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
String line = reader.readLine();
if (line == null)
return null;
tokenizer = new StringTokenizer(line);
} catch (Exception e) {
throw(new RuntimeException());
}
}
return tokenizer.nextToken();
}
public int nextInt() { return Integer.parseInt(next()); }
public long nextLong() { return Long.parseLong(next()); }
public double nextDouble() { return Double.parseDouble(next()); }
}
// fast output
static class OutputWriter {
BufferedWriter writer;
public OutputWriter(OutputStream stream) {
writer = new BufferedWriter(new OutputStreamWriter(stream));
}
public void print(int i) throws IOException { writer.write(i); }
public void print(String s) throws IOException { writer.write(s); }
public void print(char[] c) throws IOException { writer.write(c); }
public void close() throws IOException { writer.close(); }
}
}
| ConDefects/ConDefects/Code/abc285_e/Java/38300467 |
condefects-java_data_1259 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static final long MOD=998244353;
static final int NTT_MOD1 = 998244353;
static final int NTT_MOD2 = 1053818881;
static final int NTT_MOD3 = 1004535809;
static long MAX = 1000000000000000010l;//10^18
static int ans = 0;
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
long[] a = sc.nextLongArray(n);
long[] sum = new long[n + 1];
for (int i = 1; i < sum.length; i++) {
sum[i] = sum[i - 1] + a[i - 1];
}
long[] num = new long[n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
num[i] = Math.max(num[i], calc(j, a, sum) + calc(i - j, a, sum));
}
}
long[] dp = new long[n + 1];
for (int i = 1; i <= n; i++) {
dp[i] = calc(i, a, sum);
for (int j = 0; j <= i - 2; j++) {
dp[i] = Math.max(dp[i], dp[j] + num[i - j - 2]);
}
}
long ans = calc(n - 1, a, sum);
for (int i = 0; i <= n - 2; i++) {
ans = Math.max(ans, dp[i] + calc(n - i - 2, a, sum));
}
System.out.println(ans);
}
static long calc(int size, long[] a, long[] sum) {
if (size % 2 == 0) {
return sum[size / 2] * 2l;
}else {
return sum[size / 2] * 2l + a[size / 2];
}
}
static class InputReader {
private InputStream in;
private byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (curbuf >= lenbuf) {
curbuf = 0;
try {
lenbuf = in.read(buffer);
} catch (IOException e) {
throw new InputMismatchException();
}
if (lenbuf <= 0)
return false;
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[curbuf++];
else
return -1;
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (hasNextByte() && isSpaceChar(buffer[curbuf]))
curbuf++;
}
public boolean hasNext() {
skip();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (!isSpaceChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++)
map[i] = next().toCharArray();
return map;
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static final long MOD=998244353;
static final int NTT_MOD1 = 998244353;
static final int NTT_MOD2 = 1053818881;
static final int NTT_MOD3 = 1004535809;
static long MAX = 1000000000000000010l;//10^18
static int ans = 0;
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
long[] a = sc.nextLongArray(n);
long[] sum = new long[n + 1];
for (int i = 1; i < sum.length; i++) {
sum[i] = sum[i - 1] + a[i - 1];
}
long[] num = new long[n + 1];
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
num[i] = Math.max(num[i], calc(j, a, sum) + calc(i - j, a, sum));
}
}
long[] dp = new long[n + 1];
for (int i = 1; i <= n; i++) {
dp[i] = Math.max(num[i - 1], calc(i, a, sum));
for (int j = 0; j <= i - 2; j++) {
dp[i] = Math.max(dp[i], dp[j] + num[i - j - 2]);
}
}
long ans = calc(n - 1, a, sum);
for (int i = 0; i <= n - 2; i++) {
ans = Math.max(ans, dp[i] + calc(n - i - 2, a, sum));
}
System.out.println(ans);
}
static long calc(int size, long[] a, long[] sum) {
if (size % 2 == 0) {
return sum[size / 2] * 2l;
}else {
return sum[size / 2] * 2l + a[size / 2];
}
}
static class InputReader {
private InputStream in;
private byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (curbuf >= lenbuf) {
curbuf = 0;
try {
lenbuf = in.read(buffer);
} catch (IOException e) {
throw new InputMismatchException();
}
if (lenbuf <= 0)
return false;
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[curbuf++];
else
return -1;
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (hasNextByte() && isSpaceChar(buffer[curbuf]))
curbuf++;
}
public boolean hasNext() {
skip();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (!isSpaceChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++)
map[i] = next().toCharArray();
return map;
}
}
} | ConDefects/ConDefects/Code/abc285_e/Java/38069112 |
condefects-java_data_1260 | import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedInputStream(System.in));
int n = sc.nextInt();
long[] arr = new long[n];
long[] presum = new long[n + 1];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextLong();
presum[i + 1] = presum[i] + arr[i];
}
// // *)
// long[][] opt = new long[n][n];
//
// // 暴力枚举
// for (int i = 0; i < n; i++) {
// for (int j = i + 1; j < n; j++) {
// // 快速获取，有几个 Ai, Aj
//
// }
// }
// n - 2
// x - 2, n - x
// 背包问题吗？
// 7 -> 6 + 1
// 1 + 4 + 2
long[] pack = new long[n + 1];
for (int i = 1; i <= n; i++) {
int b = i - 1;
long val = 0;
if (b % 2 == 0) {
val = presum[b / 2] * 2;
} else {
val = presum[(b + 1) / 2] * 2 - arr[(b + 1) / 2];
}
for (int j = 0; j + i <= n; j++) {
pack[j + i] = Math.max(pack[j + i], pack[j] + val);
}
}
System.out.println(pack[n]);
}
}
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedInputStream(System.in));
int n = sc.nextInt();
long[] arr = new long[n];
long[] presum = new long[n + 1];
for (int i = 0; i < n; i++) {
arr[i] = sc.nextLong();
presum[i + 1] = presum[i] + arr[i];
}
// // *)
// long[][] opt = new long[n][n];
//
// // 暴力枚举
// for (int i = 0; i < n; i++) {
// for (int j = i + 1; j < n; j++) {
// // 快速获取，有几个 Ai, Aj
//
// }
// }
// n - 2
// x - 2, n - x
// 背包问题吗？
// 7 -> 6 + 1
// 1 + 4 + 2
long[] pack = new long[n + 1];
for (int i = 1; i <= n; i++) {
int b = i - 1;
long val = 0;
if (b % 2 == 0) {
val = presum[b / 2] * 2;
} else {
val = presum[(b + 1) / 2] * 2 - arr[b / 2];
}
for (int j = 0; j + i <= n; j++) {
pack[j + i] = Math.max(pack[j + i], pack[j] + val);
}
}
System.out.println(pack[n]);
}
}
| ConDefects/ConDefects/Code/abc285_e/Java/38074590 |
condefects-java_data_1261 | import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n = nextInt();
long[] a = nextLongArray(n);
// i 日あって、休日がj日ある時の最大値
long[] aSum = new long[n+1];
for (int i = 0; i < n ; i++) {
aSum[i+1] = aSum[i]+a[i];
}
long [] b = new long[n+1];
for (int i = 1; i < n + 1; i++) {
b[i] = aSum[(i+1)/2] + aSum[i/2];
}
long[][] dp = new long[n+1][n];
dp[1][0] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
// iが平日の場合
dp[i][j] = dp[i-1][j-1] - b[j-1] + b[j];
// i が休日の場合
dp[i][0] = dp[i-1][j-1];
}
}
long ans = 0;
for (long l : dp[n]) {
ans = Math.max(ans, l);
}
out.println(ans);
out.flush();
}
static PrintWriter out = new PrintWriter(System.out);
static Scanner scanner = new Scanner(System.in);
static String next() { return scanner.next(); }
static int nextInt() {
int res = 0;
char[] chars = next().toCharArray();
boolean minus = chars[0] == '-';
int start = minus?1:0;
for (int i = start; i < chars.length; i++) {
res = res*10 + (chars[i]-'0');
}
return minus?-res:res;
}
static long nextLong() {
long res = 0;
char[] chars = next().toCharArray();
boolean minus = chars[0] == '-';
int start = minus?1:0;
for (int i = start; i < chars.length; i++) {
res = res*10 + (chars[i]-'0');
}
return minus?-res:res;
}
static double nextDouble() { return Double.parseDouble(next()); }
static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) { array[i] = nextInt(); }
return array;
}
static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) { array[i] = nextLong(); }
return array;
}
}
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n = nextInt();
long[] a = nextLongArray(n);
// i 日あって、休日がj日ある時の最大値
long[] aSum = new long[n+1];
for (int i = 0; i < n ; i++) {
aSum[i+1] = aSum[i]+a[i];
}
long [] b = new long[n+1];
for (int i = 1; i < n + 1; i++) {
b[i] = aSum[(i+1)/2] + aSum[i/2];
}
long[][] dp = new long[n+1][n];
dp[1][0] = 0;
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
// iが平日の場合
dp[i][j] = dp[i-1][j-1] - b[j-1] + b[j];
// i が休日の場合
dp[i][0] = Math.max(dp[i][0], dp[i-1][j-1]);
}
}
long ans = 0;
for (long l : dp[n]) {
ans = Math.max(ans, l);
}
out.println(ans);
out.flush();
}
static PrintWriter out = new PrintWriter(System.out);
static Scanner scanner = new Scanner(System.in);
static String next() { return scanner.next(); }
static int nextInt() {
int res = 0;
char[] chars = next().toCharArray();
boolean minus = chars[0] == '-';
int start = minus?1:0;
for (int i = start; i < chars.length; i++) {
res = res*10 + (chars[i]-'0');
}
return minus?-res:res;
}
static long nextLong() {
long res = 0;
char[] chars = next().toCharArray();
boolean minus = chars[0] == '-';
int start = minus?1:0;
for (int i = start; i < chars.length; i++) {
res = res*10 + (chars[i]-'0');
}
return minus?-res:res;
}
static double nextDouble() { return Double.parseDouble(next()); }
static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) { array[i] = nextInt(); }
return array;
}
static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) { array[i] = nextLong(); }
return array;
}
} | ConDefects/ConDefects/Code/abc285_e/Java/38078127 |
condefects-java_data_1262 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt(), x = fReader.nextInt(), y = fReader.nextInt();
int[] p = new int[n-1];
int[] t = new int[n-1];
int cycle = 1;
for(int i=1;i<=8;i++) cycle = (int)lcm(cycle, i);
for(int i=0;i<n-1;i++) {
// 1~8
p[i] = fReader.nextInt();
t[i] = fReader.nextInt();
}
/*
13 -> 15 -> 19 -> 24 -> 30 -> 31 -> 34
8 = 2^3 * 3 * 5 * 7
*/
long[] dp = new long[cycle];
for(int j=0;j<cycle;j++) {
long start = j, cur = j;
for(int i=0;i<n-1;i++) {
int mod = (int)(cur%p[i]);
if(mod != 0) cur += p[i]-mod;
cur += t[i];
}
dp[j] = cur-start;
}
int Q = fReader.nextInt();
int[] q = new int[Q];
for(int i=0;i<Q;i++) {
q[i] = fReader.nextInt();
int mod = (q[i]+x)%cycle;
o.println(q[i]+x+y+dp[mod]);
}
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
long g = gcd(a, b);
return a / gcd(a,b)*b;
// 2 6 4
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
public int getSize(int i){
return size[find(i)];
}
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer c1;
Integer c2;
Integer c3;
Integer c4;
public Pair(Integer c1, Integer c2, Integer c3, Integer c4) {
this.c1 = c1;
this.c2 = c2;
this.c3 = c3;
this.c4 = c4;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + c1.hashCode();
ret = ret*prime + c2.hashCode();
ret = ret*prime + c3.hashCode();
ret = ret*prime + c4.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return c1.equals(((Pair) obj).c1) && c2.equals(((Pair) obj).c2) && c3.equals(((Pair) obj).c3) && c4.equals(((Pair) obj).c4);
}
return false;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt(), x = fReader.nextInt(), y = fReader.nextInt();
int[] p = new int[n-1];
int[] t = new int[n-1];
int cycle = 1;
for(int i=1;i<=8;i++) cycle = (int)lcm(cycle, i);
for(int i=0;i<n-1;i++) {
// 1~8
p[i] = fReader.nextInt();
t[i] = fReader.nextInt();
}
/*
13 -> 15 -> 19 -> 24 -> 30 -> 31 -> 34
8 = 2^3 * 3 * 5 * 7
*/
long[] dp = new long[cycle];
for(int j=0;j<cycle;j++) {
long start = j, cur = j;
for(int i=0;i<n-1;i++) {
int mod = (int)(cur%p[i]);
if(mod != 0) cur += p[i]-mod;
cur += t[i];
}
dp[j] = cur-start;
}
int Q = fReader.nextInt();
int[] q = new int[Q];
for(int i=0;i<Q;i++) {
q[i] = fReader.nextInt();
int mod = (q[i]+x)%cycle;
o.println(1l*q[i]+x+y+dp[mod]);
}
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
long g = gcd(a, b);
return a / gcd(a,b)*b;
// 2 6 4
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
public int getSize(int i){
return size[find(i)];
}
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer c1;
Integer c2;
Integer c3;
Integer c4;
public Pair(Integer c1, Integer c2, Integer c3, Integer c4) {
this.c1 = c1;
this.c2 = c2;
this.c3 = c3;
this.c4 = c4;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + c1.hashCode();
ret = ret*prime + c2.hashCode();
ret = ret*prime + c3.hashCode();
ret = ret*prime + c4.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return c1.equals(((Pair) obj).c1) && c2.equals(((Pair) obj).c2) && c3.equals(((Pair) obj).c3) && c4.equals(((Pair) obj).c4);
}
return false;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
} | ConDefects/ConDefects/Code/abc319_e/Java/45456717 |
condefects-java_data_1263 | import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
static long MOD = 998244353;
int min = Integer.MAX_VALUE;
int max = 0;
int count = 0;
int pattern = 0;
Map<Long, Long> map = new HashMap<Long, Long>();
public static void main(String[] args) throws Exception {
// FileInputStream fis = new FileInputStream(new File("t.a"));
var sc = new FastScanner();
// Scanner sc = new Scanner(System.in);
// var sc = new FastScanner(fis);
// var pw = new FastPrintStream("t.y");
var pw = new FastPrintStream();
solve(sc, pw);
sc.close();
pw.flush();
pw.close();
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
PointX p[] = new PointX[n - 1];
for (int i = 0; i < n - 1; i++) {
p[i] = new PointX(sc.nextInt(), sc.nextInt());
}
long all = 0;
for (int i = 0; i < n - 1; i++) {
all += p[i].b;
}
int temp=24;
long machi[] = new long[temp];
for (int i = 0; i < temp; i++) {
long now = i;
for (int j = 0; j < n-1; j++) {
if (now % p[j].a != 0) {
machi[i] += p[j].a - now % p[j].a;
now = now + (p[j].a - now % p[j].a);
}
now += p[j].b;
now %= temp;
}
}
int q = sc.nextInt();
for (int i = 0; i < q; i++) {
long t = sc.nextLong();
pw.println(t +x+ machi[(int) ((t+x) % temp)] + all+y);
}
}
public static long all(long start, long end, long count) {
return (end + start) * count / 2;
}
public static int countA(int n, int a[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (a[mid] > price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return re + 1;
}
public static int countB(int n, int b[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (b[mid] >= price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return n - (re + 1);
}
public static String reverseString(String s) {
StringBuffer sb = new StringBuffer();
for (int i = s.length() - 1; i >= 0; i--) {
sb.append(s.charAt(i));
}
return sb.toString();
}
public static boolean check(char c[][], int startx, int starty, int x, int y) {
if (c[startx][starty] == '.') {
return false;
}
char temp = c[startx][starty];
for (int i = 0; i < 3; i++) {
if (c[startx + i * x][starty + i * y] != temp) {
return false;
}
}
return true;
}
public static boolean compareString(String s, int indexb) {
int length = Math.min(indexb, s.length() - indexb);
for (int i = 0; i < length; i++) {
if (s.charAt(i) < s.charAt(i + indexb)) {
return true;
} else if (s.charAt(i) > s.charAt(i + indexb)) {
return false;
}
}
if (indexb < s.length() - indexb) {
return true;
}
return false;
}
public static boolean checkx(char c[][], char x[][], int hc, int wc, int hx, int wx) {
for (int i = 0; i <= hc - hx; i++) {
for (int j = 0; j <= wc - wx; j++) {
boolean bool = true;
for (int l = 0; l < hx; l++) {
for (int m = 0; m < wx; m++) {
if (c[i + l][j + m] == '#' || x[l][m] == '#') {
if (c[i + l][j + m] != x[l][m]) {
bool = false;
}
}
}
}
if (bool) {
return true;
}
}
}
return false;
}
public static void refreshc(char c[][], char a[][], int ha, int wa, int hb, int wb) {
for (int i = 0; i < ha; i++) {
for (int j = 0; j < wa; j++) {
c[i + hb][j + wb] = a[i][j];
}
}
}
public static void updateList(List<Point> list, int p[], int po, int position[]) {
po += 2;
list.add(new Point(po - 1, po - 1));
int temp = p[po];
p[po] = p[po - 1];
p[po - 1] = p[po - 2];
p[po - 2] = temp;
position[p[po] - 1] = po;
position[p[po - 1] - 1] = po - 1;
position[p[po - 2] - 1] = po - 2;
po -= 2;
}
public static void updateSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = map.get(n);
countM--;
if (countM == 0) {
map.remove(n);
set.remove(n);
} else {
map.put(n, countM);
}
}
public static void insertSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = 0;
if (set.contains(n)) {
countM = map.get(n);
} else {
set.add(n);
}
countM++;
map.put(n, countM);
}
public static int distance(int x1, int y1, int x2, int y2) {
int distance = (int) Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) + 1;
return distance;
}
public static boolean nextPermutation(int[] arr) {
int len = arr.length;
int left = len - 2;
while (left >= 0 && arr[left] >= arr[left + 1])
left--;
if (left < 0)
return false;
int right = len - 1;
while (arr[left] >= arr[right])
right--;
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right = len - 1;
while (left < right) {
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right--;
}
return true;
}
public static void testpattern(int n) {
int count = 0;
int re = 0;
for (int x = 1; x * x <= n; x++) {
count++;
}
System.out.println(count);
re += count;
count = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * x <= n; y++) {
if (y != x) {
count += 3;
// System.out.println(x+" "+x+" "+y);
}
}
}
re += count;
System.out.println(count);
count = 0;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
if (x * y <= n && y * z <= n && x * z <= n) {
if (x != y && x != z && y != z) {
count++;
}
}
}
}
}
re += count;
System.out.println(count);
System.out.println(re);
}
public static int distance(char a[][], Point s, Point e, int h, int w) {
int temp[][] = new int[h][w];
List<Point> list = new ArrayList<>();
list.add(s);
temp[s.x][s.y] = 1;
int count = 1;
while (!list.isEmpty()) {
List<Point> t = new ArrayList<>();
for (Point p : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) != Math.abs(j)) {
if (i + p.x < h && i + p.x >= 0 && j + p.y >= 0 && j + p.y < w) {
if (e.x == i + p.x && e.y == j + p.y) {
return count;
}
if (temp[i + p.x][j + p.y] == 0 && a[i + p.x][j + p.y] != '#') {
t.add(new Point(i + p.x, j + p.y));
temp[i + p.x][j + p.y]++;
}
}
}
}
}
}
count++;
list = t;
}
return Integer.MAX_VALUE / 3;
}
public static int[][] reverse(int n, int a[][]) {
int temp[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
temp[n - 1 - j][i] = a[i][j];
}
}
return temp;
}
public static boolean check(int a[][], int b[][], int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1 && b[i][j] == 0) {
return false;
}
}
}
return true;
}
public static long testMethod(long a, long b) {
if (a < b) {
long t = b;
b = a;
a = t;
}
long re = 0;
// long nowgcd = 1;
while (b > 0) {
if (a == b) {
// pw.println(re + 1);
return re + 1;
}
long gcd = Main.gcd(a, b);
if (gcd == 1) {
long sa = a - b;
if (sa == 1) {
return re + b;
}
long min = a % sa;
for (long i = 2; i * i <= sa; i++) {
if (sa % i == 0) {
min = Math.min(min, a % i);
min = Math.min(min, a % (sa / i));
}
}
re += min;
a -= min;
b -= min;
} else {
// nowgcd = gcd;
re++;
a = a / gcd - 1;
b = b / gcd - 1;
}
}
return re;
}
public static long countNext(long a, long b) {
long re = -1;
long min = 1;
long max = b - 1;
while (min <= max) {
long mid = (min + max) / 2;
if ((a - mid) / (b - mid) > 1) {
re = mid;
min = mid + 1;
} else {
max = mid - 1;
}
}
return re;
}
public static int countTime(int max, int min, int i) {
int times = max / i + i - 1;
if (max % i != 0) {
times++;
}
if (min <= i) {
times++;
} else {
times = times + min / i;
if (min % i != 0) {
times++;
}
}
return times;
}
public static boolean check(long s, long l, long k, long m, long n, long v) {
if ((s - 1) / m != (s + l - 2) / m) {
return false;
}
if (s + (k - 1) * m > n * m) {
return false;
}
long temp = (s + s + (k - 1) * m) * k / 2;
long temp2 = (temp + temp + (l - 1) * k) * l / 2;
if (temp2 != v) {
return false;
}
return true;
}
public static double result(int x[], int x1, int x2, int x3) {
return 1.0 / (x[x1] * x[x2]) + 1.0 / (x[x2] * x[x3]) + 1.0 / (x[x1] * x[x3]);
}
public static int[] toArray(int temp, int n) {
List<Integer> list = new ArrayList<Integer>();
while (temp > 0) {
list.add(temp % 2);
temp /= 2;
}
int re[] = new int[n];
for (int i = 0; i < list.size(); i++) {
re[i] = list.get(i);
}
return re;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static boolean make_so(long[] as, long[] ms) {
while (true) {
boolean updated = false;
for (int fst = 0; fst < ms.length; fst++) {
for (int snd = fst + 1; snd < ms.length; snd++) {
long gcd = gcd(ms[fst], ms[snd]);
if (gcd == 1) {
continue;
}
updated = true;
if (as[fst] % gcd != as[snd] % gcd) {
return false;
}
ms[fst] /= gcd;
ms[snd] /= gcd;
while (true) {
long gt = gcd(ms[fst], gcd);
if (gt == 1) {
break;
}
ms[fst] *= gt;
gcd /= gt;
}
ms[snd] *= gcd;
as[fst] %= ms[fst];
as[snd] %= ms[snd];
}
}
if (!updated) {
break;
}
}
return true;
}
public static long mod_pow(long a, long e, long m) {
if (e == 0) {
return 1;
} else if (e % 2 == 0) {
long ret = mod_pow(a, e / 2, m);
return (ret * ret) % m;
} else {
return (mod_pow(a, e - 1, m) * a) % m;
}
}
// a and m must be co-prime.
public static long mod_inv(long a, long m) {
return (a == 1 ? 1 : (1 - m * mod_inv(m % a, a)) / a + m);
}
// O(N^2). ms[i] は互いに素でなくてはならない.
// Π(ms[i]) がオーバーフローする場合でも, 最後に適切に MOD を取れば OK
public static long chinese_remainder(long[] as, long[] ms, long MOD) {
long[] vs = new long[ms.length];
long[] sums = new long[ms.length];
long[] invs = new long[ms.length];
for (int i = 0; i < ms.length; i++) {
invs[i] = 1; // mod(ms[i]) の中で 1 / (ms[0] * ms[1] ... ms[i - 1]) を求める
sums[i] = as[i]; // mod(ms[i]) の中で, a[i] - v[0] - v[1]ms[0] ... を求める
long mult = 1; // mod(ms[i]) の中で, ms[0] * ... * ms[i - 2] を求める
for (int j = 0; j < i; j++) {
sums[i] -= (vs[j] * mult) % ms[i];
if (sums[i] < 0) {
sums[i] += ms[i];
}
invs[i] = (invs[i] * mod_inv(ms[j], ms[i])) % ms[i];
mult = (mult * ms[j]) % ms[i];
}
vs[i] = (sums[i] * invs[i]) % ms[i];
}
// MOD を取る前に x = 0 かどうかを知る場合, ここで ∀i.(vs[i] == 0) チェック
{
boolean flg = true;
for (final long v : vs) {
if (v != 0) {
flg = false;
break;
}
}
if (flg) { // ここに来るなら 全ての条件を x = 0 で満たす.
return 0; // 正整数が欲しいなら、Π(ms[i]) の MOD が答え
}
}
long ret = 0;
for (int i = 0; i < ms.length; i++) {
long mult = 1;
for (int j = 0; j < i; j++) {
mult *= ms[j];
mult %= MOD;
}
ret += (vs[i] * mult) % MOD;
ret %= MOD;
}
return ret;
}
public static long mulity(long l, int a[]) {
for (int i = 0; i < a.length; i++) {
if (l % a[i] == 0) {
l /= a[i];
a[i] = 1;
}
}
return l;
}
public static int[][] reverse(int a[][]) {
int b[][] = new int[2][2];
b[0][0] = a[1][0];
b[0][1] = a[0][0];
b[1][0] = a[1][1];
b[1][1] = a[0][1];
return b;
}
public static void add(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (ts.contains(value)) {
map.put(value, map.get(value) + 1);
} else {
ts.add(value);
map.put(value, 1);
}
}
public static void remove(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (map.get(value) == 1) {
ts.remove(value);
map.remove(value);
} else {
map.put(value, map.get(value) - 1);
}
}
public static int merge(int n, int m, int e) {
int merge = (n * (n - 1) / 2 - 2 * m) * e * 3 / 200;
if ((n - 2 * m) * e % 100 != 0) {
merge++;
}
return Math.max(3, merge);
}
public static boolean isMerge(int n, int m, int e, int count, int now) {
int merge = merge(n, m, e);
if (Math.abs(count - now) <= merge) {
return true;
}
return false;
}
public static void setall(Set<Integer> set, int x) {
if (x < 10) {
set.add(x);
return;
}
int to = 0;
int one[] = new int[4];
while (x > 0) {
one[to] = x % 10;
x /= 10;
to++;
}
Main.permutation(one, 0, to - 1, set);
}
// mod. m での a の逆元 a^{-1} を計算する
public static long modinv(long a, long m) {
long b = m, u = 1, v = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
long temp = a;
a = b;
b = temp;
u -= t * v;
temp = u;
u = v;
v = temp;
}
u %= m;
if (u < 0)
u += m;
return u;
}
public long re(long n) {
if ((n % 6 == 1 || n % 6 == 5) && n > 1) {
n--;
}
if (map.containsKey(n)) {
return map.get(n);
}
long t1 = re(n / 2);
long t2 = re(n / 3);
map.put(n / 2, t1);
map.put(n / 3, t2);
return t1 + t2;
}
public static long distance(Point s, Point e) {
return (s.x - e.x) * (s.x - e.x) + (s.y - e.y) * (s.y - e.y);
}
public static int lowerBound(Integer[] a, int obj) {
int l = 0, r = a.length - 1;
while (r - l >= 0) {
int c = (l + r) / 2;
if (obj <= a[c]) {
r = c - 1;
} else {
l = c + 1;
}
}
return l;
}
public static long countRe(int high, int used[], long now, long min, long b[]) {
long re = Long.MAX_VALUE;
long temp = min;
for (int i = high; i >= 0; i--) {
if (used[i] == 0 && temp < now) {
temp += b[i];
if (temp >= now) {
re = Math.min(re, temp);
temp -= b[i];
}
}
}
if (re == Long.MAX_VALUE) {
re = min;
}
return re;
}
public static void swap(int[] s, int i, int j) {
int tmp = s[i];
s[i] = s[j];
s[j] = tmp;
}
public static void permutation(int[] s, int from, int to, Set<Integer> set) {
if (to <= 0)
return;
if (from == to) {
check(s, set, to);
} else {
for (int i = from; i <= to; i++) {
swap(s, i, from);
permutation(s, from + 1, to, set);
swap(s, from, i);
}
}
}
public static void check(int[] s, Set<Integer> set, int to) {
int temp = 0;
for (int i = 0; i <= to; i++) {
temp *= 10;
temp += s[i];
}
set.add(temp);
}
public static long anothertoTen(long ano, int another) {
long ten = 0;
long now = 1;
long temp = ano;
while (temp > 0) {
long i = temp % 10;
ten += now * i;
now *= another;
temp /= 10;
}
return ten;
}
public static long tentoAnother(long ten, int another) {
Stack<Long> stack = new Stack<Long>();
while (ten > 0) {
stack.add(ten % another);
ten /= another;
}
long re = 0;
while (!stack.isEmpty()) {
long pop = stack.pop();
re = re * 10 + pop;
}
return re;
}
// 2C5 = 5*4/(2*1)
public static long fastXCY(long tempx, long temp) {
tempx = tempx % MOD;
temp %= MOD;
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
// 2C5 = 5*4/(2*1)
public static long XCY(long x, long y) {
long temp = 1;
for (int i = 0; i < x; i++) {
temp = (temp * (y - i)) % MOD;
}
long tempx = 1;
for (int i = 2; i <= x; i++) {
tempx = (tempx * i) % MOD;
}
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
static long modpow(long N, Long K) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(MOD)).longValue();
}
static long modpow(long N, Long K, long mod) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(mod)).longValue();
}
public static int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a < b) {
return gcd(b, a);
}
return gcd(b, a % b);
}
}
class PointEx implements Comparable<PointEx> {
String s;
int index = 0;
public PointEx(String t, int i) {
s = new String(t);
index = i;
}
@Override
public int compareTo(PointEx o) {
return this.s.compareTo(o.s);
}
}
class Node implements Comparable<Node> {
int tyoten;
long minDistance;
public Node(int t, long m) {
tyoten = t;
minDistance = m;
}
@Override
public int compareTo(Node o) {
int res = -1;
if (this.minDistance - o.minDistance >= 0) {
res = 1;
}
return res;
}
}
class Vertex {
String key;
Vertex(String key) {
this.key = key;
}
}
class Edge {
Vertex start;
Vertex end;
long key;
Edge(Vertex start, Vertex end, long key) {
this.start = start;
this.end = end;
this.key = key;
}
}
class Target {
int s;
int e;
long c;
}
class Point extends Object implements Comparable {
int x;
int y;
public Point() {
}
public Point(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object j) {
Point p = (Point) j;
if (p.x == this.x && p.y == this.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
return (int) this.x + (int) this.y;
}
public int compareTo(Object p) {
Point t = (Point) p;
if (t.x != this.x) {
return this.x - t.x;
}
return this.y - t.y;
}
}
class PointX implements Comparable {
long a;
long b;
public PointX(long x, long y) {
a = x;
b = y;
}
public int compareTo(Object p) {
PointX t = (PointX) p;
if (this.a < t.a) {
return -1;
}
if (this.a > t.a) {
return 1;
}
return 0;
}
public boolean equals(Object p) {
PointX t = (PointX) p;
return this.a == t.a && this.b == t.b;
}
}
class PointTemp {
int x;
int y;
int nx;
int ny;
public PointTemp(int tx, int ty, int tnx, int tny) {
x = tx;
y = ty;
nx = tnx;
ny = tny;
}
public String print() {
StringBuffer sb = new StringBuffer();
sb.append(x + " ");
sb.append(y + " ");
sb.append(nx + " ");
sb.append(ny + " ");
return sb.toString();
}
}
class FastPrintStream implements AutoCloseable {
private static final int BUF_SIZE = 1 << 15;
private final byte[] buf = new byte[BUF_SIZE];
private int ptr = 0;
private final java.lang.reflect.Field strField;
private final java.nio.charset.CharsetEncoder encoder;
private java.io.OutputStream out;
public FastPrintStream(java.io.OutputStream out) {
this.out = out;
java.lang.reflect.Field f;
try {
f = java.lang.String.class.getDeclaredField("value");
// f.setAccessible(true);
} catch (NoSuchFieldException | SecurityException e) {
f = null;
}
this.strField = f;
this.encoder = java.nio.charset.StandardCharsets.US_ASCII.newEncoder();
}
public FastPrintStream(java.io.File file) throws java.io.IOException {
this(new java.io.FileOutputStream(file));
}
public FastPrintStream(java.lang.String filename) throws java.io.IOException {
this(new java.io.File(filename));
}
public FastPrintStream() {
this(System.out);
try {
java.lang.reflect.Field f = java.io.PrintStream.class.getDeclaredField("autoFlush");
// f.setAccessible(true);
f.set(System.out, false);
} catch (IllegalAccessException | IllegalArgumentException | NoSuchFieldException e) {
// ignore
}
}
public FastPrintStream println() {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) '\n';
return this;
}
public FastPrintStream println(java.lang.Object o) {
return print(o).println();
}
public FastPrintStream println(java.lang.String s) {
return print(s).println();
}
public FastPrintStream println(char[] s) {
return print(s).println();
}
public FastPrintStream println(char c) {
return print(c).println();
}
public FastPrintStream println(int x) {
return print(x).println();
}
public FastPrintStream println(long x) {
return print(x).println();
}
public FastPrintStream println(double d, int precision) {
return print(d, precision).println();
}
private FastPrintStream print(byte[] bytes) {
int n = bytes.length;
if (ptr + n > BUF_SIZE) {
internalFlush();
try {
out.write(bytes);
} catch (java.io.IOException e) {
throw new RuntimeException();
}
} else {
System.arraycopy(bytes, 0, buf, ptr, n);
ptr += n;
}
return this;
}
public FastPrintStream print(java.lang.Object o) {
return print(o.toString());
}
public FastPrintStream print(java.lang.String s) {
if (strField == null) {
return print(s.getBytes());
} else {
try {
return print((byte[]) strField.get(s));
} catch (IllegalAccessException e) {
return print(s.getBytes());
}
}
}
public FastPrintStream print(char[] s) {
try {
return print(encoder.encode(java.nio.CharBuffer.wrap(s)).array());
} catch (java.nio.charset.CharacterCodingException e) {
byte[] bytes = new byte[s.length];
for (int i = 0; i < s.length; i++) {
bytes[i] = (byte) s[i];
}
return print(bytes);
}
}
public FastPrintStream print(char c) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) c;
return this;
}
public FastPrintStream print(int x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(long x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(double d, int precision) {
if (d < 0) {
print('-');
d = -d;
}
d += Math.pow(10, -d) / 2;
print((long) d).print('.');
d -= (long) d;
for (int i = 0; i < precision; i++) {
d *= 10;
print((int) d);
d -= (int) d;
}
return this;
}
private void internalFlush() {
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void flush() {
try {
out.write(buf, 0, ptr);
out.flush();
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void close() {
try {
out.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
private static int len(int x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
int p = -10;
for (int i = 1; i < 10; i++, p *= 10)
if (x > p)
return i + d;
return 10 + d;
}
private static int len(long x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
long p = -10;
for (int i = 1; i < 19; i++, p *= 10)
if (x > p)
return i + d;
return 19 + d;
}
}
class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[2048];
private int ptr = 0;
private int buflen = 0;
public FastScanner(java.io.InputStream in) {
this.in = in;
}
public FastScanner() {
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen)
return true;
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
return buflen > 0;
}
private int readByte() {
return hasNextByte() ? buf[ptr++] : -1;
}
public boolean hasNext() {
while (hasNextByte() && !(32 < buf[ptr] && buf[ptr] < 127))
ptr++;
return hasNextByte();
}
private StringBuilder nextSequence() {
if (!hasNext())
throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
for (int b = readByte(); 32 < b && b < 127; b = readByte()) {
sb.appendCodePoint(b);
}
return sb;
}
public String next() {
return nextSequence().toString();
}
public String next(int len) {
return new String(nextChars(len));
}
public char nextChar() {
if (!hasNextByte())
throw new java.util.NoSuchElementException();
return (char) readByte();
}
public char[] nextChars() {
StringBuilder sb = nextSequence();
int l = sb.length();
char[] dst = new char[l];
sb.getChars(0, l, dst, 0);
return dst;
}
public char[] nextChars(int len) {
if (!hasNext())
throw new java.util.NoSuchElementException();
char[] s = new char[len];
int i = 0;
int b = readByte();
while (32 < b && b < 127 && i < len) {
s[i++] = (char) b;
b = readByte();
}
if (i != len) {
throw new java.util.NoSuchElementException(
String.format("Next token has smaller length than expected.", len));
}
return s;
}
public long nextLong() {
if (!hasNext())
throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b)
throw new NumberFormatException();
while (true) {
if ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
} else if (b == -1 || !(32 < b && b < 127)) {
return minus ? -n : n;
} else
throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() {
return Math.toIntExact(nextLong());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
in.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(int n, java.util.function.BinaryOperator<S> op, S e) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e) {
this(dat.length, op, e);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1)
sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1)
sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
S sum = E;
do {
l >>= Long.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N)
return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return -1;
}
int x = leader(a);
int y = leader(b);
if (x == y)
return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return false;
}
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n)) {
return -1;
}
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
return result;
}
}
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
static long MOD = 998244353;
int min = Integer.MAX_VALUE;
int max = 0;
int count = 0;
int pattern = 0;
Map<Long, Long> map = new HashMap<Long, Long>();
public static void main(String[] args) throws Exception {
// FileInputStream fis = new FileInputStream(new File("t.a"));
var sc = new FastScanner();
// Scanner sc = new Scanner(System.in);
// var sc = new FastScanner(fis);
// var pw = new FastPrintStream("t.y");
var pw = new FastPrintStream();
solve(sc, pw);
sc.close();
pw.flush();
pw.close();
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
PointX p[] = new PointX[n - 1];
for (int i = 0; i < n - 1; i++) {
p[i] = new PointX(sc.nextInt(), sc.nextInt());
}
long all = 0;
for (int i = 0; i < n - 1; i++) {
all += p[i].b;
}
int temp=840;
long machi[] = new long[temp];
for (int i = 0; i < temp; i++) {
long now = i;
for (int j = 0; j < n-1; j++) {
if (now % p[j].a != 0) {
machi[i] += p[j].a - now % p[j].a;
now = now + (p[j].a - now % p[j].a);
}
now += p[j].b;
now %= temp;
}
}
int q = sc.nextInt();
for (int i = 0; i < q; i++) {
long t = sc.nextLong();
pw.println(t +x+ machi[(int) ((t+x) % temp)] + all+y);
}
}
public static long all(long start, long end, long count) {
return (end + start) * count / 2;
}
public static int countA(int n, int a[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (a[mid] > price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return re + 1;
}
public static int countB(int n, int b[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (b[mid] >= price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return n - (re + 1);
}
public static String reverseString(String s) {
StringBuffer sb = new StringBuffer();
for (int i = s.length() - 1; i >= 0; i--) {
sb.append(s.charAt(i));
}
return sb.toString();
}
public static boolean check(char c[][], int startx, int starty, int x, int y) {
if (c[startx][starty] == '.') {
return false;
}
char temp = c[startx][starty];
for (int i = 0; i < 3; i++) {
if (c[startx + i * x][starty + i * y] != temp) {
return false;
}
}
return true;
}
public static boolean compareString(String s, int indexb) {
int length = Math.min(indexb, s.length() - indexb);
for (int i = 0; i < length; i++) {
if (s.charAt(i) < s.charAt(i + indexb)) {
return true;
} else if (s.charAt(i) > s.charAt(i + indexb)) {
return false;
}
}
if (indexb < s.length() - indexb) {
return true;
}
return false;
}
public static boolean checkx(char c[][], char x[][], int hc, int wc, int hx, int wx) {
for (int i = 0; i <= hc - hx; i++) {
for (int j = 0; j <= wc - wx; j++) {
boolean bool = true;
for (int l = 0; l < hx; l++) {
for (int m = 0; m < wx; m++) {
if (c[i + l][j + m] == '#' || x[l][m] == '#') {
if (c[i + l][j + m] != x[l][m]) {
bool = false;
}
}
}
}
if (bool) {
return true;
}
}
}
return false;
}
public static void refreshc(char c[][], char a[][], int ha, int wa, int hb, int wb) {
for (int i = 0; i < ha; i++) {
for (int j = 0; j < wa; j++) {
c[i + hb][j + wb] = a[i][j];
}
}
}
public static void updateList(List<Point> list, int p[], int po, int position[]) {
po += 2;
list.add(new Point(po - 1, po - 1));
int temp = p[po];
p[po] = p[po - 1];
p[po - 1] = p[po - 2];
p[po - 2] = temp;
position[p[po] - 1] = po;
position[p[po - 1] - 1] = po - 1;
position[p[po - 2] - 1] = po - 2;
po -= 2;
}
public static void updateSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = map.get(n);
countM--;
if (countM == 0) {
map.remove(n);
set.remove(n);
} else {
map.put(n, countM);
}
}
public static void insertSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = 0;
if (set.contains(n)) {
countM = map.get(n);
} else {
set.add(n);
}
countM++;
map.put(n, countM);
}
public static int distance(int x1, int y1, int x2, int y2) {
int distance = (int) Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) + 1;
return distance;
}
public static boolean nextPermutation(int[] arr) {
int len = arr.length;
int left = len - 2;
while (left >= 0 && arr[left] >= arr[left + 1])
left--;
if (left < 0)
return false;
int right = len - 1;
while (arr[left] >= arr[right])
right--;
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right = len - 1;
while (left < right) {
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right--;
}
return true;
}
public static void testpattern(int n) {
int count = 0;
int re = 0;
for (int x = 1; x * x <= n; x++) {
count++;
}
System.out.println(count);
re += count;
count = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * x <= n; y++) {
if (y != x) {
count += 3;
// System.out.println(x+" "+x+" "+y);
}
}
}
re += count;
System.out.println(count);
count = 0;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
if (x * y <= n && y * z <= n && x * z <= n) {
if (x != y && x != z && y != z) {
count++;
}
}
}
}
}
re += count;
System.out.println(count);
System.out.println(re);
}
public static int distance(char a[][], Point s, Point e, int h, int w) {
int temp[][] = new int[h][w];
List<Point> list = new ArrayList<>();
list.add(s);
temp[s.x][s.y] = 1;
int count = 1;
while (!list.isEmpty()) {
List<Point> t = new ArrayList<>();
for (Point p : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) != Math.abs(j)) {
if (i + p.x < h && i + p.x >= 0 && j + p.y >= 0 && j + p.y < w) {
if (e.x == i + p.x && e.y == j + p.y) {
return count;
}
if (temp[i + p.x][j + p.y] == 0 && a[i + p.x][j + p.y] != '#') {
t.add(new Point(i + p.x, j + p.y));
temp[i + p.x][j + p.y]++;
}
}
}
}
}
}
count++;
list = t;
}
return Integer.MAX_VALUE / 3;
}
public static int[][] reverse(int n, int a[][]) {
int temp[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
temp[n - 1 - j][i] = a[i][j];
}
}
return temp;
}
public static boolean check(int a[][], int b[][], int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1 && b[i][j] == 0) {
return false;
}
}
}
return true;
}
public static long testMethod(long a, long b) {
if (a < b) {
long t = b;
b = a;
a = t;
}
long re = 0;
// long nowgcd = 1;
while (b > 0) {
if (a == b) {
// pw.println(re + 1);
return re + 1;
}
long gcd = Main.gcd(a, b);
if (gcd == 1) {
long sa = a - b;
if (sa == 1) {
return re + b;
}
long min = a % sa;
for (long i = 2; i * i <= sa; i++) {
if (sa % i == 0) {
min = Math.min(min, a % i);
min = Math.min(min, a % (sa / i));
}
}
re += min;
a -= min;
b -= min;
} else {
// nowgcd = gcd;
re++;
a = a / gcd - 1;
b = b / gcd - 1;
}
}
return re;
}
public static long countNext(long a, long b) {
long re = -1;
long min = 1;
long max = b - 1;
while (min <= max) {
long mid = (min + max) / 2;
if ((a - mid) / (b - mid) > 1) {
re = mid;
min = mid + 1;
} else {
max = mid - 1;
}
}
return re;
}
public static int countTime(int max, int min, int i) {
int times = max / i + i - 1;
if (max % i != 0) {
times++;
}
if (min <= i) {
times++;
} else {
times = times + min / i;
if (min % i != 0) {
times++;
}
}
return times;
}
public static boolean check(long s, long l, long k, long m, long n, long v) {
if ((s - 1) / m != (s + l - 2) / m) {
return false;
}
if (s + (k - 1) * m > n * m) {
return false;
}
long temp = (s + s + (k - 1) * m) * k / 2;
long temp2 = (temp + temp + (l - 1) * k) * l / 2;
if (temp2 != v) {
return false;
}
return true;
}
public static double result(int x[], int x1, int x2, int x3) {
return 1.0 / (x[x1] * x[x2]) + 1.0 / (x[x2] * x[x3]) + 1.0 / (x[x1] * x[x3]);
}
public static int[] toArray(int temp, int n) {
List<Integer> list = new ArrayList<Integer>();
while (temp > 0) {
list.add(temp % 2);
temp /= 2;
}
int re[] = new int[n];
for (int i = 0; i < list.size(); i++) {
re[i] = list.get(i);
}
return re;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static boolean make_so(long[] as, long[] ms) {
while (true) {
boolean updated = false;
for (int fst = 0; fst < ms.length; fst++) {
for (int snd = fst + 1; snd < ms.length; snd++) {
long gcd = gcd(ms[fst], ms[snd]);
if (gcd == 1) {
continue;
}
updated = true;
if (as[fst] % gcd != as[snd] % gcd) {
return false;
}
ms[fst] /= gcd;
ms[snd] /= gcd;
while (true) {
long gt = gcd(ms[fst], gcd);
if (gt == 1) {
break;
}
ms[fst] *= gt;
gcd /= gt;
}
ms[snd] *= gcd;
as[fst] %= ms[fst];
as[snd] %= ms[snd];
}
}
if (!updated) {
break;
}
}
return true;
}
public static long mod_pow(long a, long e, long m) {
if (e == 0) {
return 1;
} else if (e % 2 == 0) {
long ret = mod_pow(a, e / 2, m);
return (ret * ret) % m;
} else {
return (mod_pow(a, e - 1, m) * a) % m;
}
}
// a and m must be co-prime.
public static long mod_inv(long a, long m) {
return (a == 1 ? 1 : (1 - m * mod_inv(m % a, a)) / a + m);
}
// O(N^2). ms[i] は互いに素でなくてはならない.
// Π(ms[i]) がオーバーフローする場合でも, 最後に適切に MOD を取れば OK
public static long chinese_remainder(long[] as, long[] ms, long MOD) {
long[] vs = new long[ms.length];
long[] sums = new long[ms.length];
long[] invs = new long[ms.length];
for (int i = 0; i < ms.length; i++) {
invs[i] = 1; // mod(ms[i]) の中で 1 / (ms[0] * ms[1] ... ms[i - 1]) を求める
sums[i] = as[i]; // mod(ms[i]) の中で, a[i] - v[0] - v[1]ms[0] ... を求める
long mult = 1; // mod(ms[i]) の中で, ms[0] * ... * ms[i - 2] を求める
for (int j = 0; j < i; j++) {
sums[i] -= (vs[j] * mult) % ms[i];
if (sums[i] < 0) {
sums[i] += ms[i];
}
invs[i] = (invs[i] * mod_inv(ms[j], ms[i])) % ms[i];
mult = (mult * ms[j]) % ms[i];
}
vs[i] = (sums[i] * invs[i]) % ms[i];
}
// MOD を取る前に x = 0 かどうかを知る場合, ここで ∀i.(vs[i] == 0) チェック
{
boolean flg = true;
for (final long v : vs) {
if (v != 0) {
flg = false;
break;
}
}
if (flg) { // ここに来るなら 全ての条件を x = 0 で満たす.
return 0; // 正整数が欲しいなら、Π(ms[i]) の MOD が答え
}
}
long ret = 0;
for (int i = 0; i < ms.length; i++) {
long mult = 1;
for (int j = 0; j < i; j++) {
mult *= ms[j];
mult %= MOD;
}
ret += (vs[i] * mult) % MOD;
ret %= MOD;
}
return ret;
}
public static long mulity(long l, int a[]) {
for (int i = 0; i < a.length; i++) {
if (l % a[i] == 0) {
l /= a[i];
a[i] = 1;
}
}
return l;
}
public static int[][] reverse(int a[][]) {
int b[][] = new int[2][2];
b[0][0] = a[1][0];
b[0][1] = a[0][0];
b[1][0] = a[1][1];
b[1][1] = a[0][1];
return b;
}
public static void add(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (ts.contains(value)) {
map.put(value, map.get(value) + 1);
} else {
ts.add(value);
map.put(value, 1);
}
}
public static void remove(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (map.get(value) == 1) {
ts.remove(value);
map.remove(value);
} else {
map.put(value, map.get(value) - 1);
}
}
public static int merge(int n, int m, int e) {
int merge = (n * (n - 1) / 2 - 2 * m) * e * 3 / 200;
if ((n - 2 * m) * e % 100 != 0) {
merge++;
}
return Math.max(3, merge);
}
public static boolean isMerge(int n, int m, int e, int count, int now) {
int merge = merge(n, m, e);
if (Math.abs(count - now) <= merge) {
return true;
}
return false;
}
public static void setall(Set<Integer> set, int x) {
if (x < 10) {
set.add(x);
return;
}
int to = 0;
int one[] = new int[4];
while (x > 0) {
one[to] = x % 10;
x /= 10;
to++;
}
Main.permutation(one, 0, to - 1, set);
}
// mod. m での a の逆元 a^{-1} を計算する
public static long modinv(long a, long m) {
long b = m, u = 1, v = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
long temp = a;
a = b;
b = temp;
u -= t * v;
temp = u;
u = v;
v = temp;
}
u %= m;
if (u < 0)
u += m;
return u;
}
public long re(long n) {
if ((n % 6 == 1 || n % 6 == 5) && n > 1) {
n--;
}
if (map.containsKey(n)) {
return map.get(n);
}
long t1 = re(n / 2);
long t2 = re(n / 3);
map.put(n / 2, t1);
map.put(n / 3, t2);
return t1 + t2;
}
public static long distance(Point s, Point e) {
return (s.x - e.x) * (s.x - e.x) + (s.y - e.y) * (s.y - e.y);
}
public static int lowerBound(Integer[] a, int obj) {
int l = 0, r = a.length - 1;
while (r - l >= 0) {
int c = (l + r) / 2;
if (obj <= a[c]) {
r = c - 1;
} else {
l = c + 1;
}
}
return l;
}
public static long countRe(int high, int used[], long now, long min, long b[]) {
long re = Long.MAX_VALUE;
long temp = min;
for (int i = high; i >= 0; i--) {
if (used[i] == 0 && temp < now) {
temp += b[i];
if (temp >= now) {
re = Math.min(re, temp);
temp -= b[i];
}
}
}
if (re == Long.MAX_VALUE) {
re = min;
}
return re;
}
public static void swap(int[] s, int i, int j) {
int tmp = s[i];
s[i] = s[j];
s[j] = tmp;
}
public static void permutation(int[] s, int from, int to, Set<Integer> set) {
if (to <= 0)
return;
if (from == to) {
check(s, set, to);
} else {
for (int i = from; i <= to; i++) {
swap(s, i, from);
permutation(s, from + 1, to, set);
swap(s, from, i);
}
}
}
public static void check(int[] s, Set<Integer> set, int to) {
int temp = 0;
for (int i = 0; i <= to; i++) {
temp *= 10;
temp += s[i];
}
set.add(temp);
}
public static long anothertoTen(long ano, int another) {
long ten = 0;
long now = 1;
long temp = ano;
while (temp > 0) {
long i = temp % 10;
ten += now * i;
now *= another;
temp /= 10;
}
return ten;
}
public static long tentoAnother(long ten, int another) {
Stack<Long> stack = new Stack<Long>();
while (ten > 0) {
stack.add(ten % another);
ten /= another;
}
long re = 0;
while (!stack.isEmpty()) {
long pop = stack.pop();
re = re * 10 + pop;
}
return re;
}
// 2C5 = 5*4/(2*1)
public static long fastXCY(long tempx, long temp) {
tempx = tempx % MOD;
temp %= MOD;
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
// 2C5 = 5*4/(2*1)
public static long XCY(long x, long y) {
long temp = 1;
for (int i = 0; i < x; i++) {
temp = (temp * (y - i)) % MOD;
}
long tempx = 1;
for (int i = 2; i <= x; i++) {
tempx = (tempx * i) % MOD;
}
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
static long modpow(long N, Long K) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(MOD)).longValue();
}
static long modpow(long N, Long K, long mod) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(mod)).longValue();
}
public static int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a < b) {
return gcd(b, a);
}
return gcd(b, a % b);
}
}
class PointEx implements Comparable<PointEx> {
String s;
int index = 0;
public PointEx(String t, int i) {
s = new String(t);
index = i;
}
@Override
public int compareTo(PointEx o) {
return this.s.compareTo(o.s);
}
}
class Node implements Comparable<Node> {
int tyoten;
long minDistance;
public Node(int t, long m) {
tyoten = t;
minDistance = m;
}
@Override
public int compareTo(Node o) {
int res = -1;
if (this.minDistance - o.minDistance >= 0) {
res = 1;
}
return res;
}
}
class Vertex {
String key;
Vertex(String key) {
this.key = key;
}
}
class Edge {
Vertex start;
Vertex end;
long key;
Edge(Vertex start, Vertex end, long key) {
this.start = start;
this.end = end;
this.key = key;
}
}
class Target {
int s;
int e;
long c;
}
class Point extends Object implements Comparable {
int x;
int y;
public Point() {
}
public Point(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object j) {
Point p = (Point) j;
if (p.x == this.x && p.y == this.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
return (int) this.x + (int) this.y;
}
public int compareTo(Object p) {
Point t = (Point) p;
if (t.x != this.x) {
return this.x - t.x;
}
return this.y - t.y;
}
}
class PointX implements Comparable {
long a;
long b;
public PointX(long x, long y) {
a = x;
b = y;
}
public int compareTo(Object p) {
PointX t = (PointX) p;
if (this.a < t.a) {
return -1;
}
if (this.a > t.a) {
return 1;
}
return 0;
}
public boolean equals(Object p) {
PointX t = (PointX) p;
return this.a == t.a && this.b == t.b;
}
}
class PointTemp {
int x;
int y;
int nx;
int ny;
public PointTemp(int tx, int ty, int tnx, int tny) {
x = tx;
y = ty;
nx = tnx;
ny = tny;
}
public String print() {
StringBuffer sb = new StringBuffer();
sb.append(x + " ");
sb.append(y + " ");
sb.append(nx + " ");
sb.append(ny + " ");
return sb.toString();
}
}
class FastPrintStream implements AutoCloseable {
private static final int BUF_SIZE = 1 << 15;
private final byte[] buf = new byte[BUF_SIZE];
private int ptr = 0;
private final java.lang.reflect.Field strField;
private final java.nio.charset.CharsetEncoder encoder;
private java.io.OutputStream out;
public FastPrintStream(java.io.OutputStream out) {
this.out = out;
java.lang.reflect.Field f;
try {
f = java.lang.String.class.getDeclaredField("value");
// f.setAccessible(true);
} catch (NoSuchFieldException | SecurityException e) {
f = null;
}
this.strField = f;
this.encoder = java.nio.charset.StandardCharsets.US_ASCII.newEncoder();
}
public FastPrintStream(java.io.File file) throws java.io.IOException {
this(new java.io.FileOutputStream(file));
}
public FastPrintStream(java.lang.String filename) throws java.io.IOException {
this(new java.io.File(filename));
}
public FastPrintStream() {
this(System.out);
try {
java.lang.reflect.Field f = java.io.PrintStream.class.getDeclaredField("autoFlush");
// f.setAccessible(true);
f.set(System.out, false);
} catch (IllegalAccessException | IllegalArgumentException | NoSuchFieldException e) {
// ignore
}
}
public FastPrintStream println() {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) '\n';
return this;
}
public FastPrintStream println(java.lang.Object o) {
return print(o).println();
}
public FastPrintStream println(java.lang.String s) {
return print(s).println();
}
public FastPrintStream println(char[] s) {
return print(s).println();
}
public FastPrintStream println(char c) {
return print(c).println();
}
public FastPrintStream println(int x) {
return print(x).println();
}
public FastPrintStream println(long x) {
return print(x).println();
}
public FastPrintStream println(double d, int precision) {
return print(d, precision).println();
}
private FastPrintStream print(byte[] bytes) {
int n = bytes.length;
if (ptr + n > BUF_SIZE) {
internalFlush();
try {
out.write(bytes);
} catch (java.io.IOException e) {
throw new RuntimeException();
}
} else {
System.arraycopy(bytes, 0, buf, ptr, n);
ptr += n;
}
return this;
}
public FastPrintStream print(java.lang.Object o) {
return print(o.toString());
}
public FastPrintStream print(java.lang.String s) {
if (strField == null) {
return print(s.getBytes());
} else {
try {
return print((byte[]) strField.get(s));
} catch (IllegalAccessException e) {
return print(s.getBytes());
}
}
}
public FastPrintStream print(char[] s) {
try {
return print(encoder.encode(java.nio.CharBuffer.wrap(s)).array());
} catch (java.nio.charset.CharacterCodingException e) {
byte[] bytes = new byte[s.length];
for (int i = 0; i < s.length; i++) {
bytes[i] = (byte) s[i];
}
return print(bytes);
}
}
public FastPrintStream print(char c) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) c;
return this;
}
public FastPrintStream print(int x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(long x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(double d, int precision) {
if (d < 0) {
print('-');
d = -d;
}
d += Math.pow(10, -d) / 2;
print((long) d).print('.');
d -= (long) d;
for (int i = 0; i < precision; i++) {
d *= 10;
print((int) d);
d -= (int) d;
}
return this;
}
private void internalFlush() {
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void flush() {
try {
out.write(buf, 0, ptr);
out.flush();
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void close() {
try {
out.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
private static int len(int x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
int p = -10;
for (int i = 1; i < 10; i++, p *= 10)
if (x > p)
return i + d;
return 10 + d;
}
private static int len(long x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
long p = -10;
for (int i = 1; i < 19; i++, p *= 10)
if (x > p)
return i + d;
return 19 + d;
}
}
class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[2048];
private int ptr = 0;
private int buflen = 0;
public FastScanner(java.io.InputStream in) {
this.in = in;
}
public FastScanner() {
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen)
return true;
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
return buflen > 0;
}
private int readByte() {
return hasNextByte() ? buf[ptr++] : -1;
}
public boolean hasNext() {
while (hasNextByte() && !(32 < buf[ptr] && buf[ptr] < 127))
ptr++;
return hasNextByte();
}
private StringBuilder nextSequence() {
if (!hasNext())
throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
for (int b = readByte(); 32 < b && b < 127; b = readByte()) {
sb.appendCodePoint(b);
}
return sb;
}
public String next() {
return nextSequence().toString();
}
public String next(int len) {
return new String(nextChars(len));
}
public char nextChar() {
if (!hasNextByte())
throw new java.util.NoSuchElementException();
return (char) readByte();
}
public char[] nextChars() {
StringBuilder sb = nextSequence();
int l = sb.length();
char[] dst = new char[l];
sb.getChars(0, l, dst, 0);
return dst;
}
public char[] nextChars(int len) {
if (!hasNext())
throw new java.util.NoSuchElementException();
char[] s = new char[len];
int i = 0;
int b = readByte();
while (32 < b && b < 127 && i < len) {
s[i++] = (char) b;
b = readByte();
}
if (i != len) {
throw new java.util.NoSuchElementException(
String.format("Next token has smaller length than expected.", len));
}
return s;
}
public long nextLong() {
if (!hasNext())
throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b)
throw new NumberFormatException();
while (true) {
if ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
} else if (b == -1 || !(32 < b && b < 127)) {
return minus ? -n : n;
} else
throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() {
return Math.toIntExact(nextLong());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
in.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(int n, java.util.function.BinaryOperator<S> op, S e) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e) {
this(dat.length, op, e);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1)
sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1)
sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
S sum = E;
do {
l >>= Long.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N)
return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return -1;
}
int x = leader(a);
int y = leader(b);
if (x == y)
return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return false;
}
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n)) {
return -1;
}
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
return result;
}
}
| ConDefects/ConDefects/Code/abc319_e/Java/45414073 |
condefects-java_data_1264 | import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
try (final Scanner sc = new Scanner(System.in)) {
final int N = Integer.parseInt(sc.next());
final int M = Integer.parseInt(sc.next());
final Map<Integer, HashSet<Integer>> canGo = new HashMap<>();
for (int i = 0; i < M; i++) {
final int A = Integer.parseInt(sc.next());
final int B = Integer.parseInt(sc.next());
if (canGo.containsKey(A)) {
HashSet<Integer> newList = canGo.get(A);
newList.add(B);
canGo.put(A, newList);
if (canGo.containsKey(B)) {
newList = canGo.get(B);
newList.add(A);
canGo.put(B, newList);
} else {
newList = new HashSet<>();
newList.add(A);
canGo.put(B, newList);
}
} else {
HashSet<Integer> newList = new HashSet<>();
newList.add(B);
canGo.put(A, newList);
if (canGo.containsKey(B)) {
newList = canGo.get(B);
newList.add(A);
canGo.put(B, newList);
} else {
newList = new HashSet<>();
newList.add(A);
canGo.put(B, newList);
}
}
}
for (int i = 1; i <= N; i++) {
if (canGo.containsKey(i)) {
final List<Integer> ansArray = new ArrayList<>();
for (final int j : canGo.get(i)) {
ansArray.add(j);
}
final int ansSize = canGo.get(i).size();
System.out.print(ansSize + " ");
for (int j = 0; j < ansSize; j++) {
System.out.print(ansArray.get(j) + " ");
}
System.out.println();
} else {
System.out.println(0);
}
}
}
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
try (final Scanner sc = new Scanner(System.in)) {
final int N = Integer.parseInt(sc.next());
final int M = Integer.parseInt(sc.next());
final Map<Integer, HashSet<Integer>> canGo = new HashMap<>();
for (int i = 0; i < M; i++) {
final int A = Integer.parseInt(sc.next());
final int B = Integer.parseInt(sc.next());
if (canGo.containsKey(A)) {
HashSet<Integer> newList = canGo.get(A);
newList.add(B);
canGo.put(A, newList);
if (canGo.containsKey(B)) {
newList = canGo.get(B);
newList.add(A);
canGo.put(B, newList);
} else {
newList = new HashSet<>();
newList.add(A);
canGo.put(B, newList);
}
} else {
HashSet<Integer> newList = new HashSet<>();
newList.add(B);
canGo.put(A, newList);
if (canGo.containsKey(B)) {
newList = canGo.get(B);
newList.add(A);
canGo.put(B, newList);
} else {
newList = new HashSet<>();
newList.add(A);
canGo.put(B, newList);
}
}
}
for (int i = 1; i <= N; i++) {
if (canGo.containsKey(i)) {
final List<Integer> ansArray = new ArrayList<>();
for (final int j : canGo.get(i)) {
ansArray.add(j);
}
Collections.sort(ansArray);
final int ansSize = canGo.get(i).size();
System.out.print(ansSize + " ");
for (int j = 0; j < ansSize; j++) {
System.out.print(ansArray.get(j) + " ");
}
System.out.println();
} else {
System.out.println(0);
}
}
}
}
}
| ConDefects/ConDefects/Code/abc276_b/Java/44905497 |
condefects-java_data_1265 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
String[] grid = new String[h];
for(int i = 0; i < h; i++) {
grid[i] = sc.next();
}
boolean[][] visited = new boolean [h][w];
for (int i = 0; i < h; i++) {
Arrays.fill(visited[i],false);
}
if (grid[0].charAt(0) != 's') {
System.out.println("Yes");
return ;
}
System.out.println(dfs(grid,0,0,visited,grid[0].charAt(0)) ? "Yes" : "No");
sc.close();
}
static boolean dfs(String[] grid,int ny,int nx,boolean[][] visited,char nowchar) {
boolean flag = false;
if (ny == grid.length - 1 && nx == grid[0].length() - 1) return true;
if(visited[ny][nx]) return false;
visited[ny][nx] = true;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if(Math.abs(i * j) == 1) continue;
if (isOutOfGrid(grid.length,grid[0].length(),i,j,new XYAndLetter(ny, nx, nowchar)) || !isValidChar(nowchar,grid[ny + i].charAt(nx + j))) continue;
flag |= dfs(grid, ny + i, nx + j, visited, grid[ny + i].charAt(nx + j));
}
}
//visited[ny][nx] = false;
return flag;
}
static boolean isOutOfGrid(int h,int w,int i,int j,XYAndLetter xyl) {
return xyl.getX() + j < 0 || xyl.getX() + j >= w || xyl.getY() + i < 0 || xyl.getY() + i >= h;
}
static boolean isValidChar(char now,char nxt) {
return (now == 's' && nxt == 'n') || (now == 'n' && nxt == 'u') || (now == 'u' && nxt == 'k') || (now == 'k' && nxt == 'e') || (now == 'e' && nxt == 's');
}
}
class XYAndLetter {
private final int y;
private final int x;
private final char snuke;
XYAndLetter(int y,int x,char snuke) {
this.y = y;
this.x = x;
this.snuke = snuke;
}
public int getY() {
return this.y;
}
public int getX() {
return this.x;
}
public char getsnuke() {
return this.snuke;
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
String[] grid = new String[h];
for(int i = 0; i < h; i++) {
grid[i] = sc.next();
}
boolean[][] visited = new boolean [h][w];
for (int i = 0; i < h; i++) {
Arrays.fill(visited[i],false);
}
if (grid[0].charAt(0) != 's') {
System.out.println("No");
return ;
}
System.out.println(dfs(grid,0,0,visited,grid[0].charAt(0)) ? "Yes" : "No");
sc.close();
}
static boolean dfs(String[] grid,int ny,int nx,boolean[][] visited,char nowchar) {
boolean flag = false;
if (ny == grid.length - 1 && nx == grid[0].length() - 1) return true;
if(visited[ny][nx]) return false;
visited[ny][nx] = true;
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if(Math.abs(i * j) == 1) continue;
if (isOutOfGrid(grid.length,grid[0].length(),i,j,new XYAndLetter(ny, nx, nowchar)) || !isValidChar(nowchar,grid[ny + i].charAt(nx + j))) continue;
flag |= dfs(grid, ny + i, nx + j, visited, grid[ny + i].charAt(nx + j));
}
}
//visited[ny][nx] = false;
return flag;
}
static boolean isOutOfGrid(int h,int w,int i,int j,XYAndLetter xyl) {
return xyl.getX() + j < 0 || xyl.getX() + j >= w || xyl.getY() + i < 0 || xyl.getY() + i >= h;
}
static boolean isValidChar(char now,char nxt) {
return (now == 's' && nxt == 'n') || (now == 'n' && nxt == 'u') || (now == 'u' && nxt == 'k') || (now == 'k' && nxt == 'e') || (now == 'e' && nxt == 's');
}
}
class XYAndLetter {
private final int y;
private final int x;
private final char snuke;
XYAndLetter(int y,int x,char snuke) {
this.y = y;
this.x = x;
this.snuke = snuke;
}
public int getY() {
return this.y;
}
public int getX() {
return this.x;
}
public char getsnuke() {
return this.snuke;
}
}
| ConDefects/ConDefects/Code/abc308_d/Java/43214878 |
condefects-java_data_1266 | import java.io.*;
import java.util.*;
public class Main {
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens())
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int[] readArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
long nextLong() {
return Long.parseLong(next());
}
}
static LinkedList<Pair> queue;
static boolean[][] used;
static char[][] cnt;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
queue = new LinkedList<>();
used = new boolean[n+2][m+2];
cnt = new char[n+2][m+2];
for(int i = 1;i<=n;i++) {
String s = sc.next();
for(int j = 0;j<m;j++) {
char ch = s.charAt(j);
cnt[i][j+1] = ch;
}
}
// for(int i = 0;i<n+2;i++) {
// for(int j = 0;j<m+2;j++) {
// out.print(cnt[i][j]);
// }
// out.println();
// }
if(cnt[1][1] == 's') {
queue.add(new Pair(1, 1));
}
else {
out.println("No");
out.close();
return;
}
HashMap<Character, Character> map = new HashMap<>();
map.put('s', 'n');
map.put('n', 'u');
map.put('u', 'k');
map.put('k', 'e');
map.put('e', 's');
while (!queue.isEmpty()) {
Pair v = queue.getFirst();
char cur = map.get(cnt[v.i][v.j]);
queue.removeFirst();
if(cnt[v.i][v.j+1] == cur && !used[v.i][v.j+1]) {
used[v.i][v.j+1] = true;
queue.add(new Pair(v.i, v.j+1));
}
if(cnt[v.i][v.j-1] == cur && !used[v.i][v.j-1]) {
used[v.i][v.j-1] = true;
queue.add(new Pair(v.i, v.j-1));
}
if(cnt[v.i+1][v.j] == cur && !used[v.i+1][v.j]) {
used[v.i+1][v.j] = true;
queue.add(new Pair(v.i+1, v.j));
}
if(cnt[v.i-1][v.j] == cur && !used[v.i-1][v.j]) {
used[v.i-1][v.j] = true;
queue.add(new Pair(v.i-1, v.j));
}
}
System.out.println(used[n-1][m-1] ? "Yes" : "No");
out.close();
}
}
class Pair {
int i;
int j;
public Pair(int i, int j) {
this.i = i;
this.j = j;
}
}
import java.io.*;
import java.util.*;
public class Main {
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
String next() {
while (!st.hasMoreTokens())
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int[] readArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
long nextLong() {
return Long.parseLong(next());
}
}
static LinkedList<Pair> queue;
static boolean[][] used;
static char[][] cnt;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt();
int m = sc.nextInt();
queue = new LinkedList<>();
used = new boolean[n+2][m+2];
cnt = new char[n+2][m+2];
for(int i = 1;i<=n;i++) {
String s = sc.next();
for(int j = 0;j<m;j++) {
char ch = s.charAt(j);
cnt[i][j+1] = ch;
}
}
// for(int i = 0;i<n+2;i++) {
// for(int j = 0;j<m+2;j++) {
// out.print(cnt[i][j]);
// }
// out.println();
// }
if(cnt[1][1] == 's') {
queue.add(new Pair(1, 1));
}
else {
out.println("No");
out.close();
return;
}
HashMap<Character, Character> map = new HashMap<>();
map.put('s', 'n');
map.put('n', 'u');
map.put('u', 'k');
map.put('k', 'e');
map.put('e', 's');
while (!queue.isEmpty()) {
Pair v = queue.getFirst();
char cur = map.get(cnt[v.i][v.j]);
queue.removeFirst();
if(cnt[v.i][v.j+1] == cur && !used[v.i][v.j+1]) {
used[v.i][v.j+1] = true;
queue.add(new Pair(v.i, v.j+1));
}
if(cnt[v.i][v.j-1] == cur && !used[v.i][v.j-1]) {
used[v.i][v.j-1] = true;
queue.add(new Pair(v.i, v.j-1));
}
if(cnt[v.i+1][v.j] == cur && !used[v.i+1][v.j]) {
used[v.i+1][v.j] = true;
queue.add(new Pair(v.i+1, v.j));
}
if(cnt[v.i-1][v.j] == cur && !used[v.i-1][v.j]) {
used[v.i-1][v.j] = true;
queue.add(new Pair(v.i-1, v.j));
}
}
out.println(used[n][m] ? "Yes" : "No");
out.close();
}
}
class Pair {
int i;
int j;
public Pair(int i, int j) {
this.i = i;
this.j = j;
}
} | ConDefects/ConDefects/Code/abc308_d/Java/49353883 |
condefects-java_data_1267 | import java.io.*;
import java.util.*;
public class Main implements Runnable {
static final int MOD = 998244353;
private static void solve(MyScanner in, PrintWriter out) {
long A1 = in.nextLong();
long A2 = in.nextLong();
long A3 = in.nextLong();
if (A2 < A1) {
long temp = A2;
A2 = A1;
A1 = temp;
}
long a1 = exp(10, A1 - 1);
long a2 = exp(10, A2 - 1);
long a3 = exp(10, A3 - 1);
if (A2 == A3) {
if (A1 == A2) {
long res = (1 + a3 * 8) % MOD * a3 * 8 % MOD * inv(2) % MOD;
out.println(res);
}
else {
long res = (a2 * 9 - (a1 * 10 - 1) + a2 * 9 - (a1)) % MOD * a1 * 9 % MOD * inv(2) % MOD;
res = (res + MOD) % MOD;
out.println(res);
}
}
else if (A2 + 1 == A3) {
if (A1 == A2) {
long res = (a2 * 9 + a2) % MOD * (a2 * 8 + 1) % MOD * inv(2) % MOD;
res = (res + (a2 * 9) % MOD * (a2 - 1)) % MOD;
res = (res + 1) % MOD;
out.println(res);
}
else {
long res = ((a1 * 10 - 1) + a1) % MOD * a1 * 9 % MOD * inv(2) % MOD;
out.println(res);
}
}
else out.println(0);
}
static long inv(long n) {
return exp(n, MOD - 2);
}
static long exp(long n, long k) {
long res = 1;
for (long i = k; i > 0; i >>= 1) {
if ((i & 1) == 1) res = (res * n) % MOD;
n = (n * n) % MOD;
}
return res;
}
public static void main(String[] args) {
new Thread(null, new Main(), "Main", 1 << 28).start();
}
public void run() {
MyScanner in = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
// int t = 1;
while (t-- > 0) solve(in, out);
out.close();
}
//-----------MyScanner class for faster input----------
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
//--------------------------------------------------------
}
import java.io.*;
import java.util.*;
public class Main implements Runnable {
static final int MOD = 998244353;
private static void solve(MyScanner in, PrintWriter out) {
long A1 = in.nextLong();
long A2 = in.nextLong();
long A3 = in.nextLong();
if (A2 < A1) {
long temp = A2;
A2 = A1;
A1 = temp;
}
long a1 = exp(10, A1 - 1);
long a2 = exp(10, A2 - 1);
long a3 = exp(10, A3 - 1);
if (A2 == A3) {
if (A1 == A2) {
long res = (1 + a3 * 8) % MOD * a3 * 8 % MOD * inv(2) % MOD;
out.println(res);
}
else {
long res = (a2 * 9 - (a1 * 10 - 1) + a2 * 9 - (a1)) % MOD * a1 * 9 % MOD * inv(2) % MOD;
res = (res + MOD) % MOD;
out.println(res);
}
}
else if (A2 + 1 == A3) {
if (A1 == A2) {
long res = (a2 * 9 + a2) % MOD * (a2 * 8 + 1) % MOD * inv(2) % MOD;
res = (res + (a2 * 9) % MOD * (a2 - 1)) % MOD;
res = (res + MOD) % MOD;
out.println(res);
}
else {
long res = ((a1 * 10 - 1) + a1) % MOD * a1 * 9 % MOD * inv(2) % MOD;
out.println(res);
}
}
else out.println(0);
}
static long inv(long n) {
return exp(n, MOD - 2);
}
static long exp(long n, long k) {
long res = 1;
for (long i = k; i > 0; i >>= 1) {
if ((i & 1) == 1) res = (res * n) % MOD;
n = (n * n) % MOD;
}
return res;
}
public static void main(String[] args) {
new Thread(null, new Main(), "Main", 1 << 28).start();
}
public void run() {
MyScanner in = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
int t = in.nextInt();
// int t = 1;
while (t-- > 0) solve(in, out);
out.close();
}
//-----------MyScanner class for faster input----------
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
//--------------------------------------------------------
}
| ConDefects/ConDefects/Code/arc178_b/Java/53675333 |
condefects-java_data_1268 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var t = sc.nextInt();
var a = new int[t];
var b = new int[t];
var c = new int[t];
for (var i = 0; i < t; i++) {
a[i] = sc.nextInt();
b[i] = sc.nextInt();
c[i] = sc.nextInt();
}
sc.close();
var sb = new StringBuilder();
for (var i = 0; i < t; i++) {
var min = Math.min(a[i], b[i]);
var max = Math.max(a[i], b[i]);
var result = calc(min, max, c[i]);
sb.append(result);
sb.append("\r\n");
}
System.out.println(sb.toString());
}
private static int calc(int a, int b, int c) {
var result = 0;
var mc = new Main().new ModCalc();
var ca = mc.multiply(9, mc.pow(10, a - 1));
var cb = mc.multiply(9, mc.pow(10, b - 1));
var v = 0;
if (a == b) {
var v1 = 0;
var v2 = calc2(mc, mc.subtract(ca, mc.pow(10, a - 1)));
var v3 = mc.add(v1, v2);
v = v3;
//System.out.printf("%d %d %d %d %d\r\n", ca, cb, v1, v2, v3);
} else {
var v1 = mc.multiply(mc.subtract(cb, mc.add(ca, 1)), ca);
var v2 = calc2(mc, ca);
var v3 = mc.add(v1, v2);
v = v3;
//System.out.printf("%d %d %d %d %d\r\n", ca, cb, v1, v2, v3);
}
if (c == b) {
result = v;
} else if (c == b + 1) {
result = mc.subtract(mc.multiply(ca, cb), v);
}
return result;
}
private static int calc2(ModCalc mc, int a) {
return mc.divide(mc.multiply(a, mc.add(a, 1)), 2);
}
public class ModCalc {
private int mod = 998244353;
public ModCalc() {
}
public ModCalc(int mod) {
this.mod = mod;
}
public int add(int a, int b) {
return (int) (((long) a + b) % mod);
}
public int subtract(int a, int b) {
return add((int) (((long) a - b) % mod), mod);
}
public int multiply(int a, int b) {
return add((int) (((long) a * b) % mod), mod);
}
public int multiply(int... a) {
int result = 1;
for (var a1 : a) {
result = multiply(result, a1);
}
return result;
}
public int divide(int a, int b) {
return multiply(a, pow(b, mod - 2));
}
public int pow(int n, int k) {
if (k == 0) {
return 1;
} else if (k % 2 == 0) {
int p = pow(n, k / 2);
return multiply(p, p);
} else {
int p = pow(n, (k - 1) / 2);
return multiply(multiply(p, p), n);
}
}
public int combine(int n, int k) {
int sum1 = 1;
int sum2 = 1;
for (int i = 0; i < k; i++) {
sum1 = multiply(sum1, n - i);
sum2 = multiply(sum2, i + 1);
}
return divide(sum1, sum2);
}
public int factorial(int n) {
int result = 1;
for (int i = 0; i < n; i++) {
result = multiply(result, i + 1);
}
return result;
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var t = sc.nextInt();
var a = new int[t];
var b = new int[t];
var c = new int[t];
for (var i = 0; i < t; i++) {
a[i] = sc.nextInt();
b[i] = sc.nextInt();
c[i] = sc.nextInt();
}
sc.close();
var sb = new StringBuilder();
for (var i = 0; i < t; i++) {
var min = Math.min(a[i], b[i]);
var max = Math.max(a[i], b[i]);
var result = calc(min, max, c[i]);
sb.append(result);
sb.append("\r\n");
}
System.out.println(sb.toString());
}
private static int calc(int a, int b, int c) {
var result = 0;
var mc = new Main().new ModCalc();
var ca = mc.multiply(9, mc.pow(10, a - 1));
var cb = mc.multiply(9, mc.pow(10, b - 1));
var v = 0;
if (a == b) {
var v1 = 0;
var v2 = calc2(mc, mc.subtract(ca, mc.pow(10, a - 1)));
var v3 = mc.add(v1, v2);
v = v3;
//System.out.printf("%d %d %d %d %d\r\n", ca, cb, v1, v2, v3);
} else {
var v1 = mc.multiply(mc.subtract(cb, mc.pow(10, a)), ca);
var v2 = calc2(mc, ca);
var v3 = mc.add(v1, v2);
v = v3;
//System.out.printf("%d %d %d %d %d\r\n", ca, cb, v1, v2, v3);
}
if (c == b) {
result = v;
} else if (c == b + 1) {
result = mc.subtract(mc.multiply(ca, cb), v);
}
return result;
}
private static int calc2(ModCalc mc, int a) {
return mc.divide(mc.multiply(a, mc.add(a, 1)), 2);
}
public class ModCalc {
private int mod = 998244353;
public ModCalc() {
}
public ModCalc(int mod) {
this.mod = mod;
}
public int add(int a, int b) {
return (int) (((long) a + b) % mod);
}
public int subtract(int a, int b) {
return add((int) (((long) a - b) % mod), mod);
}
public int multiply(int a, int b) {
return add((int) (((long) a * b) % mod), mod);
}
public int multiply(int... a) {
int result = 1;
for (var a1 : a) {
result = multiply(result, a1);
}
return result;
}
public int divide(int a, int b) {
return multiply(a, pow(b, mod - 2));
}
public int pow(int n, int k) {
if (k == 0) {
return 1;
} else if (k % 2 == 0) {
int p = pow(n, k / 2);
return multiply(p, p);
} else {
int p = pow(n, (k - 1) / 2);
return multiply(multiply(p, p), n);
}
}
public int combine(int n, int k) {
int sum1 = 1;
int sum2 = 1;
for (int i = 0; i < k; i++) {
sum1 = multiply(sum1, n - i);
sum2 = multiply(sum2, i + 1);
}
return divide(sum1, sum2);
}
public int factorial(int n) {
int result = 1;
for (int i = 0; i < n; i++) {
result = multiply(result, i + 1);
}
return result;
}
}
}
| ConDefects/ConDefects/Code/arc178_b/Java/53678734 |
condefects-java_data_1269 | import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.TreeSet;
public class Main {
static long MOD = 998244353;
int min = Integer.MAX_VALUE;
int max = 0;
int count = 0;
int pattern = 0;
int k = 0;
Map<Long, Long> map = new HashMap<Long, Long>();
public static void main(String[] args) throws Exception {
// FileInputStream fis = new FileInputStream(new File("t.a"));
var sc = new FastScanner();
// Scanner sc = new Scanner(System.in);
// var sc = new FastScanner(fis);
// var pw = new FastPrintStream("t.y");
var pw = new FastPrintStream();
solve(sc, pw);
sc.close();
pw.flush();
pw.close();
}
static class S {
static final S E = new S(0);
long sum;
public S(long s) {
this.sum = s;
}
public static S op(S l, S r) {
return new S(l.sum);
}
public String toString() {
return String.valueOf(sum);
}
}
static class F {
static final F I = new F(0);
long a;
public F(long a) {
this.a = a;
}
public static F composite(F f, F g) {
return new F(f.a + g.a);
}
}
static S map(F f, S s) {
return new S(f.a + s.sum);
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int times = sc.nextInt();
for (int time = 0; time < times; time++) {
long n = sc.nextLong();
long now = 10;
long re = 1;
while (now <= n / now) {
re += Math.max(0, Math.min(n, now * now + now) - now * now);
now *= 10;
}
now = 9;
while (now <= n / now) {
re += Math.max(0, Math.min(n, (now + 1) * (now + 1)-1) - now * (now + 1)+1);
now = now * 10 + 9;
}
now = 8;
long low = 10;
while (now * low <= n) {
re++;
now = (now + 1) * 10 + 8;
low *= 10;
}
pw.println(re);
}
}
public static String dfs(Point src, Point tar, int h[][], int v[][], int n) {
int dfs[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dfs[i][j] = Integer.MAX_VALUE;
}
}
dfs[src.x][src.y] = 0;
StringBuffer sb = new StringBuffer();
List<Point> list = new ArrayList<>();
list.add(src);
while (list.size() > 0) {
List<Point> temp = new ArrayList<>();
int access[][] = new int[n][n];
for (Point p : list) {
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0 && dfs[p.x - 1][p.y] > dfs[p.x][p.y] + 1) {
dfs[p.x - 1][p.y] = dfs[p.x][p.y] + 1;
if (access[p.x - 1][p.y] == 0) {
access[p.x - 1][p.y]++;
temp.add(new Point(p.x - 1, p.y));
}
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0 && dfs[p.x + 1][p.y] > dfs[p.x][p.y] + 1) {
dfs[p.x + 1][p.y] = dfs[p.x][p.y] + 1;
if (access[p.x + 1][p.y] == 0) {
access[p.x + 1][p.y]++;
temp.add(new Point(p.x + 1, p.y));
}
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0 && dfs[p.x][p.y - 1] > dfs[p.x][p.y] + 1) {
dfs[p.x][p.y - 1] = dfs[p.x][p.y] + 1;
if (access[p.x][p.y - 1] == 0) {
access[p.x][p.y - 1]++;
temp.add(new Point(p.x, p.y - 1));
}
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0 && dfs[p.x][p.y + 1] > dfs[p.x][p.y] + 1) {
dfs[p.x][p.y + 1] = dfs[p.x][p.y] + 1;
if (access[p.x][p.y + 1] == 0) {
access[p.x][p.y + 1]++;
temp.add(new Point(p.x, p.y + 1));
}
}
}
}
list = temp;
}
Point now = new Point(tar.x, tar.y);
for (int i = dfs[tar.x][tar.y]; i > 0; i--) {
if (now.x - 1 >= 0) {
if (h[now.x - 1][now.y] == 0 && dfs[now.x - 1][now.y] == i - 1) {
now = new Point(now.x - 1, now.y);
sb.append("D");
continue;
}
}
if (now.x + 1 < n) {
if (h[now.x][now.y] == 0 && dfs[now.x + 1][now.y] == i - 1) {
now = new Point(now.x + 1, now.y);
sb.append("U");
continue;
}
}
if (now.y - 1 >= 0) {
if (v[now.x][now.y - 1] == 0 && dfs[now.x][now.y - 1] == i - 1) {
now = new Point(now.x, now.y - 1);
sb.append("R");
continue;
}
}
if (now.y + 1 < n) {
if (v[now.x][now.y] == 0 && dfs[now.x][now.y + 1] == i - 1) {
now = new Point(now.x, now.y + 1);
sb.append("L");
continue;
}
}
}
StringBuffer re = new StringBuffer();
String temp = sb.toString();
for (int i = 0; i < temp.length(); i++) {
re.append(temp.charAt(temp.length() - i - 1));
}
return re.toString();
}
public static void changePosition(int a[][], Point p1, Point p2, Point position[]) {
int temp = a[p1.x][p1.y];
a[p1.x][p1.y] = a[p2.x][p2.y];
a[p2.x][p2.y] = temp;
position[a[p1.x][p1.y] - 1] = new Point(p1.x, p1.y);
position[a[p2.x][p2.y] - 1] = new Point(p2.x, p2.y);
}
public static int countPattern(Point p, int n, int h[][], int v[][]) {
int count = 0;
List<MovePosition> list = new ArrayList();
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
count++;
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
count++;
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
count++;
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
count++;
}
}
return count;
}
public static Point moveNext(Point p, int n, int h[][], int v[][], FastPrintStream pw) {
Random random = new Random();
List<MovePosition> list = new ArrayList();
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
list.add(new MovePosition('U', -1, 0));
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
list.add(new MovePosition('D', 1, 0));
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
list.add(new MovePosition('L', 0, -1));
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
list.add(new MovePosition('R', 0, 1));
}
}
MovePosition next = list.get(random.nextInt(list.size()));
pw.print(next.c + " ");
return new Point(p.x + next.x, p.y + next.y);
}
public static long countPoint(Point p, int n, int v[][], int h[][], long a[][]) {
long re = 0;
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
re += (a[p.x - 1][p.y] - a[p.x][p.y]) + (a[p.x - 1][p.y] - a[p.x][p.y]);
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
re += (a[p.x + 1][p.y] - a[p.x][p.y]) + (a[p.x + 1][p.y] - a[p.x][p.y]);
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
re += (a[p.x][p.y - 1] - a[p.x][p.y]) + (a[p.x][p.y - 1] - a[p.x][p.y]);
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
re += (a[p.x][1 + p.y] - a[p.x][p.y]) + (a[p.x][1 + p.y] - a[p.x][p.y]);
}
}
return re;
}
public static long sum(long first, long count) {
long last = first - count + 1;
return (first + last) * count / 2;
}
public static void searchPass(char c[][], int re[][], Point start, int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
re[i][j] = Integer.MAX_VALUE / 4;
}
}
re[start.x][start.y] = 0;
List<Point> list = new ArrayList<>();
list.add(start);
while (list.size() > 0) {
List<Point> temp = new ArrayList<>();
for (Point tp : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) == Math.abs(j)) {
continue;
}
if (tp.x + i < n && tp.x + i >= 0 && tp.y + j < n && tp.y + j >= 0
&& c[tp.x + i][tp.y + j] != '#') {
if (re[tp.x + i][tp.y + j] > re[tp.x][tp.y] + 1) {
re[tp.x + i][tp.y + j] = re[tp.x][tp.y] + 1;
temp.add(new Point(tp.x + i, tp.y + j));
}
}
}
}
}
list = temp;
}
}
public static long next(long now, long mod) {
if (now % mod == 0) {
return 0l;
}
return mod - now % mod;
}
public static int countA(int n, int a[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (a[mid] > price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return re + 1;
}
public static int countB(int n, int b[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (b[mid] >= price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return n - (re + 1);
}
public static String reverseString(String s) {
StringBuffer sb = new StringBuffer();
for (int i = s.length() - 1; i >= 0; i--) {
sb.append(s.charAt(i));
}
return sb.toString();
}
public static boolean check(char c[][], int startx, int starty, int x, int y) {
if (c[startx][starty] == '.') {
return false;
}
char temp = c[startx][starty];
for (int i = 0; i < 3; i++) {
if (c[startx + i * x][starty + i * y] != temp) {
return false;
}
}
return true;
}
public static boolean compareString(String s, int indexb) {
int length = Math.min(indexb, s.length() - indexb);
for (int i = 0; i < length; i++) {
if (s.charAt(i) < s.charAt(i + indexb)) {
return true;
} else if (s.charAt(i) > s.charAt(i + indexb)) {
return false;
}
}
if (indexb < s.length() - indexb) {
return true;
}
return false;
}
public static boolean checkx(char c[][], char x[][], int hc, int wc, int hx, int wx) {
for (int i = 0; i <= hc - hx; i++) {
for (int j = 0; j <= wc - wx; j++) {
boolean bool = true;
for (int l = 0; l < hx; l++) {
for (int m = 0; m < wx; m++) {
if (c[i + l][j + m] == '#' || x[l][m] == '#') {
if (c[i + l][j + m] != x[l][m]) {
bool = false;
}
}
}
}
if (bool) {
return true;
}
}
}
return false;
}
public static void refreshc(char c[][], char a[][], int ha, int wa, int hb, int wb) {
for (int i = 0; i < ha; i++) {
for (int j = 0; j < wa; j++) {
c[i + hb][j + wb] = a[i][j];
}
}
}
public static void updateList(List<Point> list, int p[], int po, int position[]) {
po += 2;
list.add(new Point(po - 1, po - 1));
int temp = p[po];
p[po] = p[po - 1];
p[po - 1] = p[po - 2];
p[po - 2] = temp;
position[p[po] - 1] = po;
position[p[po - 1] - 1] = po - 1;
position[p[po - 2] - 1] = po - 2;
po -= 2;
}
public static void updateSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = map.get(n);
countM--;
if (countM == 0) {
map.remove(n);
set.remove(n);
} else {
map.put(n, countM);
}
}
public static void insertSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = 0;
if (set.contains(n)) {
countM = map.get(n);
} else {
set.add(n);
}
countM++;
map.put(n, countM);
}
public static int distance(int x1, int y1, int x2, int y2) {
int distance = (int) Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) + 1;
return distance;
}
public static boolean nextPermutation(int[] arr) {
int len = arr.length;
int left = len - 2;
while (left >= 0 && arr[left] >= arr[left + 1])
left--;
if (left < 0)
return false;
int right = len - 1;
while (arr[left] >= arr[right])
right--;
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right = len - 1;
while (left < right) {
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right--;
}
return true;
}
public static void testpattern(int n) {
int count = 0;
int re = 0;
for (int x = 1; x * x <= n; x++) {
count++;
}
System.out.println(count);
re += count;
count = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * x <= n; y++) {
if (y != x) {
count += 3;
// System.out.println(x+" "+x+" "+y);
}
}
}
re += count;
System.out.println(count);
count = 0;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
if (x * y <= n && y * z <= n && x * z <= n) {
if (x != y && x != z && y != z) {
count++;
}
}
}
}
}
re += count;
System.out.println(count);
System.out.println(re);
}
public static int distance(char a[][], Point s, Point e, int h, int w) {
int temp[][] = new int[h][w];
List<Point> list = new ArrayList<>();
list.add(s);
temp[s.x][s.y] = 1;
int count = 1;
while (!list.isEmpty()) {
List<Point> t = new ArrayList<>();
for (Point p : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) != Math.abs(j)) {
if (i + p.x < h && i + p.x >= 0 && j + p.y >= 0 && j + p.y < w) {
if (e.x == i + p.x && e.y == j + p.y) {
return count;
}
if (temp[i + p.x][j + p.y] == 0 && a[i + p.x][j + p.y] != '#') {
t.add(new Point(i + p.x, j + p.y));
temp[i + p.x][j + p.y]++;
}
}
}
}
}
}
count++;
list = t;
}
return Integer.MAX_VALUE / 3;
}
public static int[][] reverse(int n, int a[][]) {
int temp[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
temp[n - 1 - j][i] = a[i][j];
}
}
return temp;
}
public static boolean check(int a[][], int b[][], int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1 && b[i][j] == 0) {
return false;
}
}
}
return true;
}
public static long testMethod(long a, long b) {
if (a < b) {
long t = b;
b = a;
a = t;
}
long re = 0;
// long nowgcd = 1;
while (b > 0) {
if (a == b) {
// pw.println(re + 1);
return re + 1;
}
long gcd = Main.gcd(a, b);
if (gcd == 1) {
long sa = a - b;
if (sa == 1) {
return re + b;
}
long min = a % sa;
for (long i = 2; i * i <= sa; i++) {
if (sa % i == 0) {
min = Math.min(min, a % i);
min = Math.min(min, a % (sa / i));
}
}
re += min;
a -= min;
b -= min;
} else {
// nowgcd = gcd;
re++;
a = a / gcd - 1;
b = b / gcd - 1;
}
}
return re;
}
public static long countNext(long a, long b) {
long re = -1;
long min = 1;
long max = b - 1;
while (min <= max) {
long mid = (min + max) / 2;
if ((a - mid) / (b - mid) > 1) {
re = mid;
min = mid + 1;
} else {
max = mid - 1;
}
}
return re;
}
public static int countTime(int max, int min, int i) {
int times = max / i + i - 1;
if (max % i != 0) {
times++;
}
if (min <= i) {
times++;
} else {
times = times + min / i;
if (min % i != 0) {
times++;
}
}
return times;
}
public static boolean check(long s, long l, long k, long m, long n, long v) {
if ((s - 1) / m != (s + l - 2) / m) {
return false;
}
if (s + (k - 1) * m > n * m) {
return false;
}
long temp = (s + s + (k - 1) * m) * k / 2;
long temp2 = (temp + temp + (l - 1) * k) * l / 2;
if (temp2 != v) {
return false;
}
return true;
}
public static double result(int x[], int x1, int x2, int x3) {
return 1.0 / (x[x1] * x[x2]) + 1.0 / (x[x2] * x[x3]) + 1.0 / (x[x1] * x[x3]);
}
public static int[] toArray(int temp, int n) {
List<Integer> list = new ArrayList<Integer>();
while (temp > 0) {
list.add(temp % 2);
temp /= 2;
}
int re[] = new int[n];
for (int i = 0; i < list.size(); i++) {
re[i] = list.get(i);
}
return re;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static boolean make_so(long[] as, long[] ms) {
while (true) {
boolean updated = false;
for (int fst = 0; fst < ms.length; fst++) {
for (int snd = fst + 1; snd < ms.length; snd++) {
long gcd = gcd(ms[fst], ms[snd]);
if (gcd == 1) {
continue;
}
updated = true;
if (as[fst] % gcd != as[snd] % gcd) {
return false;
}
ms[fst] /= gcd;
ms[snd] /= gcd;
while (true) {
long gt = gcd(ms[fst], gcd);
if (gt == 1) {
break;
}
ms[fst] *= gt;
gcd /= gt;
}
ms[snd] *= gcd;
as[fst] %= ms[fst];
as[snd] %= ms[snd];
}
}
if (!updated) {
break;
}
}
return true;
}
public static long mulity(long l, int a[]) {
for (int i = 0; i < a.length; i++) {
if (l % a[i] == 0) {
l /= a[i];
a[i] = 1;
}
}
return l;
}
public static int[][] reverse(int a[][]) {
int b[][] = new int[2][2];
b[0][0] = a[1][0];
b[0][1] = a[0][0];
b[1][0] = a[1][1];
b[1][1] = a[0][1];
return b;
}
public static void add(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (ts.contains(value)) {
map.put(value, map.get(value) + 1);
} else {
ts.add(value);
map.put(value, 1);
}
}
public static void remove(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (map.get(value) == 1) {
ts.remove(value);
map.remove(value);
} else {
map.put(value, map.get(value) - 1);
}
}
public static int merge(int n, int m, int e) {
int merge = (n * (n - 1) / 2 - 2 * m) * e * 3 / 200;
if ((n - 2 * m) * e % 100 != 0) {
merge++;
}
return Math.max(3, merge);
}
public static boolean isMerge(int n, int m, int e, int count, int now) {
int merge = merge(n, m, e);
if (Math.abs(count - now) <= merge) {
return true;
}
return false;
}
public static void setall(Set<Integer> set, int x) {
if (x < 10) {
set.add(x);
return;
}
int to = 0;
int one[] = new int[4];
while (x > 0) {
one[to] = x % 10;
x /= 10;
to++;
}
Main.permutation(one, 0, to - 1, set);
}
// mod. m での a の逆元 a^{-1} を計算する
public static long modinv(long a, long m) {
long b = m, u = 1, v = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
long temp = a;
a = b;
b = temp;
u -= t * v;
temp = u;
u = v;
v = temp;
}
u %= m;
if (u < 0)
u += m;
return u;
}
public long re(long n) {
if ((n % 6 == 1 || n % 6 == 5) && n > 1) {
n--;
}
if (map.containsKey(n)) {
return map.get(n);
}
long t1 = re(n / 2);
long t2 = re(n / 3);
map.put(n / 2, t1);
map.put(n / 3, t2);
return t1 + t2;
}
public static long distance(Point s, Point e) {
return (s.x - e.x) * (s.x - e.x) + (s.y - e.y) * (s.y - e.y);
}
public static int lowerBound(Integer[] a, int obj) {
int l = 0, r = a.length - 1;
while (r - l >= 0) {
int c = (l + r) / 2;
if (obj <= a[c]) {
r = c - 1;
} else {
l = c + 1;
}
}
return l;
}
public static long countRe(int high, int used[], long now, long min, long b[]) {
long re = Long.MAX_VALUE;
long temp = min;
for (int i = high; i >= 0; i--) {
if (used[i] == 0 && temp < now) {
temp += b[i];
if (temp >= now) {
re = Math.min(re, temp);
temp -= b[i];
}
}
}
if (re == Long.MAX_VALUE) {
re = min;
}
return re;
}
public static void swap(int[] s, int i, int j) {
int tmp = s[i];
s[i] = s[j];
s[j] = tmp;
}
public static void permutation(int[] s, int from, int to, Set<Integer> set) {
if (to <= 0)
return;
if (from == to) {
check(s, set, to);
} else {
for (int i = from; i <= to; i++) {
swap(s, i, from);
permutation(s, from + 1, to, set);
swap(s, from, i);
}
}
}
public static void check(int[] s, Set<Integer> set, int to) {
int temp = 0;
for (int i = 0; i <= to; i++) {
temp *= 10;
temp += s[i];
}
set.add(temp);
}
public static long anothertoTen(long ano, int another) {
long ten = 0;
long now = 1;
long temp = ano;
while (temp > 0) {
long i = temp % 10;
ten += now * i;
now *= another;
temp /= 10;
}
return ten;
}
public static long tentoAnother(long ten, int another) {
Stack<Long> stack = new Stack<Long>();
while (ten > 0) {
stack.add(ten % another);
ten /= another;
}
long re = 0;
while (!stack.isEmpty()) {
long pop = stack.pop();
re = re * 10 + pop;
}
return re;
}
// 2C5 = 5*4/(2*1)
public static long fastXCY(long tempx, long temp) {
tempx = tempx % MOD;
temp %= MOD;
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
// 2C5 = 5*4/(2*1)
public static long XCY(long x, long y) {
long temp = 1;
for (int i = 0; i < x; i++) {
temp = (temp * (y - i)) % MOD;
}
long tempx = 1;
for (int i = 2; i <= x; i++) {
tempx = (tempx * i) % MOD;
}
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
static long modpow(long N, Long K) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(MOD)).longValue();
}
static long modpow(long N, Long K, long mod) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(mod)).longValue();
}
public static int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a < b) {
return gcd(b, a);
}
return gcd(b, a % b);
}
}
class MovePosition {
public char c;
public int x;
public int y;
public MovePosition(char ch, int a, int b) {
c = ch;
x = a;
y = b;
}
}
class PointEx {
long l;
long d;
long k;
long c;
int e;
public PointEx(long x, long y, long z, long a, int b) {
l = x;
d = y;
k = z;
c = a;
e = b;
}
}
class Node implements Comparable<Node> {
int tyoten;
long minDistance;
public Node(int t, long m) {
tyoten = t;
minDistance = m;
}
@Override
public int compareTo(Node o) {
int res = -1;
if (this.minDistance - o.minDistance >= 0) {
res = 1;
}
return res;
}
}
class Vertex {
String key;
Vertex(String key) {
this.key = key;
}
}
class Edge {
Vertex start;
Vertex end;
long key;
Edge(Vertex start, Vertex end, long key) {
this.start = start;
this.end = end;
this.key = key;
}
}
class Point extends Object implements Comparable {
int x;
int y;
public Point() {
}
public Point(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object j) {
Point p = (Point) j;
if (p.x == this.x && p.y == this.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
return (int) this.x + (int) this.y;
}
public int compareTo(Object p) {
Point t = (Point) p;
if (t.x != this.x) {
return this.x - t.x;
}
return this.y - t.y;
}
}
class PointX implements Comparable {
long a;
long b;
public PointX(long x, long y) {
a = x;
b = y;
}
public int compareTo(Object p) {
PointX t = (PointX) p;
if (t.a + t.b > a + b) {
return -1;
}
if (t.a + t.b < a + b) {
return 1;
}
return 0;
}
public boolean equals(Object p) {
PointX t = (PointX) p;
return this.a == t.a && this.b == t.b;
}
}
class PointTemp implements Comparable {
int p1x;
int p1y;
int p2x;
int p2y;
public PointTemp(int x1, int y1, int x2, int y2) {
p1x = x1;
p2x = x2;
p1y = y1;
p2y = y2;
}
public int compareTo(Object p) {
PointTemp t = (PointTemp) p;
if (Math.abs(t.p1x - t.p2x) > Math.abs(p1x - p2x)) {
return 1;
}
if (Math.abs(t.p1x - t.p2x) < Math.abs(p1x - p2x)) {
return -1;
}
return 0;
}
public boolean equals(Object p) {
PointTemp t = (PointTemp) p;
return this.p1x == t.p1x && this.p2x == t.p2x;
}
}
class FastPrintStream implements AutoCloseable {
private static final int BUF_SIZE = 1 << 15;
private final byte[] buf = new byte[BUF_SIZE];
private int ptr = 0;
private final java.lang.reflect.Field strField;
private final java.nio.charset.CharsetEncoder encoder;
private java.io.OutputStream out;
public FastPrintStream(java.io.OutputStream out) {
this.out = out;
java.lang.reflect.Field f;
try {
f = java.lang.String.class.getDeclaredField("value");
// f.setAccessible(true);
} catch (NoSuchFieldException | SecurityException e) {
f = null;
}
this.strField = f;
this.encoder = java.nio.charset.StandardCharsets.US_ASCII.newEncoder();
}
public FastPrintStream(java.io.File file) throws java.io.IOException {
this(new java.io.FileOutputStream(file));
}
public FastPrintStream(java.lang.String filename) throws java.io.IOException {
this(new java.io.File(filename));
}
public FastPrintStream() {
this(System.out);
try {
java.lang.reflect.Field f = java.io.PrintStream.class.getDeclaredField("autoFlush");
// f.setAccessible(true);
f.set(System.out, false);
} catch (IllegalAccessException | IllegalArgumentException | NoSuchFieldException e) {
// ignore
}
}
public FastPrintStream println() {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) '\n';
return this;
}
public FastPrintStream println(java.lang.Object o) {
return print(o).println();
}
public FastPrintStream println(java.lang.String s) {
return print(s).println();
}
public FastPrintStream println(char[] s) {
return print(s).println();
}
public FastPrintStream println(char c) {
return print(c).println();
}
public FastPrintStream println(int x) {
return print(x).println();
}
public FastPrintStream println(long x) {
return print(x).println();
}
public FastPrintStream println(double d, int precision) {
return print(d, precision).println();
}
private FastPrintStream print(byte[] bytes) {
int n = bytes.length;
if (ptr + n > BUF_SIZE) {
internalFlush();
try {
out.write(bytes);
} catch (java.io.IOException e) {
throw new RuntimeException();
}
} else {
System.arraycopy(bytes, 0, buf, ptr, n);
ptr += n;
}
return this;
}
public FastPrintStream print(java.lang.Object o) {
return print(o.toString());
}
public FastPrintStream print(java.lang.String s) {
if (strField == null) {
return print(s.getBytes());
} else {
try {
return print((byte[]) strField.get(s));
} catch (IllegalAccessException e) {
return print(s.getBytes());
}
}
}
public FastPrintStream print(char[] s) {
try {
return print(encoder.encode(java.nio.CharBuffer.wrap(s)).array());
} catch (java.nio.charset.CharacterCodingException e) {
byte[] bytes = new byte[s.length];
for (int i = 0; i < s.length; i++) {
bytes[i] = (byte) s[i];
}
return print(bytes);
}
}
public FastPrintStream print(char c) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) c;
return this;
}
public FastPrintStream print(int x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(long x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(double d, int precision) {
if (d < 0) {
print('-');
d = -d;
}
d += Math.pow(10, -d) / 2;
print((long) d).print('.');
d -= (long) d;
for (int i = 0; i < precision; i++) {
d *= 10;
print((int) d);
d -= (int) d;
}
return this;
}
private void internalFlush() {
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void flush() {
try {
out.write(buf, 0, ptr);
out.flush();
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void close() {
try {
out.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
private static int len(int x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
int p = -10;
for (int i = 1; i < 10; i++, p *= 10)
if (x > p)
return i + d;
return 10 + d;
}
private static int len(long x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
long p = -10;
for (int i = 1; i < 19; i++, p *= 10)
if (x > p)
return i + d;
return 19 + d;
}
}
class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[2048];
private int ptr = 0;
private int buflen = 0;
public FastScanner(java.io.InputStream in) {
this.in = in;
}
public FastScanner() {
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen)
return true;
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
return buflen > 0;
}
private int readByte() {
return hasNextByte() ? buf[ptr++] : -1;
}
public boolean hasNext() {
while (hasNextByte() && !(32 < buf[ptr] && buf[ptr] < 127))
ptr++;
return hasNextByte();
}
private StringBuilder nextSequence() {
if (!hasNext())
throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
for (int b = readByte(); 32 < b && b < 127; b = readByte()) {
sb.appendCodePoint(b);
}
return sb;
}
public String next() {
return nextSequence().toString();
}
public String next(int len) {
return new String(nextChars(len));
}
public char nextChar() {
if (!hasNextByte())
throw new java.util.NoSuchElementException();
return (char) readByte();
}
public char[] nextChars() {
StringBuilder sb = nextSequence();
int l = sb.length();
char[] dst = new char[l];
sb.getChars(0, l, dst, 0);
return dst;
}
public char[] nextChars(int len) {
if (!hasNext())
throw new java.util.NoSuchElementException();
char[] s = new char[len];
int i = 0;
int b = readByte();
while (32 < b && b < 127 && i < len) {
s[i++] = (char) b;
b = readByte();
}
if (i != len) {
throw new java.util.NoSuchElementException(
String.format("Next token has smaller length than expected.", len));
}
return s;
}
public long nextLong() {
if (!hasNext())
throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b)
throw new NumberFormatException();
while (true) {
if ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
} else if (b == -1 || !(32 < b && b < 127)) {
return minus ? -n : n;
} else
throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() {
return Math.toIntExact(nextLong());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
in.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(int n, java.util.function.BinaryOperator<S> op, S e) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e) {
this(dat.length, op, e);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1)
sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1)
sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
S sum = E;
do {
l >>= Long.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N)
return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return -1;
}
int x = leader(a);
int y = leader(b);
if (x == y)
return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return false;
}
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n)) {
return -1;
}
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
return result;
}
}
class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(int n, java.util.function.BinaryOperator<S> op, S e,
java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e,
java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(int k) {
if (Laz[k] == Id)
return;
int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N)
Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N)
Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(int k) {
for (int i = Log; i > 0; i--)
push(k >> i);
}
private void pushTo(int lk, int rk) {
for (int i = Log; i > 0; i--) {
if (((lk >> i) << i) != lk)
push(lk >> i);
if (((rk >> i) << i) != rk)
push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(int lk, int rk) {
for (int i = 1; i <= Log; i++) {
if (((lk >> i) << i) != lk) {
int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (((rk >> i) << i) != rk) {
int rki = (rk - 1) >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r)
return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1)
sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1)
sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, F f) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r)
return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N)
Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N)
Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
private S[] simulatePushAll() {
S[] simDat = java.util.Arrays.copyOf(Dat, 2 * N);
F[] simLaz = java.util.Arrays.copyOf(Laz, 2 * N);
for (int k = 1; k < N; k++) {
if (simLaz[k] == Id)
continue;
int lk = k << 1 | 0, rk = k << 1 | 1;
simDat[lk] = Mapping.apply(simLaz[k], simDat[lk]);
simDat[rk] = Mapping.apply(simLaz[k], simDat[rk]);
if (lk < N)
simLaz[lk] = Composition.apply(simLaz[k], simLaz[lk]);
if (rk < N)
simLaz[rk] = Composition.apply(simLaz[k], simLaz[rk]);
simLaz[k] = Id;
}
return simDat;
}
public String toDetailedString() {
return toDetailedString(1, 0, simulatePushAll());
}
private String toDetailedString(int k, int sp, S[] dat) {
if (k >= N)
return indent(sp) + dat[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent, dat);
s += "\n";
s += indent(sp) + dat[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent, dat);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
S[] dat = simulatePushAll();
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(dat[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.Set;
import java.util.Stack;
import java.util.TreeSet;
public class Main {
static long MOD = 998244353;
int min = Integer.MAX_VALUE;
int max = 0;
int count = 0;
int pattern = 0;
int k = 0;
Map<Long, Long> map = new HashMap<Long, Long>();
public static void main(String[] args) throws Exception {
// FileInputStream fis = new FileInputStream(new File("t.a"));
var sc = new FastScanner();
// Scanner sc = new Scanner(System.in);
// var sc = new FastScanner(fis);
// var pw = new FastPrintStream("t.y");
var pw = new FastPrintStream();
solve(sc, pw);
sc.close();
pw.flush();
pw.close();
}
static class S {
static final S E = new S(0);
long sum;
public S(long s) {
this.sum = s;
}
public static S op(S l, S r) {
return new S(l.sum);
}
public String toString() {
return String.valueOf(sum);
}
}
static class F {
static final F I = new F(0);
long a;
public F(long a) {
this.a = a;
}
public static F composite(F f, F g) {
return new F(f.a + g.a);
}
}
static S map(F f, S s) {
return new S(f.a + s.sum);
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int times = sc.nextInt();
for (int time = 0; time < times; time++) {
long n = sc.nextLong();
long now = 10;
long re = 1;
while (now <= n / now) {
re += Math.max(0, Math.min(n, now * now + now-1) - now * now+1);
now *= 10;
}
now = 9;
while (now <= n / now) {
re += Math.max(0, Math.min(n, (now + 1) * (now + 1)-1) - now * (now + 1)+1);
now = now * 10 + 9;
}
now = 8;
long low = 10;
while (now * low <= n) {
re++;
now = (now + 1) * 10 + 8;
low *= 10;
}
pw.println(re);
}
}
public static String dfs(Point src, Point tar, int h[][], int v[][], int n) {
int dfs[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dfs[i][j] = Integer.MAX_VALUE;
}
}
dfs[src.x][src.y] = 0;
StringBuffer sb = new StringBuffer();
List<Point> list = new ArrayList<>();
list.add(src);
while (list.size() > 0) {
List<Point> temp = new ArrayList<>();
int access[][] = new int[n][n];
for (Point p : list) {
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0 && dfs[p.x - 1][p.y] > dfs[p.x][p.y] + 1) {
dfs[p.x - 1][p.y] = dfs[p.x][p.y] + 1;
if (access[p.x - 1][p.y] == 0) {
access[p.x - 1][p.y]++;
temp.add(new Point(p.x - 1, p.y));
}
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0 && dfs[p.x + 1][p.y] > dfs[p.x][p.y] + 1) {
dfs[p.x + 1][p.y] = dfs[p.x][p.y] + 1;
if (access[p.x + 1][p.y] == 0) {
access[p.x + 1][p.y]++;
temp.add(new Point(p.x + 1, p.y));
}
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0 && dfs[p.x][p.y - 1] > dfs[p.x][p.y] + 1) {
dfs[p.x][p.y - 1] = dfs[p.x][p.y] + 1;
if (access[p.x][p.y - 1] == 0) {
access[p.x][p.y - 1]++;
temp.add(new Point(p.x, p.y - 1));
}
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0 && dfs[p.x][p.y + 1] > dfs[p.x][p.y] + 1) {
dfs[p.x][p.y + 1] = dfs[p.x][p.y] + 1;
if (access[p.x][p.y + 1] == 0) {
access[p.x][p.y + 1]++;
temp.add(new Point(p.x, p.y + 1));
}
}
}
}
list = temp;
}
Point now = new Point(tar.x, tar.y);
for (int i = dfs[tar.x][tar.y]; i > 0; i--) {
if (now.x - 1 >= 0) {
if (h[now.x - 1][now.y] == 0 && dfs[now.x - 1][now.y] == i - 1) {
now = new Point(now.x - 1, now.y);
sb.append("D");
continue;
}
}
if (now.x + 1 < n) {
if (h[now.x][now.y] == 0 && dfs[now.x + 1][now.y] == i - 1) {
now = new Point(now.x + 1, now.y);
sb.append("U");
continue;
}
}
if (now.y - 1 >= 0) {
if (v[now.x][now.y - 1] == 0 && dfs[now.x][now.y - 1] == i - 1) {
now = new Point(now.x, now.y - 1);
sb.append("R");
continue;
}
}
if (now.y + 1 < n) {
if (v[now.x][now.y] == 0 && dfs[now.x][now.y + 1] == i - 1) {
now = new Point(now.x, now.y + 1);
sb.append("L");
continue;
}
}
}
StringBuffer re = new StringBuffer();
String temp = sb.toString();
for (int i = 0; i < temp.length(); i++) {
re.append(temp.charAt(temp.length() - i - 1));
}
return re.toString();
}
public static void changePosition(int a[][], Point p1, Point p2, Point position[]) {
int temp = a[p1.x][p1.y];
a[p1.x][p1.y] = a[p2.x][p2.y];
a[p2.x][p2.y] = temp;
position[a[p1.x][p1.y] - 1] = new Point(p1.x, p1.y);
position[a[p2.x][p2.y] - 1] = new Point(p2.x, p2.y);
}
public static int countPattern(Point p, int n, int h[][], int v[][]) {
int count = 0;
List<MovePosition> list = new ArrayList();
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
count++;
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
count++;
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
count++;
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
count++;
}
}
return count;
}
public static Point moveNext(Point p, int n, int h[][], int v[][], FastPrintStream pw) {
Random random = new Random();
List<MovePosition> list = new ArrayList();
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
list.add(new MovePosition('U', -1, 0));
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
list.add(new MovePosition('D', 1, 0));
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
list.add(new MovePosition('L', 0, -1));
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
list.add(new MovePosition('R', 0, 1));
}
}
MovePosition next = list.get(random.nextInt(list.size()));
pw.print(next.c + " ");
return new Point(p.x + next.x, p.y + next.y);
}
public static long countPoint(Point p, int n, int v[][], int h[][], long a[][]) {
long re = 0;
if (p.x - 1 >= 0) {
if (h[p.x - 1][p.y] == 0) {
re += (a[p.x - 1][p.y] - a[p.x][p.y]) + (a[p.x - 1][p.y] - a[p.x][p.y]);
}
}
if (p.x + 1 < n) {
if (h[p.x][p.y] == 0) {
re += (a[p.x + 1][p.y] - a[p.x][p.y]) + (a[p.x + 1][p.y] - a[p.x][p.y]);
}
}
if (p.y - 1 >= 0) {
if (v[p.x][p.y - 1] == 0) {
re += (a[p.x][p.y - 1] - a[p.x][p.y]) + (a[p.x][p.y - 1] - a[p.x][p.y]);
}
}
if (p.y + 1 < n) {
if (v[p.x][p.y] == 0) {
re += (a[p.x][1 + p.y] - a[p.x][p.y]) + (a[p.x][1 + p.y] - a[p.x][p.y]);
}
}
return re;
}
public static long sum(long first, long count) {
long last = first - count + 1;
return (first + last) * count / 2;
}
public static void searchPass(char c[][], int re[][], Point start, int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
re[i][j] = Integer.MAX_VALUE / 4;
}
}
re[start.x][start.y] = 0;
List<Point> list = new ArrayList<>();
list.add(start);
while (list.size() > 0) {
List<Point> temp = new ArrayList<>();
for (Point tp : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) == Math.abs(j)) {
continue;
}
if (tp.x + i < n && tp.x + i >= 0 && tp.y + j < n && tp.y + j >= 0
&& c[tp.x + i][tp.y + j] != '#') {
if (re[tp.x + i][tp.y + j] > re[tp.x][tp.y] + 1) {
re[tp.x + i][tp.y + j] = re[tp.x][tp.y] + 1;
temp.add(new Point(tp.x + i, tp.y + j));
}
}
}
}
}
list = temp;
}
}
public static long next(long now, long mod) {
if (now % mod == 0) {
return 0l;
}
return mod - now % mod;
}
public static int countA(int n, int a[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (a[mid] > price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return re + 1;
}
public static int countB(int n, int b[], int price) {
int min = 0;
int max = n - 1;
int re = -1;
while (min <= max) {
int mid = (min + max) / 2;
if (b[mid] >= price) {
max = mid - 1;
} else {
re = mid;
min = mid + 1;
}
}
return n - (re + 1);
}
public static String reverseString(String s) {
StringBuffer sb = new StringBuffer();
for (int i = s.length() - 1; i >= 0; i--) {
sb.append(s.charAt(i));
}
return sb.toString();
}
public static boolean check(char c[][], int startx, int starty, int x, int y) {
if (c[startx][starty] == '.') {
return false;
}
char temp = c[startx][starty];
for (int i = 0; i < 3; i++) {
if (c[startx + i * x][starty + i * y] != temp) {
return false;
}
}
return true;
}
public static boolean compareString(String s, int indexb) {
int length = Math.min(indexb, s.length() - indexb);
for (int i = 0; i < length; i++) {
if (s.charAt(i) < s.charAt(i + indexb)) {
return true;
} else if (s.charAt(i) > s.charAt(i + indexb)) {
return false;
}
}
if (indexb < s.length() - indexb) {
return true;
}
return false;
}
public static boolean checkx(char c[][], char x[][], int hc, int wc, int hx, int wx) {
for (int i = 0; i <= hc - hx; i++) {
for (int j = 0; j <= wc - wx; j++) {
boolean bool = true;
for (int l = 0; l < hx; l++) {
for (int m = 0; m < wx; m++) {
if (c[i + l][j + m] == '#' || x[l][m] == '#') {
if (c[i + l][j + m] != x[l][m]) {
bool = false;
}
}
}
}
if (bool) {
return true;
}
}
}
return false;
}
public static void refreshc(char c[][], char a[][], int ha, int wa, int hb, int wb) {
for (int i = 0; i < ha; i++) {
for (int j = 0; j < wa; j++) {
c[i + hb][j + wb] = a[i][j];
}
}
}
public static void updateList(List<Point> list, int p[], int po, int position[]) {
po += 2;
list.add(new Point(po - 1, po - 1));
int temp = p[po];
p[po] = p[po - 1];
p[po - 1] = p[po - 2];
p[po - 2] = temp;
position[p[po] - 1] = po;
position[p[po - 1] - 1] = po - 1;
position[p[po - 2] - 1] = po - 2;
po -= 2;
}
public static void updateSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = map.get(n);
countM--;
if (countM == 0) {
map.remove(n);
set.remove(n);
} else {
map.put(n, countM);
}
}
public static void insertSet(Map<Long, Integer> map, Set<Long> set, long n) {
int countM = 0;
if (set.contains(n)) {
countM = map.get(n);
} else {
set.add(n);
}
countM++;
map.put(n, countM);
}
public static int distance(int x1, int y1, int x2, int y2) {
int distance = (int) Math.sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) + 1;
return distance;
}
public static boolean nextPermutation(int[] arr) {
int len = arr.length;
int left = len - 2;
while (left >= 0 && arr[left] >= arr[left + 1])
left--;
if (left < 0)
return false;
int right = len - 1;
while (arr[left] >= arr[right])
right--;
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right = len - 1;
while (left < right) {
{
int t = arr[left];
arr[left] = arr[right];
arr[right] = t;
}
left++;
right--;
}
return true;
}
public static void testpattern(int n) {
int count = 0;
int re = 0;
for (int x = 1; x * x <= n; x++) {
count++;
}
System.out.println(count);
re += count;
count = 0;
for (int x = 1; x * x <= n; x++) {
for (int y = 1; y * x <= n; y++) {
if (y != x) {
count += 3;
// System.out.println(x+" "+x+" "+y);
}
}
}
re += count;
System.out.println(count);
count = 0;
for (int x = 1; x <= n; x++) {
for (int y = 1; y <= n; y++) {
for (int z = 1; z <= n; z++) {
if (x * y <= n && y * z <= n && x * z <= n) {
if (x != y && x != z && y != z) {
count++;
}
}
}
}
}
re += count;
System.out.println(count);
System.out.println(re);
}
public static int distance(char a[][], Point s, Point e, int h, int w) {
int temp[][] = new int[h][w];
List<Point> list = new ArrayList<>();
list.add(s);
temp[s.x][s.y] = 1;
int count = 1;
while (!list.isEmpty()) {
List<Point> t = new ArrayList<>();
for (Point p : list) {
for (int i = -1; i <= 1; i++) {
for (int j = -1; j <= 1; j++) {
if (Math.abs(i) != Math.abs(j)) {
if (i + p.x < h && i + p.x >= 0 && j + p.y >= 0 && j + p.y < w) {
if (e.x == i + p.x && e.y == j + p.y) {
return count;
}
if (temp[i + p.x][j + p.y] == 0 && a[i + p.x][j + p.y] != '#') {
t.add(new Point(i + p.x, j + p.y));
temp[i + p.x][j + p.y]++;
}
}
}
}
}
}
count++;
list = t;
}
return Integer.MAX_VALUE / 3;
}
public static int[][] reverse(int n, int a[][]) {
int temp[][] = new int[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
temp[n - 1 - j][i] = a[i][j];
}
}
return temp;
}
public static boolean check(int a[][], int b[][], int n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (a[i][j] == 1 && b[i][j] == 0) {
return false;
}
}
}
return true;
}
public static long testMethod(long a, long b) {
if (a < b) {
long t = b;
b = a;
a = t;
}
long re = 0;
// long nowgcd = 1;
while (b > 0) {
if (a == b) {
// pw.println(re + 1);
return re + 1;
}
long gcd = Main.gcd(a, b);
if (gcd == 1) {
long sa = a - b;
if (sa == 1) {
return re + b;
}
long min = a % sa;
for (long i = 2; i * i <= sa; i++) {
if (sa % i == 0) {
min = Math.min(min, a % i);
min = Math.min(min, a % (sa / i));
}
}
re += min;
a -= min;
b -= min;
} else {
// nowgcd = gcd;
re++;
a = a / gcd - 1;
b = b / gcd - 1;
}
}
return re;
}
public static long countNext(long a, long b) {
long re = -1;
long min = 1;
long max = b - 1;
while (min <= max) {
long mid = (min + max) / 2;
if ((a - mid) / (b - mid) > 1) {
re = mid;
min = mid + 1;
} else {
max = mid - 1;
}
}
return re;
}
public static int countTime(int max, int min, int i) {
int times = max / i + i - 1;
if (max % i != 0) {
times++;
}
if (min <= i) {
times++;
} else {
times = times + min / i;
if (min % i != 0) {
times++;
}
}
return times;
}
public static boolean check(long s, long l, long k, long m, long n, long v) {
if ((s - 1) / m != (s + l - 2) / m) {
return false;
}
if (s + (k - 1) * m > n * m) {
return false;
}
long temp = (s + s + (k - 1) * m) * k / 2;
long temp2 = (temp + temp + (l - 1) * k) * l / 2;
if (temp2 != v) {
return false;
}
return true;
}
public static double result(int x[], int x1, int x2, int x3) {
return 1.0 / (x[x1] * x[x2]) + 1.0 / (x[x2] * x[x3]) + 1.0 / (x[x1] * x[x3]);
}
public static int[] toArray(int temp, int n) {
List<Integer> list = new ArrayList<Integer>();
while (temp > 0) {
list.add(temp % 2);
temp /= 2;
}
int re[] = new int[n];
for (int i = 0; i < list.size(); i++) {
re[i] = list.get(i);
}
return re;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
public static boolean make_so(long[] as, long[] ms) {
while (true) {
boolean updated = false;
for (int fst = 0; fst < ms.length; fst++) {
for (int snd = fst + 1; snd < ms.length; snd++) {
long gcd = gcd(ms[fst], ms[snd]);
if (gcd == 1) {
continue;
}
updated = true;
if (as[fst] % gcd != as[snd] % gcd) {
return false;
}
ms[fst] /= gcd;
ms[snd] /= gcd;
while (true) {
long gt = gcd(ms[fst], gcd);
if (gt == 1) {
break;
}
ms[fst] *= gt;
gcd /= gt;
}
ms[snd] *= gcd;
as[fst] %= ms[fst];
as[snd] %= ms[snd];
}
}
if (!updated) {
break;
}
}
return true;
}
public static long mulity(long l, int a[]) {
for (int i = 0; i < a.length; i++) {
if (l % a[i] == 0) {
l /= a[i];
a[i] = 1;
}
}
return l;
}
public static int[][] reverse(int a[][]) {
int b[][] = new int[2][2];
b[0][0] = a[1][0];
b[0][1] = a[0][0];
b[1][0] = a[1][1];
b[1][1] = a[0][1];
return b;
}
public static void add(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (ts.contains(value)) {
map.put(value, map.get(value) + 1);
} else {
ts.add(value);
map.put(value, 1);
}
}
public static void remove(TreeSet<Integer> ts, Map<Integer, Integer> map, int value) {
if (map.get(value) == 1) {
ts.remove(value);
map.remove(value);
} else {
map.put(value, map.get(value) - 1);
}
}
public static int merge(int n, int m, int e) {
int merge = (n * (n - 1) / 2 - 2 * m) * e * 3 / 200;
if ((n - 2 * m) * e % 100 != 0) {
merge++;
}
return Math.max(3, merge);
}
public static boolean isMerge(int n, int m, int e, int count, int now) {
int merge = merge(n, m, e);
if (Math.abs(count - now) <= merge) {
return true;
}
return false;
}
public static void setall(Set<Integer> set, int x) {
if (x < 10) {
set.add(x);
return;
}
int to = 0;
int one[] = new int[4];
while (x > 0) {
one[to] = x % 10;
x /= 10;
to++;
}
Main.permutation(one, 0, to - 1, set);
}
// mod. m での a の逆元 a^{-1} を計算する
public static long modinv(long a, long m) {
long b = m, u = 1, v = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
long temp = a;
a = b;
b = temp;
u -= t * v;
temp = u;
u = v;
v = temp;
}
u %= m;
if (u < 0)
u += m;
return u;
}
public long re(long n) {
if ((n % 6 == 1 || n % 6 == 5) && n > 1) {
n--;
}
if (map.containsKey(n)) {
return map.get(n);
}
long t1 = re(n / 2);
long t2 = re(n / 3);
map.put(n / 2, t1);
map.put(n / 3, t2);
return t1 + t2;
}
public static long distance(Point s, Point e) {
return (s.x - e.x) * (s.x - e.x) + (s.y - e.y) * (s.y - e.y);
}
public static int lowerBound(Integer[] a, int obj) {
int l = 0, r = a.length - 1;
while (r - l >= 0) {
int c = (l + r) / 2;
if (obj <= a[c]) {
r = c - 1;
} else {
l = c + 1;
}
}
return l;
}
public static long countRe(int high, int used[], long now, long min, long b[]) {
long re = Long.MAX_VALUE;
long temp = min;
for (int i = high; i >= 0; i--) {
if (used[i] == 0 && temp < now) {
temp += b[i];
if (temp >= now) {
re = Math.min(re, temp);
temp -= b[i];
}
}
}
if (re == Long.MAX_VALUE) {
re = min;
}
return re;
}
public static void swap(int[] s, int i, int j) {
int tmp = s[i];
s[i] = s[j];
s[j] = tmp;
}
public static void permutation(int[] s, int from, int to, Set<Integer> set) {
if (to <= 0)
return;
if (from == to) {
check(s, set, to);
} else {
for (int i = from; i <= to; i++) {
swap(s, i, from);
permutation(s, from + 1, to, set);
swap(s, from, i);
}
}
}
public static void check(int[] s, Set<Integer> set, int to) {
int temp = 0;
for (int i = 0; i <= to; i++) {
temp *= 10;
temp += s[i];
}
set.add(temp);
}
public static long anothertoTen(long ano, int another) {
long ten = 0;
long now = 1;
long temp = ano;
while (temp > 0) {
long i = temp % 10;
ten += now * i;
now *= another;
temp /= 10;
}
return ten;
}
public static long tentoAnother(long ten, int another) {
Stack<Long> stack = new Stack<Long>();
while (ten > 0) {
stack.add(ten % another);
ten /= another;
}
long re = 0;
while (!stack.isEmpty()) {
long pop = stack.pop();
re = re * 10 + pop;
}
return re;
}
// 2C5 = 5*4/(2*1)
public static long fastXCY(long tempx, long temp) {
tempx = tempx % MOD;
temp %= MOD;
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
// 2C5 = 5*4/(2*1)
public static long XCY(long x, long y) {
long temp = 1;
for (int i = 0; i < x; i++) {
temp = (temp * (y - i)) % MOD;
}
long tempx = 1;
for (int i = 2; i <= x; i++) {
tempx = (tempx * i) % MOD;
}
tempx = modpow(tempx, (long) MOD - 2);
temp = (temp * tempx) % MOD;
return temp;
}
static long modpow(long N, Long K) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(MOD)).longValue();
}
static long modpow(long N, Long K, long mod) {
return BigInteger.valueOf(N).modPow(BigInteger.valueOf(K), BigInteger.valueOf(mod)).longValue();
}
public static int gcd(int a, int b) {
if (b == 0) {
return a;
}
if (a < b) {
return gcd(b, a);
}
return gcd(b, a % b);
}
}
class MovePosition {
public char c;
public int x;
public int y;
public MovePosition(char ch, int a, int b) {
c = ch;
x = a;
y = b;
}
}
class PointEx {
long l;
long d;
long k;
long c;
int e;
public PointEx(long x, long y, long z, long a, int b) {
l = x;
d = y;
k = z;
c = a;
e = b;
}
}
class Node implements Comparable<Node> {
int tyoten;
long minDistance;
public Node(int t, long m) {
tyoten = t;
minDistance = m;
}
@Override
public int compareTo(Node o) {
int res = -1;
if (this.minDistance - o.minDistance >= 0) {
res = 1;
}
return res;
}
}
class Vertex {
String key;
Vertex(String key) {
this.key = key;
}
}
class Edge {
Vertex start;
Vertex end;
long key;
Edge(Vertex start, Vertex end, long key) {
this.start = start;
this.end = end;
this.key = key;
}
}
class Point extends Object implements Comparable {
int x;
int y;
public Point() {
}
public Point(int x, int y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object j) {
Point p = (Point) j;
if (p.x == this.x && p.y == this.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
return (int) this.x + (int) this.y;
}
public int compareTo(Object p) {
Point t = (Point) p;
if (t.x != this.x) {
return this.x - t.x;
}
return this.y - t.y;
}
}
class PointX implements Comparable {
long a;
long b;
public PointX(long x, long y) {
a = x;
b = y;
}
public int compareTo(Object p) {
PointX t = (PointX) p;
if (t.a + t.b > a + b) {
return -1;
}
if (t.a + t.b < a + b) {
return 1;
}
return 0;
}
public boolean equals(Object p) {
PointX t = (PointX) p;
return this.a == t.a && this.b == t.b;
}
}
class PointTemp implements Comparable {
int p1x;
int p1y;
int p2x;
int p2y;
public PointTemp(int x1, int y1, int x2, int y2) {
p1x = x1;
p2x = x2;
p1y = y1;
p2y = y2;
}
public int compareTo(Object p) {
PointTemp t = (PointTemp) p;
if (Math.abs(t.p1x - t.p2x) > Math.abs(p1x - p2x)) {
return 1;
}
if (Math.abs(t.p1x - t.p2x) < Math.abs(p1x - p2x)) {
return -1;
}
return 0;
}
public boolean equals(Object p) {
PointTemp t = (PointTemp) p;
return this.p1x == t.p1x && this.p2x == t.p2x;
}
}
class FastPrintStream implements AutoCloseable {
private static final int BUF_SIZE = 1 << 15;
private final byte[] buf = new byte[BUF_SIZE];
private int ptr = 0;
private final java.lang.reflect.Field strField;
private final java.nio.charset.CharsetEncoder encoder;
private java.io.OutputStream out;
public FastPrintStream(java.io.OutputStream out) {
this.out = out;
java.lang.reflect.Field f;
try {
f = java.lang.String.class.getDeclaredField("value");
// f.setAccessible(true);
} catch (NoSuchFieldException | SecurityException e) {
f = null;
}
this.strField = f;
this.encoder = java.nio.charset.StandardCharsets.US_ASCII.newEncoder();
}
public FastPrintStream(java.io.File file) throws java.io.IOException {
this(new java.io.FileOutputStream(file));
}
public FastPrintStream(java.lang.String filename) throws java.io.IOException {
this(new java.io.File(filename));
}
public FastPrintStream() {
this(System.out);
try {
java.lang.reflect.Field f = java.io.PrintStream.class.getDeclaredField("autoFlush");
// f.setAccessible(true);
f.set(System.out, false);
} catch (IllegalAccessException | IllegalArgumentException | NoSuchFieldException e) {
// ignore
}
}
public FastPrintStream println() {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) '\n';
return this;
}
public FastPrintStream println(java.lang.Object o) {
return print(o).println();
}
public FastPrintStream println(java.lang.String s) {
return print(s).println();
}
public FastPrintStream println(char[] s) {
return print(s).println();
}
public FastPrintStream println(char c) {
return print(c).println();
}
public FastPrintStream println(int x) {
return print(x).println();
}
public FastPrintStream println(long x) {
return print(x).println();
}
public FastPrintStream println(double d, int precision) {
return print(d, precision).println();
}
private FastPrintStream print(byte[] bytes) {
int n = bytes.length;
if (ptr + n > BUF_SIZE) {
internalFlush();
try {
out.write(bytes);
} catch (java.io.IOException e) {
throw new RuntimeException();
}
} else {
System.arraycopy(bytes, 0, buf, ptr, n);
ptr += n;
}
return this;
}
public FastPrintStream print(java.lang.Object o) {
return print(o.toString());
}
public FastPrintStream print(java.lang.String s) {
if (strField == null) {
return print(s.getBytes());
} else {
try {
return print((byte[]) strField.get(s));
} catch (IllegalAccessException e) {
return print(s.getBytes());
}
}
}
public FastPrintStream print(char[] s) {
try {
return print(encoder.encode(java.nio.CharBuffer.wrap(s)).array());
} catch (java.nio.charset.CharacterCodingException e) {
byte[] bytes = new byte[s.length];
for (int i = 0; i < s.length; i++) {
bytes[i] = (byte) s[i];
}
return print(bytes);
}
}
public FastPrintStream print(char c) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = (byte) c;
return this;
}
public FastPrintStream print(int x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(long x) {
if (x == 0) {
if (ptr == BUF_SIZE)
internalFlush();
buf[ptr++] = '0';
return this;
}
int d = len(x);
if (ptr + d > BUF_SIZE)
internalFlush();
if (x < 0) {
buf[ptr++] = '-';
x = -x;
d--;
}
int j = ptr += d;
while (x > 0) {
buf[--j] = (byte) ('0' + (x % 10));
x /= 10;
}
return this;
}
public FastPrintStream print(double d, int precision) {
if (d < 0) {
print('-');
d = -d;
}
d += Math.pow(10, -d) / 2;
print((long) d).print('.');
d -= (long) d;
for (int i = 0; i < precision; i++) {
d *= 10;
print((int) d);
d -= (int) d;
}
return this;
}
private void internalFlush() {
try {
out.write(buf, 0, ptr);
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void flush() {
try {
out.write(buf, 0, ptr);
out.flush();
ptr = 0;
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
public void close() {
try {
out.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
private static int len(int x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
int p = -10;
for (int i = 1; i < 10; i++, p *= 10)
if (x > p)
return i + d;
return 10 + d;
}
private static int len(long x) {
int d = 1;
if (x >= 0) {
d = 0;
x = -x;
}
long p = -10;
for (int i = 1; i < 19; i++, p *= 10)
if (x > p)
return i + d;
return 19 + d;
}
}
class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[2048];
private int ptr = 0;
private int buflen = 0;
public FastScanner(java.io.InputStream in) {
this.in = in;
}
public FastScanner() {
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen)
return true;
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
return buflen > 0;
}
private int readByte() {
return hasNextByte() ? buf[ptr++] : -1;
}
public boolean hasNext() {
while (hasNextByte() && !(32 < buf[ptr] && buf[ptr] < 127))
ptr++;
return hasNextByte();
}
private StringBuilder nextSequence() {
if (!hasNext())
throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
for (int b = readByte(); 32 < b && b < 127; b = readByte()) {
sb.appendCodePoint(b);
}
return sb;
}
public String next() {
return nextSequence().toString();
}
public String next(int len) {
return new String(nextChars(len));
}
public char nextChar() {
if (!hasNextByte())
throw new java.util.NoSuchElementException();
return (char) readByte();
}
public char[] nextChars() {
StringBuilder sb = nextSequence();
int l = sb.length();
char[] dst = new char[l];
sb.getChars(0, l, dst, 0);
return dst;
}
public char[] nextChars(int len) {
if (!hasNext())
throw new java.util.NoSuchElementException();
char[] s = new char[len];
int i = 0;
int b = readByte();
while (32 < b && b < 127 && i < len) {
s[i++] = (char) b;
b = readByte();
}
if (i != len) {
throw new java.util.NoSuchElementException(
String.format("Next token has smaller length than expected.", len));
}
return s;
}
public long nextLong() {
if (!hasNext())
throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b)
throw new NumberFormatException();
while (true) {
if ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
} else if (b == -1 || !(32 < b && b < 127)) {
return minus ? -n : n;
} else
throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() {
return Math.toIntExact(nextLong());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public void close() {
try {
in.close();
} catch (java.io.IOException e) {
throw new RuntimeException(e);
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(int n, java.util.function.BinaryOperator<S> op, S e) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e) {
this(dat.length, op, e);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1)
sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1)
sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
S sum = E;
do {
l >>= Long.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N)
return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return -1;
}
int x = leader(a);
int y = leader(b);
if (x == y)
return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n) || !(0 <= b && b < n)) {
return false;
}
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n)) {
return -1;
}
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<ArrayList<Integer>>();
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
return result;
}
}
class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(int n, java.util.function.BinaryOperator<S> op, S e,
java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this.MAX = n;
int k = 1;
while (k < n)
k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e,
java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(int k) {
if (Laz[k] == Id)
return;
int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N)
Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N)
Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(int k) {
for (int i = Log; i > 0; i--)
push(k >> i);
}
private void pushTo(int lk, int rk) {
for (int i = Log; i > 0; i--) {
if (((lk >> i) << i) != lk)
push(lk >> i);
if (((rk >> i) << i) != rk)
push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(int lk, int rk) {
for (int i = 1; i <= Log; i++) {
if (((lk >> i) << i) != lk) {
int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (((rk >> i) << i) != rk) {
int rki = (rk - 1) >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r)
return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1)
sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1)
sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, F f) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r));
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r)
return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N)
Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N)
Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX)
return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0)
return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1)
r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
private S[] simulatePushAll() {
S[] simDat = java.util.Arrays.copyOf(Dat, 2 * N);
F[] simLaz = java.util.Arrays.copyOf(Laz, 2 * N);
for (int k = 1; k < N; k++) {
if (simLaz[k] == Id)
continue;
int lk = k << 1 | 0, rk = k << 1 | 1;
simDat[lk] = Mapping.apply(simLaz[k], simDat[lk]);
simDat[rk] = Mapping.apply(simLaz[k], simDat[rk]);
if (lk < N)
simLaz[lk] = Composition.apply(simLaz[k], simLaz[lk]);
if (rk < N)
simLaz[rk] = Composition.apply(simLaz[k], simLaz[rk]);
simLaz[k] = Id;
}
return simDat;
}
public String toDetailedString() {
return toDetailedString(1, 0, simulatePushAll());
}
private String toDetailedString(int k, int sp, S[] dat) {
if (k >= N)
return indent(sp) + dat[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent, dat);
s += "\n";
s += indent(sp) + dat[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent, dat);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n-- > 0)
sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
S[] dat = simulatePushAll();
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(dat[i + N]);
if (i < N - 1)
sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
} | ConDefects/ConDefects/Code/arc174_d/Java/51396564 |
condefects-java_data_1270 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
String t = sc.next();
String[] T = t.split("");
sc.close();
boolean b = false;
int n = s.indexOf(T[0].toLowerCase());
if (n != -1) {
String u = s.substring(n + 1);
int m = u.indexOf(T[1].toLowerCase());
if (m != -1) {
String v = u.substring(m + 1);
int l = v.indexOf(T[1].toLowerCase());
if (l != -1 || "X".equals(T[2])) {
b = true;
}
}
}
System.out.println(b ? "Yes" : "No");
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
String t = sc.next();
String[] T = t.split("");
sc.close();
boolean b = false;
int n = s.indexOf(T[0].toLowerCase());
if (n != -1) {
String u = s.substring(n + 1);
int m = u.indexOf(T[1].toLowerCase());
if (m != -1) {
String v = u.substring(m + 1);
int l = v.indexOf(T[2].toLowerCase());
if (l != -1 || "X".equals(T[2])) {
b = true;
}
}
}
System.out.println(b ? "Yes" : "No");
}
} | ConDefects/ConDefects/Code/abc349_c/Java/54049076 |
condefects-java_data_1271 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
String ans = "No";
int n = 0;
int limit = 3;
if (T.charAt(2) != 'X') {
limit = 2;
}
for (int i = 0; i < S.length(); i++) {
char chS = S.charAt(i); //文字をchar型で抜き出し
int numS = chS - 'a'; // 'a'が0に対応するように調整
char chT = T.charAt(n); //文字をchar型で抜き出し
int numT = chT - 'A'; // 'a'が0に対応するように調整
if (numS == numT) {
n++;
}
if (n >= limit) {
ans = "Yes";
break;
}
}
System.out.println(ans);
sc.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next();
String T = sc.next();
String ans = "No";
int n = 0;
int limit = 3;
if (T.charAt(2) == 'X') {
limit = 2;
}
for (int i = 0; i < S.length(); i++) {
char chS = S.charAt(i); //文字をchar型で抜き出し
int numS = chS - 'a'; // 'a'が0に対応するように調整
char chT = T.charAt(n); //文字をchar型で抜き出し
int numT = chT - 'A'; // 'a'が0に対応するように調整
if (numS == numT) {
n++;
}
if (n >= limit) {
ans = "Yes";
break;
}
}
System.out.println(ans);
sc.close();
}
} | ConDefects/ConDefects/Code/abc349_c/Java/54038814 |
condefects-java_data_1272 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final StringTokenizer st_p = new StringTokenizer(br.readLine());
final int[] arr_p = new int[n];
for (int i = 0; i < n; i++) {
arr_p[i] = Integer.parseInt(st_p.nextToken()) - 1;
}
br.close();
final PrintWriter pw = new PrintWriter(System.out);
//転倒数
long inv = countInversionNumber(n, arr_p);
if (inv % 2 == 1) {
pw.println("No");
} else if (inv == 0) {
pw.println("Yes");
pw.println(0);
} else {
List<String> comlist = new ArrayList<>();
LinkedList<Integer> list = new LinkedList<>();
for (int p : arr_p) {
list.add(p);
}
for (int focus_num = 0; focus_num < n - 1; focus_num++) {
int idx_focus = list.indexOf(focus_num);
if (idx_focus == focus_num) {
continue;
}
if (idx_focus == n - 1) {
//移動したい要素が一番後ろの場合、まず後ろ２つの要素を一つ前に持っていく
//その後、後ろ２つの要素を目的位置に持っていく
//ex.3->2->1 ---> 2->1->3
comlist.add((n - 1) + " " + (n - 3));
comlist.add((n - 2) + " " + focus_num);
int num_last_1 = list.pollLast();
int num_last_2 = list.pollLast();
int num_last_3 = list.pollLast();
list.addLast(num_last_2);
list.add(focus_num, num_last_1);
list.add(focus_num + 1, num_last_3);
} else {
comlist.add((idx_focus + 1) + " " + focus_num);
int num1 = list.remove(idx_focus);
int num2 = list.remove(idx_focus);
list.add(focus_num, num1);
list.add(focus_num + 1, num2);
}
}
pw.println("Yes");
pw.println(comlist.size());
for (String c : comlist) {
pw.println(c);
}
}
pw.close();
}
static long countInversionNumber(int n, int[] array) {
//転倒数の計算
long ret = 0;
FenwickTree ft = new FenwickTree(n);
for (int i = 0; i < n; i++) {
ret += ft.sum(array[i], n);
ft.add(array[i], 1);
}
return ret;
}
//FenwickTreeライブラリ
static class FenwickTree {
final int N;
long[] data;
public FenwickTree(int n) {
N = n;
this.data = new long[n];
}
public FenwickTree(long[] data) {
N = data.length;
this.data = new long[this.N];
System.arraycopy(data, 0, this.data, 0, N);
for (int i = 1; i <= N; i++) {
int p = i + (-i & i);
if (p <= N) {
this.data[p - 1] += this.data[i - 1];
}
}
}
public void add(int p, long x) {
if (!(p >= 0 && p < N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", p, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
p++;
while (p <= N) {
data[p - 1] += x;
p += -p & p;
}
}
public long sum(int l, int r) {
if (l > r) {
String errMsg = String.format("Invalid range: [%d, %d).", l, r);
throw new IllegalArgumentException(errMsg);
}
if (!(l >= 0 && l <= N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", l, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
if (!(r >= 0 && r <= N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", r, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
return sum(r) - sum(l);
}
private long sum(int r) {
long s = 0;
while (r > 0) {
s += data[r - 1];
r -= -r & r;
}
return s;
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final StringTokenizer st_p = new StringTokenizer(br.readLine());
final int[] arr_p = new int[n];
for (int i = 0; i < n; i++) {
arr_p[i] = Integer.parseInt(st_p.nextToken()) - 1;
}
br.close();
final PrintWriter pw = new PrintWriter(System.out);
//転倒数
long inv = countInversionNumber(n, arr_p);
if (inv % 2 == 1) {
pw.println("No");
} else if (inv == 0) {
pw.println("Yes");
pw.println(0);
} else {
List<String> comlist = new ArrayList<>();
LinkedList<Integer> list = new LinkedList<>();
for (int p : arr_p) {
list.add(p);
}
for (int focus_num = 0; focus_num < n - 1; focus_num++) {
int idx_focus = list.indexOf(focus_num);
if (idx_focus == focus_num) {
continue;
}
if (idx_focus == n - 1) {
//移動したい要素が一番後ろの場合、まず後ろ２つの要素を一つ前に持っていく
//その後、後ろ２つの要素を目的位置に持っていく
//ex.3->2->1 ---> 2->1->3
comlist.add((n - 1) + " " + (n - 3));
comlist.add((n - 1) + " " + focus_num);
int num_last_1 = list.pollLast();
int num_last_2 = list.pollLast();
int num_last_3 = list.pollLast();
list.addLast(num_last_2);
list.add(focus_num, num_last_1);
list.add(focus_num + 1, num_last_3);
} else {
comlist.add((idx_focus + 1) + " " + focus_num);
int num1 = list.remove(idx_focus);
int num2 = list.remove(idx_focus);
list.add(focus_num, num1);
list.add(focus_num + 1, num2);
}
}
pw.println("Yes");
pw.println(comlist.size());
for (String c : comlist) {
pw.println(c);
}
}
pw.close();
}
static long countInversionNumber(int n, int[] array) {
//転倒数の計算
long ret = 0;
FenwickTree ft = new FenwickTree(n);
for (int i = 0; i < n; i++) {
ret += ft.sum(array[i], n);
ft.add(array[i], 1);
}
return ret;
}
//FenwickTreeライブラリ
static class FenwickTree {
final int N;
long[] data;
public FenwickTree(int n) {
N = n;
this.data = new long[n];
}
public FenwickTree(long[] data) {
N = data.length;
this.data = new long[this.N];
System.arraycopy(data, 0, this.data, 0, N);
for (int i = 1; i <= N; i++) {
int p = i + (-i & i);
if (p <= N) {
this.data[p - 1] += this.data[i - 1];
}
}
}
public void add(int p, long x) {
if (!(p >= 0 && p < N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", p, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
p++;
while (p <= N) {
data[p - 1] += x;
p += -p & p;
}
}
public long sum(int l, int r) {
if (l > r) {
String errMsg = String.format("Invalid range: [%d, %d).", l, r);
throw new IllegalArgumentException(errMsg);
}
if (!(l >= 0 && l <= N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", l, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
if (!(r >= 0 && r <= N)) {
String errMsg = String.format("Index %d out of bounds for length %d.", r, N);
throw new ArrayIndexOutOfBoundsException(errMsg);
}
return sum(r) - sum(l);
}
private long sum(int r) {
long s = 0;
while (r > 0) {
s += data[r - 1];
r -= -r & r;
}
return s;
}
}
}
| ConDefects/ConDefects/Code/arc162_b/Java/43274838 |
condefects-java_data_1273 |
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 162 B問題
* 考察メモ
* 順番に数字を持ち運ぶとどうだろう？
* まず1を先頭に運び、次に2を先頭に運び…とやるの
* で、これだと上手くいかないケースがありそう
* 1 3 2 → NG
* ……作れないケースを考えよう
* 長さ4で作れないケースがあるか？
* 1 2 4 3は普通に無理そう
* 実験でも半分か、なら愚直で無理なら無理かな
*/
int N = io.nextInt();
if (N < 0) {
TreeSet<Test> test = test(-N);
io.println(test.size());
for (Test t : test) {
if (solver(-N, t.P) == null) {
io.println("error: " + t);
}
}
// io.println(test, "\n");
return;
}
int[] P = io.nextInt(N);
ArrayList<Query> ans = solver(N, P);
if (ans == null) {
io.println("No");
} else {
io.println("Yes");
io.println(ans.size());
io.println(ans, "\n");
}
}
ArrayList<Query> solver(int N, int[] P) {
ArrayList<Query> ans = new ArrayList<>();
for (int i = N;i >= 3;-- i) { // iを目的の位置へ
for (int j = 0;j < i;++ j) {
if (P[j] != i) continue;
if (j == 0) { // 2手
ans.add(new Query(0, 1, P));
++ j;
}
ans.add(new Query(j - 1, i - 2, P));
}
}
if (P[0] != 1) return null;
return ans;
}
class Query {
int i, j;
Query(int i, int j, int[] P) {
this.i = i + 1;
this.j = j;
int N = P.length;
if (!(1 <= this.i && this.i <= N - 1)) throw new AssertionError(this);
if (!(0 <= this.j && this.j <= N - 2)) throw new AssertionError(this);
int[] Q = new int[N - 2];
for (int k = 0;k < i;++ k) Q[k] = P[k];
for (int k = i + 2;k < N;++ k) Q[k - 2] = P[k];
int ins1 = P[i], ins2 = P[i + 1];
for (int k = 0;k < j;++ k) P[k] = Q[k];
P[j] = ins1;
P[j + 1] = ins2;
for (int k = j;k < Q.length;++ k) P[k + 2] = Q[k];
}
@Override
public String toString() {
return i + " " + j;
}
}
TreeSet<Test> test(int N) {
TreeSet<Test> set = new TreeSet<>();
Queue<Test> bfs = new ArrayDeque<>();
set.add(new Test(N));
bfs.add(new Test(N));
while(!bfs.isEmpty()) {
Test t = bfs.poll();
for (Test next : t.test()) {
if (set.add(next)) bfs.add(next);
}
}
return set;
}
class Test implements Comparable<Test>{
int[] P;
Test(int N) {
P = new int[N];
for (int i = 0;i < N;++ i) P[i] = i + 1;
}
private Test(int[] P) {
this.P = P;
}
ArrayList<Test> test() {
ArrayList<Test> test = new ArrayList<>();
int N = P.length;
for (int i = 1;i < N;++ i) {
int[] Q = new int[N - 2];
for (int j = 0;j < i - 1;++ j) Q[j] = P[j];
for (int j = i + 1;j < N;++ j) Q[j - 2] = P[j];
for (int j = 0;j <= N - 2;++ j) {
int[] P = new int[N];
for (int k = 0;k < j;++ k) P[k] = Q[k];
P[j] = this.P[i - 1];
P[j + 1] = this.P[i];
for (int k = j;k < Q.length;++ k) P[k + 2] = Q[k];
test.add(new Test(P));
}
}
return test;
}
@Override
public int hashCode() {
return Arrays.hashCode(P);
}
@Override
public boolean equals(Object o) {
if (o instanceof Test) {
return Arrays.equals(P, ((Test)o).P);
}
return false;
}
@Override
public int compareTo(Test o) {
for (int i = 0;i < P.length;++ i) {
int comp = Integer.compare(P[i], o.P[i]);
if (comp != 0) return comp;
}
return 0;
}
@Override
public String toString() {
return Arrays.toString(P);
}
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
import java.awt.Point;
import java.io.Serializable;
import java.math.BigInteger;
import java.util.AbstractList;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.RandomAccess;
import java.util.Set;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.function.BinaryOperator;
import java.util.function.UnaryOperator;
public class Main implements Runnable {
private void solve(final FastIO io, final String[] args) {
io.setAutoFlush(false);
io.setAutoOutFlush(false);
/*
* author: 31536000
* AtCoder Regular Contest 162 B問題
* 考察メモ
* 順番に数字を持ち運ぶとどうだろう？
* まず1を先頭に運び、次に2を先頭に運び…とやるの
* で、これだと上手くいかないケースがありそう
* 1 3 2 → NG
* ……作れないケースを考えよう
* 長さ4で作れないケースがあるか？
* 1 2 4 3は普通に無理そう
* 実験でも半分か、なら愚直で無理なら無理かな
*/
int N = io.nextInt();
if (N < 0) {
TreeSet<Test> test = test(-N);
io.println(test.size());
for (Test t : test) {
if (solver(-N, t.P) == null) {
io.println("error: " + t);
}
}
// io.println(test, "\n");
return;
}
int[] P = io.nextInt(N);
ArrayList<Query> ans = solver(N, P);
if (ans == null) {
io.println("No");
} else {
io.println("Yes");
io.println(ans.size());
io.println(ans, "\n");
}
}
ArrayList<Query> solver(int N, int[] P) {
ArrayList<Query> ans = new ArrayList<>();
for (int i = N;i >= 3;-- i) { // iを目的の位置へ
for (int j = 0;j < i;++ j) {
if (P[j] != i) continue;
if (j == 0) { // 2手
ans.add(new Query(0, 1, P));
++ j;
}
ans.add(new Query(j - 1, i - 2, P));
break;
}
}
if (P[0] != 1) return null;
if (ans.size() > 2 * N) throw new AssertionError();
return ans;
}
class Query {
int i, j;
Query(int i, int j, int[] P) {
this.i = i + 1;
this.j = j;
int N = P.length;
if (!(1 <= this.i && this.i <= N - 1)) throw new AssertionError(this);
if (!(0 <= this.j && this.j <= N - 2)) throw new AssertionError(this);
int[] Q = new int[N - 2];
for (int k = 0;k < i;++ k) Q[k] = P[k];
for (int k = i + 2;k < N;++ k) Q[k - 2] = P[k];
int ins1 = P[i], ins2 = P[i + 1];
for (int k = 0;k < j;++ k) P[k] = Q[k];
P[j] = ins1;
P[j + 1] = ins2;
for (int k = j;k < Q.length;++ k) P[k + 2] = Q[k];
}
@Override
public String toString() {
return i + " " + j;
}
}
TreeSet<Test> test(int N) {
TreeSet<Test> set = new TreeSet<>();
Queue<Test> bfs = new ArrayDeque<>();
set.add(new Test(N));
bfs.add(new Test(N));
while(!bfs.isEmpty()) {
Test t = bfs.poll();
for (Test next : t.test()) {
if (set.add(next)) bfs.add(next);
}
}
return set;
}
class Test implements Comparable<Test>{
int[] P;
Test(int N) {
P = new int[N];
for (int i = 0;i < N;++ i) P[i] = i + 1;
}
private Test(int[] P) {
this.P = P;
}
ArrayList<Test> test() {
ArrayList<Test> test = new ArrayList<>();
int N = P.length;
for (int i = 1;i < N;++ i) {
int[] Q = new int[N - 2];
for (int j = 0;j < i - 1;++ j) Q[j] = P[j];
for (int j = i + 1;j < N;++ j) Q[j - 2] = P[j];
for (int j = 0;j <= N - 2;++ j) {
int[] P = new int[N];
for (int k = 0;k < j;++ k) P[k] = Q[k];
P[j] = this.P[i - 1];
P[j + 1] = this.P[i];
for (int k = j;k < Q.length;++ k) P[k + 2] = Q[k];
test.add(new Test(P));
}
}
return test;
}
@Override
public int hashCode() {
return Arrays.hashCode(P);
}
@Override
public boolean equals(Object o) {
if (o instanceof Test) {
return Arrays.equals(P, ((Test)o).P);
}
return false;
}
@Override
public int compareTo(Test o) {
for (int i = 0;i < P.length;++ i) {
int comp = Integer.compare(P[i], o.P[i]);
if (comp != 0) return comp;
}
return 0;
}
@Override
public String toString() {
return Arrays.toString(P);
}
}
/** デバッグ用コードのお供に */
private static boolean DEBUG = false;
/** 確保するメモリの大きさ(単位: MB) */
private static final long MEMORY = 64;
private final FastIO io;
private final String[] args;
public static void main(final String[] args) {
Thread.setDefaultUncaughtExceptionHandler((t, e) -> {
e.printStackTrace();
System.exit(1);
});
FastIO.setFastStandardOutput(true);
new Thread(null, new Main(args), "", MEMORY * 1048576L).start();
}
public Main(final String[] args) {
this(new FastIO(), args);
}
public Main(final FastIO io, final String... args) {
this.io = io;
this.args = args;
if (DEBUG) io.setAutoFlush(true);
}
@Override
public void run() {
try {
solve(io, args);
} catch (final Throwable e) {
throw e;
} finally {
io.close();
FastIO.setFastStandardOutput(false);
}
}
// 以下、ライブラリ
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static int exponent10(final int n, final int e) {
return n * pow(10, e);
}
/**
* 指数表記の値を整数で返します。
*
* @param n 仮数部
* @param e 指数部
* @return n * 10^e
*/
public static long exponent10L(final int n, final int e) {
return n * pow(10L, e);
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static int pow(final int a, int b) {
int ans = 1;
for (int mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(int a, int b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
/**
* aのb乗を返します。
*
* @param a 整数
* @param b 整数
* @return aのb乗
*/
public static long pow(final long a, long b) {
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul *= mul) if ((b & 1) != 0) ans *= mul;
return ans;
}
/**
* aのb乗をmodを法として計算したものを返します。
*
* @param a 整数
* @param b 整数
* @param mod 法
* @return aのb乗をmodを法として計算したもの
*/
public static int pow(long a, long b, final int mod) {
a %= mod;
if (a < 0) a += mod;
if (b < 0) {
b %= mod - 1;
b += mod - 1;
}
long ans = 1;
for (long mul = a; b > 0; b >>= 1, mul = mul * mul % mod) if ((b & 1) != 0) ans = ans * mul % mod;
return (int) ans;
}
public enum BoundType {
CLOSED, OPEN;
}
public static class Range<C> implements Serializable {
private static final long serialVersionUID = -4702828934863023392L;
protected C lower;
protected C upper;
protected BoundType lowerType;
protected BoundType upperType;
private Comparator<? super C> comparator;
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType) {
this(lower, lowerType, upper, upperType, null);
}
protected Range(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final Comparator<? super C> comparator) {
this.lower = lower;
this.upper = upper;
this.lowerType = lowerType;
this.upperType = upperType;
this.comparator = comparator;
}
public static <C extends Comparable<? super C>> Range<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType) {
if (lower != null && upper != null) {
final int comp = lower.compareTo(upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
}
return new Range<>(lower, lowerType, upper, upperType);
}
public static <C> Range<C> range(final C lower, final BoundType lowerType, final C upper,
final BoundType upperType, final Comparator<? super C> comparator) {
if (lower != null && upper != null) {
final int comp = comparator.compare(lower, upper);
if (comp > 0) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> all() {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> all(final Comparator<? super C> comparator) {
return range((C) null, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atMost(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> atMost(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> lessThan(final C upper) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> lessThan(final C upper, final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> downTo(final C upper, final BoundType boundType) {
return range(null, BoundType.OPEN, upper, boundType);
}
public static <C> Range<C> downTo(final C upper, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(null, BoundType.OPEN, upper, boundType, comparator);
}
public static <C extends Comparable<? super C>> Range<C> atLeast(final C lower) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN);
}
public static <C> Range<C> atLeast(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> greaterThan(final C lower) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN);
}
public static <C> Range<C> greaterThan(final C lower, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> upTo(final C lower, final BoundType boundType) {
return range(lower, boundType, null, BoundType.OPEN);
}
public static <C> Range<C> upTo(final C lower, final BoundType boundType,
final Comparator<? super C> comparator) {
return range(lower, boundType, null, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> open(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static <C> Range<C> open(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> openClosed(final C lower, final C upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static <C> Range<C> openClosed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closedOpen(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static <C> Range<C> closedOpen(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, comparator);
}
public static <C extends Comparable<? super C>> Range<C> closed(final C lower, final C upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> closed(final C lower, final C upper, final Comparator<? super C> comparator) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> singleton(final C value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static <C> Range<C> singleton(final C value, final Comparator<? super C> comparator) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> empty() {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED);
}
public static <C> Range<C> empty(final Comparator<? super C> comparator) {
return range((C) null, BoundType.CLOSED, null, BoundType.CLOSED, comparator);
}
public static <C extends Comparable<? super C>> Range<C> encloseAll(final Iterable<C> values) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (lower.compareTo(i) > 0) lower = i;
if (upper.compareTo(i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static <C> Range<C> encloseAll(final Iterable<C> values, final Comparator<? super C> comparator) {
C lower = values.iterator().next();
C upper = lower;
for (final C i : values) {
if (comparator.compare(lower, i) > 0) lower = i;
if (comparator.compare(upper, i) < 0) upper = i;
}
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, comparator);
}
protected int compareLower(final C value) {
return compareLower(value, BoundType.CLOSED);
}
protected int compareLower(final C value, final BoundType boundType) {
return compareLower(lower, lowerType, value, boundType);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value) {
return compareLower(lower, lowerType, value, BoundType.CLOSED);
}
protected int compareLower(final C lower, final BoundType lowerType, final C value, final BoundType boundType) {
if (lower == null) return value == null ? 0 : -1;
else if (value == null) return 1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) lower;
compare = comp.compareTo(value);
} else compare = comparator.compare(lower, value);
if (compare == 0) {
if (lowerType == BoundType.CLOSED) --compare;
if (boundType == BoundType.CLOSED) ++compare;
}
return compare;
}
protected int compareUpper(final C value) {
return compareUpper(value, BoundType.CLOSED);
}
protected int compareUpper(final C value, final BoundType boundType) {
return compareUpper(upper, upperType, value, boundType);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value) {
return compareUpper(upper, upperType, value, BoundType.CLOSED);
}
protected int compareUpper(final C upper, final BoundType upperType, final C value, final BoundType boundType) {
if (upper == null) return value == null ? 0 : 1;
if (value == null) return -1;
int compare;
if (comparator == null) {
@SuppressWarnings("unchecked")
final Comparable<C> comp = (Comparable<C>) upper;
compare = comp.compareTo(value);
} else compare = comparator.compare(upper, value);
if (compare == 0) {
if (upperType == BoundType.CLOSED) ++compare;
if (boundType == BoundType.CLOSED) --compare;
}
return compare;
}
public boolean hasLowerBound() {
return lower != null;
}
public C lowerEndpoint() {
if (hasLowerBound()) return lower;
throw new IllegalStateException();
}
public BoundType lowerBoundType() {
if (hasLowerBound()) return lowerType;
throw new IllegalStateException();
}
public boolean hasUpperBound() {
return upper != null;
}
public C upperEndpoint() {
if (hasUpperBound()) return upper;
throw new IllegalStateException();
}
public BoundType upperBoundType() {
if (hasUpperBound()) return upperType;
throw new IllegalStateException();
}
/**
* この区間が空集合か判定します。
*
* @return 空集合ならばtrue
*/
public boolean isEmpty() { return lower == null && upper == null && lowerType == BoundType.CLOSED; }
/**
* 与えられた引数が区間の左側に位置するか判定します。<br>
* 接する場合は区間の左側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の左側に位置するならtrue
*/
public boolean isLess(final C value) {
return isLess(value, BoundType.CLOSED);
}
protected boolean isLess(final C value, final BoundType boundType) {
return compareLower(value, boundType) > 0;
}
/**
* 与えられた引数が区間の右側に位置するか判定します。<br>
* 接する場合は区間の右側ではないと判定します。
*
* @param value 調べる引数
* @return 区間の右側に位置するならtrue
*/
public boolean isGreater(final C value) {
return isGreater(value, BoundType.CLOSED);
}
private boolean isGreater(final C value, final BoundType boundType) {
return compareUpper(value, boundType) < 0;
}
/**
* 与えられた引数が区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる引数
* @return 区間内に位置するならtrue
*/
public boolean contains(final C value) {
return !isLess(value) && !isGreater(value) && !isEmpty();
}
/**
* 与えられた引数すべてが区間内に位置するか判定します。<br>
* 接する場合も区間内に位置すると判定します。
*
* @param value 調べる要素
* @return 全ての要素が区間内に位置するならtrue
*/
public boolean containsAll(final Iterable<? extends C> values) {
for (final C i : values) if (!contains(i)) return false;
return true;
}
/**
* 与えられた区間がこの区間に内包されるか判定します。<br>
*
* @param other
* @return 与えられた区間がこの区間に内包されるならtrue
*/
public boolean encloses(final Range<C> other) {
return !isLess(other.lower, other.lowerType) && !isGreater(other.upper, other.upperType);
}
/**
* 与えられた区間がこの区間と公差するか判定します。<br>
* 接する場合は公差するものとします。
*
* @param value 調べる引数
* @return 区間が交差するならtrue
*/
public boolean isConnected(final Range<C> other) {
if (this.isEmpty() || other.isEmpty()) return false;
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = other.lower;
lowerType = other.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = other.upper;
upperType = other.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (lower == null || upper == null) return true;
final int comp = compareLower(lower, lowerType, upper, upperType);
return comp <= 0;
}
/**
* この区間との積集合を返します。
*
* @param connectedRange 積集合を求める区間
* @return 積集合
*/
public Range<C> intersection(final Range<C> connectedRange) {
if (this.isEmpty() || connectedRange.isEmpty()) {
if (comparator == null) return new Range<>(null, BoundType.CLOSED, null, BoundType.CLOSED);
return empty(comparator);
}
C lower, upper;
BoundType lowerType, upperType;
if (isLess(connectedRange.lower, connectedRange.lowerType)) {
lower = connectedRange.lower;
lowerType = connectedRange.lowerType;
} else {
lower = this.lower;
lowerType = this.lowerType;
}
if (isGreater(connectedRange.upper, connectedRange.upperType)) {
upper = connectedRange.upper;
upperType = connectedRange.upperType;
} else {
upper = this.upper;
upperType = this.upperType;
}
if (comparator == null) { return new Range<>(lower, lowerType, upper, upperType); }
return range(lower, lowerType, upper, upperType, comparator);
}
/**
* この区間との和集合を返します。
*
* @param other 和集合を求める区間
* @return 和集合
*/
public Range<C> span(final Range<C> other) {
if (other.isEmpty()) return new Range<>(lower, lowerType, upper, upperType);
C lower, upper;
BoundType lowerType, upperType;
if (isLess(other.lower, other.lowerType)) {
lower = this.lower;
lowerType = this.lowerType;
} else {
lower = other.lower;
lowerType = other.lowerType;
}
if (isGreater(other.upper, other.upperType)) {
upper = this.upper;
upperType = this.upperType;
} else {
upper = other.upper;
upperType = other.upperType;
}
return new Range<>(lower, lowerType, upper, upperType, comparator);
}
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static <C> List<Range<C>> scheduling(final List<Range<C>> ranges) {
final PriorityQueue<Range<C>> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
final List<Range<C>> ret = new ArrayList<>();
Range<C> last = pq.poll();
if (pq.isEmpty()) return ret;
ret.add(last);
while (!pq.isEmpty()) {
final Range<C> tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
@Override
public boolean equals(final Object object) {
if (this == object) return true;
if (object instanceof Range) {
@SuppressWarnings("unchecked")
final Range<C> comp = (Range<C>) object;
return compareLower(comp.lower, comp.lowerType) == 0 && compareUpper(comp.upper, comp.upperType) == 0
&& lowerType == comp.lowerType && upperType == comp.upperType;
}
return false;
}
@Override
public int hashCode() {
if (lower == null && upper == null) return 0;
else if (lower == null) return upper.hashCode();
else if (upper == null) return lower.hashCode();
return lower.hashCode() ^ upper.hashCode();
}
@Override
public String toString() {
if (isEmpty()) return "()";
return (lowerType == BoundType.OPEN ? "(" : "[") + (lower == null ? "" : lower.toString()) + ".."
+ (upper == null ? "" : upper.toString()) + (upperType == BoundType.OPEN ? ")" : "]");
}
}
public static class IterableRange<C> extends Range<C> implements Iterable<C> {
private static final long serialVersionUID = 9065915259748260688L;
protected UnaryOperator<C> func;
protected IterableRange(final C lower, final BoundType lowerType, final C upper, final BoundType upperType,
final UnaryOperator<C> func) {
super(lower, lowerType, upper, upperType);
this.func = func;
}
public static <C extends Comparable<? super C>> IterableRange<C> range(final C lower, final BoundType lowerType,
final C upper, final BoundType upperType, final UnaryOperator<C> func) {
if (lower == null || upper == null)
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
final int comp = lower.compareTo(upper);
if (comp > 0) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
else if (comp == 0 && (lowerType == BoundType.OPEN || upperType == BoundType.OPEN))
return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return new IterableRange<>(lower, lowerType, upper, upperType, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> open(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> openClosed(final C lower, final C upper,
final UnaryOperator<C> func) {
if (lower == null) return new IterableRange<>(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
return range(func.apply(lower), BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closedOpen(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> closed(final C lower, final C upper,
final UnaryOperator<C> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static <C extends Comparable<? super C>> IterableRange<C> singleton(final C value,
final UnaryOperator<C> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
protected class Iter implements Iterator<C> {
C now;
Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return !isGreater(now);
}
@Override
public final C next() {
final C ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
protected class EmptyIter implements Iterator<C> {
@Override
public boolean hasNext() {
return false;
}
@Override
public C next() {
return null;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<C> iterator() {
return lower == null || upper == null ? new EmptyIter() : new Iter();
}
public int getDistance() {
C check = upper;
int ret = 0;
while (lower != check) {
check = func.apply(check);
++ret;
}
return ret;
}
}
public static class IntRange extends IterableRange<Integer> {
private static final long serialVersionUID = 5623995336491967216L;
private final boolean useFastIter;
private static class Next implements UnaryOperator<Integer> {
@Override
public Integer apply(final Integer value) {
return value + 1;
}
}
protected IntRange() {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, new Next());
useFastIter = true;
}
protected IntRange(final UnaryOperator<Integer> func) {
super(null, BoundType.CLOSED, null, BoundType.CLOSED, func);
useFastIter = false;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType) {
super(lower, lowerType, upper, upperType, new Next());
useFastIter = true;
}
protected IntRange(final int lower, final BoundType lowerType, final int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
super(lower, lowerType, upper, upperType, func);
useFastIter = false;
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType) {
if (lower > upper) return new IntRange();
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange range(int lower, final BoundType lowerType, int upper, final BoundType upperType,
final UnaryOperator<Integer> func) {
if (lower > upper) return new IntRange(func);
if (lowerType == BoundType.OPEN) ++lower;
if (upperType == BoundType.OPEN) --upper;
return new IntRange(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange open(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN);
}
public static IntRange open(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.OPEN, func);
}
public static IntRange open(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange open(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange openClosed(final int lower, final int upper) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED);
}
public static IntRange openClosed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.OPEN, upper, BoundType.CLOSED, func);
}
public static IntRange closedOpen(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN);
}
public static IntRange closedOpen(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.OPEN, func);
}
public static IntRange closed(final int lower, final int upper) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int lower, final int upper, final UnaryOperator<Integer> func) {
return range(lower, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange closed(final int upper) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED);
}
public static IntRange closed(final int upper, final UnaryOperator<Integer> func) {
return range(0, BoundType.CLOSED, upper, BoundType.CLOSED, func);
}
public static IntRange singleton(final int value) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED);
}
public static IntRange singleton(final int value, final UnaryOperator<Integer> func) {
return range(value, BoundType.CLOSED, value, BoundType.CLOSED, func);
}
private class FastIter implements Iterator<Integer> {
int now;
public FastIter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
return now++;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
private class Iter implements Iterator<Integer> {
int now;
public Iter() {
now = lower;
}
@Override
public final boolean hasNext() {
return now <= upper;
}
@Override
public final Integer next() {
final int ret = now;
now = func.apply(now);
return ret;
}
@Override
public final void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<Integer> iterator() {
return lower == null || upper == null ? new EmptyIter() : useFastIter ? new FastIter() : new Iter();
}
@Override
public int getDistance() {
int ret = upper - lower;
if (upperType == BoundType.CLOSED) ++ret;
return ret;
}
public int getClosedLower() { return lower; }
public int getOpenLower() { return lower - 1; }
public int getClosedUpper() { return upperType == BoundType.CLOSED ? upper : upper - 1; }
public int getOpenUpper() { return upperType == BoundType.CLOSED ? upper + 1 : upper; }
/**
* 区間スケジューリングを行います。<br>
* 計算量は要素数Nに対してO(NlogN)です。
*
* @param ranges 区間の集合
* @return 区間スケジューリングを行った際の一つの解
*/
public static List<IntRange> intScheduling(final List<IntRange> ranges) {
final PriorityQueue<IntRange> pq = new PriorityQueue<>((l, r) -> l.compareUpper(r.upper, r.upperType));
pq.addAll(ranges);
final List<IntRange> ret = new ArrayList<>();
if (pq.isEmpty()) return ret;
IntRange last = pq.poll();
ret.add(last);
while (!pq.isEmpty()) {
final IntRange tmp = pq.poll();
if (tmp.compareLower(last.upper, last.upperType) > 0) {
ret.add(tmp);
last = tmp;
}
}
return ret;
}
}
/**
* 演算が結合法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Associative<T> extends BinaryOperator<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、1以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
public default T hyper(final T element, int repeat) {
if (repeat < 1) throw new IllegalArgumentException("undefined operation");
T ret = element;
--repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* この演算が逆元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Inverse<T> extends BinaryOperator<T> {
public T inverse(T element);
}
/**
* 演算が交換法則を満たすことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Commutative<T> extends BinaryOperator<T> {
}
/**
* 演算が単位元を持つことを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Identity<T> extends BinaryOperator<T> {
/**
* 単位元を返します。
*
* @return 単位元
*/
public T identity();
}
/**
* 演算が群であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Group<T> extends Monoid<T>, Inverse<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
T ret = identity();
if (repeat < 0) {
repeat = -repeat;
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return inverse(ret);
}
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算がモノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Monoid<T> extends Associative<T>, Identity<T> {
/**
* repeat個のelementを順次演算した値を返します。
*
* @param element 演算する値
* @param repeat 繰り返す回数、0以上であること
* @return 演算を+として、element + element + ... + elementと演算をrepeat-1回行った値
*/
@Override
public default T hyper(final T element, int repeat) {
if (repeat < 0) throw new IllegalArgumentException("undefined operation");
T ret = identity();
for (T mul = element; repeat > 0; repeat >>= 1, mul = apply(mul, mul))
if ((repeat & 1) != 0) ret = apply(ret, mul);
return ret;
}
}
/**
* 演算が可換モノイドであることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface CommutativeMonoid<T> extends Monoid<T>, Commutative<T> {
}
/**
* 演算がアーベル群(可換群)であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
*/
public interface Abelian<T> extends Group<T>, CommutativeMonoid<T> {
}
/**
* 演算が半環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Semiring<T, A extends CommutativeMonoid<T>, M extends Monoid<T>> {
public A getAddition();
public M getMultiplication();
public default T add(final T left, final T right) {
return getAddition().apply(left, right);
}
public default T multiply(final T left, final T right) {
return getMultiplication().apply(left, right);
}
public default T additiveIdentity() {
return getAddition().identity();
}
public default T multipleIdentity() {
return getMultiplication().identity();
}
public default int characteristic() {
return 0;
}
}
/**
* 演算が環であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Ring<T, A extends Abelian<T>, M extends Monoid<T>> extends Semiring<T, A, M> {
}
/**
* 演算が可換環に属することを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface CommutativeRing<T, A extends Abelian<T>, M extends CommutativeMonoid<T>> extends Ring<T, A, M> {
}
/**
* 演算が整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegralDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends CommutativeRing<T, A, M> {
public boolean isDivisible(T left, T right);
public T divide(T left, T right);
}
/**
* 演算が整閉整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface IntegrallyClosedDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegralDomain<T, A, M> {
}
/**
* 演算がGCD整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface GCDDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends IntegrallyClosedDomain<T, A, M> {
public T gcd(T left, T right);
public T lcm(T left, T right);
}
/**
* 素元を提供します。
*
* @author 31536000
*
* @param <T> 演算の型
*/
public static class PrimeElement<T> {
public final T element;
public PrimeElement(final T element) {
this.element = element;
}
}
public interface MultiSet<E> extends Collection<E> {
public int add(E element, int occurrences);
public int count(Object element);
public Set<E> elementSet();
public boolean remove(Object element, int occurrences);
public int setCount(E element, int count);
public boolean setCount(E element, int oldCount, int newCount);
}
/**
* 演算が一意分解整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface UniqueFactorizationDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends GCDDomain<T, A, M> {
public MultiSet<PrimeElement<T>> PrimeFactorization(T x);
}
/**
* 演算が主イデアル整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface PrincipalIdealDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends UniqueFactorizationDomain<T, A, M> {
}
/**
* 演算がユークリッド整域であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface EuclideanDomain<T, A extends Abelian<T>, M extends CommutativeMonoid<T>>
extends PrincipalIdealDomain<T, A, M> {
public T reminder(T left, T right);
}
/**
* 演算が体であることを示すために使用するマーカー・インターフェースです。
*
* @author 31536000
*
* @param <T> 二項演算の型
* @param <A> 和に関する演算
* @param <M> 積に関する演算
*/
public interface Field<T, A extends Abelian<T>, M extends Abelian<T>> extends EuclideanDomain<T, A, M> {
@Override
public default boolean isDivisible(final T left, final T right) {
return !right.equals(additiveIdentity());
}
@Override
public default T divide(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return multiply(left, getMultiplication().inverse(right));
}
@Override
public default T reminder(final T left, final T right) {
if (isDivisible(left, right)) throw new ArithmeticException("divide by Additive Identify");
return additiveIdentity();
}
@Override
public default T gcd(final T left, final T right) {
return multipleIdentity();
}
@Override
public default T lcm(final T left, final T right) {
return multipleIdentity();
}
@Override
public default MultiSet<PrimeElement<T>> PrimeFactorization(final T x) {
final HashMultiSet<PrimeElement<T>> ret = HashMultiSet.create(1);
ret.add(new PrimeElement<>(x));
return ret;
}
}
public static class HashMultiSet<E> implements MultiSet<E>, Serializable {
private static final long serialVersionUID = -8378919645386251159L;
private final transient HashMap<E, Integer> map;
private transient int size;
private HashMultiSet() {
map = new HashMap<>();
size = 0;
}
private HashMultiSet(final int distinctElements) {
map = new HashMap<>(distinctElements);
size = 0;
}
public static <E> HashMultiSet<E> create() {
return new HashMultiSet<>();
}
public static <E> HashMultiSet<E> create(final int distinctElements) {
return new HashMultiSet<>(distinctElements);
}
public static <E> HashMultiSet<E> create(final Iterable<? extends E> elements) {
final HashMultiSet<E> ret = new HashMultiSet<>();
for (final E i : elements) ret.map.compute(i, (v, e) -> e == null ? 1 : ++e);
return ret;
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() { return size == 0; }
@Override
public boolean contains(final Object o) {
return map.containsKey(o);
}
private class Iter implements Iterator<E> {
private final Iterator<Entry<E, Integer>> iter = map.entrySet().iterator();
private E value;
private int count = 0;
@Override
public boolean hasNext() {
if (count > 0) return true;
if (iter.hasNext()) {
final Entry<E, Integer> entry = iter.next();
value = entry.getKey();
count = entry.getValue();
return true;
}
return false;
}
@Override
public E next() {
--count;
return value;
}
}
@Override
public Iterator<E> iterator() {
return new Iter();
}
@Override
public Object[] toArray() {
final Object[] ret = new Object[size];
int read = 0;
for (final Entry<E, Integer> i : map.entrySet()) Arrays.fill(ret, read, read += i.getValue(), i.getKey());
return ret;
}
@Override
public <T> T[] toArray(final T[] a) {
final Object[] src = toArray();
if (a.length < src.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(src, 0, src.length, a.getClass());
return ret;
}
System.arraycopy(src, 0, a, 0, src.length);
return a;
}
@Override
public boolean add(final E e) {
add(e, 1);
return true;
}
@Override
public boolean remove(final Object o) {
return remove(o, 1);
}
@Override
public boolean containsAll(final Collection<?> c) {
boolean ret = true;
for (final Object i : c) ret |= contains(i);
return ret;
}
@Override
public boolean addAll(final Collection<? extends E> c) {
boolean ret = false;
for (final E i : c) ret |= add(i);
return ret;
}
@Override
public boolean removeAll(final Collection<?> c) {
boolean ret = false;
for (final Object i : c) ret |= remove(i);
return ret;
}
@Override
public boolean retainAll(final Collection<?> c) {
return removeAll(c);
}
@Override
public void clear() {
map.clear();
size = 0;
}
@Override
public int add(final E element, final int occurrences) {
size += occurrences;
return map.compute(element, (k, v) -> v == null ? occurrences : v + occurrences) - occurrences;
}
@Override
public int count(final Object element) {
return map.getOrDefault(element, 0);
}
@Override
public Set<E> elementSet() {
return map.keySet();
}
public Set<Entry<E, Integer>> entrySet() {
return map.entrySet();
}
@Override
public boolean remove(final Object element, final int occurrences) {
try {
@SuppressWarnings("unchecked")
final E put = (E) element;
return map.compute(put, (k, v) -> {
if (v == null) return null;
if (v < occurrences) {
size -= v;
return null;
}
size -= occurrences;
return v - occurrences;
}) != null;
} catch (final ClassCastException E) {
return false;
}
}
@Override
public int setCount(final E element, final int count) {
final Integer ret = map.put(element, count);
final int ret2 = ret == null ? 0 : ret;
size += count - ret2;
return ret2;
}
@Override
public boolean setCount(final E element, final int oldCount, final int newCount) {
final boolean ret = map.replace(element, oldCount, newCount);
if (ret) size += newCount - oldCount;
return ret;
}
}
public static class ModInteger extends Number
implements Field<ModInteger, Abelian<ModInteger>, Abelian<ModInteger>> {
private static final long serialVersionUID = -8595710127161317579L;
private final int mod;
private int num;
private final Addition add;
private final Multiplication mul;
private class Addition implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 0);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.mod - element.num);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).addEqual(right);
}
}
private class Multiplication implements Abelian<ModInteger> {
@Override
public ModInteger identity() {
return new ModInteger(mod, 1);
}
@Override
public ModInteger apply(final ModInteger left, final ModInteger right) {
return new ModInteger(left).multiplyEqual(right);
}
@Override
public ModInteger inverse(final ModInteger element) {
return new ModInteger(element, element.inverse(element.num));
}
}
@Override
public int characteristic() {
return mod;
}
public ModInteger(final int mod) {
this.mod = mod;
num = 0;
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final int mod, final int num) {
this.mod = mod;
this.num = validNum(num);
add = new Addition();
mul = new Multiplication();
}
public ModInteger(final ModInteger n) {
mod = n.mod;
num = n.num;
add = n.add;
mul = n.mul;
}
private ModInteger(final ModInteger n, final int num) {
mod = n.mod;
this.num = num;
add = n.add;
mul = n.mul;
}
private int validNum(int n) {
n %= mod;
if (n < 0) n += mod;
return n;
}
private int validNum(long n) {
n %= mod;
if (n < 0) n += mod;
return (int) n;
}
protected int inverse(int n) {
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
}
public boolean isPrime(final int n) {
if ((n & 1) == 0) return false; // 偶数
for (int i = 3, j = 8, k = 9; k <= n; i += 2, k += j += 8) if (n % i == 0) return false;
return true;
}
@Override
public int intValue() {
return num;
}
@Override
public long longValue() {
return num;
}
@Override
public float floatValue() {
return num;
}
@Override
public double doubleValue() {
return num;
}
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInteger(mod);
}
public ModInteger add(final int n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final long n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger add(final ModInteger n) {
return getNewInstance(this).addEqual(n);
}
public ModInteger addEqual(final int n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final long n) {
num = validNum(num + n);
return this;
}
public ModInteger addEqual(final ModInteger n) {
if ((num += n.num) >= mod) num -= mod;
return this;
}
public ModInteger subtract(final int n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final long n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtract(final ModInteger n) {
return getNewInstance(this).subtractEqual(n);
}
public ModInteger subtractEqual(final int n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final long n) {
num = validNum(num - n);
return this;
}
public ModInteger subtractEqual(final ModInteger n) {
if ((num -= n.num) < 0) num += mod;
return this;
}
public ModInteger multiply(final int n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final long n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiply(final ModInteger n) {
return getNewInstance(this).multiplyEqual(n);
}
public ModInteger multiplyEqual(final int n) {
num = (int) ((long) num * n % mod);
if (num < 0) num += mod;
return this;
}
public ModInteger multiplyEqual(final long n) {
return multiplyEqual((int) (n % mod));
}
public ModInteger multiplyEqual(final ModInteger n) {
num = (int) ((long) num * n.num % mod);
return this;
}
public ModInteger divide(final int n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final long n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divide(final ModInteger n) {
return getNewInstance(this).divideEqual(n);
}
public ModInteger divideEqual(final int n) {
num = (int) ((long) num * inverse(validNum(n)) % mod);
return this;
}
public ModInteger divideEqual(final long n) {
return divideEqual((int) (n % mod));
}
public ModInteger divideEqual(final ModInteger n) {
num = (int) ((long) num * n.inverse(n.num) % mod);
return this;
}
public ModInteger pow(final int n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final long n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger pow(final ModInteger n) {
return getNewInstance(this).powEqual(n);
}
public ModInteger powEqual(int n) {
long ans = 1, num = this.num;
if (n < 0) {
n = -n;
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = inverse((int) ans);
return this;
}
while (n != 0) {
if ((n & 1) != 0) ans = ans * num % mod;
n >>>= 1;
num = num * num % mod;
}
this.num = (int) ans;
return this;
}
public ModInteger powEqual(final long n) {
return powEqual((int) (n % (mod - 1)));
}
public ModInteger powEqual(final ModInteger n) {
long num = this.num;
this.num = 1;
int mul = n.num;
while (mul != 0) {
if ((mul & 1) != 0) this.num *= num;
mul >>>= 1;
num *= num;
num %= mod;
}
return this;
}
public ModInteger equal(final int n) {
num = validNum(n);
return this;
}
public ModInteger equal(final long n) {
num = validNum(n);
return this;
}
public ModInteger equal(final ModInteger n) {
num = n.num;
return this;
}
public int toInt() {
return num;
}
public int getMod() { return mod; }
@Override
public boolean equals(final Object x) {
if (x instanceof ModInteger) return ((ModInteger) x).num == num && ((ModInteger) x).mod == mod;
return false;
}
@Override
public int hashCode() {
return num ^ mod;
}
@Override
public String toString() {
return String.valueOf(num);
}
@Deprecated
public String debug() {
int min = num, ans = 1;
for (int i = 2; i < min; ++i) {
final int tmp = multiply(i).num;
if (min > tmp) {
min = tmp;
ans = i;
}
}
return min + "/" + ans;
}
@Override
public Addition getAddition() { return add; }
@Override
public Multiplication getMultiplication() { return mul; }
}
/**
* 素数を法とする演算上で、組み合わせの計算を高速に行います。
*
* @author 31536000
*
*/
public static class ModUtility {
private final int mod;
private int[] fact, inv, invfact;
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
*/
public ModUtility(final Prime mod) {
this(mod, 2);
}
/**
* modを法として、演算を行います。
*
* @param mod 法とする素数
* @param calc 予め前計算しておく大きさ
*/
public ModUtility(final Prime mod, final int calc) {
this.mod = mod.prime;
precalc(calc);
}
/**
* calcの大きさだけ、前計算を行います。
*
* @param calc 前計算をする大きさ
*/
public void precalc(int calc) {
++calc;
if (calc < 2) calc = 2;
if (calc > mod) calc = mod;
fact = new int[calc];
inv = new int[calc];
invfact = new int[calc];
fact[0] = invfact[0] = fact[1] = invfact[1] = inv[1] = 1;
for (int i = 2; i < calc; ++i) {
fact[i] = (int) ((long) fact[i - 1] * i % mod);
inv[i] = (int) (mod - (long) inv[mod % i] * (mod / i) % mod);
invfact[i] = (int) ((long) invfact[i - 1] * inv[i] % mod);
}
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @return modを法とする整数、初期値は0
*/
public ModInteger create() {
return new ModInt();
}
/**
* modを法とする剰余環上で振舞う整数を返します。
*
* @param n 初期値
* @return modを法とする整数
*/
public ModInteger create(final int n) {
return new ModInt(n);
}
private class ModInt extends ModInteger {
private static final long serialVersionUID = -2435281861935422575L;
public ModInt() {
super(mod);
}
public ModInt(final int n) {
super(mod, n);
}
public ModInt(final ModInteger mod) {
super(mod);
}
@Override
protected ModInteger getNewInstance(final ModInteger mod) {
return new ModInt(mod);
}
@Override
protected int inverse(final int n) {
return ModUtility.this.inverse(n);
}
}
/**
* modを法として、nの逆元を返します。<br>
* 計算量はO(log n)です。
*
* @param n 逆元を求めたい値
* @return 逆元
*/
public int inverse(int n) {
try {
if (inv.length > n) return inv[n];
int m = mod, u = 0, v = 1, t;
while (n != 0) {
t = m / n;
m -= t * n;
u -= t * v;
if (m != 0) {
t = n / m;
n -= t * m;
v -= t * u;
} else {
v %= mod;
if (v < 0) v += mod;
return v;
}
}
u %= mod;
if (u < 0) u += mod;
return u;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* n!を、modを法として求めた値を返します。<br>
* 計算量はO(n)です。
*
* @param n 階乗を求めたい値
* @return nの階乗をmodで割った余り
*/
public int factorial(final int n) {
try {
if (fact.length > n) return fact[n];
long ret = fact[fact.length - 1];
for (int i = fact.length; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
} catch (final ArrayIndexOutOfBoundsException e) {
throw new IllegalArgumentException();
}
}
/**
* nPkをmodで割った余りを求めます。<br>
* 計算量はO(n-k)です。
*
* @param n 左辺
* @param k 右辺
* @return nPkをmodで割った余り
*/
public int permutation(final int n, final int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[n - k] % mod);
long ret = 1;
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* nCkをmodで割った余りを求めます。<br>
* 計算量はO(min(plogn, n-k))です。
*
* @param n 左辺
* @param k 右辺
* @return nCkをmodで割った余り
*/
public int combination(int n, int k) {
if (n < 0) throw new IllegalArgumentException();
if (n < k) return 0;
if (fact.length > n) return (int) ((long) fact[n] * invfact[k] % mod * invfact[n - k] % mod);
long ret = 1;
if (n >= mod) {
if (mod == 2) return (~n & k) == 0 ? 1 : 0;
while (n > 0) {
ret = ret * combination(n % mod, k % mod) % mod;
n /= mod;
k /= mod;
}
return (int) ret;
}
if (n < 2 * k) k = n - k;
ret = invfact.length > k ? invfact[k] : inverse(factorial(k));
for (int i = n - k + 1; i <= n; ++i) ret = ret * i % mod;
return (int) ret;
}
/**
* 他項係数をmodで割った余りを求めます。<br>
* ] 計算量はO(n)です。
*
* @param n 左辺
* @param k 右辺、合計がn以下である必要がある
* @return 他項係数
*/
public int multinomial(final int n, final int... k) {
int sum = 0;
long ret = factorial(n);
if (fact.length > n) {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
ret = ret * invfact[i] % mod;
sum += i;
}
if (sum > n) return 0;
ret = ret * invfact[n - sum] % mod;
} else {
for (final int i : k) {
if (i < 0) throw new IllegalArgumentException();
if (invfact.length > i) ret = ret * invfact[i] % mod;
else ret = ret * inverse(factorial(i)) % mod;
sum += i;
}
if (sum > n) return 0;
if (invfact.length > n - sum) ret = ret * invfact[n - sum] % mod;
else ret = ret * inverse(factorial(n - sum)) % mod;
}
return (int) ret;
}
/**
* n個からk個を選ぶ重複組み合わせnHkをmodで割った余りを求めます。<br>
* 計算量はO(min(n, k))です。
*
* @param n 左辺
* @param k 右辺
* @return nHkをmodで割った余り
*/
public int multichoose(final int n, final int k) {
return combination(mod(n + k - 1), k);
}
/**
* カタラン数C(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいカタラン数の番号
* @return カタラン数
*/
public int catalan(final int n) {
return divide(combination(mod(2 * n), n), mod(n + 1));
}
/**
* 第一種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int firstStirling(final int n, final int k) {
final int[] stirling = new int[(n + 1) * (k + 1)];
stirling[0] = 1;
final int h = k + 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
final int tmp = stirling[i * h + j] + (int) ((long) i * stirling[i * h + j + 1] % mod);
stirling[(i + 1) * h + j + 1] = tmp >= mod ? tmp - mod : tmp;
}
}
return stirling[stirling.length - 1];
}
/**
* 第二種スターリング数S(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return S(n, k)をmodで割った余り
*/
public int secondStirling(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
}
long ans = 0;
for (int i = 1, s; i <= k; ++i) {
final long tmp = (long) combination(k, i)
* (prime[i] = (s = sieve[i]) == i ? pow(i, n) : (int) ((long) prime[s] * prime[i / s] % mod))
% mod;
ans += (k - i & 1) != 0 ? -tmp : tmp;
}
return (int) ((long) mod(ans) * invfact[k] % mod);
}
/**
* ベル数B(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(k)です。
*
* @param n 左辺
* @param k 右辺
* @return B(n, k)をmodで割った余り
*/
public int bell(final int n, final int k) {
if (k == 0) return n == 0 ? 1 : 0;
final int[] sieve = new int[k + 1], prime = new int[k + 1];
int size = 0;
sieve[1] = 1;
long sum = 0;
for (int i = 2; i <= k; ++i) {
if (sieve[i] == 0) prime[size++] = sieve[i] = i;
for (int j = 0, s; j < size && prime[j] <= sieve[i] && (s = i * prime[j]) <= k; ++j)
sieve[s] = prime[j];
sum += (i & 1) != 0 ? -invfact[i] : invfact[i];
}
sum = mod(sum);
long ans = 0;
for (int i = 0, s; i <= k; ++i) {
final long tmp = (long) (prime[i] = (s = sieve[i]) == i ? pow(i, n)
: (int) ((long) prime[s] * prime[i / s] % mod)) * invfact[i] % mod;
ans += tmp * sum % mod;
if ((sum -= (k - i & 1) != 0 ? -invfact[k - i] : invfact[k - i]) < 0) sum += mod;
}
return mod(ans);
}
/**
* ベル数B(n)をmodで割った余りを求めます。<br>
* 計算量はO(n)です。
*
* @param n 求めたいベル数の番号
* @return B(n)
*/
public int bell(final int n) {
return bell(n, n);
}
/**
* 分割数P(n, k)をmodで割った余りを求めます。<br>
* 計算量はO(nk)です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 左辺
* @param k 右辺
* @return P(n, k)をmodで割った余り
*/
public int pertition(final int n, final int k) {
final int[] pertition = new int[(n + 1) * (k + 1)];
pertition[0] = 1;
final int h = k + 1;
for (int i = 0; i <= n; ++i) {
for (int j = 1, l = Math.min(i, k); j <= l; ++j)
pertition[i * h + j] = pertition[i * h + j - 1] + pertition[(i - j) * h + j];
for (int j = i; j < k; ++j) pertition[i * h + j + 1] = pertition[i * h + j];
}
return pertition[n * h + k];
}
/**
* 分割数P(n)をmodで割った余りを求めます。<br>
* 計算量はO(n sqrt(n))です。 // TODO NTTを使うとO(n log n)、未実装
*
* @param n 求めたい分割数の番号
* @return P(n)
*/
public int pertition(final int n) {
final long[] pertition = new long[n + 1];
pertition[0] = 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1, t; (t = i - (j * (3 * j - 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
for (int j = 1, t; (t = i - (j * (3 * j + 1) >> 1)) >= 0; ++j) {
pertition[i] += (j & 1) != 0 ? pertition[t] : -pertition[t];
}
pertition[i] %= mod;
}
return (int) pertition[n];
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final int n, int m) {
long ans = 1, num = n;
if (m < 0) {
m = -m;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return inverse((int) ans);
}
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % mod;
m >>>= 1;
num = num * num % mod;
}
return (int) ans;
}
/**
* nのm乗をmodで割った余りを求めます。<br>
* 計算量はO(log m)です。
*
* @param n 床
* @param m 冪指数
* @return n^mをmodで割った余り
*/
public int pow(final long n, final long m) {
return pow((int) (n % mod), (int) (m % (mod - 1)));
}
/**
* 現在のmod値のトーシェント数を返します。<br>
* なお、これはmod-1に等しいです。
*
* @return トーシェント数
*/
public int totient() {
return mod - 1;
}
/**
* nのトーシェント数を返します。<br>
* 計算量はO(sqrt n)です。
*
* @param n トーシェント数を求めたい値
* @return nのトーシェント数
*/
public static int totient(int n) {
int totient = n;
for (int i = 2; i * i <= n; ++i) {
if (n % i == 0) {
totient = totient / i * (i - 1);
while ((n %= i) % i == 0);
}
}
if (n != 1) totient = totient / n * (n - 1);
return totient;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(int n) {
return (n %= mod) < 0 ? n + mod : n;
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(long n) {
return (int) ((n %= mod) < 0 ? n + mod : n);
}
/**
* nをmodで割った余りを返します。
*
* @param n 演算する値
* @return nをmodで割った余り
*/
public int mod(final PrimeFactor n) {
int ret = 1;
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
ret = multiply(ret, pow(i.getKey().prime, i.getValue()));
return ret;
}
/**
* n+mをmodで割った余りを返します。
*
* @param n 足される値
* @param m 足す値
* @return n+mをmodで割った余り
*/
public int add(final int n, final int m) {
return mod(n + m);
}
/**
* n-mをmodで割った余りを返します。
*
* @param n 引かれる値
* @param m 引く値
* @return n-mをmodで割った余り
*/
public int subtract(final int n, final int m) {
return mod(n - m);
}
/**
* n*mをmodで割った余りを返します。
*
* @param n 掛けられる値
* @param m 掛ける値
* @return n*mをmodで割った余り
*/
public int multiply(final int n, final int m) {
final int ans = (int) ((long) n * m % mod);
return ans < 0 ? ans + mod : ans;
}
/**
* n/mをmodで割った余りを返します。
*
* @param n 割られる値
* @param m 割る値
* @return n/mをmodで割った余り
*/
public int divide(final int n, final int m) {
return multiply(n, inverse(m));
}
/**
* fを通ることが分かっているfの要素数-1次の関数について、xの位置における値をmodで割った余りを返します。<br>
* 計算量はO(f)です。
*
* @param f 関数の形
* @param x 求める位置
* @return 求めたい値をmodで割った余り
*/
public ModInteger lagrangePolynomial(final ModInteger[] f, final int x) {
if (f.length > x) return f[x];
if (x > fact.length) precalc(x);
final ModInteger ret = create(0);
final ModInteger[] dp = new ModInteger[f.length], dp2 = new ModInteger[f.length];
dp[0] = create(1);
dp2[f.length - 1] = create(1);
for (int i = 1; i < f.length; ++i) {
dp[i] = dp[i - 1].multiply(x - i - 1);
dp2[f.length - i - 1] = dp2[f.length - i].multiply(x - f.length + i);
}
for (int i = 0; i < f.length; ++i) {
final ModInteger tmp = f[i].multiply(dp[i]).multiplyEqual(dp2[i]).multiplyEqual(inv[i])
.multiplyEqual(inv[f.length - 1 - i]);
if ((f.length - i & 1) == 0) ret.addEqual(tmp);
else ret.subtractEqual(tmp);
}
return ret;
}
/**
* 与えられた配列に対し、その配列を並び替えることで構成できる配列の集合をSとします。
* このとき、arrayがSを辞書順に並べると何番目かを求めます。
* @complexity N=array.length として O(N log N)
* @param array 辞書順で何番目か求めたい配列
* @return arrayが辞書順で何番目か
*/
public ModInteger permutationNumber(int[] array) {
int[] compress = ArrayUtility.compress(array);
int[] bucket = new int[array.length];
for (int i : compress) ++bucket[i];
int sum = multinomial(array.length, bucket);
int[] bit = new int[array.length + 1];
for (int i = 0; i < array.length; ++i)
for (int j = i + 1, add = bucket[i]; j < bit.length; j += j & -j) bit[j] += add;
int ans = 1;
for (int i = 0; i < array.length; ++i) {
sum = divide(sum, array.length - i);
int comp = compress[i];
int min = 0;
for (int j = comp; j != 0; j -= j & -j) min += bit[j];
ans = add(ans, multiply(sum, min));
sum = multiply(sum, bucket[comp]--);
for (int j = comp + 1; j < bit.length; j += j & -j) --bit[j];
}
return create(ans);
}
}
/**
* 区間における素数を保持する関数です。
*
* @author 31536000
*
*/
public static class SegmentPrime {
private final Prime[] divisor;
private final int offset;
private SegmentPrime(final Prime[] divisor, final int offset) {
this.divisor = divisor;
this.offset = offset;
}
/**
* このクラスが持つ区間の範囲を返します。
*
* @return 素数を保持している区間
*/
public IntRange getRange() { return IntRange.closedOpen(offset, offset + divisor.length); }
/**
* 素数かどうかを判定します。
*
* @param n 素数かどうか判定したい数
* @return 素数ならばtrue
*/
public boolean isPrime(final int n) {
return n <= 1 ? false : divisor[n - offset].prime == n;
}
/**
* 与えられた数を素因数分解します。<br>
* 計算量はO(log n)です。
*
* @param n 素因数分解したい数
* @return 素因数分解した結果
*/
public PrimeFactor getPrimeFactor(int n) {
if (n < 1) throw new IllegalArgumentException("not positive number");
final Map<Prime, Integer> map = new HashMap<>();
while (n > 1) {
final Prime d = divisor[n - offset];
map.compute(d, (k, v) -> v == null ? 1 : v + 1);
n /= d.prime;
}
return new PrimeFactor(map);
}
@Override
public String toString() {
return "SegmentPrime: [" + offset + ", " + (offset + divisor.length) + ")";
}
}
/**
* 整数の素因数分解表現を保持します。
*
* @author 31536000
*
*/
public static class PrimeFactor extends Number {
private static final long serialVersionUID = 1363575672283884773L;
public Map<Prime, Integer> primeFactor;
private PrimeFactor(final Map<Prime, Integer> n) {
primeFactor = n;
}
/**
* 素因数分解のリスト表現を返します。
*
* @return 素因数分解のリスト
*/
public List<Integer> getFactorizationList() {
final List<Integer> ret = new ArrayList<>();
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) {
final int p = i.getKey().prime, n = i.getValue();
for (int j = 0; j < n; ++j) ret.add(p);
}
return ret;
}
/**
* nとgcdを取った値を保持します。
*
* @param n gcdを取りたい値
*/
public void gcd(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
}
/**
* gcd(n, m)を返します。
*
* @param n gcdを取りたい値
* @param m gcdを取りたい値
* @return gcd(n, m)
*/
public static PrimeFactor gcd(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.computeIfPresent(i.getKey(), (k, v) -> Math.min(v, i.getValue()));
return new PrimeFactor(ret);
}
/**
* nとlcmを取った値を保持します。
*
* @param n lcmを取りたい値
*/
public void lcm(final PrimeFactor n) {
for (final Entry<Prime, Integer> i : n.primeFactor.entrySet())
primeFactor.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
}
/**
* lcm(n, m)を返します。
*
* @param n lcmを取りたい値
* @param m lcmを取りたい値
* @return lcm(n, m)
*/
public static PrimeFactor lcm(final PrimeFactor n, final PrimeFactor m) {
final Map<Prime, Integer> ret = new HashMap<>(n.primeFactor);
for (final Entry<Prime, Integer> i : m.primeFactor.entrySet())
ret.merge(i.getKey(), i.getValue(), (v1, v2) -> Math.max(v1, v2));
return new PrimeFactor(ret);
}
private static int pow(final int p, int n) {
int ans = 1;
for (int mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
private static long pow(final long p, long n) {
long ans = 1;
for (long mul = p; n > 0; n >>= 1, mul *= mul) if ((n & 1) != 0) ans *= mul;
return ans;
}
public BigInteger getValue() {
BigInteger ret = BigInteger.ONE;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret = ret.multiply(new BigInteger(i.getKey().toString()).pow(i.getValue()));
return ret;
}
@Override
public int intValue() {
int ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet()) ret *= pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public long longValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= pow((long) i.getKey().prime, i.getValue());
return ret;
}
@Override
public float floatValue() {
float ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public double doubleValue() {
long ret = 1;
for (final Entry<Prime, Integer> i : primeFactor.entrySet())
ret *= Math.pow(i.getKey().prime, i.getValue());
return ret;
}
@Override
public boolean equals(final Object o) {
return o instanceof PrimeFactor ? ((PrimeFactor) o).primeFactor.equals(primeFactor) : false;
}
@Override
public int hashCode() {
return primeFactor.hashCode();
}
@Override
public String toString() {
return primeFactor.toString();
}
}
/**
* 素数を渡すためのクラスです。<br>
* 中身が確実に素数であることを保証するときに使ってください。
*
* @author 31536000
*
*/
public static class Prime extends Number {
private static final long serialVersionUID = 8216169308184181643L;
public final int prime;
/**
* 素数を設定します。
*
* @param prime 素数
* @throws IllegalArgumentException 素数以外を渡した時
*/
public Prime(final int prime) {
if (!isPrime(prime)) throw new IllegalArgumentException(prime + " is not prime");
this.prime = prime;
}
private Prime(final int prime, final boolean none) {
this.prime = prime;
}
private static final int bases[] = { 15591, 2018, 166, 7429, 8064, 16045, 10503, 4399, 1949, 1295, 2776, 3620,
560, 3128, 5212, 2657, 2300, 2021, 4652, 1471, 9336, 4018, 2398, 20462, 10277, 8028, 2213, 6219, 620,
3763, 4852, 5012, 3185, 1333, 6227, 5298, 1074, 2391, 5113, 7061, 803, 1269, 3875, 422, 751, 580, 4729,
10239, 746, 2951, 556, 2206, 3778, 481, 1522, 3476, 481, 2487, 3266, 5633, 488, 3373, 6441, 3344, 17,
15105, 1490, 4154, 2036, 1882, 1813, 467, 3307, 14042, 6371, 658, 1005, 903, 737, 1887, 7447, 1888,
2848, 1784, 7559, 3400, 951, 13969, 4304, 177, 41, 19875, 3110, 13221, 8726, 571, 7043, 6943, 1199, 352,
6435, 165, 1169, 3315, 978, 233, 3003, 2562, 2994, 10587, 10030, 2377, 1902, 5354, 4447, 1555, 263,
27027, 2283, 305, 669, 1912, 601, 6186, 429, 1930, 14873, 1784, 1661, 524, 3577, 236, 2360, 6146, 2850,
55637, 1753, 4178, 8466, 222, 2579, 2743, 2031, 2226, 2276, 374, 2132, 813, 23788, 1610, 4422, 5159,
1725, 3597, 3366, 14336, 579, 165, 1375, 10018, 12616, 9816, 1371, 536, 1867, 10864, 857, 2206, 5788,
434, 8085, 17618, 727, 3639, 1595, 4944, 2129, 2029, 8195, 8344, 6232, 9183, 8126, 1870, 3296, 7455,
8947, 25017, 541, 19115, 368, 566, 5674, 411, 522, 1027, 8215, 2050, 6544, 10049, 614, 774, 2333, 3007,
35201, 4706, 1152, 1785, 1028, 1540, 3743, 493, 4474, 2521, 26845, 8354, 864, 18915, 5465, 2447, 42,
4511, 1660, 166, 1249, 6259, 2553, 304, 272, 7286, 73, 6554, 899, 2816, 5197, 13330, 7054, 2818, 3199,
811, 922, 350, 7514, 4452, 3449, 2663, 4708, 418, 1621, 1171, 3471, 88, 11345, 412, 1559, 194 };
private static final byte wheel[] = { 10, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4,
2, 4, 8, 6, 4, 6, 2, 4, 6, 2, 6, 6, 4, 2, 4, 6, 2, 6, 4, 2, 4, 2, 10, 2 };
private static boolean isSPRP(final int n, long a) {
int d = n - 1, s = 0;
while ((d & 1) == 0) {
++s;
d >>= 1;
}
long cur = 1, pw = d;
do {
if ((pw & 1) != 0) cur = cur * a % n;
a = a * a % n;
pw >>= 1;
} while (pw != 0);
if (cur == 1) return true;
for (int r = 0; r < s; ++r) {
if (cur == n - 1) return true;
cur = cur * cur % n;
}
return false;
}
/**
* 与えられた値が素数か否かを判定します。<br>
* この実装はhttp://ceur-ws.org/Vol-1326/020-Forisek.pdfに基づきます。
*
* @param x 判定したい値
* @return xが素数ならtrue
*/
public static boolean isPrime(final int x) {
if (x == 2 || x == 3 || x == 5 || x == 7) return true;
if ((x & 1) == 0 || x % 3 == 0 || x % 5 == 0 || x % 7 == 0) return false;
return checkPrime(x);
}
private static boolean checkPrime(final int x) {
if (x < 121) return x > 1;
long h = x;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) * 0x45d9f3b;
h = (h >> 16 ^ h) & 0xFF;
return isSPRP(x, bases[(int) h]);
}
/**
* 区間における素数を列挙します。<br>
* この実装はエラトステネスの篩に基づきます。
*
* @param n 素数を求める範囲
* @return 1以上n以下の素数を保持する区間素数
*/
public static SegmentPrime getSegmentPrime(final int n) {
final Prime[] divisor = new Prime[n - 1];
final int sqrt = (int) Math.sqrt(n) + 1;
for (int i = 0; i < sqrt; ++i) {
if (divisor[i] != null) continue;
final int p = i + 2;
divisor[i] = new Prime(p, true);
for (int j = p * p - 2; j < divisor.length; j += p) divisor[j] = divisor[i];
}
for (int i = sqrt; i < divisor.length; ++i) if (divisor[i] == null) divisor[i] = new Prime(i + 2, true);
return new SegmentPrime(divisor, 2);
}
/**
* 与えられた値を素因数分解した結果を返します。
*
* @param x 素因数分解する値
* @return 素因数分解した結果
*/
public static PrimeFactor getPrimeFactor(int x) {
if (x <= 0) throw new IllegalArgumentException("non positive number: " + x);
final Map<Prime, Integer> ret = new TreeMap<>((l, r) -> Integer.compare(l.prime, r.prime));
int c;
if ((x & 1) == 0) {
c = 1;
for (x >>= 1; (x & 1) == 0; x >>= 1) ++c;
ret.put(new Prime(2, false), c);
}
if (x % 3 == 0) {
c = 1;
for (x /= 3; x % 3 == 0; x /= 3) ++c;
ret.put(new Prime(3, false), c);
}
if (x % 5 == 0) {
c = 1;
for (x /= 5; x % 5 == 0; x /= 5) ++c;
ret.put(new Prime(5, false), c);
}
if (x % 7 == 0) {
c = 1;
for (x /= 7; x % 7 == 0; x /= 7) ++c;
ret.put(new Prime(7, false), c);
}
if (x < 100000000) { // Wheel Factorization
for (int i = 11, j = 0; i * i <= x; i += wheel[++j % wheel.length]) {
while (x % i == 0) {
x /= i;
ret.compute(new Prime(i, false), (k, v) -> v == null ? 1 : v + 1);
}
}
if (x != 1) ret.put(new Prime(x, false), 1);
} else {
int p, count;
while (x != 1) { // 素因数分解が終わってる
for (p = x; !checkPrime(p); p = pollardRho(p, 1));
final Prime prime = new Prime(p, false);
count = 1;
for (x /= p; x % p == 0; x /= p) ++count;
ret.put(prime, count);
}
}
return new PrimeFactor(ret);
}
private static int gcd(int n, int m) {
while (n != 0) if ((m %= n) != 0) n %= m;
else return n;
return m;
}
private static int pollardRho(final int x, int c) {
int n = 2, m = 2, d = 1, next = 4, i = 1;
do {
if (++i == next) {
m = n;
next <<= 1;
}
if ((n = (int) (((long) n * n + c) % x)) == m) return pollardRho(x, ++c); // 失敗したので
} while ((d = gcd(Math.abs(n - m), x)) == 1);// dは約数の一つ
return d;
}
@Override
public int intValue() {
return prime;
}
@Override
public long longValue() {
return prime;
}
@Override
public float floatValue() {
return prime;
}
@Override
public double doubleValue() {
return prime;
}
@Override
public boolean equals(final Object o) {
return o instanceof Prime ? ((Prime) o).prime == prime : false;
}
@Override
public int hashCode() {
return prime;
}
@Override
public String toString() {
return String.valueOf(prime);
}
}
public static class AbstractArray<T> extends AbstractList<T> implements RandomAccess {
private final Object[] array;
public AbstractArray(final int size) {
array = new Object[size];
}
public AbstractArray(final T[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 0, array.length);
}
@Override
public T set(final int index, final T element) {
final T ret = get(index);
array[index] = element;
return ret;
}
@Override
public T get(final int index) {
@SuppressWarnings("unchecked")
final T ret = (T) array[index];
return ret;
}
public Object[] get() {
return array;
}
public T[] get(final T[] array) {
if (array.length < this.array.length) {
@SuppressWarnings("unchecked")
final T[] ret = (T[]) Arrays.copyOfRange(this.array, 0, this.array.length, array.getClass());
return ret;
}
System.arraycopy(this.array, 0, array, 0, this.array.length);
return array;
}
@Override
public int size() {
return array.length;
}
public int length() {
return size();
}
@Override
public int hashCode() {
return Arrays.hashCode(array);
}
private class Iter implements Iterator<T> {
private int index;
private Iter() {
index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public T next() {
return get(index++);
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
}
@Override
public Iterator<T> iterator() {
return new Iter();
}
}
public static class Array<T> extends AbstractArray<T> implements Serializable {
private static final long serialVersionUID = 2749604433067098063L;
public Array(final int size) {
super(size);
}
public Array(final T[] array) {
super(array);
}
public T front() {
return get(0);
}
public T back() {
return get(size() - 1);
}
}
/**
* 要素とそのindexを管理するクラスです。
*
* @author 31536000
*
* @param <E> 保持する要素
*/
public static class Enumerate<E> {
public final E value;
public final int index;
/**
* 要素とそのindexを渡します。<br>
* indexは必ずしも元の配列またはコレクションのindexと一致する必要はありませんが、一致する値を返すことが推奨されます。
*
* @param value
* @param index
*/
public Enumerate(final E value, final int index) {
this.value = value;
this.index = index;
}
/**
* 要素を返します。
*
* @return 要素
*/
public E getValue() { return value; }
/**
* indexを返します。
*
* @return index
*/
public int getIndex() { return index; }
@Override
public boolean equals(final Object o) {
if (o instanceof Enumerate)
return ((Enumerate<?>) o).getValue().equals(value) && ((Enumerate<?>) o).getIndex() == index;
return false;
}
@Override
public int hashCode() {
return value.hashCode() ^ index;
}
@Override
public String toString() {
return "{" + value.toString() + ", " + index + "}";
}
}
/**
* 要素とそのindexを効率的に取得する関数を提供します。
*
* @author 31536000
*
*/
public static class Enumeration {
private static class IteratorArray<E> implements Iterator<Enumerate<E>> {
private final E[] array;
private final int start;
private int index;
public IteratorArray(final E[] array, final int index) {
this.array = array;
this.start = index;
this.index = 0;
}
@Override
public boolean hasNext() {
return index < array.length;
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(array[index], index++ + start);
return ret;
}
}
private static class IteratorCollection<E> implements Iterator<Enumerate<E>> {
private final Iterator<E> iter;
private int start;
public IteratorCollection(final Iterator<E> iter, final int index) {
this.iter = iter;
this.start = index;
}
@Override
public boolean hasNext() {
return iter.hasNext();
}
@Override
public Enumerate<E> next() {
final Enumerate<E> ret = new Enumerate<>(iter.next(), start++);
return ret;
}
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array) {
return enumerate(array, 0);
}
/**
* 配列の各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> 配列の型
* @param array 配列
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final E[] array, final int start) {
if (array == null) throw new NullPointerException("array is null");
return new IteratorArray<>(array, start);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter) {
return enumerate(iter, 0);
}
/**
* Iteratorの各要素とそのindexを順に返すIteratorを生成します。
*
* @param <E> Iteratorの型
* @param iter Iterator
* @param start 添字の初期値、この値だけindexが足されたものが返る
* @return Enumerate<E>のIterator
*/
public static <E> Iterator<Enumerate<E>> enumerate(final Iterator<E> iter, final int start) {
if (iter == null) throw new NullPointerException("iterator is null");
return new IteratorCollection<>(iter, start);
}
}
/**
* このクラスは配列に対する様々な操作を提供します。
* @author 31536000
*
*/
public static class ArrayUtility {
private ArrayUtility() {
throw new AssertionError();
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static int[] create(int length, java.util.function.IntUnaryOperator init) {
int[] ret = new int[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsInt(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static long[] create(int length, java.util.function.LongUnaryOperator init) {
long[] ret = new long[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsLong(i);
return ret;
}
/**
* initを用いて配列を生成します。配列のi番目の要素はinit.applyAsInt(i)になります。
* @complexity O(length)
* @param length 配列の長さ
* @param init 配列の初期値を決める関数
* @return 配列
*/
public static double[] create(int length, java.util.function.DoubleUnaryOperator init) {
double[] ret = new double[length];
for (int i = 0; i < length; ++i) ret[i] = init.applyAsDouble(i);
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static boolean[] add(boolean[] array, boolean element) {
if (array == null) {
boolean[] ret = { element };
return ret;
}
boolean[] ret = new boolean[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static byte[] add(byte[] array, byte element) {
if (array == null) {
byte[] ret = { element };
return ret;
}
byte[] ret = new byte[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static short[] add(short[] array, short element) {
if (array == null) {
short[] ret = { element };
return ret;
}
short[] ret = new short[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static int[] add(int[] array, int element) {
if (array == null) {
int[] ret = { element };
return ret;
}
int[] ret = new int[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static long[] add(long[] array, long element) {
if (array == null) {
long[] ret = { element };
return ret;
}
long[] ret = new long[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static float[] add(float[] array, float element) {
if (array == null) {
float[] ret = { element };
return ret;
}
float[] ret = new float[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static double[] add(double[] array, double element) {
if (array == null) {
double[] ret = { element };
return ret;
}
double[] ret = new double[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static char[] add(char[] array, char element) {
if (array == null) {
char[] ret = { element };
return ret;
}
char[] ret = new char[array.length + 1];
System.arraycopy(array, 0, ret, 0, array.length);
ret[array.length] = element;
return ret;
}
/**
* 配列の最後に要素を一つ増やした新しい配列を返します。
* @complexity O(array.length)
* @param array 元の配列
* @param element 加えたい要素
* @return 配列の後ろに要素を加えた配列
*/
public static <T> T[] add(T[] array, T element) {
if (array == null) { return addAll(array, element); }
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + 1, array.getClass());
ret[array.length] = element;
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static boolean[] addAll(boolean[] array, boolean... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
boolean[] ret = new boolean[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static byte[] addAll(byte[] array, byte... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
byte[] ret = new byte[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static short[] addAll(short[] array, short... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
short[] ret = new short[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static int[] addAll(int[] array, int... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
int[] ret = new int[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static long[] addAll(long[] array, long... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
long[] ret = new long[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static float[] addAll(float[] array, float... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
float[] ret = new float[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static double[] addAll(double[] array, double... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
double[] ret = new double[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
public static char[] addAll(char[] array, char... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
char[] ret = new char[array.length + array2.length];
System.arraycopy(array, 0, ret, 0, array.length);
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 2つの配列を結合した新しい配列を返します。
* @complexity O(array.length + array2.length)
* @param array 左側の配列
* @param array2 右側の配列
* @return 2つの配列を結合した配列
*/
@SafeVarargs
public static <T> T[] addAll(T[] array, T... array2) {
if (array == null) return array2 == null ? null : array2.clone();
if (array2 == null) return array.clone();
@SuppressWarnings("unchecked")
T[] ret = (T[]) java.util.Arrays.copyOfRange(array, 0, array.length + array2.length, array.getClass());
System.arraycopy(array2, 0, ret, array.length, array2.length);
return ret;
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(boolean[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(boolean[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(boolean[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(byte[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(byte[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(byte[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(short[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(short[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(short[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(int[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(int[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(int[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(long[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(long[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(long[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(float[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(float[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(float[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(double[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(double[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(double[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(char[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(char[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(char[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を逆順にします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void reverse(Object[] array) {
if (array != null)
for (int i = 0, l = array.length + 1 >> 1; i < l; ++i) swap(array, i, array.length - 1 - i);
}
/**
* 配列を逆順にします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex 逆順にする左閉区間
* @param toIndex 逆順にする右開区間
*/
public static void reverse(Object[] array, int fromIndex, int toIndex) {
for (--toIndex; fromIndex < toIndex; ++fromIndex, --toIndex) swap(array, fromIndex, toIndex);
}
/**
* 配列を逆順にします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range 逆順にする区間
*/
public static void reverse(Object[] array, IntRange range) {
reverse(array, range.getClosedLower(), range.getOpenUpper());
}
private static java.util.Random rnd;
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(boolean[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(boolean[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(boolean[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(boolean[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(byte[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(byte[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(byte[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(byte[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(byte[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(short[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(short[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(short[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(short[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(short[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(short[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(int[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(int[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(int[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(int[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(int[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(int[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(long[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(long[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(long[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(long[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(long[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(long[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(float[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(float[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(float[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(float[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(float[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(float[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(double[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(double[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(double[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(double[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(double[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(double[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(char[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(char[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(char[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(char[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(char[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(char[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
*/
public static void shuffle(Object[] array) {
shuffle(array, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex) {
shuffle(array, fromIndex, toIndex, rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
*/
public static void shuffle(Object[] array, IntRange range) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(),
rnd == null ? rnd = new java.util.Random() : rnd);
}
/**
* 配列をシャッフルします。
* @complexity O(array.length)
* @param array 元の配列
* @param random 乱数
*/
public static void shuffle(Object[] array, java.util.Random random) {
if (array != null) for (int i = array.length - 1; i > 0; --i) swap(array, i, random.nextInt(i + 1));
}
/**
* 配列をシャッフルします。
* @complexity O(toIndex-fromIndex)
* @param array 元の配列
* @param fromIndex シャッフルする左閉区間
* @param toIndex シャッフルする右開区間
* @param random 乱数
*/
public static void shuffle(Object[] array, int fromIndex, int toIndex, java.util.Random random) {
if (array != null)
for (int i = toIndex - 1; i > fromIndex; --i) swap(array, i, random.nextInt(i - fromIndex) + fromIndex);
}
/**
* 配列をシャッフルします。
* @complexity O(range.getDistance())
* @param array 元の配列
* @param range シャッフルする区間
* @param random 乱数
*/
public static void shuffle(Object[] array, IntRange range, java.util.Random random) {
shuffle(array, range.getClosedLower(), range.getOpenUpper(), random);
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static boolean[] getArray(int size, boolean value) {
boolean[] ret = new boolean[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static byte[] getArray(int size, byte value) {
byte[] ret = new byte[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static short[] getArray(int size, short value) {
short[] ret = new short[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static int[] getArray(int size, int value) {
int[] ret = new int[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static long[] getArray(int size, long value) {
long[] ret = new long[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static float[] getArray(int size, float value) {
float[] ret = new float[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static double[] getArray(int size, double value) {
double[] ret = new double[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* 指定した長さと初期値を持つ配列を生成します。
* @complexity O(size)
* @param size 配列の長さ
* @param value 配列の初期値
* @return 生成された配列
*/
public static char[] getArray(int size, char value) {
char[] ret = new char[size];
java.util.Arrays.fill(ret, value);
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Boolean[] toObject(boolean[] array) {
if (array == null) return null;
Boolean[] ret = new Boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Byte[] toObject(byte[] array) {
if (array == null) return null;
Byte[] ret = new Byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Short[] toObject(short[] array) {
if (array == null) return null;
Short[] ret = new Short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Integer[] toObject(int[] array) {
if (array == null) return null;
Integer[] ret = new Integer[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Long[] toObject(long[] array) {
if (array == null) return null;
Long[] ret = new Long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Float[] toObject(float[] array) {
if (array == null) return null;
Float[] ret = new Float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Double[] toObject(double[] array) {
if (array == null) return null;
Double[] ret = new Double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* プリミティブ型の配列と中身が対応するオブジェクト型の配列を生成します。
* @complexity O(array.length)
* @param array プリミティブ型の配列
* @return オブジェクト型の配列
*/
public static Character[] toObject(char[] array) {
if (array == null) return null;
Character[] ret = new Character[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static boolean[] toPrimitive(Boolean[] array) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static boolean[] toPrimitive(Boolean[] array, boolean valueForNull) {
if (array == null) return null;
boolean[] ret = new boolean[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static byte[] toPrimitive(Byte[] array) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static byte[] toPrimitive(Byte[] array, byte valueForNull) {
if (array == null) return null;
byte[] ret = new byte[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static short[] toPrimitive(Short[] array) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static short[] toPrimitive(Short[] array, short valueForNull) {
if (array == null) return null;
short[] ret = new short[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static int[] toPrimitive(Integer[] array) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static int[] toPrimitive(Integer[] array, int valueForNull) {
if (array == null) return null;
int[] ret = new int[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static long[] toPrimitive(Long[] array) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static long[] toPrimitive(Long[] array, long valueForNull) {
if (array == null) return null;
long[] ret = new long[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static float[] toPrimitive(Float[] array) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static float[] toPrimitive(Float[] array, float valueForNull) {
if (array == null) return null;
float[] ret = new float[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static double[] toPrimitive(Double[] array) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static double[] toPrimitive(Double[] array, double valueForNull) {
if (array == null) return null;
double[] ret = new double[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @return プリミティブ型の配列
* @throws NullPointerException 配列の要素にnullが含まれていた場合
*/
public static char[] toPrimitive(Character[] array) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i];
return ret;
}
/**
* オブジェクト型の配列と中身が対応するプリミティブ型の配列を生成します。
* @complexity O(array.length)
* @param array オブジェクト型の配列
* @param valueForNull nullの値に対応させる値
* @return プリミティブ型の配列
*/
public static char[] toPrimitive(Character[] array, char valueForNull) {
if (array == null) return null;
char[] ret = new char[array.length];
for (int i = 0; i < ret.length; ++i) ret[i] = array[i] == null ? valueForNull : array[i];
return ret;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T min(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T min = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(min, array[i]) > 0) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static <T extends Comparable<T>> T min(T[] array) {
return min(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static byte min(byte[] array) {
byte min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static short min(short[] array) {
short min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static int min(int[] array) {
int min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static long min(long[] array) {
long min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static float min(float[] array) {
float min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
*/
public static double min(double[] array) {
double min = array[0];
for (int i = 1; i < array.length; ++i) if (min > array[i]) min = array[i];
return min;
}
/**
* 配列の最小要素を返します。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最小値
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> T max(T[] array, java.util.Comparator<T> comparator) {
if (array == null || array.length == 0) return null;
T max = array[0];
for (int i = 1; i < array.length; ++i) if (comparator.compare(max, array[i]) < 0) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
*/
public static <T extends Comparable<T>> T max(T[] array) {
return max(array, java.util.Comparator.naturalOrder());
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static byte max(byte[] array) {
byte max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static short max(short[] array) {
short max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static int max(int[] array) {
int max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static long max(long[] array) {
long max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static float max(float[] array) {
float max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列の最大要素を返します。
* @complexity O(array.length)
* @param array 配列
* @return 配列がnullか要素数が0の場合はnull、それ以外の場合は配列の最大値
* @throws NullPointerException arrayがnullの場合
*/
public static double max(double[] array) {
double max = array[0];
for (int i = 1; i < array.length; ++i) if (max < array[i]) max = array[i];
return max;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(boolean[] array, int n, int m) {
boolean swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(byte[] array, int n, int m) {
byte swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(short[] array, int n, int m) {
short swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(int[] array, int n, int m) {
int swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(long[] array, int n, int m) {
long swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(float[] array, int n, int m) {
float swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(double[] array, int n, int m) {
double swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(char[] array, int n, int m) {
char swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列のn番目とm番目を入れ替えます。
* @complexity O(1)
* @param array 配列
* @param n 中身をswapするindex
* @param m 中身をswapするindex
* @throws ArrayIndexOutOfBoundsException n, m < 0 || array.length <= n, mのとき
* @throws NullPointerException arrayがnullの場合
*/
public static void swap(Object[] array, int n, int m) {
Object swap = array[n];
array[n] = array[m];
array[m] = swap;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean nextPermutation(T[] array) {
return nextPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean nextPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) < 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) < 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で次の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean nextPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] < array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] < array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static <T extends Comparable<T>> boolean prevPermutation(T[] array) {
return prevPermutation(array, java.util.Comparator.naturalOrder());
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @param comparator 比較関数
* @return 配列を書き換えたならばtrue
* @throws NullPointerException comparatorがnullの場合
*/
public static <T> boolean prevPermutation(T[] array, java.util.Comparator<T> comparator) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (comparator.compare(array[change], array[change + 1]) > 0) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0)
if (comparator.compare(array[change], array[mid = min + halfDiff]) > 0) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(byte[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(short[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(int[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(long[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(float[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(double[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列を辞書式順序で前の配列に書き換えます。そのような配列が無い場合、何もしません。
* @complexity O(array.length)
* @param array 配列
* @return 配列を書き換えたならばtrue
*/
public static boolean prevPermutation(char[] array) {
if (array == null) return false;
for (int change = array.length - 2; change >= 0; --change) {
if (array[change] > array[change + 1]) {
int min = change, max = array.length, halfDiff, mid;
while ((halfDiff = max - min >> 1) != 0) if (array[change] > array[mid = min + halfDiff]) min = mid;
else max = mid;
swap(array, change, min);
for (min = change + 1, max = array.length - 1; min < max; ++min, --max) swap(array, min, max);
return true;
}
}
return false;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static <T> T[] map(T[] array, java.util.function.UnaryOperator<T> map) {
T[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static int[] map(int[] array, java.util.function.IntUnaryOperator map) {
int[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsInt(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static long[] map(long[] array, java.util.function.LongUnaryOperator map) {
long[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsLong(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @return 配列の各要素にmapを適用した配列
*/
public static double[] map(double[] array, java.util.function.DoubleUnaryOperator map) {
double[] ret = java.util.Arrays.copyOf(array, array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.applyAsDouble(ret[i]);
return ret;
}
/**
* 配列の各要素を与えられた関数に適用した配列を生成します。
* @complexity O(array.length)
* @param array 配列
* @param map 各要素に適用する関数
* @param generator 新しい配列を生成するための関数、U::newを引数に取る
* @return 配列の各要素にmapを適用した配列
*/
public static <T, U> U[] map(T[] array, java.util.function.Function<T, U> map,
java.util.function.IntFunction<U[]> generator) {
U[] ret = generator.apply(array.length);
for (int i = 0; i < ret.length; ++i) ret[i] = map.apply(array[i]);
return ret;
}
/**
* 配列を昇順にソートします。
* @complexity O(array.length)
* @param array 配列
*/
public static void sort(final byte[] array) {
if (array.length < 128) {
for (int i = 0, j; i < array.length; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > 0 && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (byte i : array) ++count[i & 0xff];
for (int i = 0, j = 0; j < count.length; ++j) java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(toIndex-fromIndex)
* @param array 配列
*/
public static void sort(final byte[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 128) {
for (int i = fromIndex, j; i < toIndex; ++i) {
byte tmp = array[i], tmp2;
for (j = i; j > fromIndex && (tmp2 = array[j - 1]) > tmp; --j) array[j] = tmp2;
array[j] = tmp;
}
return;
}
int[] count = new int[256];
for (int i = fromIndex; i < toIndex; ++i) ++count[array[i] & 0xff];
for (int i = fromIndex, j = 0; j < count.length; ++j)
java.util.Arrays.fill(array, i, i += count[j], (byte) j);
}
/**
* 配列を昇順にソートします。
* @complexity O(range.getDistance())
* @param array 配列
*/
public static void sort(final byte[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final short[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new short[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final short[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(short[] a, final int from, final int to, final int l, final short[] bucket) {
final int BUCKET_SIZE = 256;
final int SHORT_RECURSION = 2;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < SHORT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final int[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new int[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final int[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(int[] a, final int from, final int to, final int l, final int[] bucket) {
final int BUCKET_SIZE = 256;
final int INT_RECURSION = 4;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(a[i] >>> shift & MASK) + 1];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = a[i] >>> shift & MASK;
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < INT_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 配列を昇順にソートします。
* @complexity Nを配列長として O(N log N)
* @param array 配列
*/
public static void sort(final long[] array) {
if (array.length < 1024) java.util.Arrays.sort(array);
else sort(array, 0, array.length, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=toIndex-fromIndex として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, int fromIndex, int toIndex) {
if (toIndex - fromIndex < 1024) java.util.Arrays.sort(array, fromIndex, toIndex);
else sort(array, fromIndex, toIndex, 0, new long[array.length]);
}
/**
* 配列を昇順にソートします。
* @complexity N=range.getDistance() として O(N log N)
* @param array 元の配列
* @param fromIndex ソートする左閉区間
* @param toIndex ソートする右開区間
*/
public static void sort(final long[] array, IntRange range) {
sort(array, range.getClosedLower(), range.getOpenUpper());
}
private static final void sort(long[] a, final int from, final int to, final int l, final long[] bucket) {
final int BUCKET_SIZE = 256;
final int LONG_RECURSION = 8;
final int MASK = 0xff;
final int shift = l << 3;
final int[] cnt = new int[BUCKET_SIZE + 1];
final int[] put = new int[BUCKET_SIZE];
for (int i = from; i < to; i++) ++cnt[(int) ((a[i] >>> shift & MASK) + 1)];
for (int i = 0; i < BUCKET_SIZE; i++) cnt[i + 1] += cnt[i];
for (int i = from; i < to; i++) {
int bi = (int) (a[i] >>> shift & MASK);
bucket[cnt[bi] + put[bi]++] = a[i];
}
for (int i = BUCKET_SIZE - 1, idx = from; i >= 0; i--) {
int begin = cnt[i];
int len = cnt[i + 1] - begin;
System.arraycopy(bucket, begin, a, idx, len);
idx += len;
}
final int nxtL = l + 1;
if (nxtL < LONG_RECURSION) {
sort(a, from, to, nxtL, bucket);
if (l == 0) {
int lft, rgt;
lft = from - 1;
rgt = to;
while (rgt - lft > 1) {
int mid = lft + rgt >> 1;
if (a[mid] < 0) lft = mid;
else rgt = mid;
}
reverse(a, from, rgt);
reverse(a, rgt, to);
}
}
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(int[] array) {
int[] ret = new int[array.length];
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static int[] compress(long[] array) {
int[] ret = new int[array.length];
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @return arrayを座標圧縮した配列
*/
public static <T extends Comparable<T>> int[] compress(T[] array) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (copy[len - 1] != copy[j]) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid].compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]<array[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、array[i]==array[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nを配列長として O(N log N)
* @param array 座標圧縮を行う配列
* @param comparator 比較関数
* @return arrayを座標圧縮した配列
*/
public static <T> int[] compress(T[] array, java.util.Comparator<T> comparator) {
int[] ret = new int[array.length];
T[] copy = java.util.Arrays.copyOf(array, array.length);
java.util.Arrays.sort(copy, comparator);
int len = 1;
for (int j = 1; j < array.length; ++j) {
if (!copy[len - 1].equals(copy[j])) copy[len++] = copy[j];
}
for (int i = 0; i < array.length; ++i) {
int min = 0, max = len;
T comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy[mid], comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @return listを座標圧縮した配列
* @throws NullPointerException listがnullの場合
*/
public static <T extends Comparable<T>> int[] compress(java.util.List<T> list) {
int size = list.size();
int[] ret = new int[size];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(java.util.Comparator.naturalOrder());
int len = 1;
for (int j = 1; j < size; ++j) {
if (!copy.get(len - 1).equals(copy.get(j))) copy.set(len++, copy.get(j));
}
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < size; ++i) {
int min = 0, max = len;
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (copy.get(mid).compareTo(comp) <= 0) min = mid;
else max = mid;
}
ret[i] = min;
}
return ret;
}
/**
* 座標圧縮した配列を返します。
* この関数によって返される配列をretとしたとき、retは次の条件を満たします。
* <ul>
* <li>任意の正整数nに対し、contains(ret, n)がtrueならcontains(ret, n-1)もtrue</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]<list[j]ならret[i]<ret[j]</li>
* <li>0≦i, j<nを満たすi, jに対し、list[i]==list[j]ならret[i]==ret[j]</li>
* </ul>
* @complexity Nをリスト長として O(N log N)
* @param list 座標圧縮を行うリスト
* @param comparator 比較関数
* @return listを座標圧縮した配列
*/
public static <T> int[] compress(java.util.List<T> list, java.util.Comparator<T> comparator) {
int[] ret = new int[list.size()];
java.util.ArrayList<T> copy = new java.util.ArrayList<>(list);
copy.sort(comparator);
int[] bit = new int[list.size() + 1];
java.util.Iterator<T> iter = list.iterator();
for (int i = 0; i < list.size(); ++i) {
int min = 0, max = list.size();
T comp = iter.next();
while (max - min > 1) {
int mid = min + max >> 1;
if (comparator.compare(copy.get(mid), comp) <= 0) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ret[i] += bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ret;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(int[] array) {
if (array == null) return 0;
int[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
int comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(long[] array) {
if (array == null) return 0;
long[] copy = java.util.Arrays.copyOf(array, array.length);
sort(copy);
int[] bit = new int[array.length + 1];
long ans = (long) array.length * (array.length - 1) >> 1;
for (int i = 0; i < array.length; ++i) {
int min = 0, max = array.length;
long comp = array[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copy[mid] <= comp) min = mid;
else max = mid;
}
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(char[] array) {
if (array == null) return 0;
int[] a = new int[array.length];
for (int i = 0;i < array.length;++ i) a[i] = array[i];
return inversionNumber(a);
}
/**
* 配列の転倒数を求めます。すなわち、i<jかつarray[i]>array[j]となる(i, j)の個数を求めます。
* @complexity Nを配列長として O(N log N)
* @param array 配列
* @return 転倒数
*/
public static long inversionNumber(String array) {
if (array == null) return 0;
return inversionNumber(array.toCharArray());
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(int[] src, int[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
int comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
int comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(long[] src, long[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
long[] copySrc = java.util.Arrays.copyOf(src, src.length),
copyDest = java.util.Arrays.copyOf(dest, dest.length);
sort(copySrc);
sort(copyDest);
if (!java.util.Arrays.equals(copySrc, copyDest)) return -1;
int[] key = new int[dest.length];
for (int i = 0; i < dest.length; ++i) {
int min = -1, max = dest.length;
long comp = dest[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copyDest[mid] < comp) min = mid;
else max = mid;
}
key[max] = i;
copyDest[max] = max == 0 ? Integer.MIN_VALUE : copyDest[max - 1];
}
int[] bit = new int[src.length + 1];
long ans = (long) src.length * (src.length - 1) >> 1;
for (int i = 0; i < src.length; ++i) {
int min = -1, max = src.length;
long comp = src[i];
while (max - min > 1) {
int mid = min + max >> 1;
if (copySrc[mid] < comp) min = mid;
else max = mid;
}
copySrc[max] = max == 0 ? Integer.MIN_VALUE : copySrc[max - 1];
max = key[max] + 1;
for (int j = max; j != 0; j -= j & -j) ans -= bit[j];
for (int j = max; j < bit.length; j += j & -j) ++bit[j];
}
return ans;
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(char[] src, char[] dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
int[] a = new int[src.length];
for (int i = 0;i < src.length;++ i) a[i] = src[i];
int[] b = new int[dest.length];
for (int i = 0;i < dest.length;++ i) b[i] = dest[i];
return inversionDistance(a, b);
}
/**
* 2つの配列の転倒距離を求めます。つまり、配列srcの隣接する2要素をswapして配列destと一致させるまでのswap回数の最小値を求めます。
* @complexity N=src.length, M=dest.lengthとしてO((N+M)log(N+M))
* @param src 配列
* @param dest 配列
* @return srcとdestの転倒距離、ただしsrcを隣接swapすることでdestが構築できない場合は-1
*/
public static long inversionDistance(String src, String dest) {
if (src == null || dest == null) return src == null && dest == null ? 0 : -1;
return inversionDistance(src.toCharArray(), dest.toCharArray());
}
}
}
class ACL {
public static final class DisjointSetUnion {
private final int[] parent;
private DisjointSetUnion(final int n) {
parent = new int[n];
java.util.Arrays.fill(parent, -1);
}
public static DisjointSetUnion create(final int n) {
return new DisjointSetUnion(n);
}
public int getLeader(int a) {
int p1, p2;
while ((p1 = parent[a]) >= 0) {
if ((p2 = parent[p1]) >= 0) a = parent[a] = p2;
else return p1;
}
return a;
}
public int merge(int a, int b) {
a = getLeader(a);
b = getLeader(b);
if (a == b) return a;
if (parent[a] < parent[b]) {
parent[b] += parent[a];
parent[a] = b;
return b;
}
parent[a] += parent[b];
parent[b] = a;
return a;
}
public boolean isSame(final int a, final int b) {
return getLeader(a) == getLeader(b);
}
public int getSize(final int a) {
return -parent[getLeader(a)];
}
public java.util.ArrayList<java.util.ArrayList<Integer>> getGroups() {
final Object[] group = new Object[parent.length];
final java.util.ArrayList<java.util.ArrayList<Integer>> ret = new java.util.ArrayList<>();
for (int i = 0; i < parent.length; ++i) {
final int leader = getLeader(i);
final Object put = group[leader];
if (put == null) {
final java.util.ArrayList<Integer> list = new java.util.ArrayList<>();
list.add(i);
ret.add(list);
group[leader] = list;
} else {
@SuppressWarnings("unchecked")
final java.util.ArrayList<Integer> list = (java.util.ArrayList<Integer>) put;
list.add(i);
}
}
return ret;
}
@Override
public String toString() {
return getGroups().toString();
}
}
public static final class IntFenwickTree {
private final int[] array;
private IntFenwickTree(final int n) {
array = new int[n + 1];
}
private IntFenwickTree(final int[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static IntFenwickTree create(final int n) {
return new IntFenwickTree(n);
}
public static IntFenwickTree create(final int[] array) {
return new IntFenwickTree(array);
}
public void add(int index, final int add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private int sum(int index) {
int sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public int sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class LongFenwickTree {
private final long[] array;
private LongFenwickTree(final int n) {
array = new long[n + 1];
}
private LongFenwickTree(final long[] array) {
this(array.length);
System.arraycopy(array, 0, this.array, 1, array.length);
for (int i = 1; i < this.array.length; ++i)
if (i + (i & -i) < this.array.length) this.array[i + (i & -i)] += this.array[i];
}
public static LongFenwickTree create(final int n) {
return new LongFenwickTree(n);
}
public static LongFenwickTree create(final long[] array) {
return new LongFenwickTree(array);
}
public void add(int index, final long add) {
++index;
while (index < array.length) {
array[index] += add;
index += index & -index;
}
}
private long sum(int index) {
long sum = 0;
while (index > 0) {
sum += array[index];
index -= index & -index;
}
return sum;
}
public long sum(final int l, final int r) {
return sum(r) - sum(l);
}
@Override
public String toString() {
return java.util.stream.IntStream.range(0, array.length - 1)
.mapToObj(i -> String.valueOf(sum(i + 1) - sum(i)))
.collect(java.util.stream.Collectors.joining(", ", "[", "]"));
}
}
public static final class MathLib {
public static class Barrett {
private final int mod;
private final long h, l;
private final long MAX = 1L << 62;
private final int MASK = (1 << 31) - 1;
Barrett(final int mod) {
this.mod = mod;
final long t = MAX / mod;
h = t >>> 31;
l = t & MASK;
}
int reduce(final long x) {
final long xh = x >>> 31, xl = x & MASK;
long z = xl * l;
z = xl * h + xh * l + (z >>> 31);
z = xh * h + (z >>> 31);
final int ret = (int) (x - z * mod);
return ret >= mod ? ret - mod : ret;
}
}
public static class BarrettSmall {
private final int mod;
final long t;
BarrettSmall(final int mod) {
this.mod = mod;
t = (1L << 42) / mod;
}
int reduce(long x) {
long q = x * t >> 42;
x -= q * mod;
return (int) (x >= mod ? x - mod : x);
}
}
private static long safe_mod(long x, final long m) {
x %= m;
if (x < 0) x += m;
return x;
}
private static long[] inv_gcd(long a, final long b) {
a = safe_mod(a, b);
if (a == 0) return new long[] { b, 0 };
long s = b, t = a;
long m0 = 0, m1 = 1;
while (t > 0) {
final long u = s / t;
s -= t * u;
m0 -= m1 * u;
long tmp = s;
s = t;
t = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 < 0) m0 += b / s;
return new long[] { s, m0 };
}
public static int pow(long n, long m, final int mod) {
assert m >= 0 && mod >= 1;
if (mod == 1) return 0;
return pow(n, m, new Barrett(mod));
}
public static int pow(long n, long m, Barrett mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static int pow998_244_353(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 998_244_353;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 998_244_353;
m >>>= 1;
num = num * num % 998_244_353;
}
return (int) ans;
}
public static int pow167_772_161(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 167_772_161;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 167_772_161;
m >>>= 1;
num = num * num % 167_772_161;
}
return (int) ans;
}
public static int pow469_762_049(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 469_762_049;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 469_762_049;
m >>>= 1;
num = num * num % 469_762_049;
}
return (int) ans;
}
public static int pow1_000_000_007(long n, long m) {
assert m >= 0;
long ans = 1, num = n % 1_000_000_007;
while (m != 0) {
if ((m & 1) != 0) ans = ans * num % 1_000_000_007;
m >>>= 1;
num = num * num % 1_000_000_007;
}
return (int) ans;
}
public static int pow(long n, long m, BarrettSmall mod) {
assert m >= 0;
long ans = 1, num = n % mod.mod;
while (m != 0) {
if ((m & 1) != 0) ans = mod.reduce(ans * num);
m >>>= 1;
num = mod.reduce(num * num);
}
return (int) ans;
}
public static long[] crt(final long[] r, final long[] m) {
assert r.length == m.length;
final int n = r.length;
long r0 = 0, m0 = 1;
for (int i = 0; i < n; i++) {
assert 1 <= m[i];
long r1 = safe_mod(r[i], m[i]), m1 = m[i];
if (m0 < m1) {
long tmp = r0;
r0 = r1;
r1 = tmp;
tmp = m0;
m0 = m1;
m1 = tmp;
}
if (m0 % m1 == 0) {
if (r0 % m1 != r1) return new long[] { 0, 0 };
continue;
}
final long[] ig = inv_gcd(m0, m1);
final long g = ig[0], im = ig[1];
final long u1 = m1 / g;
if ((r1 - r0) % g != 0) return new long[] { 0, 0 };
final long x = (r1 - r0) / g % u1 * im % u1;
r0 += x * m0;
m0 *= u1;
if (r0 < 0) r0 += m0;
// System.err.printf("%d %d\n", r0, m0);
}
return new long[] { r0, m0 };
}
public static long floor_sum(final long n, final long m, long a, long b) {
long ans = 0;
if (a >= m) {
ans += (n - 1) * n * (a / m) / 2;
a %= m;
}
if (b >= m) {
ans += n * (b / m);
b %= m;
}
final long y_max = (a * n + b) / m;
final long x_max = y_max * m - b;
if (y_max == 0) return ans;
ans += (n - (x_max + a - 1) / a) * y_max;
ans += floor_sum(y_max, a, m, (a - x_max % a) % a);
return ans;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static int gcd(int a, int b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static int gcd(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* aとbの最大公約数を返します。
* @param a 整数
* @param b 整数
* @return 最大公約数
*/
public static long gcd(long a, long b) {
while (a != 0) if ((b %= a) != 0) a %= b;
else return a;
return b;
}
/**
* 配列全ての値の最大公約数を返します。
* @param array 配列
* @return 最大公約数
*/
public static long gcd(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = gcd(ret, array[i]);
return ret;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(int a, int b) {
return a / gcd(a, b) * (long) b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param a 整数
* @param b 整数
* @return 最小公倍数
*/
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/**
* 配列全ての値の最小公倍数を返します。
* @param array 配列
* @return 最小公倍数
*/
public static long lcm(int... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = lcm(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static int min(int a, int b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static int min(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、小さい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち小さい方の値
*/
public static long min(long a, long b) {
return a < b ? a : b;
}
/**
* 配列の中で最小の値を返します。
* @param array 配列
* @return 配列の中で最小の値
*/
public static long min(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = min(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static int max(int a, int b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static int max(int... array) {
int ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* aとbのうち、大きい方を返します。
* @param a 整数
* @param b 整数
* @return aとbのうち大きい方の値
*/
public static long max(long a, long b) {
return a > b ? a : b;
}
/**
* 配列の中で最大の値を返します。
* @param array 配列
* @return 配列の中で最大の値
*/
public static long max(long... array) {
long ret = array[0];
for (int i = 1; i < array.length; ++i) ret = max(ret, array[i]);
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(int... array) {
long ret = 0;
for (int i : array) ret += i;
return ret;
}
/**
* 配列の値の合計を返します。
* @param array 配列
* @return 配列の値の総和
*/
public static long sum(long... array) {
long ret = 0;
for (long i : array) ret += i;
return ret;
}
/**
* 二項係数を列挙した配列を返します。
* @param l 左辺
* @param r 右辺
* @return 0≦i≦l及び0≦j≦rを満たす全てのi, jに対してi choose jを求めた配列
*/
public static long[][] combination(int l, int r) {
long[][] pascal = new long[l + 1][r + 1];
pascal[0][0] = 1;
for (int i = 1; i <= l; ++i) {
pascal[i][0] = 1;
for (int j = 1; j <= r; ++j) {
pascal[i][j] = pascal[i - 1][j - 1] + pascal[i - 1][j];
}
}
return pascal;
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static int binarySearch(int isTrue, int isFalse, java.util.function.IntPredicate func) {
if (isTrue <= isFalse) {
int halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
int halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+1)となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+1)となるような数x
*/
public static long binarySearch(long isTrue, long isFalse, java.util.function.LongPredicate func) {
if (isTrue <= isFalse) {
long halfDiff = isFalse - isTrue >> 1, mid = isTrue + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isFalse - isTrue >> 1;
mid = isTrue + halfDiff;
}
return isTrue;
} else {
long halfDiff = isTrue - isFalse >> 1, mid = isFalse + halfDiff;
while(halfDiff != 0) {
if (func.test(mid)) isTrue = mid;
else isFalse = mid;
halfDiff = isTrue - isFalse >> 1;
mid = isFalse + halfDiff;
}
return isFalse;
}
}
/**
* 二分探索を行い、func(x) != func(x+Math.nextUp(x))となるような数xを発見します。
* funcが単調な関数であるとき、発見されるxは一意に定まります。
* @param isTrue func(isTrue)=trueとなるような値
* @param isFalse func(isFalse)=falseとなるような値
* @param func 関数
* @complexity O(log(max(isTrue, isFalse) - min(isTrue, isFalse)))
* @return func(x) != func(x+Math.nextUp(x))となるような数x
*/
public static double binarySearch(double isTrue, double isFalse, java.util.function.DoublePredicate func) {
return Double.longBitsToDouble(binarySearch(Double.doubleToRawLongBits(isTrue), Double.doubleToRawLongBits(isFalse), (long i) -> func.test(Double.longBitsToDouble(i))));
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_minimal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> double find_minimal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func) {
return find_maximal(min, max, loop, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param loop 探索回数
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> double find_maximal(double min, double max, int loop, java.util.function.DoubleFunction<T> func, java.util.Comparator<T> comparator) {
if (max <= min) throw new IllegalArgumentException("empty range");
double phi = (1 + Math.sqrt(5)) / 2;
for (int i = 0;i < loop;++ i) {
double mid_min = (min * phi + max) / (1 + phi), mid_max = (min + max * phi) / (1 + phi);
T mid_min_calc = func.apply(mid_min), mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) max = mid_max;
else min = mid_min;
}
return min;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> int find_minimal(int min, int max, java.util.function.IntFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> int find_minimal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> int find_maximal(int min, int max, java.util.function.IntFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> int find_maximal(int min, int max, java.util.function.IntFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
int range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
int fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
int mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極小値
*/
public static <T extends Comparable<T>> long find_minimal(long min, long max, java.util.function.LongFunction<T> func) {
return find_minimal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 下に凸な関数の極小値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極小値
*/
public static <T> long find_minimal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) <= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @return 極大値
*/
public static <T extends Comparable<T>> long find_maximal(long min, long max, java.util.function.LongFunction<T> func) {
return find_maximal(min, max, func, java.util.Comparator.naturalOrder());
}
/**
* 上に凸な関数の極大値を発見します。
* @param <T> 関数の終域
* @param min 関数の定義域の下界
* @param max 関数の定義域の上界
* @param func 関数
* @param comparator 比較関数
* @return 極大値
*/
public static <T> long find_maximal(long min, long max, java.util.function.LongFunction<T> func, java.util.Comparator<T> comparator) {
-- min;
long range = max - min;
if (range <= 1) throw new IllegalArgumentException("empty range");
long fib_small = 1, fib_large = 1;
while(fib_large < range) {
fib_large += fib_small;
fib_small = fib_large - fib_small;
}
T mid_min_calc = null, mid_max_calc = null;
int last_calc = -1;
final int LAST_CALC_IS_MIN = 0, LAST_CALC_IS_MAX = 1;
while(max - min > 2) {
fib_small = fib_large - fib_small;
fib_large -= fib_small;
long mid_min = min + fib_small, mid_max = min + fib_large;
if (mid_max >= max) {
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
continue;
}
if (last_calc != LAST_CALC_IS_MIN) mid_min_calc = func.apply(mid_min);
if (last_calc != LAST_CALC_IS_MAX) mid_max_calc = func.apply(mid_max);
if (comparator.compare(mid_min_calc, mid_max_calc) >= 0) {
max = mid_max;
mid_max_calc = mid_min_calc;
last_calc = LAST_CALC_IS_MAX;
} else {
min = mid_min;
mid_min_calc = mid_max_calc;
last_calc = LAST_CALC_IS_MIN;
}
}
return min + 1;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_d
*/
public static final class MaxFlow {
private static final class InternalCapEdge {
final int to;
final int rev;
long cap;
InternalCapEdge(int to, int rev, long cap) {
this.to = to;
this.rev = rev;
this.cap = cap;
}
}
public static final class CapEdge {
public final int from, to;
public final long cap, flow;
CapEdge(int from, int to, long cap, long flow) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
}
@Override
public boolean equals(Object o) {
if (o instanceof CapEdge) {
CapEdge e = (CapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalCapEdge>[] g;
@SuppressWarnings("unchecked")
public MaxFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalCapEdge(to, toId, cap));
g[to].add(new InternalCapEdge(from, fromId, 0L));
return m;
}
private InternalCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalCapEdge getInternalEdgeReversed(InternalCapEdge e) {
return g[e.to].get(e.rev);
}
public CapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
return new CapEdge(re.to, e.to, e.cap + re.cap, re.cap);
}
public CapEdge[] getEdges() {
CapEdge[] res = new CapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public void changeEdge(int i, long newCap, long newFlow) {
int m = pos.size();
rangeCheck(i, 0, m);
nonNegativeCheck(newCap, "Capacity");
if (newFlow > newCap) {
throw new IllegalArgumentException(
String.format("Flow %d is greater than the capacity %d.", newCap, newFlow));
}
InternalCapEdge e = getInternalEdge(i);
InternalCapEdge re = getInternalEdgeReversed(e);
e.cap = newCap - newFlow;
re.cap = newFlow;
}
public long maxFlow(int s, int t) {
return flow(s, t, INF);
}
public long flow(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
long flow = 0L;
int[] level = new int[n];
int[] que = new int[n];
int[] iter = new int[n];
while (flow < flowLimit) {
bfs(s, t, level, que);
if (level[t] < 0) break;
java.util.Arrays.fill(iter, 0);
while (flow < flowLimit) {
long d = dfs(t, s, flowLimit - flow, iter, level);
if (d == 0) break;
flow += d;
}
}
return flow;
}
private void bfs(int s, int t, int[] level, int[] que) {
java.util.Arrays.fill(level, -1);
int hd = 0, tl = 0;
que[tl++] = s;
level[s] = 0;
while (hd < tl) {
int u = que[hd++];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap == 0 || level[v] >= 0) continue;
level[v] = level[u] + 1;
if (v == t) return;
que[tl++] = v;
}
}
}
private long dfs(int cur, int s, long flowLimit, int[] iter, int[] level) {
if (cur == s) return flowLimit;
long res = 0;
int curLevel = level[cur];
for (int itMax = g[cur].size(); iter[cur] < itMax; iter[cur]++) {
int i = iter[cur];
InternalCapEdge e = g[cur].get(i);
InternalCapEdge re = getInternalEdgeReversed(e);
if (curLevel <= level[e.to] || re.cap == 0) continue;
long d = dfs(e.to, s, Math.min(flowLimit - res, re.cap), iter, level);
if (d <= 0) continue;
e.cap += d;
re.cap -= d;
res += d;
if (res == flowLimit) break;
}
return res;
}
public boolean[] minCut(int s) {
rangeCheck(s, 0, n);
boolean[] visited = new boolean[n];
int[] stack = new int[n];
int ptr = 0;
stack[ptr++] = s;
visited[s] = true;
while (ptr > 0) {
int u = stack[--ptr];
for (InternalCapEdge e : g[u]) {
int v = e.to;
if (e.cap > 0 && !visited[v]) {
visited[v] = true;
stack[ptr++] = v;
}
}
}
return visited;
}
private void rangeCheck(int i, int minInclusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* - https://atcoder.jp/contests/practice2/tasks/practice2_e
* - http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_6_B
*/
public static final class MinCostFlow {
private static final class InternalWeightedCapEdge {
final int to, rev;
long cap;
final long cost;
InternalWeightedCapEdge(int to, int rev, long cap, long cost) {
this.to = to;
this.rev = rev;
this.cap = cap;
this.cost = cost;
}
}
public static final class WeightedCapEdge {
public final int from, to;
public final long cap, flow, cost;
WeightedCapEdge(int from, int to, long cap, long flow, long cost) {
this.from = from;
this.to = to;
this.cap = cap;
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof WeightedCapEdge) {
WeightedCapEdge e = (WeightedCapEdge) o;
return from == e.from && to == e.to && cap == e.cap && flow == e.flow && cost == e.cost;
}
return false;
}
}
private static final class IntPair {
final int first, second;
IntPair(int first, int second) {
this.first = first;
this.second = second;
}
}
public static final class FlowAndCost {
public final long flow, cost;
FlowAndCost(long flow, long cost) {
this.flow = flow;
this.cost = cost;
}
@Override
public boolean equals(Object o) {
if (o instanceof FlowAndCost) {
FlowAndCost c = (FlowAndCost) o;
return flow == c.flow && cost == c.cost;
}
return false;
}
}
static final long INF = Long.MAX_VALUE;
private final int n;
private final java.util.ArrayList<IntPair> pos;
private final java.util.ArrayList<InternalWeightedCapEdge>[] g;
@SuppressWarnings("unchecked")
public MinCostFlow(int n) {
this.n = n;
pos = new java.util.ArrayList<>();
g = new java.util.ArrayList[n];
for (int i = 0; i < n; i++) {
g[i] = new java.util.ArrayList<>();
}
}
public int addEdge(int from, int to, long cap, long cost) {
rangeCheck(from, 0, n);
rangeCheck(to, 0, n);
nonNegativeCheck(cap, "Capacity");
nonNegativeCheck(cost, "Cost");
int m = pos.size();
pos.add(new IntPair(from, g[from].size()));
int fromId = g[from].size();
int toId = g[to].size();
if (from == to) toId++;
g[from].add(new InternalWeightedCapEdge(to, toId, cap, cost));
g[to].add(new InternalWeightedCapEdge(from, fromId, 0L, -cost));
return m;
}
private InternalWeightedCapEdge getInternalEdge(int i) {
return g[pos.get(i).first].get(pos.get(i).second);
}
private InternalWeightedCapEdge getInternalEdgeReversed(InternalWeightedCapEdge e) {
return g[e.to].get(e.rev);
}
public WeightedCapEdge getEdge(int i) {
int m = pos.size();
rangeCheck(i, 0, m);
InternalWeightedCapEdge e = getInternalEdge(i);
InternalWeightedCapEdge re = getInternalEdgeReversed(e);
return new WeightedCapEdge(re.to, e.to, e.cap + re.cap, re.cap, e.cost);
}
public WeightedCapEdge[] getEdges() {
WeightedCapEdge[] res = new WeightedCapEdge[pos.size()];
java.util.Arrays.setAll(res, this::getEdge);
return res;
}
public FlowAndCost minCostMaxFlow(int s, int t) {
return minCostFlow(s, t, INF);
}
public FlowAndCost minCostFlow(int s, int t, long flowLimit) {
return minCostSlope(s, t, flowLimit).getLast();
}
public java.util.ArrayList<Long> minCostList(int s, int t) {
return minCostList(s, t, INF);
}
public java.util.ArrayList<Long> minCostList(int s, int t, long flowLimit) {
java.util.LinkedList<FlowAndCost> list = minCostSlope(s, t, flowLimit);
FlowAndCost last = list.pollFirst();
java.util.ArrayList<Long> ret = new java.util.ArrayList<>();
ret.add(0L);
while(!list.isEmpty()) {
FlowAndCost now = list.pollFirst();
for (long i = last.flow + 1;i <= now.flow;++ i) {
ret.add(last.cost + (i - last.flow) * (now.cost - last.cost) / (now.flow - last.flow));
}
last = now;
}
return ret;
}
java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t) {
return minCostSlope(s, t, INF);
}
public java.util.LinkedList<FlowAndCost> minCostSlope(int s, int t, long flowLimit) {
rangeCheck(s, 0, n);
rangeCheck(t, 0, n);
if (s == t) { throw new IllegalArgumentException(String.format("%d and %d is the same vertex.", s, t)); }
long[] dual = new long[n];
long[] dist = new long[n];
int[] pv = new int[n];
int[] pe = new int[n];
boolean[] vis = new boolean[n];
long flow = 0;
long cost = 0, prev_cost = -1;
java.util.LinkedList<FlowAndCost> result = new java.util.LinkedList<>();
result.addLast(new FlowAndCost(flow, cost));
while (flow < flowLimit) {
if (!dualRef(s, t, dual, dist, pv, pe, vis)) break;
long c = flowLimit - flow;
for (int v = t; v != s; v = pv[v]) {
c = Math.min(c, g[pv[v]].get(pe[v]).cap);
}
for (int v = t; v != s; v = pv[v]) {
InternalWeightedCapEdge e = g[pv[v]].get(pe[v]);
e.cap -= c;
g[v].get(e.rev).cap += c;
}
long d = -dual[s];
flow += c;
cost += c * d;
if (prev_cost == d) {
result.removeLast();
}
result.addLast(new FlowAndCost(flow, cost));
prev_cost = cost;
}
return result;
}
private boolean dualRef(int s, int t, long[] dual, long[] dist, int[] pv, int[] pe, boolean[] vis) {
java.util.Arrays.fill(dist, INF);
java.util.Arrays.fill(pv, -1);
java.util.Arrays.fill(pe, -1);
java.util.Arrays.fill(vis, false);
class State implements Comparable<State> {
final long key;
final int to;
State(long key, int to) {
this.key = key;
this.to = to;
}
@Override
public int compareTo(State q) {
return key > q.key ? 1 : -1;
}
};
java.util.PriorityQueue<State> pq = new java.util.PriorityQueue<>();
dist[s] = 0;
pq.add(new State(0L, s));
while (pq.size() > 0) {
int v = pq.poll().to;
if (vis[v]) continue;
vis[v] = true;
if (v == t) break;
for (int i = 0, deg = g[v].size(); i < deg; i++) {
InternalWeightedCapEdge e = g[v].get(i);
if (vis[e.to] || e.cap == 0) continue;
long cost = e.cost - dual[e.to] + dual[v];
if (dist[e.to] - dist[v] > cost) {
dist[e.to] = dist[v] + cost;
pv[e.to] = v;
pe[e.to] = i;
pq.add(new State(dist[e.to], e.to));
}
}
}
if (!vis[t]) { return false; }
for (int v = 0; v < n; v++) {
if (!vis[v]) continue;
dual[v] -= dist[t] - dist[v];
}
return true;
}
private void rangeCheck(int i, int minInlusive, int maxExclusive) {
if (i < 0 || i >= maxExclusive) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, maxExclusive));
}
}
private void nonNegativeCheck(long cap, java.lang.String attribute) {
if (cap < 0) { throw new IllegalArgumentException(String.format("%s %d is negative.", attribute, cap)); }
}
}
/**
* @verified
* <ul>
* <li>https://atcoder.jp/contests/arc050/tasks/arc050_c
* <li>https://atcoder.jp/contests/abc129/tasks/abc129_f
* </ul>
*/
public static final class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
public ModIntFactory(final int mod) {
ma = ModArithmetic.of(mod);
this.mod = mod;
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return new ModInt(((ModArithmetic.ModArithmeticMontgomery) ma).generate(value));
}
return new ModInt((int) value);
}
class ModInt {
private int value;
private ModInt(final int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (ma instanceof ModArithmetic.ModArithmeticMontgomery) {
return ((ModArithmetic.ModArithmeticMontgomery) ma).reduce(value);
}
return value;
}
public ModInt add(final ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(final ModInt mi1, final ModInt... mis) {
final ModInt mi = add(mi1);
for (final ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(final long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(final ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(final long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(final ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(final ModInt mi1, final ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(final ModInt mi1, final ModInt... mis) {
final ModInt mi = mul(mi1);
for (final ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(final long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(final ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(final long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(final long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(final ModInt mi) {
value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(final ModInt... mis) {
for (final ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(final long mi) {
value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(final ModInt mi) {
value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(final long mi) {
value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(final ModInt mi) {
value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(final ModInt mi1, final ModInt mi2, final ModInt mi3, final ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(final ModInt... mis) {
for (final ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(final long mi) {
value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(final ModInt mi) {
value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(final long mi) {
value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(final Object o) {
if (o instanceof ModInt) {
final ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private interface ModArithmetic {
public int mod();
public int remainder(long value);
public int add(int a, int b);
public int sub(int a, int b);
public int mul(int a, int b);
public default int div(final int a, final int b) {
return mul(a, inv(b));
}
public int inv(int a);
public int pow(int a, long b);
public static ModArithmetic of(final int mod) {
if (mod <= 0) {
throw new IllegalArgumentException();
} else if (mod == 1) {
return new ModArithmetic1();
} else if (mod == 2) {
return new ModArithmetic2();
} else if (mod == 998244353) {
return new ModArithmetic998244353();
} else if (mod == 1000000007) {
return new ModArithmetic1000000007();
} else if ((mod & 1) == 1) {
return new ModArithmeticMontgomery(mod);
} else {
return new ModArithmeticBarrett(mod);
}
}
static final class ModArithmetic1 implements ModArithmetic {
@Override
public int mod() {
return 1;
}
@Override
public int remainder(final long value) {
return 0;
}
@Override
public int add(final int a, final int b) {
return 0;
}
@Override
public int sub(final int a, final int b) {
return 0;
}
@Override
public int mul(final int a, final int b) {
return 0;
}
@Override
public int inv(final int a) {
throw new ArithmeticException("divide by zero");
}
@Override
public int pow(final int a, final long b) {
return 0;
}
}
static final class ModArithmetic2 implements ModArithmetic {
@Override
public int mod() {
return 2;
}
@Override
public int remainder(final long value) {
return (int) (value & 1);
}
@Override
public int add(final int a, final int b) {
return a ^ b;
}
@Override
public int sub(final int a, final int b) {
return a ^ b;
}
@Override
public int mul(final int a, final int b) {
return a & b;
}
@Override
public int inv(final int a) {
if (a == 0) throw new ArithmeticException("divide by zero");
return a;
}
@Override
public int pow(final int a, final long b) {
if (b == 0) return 1;
return a;
}
}
static final class ModArithmetic998244353 implements ModArithmetic {
private final int mod = 998244353;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmetic1000000007 implements ModArithmetic {
private final int mod = 1000000007;
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int res = a + b;
return res >= mod ? res - mod : res;
}
@Override
public int sub(final int a, final int b) {
final int res = a - b;
return res < 0 ? res + mod : res;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int div(final int a, final int b) {
return mul(a, inv(b));
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
long res = 1;
long pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = pow2 * pow2 % mod;
}
res = res * pow2 % mod;
b ^= lsb;
}
return (int) res;
}
}
static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2, r3;
private ModArithmeticMontgomery(final int mod) {
super(mod);
long inv = 0;
long s = 1, t = 0;
for (int i = 0; i < 32; i++) {
if ((t & 1) == 0) {
t += mod;
inv += s;
}
t >>= 1;
s <<= 1;
}
final long r = (1l << 32) % mod;
negInv = inv;
r2 = r * r % mod;
r3 = r2 * r % mod;
}
private int generate(final long x) {
return reduce(x * r2);
}
private int reduce(long x) {
x = x + (x * negInv & 0xffff_ffffl) * mod >>> 32;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
@Override
public int inv(int a) {
a = super.inv(a);
return reduce(a * r3);
}
@Override
public int pow(final int a, final long b) {
return generate(super.pow(a, b));
}
}
static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(final int mod) {
super(mod);
/**
* m = floor(2^64/mod) 2^64 = p*mod + q, 2^32 = a*mod + b => (a*mod + b)^2 =
* p*mod + q => p = mod*a^2 + 2ab + floor(b^2/mod)
*/
final long a = (1l << 32) / mod;
final long b = (1l << 32) % mod;
final long m = a * a * mod + 2 * a * b + b * b / mod;
mh = m >>> 32;
ml = m & mask;
}
private int reduce(long x) {
long z = (x & mask) * ml;
z = (x & mask) * mh + (x >>> 32) * ml + (z >>> 32);
z = (x >>> 32) * mh + (z >>> 32);
x -= z * mod;
return (int) (x < mod ? x : x - mod);
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int mul(final int a, final int b) {
return reduce((long) a * b);
}
}
static class ModArithmeticDynamic implements ModArithmetic {
final int mod;
public ModArithmeticDynamic(final int mod) {
this.mod = mod;
}
@Override
public int mod() {
return mod;
}
@Override
public int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
public int add(final int a, final int b) {
final int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
@Override
public int sub(final int a, final int b) {
final int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
@Override
public int mul(final int a, final int b) {
return (int) ((long) a * b % mod);
}
@Override
public int inv(int a) {
int b = mod;
long u = 1, v = 0;
while (b >= 1) {
final long t = a / b;
a -= t * b;
final int tmp1 = a;
a = b;
b = tmp1;
u -= t * v;
final long tmp2 = u;
u = v;
v = tmp2;
}
u %= mod;
if (a != 1) { throw new ArithmeticException("divide by zero"); }
return (int) (u < 0 ? u + mod : u);
}
@Override
public int pow(final int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int res = 1;
int pow2 = a;
long idx = 1;
while (b > 0) {
final long lsb = b & -b;
for (; lsb != idx; idx <<= 1) {
pow2 = mul(pow2, pow2);
}
res = mul(res, pow2);
b ^= lsb;
}
return res;
}
}
}
}
/**
* Convolution.
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_f
* @verified https://judge.yosupo.jp/problem/convolution_mod_1000000007
*/
public static final class Convolution {
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
private static void fft(double[] a, double[] b, boolean invert) {
int count = a.length;
for (int i = 1, j = 0; i < count; i++) {
int bit = count >> 1;
for (; j >= bit; bit >>= 1) {
j -= bit;
}
j += bit;
if (i < j) {
double temp = a[i];
a[i] = a[j];
a[j] = temp;
temp = b[i];
b[i] = b[j];
b[j] = temp;
}
}
for (int len = 2; len <= count; len <<= 1) {
int halfLen = len >> 1;
double angle = 2 * Math.PI / len;
if (invert) {
angle = -angle;
}
double wLenA = Math.cos(angle);
double wLenB = Math.sin(angle);
for (int i = 0; i < count; i += len) {
double wA = 1;
double wB = 0;
for (int j = 0; j < halfLen; j++) {
double uA = a[i + j];
double uB = b[i + j];
double vA = a[i + j + halfLen] * wA - b[i + j + halfLen] * wB;
double vB = a[i + j + halfLen] * wB + b[i + j + halfLen] * wA;
a[i + j] = uA + vA;
b[i + j] = uB + vB;
a[i + j + halfLen] = uA - vA;
b[i + j + halfLen] = uB - vB;
double nextWA = wA * wLenA - wB * wLenB;
wB = wA * wLenB + wB * wLenA;
wA = nextWA;
}
}
}
if (invert) {
for (int i = 0; i < count; i++) {
a[i] /= count;
b[i] /= count;
}
}
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static long[] convolution(long[] a, long[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
long[] result = new long[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = Math.round(aReal[i]);
return result;
}
/**
* writer: amotama 勝手に借りてます、問題あったらごめんね
*/
public static int[] convolution(int[] a, int[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = new double[resultSize];
double[] aImaginary = new double[resultSize];
double[] bReal = new double[resultSize];
double[] bImaginary = new double[resultSize];
for (int i = 0; i < a.length; i++) aReal[i] = a[i];
for (int i = 0; i < b.length; i++) bReal[i] = b[i];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
int[] result = new int[a.length + b.length - 1];
for (int i = 0; i < result.length; i++) result[i] = (int) Math.round(aReal[i]);
return result;
}
public static double[] convolution(double[] a, double[] b) {
int resultSize = Integer.highestOneBit(Math.max(a.length, b.length) - 1) << 2;
resultSize = Math.max(resultSize, 1);
double[] aReal = Arrays.copyOf(a, resultSize);
double[] aImaginary = new double[resultSize];
double[] bReal = Arrays.copyOf(b, resultSize);
double[] bImaginary = new double[resultSize];
fft(aReal, aImaginary, false);
if (a == b) {
System.arraycopy(aReal, 0, bReal, 0, aReal.length);
System.arraycopy(aImaginary, 0, bImaginary, 0, aImaginary.length);
} else {
fft(bReal, bImaginary, false);
}
for (int i = 0; i < resultSize; i++) {
double real = aReal[i] * bReal[i] - aImaginary[i] * bImaginary[i];
aImaginary[i] = aImaginary[i] * bReal[i] + bImaginary[i] * aReal[i];
aReal[i] = real;
}
fft(aReal, aImaginary, true);
return Arrays.copyOf(aReal, a.length + b.length - 1);
}
/**
* Find a primitive root.
*
* @param m A prime number.
* @return Primitive root.
*/
private static int primitiveRoot(final int m) {
if (m == 2) return 1;
if (m == 167772161) return 3;
if (m == 469762049) return 3;
if (m == 754974721) return 11;
if (m == 998244353) return 3;
final int[] divs = new int[20];
divs[0] = 2;
int cnt = 1;
int x = (m - 1) / 2;
while (x % 2 == 0) x /= 2;
for (int i = 3; (long) i * i <= x; i += 2) {
if (x % i == 0) {
divs[cnt++] = i;
while (x % i == 0) {
x /= i;
}
}
}
if (x > 1) {
divs[cnt++] = x;
}
for (int g = 2;; g++) {
boolean ok = true;
for (int i = 0; i < cnt; i++) {
if (MathLib.pow(g, (m - 1) / divs[i], m) == 1) {
ok = false;
break;
}
}
if (ok) return g;
}
}
/**
* Ceil of power 2.
*
* @param n Value.
* @return Ceil of power 2.
*/
private static int ceilPow2(final int n) {
int x = 0;
while (1L << x < n) x++;
return x;
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static long garner(final long[] c, final int[] mods) {
final int n = c.length + 1;
final long[] cnst = new long[n];
final long[] coef = new long[n];
java.util.Arrays.fill(coef, 1);
for (int i = 0; i < n - 1; i++) {
final int m1 = mods[i];
long v = (c[i] - cnst[i] + m1) % m1;
v = v * MathLib.pow(coef[i], m1 - 2, m1) % m1;
for (int j = i + 1; j < n; j++) {
final long m2 = mods[j];
cnst[j] = (cnst[j] + coef[j] * v) % m2;
coef[j] = coef[j] * m1 % m2;
}
}
return cnst[n - 1];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner(int c0, int c1, int c2, final MathLib.Barrett[] mods) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
MathLib.Barrett m1 = mods[0];
long v = m1.reduce(c0 - cnst[0] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[0], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[1];
cnst[1] = m2.reduce(cnst[1] + coef[1] * v);
coef[1] = m2.reduce(coef[1] * m1.mod);
m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[1];
v = m1.reduce(c1 - cnst[1] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[1], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[2];
cnst[2] = m2.reduce(cnst[2] + coef[2] * v);
coef[2] = m2.reduce(coef[2] * m1.mod);
m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
m1 = mods[2];
v = m1.reduce(c2 - cnst[2] + m1.mod);
v = m1.reduce(v * MathLib.pow(coef[2], m1.mod - 2, m1));
{
MathLib.Barrett m2 = mods[3];
cnst[3] = m2.reduce(cnst[3] + coef[3] * v);
coef[3] = m2.reduce(coef[3] * m1.mod);
}
return (int) cnst[3];
}
/**
* Garner's algorithm.
*
* @param c Mod convolution results.
* @param mods Mods.
* @return Result.
*/
private static int garner1_000_000_007(int c0, int c1, int c2) {
final long[] cnst = new long[4];
final long[] coef = new long[4];
java.util.Arrays.fill(coef, 1);
long v = (c0 - cnst[0] + 998_244_353) % 998_244_353;
v = v * MathLib.pow998_244_353(coef[0], 998_244_353 - 2) % 998_244_353;
{
cnst[1] = (cnst[1] + coef[1] * v) % 167_772_161;
coef[1] = coef[1] * 998_244_353 % 167_772_161;
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 998_244_353 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 998_244_353 % 1_000_000_007;
}
v = (c1 - cnst[1] + 167_772_161) % 167_772_161;
v = v * MathLib.pow167_772_161(coef[1], 167_772_161 - 2) % 167_772_161;
{
cnst[2] = (cnst[2] + coef[2] * v) % 469_762_049;
coef[2] = coef[2] * 167_772_161 % 469_762_049;
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 167_772_161 % 1_000_000_007;
}
v = (c2 - cnst[2] + 469_762_049) % 469_762_049;
v = v * MathLib.pow469_762_049(coef[2], 469_762_049 - 2) % 469_762_049;
{
cnst[3] = (cnst[3] + coef[3] * v) % 1_000_000_007;
coef[3] = coef[3] * 469_762_049 % 1_000_000_007;
}
return (int) cnst[3];
}
/**
* Pre-calculation for NTT.
*
* @param mod NTT Prime.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumE(final int mod, final int g) {
final long[] sum_e = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_e[i] = es[i] * now % mod;
now = now * ies[i] % mod;
}
return sum_e;
}
/**
* Pre-calculation for inverse NTT.
*
* @param mod Mod.
* @param g Primitive root of mod.
* @return Pre-calculation table.
*/
private static long[] sumIE(final int mod, final int g) {
final long[] sum_ie = new long[30];
final long[] es = new long[30];
final long[] ies = new long[30];
final int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = MathLib.pow(g, mod - 1 >> cnt2, mod);
long ie = MathLib.pow(e, mod - 2, mod);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long now = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum_ie[i] = ies[i] * now % mod;
now = now * es[i] % mod;
}
return sum_ie;
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final long[] a, final long[] sumIE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (mod + l - r) * inow % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % mod;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final long[] a, final long[] sumE, final int mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now % mod;
a[i + offset] = (l + r) % mod;
a[i + offset + p] = (l - r + mod) % mod;
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % mod;
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv998_244_353(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((998_244_353 + l - r) * inow % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv167_772_161(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((167_772_161 + l - r) * inow % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
*/
private static void butterflyInv469_762_049(final int[] a, final int[] sumIE) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((469_762_049 + l - r) * inow % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = inow * sumIE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumIE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterflyInv(final int[] a, final int[] sumIE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
for (int ph = h; ph >= 1; ph--) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long inow = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p];
long sum = l + r;
if (sum >= mod.mod) sum -= mod.mod;
a[i + offset] = (int) sum;
a[i + offset + p] = mod.reduce((mod.mod + l - r) * inow);
}
final int x = Integer.numberOfTrailingZeros(~s);
inow = mod.reduce(inow * sumIE[x]);
}
}
}
/**
* Inverse NTT used mod 998_244_353.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly998_244_353(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (998_244_353 - 2) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 998_244_353);
a[i + offset + p] = (int) ((l - r + ADD) % 998_244_353);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 998_244_353;
}
}
}
/**
* Inverse NTT used mod 167_772_161.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly167_772_161(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (167_772_161 - 2) * 167_772_161;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 167_772_161);
a[i + offset + p] = (int) ((l - r + ADD) % 167_772_161);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 167_772_161;
}
}
}
/**
* Inverse NTT used mod 469_762_049.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly469_762_049(final int[] a, final int[] sumE) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (469_762_049 - 2) * 469_762_049;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = (int) ((l + r) % 469_762_049);
a[i + offset + p] = (int) ((l - r + ADD) % 469_762_049);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = now * sumE[x] % 469_762_049;
}
}
}
/**
* Inverse NTT.
*
* @param a Target array.
* @param sumE Pre-calculation table.
* @param mod NTT Prime.
*/
private static void butterfly(final int[] a, final int[] sumE, final MathLib.Barrett mod) {
final int n = a.length;
final int h = ceilPow2(n);
final long ADD = (long) (mod.mod - 2) * mod.mod;
for (int ph = 1; ph <= h; ph++) {
final int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
final int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
final long l = a[i + offset];
final long r = a[i + offset + p] * now;
a[i + offset] = mod.reduce(l + r);
a[i + offset + p] = mod.reduce(l - r + ADD);
}
final int x = Integer.numberOfTrailingZeros(~s);
now = mod.reduce(now * sumE[x]);
}
}
}
/**
* Convolution used mod 998_244_353.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution998_244_353(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(998_244_353);
final int[] sume;
{
long[] s = sumE(998_244_353, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(998_244_353, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly998_244_353(a, sume);
butterfly998_244_353(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 998_244_353);
butterflyInv998_244_353(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow998_244_353(z, 998_244_353 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 998_244_353);
return a;
}
/**
* Convolution used mod 167_772_161.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution167_772_161(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(167_772_161);
final int[] sume;
{
long[] s = sumE(167_772_161, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(167_772_161, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly167_772_161(a, sume);
butterfly167_772_161(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 167_772_161);
butterflyInv167_772_161(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow167_772_161(z, 167_772_161 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 167_772_161);
return a;
}
/**
* Convolution used mod 469_762_049.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution469_762_049(int[] a, int[] b) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(469_762_049);
final int[] sume;
{
long[] s = sumE(469_762_049, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(469_762_049, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly469_762_049(a, sume);
butterfly469_762_049(b, sume);
for (int i = 0; i < z; i++) a[i] = (int) ((long) a[i] * b[i] % 469_762_049);
butterflyInv469_762_049(a, sumie);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow469_762_049(z, 469_762_049 - 2);
for (int i = 0; i < n + m - 1; i++) a[i] = (int) (a[i] * iz % 469_762_049);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static int[] convolutionNTT(int[] a, int[] b, final int mod) {
MathLib.Barrett barrett = new MathLib.Barrett(mod);
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final int[] na = new int[z];
final int[] nb = new int[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final int[] sume;
{
long[] s = sumE(mod, g);
sume = new int[s.length];
for (int i = 0; i < s.length; ++i) sume[i] = (int) s[i];
}
final int[] sumie;
{
long[] s = sumIE(mod, g);
sumie = new int[s.length];
for (int i = 0; i < s.length; ++i) sumie[i] = (int) s[i];
}
butterfly(a, sume, barrett);
butterfly(b, sume, barrett);
for (int i = 0; i < z; i++) a[i] = barrett.reduce((long) a[i] * b[i]);
butterflyInv(a, sumie, barrett);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = barrett.reduce(a[i] * iz);
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod NTT Prime.
* @return Answer.
*/
private static long[] convolutionNTT(long[] a, long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int z = 1 << ceilPow2(n + m - 1);
{
final long[] na = new long[z];
final long[] nb = new long[z];
System.arraycopy(a, 0, na, 0, n);
System.arraycopy(b, 0, nb, 0, m);
a = na;
b = nb;
}
final int g = primitiveRoot(mod);
final long[] sume = sumE(mod, g);
final long[] sumie = sumIE(mod, g);
butterfly(a, sume, mod);
butterfly(b, sume, mod);
for (int i = 0; i < z; i++) {
a[i] = a[i] * b[i] % mod;
}
butterflyInv(a, sumie, mod);
a = java.util.Arrays.copyOf(a, n + m - 1);
final long iz = MathLib.pow(z, mod - 2, mod);
for (int i = 0; i < n + m - 1; i++) a[i] = a[i] * iz % mod;
return a;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static long[] convolution(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new long[0];
final int mod1 = 998_244_353;
final int mod2 = 167_772_161;
final int mod3 = 469_762_049;
final long[] c1 = convolutionNTT(a, b, mod1);
final long[] c2 = convolutionNTT(a, b, mod2);
final long[] c3 = convolutionNTT(a, b, mod3);
final int retSize = c1.length;
final long[] ret = new long[retSize];
final int[] mods = { mod1, mod2, mod3, mod };
for (int i = 0; i < retSize; ++i) {
ret[i] = garner(new long[] { c1[i], c2[i], c3[i] }, mods);
}
return ret;
}
/**
* Convolution.
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution(final int[] a, final int[] b, final int mod) {
final int n = a.length;
final int m = b.length;
if (n == 0 || m == 0) return new int[0];
if (mod == 1_000_000_007) return convolution1_000_000_007(a, b);
if (mod == 998_244_353) return convolution998_244_353(a, b);
int ntt = Integer.lowestOneBit(mod - 1) >> 1;
if (n + m <= ntt) return convolutionNTT(a, b, mod);
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
final MathLib.Barrett[] mods = { new MathLib.Barrett(998_244_353), new MathLib.Barrett(167_772_161),
new MathLib.Barrett(469_762_049), new MathLib.Barrett(mod) };
for (int i = 0; i < retSize; ++i) ret[i] = garner(c1[i], c2[i], c3[i], mods);
return ret;
}
/**
* Convolution used mod 1_000_000_007.
*
* @param a Target array 1.
* @param b Target array 2.
* @return Answer.
*/
private static int[] convolution1_000_000_007(final int[] a, final int[] b) {
final int[] c1 = convolution998_244_353(a, b);
final int[] c2 = convolution167_772_161(a, b);
final int[] c3 = convolution469_762_049(a, b);
final int retSize = c1.length;
final int[] ret = new int[retSize];
for (int i = 0; i < retSize; ++i) ret[i] = garner1_000_000_007(c1[i], c2[i], c3[i]);
return ret;
}
/**
* Convolution. need: length < 2000
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Any mod.
* @return Answer.
*/
public static int[] convolution2(final int[] a, final int[] b, final int mod) {
if (Math.max(a.length, b.length) < 4000) {
long[] la = new long[a.length], ha = new long[a.length], ma = new long[a.length],
lb = new long[b.length], hb = new long[b.length], mb = new long[b.length];
MathLib.Barrett barrett = new MathLib.Barrett(mod);
for (int i = 0; i < a.length; ++i) {
ha[i] = a[i] >> 15;
la[i] = a[i] & 0x7FFF;
ma[i] = la[i] + ha[i];
}
for (int i = 0; i < b.length; ++i) {
hb[i] = b[i] >> 15;
lb[i] = b[i] & 0x7FFF;
mb[i] = lb[i] + hb[i];
}
long[] l = convolution(la, lb), h = convolution(ha, hb), m = convolution(ma, mb);
int[] ret = new int[m.length];
for (int i = 0; i < m.length; ++i) {
h[i] = barrett.reduce(h[i]);
m[i] = barrett.reduce(m[i] - l[i] - h[i] + (long) m.length * mod);
ret[i] = barrett.reduce((h[i] << 30) + (m[i] << 15) + l[i]);
}
return ret;
}
return convolution(a, b, mod);
}
/**
* Naive convolution. (Complexity is O(N^2)!!)
*
* @param a Target array 1.
* @param b Target array 2.
* @param mod Mod.
* @return Answer.
*/
public static long[] convolutionNaive(final long[] a, final long[] b, final int mod) {
final int n = a.length;
final int m = b.length;
final int k = n + m - 1;
final long[] ret = new long[k];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[i + j] += a[i] * b[j] % mod;
ret[i + j] %= mod;
}
}
return ret;
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_g
*/
public static final class SCC {
static class Edge {
int from, to;
public Edge(final int from, final int to) {
this.from = from;
this.to = to;
}
}
final int n;
int m;
final java.util.ArrayList<Edge> unorderedEdges;
final int[] start;
final int[] ids;
boolean hasBuilt = false;
public SCC(final int n) {
this.n = n;
unorderedEdges = new java.util.ArrayList<>();
start = new int[n + 1];
ids = new int[n];
}
public void addEdge(final int from, final int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
m++;
}
public int id(final int i) {
if (!hasBuilt) { throw new UnsupportedOperationException("Graph hasn't been built."); }
rangeCheck(i);
return ids[i];
}
public int[][] build() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] orderedEdges = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (final Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
final int[] par = new int[n];
final int[] vis = new int[n];
final int[] low = new int[n];
final int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
final long[] stack = new long[n];
// size of stack
int ptr = 0;
// non-recursional DFS
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
// vertex i, 0th child.
stack[ptr++] = 0l << 32 | i;
// stack is not empty
while (ptr > 0) {
// last element
final long p = stack[--ptr];
// vertex
final int u = (int) (p & 0xffff_ffffl);
// jth child
int j = (int) (p >>> 32);
if (j == 0) { // first visit
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) { // there are more children
// jth child
final int to = orderedEdges[start[u] + j].to;
// incr children counter
stack[ptr++] += 1l << 32;
if (ord[to] == -1) { // new vertex
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else { // backward edge
low[u] = Math.min(low[u], ord[to]);
}
} else { // no more children (leaving)
while (j-- > 0) {
final int to = orderedEdges[start[u] + j].to;
// update lowlink
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) { // root of a component
while (true) { // gathering verticies
final int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++; // incr the number of components
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
final int[] counts = new int[groupNum];
for (final int x : ids) counts[x]++;
final int[][] groups = new int[groupNum][];
for (int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for (int i = 0; i < n; i++) {
final int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(final int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
/**
* @verified https://atcoder.jp/contests/practice2/submissions/16647102
*/
public static final class TwoSAT {
private final int n;
private final InternalSCC scc;
private final boolean[] answer;
private boolean hasCalledSatisfiable = false;
private boolean existsAnswer = false;
public TwoSAT(int n) {
this.n = n;
scc = new InternalSCC(2 * n);
answer = new boolean[n];
}
public void addClause(int x, boolean f, int y, boolean g) {
rangeCheck(x);
rangeCheck(y);
scc.addEdge(x << 1 | (f ? 0 : 1), y << 1 | (g ? 1 : 0));
scc.addEdge(y << 1 | (g ? 0 : 1), x << 1 | (f ? 1 : 0));
}
public void addImplication(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, g);
}
public void addNand(int x, boolean f, int y, boolean g) {
addClause(x, !f, y, !g);
}
public void set(int x, boolean f) {
addClause(x, f, x, f);
}
public boolean satisfiable() {
hasCalledSatisfiable = true;
int[] ids = scc.ids();
for (int i = 0; i < n; i++) {
if (ids[i << 1 | 0] == ids[i << 1 | 1]) return existsAnswer = false;
answer[i] = ids[i << 1 | 0] < ids[i << 1 | 1];
}
return existsAnswer = true;
}
public boolean[] answer() {
if (!hasCalledSatisfiable) {
throw new UnsupportedOperationException("Call TwoSAT#satisfiable at least once before TwoSAT#answer.");
}
if (existsAnswer) return answer;
return null;
}
private void rangeCheck(int x) {
if (x < 0 || x >= n) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", x, n));
}
}
private static final class EdgeList {
long[] a;
int ptr = 0;
EdgeList(int cap) {
a = new long[cap];
}
void add(int upper, int lower) {
if (ptr == a.length) grow();
a[ptr++] = (long) upper << 32 | lower;
}
void grow() {
long[] b = new long[a.length << 1];
System.arraycopy(a, 0, b, 0, a.length);
a = b;
}
}
private static final class InternalSCC {
final int n;
int m;
final EdgeList unorderedEdges;
final int[] start;
InternalSCC(int n) {
this.n = n;
unorderedEdges = new EdgeList(n);
start = new int[n + 1];
}
void addEdge(int from, int to) {
unorderedEdges.add(from, to);
start[from + 1]++;
m++;
}
static final long mask = 0xffff_ffffl;
int[] ids() {
for (int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
int[] orderedEdges = new int[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (int i = 0; i < m; i++) {
long e = unorderedEdges.a[i];
orderedEdges[count[(int) (e >>> 32)]++] = (int) (e & mask);
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
int[] par = new int[n];
int[] vis = new int[n];
int[] low = new int[n];
int[] ord = new int[n];
java.util.Arrays.fill(ord, -1);
int[] ids = new int[n];
long[] stack = new long[n];
int ptr = 0;
for (int i = 0; i < n; i++) {
if (ord[i] >= 0) continue;
par[i] = -1;
stack[ptr++] = i;
while (ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & mask);
int j = (int) (p >>> 32);
if (j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if (start[u] + j < count[u]) {
int to = orderedEdges[start[u] + j];
stack[ptr++] += 1l << 32;
if (ord[to] == -1) {
stack[ptr++] = to;
par[to] = u;
} else {
low[u] = Math.min(low[u], ord[to]);
}
} else {
while (j-- > 0) {
int to = orderedEdges[start[u] + j];
if (par[to] == u) low[u] = Math.min(low[u], low[to]);
}
if (low[u] == ord[u]) {
while (true) {
int v = vis[--k];
ord[v] = n;
ids[v] = groupNum;
if (v == u) break;
}
groupNum++;
}
}
}
}
for (int i = 0; i < n; i++) {
ids[i] = groupNum - 1 - ids[i];
}
return ids;
}
}
}
public static final class StringAlgorithm {
private static int[] saNaive(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
java.util.Arrays.sort(_sa, (l, r) -> {
while (l < n && r < n) {
if (s[l] != s[r]) return s[l] - s[r];
l++;
r++;
}
return -(l - r);
});
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static int[] saDoubling(final int[] s) {
final int n = s.length;
final Integer[] _sa = new Integer[n];
for (int i = 0; i < n; i++) {
_sa[i] = i;
}
int[] rnk = s;
int[] tmp = new int[n];
for (int k = 1; k < n; k *= 2) {
final int _k = k;
final int[] _rnk = rnk;
final java.util.Comparator<Integer> cmp = (x, y) -> {
if (_rnk[x] != _rnk[y]) return _rnk[x] - _rnk[y];
final int rx = x + _k < n ? _rnk[x + _k] : -1;
final int ry = y + _k < n ? _rnk[y + _k] : -1;
return rx - ry;
};
java.util.Arrays.sort(_sa, cmp);
tmp[_sa[0]] = 0;
for (int i = 1; i < n; i++) {
tmp[_sa[i]] = tmp[_sa[i - 1]] + (cmp.compare(_sa[i - 1], _sa[i]) < 0 ? 1 : 0);
}
final int[] buf = tmp;
tmp = rnk;
rnk = buf;
}
final int[] sa = new int[n];
for (int i = 0; i < n; i++) {
sa[i] = _sa[i];
}
return sa;
}
private static final int THRESHOLD_NAIVE = 10;
private static final int THRESHOLD_DOUBLING = 40;
private static int[] sais(final int[] s, final int upper) {
final int n = s.length;
if (n == 0) return new int[0];
if (n == 1) return new int[] { 0 };
if (n == 2) { return s[0] < s[1] ? new int[] { 0, 1 } : new int[] { 1, 0 }; }
if (n < THRESHOLD_NAIVE) { return saNaive(s); }
if (n < THRESHOLD_DOUBLING) { return saDoubling(s); }
final int[] sa = new int[n];
final boolean[] ls = new boolean[n];
for (int i = n - 2; i >= 0; i--) {
ls[i] = s[i] == s[i + 1] ? ls[i + 1] : s[i] < s[i + 1];
}
final int[] sumL = new int[upper + 1];
final int[] sumS = new int[upper + 1];
for (int i = 0; i < n; i++) {
if (ls[i]) {
sumL[s[i] + 1]++;
} else {
sumS[s[i]]++;
}
}
for (int i = 0; i <= upper; i++) {
sumS[i] += sumL[i];
if (i < upper) sumL[i + 1] += sumS[i];
}
final java.util.function.Consumer<int[]> induce = lms -> {
java.util.Arrays.fill(sa, -1);
final int[] buf = new int[upper + 1];
System.arraycopy(sumS, 0, buf, 0, upper + 1);
for (final int d : lms) {
if (d == n) continue;
sa[buf[s[d]]++] = d;
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
sa[buf[s[n - 1]]++] = n - 1;
for (int i = 0; i < n; i++) {
final int v = sa[i];
if (v >= 1 && !ls[v - 1]) {
sa[buf[s[v - 1]]++] = v - 1;
}
}
System.arraycopy(sumL, 0, buf, 0, upper + 1);
for (int i = n - 1; i >= 0; i--) {
final int v = sa[i];
if (v >= 1 && ls[v - 1]) {
sa[--buf[s[v - 1] + 1]] = v - 1;
}
}
};
final int[] lmsMap = new int[n + 1];
java.util.Arrays.fill(lmsMap, -1);
int m = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lmsMap[i] = m++;
}
}
final int[] lms = new int[m];
{
int p = 0;
for (int i = 1; i < n; i++) {
if (!ls[i - 1] && ls[i]) {
lms[p++] = i;
}
}
}
induce.accept(lms);
if (m > 0) {
final int[] sortedLms = new int[m];
{
int p = 0;
for (final int v : sa) {
if (lmsMap[v] != -1) {
sortedLms[p++] = v;
}
}
}
final int[] recS = new int[m];
int recUpper = 0;
recS[lmsMap[sortedLms[0]]] = 0;
for (int i = 1; i < m; i++) {
int l = sortedLms[i - 1], r = sortedLms[i];
final int endL = lmsMap[l] + 1 < m ? lms[lmsMap[l] + 1] : n;
final int endR = lmsMap[r] + 1 < m ? lms[lmsMap[r] + 1] : n;
boolean same = true;
if (endL - l != endR - r) {
same = false;
} else {
while (l < endL && s[l] == s[r]) {
l++;
r++;
}
if (l == n || s[l] != s[r]) same = false;
}
if (!same) {
recUpper++;
}
recS[lmsMap[sortedLms[i]]] = recUpper;
}
final int[] recSA = sais(recS, recUpper);
for (int i = 0; i < m; i++) {
sortedLms[i] = lms[recSA[i]];
}
induce.accept(sortedLms);
}
return sa;
}
public static int[] suffixArray(final int[] s, final int upper) {
assert 0 <= upper;
for (final int d : s) {
assert 0 <= d && d <= upper;
}
return sais(s, upper);
}
public static int[] suffixArray(final int[] s) {
final int n = s.length;
final Integer[] idx = new Integer[n];
for (int i = 0; i < n; i++) {
idx[i] = i;
}
java.util.Arrays.sort(idx, (l, r) -> s[l] - s[r]);
final int[] s2 = new int[n];
int now = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && s[idx[i - 1]] != s[idx[i]]) {
now++;
}
s2[idx[i]] = now;
}
return sais(s2, now);
}
public static int[] suffixArray(final char[] s) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return sais(s2, 255);
}
public static int[] suffixArray(final java.lang.String s) {
return suffixArray(s.toCharArray());
}
public static int[] lcpArray(final int[] s, final int[] sa) {
final int n = s.length;
assert n >= 1;
final int[] rnk = new int[n];
for (int i = 0; i < n; i++) {
rnk[sa[i]] = i;
}
final int[] lcp = new int[n - 1];
int h = 0;
for (int i = 0; i < n; i++) {
if (h > 0) h--;
if (rnk[i] == 0) {
continue;
}
final int j = sa[rnk[i] - 1];
for (; j + h < n && i + h < n; h++) {
if (s[j + h] != s[i + h]) break;
}
lcp[rnk[i] - 1] = h;
}
return lcp;
}
public static int[] lcpArray(final char[] s, final int[] sa) {
final int n = s.length;
final int[] s2 = new int[n];
for (int i = 0; i < n; i++) {
s2[i] = s[i];
}
return lcpArray(s2, sa);
}
public static int[] lcpArray(final java.lang.String s, final int[] sa) {
return lcpArray(s.toCharArray(), sa);
}
public static int[] zAlgorithm(final int[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final char[] s) {
final int n = s.length;
if (n == 0) return new int[0];
final int[] z = new int[n];
for (int i = 1, j = 0; i < n; i++) {
int k = j + z[j] <= i ? 0 : Math.min(j + z[j] - i, z[i - j]);
while (i + k < n && s[k] == s[i + k]) k++;
z[i] = k;
if (j + z[j] < i + z[i]) j = i;
}
z[0] = n;
return z;
}
public static int[] zAlgorithm(final String s) {
return zAlgorithm(s.toCharArray());
}
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_j
*/
public static final class SegTree<S> {
final int MAX;
final int N;
final java.util.function.BinaryOperator<S> op;
final S E;
final S[] data;
@SuppressWarnings("unchecked")
public SegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.E = e;
this.op = op;
this.data = (S[]) new Object[N << 1];
java.util.Arrays.fill(data, E);
}
public SegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e) {
this(dat.length, op, e);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, data, N, l);
for (int i = N - 1; i > 0; i--) {
data[i] = op.apply(data[i << 1 | 0], data[i << 1 | 1]);
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
data[p += N] = x;
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public void set(int p, java.util.function.UnaryOperator<S> f) {
exclusiveRangeCheck(p);
data[p += N] = f.apply(data[p]);
p >>= 1;
while (p > 0) {
data[p] = op.apply(data[p << 1 | 0], data[p << 1 | 1]);
p >>= 1;
}
}
public S get(final int p) {
exclusiveRangeCheck(p);
return data[p + N];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
S sumLeft = E;
S sumRight = E;
l += N;
r += N;
while (l < r) {
if ((l & 1) == 1) sumLeft = op.apply(sumLeft, data[l++]);
if ((r & 1) == 1) sumRight = op.apply(data[--r], sumRight);
l >>= 1;
r >>= 1;
}
return op.apply(sumLeft, sumRight);
}
public S allProd() {
return data[1];
}
public int maxRight(int l, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(l);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!f.test(op.apply(sum, data[l]))) {
while (l < N) {
l = l << 1;
if (f.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - N;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> f) {
inclusiveRangeCheck(r);
if (!f.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!f.test(op.apply(data[r], sum))) {
while (r < N) {
r = r << 1 | 1;
if (f.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for the range [%d, %d].", p, 0, MAX));
}
}
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0;i < N;++ i) {
if (i != 0) sb.append(", ");
sb.append(data[i + N]);
}
sb.append(']');
return sb.toString();
}
}
/**
*
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_k
*/
public static final class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(final int n, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(final S[] dat, final java.util.function.BinaryOperator<S> op, final S e,
final java.util.function.BiFunction<F, S, S> mapping,
final java.util.function.BinaryOperator<F> composition, final F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(final S[] dat) {
final int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(final int k) {
if (Laz[k] == Id) return;
final int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(final int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(final int lk, final int rk) {
for (int i = Log; i > 0; i--) {
if (lk >> i << i != lk) push(lk >> i);
if (rk >> i << i != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(final int lk, final int rk) {
for (int i = 1; i <= Log; i++) {
if (lk >> i << i != lk) {
final int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (rk >> i << i != rk) {
final int rki = rk - 1 >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, final S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N;
r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1;
r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, final F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, final F f) {
if (l > r) { throw new IllegalArgumentException(String.format("Invalid range: [%d, %d)", l, r)); }
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N;
r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1;
r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, final java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) { throw new IllegalArgumentException("Identity element must satisfy the condition."); }
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(final int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d).", p, 0, MAX));
}
}
private void inclusiveRangeCheck(final int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(String.format("Index %d is not in [%d, %d].", p, 0, MAX));
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(final int newIndent) { this.indent = newIndent; }
@Override
public String toString() {
return toString(1, 0);
}
private String toString(final int k, final int sp) {
if (k >= N) return indent(sp) + Dat[k];
String s = "";
s += toString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + Dat[k] + "/" + Laz[k];
s += "\n";
s += toString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
final StringBuilder sb = new StringBuilder();
while (n-- > 0) sb.append(' ');
return sb.toString();
}
}
public static final class MultiSet<T> extends java.util.TreeMap<T, Long> {
private static final long serialVersionUID = 1L;
public MultiSet() {
super();
}
public MultiSet(final java.util.List<T> list) {
super();
for (final T e : list) this.addOne(e);
}
public long count(final Object elm) {
return getOrDefault(elm, 0L);
}
public void add(final T elm, final long amount) {
if (!containsKey(elm)) put(elm, amount);
else replace(elm, get(elm) + amount);
if (this.count(elm) == 0) this.remove(elm);
}
public void addOne(final T elm) {
this.add(elm, 1);
}
public void removeOne(final T elm) {
this.add(elm, -1);
}
public void removeAll(final T elm) {
this.add(elm, -this.count(elm));
}
public static <T> MultiSet<T> merge(final MultiSet<T> a, final MultiSet<T> b) {
final MultiSet<T> c = new MultiSet<>();
for (final T x : a.keySet()) c.add(x, a.count(x));
for (final T y : b.keySet()) c.add(y, b.count(y));
return c;
}
}
}
/**
* 高速な入出力を提供します。
*
* @author 31536000
*
*/
final class FastIO implements AutoCloseable {
private Input in;
private Output out;
private Output err;
private boolean outFlush = false;
private boolean autoOutFlush = true;
public static final java.io.PrintStream DUMMY_OUT = new DummyOut();
public FastIO() {
this(System.in, System.out, System.err);
}
public FastIO(final java.io.InputStream in, final java.io.PrintStream out, final java.io.PrintStream err) {
this.in = in instanceof Input ? (Input) in : new Input(in);
if (out instanceof Output) {
this.out = (Output) out;
} else {
this.out = new Output(out);
this.out.setAutoFlush(false);
}
if (err instanceof Output) {
this.err = (Output) err;
} else {
this.err = new Output(err);
this.err.setAutoFlush(false);
}
}
public static void setFastStandardOutput(final boolean set) {
final java.io.FileOutputStream fdOut = new java.io.FileOutputStream(java.io.FileDescriptor.out);
final java.io.FileOutputStream fdErr = new java.io.FileOutputStream(java.io.FileDescriptor.err);
if (set) {
System.out.flush();
final Output out = new Output(fdOut);
out.setAutoFlush(false);
System.setOut(out);
System.err.flush();
final Output err = new Output(fdErr);
err.setAutoFlush(false);
System.setErr(err);
} else {
System.out.flush();
final java.io.PrintStream out = new java.io.PrintStream(new java.io.BufferedOutputStream(fdOut, 128), true);
System.setOut(out);
System.err.flush();
final java.io.PrintStream err = new java.io.PrintStream(new java.io.BufferedOutputStream(fdErr, 128), true);
System.setErr(err);
}
}
public void setInputStream(final java.io.InputStream in) {
if (this.in == in) return;
this.in.close();
this.in = in instanceof Input ? (Input) in : new Input(in);
}
public void setInputStream(final java.io.File in) {
try {
this.in.close();
final java.io.InputStream input = new java.io.FileInputStream(in);
this.in = new Input(input);
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public Input getInputStream() { return in; }
public void setOutputStream(final java.io.OutputStream out) {
if (this.out == out) {
this.out.flush();
}
final boolean flush = this.out.autoFlush;
this.out.close();
if (out instanceof Output) {
this.out = (Output) out;
this.out.setAutoFlush(flush);
} else {
this.out = new Output(out);
this.out.setAutoFlush(flush);
}
}
public void setOutputStream(final java.io.File out) {
try {
setOutputStream(new java.io.FileOutputStream(out));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setOutputStream(final java.io.FileDescriptor out) {
setOutputStream(new java.io.FileOutputStream(out));
}
public Output getOutputStream() { return out; }
public void setErrorStream(final java.io.OutputStream err) {
if (this.err == err) {
this.err.flush();
}
final boolean flush = this.err.autoFlush;
this.err.close();
if (err instanceof Output) {
this.err = (Output) err;
this.err.setAutoFlush(flush);
} else {
this.err = new Output(err);
this.err.setAutoFlush(flush);
}
}
public void setErrorStream(final java.io.File err) {
try {
setErrorStream(new java.io.FileOutputStream(err));
} catch (final java.io.FileNotFoundException e) {
e.printStackTrace();
}
}
public void setErrorStream(final java.io.FileDescriptor err) {
setErrorStream(new java.io.FileOutputStream(err));
}
public Output getErrorStream() { return err; }
public void setAutoFlush(final boolean flush) {
out.setAutoFlush(flush);
err.setAutoFlush(flush);
}
public void setAutoOutFlush(final boolean flush) { autoOutFlush = flush; }
private void autoFlush() {
if (outFlush) {
outFlush = false;
flush();
}
}
public boolean hasNext() {
autoFlush();
return in.hasNext();
}
public boolean nextBoolean() {
autoFlush();
return in.nextBoolean();
}
public boolean[] nextBoolean(final char T) {
final char[] s = nextChars();
final boolean[] ret = new boolean[s.length];
for (int i = 0; i < ret.length; ++i) ret[i] = s[i] == T;
return ret;
}
public boolean[][] nextBoolean(final char T, final int height) {
final boolean[][] ret = new boolean[height][];
for (int i = 0; i < ret.length; ++i) {
final char[] s = nextChars();
ret[i] = new boolean[s.length];
for (int j = 0; j < ret[i].length; ++j) ret[i][j] = s[j] == T;
}
return ret;
}
public byte nextByte() {
autoFlush();
return in.nextByte();
}
public short nextShort() {
autoFlush();
return in.nextShort();
}
public short[] nextShort(final int width) {
final short[] ret = new short[width];
for (int i = 0; i < width; ++i) ret[i] = nextShort();
return ret;
}
public short[][] nextShort(final int width, final int height) {
final short[][] ret = new short[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextShort();
return ret;
}
public int nextInt() {
autoFlush();
return in.nextInt();
}
public int[] nextInt(final int width) {
final int[] ret = new int[width];
for (int i = 0; i < width; ++i) ret[i] = nextInt();
return ret;
}
public int[][] nextInt(final int width, final int height) {
final int[][] ret = new int[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[i][j] = nextInt();
return ret;
}
public int[] nextInts() {
return nextInts(" ");
}
public int[] nextInts(final String parse) {
final String[] get = nextLine().split(parse);
final int[] ret = new int[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Integer.valueOf(get[i]);
return ret;
}
public long nextLong() {
autoFlush();
return in.nextLong();
}
public long[] nextLong(final int width) {
final long[] ret = new long[width];
for (int i = 0; i < width; ++i) ret[i] = nextLong();
return ret;
}
public long[][] nextLong(final int width, final int height) {
final long[][] ret = new long[height][width];
for (int i = 0, j; i < height; ++i) for (j = 0; j < width; ++j) ret[j][i] = nextLong();
return ret;
}
public long[] nextLongs() {
return nextLongs(" ");
}
public long[] nextLongs(final String parse) {
final String[] get = nextLine().split(parse);
final long[] ret = new long[get.length];
for (int i = 0; i < ret.length; ++i) ret[i] = Long.valueOf(get[i]);
return ret;
}
public float nextFloat() {
autoFlush();
return in.nextFloat();
}
public double nextDouble() {
autoFlush();
return in.nextDouble();
}
public char nextChar() {
autoFlush();
return in.nextChar();
}
public char[] nextChars() {
return next().toCharArray();
}
public char[] nextChars(final char around) {
return (around + next() + around).toCharArray();
}
public char[][] nextChars(final int height) {
final char[][] ret = new char[height][];
for (int i = 0; i < ret.length; ++i) ret[i] = nextChars();
return ret;
}
public char[][] nextChars(final int height, final char around) {
final char[][] ret = new char[height + 2][];
for (int i = 1; i <= height; ++i) ret[i] = nextChars(around);
java.util.Arrays.fill(ret[0] = new char[ret[1].length], around);
java.util.Arrays.fill(ret[ret.length - 1] = new char[ret[0].length], around);
return ret;
}
public String next() {
autoFlush();
return in.next();
}
public String nextLine() {
autoFlush();
return in.nextLine();
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPoint(final int width) {
final Point[] ret = new Point[width];
for (int i = 0; i < width; ++i) ret[i] = nextPoint();
return ret;
}
public boolean print(final boolean b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public byte print(final byte b) {
out.print(b);
outFlush = autoOutFlush;
return b;
}
public short print(final short s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public int print(final int i) {
out.print(i);
outFlush = autoOutFlush;
return i;
}
public long print(final long l) {
out.print(l);
outFlush = autoOutFlush;
return l;
}
public float print(final float f) {
out.print(f);
outFlush = autoOutFlush;
return f;
}
public double print(final double d) {
out.print(d);
outFlush = autoOutFlush;
return d;
}
public double print(final double d, final int length) {
out.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char print(final char c) {
out.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] print(final char[] s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public String print(final String s) {
out.print(s);
outFlush = autoOutFlush;
return s;
}
public Object print(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) print(obj, "\n", " ");
else if (obj instanceof byte[][]) print(obj, "\n", " ");
else if (obj instanceof short[][]) print(obj, "\n", " ");
else if (obj instanceof int[][]) print(obj, "\n", " ");
else if (obj instanceof long[][]) print(obj, "\n", " ");
else if (obj instanceof float[][]) print(obj, "\n", " ");
else if (obj instanceof double[][]) print(obj, "\n", " ");
else if (obj instanceof char[][]) print(obj, "\n", " ");
else if (obj instanceof Object[][]) print(obj, "\n", " ");
else print(obj, " ");
} else {
out.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object print(final Object array, final String... parse) {
print(array, 0, parse);
return array;
}
private Object print(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
print(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
print(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
print(iter.next(), check + 1, parse);
while (iter.hasNext()) {
print(str);
print(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
print(obj[0]);
for (int i = 1; i < obj.length; ++i) {
print(str);
print(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] print(final String parse, final Object... args) {
print(args[0]);
for (int i = 1; i < args.length; ++i) {
print(parse);
print(args[i]);
}
return args;
}
public Object[] printf(final String format, final Object... args) {
out.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] printf(final java.util.Locale l, final String format, final Object... args) {
out.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void println() {
out.println();
outFlush = autoOutFlush;
}
public boolean println(final boolean b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public byte println(final byte b) {
out.println(b);
outFlush = autoOutFlush;
return b;
}
public short println(final short s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public int println(final int i) {
out.println(i);
outFlush = autoOutFlush;
return i;
}
public long println(final long l) {
out.println(l);
outFlush = autoOutFlush;
return l;
}
public float println(final float f) {
out.println(f);
outFlush = autoOutFlush;
return f;
}
public double println(final double d) {
out.println(d);
outFlush = autoOutFlush;
return d;
}
public double println(final double d, final int length) {
out.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char println(final char c) {
out.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] println(final char[] s) {
out.println(s);
outFlush = autoOutFlush;
return s;
}
public String println(final String s) {
out.println(s);
return s;
}
public Object println(final Object obj) {
print(obj);
println();
return obj;
}
public Object println(final Object array, final String... parse) {
print(array, parse);
println();
return array;
}
public boolean debug(final boolean b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public byte debug(final byte b) {
err.print(b);
outFlush = autoOutFlush;
return b;
}
public short debug(final short s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public int debug(final int i) {
err.print(i);
outFlush = autoOutFlush;
return i;
}
public long debug(final long l) {
err.print(l);
outFlush = autoOutFlush;
return l;
}
public float debug(final float f) {
err.print(f);
outFlush = autoOutFlush;
return f;
}
public double debug(final double d) {
err.print(d);
outFlush = autoOutFlush;
return d;
}
public double debug(final double d, final int length) {
err.print(d, length);
outFlush = autoOutFlush;
return d;
}
public char debug(final char c) {
err.print(c);
outFlush = autoOutFlush;
return c;
}
public char[] debug(final char[] s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public String debug(final String s) {
err.print(s);
outFlush = autoOutFlush;
return s;
}
public Object debug(final Object obj) {
if (obj != null && obj.getClass().isArray()) {
if (obj instanceof boolean[][]) debug(obj, "\n", " ");
else if (obj instanceof byte[][]) debug(obj, "\n", " ");
else if (obj instanceof short[][]) debug(obj, "\n", " ");
else if (obj instanceof int[][]) debug(obj, "\n", " ");
else if (obj instanceof long[][]) debug(obj, "\n", " ");
else if (obj instanceof float[][]) debug(obj, "\n", " ");
else if (obj instanceof double[][]) debug(obj, "\n", " ");
else if (obj instanceof char[][]) debug(obj, "\n", " ");
else if (obj instanceof Object[][]) debug(obj, "\n", " ");
else debug(obj, " ");
} else {
err.print(obj);
outFlush = autoOutFlush;
}
return obj;
}
public Object debug(final Object array, final String... parse) {
debug(array, 0, parse);
return array;
}
private Object debug(final Object array, final int check, final String... parse) {
if (check >= parse.length) {
if (array != null && array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
debug(array);
return array;
}
final String str = parse[check];
if (array instanceof Object[]) {
final Object[] obj = (Object[]) array;
if (obj.length == 0) return array;
debug(obj[0], check + 1, parse);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i], check + 1, parse);
}
return array;
}
if (array instanceof java.util.Collection) {
final java.util.Iterator<?> iter = ((java.util.Collection<?>) array).iterator();
if (!iter.hasNext()) return array;
debug(iter.next(), check + 1, parse);
while (iter.hasNext()) {
debug(str);
debug(iter.next(), check + 1, parse);
}
return array;
}
if (!array.getClass().isArray()) throw new IllegalArgumentException("not equal dimension");
if (check != parse.length - 1) throw new IllegalArgumentException("not equal dimension");
if (array instanceof boolean[]) {
final boolean[] obj = (boolean[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof byte[]) {
final byte[] obj = (byte[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
return array;
} else if (array instanceof short[]) {
final short[] obj = (short[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof int[]) {
final int[] obj = (int[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof long[]) {
final long[] obj = (long[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof float[]) {
final float[] obj = (float[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof double[]) {
final double[] obj = (double[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else if (array instanceof char[]) {
final char[] obj = (char[]) array;
if (obj.length == 0) return array;
debug(obj[0]);
for (int i = 1; i < obj.length; ++i) {
debug(str);
debug(obj[i]);
}
} else throw new AssertionError();
return array;
}
public Object[] debug(final String parse, final Object... args) {
debug(args[0]);
for (int i = 1; i < args.length; ++i) {
debug(parse);
debug(args[i]);
}
return args;
}
public Object[] debugf(final String format, final Object... args) {
err.printf(format, args);
outFlush = autoOutFlush;
return args;
}
public Object[] debugf(final java.util.Locale l, final String format, final Object... args) {
err.printf(l, format, args);
outFlush = autoOutFlush;
return args;
}
public void debugln() {
err.println();
outFlush = autoOutFlush;
}
public boolean debugln(final boolean b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public byte debugln(final byte b) {
err.println(b);
outFlush = autoOutFlush;
return b;
}
public short debugln(final short s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public int debugln(final int i) {
err.println(i);
outFlush = autoOutFlush;
return i;
}
public long debugln(final long l) {
err.println(l);
outFlush = autoOutFlush;
return l;
}
public float debugln(final float f) {
err.println(f);
outFlush = autoOutFlush;
return f;
}
public double debugln(final double d) {
err.println(d);
outFlush = autoOutFlush;
return d;
}
public double debugln(final double d, final int length) {
err.println(d, length);
outFlush = autoOutFlush;
return d;
}
public char debugln(final char c) {
err.println(c);
outFlush = autoOutFlush;
return c;
}
public char[] debugln(final char[] s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public String debugln(final String s) {
err.println(s);
outFlush = autoOutFlush;
return s;
}
public Object debugln(final Object obj) {
debug(obj);
debugln();
return obj;
}
public Object debugln(final Object array, final String... parse) {
debug(array, parse);
debugln();
return array;
}
public void flush() {
out.flush();
err.flush();
outFlush = false;
}
@Override
public void close() {
out.close();
err.close();
}
public static final class Input extends java.io.InputStream {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private int length = 0;
public Input(final java.io.InputStream in) {
this.in = in;
}
@Override
public int available() {
try {
return in.available();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return 0;
}
@Override
public void close() {
try {
in.close();
read = length = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public int read() {
if (hasNextByte()) return nextByte();
return 0;
}
private boolean hasNextByte() {
if (read < length) return true;
read = 0;
try {
length = in.read(buffer);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
return length > 0;
}
private static boolean isPrintableChar(final byte c) {
return 32 < c || c < 0;
}
private static boolean isNumber(final byte c) {
return '0' <= c && c <= '9';
}
private boolean readNewLine() {
if (hasNextByte()) {
if (buffer[read] == '\r') {
++read;
if (hasNextByte() && buffer[read] == '\n') ++read;
return true;
}
if (buffer[read] == '\n') {
++read;
return true;
}
}
return false;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return hasNextByte();
}
private byte nextTokenByte() {
while (hasNextByte() && !isPrintableChar(buffer[read])) read++;
return buffer[read++];
}
public boolean nextBoolean() {
return Boolean.valueOf(next());
}
public byte nextByte() {
if (hasNextByte()) return buffer[read++];
throw new java.util.NoSuchElementException();
}
public short nextShort() {
byte b = nextTokenByte();
short n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = (short) (n * 10 + '0' - b);
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = (short) (n * 10 + b - '0'); while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public int nextInt() {
byte b = nextTokenByte();
int n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public long nextLong() {
byte b = nextTokenByte();
long n = 0;
try {
if (b == '-') {
while (isNumber(b = nextByte())) n = n * 10 + '0' - b;
return n;
} else if (!isNumber(b)) throw new NumberFormatException();
do n = n * 10 + b - '0'; while (isNumber(b = nextByte()));
return n;
} catch (final java.util.NoSuchElementException e) {
return n;
}
}
public float nextFloat() {
return Float.parseFloat(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
final byte b = nextByte();
if ((b & 0x80) == 0) return (char) b;
if ((b & 0x20) == 0) return (char) ((b & 0x1F) << 6 | nextByte() & 0x3F);
return (char) ((b & 0xF) << 12 | (nextByte() & 0x3F) << 6 | nextByte() & 0x3F);
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
final StringBuilder sb = new StringBuilder();
do sb.append(nextChar()); while (hasNextByte() && isPrintableChar(buffer[read]));
return sb.toString();
}
public String nextLine() {
final StringBuilder sb = new StringBuilder();
while (!readNewLine()) sb.append(nextChar());
return sb.toString();
}
}
public static final class Output extends java.io.PrintStream {
private final byte[] buffer = new byte[1 << 13];
private int read = 0;
private boolean autoFlush = true;
public Output(final java.io.OutputStream out) {
super(out);
}
public void setAutoFlush(final boolean autoFlush) { this.autoFlush = autoFlush; }
@Override
public void close() {
if (out == System.out || out == System.err || this == System.out || this == System.err) {
flush();
return;
}
try {
flush();
out.close();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void flush() {
try {
write();
out.flush();
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
@Override
public void write(final byte[] b) {
if (b.length < buffer.length) {
ensureBuffer(b.length);
System.arraycopy(b, 0, buffer, read, b.length);
read += b.length;
} else {
write();
try {
out.write(b);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final byte[] b, final int off, final int len) {
if (len < buffer.length) {
ensureBuffer(len);
System.arraycopy(b, off, buffer, read, len);
read += len;
} else {
write();
try {
out.write(b, off, len);
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
}
@Override
public void write(final int b) {
print((byte) b);
}
private void write() {
try {
out.write(buffer, 0, read);
read = 0;
} catch (final java.io.IOException e) {
e.printStackTrace();
}
}
private void ensureBuffer(final int size) {
if (read + size > buffer.length) {
write();
}
}
@Override
public void print(final boolean b) {
if (b) {
ensureBuffer(4);
buffer[read++] = 't';
buffer[read++] = 'r';
buffer[read++] = 'u';
buffer[read++] = 'e';
} else {
ensureBuffer(5);
buffer[read++] = 'f';
buffer[read++] = 'a';
buffer[read++] = 'l';
buffer[read++] = 's';
buffer[read++] = 'e';
}
}
public void print(final byte b) {
ensureBuffer(1);
buffer[read++] = b;
}
private static int digit(final short s) {
return s >= 100 ? s >= 1000 ? s >= 10000 ? 5 : 4 : 3 : s >= 10 ? 2 : 1;
}
public void print(short s) {
ensureBuffer(6);
if (s < 0) {
if (s == -32768) {
buffer[read++] = '-';
buffer[read++] = '3';
buffer[read++] = '2';
buffer[read++] = '7';
buffer[read++] = '6';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
s = (short) -s;
}
final int digit = digit(s);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (s % 10 + '0');
s /= 10;
}
read += digit;
}
private static int digit(final int i) {
if (i >= 1000000000) return 10;
if (i >= 100000000) return 9;
if (i >= 10000000) return 8;
if (i >= 1000000) return 7;
if (i >= 100000) return 6;
if (i >= 10000) return 5;
if (i >= 1000) return 4;
if (i >= 100) return 3;
if (i >= 10) return 2;
return 1;
}
@Override
public void print(int i) {
ensureBuffer(11);
if (i < 0) {
if (i == -2147483648) {
buffer[read++] = '-';
buffer[read++] = '2';
buffer[read++] = '1';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '4';
buffer[read++] = '8';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '4';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
i = -i;
}
final int digit = digit(i);
int j = read + digit;
while (j-- > read) {
buffer[j] = (byte) (i % 10 + '0');
i /= 10;
}
read += digit;
}
private static int digit(final long l) {
if (l >= 1000000000000000000L) return 19;
if (l >= 100000000000000000L) return 18;
if (l >= 10000000000000000L) return 17;
if (l >= 1000000000000000L) return 16;
if (l >= 100000000000000L) return 15;
if (l >= 10000000000000L) return 14;
if (l >= 1000000000000L) return 13;
if (l >= 100000000000L) return 12;
if (l >= 10000000000L) return 11;
if (l >= 1000000000L) return 10;
if (l >= 100000000L) return 9;
if (l >= 10000000L) return 8;
if (l >= 1000000L) return 7;
if (l >= 100000L) return 6;
if (l >= 10000L) return 5;
if (l >= 1000L) return 4;
if (l >= 100L) return 3;
if (l >= 10L) return 2;
return 1;
}
@Override
public void print(long l) {
ensureBuffer(20);
if (l < 0) {
if (l == -9223372036854775808L) {
buffer[read++] = '-';
buffer[read++] = '9';
buffer[read++] = '2';
buffer[read++] = '2';
buffer[read++] = '3';
buffer[read++] = '3';
buffer[read++] = '7';
buffer[read++] = '2';
buffer[read++] = '0';
buffer[read++] = '3';
buffer[read++] = '6';
buffer[read++] = '8';
buffer[read++] = '5';
buffer[read++] = '4';
buffer[read++] = '7';
buffer[read++] = '7';
buffer[read++] = '5';
buffer[read++] = '8';
buffer[read++] = '0';
buffer[read++] = '8';
return;
}
buffer[read++] = '-';
l = -l;
}
final int digit = digit(l);
int i = read + digit;
while (i-- > read) {
buffer[i] = (byte) (l % 10 + '0');
l /= 10;
}
read += digit;
}
@Override
public void print(final float f) {
print(Float.toString(f));
}
@Override
public void print(final double d) {
print(Double.toString(d));
}
public void print(double d, final int n) {
if (d < 0) {
ensureBuffer(1);
buffer[read++] = '-';
d = -d;
}
d += Math.pow(10, -n) / 2;
final long l = (long) d;
print(l);
ensureBuffer(n + 1);
buffer[read++] = '.';
d -= l;
for (int i = 0; i < n; i++) {
d *= 10;
final int in = (int) d;
buffer[read++] = (byte) (in + '0');
d -= in;
}
}
@Override
public void print(final char c) {
if (c < 0x80) {
ensureBuffer(1);
buffer[read++] = (byte) c;
} else if (c < 0x07FF) {
ensureBuffer(2);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
} else {
ensureBuffer(3);
buffer[read++] = (byte) (c >> 12 & 0xF | 0xE0);
buffer[read++] = (byte) (c >> 6 & 0x3F | 0x80);
buffer[read++] = (byte) (c & 0x3F | 0x80);
}
}
@Override
public void print(final char[] s) {
for (final char i : s) print(i);
}
@Override
public void print(final String s) {
print(s.toCharArray());
}
@Override
public void print(final Object o) {
print(o.toString());
}
@Override
public Output printf(final java.util.Locale l, final String format, final Object... args) {
print(String.format(l, format, args));
return this;
}
@Override
public Output printf(final String format, final Object... args) {
print(String.format(format, args));
return this;
}
@Override
public void println() {
ensureBuffer(1);
buffer[read++] = '\n';
if (autoFlush) flush();
}
@Override
public void println(final boolean b) {
print(b);
println();
}
public void println(final byte b) {
print(b);
println();
}
public void println(final short s) {
print(s);
println();
}
@Override
public void println(final int i) {
print(i);
println();
}
@Override
public void println(final long l) {
print(l);
println();
}
@Override
public void println(final float f) {
print(f);
println();
}
@Override
public void println(final double d) {
print(d);
println();
}
public void println(final double d, final int n) {
print(d, n);
println();
}
@Override
public void println(final char c) {
print(c);
println();
}
@Override
public void println(final char[] s) {
print(s);
println();
}
@Override
public void println(final String s) {
print(s);
println();
}
@Override
public void println(final Object o) {
print(o);
println();
}
@Override
public Output append(final char c) {
print(c);
return this;
}
@Override
public Output append(CharSequence csq) {
if (csq == null) csq = "null";
print(csq.toString());
return this;
}
@Override
public Output append(CharSequence csq, final int start, final int end) {
if (csq == null) csq = "null";
print(csq.subSequence(start, end).toString());
return this;
}
}
public static final class DummyOut extends java.io.PrintStream {
public DummyOut() {
super(new Dummy());
}
private static class Dummy extends java.io.OutputStream {
@Override
public void close() {
}
@Override
public void flush() {
}
@Override
public void write(final byte[] b) {
}
@Override
public void write(final byte[] b, final int off, final int len) {
}
@Override
public void write(final int b) {
}
}
}
}
| ConDefects/ConDefects/Code/arc162_b/Java/42722502 |
condefects-java_data_1274 |
import java.io.*;
import java.util.*;
public class Main {
public void solve() throws Exception {
int n = nextInt();
int[] p = new int[n+1];
for (int i = 0; i < n; i++) {
p[i+1]=nextInt();
}
int r=0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if (p[i+1]>p[j+1])r++;
}
}
if (r%2==1){
out.println("No");
return;
}
List<int[]> res=new ArrayList<>();
for (int i = 1; i <= n; i++) {
int idx=0;
for (int j = i; j <= n; j++) {
if (p[j]==i) {
idx=j;
break;
}
}
if (idx==i) continue;
if (idx==n) {
res.add(new int[]{n-1,n-2});
int t=p[n-2];
p[n-2]=p[n-1];
p[n-1]=p[n];
p[n]=t;
idx=n-1;
}
res.add(new int[]{idx,i-1});
int t1=p[idx],t2=p[idx+1];
for (int j = idx+1; j >= i+2; j--) {
p[j]=p[j-2];
}
p[i]=t1;
p[i+1]=t2;
}
if (res.size()>2000) {
throw new RuntimeException();
}
for (int i = 1; i <= n; i++) {
if (i!=p[i]) throw new RuntimeException();
}
out.println("Yes");
out.println(res.size());
for (int[] re : res) {
out.println(re[0]+" "+re[1]);
}
}
public static void main(String[] args) throws Exception {
// int t=nextInt();
// for (int i = 0; i < t; i++) {
new Main().solve();
// }
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
import java.io.*;
import java.util.*;
public class Main {
public void solve() throws Exception {
int n = nextInt();
int[] p = new int[n+1];
for (int i = 0; i < n; i++) {
p[i+1]=nextInt();
}
int r=0;
for (int i = 0; i < n; i++) {
for (int j = i+1; j < n; j++) {
if (p[i+1]>p[j+1])r++;
}
}
if (r%2==1){
out.println("No");
return;
}
List<int[]> res=new ArrayList<>();
for (int i = 1; i <= n; i++) {
int idx=0;
for (int j = i; j <= n; j++) {
if (p[j]==i) {
idx=j;
break;
}
}
if (idx==i) continue;
if (idx==n) {
res.add(new int[]{n-1,n-3});
int t=p[n-2];
p[n-2]=p[n-1];
p[n-1]=p[n];
p[n]=t;
idx=n-1;
}
res.add(new int[]{idx,i-1});
int t1=p[idx],t2=p[idx+1];
for (int j = idx+1; j >= i+2; j--) {
p[j]=p[j-2];
}
p[i]=t1;
p[i+1]=t2;
}
if (res.size()>2000) {
throw new RuntimeException();
}
for (int i = 1; i <= n; i++) {
if (i!=p[i]) throw new RuntimeException();
}
out.println("Yes");
out.println(res.size());
for (int[] re : res) {
out.println(re[0]+" "+re[1]);
}
}
public static void main(String[] args) throws Exception {
// int t=nextInt();
// for (int i = 0; i < t; i++) {
new Main().solve();
// }
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
| ConDefects/ConDefects/Code/arc162_b/Java/42723640 |
condefects-java_data_1275 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[] a=new int[4];
int x;
int count=0;
for(int i=0;i<n;i++){
x=scanner.nextInt();
for(int j=0;j<4;j++){
if(a[j]!=0){
a[j]+=x;
if(x>3){
count++;
a[j]=0;
}
}
}
if(x>3){
count++;
}else{
a[i%4]=x;
}
}
System.out.println(count);
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[] a=new int[4];
int x;
int count=0;
for(int i=0;i<n;i++){
x=scanner.nextInt();
for(int j=0;j<4;j++){
if(a[j]!=0){
a[j]+=x;
if(a[j]>3){
count++;
a[j]=0;
}
}
}
if(x>3){
count++;
}else{
a[i%4]=x;
}
}
System.out.println(count);
}
} | ConDefects/ConDefects/Code/abc256_b/Java/41622328 |
condefects-java_data_1276 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for(int i = 0;i<n;i++) {
a[i] = sc.nextInt();
}
int ans = n;
int total = 0;
for(int i = n-1;i>0;i--) {
total +=a[i];
if(total>=4)break;
ans--;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] a = new int[n];
for(int i = 0;i<n;i++) {
a[i] = sc.nextInt();
}
int ans = n;
int total = 0;
for(int i = n-1;i>=0;i--) {
total +=a[i];
if(total>=4)break;
ans--;
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc256_b/Java/37040464 |
condefects-java_data_1277 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int[][] E = in.idx(N -1,2);
long[] C = in.lg(N);
ReRootingDp<Long, long[], Long> dp = new ReRootingDp<>(N){
@Override
protected long[] e(){ return new long[]{0, 0}; }
@Override
protected long[] agg(long[] a,long[] b){ return new long[]{a[0] +b[0], a[1] +b[1]}; }
@Override
protected long[] adj(long[] v,Edge<Long> e){ return new long[]{v[0] +C[e.v], v[0] +C[e.v] +v[1]}; }
@Override
protected Long ans(int u,long[] sum){
long ret = 0;
for (var d:sur(u))
ret += d[1];
return ret;
}
};
for (var e:E)
dp.addEdge(e[0],e[1]);
long ans = infL;
Long[] calc = dp.calc();
for (int i = 0;i < N;i++)
ans = min(ans,calc[i]);
return ans;
}
}
abstract class ReRootingDp<L, D, A> extends Graph<L>{
private D[] dp;
private A[] ans;
public ReRootingDp(int N){
super(N,false);
dp = Util.cast(new Object[2 *N]);
ans = Util.cast(Array.newInstance(ans(0,e()).getClass(),n));
}
protected abstract D e();
protected abstract D agg(D a,D b);
protected abstract D adj(D v,Edge<L> e);
protected abstract A ans(int u,D sum);
protected MyList<D> sur(int u){ return go(u).map(e -> dp[e.id]); }
public A[] calc(){
for (var e:es)
e.re.id = e.id +n;
var stk = new MyStack<Edge<L>>();
var se = new Edge<L>(n -1,-1,0,null);
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
if (dp[e.id] == null) {
dp[e.id] = e();
for (var ee:go(e.v))
if (ee != e.re) {
stk.add(ee);
stk.add(ee);
}
} else {
for (var ee:go(e.v))
if (ee != e.re)
dp[e.id] = agg(dp[e.id],dp[ee.id]);
if (e.u > -1)
dp[e.id] = adj(dp[e.id],e);
}
}
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
var es = go(e.v);
int n = es.size();
D[] pre = Util.cast(new Object[n +1]),suf = Util.cast(new Object[n +1]);
pre[0] = e();
suf[n] = e();
for (int i = 0;i < n;i++) {
pre[i +1] = agg(pre[i],dp[es.get(i).id]);
suf[n -1 -i] = agg(dp[es.get(n -1 -i).id],suf[n -i]);
}
ans[e.v] = ans(e.v,suf[0]);
for (int i = 0;i < n;i++) {
Edge<L> ee = es.get(i);
if (ee != e.re) {
dp[ee.re.id] = adj(agg(pre[i],suf[i +1]),ee.re);
stk.add(ee);
}
}
}
return ans;
}
}
class Edge<L> {
public int id,u,v;
public L val;
public Edge<L> re;
public Edge(int id,int u,int v,L val){
this.id = id;
this.u = u;
this.v = v;
this.val = val;
}
}
class Graph<L> {
public int n;
public MyList<Edge<L>> es;
private MyList<Edge<L>>[] go,bk;
public Graph(int n,boolean dir){
this.n = n;
go = Util.cast(new MyList[n]);
bk = dir ? Util.cast(new MyList[n]) : go;
for (int i = 0;i < n;i++) {
go[i] = new MyList<>();
bk[i] = new MyList<>();
}
es = new MyList<>();
}
protected L inv(L l){ return l; }
public void addEdge(int u,int v){ addEdge(u,v,null); }
public void addEdge(int u,int v,L l){
var e = new Edge<>(es.size(),u,v,l);
var re = new Edge<>(e.id,e.v,e.u,inv(e.val));
es.add(e);
go[u].add(re.re = e);
bk[v].add(e.re = re);
}
public MyList<Edge<L>> go(int u){ return go[u]; }
public MyList<Edge<L>> bk(int u){ return bk[u]; }
}
class UnionFind{
int num;
protected int[] dat;
protected int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
public int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
public boolean same(int u,int v){ return root(u) == root(v); }
public boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
public int size(int x){ return -dat[root(x)]; }
public int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
abstract class AVLSegmentTree<V extends BaseV, F> {
private V e = e(),t = e();
private Node root;
public AVLSegmentTree(int n){ root = new Node(e(),n); }
public AVLSegmentTree(){}
public void build(int n,IntFunction<V> init){ root = build(0,n,init); }
private Node build(int i,int n,IntFunction<V> init){
if (n < 2)
return n < 1 ? null : new Node(init.apply(i),1);
var ret = new Node(e(),n);
ret.cld(-1,build(i,n /2,init));
ret.cld(1,build(i +n /2,n -n /2,init));
return ret.merge();
}
public void add(V v){ add(v,1); }
public void add(V v,int k){ ins(size(),v,k); }
public void ins(int i,V v){ ins(i,v,1); }
public void ins(int i,V v,int k){ root = root == null ? new Node(v,k) : ins(root,i,v,k); }
private Node ins(Node nd,int i,V v,int k){
if (nd.lft == null && (i == 0 || i == nd.sz)) {
split(nd,i == 0 ? 1 : -1,v,k,nd.sz +k);
return nd.merge();
}
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else
nd.push();
if (i < nd.lft.sz)
nd.cld(-1,ins(nd.lft,i,v,k));
else
nd.cld(1,ins(nd.rht,i -nd.lft.sz,v,k));
return balance(nd);
}
public V del(int i){
var ret = e();
root = del(ret,root,i);
return ret;
}
private Node del(V ret,Node nd,int i){
if (nd.lft == null) {
nd.sz--;
ag(ret,e,nd.val);
return 0 < nd.sz ? nd : null;
}
nd.push();
int c = i < nd.lft.sz ? -1 : 1;
Node del = c < 0 ? del(ret,nd.lft,i) : del(ret,nd.rht,i -nd.lft.sz);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public void upd(int i,F f){ upd(i,i +1,f); }
public void upd(int l,int r,F f){
if (l == r)
return;
if (size() < r)
add(e(),r -size());
root = upd(root,l,r,f);
}
private Node upd(Node nd,int l,int r,F f){
if (l == 0 && r == nd.sz)
return nd.prop(f);
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),0 < l ? l : r,nd.sz);
else
nd.push();
if (l < nd.lft.sz)
nd.cld(-1,upd(nd.lft,l,min(nd.lft.sz,r),f));
if (nd.lft.sz < r)
nd.cld(1,upd(nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz,f));
return balance(nd);
}
public void toggle(int l,int r){ root = l < r ? toggle(root,l,r) : root; }
private Node toggle(Node nd,int l,int r){
nd.push();
if (0 < l) {
split(nd,l);
return merge(nd.lft,nd,toggle(nd.rht,0,r -l));
}
if (r < nd.sz) {
split(nd,r);
return merge(toggle(nd.lft,l,r),nd,nd.rht);
}
return nd.toggle();
}
private void split(Node nd,int i){
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else {
nd.push();
if (i < nd.lft.sz) {
split(nd.lft,i);
var lft = nd.lft;
nd.cld(-1,lft.lft);
nd.cld(1,merge(lft.rht,lft,nd.rht));
} else if (nd.lft.sz < i) {
split(nd.rht,i -nd.lft.sz);
var rht = nd.rht;
nd.cld(1,rht.rht);
nd.cld(-1,merge(nd.lft,rht,rht.lft));
}
}
}
private Node merge(Node lft,Node nd,Node rht){
if (abs(lft.rnk -rht.rnk) < 2) {
nd.cld(-1,lft);
nd.cld(1,rht);
} else if (lft.rnk > rht.rnk) {
lft.push().cld(1,merge(lft.rht,nd,rht));
nd = lft;
} else if (lft.rnk < rht.rnk) {
rht.push().cld(-1,merge(lft,nd,rht.lft));
nd = rht;
}
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.lft == null)
ag(ret,ret,pw(nd.val,r -l));
else {
nd.push();
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
protected abstract void tog(V v);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
for (ag(t,e,a);0 < n;n >>= 1,ag(t,t,t))
if (0 < (n &1))
ag(v,v,t);
}
private V pw(V a,int n){
V ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private void split(Node nd,int c,V vl,int i,int sz){
nd.cld(-c,new Node(vl,i));
nd.cld(c,new Node(nd.val,sz -i));
nd.val = e();
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis).push();
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int sz,bis,rnk,tog;
private V val;
private F laz;
private Node lft,rht;
private Node(V val,int sz){
this.sz = sz;
this.val = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
sz = val.sz;
return this;
}
private Node push(){
if (laz != null) {
lft.prop(laz);
rht.prop(laz);
laz = null;
}
if (0 < tog) {
lft.toggle();
rht.toggle();
tog = 0;
}
return this;
}
private Node prop(F f){
map(val,f);
if (lft != null)
laz = laz == null ? f : comp(laz,f);
return this;
}
private Node toggle(){
bis *= -1;
var tn = lft;
lft = rht;
rht = tn;
tog(val);
if (lft != null)
tog ^= 1;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return lft == null && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class SparseTable2D{
int h,w,hl,wl;
long[][][][] tbl;
SparseTable2D(int h,int w){
hl = max(1,32 -Integer.numberOfLeadingZeros((this.h = h) -1));
wl = max(1,32 -Integer.numberOfLeadingZeros((this.w = w) -1));
tbl = new long[hl][wl][][];
for (int hi = 0;hi < hl;hi++)
for (int wi = 0;wi < wl;wi++) {
int hhl = h -(1 <<hi) +1;
int wwl = w -(1 <<wi) +1;
tbl[hi][wi] = new long[hhl][wwl];
for (int i = 0;i < hhl;i++)
for (int j = 0;j < wwl;j++)
if ((hi |wi) == 0)
tbl[0][0][i][j] = init(i,j);
else if (0 < hi)
tbl[hi][wi][i][j] = agg(tbl[hi -1][wi][i][j],tbl[hi -1][wi][i +(1 <<hi -1)][j]);
else
tbl[hi][wi][i][j] = agg(tbl[hi][wi -1][i][j],tbl[hi][wi -1][i][j +(1 <<wi -1)]);
}
}
abstract protected long init(int i,int j);
abstract protected long agg(long a,long b);
long get(int i0,int j0,int i1,int j1){
int il = max(0,31 -Integer.numberOfLeadingZeros(i1 -i0 -1));
int jl = max(0,31 -Integer.numberOfLeadingZeros(j1 -j0 -1));
i1 = max(0,i1 -(1 <<il));
j1 = max(0,j1 -(1 <<jl));
long[][] tmp = tbl[il][jl];
long ret = agg(tmp[i0][j0],tmp[i0][j1]);
ret = agg(ret,tmp[i1][j0]);
ret = agg(ret,tmp[i1][j1]);
return ret;
}
}
abstract class SparseTable{
int n;
long[] tbl;
SparseTable(int n){
int K = max(1,32 -Integer.numberOfLeadingZeros(n -1));
this.n = 1 <<K;
tbl = new long[K *this.n];
for (int i = 0;i < this.n;i++)
tbl[i] = i < n ? init(i) : 0;
for (int k = 1;k < K;k++)
for (int s = 1 <<k;s < this.n;s += 2 <<k) {
int b = k *this.n;
tbl[b +s] = s < n ? init(s) : 0;
tbl[b +s -1] = s < n ? init(s -1) : 0;
for (int i = 1;i < 1 <<k;i++) {
tbl[b +s +i] = agg(tbl[b +s +i -1],tbl[s +i]);
tbl[b +s -1 -i] = agg(tbl[b +s -i],tbl[s -1 -i]);
}
}
}
abstract protected long init(int i);
abstract protected long agg(long a,long b);
long get(int l,int r){
r--;
if (l == r)
return tbl[l];
int k = 31 -Integer.numberOfLeadingZeros(l ^r);
return agg(tbl[k *n +l],tbl[k *n +r]);
}
}
abstract class Sum2D{
private long[] sum;
private int w;
public Sum2D(int h,int w){
this.w = w;
sum = new long[(h +1) *(w +1)];
for (int i = 0;i < h;i++)
for (int j = 0;j < w;j++)
sum[top(i +1,j +1)] = a(i,j) +sum[top(i +1,j)] +sum[top(i,j +1)] -sum[top(i,j)];
}
abstract long a(int i,int j);
private int top(int i,int j){ return i *(w +1) +j; }
long get(int il,int ir,int jl,int jr){ return sum[top(ir,jr)] -sum[top(il,jr)] -sum[top(ir,jl)] +sum[top(il,jl)]; }
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[n]); }
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){ return copyOf(arr,sz); }
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long inv(long x){ return pow(x,mod -2); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
public long lcm(long a,long b){ return b /gcd(a,b) *a; }
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
public int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int[][] E = in.idx(N -1,2);
long[] C = in.lg(N);
ReRootingDp<Long, long[], Long> dp = new ReRootingDp<>(N){
@Override
protected long[] e(){ return new long[]{0, 0}; }
@Override
protected long[] agg(long[] a,long[] b){ return new long[]{a[0] +b[0], a[1] +b[1]}; }
@Override
protected long[] adj(long[] v,Edge<Long> e){ return new long[]{v[0] +C[e.v], v[0] +C[e.v] +v[1]}; }
@Override
protected Long ans(int u,long[] sum){
long ret = 0;
for (var d:sur(u))
ret += d[1];
return ret;
}
};
for (var e:E)
dp.addEdge(e[0],e[1]);
long ans = Long.MAX_VALUE;
Long[] calc = dp.calc();
for (int i = 0;i < N;i++)
ans = min(ans,calc[i]);
return ans;
}
}
abstract class ReRootingDp<L, D, A> extends Graph<L>{
private D[] dp;
private A[] ans;
public ReRootingDp(int N){
super(N,false);
dp = Util.cast(new Object[2 *N]);
ans = Util.cast(Array.newInstance(ans(0,e()).getClass(),n));
}
protected abstract D e();
protected abstract D agg(D a,D b);
protected abstract D adj(D v,Edge<L> e);
protected abstract A ans(int u,D sum);
protected MyList<D> sur(int u){ return go(u).map(e -> dp[e.id]); }
public A[] calc(){
for (var e:es)
e.re.id = e.id +n;
var stk = new MyStack<Edge<L>>();
var se = new Edge<L>(n -1,-1,0,null);
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
if (dp[e.id] == null) {
dp[e.id] = e();
for (var ee:go(e.v))
if (ee != e.re) {
stk.add(ee);
stk.add(ee);
}
} else {
for (var ee:go(e.v))
if (ee != e.re)
dp[e.id] = agg(dp[e.id],dp[ee.id]);
if (e.u > -1)
dp[e.id] = adj(dp[e.id],e);
}
}
stk.add(se);
while (!stk.isEmpty()) {
var e = stk.pop();
var es = go(e.v);
int n = es.size();
D[] pre = Util.cast(new Object[n +1]),suf = Util.cast(new Object[n +1]);
pre[0] = e();
suf[n] = e();
for (int i = 0;i < n;i++) {
pre[i +1] = agg(pre[i],dp[es.get(i).id]);
suf[n -1 -i] = agg(dp[es.get(n -1 -i).id],suf[n -i]);
}
ans[e.v] = ans(e.v,suf[0]);
for (int i = 0;i < n;i++) {
Edge<L> ee = es.get(i);
if (ee != e.re) {
dp[ee.re.id] = adj(agg(pre[i],suf[i +1]),ee.re);
stk.add(ee);
}
}
}
return ans;
}
}
class Edge<L> {
public int id,u,v;
public L val;
public Edge<L> re;
public Edge(int id,int u,int v,L val){
this.id = id;
this.u = u;
this.v = v;
this.val = val;
}
}
class Graph<L> {
public int n;
public MyList<Edge<L>> es;
private MyList<Edge<L>>[] go,bk;
public Graph(int n,boolean dir){
this.n = n;
go = Util.cast(new MyList[n]);
bk = dir ? Util.cast(new MyList[n]) : go;
for (int i = 0;i < n;i++) {
go[i] = new MyList<>();
bk[i] = new MyList<>();
}
es = new MyList<>();
}
protected L inv(L l){ return l; }
public void addEdge(int u,int v){ addEdge(u,v,null); }
public void addEdge(int u,int v,L l){
var e = new Edge<>(es.size(),u,v,l);
var re = new Edge<>(e.id,e.v,e.u,inv(e.val));
es.add(e);
go[u].add(re.re = e);
bk[v].add(e.re = re);
}
public MyList<Edge<L>> go(int u){ return go[u]; }
public MyList<Edge<L>> bk(int u){ return bk[u]; }
}
class UnionFind{
int num;
protected int[] dat;
protected int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
public int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
public boolean same(int u,int v){ return root(u) == root(v); }
public boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
public int size(int x){ return -dat[root(x)]; }
public int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
abstract class AVLSegmentTree<V extends BaseV, F> {
private V e = e(),t = e();
private Node root;
public AVLSegmentTree(int n){ root = new Node(e(),n); }
public AVLSegmentTree(){}
public void build(int n,IntFunction<V> init){ root = build(0,n,init); }
private Node build(int i,int n,IntFunction<V> init){
if (n < 2)
return n < 1 ? null : new Node(init.apply(i),1);
var ret = new Node(e(),n);
ret.cld(-1,build(i,n /2,init));
ret.cld(1,build(i +n /2,n -n /2,init));
return ret.merge();
}
public void add(V v){ add(v,1); }
public void add(V v,int k){ ins(size(),v,k); }
public void ins(int i,V v){ ins(i,v,1); }
public void ins(int i,V v,int k){ root = root == null ? new Node(v,k) : ins(root,i,v,k); }
private Node ins(Node nd,int i,V v,int k){
if (nd.lft == null && (i == 0 || i == nd.sz)) {
split(nd,i == 0 ? 1 : -1,v,k,nd.sz +k);
return nd.merge();
}
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else
nd.push();
if (i < nd.lft.sz)
nd.cld(-1,ins(nd.lft,i,v,k));
else
nd.cld(1,ins(nd.rht,i -nd.lft.sz,v,k));
return balance(nd);
}
public V del(int i){
var ret = e();
root = del(ret,root,i);
return ret;
}
private Node del(V ret,Node nd,int i){
if (nd.lft == null) {
nd.sz--;
ag(ret,e,nd.val);
return 0 < nd.sz ? nd : null;
}
nd.push();
int c = i < nd.lft.sz ? -1 : 1;
Node del = c < 0 ? del(ret,nd.lft,i) : del(ret,nd.rht,i -nd.lft.sz);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public void upd(int i,F f){ upd(i,i +1,f); }
public void upd(int l,int r,F f){
if (l == r)
return;
if (size() < r)
add(e(),r -size());
root = upd(root,l,r,f);
}
private Node upd(Node nd,int l,int r,F f){
if (l == 0 && r == nd.sz)
return nd.prop(f);
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),0 < l ? l : r,nd.sz);
else
nd.push();
if (l < nd.lft.sz)
nd.cld(-1,upd(nd.lft,l,min(nd.lft.sz,r),f));
if (nd.lft.sz < r)
nd.cld(1,upd(nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz,f));
return balance(nd);
}
public void toggle(int l,int r){ root = l < r ? toggle(root,l,r) : root; }
private Node toggle(Node nd,int l,int r){
nd.push();
if (0 < l) {
split(nd,l);
return merge(nd.lft,nd,toggle(nd.rht,0,r -l));
}
if (r < nd.sz) {
split(nd,r);
return merge(toggle(nd.lft,l,r),nd,nd.rht);
}
return nd.toggle();
}
private void split(Node nd,int i){
if (nd.lft == null)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else {
nd.push();
if (i < nd.lft.sz) {
split(nd.lft,i);
var lft = nd.lft;
nd.cld(-1,lft.lft);
nd.cld(1,merge(lft.rht,lft,nd.rht));
} else if (nd.lft.sz < i) {
split(nd.rht,i -nd.lft.sz);
var rht = nd.rht;
nd.cld(1,rht.rht);
nd.cld(-1,merge(nd.lft,rht,rht.lft));
}
}
}
private Node merge(Node lft,Node nd,Node rht){
if (abs(lft.rnk -rht.rnk) < 2) {
nd.cld(-1,lft);
nd.cld(1,rht);
} else if (lft.rnk > rht.rnk) {
lft.push().cld(1,merge(lft.rht,nd,rht));
nd = lft;
} else if (lft.rnk < rht.rnk) {
rht.push().cld(-1,merge(lft,nd,rht.lft));
nd = rht;
}
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.lft == null)
ag(ret,ret,pw(nd.val,r -l));
else {
nd.push();
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
protected abstract void tog(V v);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
for (ag(t,e,a);0 < n;n >>= 1,ag(t,t,t))
if (0 < (n &1))
ag(v,v,t);
}
private V pw(V a,int n){
V ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private void split(Node nd,int c,V vl,int i,int sz){
nd.cld(-c,new Node(vl,i));
nd.cld(c,new Node(nd.val,sz -i));
nd.val = e();
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis).push();
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int sz,bis,rnk,tog;
private V val;
private F laz;
private Node lft,rht;
private Node(V val,int sz){
this.sz = sz;
this.val = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
sz = val.sz;
return this;
}
private Node push(){
if (laz != null) {
lft.prop(laz);
rht.prop(laz);
laz = null;
}
if (0 < tog) {
lft.toggle();
rht.toggle();
tog = 0;
}
return this;
}
private Node prop(F f){
map(val,f);
if (lft != null)
laz = laz == null ? f : comp(laz,f);
return this;
}
private Node toggle(){
bis *= -1;
var tn = lft;
lft = rht;
rht = tn;
tog(val);
if (lft != null)
tog ^= 1;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return lft == null && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class SparseTable2D{
int h,w,hl,wl;
long[][][][] tbl;
SparseTable2D(int h,int w){
hl = max(1,32 -Integer.numberOfLeadingZeros((this.h = h) -1));
wl = max(1,32 -Integer.numberOfLeadingZeros((this.w = w) -1));
tbl = new long[hl][wl][][];
for (int hi = 0;hi < hl;hi++)
for (int wi = 0;wi < wl;wi++) {
int hhl = h -(1 <<hi) +1;
int wwl = w -(1 <<wi) +1;
tbl[hi][wi] = new long[hhl][wwl];
for (int i = 0;i < hhl;i++)
for (int j = 0;j < wwl;j++)
if ((hi |wi) == 0)
tbl[0][0][i][j] = init(i,j);
else if (0 < hi)
tbl[hi][wi][i][j] = agg(tbl[hi -1][wi][i][j],tbl[hi -1][wi][i +(1 <<hi -1)][j]);
else
tbl[hi][wi][i][j] = agg(tbl[hi][wi -1][i][j],tbl[hi][wi -1][i][j +(1 <<wi -1)]);
}
}
abstract protected long init(int i,int j);
abstract protected long agg(long a,long b);
long get(int i0,int j0,int i1,int j1){
int il = max(0,31 -Integer.numberOfLeadingZeros(i1 -i0 -1));
int jl = max(0,31 -Integer.numberOfLeadingZeros(j1 -j0 -1));
i1 = max(0,i1 -(1 <<il));
j1 = max(0,j1 -(1 <<jl));
long[][] tmp = tbl[il][jl];
long ret = agg(tmp[i0][j0],tmp[i0][j1]);
ret = agg(ret,tmp[i1][j0]);
ret = agg(ret,tmp[i1][j1]);
return ret;
}
}
abstract class SparseTable{
int n;
long[] tbl;
SparseTable(int n){
int K = max(1,32 -Integer.numberOfLeadingZeros(n -1));
this.n = 1 <<K;
tbl = new long[K *this.n];
for (int i = 0;i < this.n;i++)
tbl[i] = i < n ? init(i) : 0;
for (int k = 1;k < K;k++)
for (int s = 1 <<k;s < this.n;s += 2 <<k) {
int b = k *this.n;
tbl[b +s] = s < n ? init(s) : 0;
tbl[b +s -1] = s < n ? init(s -1) : 0;
for (int i = 1;i < 1 <<k;i++) {
tbl[b +s +i] = agg(tbl[b +s +i -1],tbl[s +i]);
tbl[b +s -1 -i] = agg(tbl[b +s -i],tbl[s -1 -i]);
}
}
}
abstract protected long init(int i);
abstract protected long agg(long a,long b);
long get(int l,int r){
r--;
if (l == r)
return tbl[l];
int k = 31 -Integer.numberOfLeadingZeros(l ^r);
return agg(tbl[k *n +l],tbl[k *n +r]);
}
}
abstract class Sum2D{
private long[] sum;
private int w;
public Sum2D(int h,int w){
this.w = w;
sum = new long[(h +1) *(w +1)];
for (int i = 0;i < h;i++)
for (int j = 0;j < w;j++)
sum[top(i +1,j +1)] = a(i,j) +sum[top(i +1,j)] +sum[top(i,j +1)] -sum[top(i,j)];
}
abstract long a(int i,int j);
private int top(int i,int j){ return i *(w +1) +j; }
long get(int il,int ir,int jl,int jr){ return sum[top(ir,jr)] -sum[top(il,jr)] -sum[top(ir,jl)] +sum[top(il,jl)]; }
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[n]); }
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){ return copyOf(arr,sz); }
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long inv(long x){ return pow(x,mod -2); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
public long lcm(long a,long b){ return b /gcd(a,b) *a; }
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
public int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
| ConDefects/ConDefects/Code/abc348_e/Java/52088892 |
condefects-java_data_1278 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static List<Integer>[] G;
static long[] sum, tot, C;
static long res = 1l<<60;
static void solve(PrintWriter o) {
try {
int n = nextInt();
G = new ArrayList[n];
Arrays.setAll(G, key->new ArrayList<>());
sum = new long[n];
tot = new long[n];
C = new long[n];
for(int i=0;i<n-1;i++) {
int u = nextInt();
int v = nextInt();
u--;
v--;
G[u].add(v);
G[v].add(u);
}
for(int i=0;i<n;i++) C[i] = nextInt();
dfs1(0, 0, 0);
dfs2(0, 0);
o.println(res);
} catch (Exception e) {
e.printStackTrace();
}
}
static void dfs1(int u, int p, int d) {
sum[u] = C[u];
tot[u] = 1l*d*C[u];
for(int v: G[u]) {
if(v == p) continue;
dfs1(v, u, d+1);
sum[u] += sum[v];
tot[u] += tot[v];
}
}
static void dfs2(int u, int p) {
res = Math.min(res, tot[u]);
for(int v: G[u]) {
if(v == p) continue;
sum[u] -= sum[v];
tot[u] -= tot[v];
tot[u] += sum[u];
tot[v] -= sum[v];
tot[v] += tot[u];
sum[v] += sum[u];
dfs2(v, u);
sum[v] -= sum[u];
tot[v] -= tot[u];
tot[v] += sum[v];
tot[u] -= sum[u];
tot[u] += tot[v];
sum[u] += sum[v];
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1) ret = ret * a % md;
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) tree[x] = Math.max(tree[x], tree[x-i]);
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static List<Integer>[] G;
static long[] sum, tot, C;
static long res = Long.MAX_VALUE;
static void solve(PrintWriter o) {
try {
int n = nextInt();
G = new ArrayList[n];
Arrays.setAll(G, key->new ArrayList<>());
sum = new long[n];
tot = new long[n];
C = new long[n];
for(int i=0;i<n-1;i++) {
int u = nextInt();
int v = nextInt();
u--;
v--;
G[u].add(v);
G[v].add(u);
}
for(int i=0;i<n;i++) C[i] = nextInt();
dfs1(0, 0, 0);
dfs2(0, 0);
o.println(res);
} catch (Exception e) {
e.printStackTrace();
}
}
static void dfs1(int u, int p, int d) {
sum[u] = C[u];
tot[u] = 1l*d*C[u];
for(int v: G[u]) {
if(v == p) continue;
dfs1(v, u, d+1);
sum[u] += sum[v];
tot[u] += tot[v];
}
}
static void dfs2(int u, int p) {
res = Math.min(res, tot[u]);
for(int v: G[u]) {
if(v == p) continue;
sum[u] -= sum[v];
tot[u] -= tot[v];
tot[u] += sum[u];
tot[v] -= sum[v];
tot[v] += tot[u];
sum[v] += sum[u];
dfs2(v, u);
sum[v] -= sum[u];
tot[v] -= tot[u];
tot[v] += sum[v];
tot[u] -= sum[u];
tot[u] += tot[v];
sum[u] += sum[v];
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1) ret = ret * a % md;
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) tree[x] = Math.max(tree[x], tree[x-i]);
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
} | ConDefects/ConDefects/Code/abc348_e/Java/52212106 |
condefects-java_data_1279 | import java.util.*;
public class Main {
static int N = (int)1e5;
static long[] val = new long[N];
static long[] sum = new long[N];
static long[] dp = new long[N];
static List<List<Integer>> g = new ArrayList<>();
static long ans = (long)1L << 60, total;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 0; i < n; i++) g.add(new ArrayList<Integer>());
for (int i = 0; i < n - 1; i++) {
int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
g.get(u).add(v);
g.get(v).add(u);
}
for (int i = 0; i < n; i++) {
val[i] = sc.nextLong();
total += val[i];
}
dfs(0, -1);
dfs2(0, -1);
System.out.println(ans);
}
public static void dfs(int u, int par) {
for (var v : g.get(u)) {
if (v == par) continue;
dfs(v, u);
sum[u] += sum[v];
dp[u] += dp[v];
}
dp[u] += sum[u];
sum[u] += val[u];
}
public static void dfs2(int u, int par) {
ans = Math.min(ans, dp[u]);
for (var v : g.get(u)) {
if (v == par) continue;
dp[v] = dp[u] - sum[v] + (total - sum[v]);
dfs2(v, u);
}
}
}
import java.util.*;
public class Main {
static int N = (int)1e5;
static long[] val = new long[N];
static long[] sum = new long[N];
static long[] dp = new long[N];
static List<List<Integer>> g = new ArrayList<>();
static long ans = (long)1L << 62, total;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for (int i = 0; i < n; i++) g.add(new ArrayList<Integer>());
for (int i = 0; i < n - 1; i++) {
int u = sc.nextInt() - 1, v = sc.nextInt() - 1;
g.get(u).add(v);
g.get(v).add(u);
}
for (int i = 0; i < n; i++) {
val[i] = sc.nextLong();
total += val[i];
}
dfs(0, -1);
dfs2(0, -1);
System.out.println(ans);
}
public static void dfs(int u, int par) {
for (var v : g.get(u)) {
if (v == par) continue;
dfs(v, u);
sum[u] += sum[v];
dp[u] += dp[v];
}
dp[u] += sum[u];
sum[u] += val[u];
}
public static void dfs2(int u, int par) {
ans = Math.min(ans, dp[u]);
for (var v : g.get(u)) {
if (v == par) continue;
dp[v] = dp[u] - sum[v] + (total - sum[v]);
dfs2(v, u);
}
}
} | ConDefects/ConDefects/Code/abc348_e/Java/52893256 |
condefects-java_data_1280 | // package contest.my;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static final int MOD = 1000000007;
static FastReader se = new FastReader();
static Reader s = new Reader();
public static InputStream inputStream = System.in;
public static OutputStream outputStream = System.out;
public static PrintWriter out = new PrintWriter(outputStream);
/*
____ _ _ _
| __ ) _ _ __ _ | | | |_ _ _ __ | |_ ___ _ __
| _ \| | | |/ _` | | |_| | | | | '_ \| __/ _ \ '__|
| |_) | |_| | (_| | | _ | |_| | | | | || __/ |
|____/ \__,_|\__, | |_| |_|\__,_|_| |_|\__\___|_|
|___/
*/
public static void main(String[] args) throws IOException {
int Te = 1;
// int Te = s.nextInt();
while (Te-- >0){
solve();
out.flush();
}
out.close();
}
static List<Integer>[] edges;
static int N;
static long[] weight;
static long[] child;
static long[] dis;
static boolean[] visited;
static long ret = 0;
static long sum;
// code
static void solve() throws IOException {
N = s.nextInt();
edges = new List[N];
child = new long[N];
dis = new long[N];
visited = new boolean[N];
for (int i = 0; i < N; i++) {
edges[i] = new ArrayList<>();
}
weight = new long[N];
for (int i = 0; i < N-1; i++) {
int v1 = s.nextInt()-1, v2 = s.nextInt()-1;
edges[v1].add(v2);
edges[v2].add(v1);
}
for (int i = 0; i < N; i++) {
weight[i] = s.nextLong();
}
sum = Arrays.stream(weight).sum();
dfs(0,0);
for (int i = 0; i < N; i++) {
ret += weight[i]*dis[i];
}
visited = new boolean[N];
visited[0] = true;
dfs2(0,ret);
out.println(ret);
}
static void dfs2(int cur,long score){
for(int next:edges[cur]){
if(visited[next]) continue;
visited[next] = true;
long newScore = score + sum - 2*child[next];
ret = min(ret,newScore);
dfs2(next,newScore);
}
}
// 记录深度及 子树 权值和
static void dfs(int cur,int dep){
dis[cur] = dep;
visited[cur] = true;
long sum = weight[cur];
for(int next:edges[cur]){
if(visited[next])continue;
dfs(next,dep+1);
sum += weight[next];
}
child[cur] = sum;
}
static class Point{
int x;
int y;
public Point(int x, int y) {
this.x = x;
this.y = y;
}
}
static class Tri{
int a;
int b;
int c;
public Tri(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
/**********************/
static int[][] mv = new int[][]{{1,0},{-1,0},{0,1},{0,-1}};
/*********************/
/************************************************/
static class FastReader { BufferedReader br;StringTokenizer st;public FastReader() {br = new BufferedReader(new InputStreamReader(System.in));}String next() {while (st == null || !st.hasMoreElements()) try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace();}return st.nextToken();}int nextInt() {return Integer.parseInt(next());}long nextLong() {return Long.parseLong(next());}double nextDouble() {return Double.parseDouble(next());}String nextLine() {String str = "";try {if (st.hasMoreTokens()) str = st.nextToken("\n"); else str = br.readLine();} catch (IOException e) {e.printStackTrace();}return str;}public int[] readIntArray(int n, int s, int e) {int[] ar = new int[n];for (int i = s; i < e; ++i) ar[i] = se.nextInt();return ar;}public long[] readIntArrayLONG(int n, int s, int e) {long[] ar = new long[n];for (int i = s; i < e; ++i) ar[i] = se.nextLong();return ar;}int[][] next2DInt(int n, int m, int s, int e) {int[][] arr = new int[n][];for (int i = s; i < e; i++) arr[i] = se.readIntArray(m, 0, m);return arr;}long[][] next2DLong(int n, int m, int s, int e) {long[][] arr = new long[n][];for (int i = s; i < e; i++) arr[i] = se.readIntArrayLONG(m, 0, m);return arr;}List<Long> asLongList() throws IOException {List<Long> list = new ArrayList<>();String s = se.next();String[] str = s.split(" ");for (String string : str) list.add(Long.parseLong(string));return list;}List<Integer> asIntList() throws IOException {List<Integer> list = new ArrayList<>();String s = se.next();String[] str = s.split(" ");for (String string : str) list.add(Integer.parseInt(string));return list;}}static class Reader { final private int BUFFER_SIZE = 1 << 16;private DataInputStream din;private byte[] buffer;private int bufferPointer, bytesRead;public Reader() {din = new DataInputStream(System.in);buffer = new byte[BUFFER_SIZE];bufferPointer = bytesRead = 0;}public Reader(String file_name) throws IOException {din = new DataInputStream(new FileInputStream(file_name));buffer = new byte[BUFFER_SIZE];bufferPointer = bytesRead = 0;}public String readLine() throws IOException {byte[] buf = new byte[64];int cnt = 0, c;while ((c = read()) != -1) {if (c == '\n') break;buf[cnt++] = (byte) c;}return new String(buf, 0, cnt);}public int nextInt() throws IOException {int ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public long nextLong() throws IOException {long ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10L + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public double nextDouble() throws IOException {double ret = 0, div = 1;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);if (neg) return -ret;return ret;}private void fillBuffer() throws IOException {bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);if (bytesRead == -1) buffer[0] = -1;}private byte read() throws IOException {if (bufferPointer == bytesRead) fillBuffer();return buffer[bufferPointer++];}public char[] next() throws IOException {StringBuilder sb = new StringBuilder();byte c;while ((c = read()) <= ' ') ;do sb.append((char) c); while ((c = read()) > ' ');return sb.toString().toCharArray();}public int nextInt2() throws IOException {int ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public void close() throws IOException {if (din == null) return;din.close();}public int[] readIntArray(int n, int se, int e) throws IOException {int[] ar = new int[n];for (int i = se; i < e; ++i) ar[i] = s.nextInt();return ar;}public long[] readIntArrayLONG(int n, int se, int e) throws IOException {long[] ar = new long[n];for (int i = se; i < e; ++i) ar[i] = s.nextLong();return ar;}int[][] next2DInt(int n, int m, int se, int e) throws IOException {int[][] arr = new int[n][];for (int i = se; i < e; i++) arr[i] = s.readIntArray(m, 0, m);return arr;}long[][] next2DLong(int n, int m, int se, int e) throws IOException {long[][] arr = new long[n][];for (int i = se; i < e; i++) arr[i] = s.readIntArrayLONG(m, 0, m);return arr;}List<Long> asLongList(int n) throws IOException {List<Long> list = new ArrayList<>(n);for (int i = 0; i < n; i++) list.add(s.nextLong());return list;}List<Integer> asIntList(int n) throws IOException {List<Integer> list = new ArrayList<>(n);for (int i = 0; i < n; i++) list.add(s.nextInt());return list;}}
public static long gcd(long a, long b) { if (b == 0) return a; return gcd(b, a % b); } public static long LCM(long u, long v) { return (u / gcd(u, v)) * v; } public static void debugL(long[] a, long s) { for (long i = s; i < a.length; i++) { System.out.print(a[(int) i] + " "); } } public static void debugI(int[] a, long s) { for (long i = s; i < a.length; i++) { System.out.print(a[(int) i] + " "); } } static int max3(int a,int b,int c){ return max(max(a,b),c); } static long max3(long a,long b,long c){ return max(max(a,b),c); } static int min3(int a,int b,int c){ return min(min(a,b),c); } static long min3(long a,long b,long c){ return min(min(a,b),c); } public static long sumofarray(int[] arr) { long n = arr.length, sum = 0; for (long i = 0; i < n; i++) sum += arr[(int) i]; return sum; } public static long power(long x, long y, long p) { long res = 1; x = x % p; while (y > 0) { if (y % 2 == 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } public static String numToBinary(long num) { String str = ""; while (num > 0) { if ((num & 1) == 1) str += '1'; else str += '0'; num >>= 1; } return str; }
public static void println(long c) {out.println(c);}public static void print(long c) {out.print(c);}public static void print(int c) {out.print(c);}public static void println(int x) {out.println(x);}public static void print(String s) {out.print(s);}public static void println(String s) {out.println(s);}public static void println(boolean b) {out.println(b);}public static void println(char x) {out.println(x);}public static void reverseArray(int[] a) {int n = a.length, arr[] = new int[n];for (int i = 0; i < n; i++) arr[i] = a[n - i - 1]; for (int i = 0; i < n; i++) a[i] = arr[i]; }public static void reverseArray(long[] a) {int n = a.length; long arr[] = new long[n];for (int i = 0; i < n; i++) arr[i] = a[n - i - 1]; for (int i = 0; i < n; i++) a[i] = arr[i]; }
}
// package contest.my;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static final int MOD = 1000000007;
static FastReader se = new FastReader();
static Reader s = new Reader();
public static InputStream inputStream = System.in;
public static OutputStream outputStream = System.out;
public static PrintWriter out = new PrintWriter(outputStream);
/*
____ _ _ _
| __ ) _ _ __ _ | | | |_ _ _ __ | |_ ___ _ __
| _ \| | | |/ _` | | |_| | | | | '_ \| __/ _ \ '__|
| |_) | |_| | (_| | | _ | |_| | | | | || __/ |
|____/ \__,_|\__, | |_| |_|\__,_|_| |_|\__\___|_|
|___/
*/
public static void main(String[] args) throws IOException {
int Te = 1;
// int Te = s.nextInt();
while (Te-- >0){
solve();
out.flush();
}
out.close();
}
static List<Integer>[] edges;
static int N;
static long[] weight;
static long[] child;
static long[] dis;
static boolean[] visited;
static long ret = 0;
static long sum;
// code
static void solve() throws IOException {
N = s.nextInt();
edges = new List[N];
child = new long[N];
dis = new long[N];
visited = new boolean[N];
for (int i = 0; i < N; i++) {
edges[i] = new ArrayList<>();
}
weight = new long[N];
for (int i = 0; i < N-1; i++) {
int v1 = s.nextInt()-1, v2 = s.nextInt()-1;
edges[v1].add(v2);
edges[v2].add(v1);
}
for (int i = 0; i < N; i++) {
weight[i] = s.nextLong();
}
sum = Arrays.stream(weight).sum();
dfs(0,0);
for (int i = 0; i < N; i++) {
ret += weight[i]*dis[i];
}
visited = new boolean[N];
visited[0] = true;
dfs2(0,ret);
out.println(ret);
}
static void dfs2(int cur,long score){
for(int next:edges[cur]){
if(visited[next]) continue;
visited[next] = true;
long newScore = score + sum - 2*child[next];
ret = min(ret,newScore);
dfs2(next,newScore);
}
}
// 记录深度及 子树 权值和
static void dfs(int cur,int dep){
dis[cur] = dep;
visited[cur] = true;
long sum = weight[cur];
for(int next:edges[cur]){
if(visited[next])continue;
dfs(next,dep+1);
sum += child[next];
}
child[cur] = sum;
}
static class Point{
int x;
int y;
public Point(int x, int y) {
this.x = x;
this.y = y;
}
}
static class Tri{
int a;
int b;
int c;
public Tri(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
/**********************/
static int[][] mv = new int[][]{{1,0},{-1,0},{0,1},{0,-1}};
/*********************/
/************************************************/
static class FastReader { BufferedReader br;StringTokenizer st;public FastReader() {br = new BufferedReader(new InputStreamReader(System.in));}String next() {while (st == null || !st.hasMoreElements()) try { st = new StringTokenizer(br.readLine()); } catch (IOException e) { e.printStackTrace();}return st.nextToken();}int nextInt() {return Integer.parseInt(next());}long nextLong() {return Long.parseLong(next());}double nextDouble() {return Double.parseDouble(next());}String nextLine() {String str = "";try {if (st.hasMoreTokens()) str = st.nextToken("\n"); else str = br.readLine();} catch (IOException e) {e.printStackTrace();}return str;}public int[] readIntArray(int n, int s, int e) {int[] ar = new int[n];for (int i = s; i < e; ++i) ar[i] = se.nextInt();return ar;}public long[] readIntArrayLONG(int n, int s, int e) {long[] ar = new long[n];for (int i = s; i < e; ++i) ar[i] = se.nextLong();return ar;}int[][] next2DInt(int n, int m, int s, int e) {int[][] arr = new int[n][];for (int i = s; i < e; i++) arr[i] = se.readIntArray(m, 0, m);return arr;}long[][] next2DLong(int n, int m, int s, int e) {long[][] arr = new long[n][];for (int i = s; i < e; i++) arr[i] = se.readIntArrayLONG(m, 0, m);return arr;}List<Long> asLongList() throws IOException {List<Long> list = new ArrayList<>();String s = se.next();String[] str = s.split(" ");for (String string : str) list.add(Long.parseLong(string));return list;}List<Integer> asIntList() throws IOException {List<Integer> list = new ArrayList<>();String s = se.next();String[] str = s.split(" ");for (String string : str) list.add(Integer.parseInt(string));return list;}}static class Reader { final private int BUFFER_SIZE = 1 << 16;private DataInputStream din;private byte[] buffer;private int bufferPointer, bytesRead;public Reader() {din = new DataInputStream(System.in);buffer = new byte[BUFFER_SIZE];bufferPointer = bytesRead = 0;}public Reader(String file_name) throws IOException {din = new DataInputStream(new FileInputStream(file_name));buffer = new byte[BUFFER_SIZE];bufferPointer = bytesRead = 0;}public String readLine() throws IOException {byte[] buf = new byte[64];int cnt = 0, c;while ((c = read()) != -1) {if (c == '\n') break;buf[cnt++] = (byte) c;}return new String(buf, 0, cnt);}public int nextInt() throws IOException {int ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public long nextLong() throws IOException {long ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10L + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public double nextDouble() throws IOException {double ret = 0, div = 1;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (c == '.') while ((c = read()) >= '0' && c <= '9') ret += (c - '0') / (div *= 10);if (neg) return -ret;return ret;}private void fillBuffer() throws IOException {bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);if (bytesRead == -1) buffer[0] = -1;}private byte read() throws IOException {if (bufferPointer == bytesRead) fillBuffer();return buffer[bufferPointer++];}public char[] next() throws IOException {StringBuilder sb = new StringBuilder();byte c;while ((c = read()) <= ' ') ;do sb.append((char) c); while ((c = read()) > ' ');return sb.toString().toCharArray();}public int nextInt2() throws IOException {int ret = 0;byte c = read();while (c <= ' ') c = read();boolean neg = (c == '-');if (neg) c = read();do ret = ret * 10 + c - '0'; while ((c = read()) >= '0' && c <= '9');if (neg) return -ret;return ret;}public void close() throws IOException {if (din == null) return;din.close();}public int[] readIntArray(int n, int se, int e) throws IOException {int[] ar = new int[n];for (int i = se; i < e; ++i) ar[i] = s.nextInt();return ar;}public long[] readIntArrayLONG(int n, int se, int e) throws IOException {long[] ar = new long[n];for (int i = se; i < e; ++i) ar[i] = s.nextLong();return ar;}int[][] next2DInt(int n, int m, int se, int e) throws IOException {int[][] arr = new int[n][];for (int i = se; i < e; i++) arr[i] = s.readIntArray(m, 0, m);return arr;}long[][] next2DLong(int n, int m, int se, int e) throws IOException {long[][] arr = new long[n][];for (int i = se; i < e; i++) arr[i] = s.readIntArrayLONG(m, 0, m);return arr;}List<Long> asLongList(int n) throws IOException {List<Long> list = new ArrayList<>(n);for (int i = 0; i < n; i++) list.add(s.nextLong());return list;}List<Integer> asIntList(int n) throws IOException {List<Integer> list = new ArrayList<>(n);for (int i = 0; i < n; i++) list.add(s.nextInt());return list;}}
public static long gcd(long a, long b) { if (b == 0) return a; return gcd(b, a % b); } public static long LCM(long u, long v) { return (u / gcd(u, v)) * v; } public static void debugL(long[] a, long s) { for (long i = s; i < a.length; i++) { System.out.print(a[(int) i] + " "); } } public static void debugI(int[] a, long s) { for (long i = s; i < a.length; i++) { System.out.print(a[(int) i] + " "); } } static int max3(int a,int b,int c){ return max(max(a,b),c); } static long max3(long a,long b,long c){ return max(max(a,b),c); } static int min3(int a,int b,int c){ return min(min(a,b),c); } static long min3(long a,long b,long c){ return min(min(a,b),c); } public static long sumofarray(int[] arr) { long n = arr.length, sum = 0; for (long i = 0; i < n; i++) sum += arr[(int) i]; return sum; } public static long power(long x, long y, long p) { long res = 1; x = x % p; while (y > 0) { if (y % 2 == 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } public static String numToBinary(long num) { String str = ""; while (num > 0) { if ((num & 1) == 1) str += '1'; else str += '0'; num >>= 1; } return str; }
public static void println(long c) {out.println(c);}public static void print(long c) {out.print(c);}public static void print(int c) {out.print(c);}public static void println(int x) {out.println(x);}public static void print(String s) {out.print(s);}public static void println(String s) {out.println(s);}public static void println(boolean b) {out.println(b);}public static void println(char x) {out.println(x);}public static void reverseArray(int[] a) {int n = a.length, arr[] = new int[n];for (int i = 0; i < n; i++) arr[i] = a[n - i - 1]; for (int i = 0; i < n; i++) a[i] = arr[i]; }public static void reverseArray(long[] a) {int n = a.length; long arr[] = new long[n];for (int i = 0; i < n; i++) arr[i] = a[n - i - 1]; for (int i = 0; i < n; i++) a[i] = arr[i]; }
}
| ConDefects/ConDefects/Code/abc348_e/Java/52201042 |
condefects-java_data_1281 |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni(), m = ni(), K = ni();
int[] from = new int[m];
int[] to = new int[m];
for(int i = 0;i < m;i++){
from[i] = ni()-1;
to[i] = ni()-1;
}
int[][] g = packU(n, from, to);
int[] a = na(n);
int[] b = na(K);
Deque<Integer> q = new ArrayDeque<>();
int[] ds = new int[n];
Arrays.fill(ds, 99999);
ds[0] = a[0] == b[0] ? 1 : 0;
q.add(0);
while(!q.isEmpty()){
int cur = q.pollFirst();
for(int e : g[cur]){
int nd = ds[cur] < K && a[e] == b[ds[cur]] ? ds[cur] + 1 : ds[cur];
if(ds[e] > nd){
ds[e] = nd;
if(nd == ds[cur] + 1){
q.addLast(e);
}else{
q.addFirst(e);
}
}
}
}
out.println(ds[n-1] == K ? "Yes" : "No");
}
public static int[][] packU(int n, int[] from, int[] to) {
return packU(n, from, to, from.length);
}
public static int[][] packU(int n, int[] from, int[] to, int sup) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int i = 0; i < sup; i++) p[from[i]]++;
for (int i = 0; i < sup; i++) p[to[i]]++;
for (int i = 0; i < n; i++) g[i] = new int[p[i]];
for (int i = 0; i < sup; i++) {
g[from[i]][--p[from[i]]] = to[i];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
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();
}
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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
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[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(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 long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
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)); }
}
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Deque;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni(), m = ni(), K = ni();
int[] from = new int[m];
int[] to = new int[m];
for(int i = 0;i < m;i++){
from[i] = ni()-1;
to[i] = ni()-1;
}
int[][] g = packU(n, from, to);
int[] a = na(n);
int[] b = na(K);
Deque<Integer> q = new ArrayDeque<>();
int[] ds = new int[n];
Arrays.fill(ds, 999999);
ds[0] = a[0] == b[0] ? 1 : 0;
q.add(0);
while(!q.isEmpty()){
int cur = q.pollFirst();
for(int e : g[cur]){
int nd = ds[cur] < K && a[e] == b[ds[cur]] ? ds[cur] + 1 : ds[cur];
if(ds[e] > nd){
ds[e] = nd;
if(nd == ds[cur] + 1){
q.addLast(e);
}else{
q.addFirst(e);
}
}
}
}
out.println(ds[n-1] == K ? "Yes" : "No");
}
public static int[][] packU(int n, int[] from, int[] to) {
return packU(n, from, to, from.length);
}
public static int[][] packU(int n, int[] from, int[] to, int sup) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int i = 0; i < sup; i++) p[from[i]]++;
for (int i = 0; i < sup; i++) p[to[i]]++;
for (int i = 0; i < n; i++) g[i] = new int[p[i]];
for (int i = 0; i < sup; i++) {
g[from[i]][--p[from[i]]] = to[i];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
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();
}
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 boolean isSpaceChar(int c) { return !(c >= 32 && 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))){
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[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(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 long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
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)); }
}
| ConDefects/ConDefects/Code/arc150_c/Java/35538047 |
condefects-java_data_1282 | import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main implements Runnable {
public static void solve () {
int n = nextInt();
Deque<Ball> q = new ArrayDeque<>();
long size = 0;
for (int i=1; i<n; i++) {
int num = nextInt();
if (q.size() == 0) {
q.addLast(new Ball(num, 1));
size += 1;
println(1);
continue;
}
Ball b = q.getLast();
size += 1;
if (b.num == num) {
b.count += 1;
if (b.count == b.num) {
size -= b.count;
q.removeLast();
}
}
else {
q.addLast(new Ball(num, 1));
}
println(size);
}
}
public static class Ball {
int num;
long count;
Ball (int num, long count) {
this.num = num;
this.count = count;
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
// public static int[] dy = {-1, 0, -1, 1, 0, 1};
// public static int[] dx = {-1, -1, 0, 0, 1, 1};
// public static int[] dy = {-1, -1, -1, 0, 1, 1, 1, 0};
// public static int[] dx = {-1, 0, 1, 1, 1, 0, -1, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) { //基本コレ
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
new Thread(null, new Main(), "", 64 * 1024 * 1024).start();
}
public void run() {
solve();
out.close();
}
}
import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main implements Runnable {
public static void solve () {
int n = nextInt();
Deque<Ball> q = new ArrayDeque<>();
long size = 0;
for (int i=0; i<n; i++) {
int num = nextInt();
if (q.size() == 0) {
q.addLast(new Ball(num, 1));
size += 1;
println(1);
continue;
}
Ball b = q.getLast();
size += 1;
if (b.num == num) {
b.count += 1;
if (b.count == b.num) {
size -= b.count;
q.removeLast();
}
}
else {
q.addLast(new Ball(num, 1));
}
println(size);
}
}
public static class Ball {
int num;
long count;
Ball (int num, long count) {
this.num = num;
this.count = count;
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
// public static int[] dy = {-1, 0, -1, 1, 0, 1};
// public static int[] dx = {-1, -1, 0, 0, 1, 1};
// public static int[] dy = {-1, -1, -1, 0, 1, 1, 1, 0};
// public static int[] dx = {-1, 0, 1, 1, 1, 0, -1, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) { //基本コレ
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
new Thread(null, new Main(), "", 64 * 1024 * 1024).start();
}
public void run() {
solve();
out.close();
}
} | ConDefects/ConDefects/Code/abc240_d/Java/39561594 |
condefects-java_data_1283 | import java.util.Scanner;
class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
long[] repunit=new long[12];
for(int i=0;i<11;i++){
repunit[i]=Long.parseLong("1".repeat(i+1));
}
int count=0;
for(int i=0;i<12;i++){
for(int j=0;j<=i;j++){
for(int k=0;k<=j;k++){
count++;
if(count==n){
System.out.println(repunit[i]+repunit[j]+repunit[k]);
}
}
}
}
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
long[] repunit=new long[12];
for(int i=0;i<12;i++){
repunit[i]=Long.parseLong("1".repeat(i+1));
}
int count=0;
for(int i=0;i<12;i++){
for(int j=0;j<=i;j++){
for(int k=0;k<=j;k++){
count++;
if(count==n){
System.out.println(repunit[i]+repunit[j]+repunit[k]);
}
}
}
}
}
}
| ConDefects/ConDefects/Code/abc333_c/Java/50317114 |
condefects-java_data_1284 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
public class Main implements Runnable {
public static void main(String[] args) {
new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); //16MBスタックを確保して実行
}
long gcd(long a, long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long lcm(long a, long b) {
return a * b / gcd(a, b);
}
long extend(boolean[] vis, long height) {
boolean[] nvis = Arrays.copyOf(vis, vis.length);
PriorityQueue<State> pq = new PriorityQueue<>();
nvis[0] = true;
for (int i = 0; i < N; ++i) {
if (nvis[i]) for (int u : g[i]) {
if (!nvis[u] && type[u] == addType) {
pq.add(new State(heights[u], gains[u], u));
}
}
}
while (!pq.isEmpty()) {
State state = pq.poll();
if (state.height <= height) {
height = Math.min(height + state.gain, INF);
nvis[state.id] = true;
for (int next : g[state.id]) if (!nvis[next] && type[next] == addType){
pq.add(new State(heights[next], gains[next], next));
}
}
}
return height;
}
int N;
ArrayList<Integer>[] g;
long[] heights;
int[] type;
long[] gains;
ArrayList<Integer> list;
int[] scaleId;
long INF = (long) 1234567890;
final int addType = 1;
final int scaleType = 2;
class State implements Comparable<State> {
long height;
long gain;
int id;
public State(long height, long gain, int id) {
this.height = height;
this.gain = gain;
this.id = id;
}
public int compareTo(State o) {
return Long.compare(height, o.height);
};
}
public void run() {
FastScanner sc=new FastScanner();
PrintWriter pw=new PrintWriter(System.out);
N = sc.nextInt();
g = new ArrayList[N];
for (int i = 0; i < N; ++i) {
g[i] = new ArrayList<>();
}
heights = new long[N];
type = new int[N];
gains = new long[N];
list = new ArrayList<>();
for (int i = 1; i < N; ++i) {
int p = sc.nextInt() - 1;
g[i].add(p);
g[p].add(i);
type[i] = sc.nextInt();
heights[i] = sc.nextInt();
gains[i] = sc.nextInt();
if (type[i] == scaleType) list.add(i);
}
scaleId = new int[N];
Arrays.fill(scaleId, -1);
for (int i = 0; i < list.size(); ++i) scaleId[list.get(i)] = i;
long[] dp = new long[1 << list.size()];
Arrays.fill(dp, -1);
dp[0] = extend(new boolean[N], 1);
for (int set = 0; set < 1 << list.size(); ++set) {
if (dp[set] == -1) continue;
Queue<Integer> que = new ArrayDeque<>();
que.add(0);
boolean[] vis = new boolean[N];
ArrayList<Integer> next = new ArrayList<>();
vis[0] = true;
while (!que.isEmpty()) {
int v = que.poll();
for (int u : g[v]) {
if (vis[u]) continue;
if (type[u] == addType && heights[u] > dp[set]) continue;
if (type[u] == scaleType && (set >> scaleId[u]) % 2 == 0) continue;
que.add(u);
vis[u] = true;
}
}
for (int i = 0; i < N; ++i) {
if (vis[i]) {
for (int u : g[i]) {
if (type[u] == scaleType && (set >> scaleId[u]) % 2 == 0) next.add(u);
}
}
}
for (int add : next) {
int nset = set | (1 << scaleId[add]);
vis[add] = true;
long height = dp[set];
height = Math.min(height * gains[add], INF);
dp[nset] = Math.max(dp[nset], extend(vis, height));
vis[add] = false;
}
}
long need = 0;
for (int i = 0; i < N; ++i) if (type[i] == addType) need = Math.max(need, gains[i]);
pw.println(Arrays.stream(dp).max().getAsLong() >= need ? "Yes" : "No");
pw.close();
}
void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
return (int)nextLong();
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
public class Main implements Runnable {
public static void main(String[] args) {
new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); //16MBスタックを確保して実行
}
long gcd(long a, long b) {
if (a == 0) return b;
return gcd(b % a, a);
}
long lcm(long a, long b) {
return a * b / gcd(a, b);
}
long extend(boolean[] vis, long height) {
boolean[] nvis = Arrays.copyOf(vis, vis.length);
PriorityQueue<State> pq = new PriorityQueue<>();
nvis[0] = true;
for (int i = 0; i < N; ++i) {
if (nvis[i]) for (int u : g[i]) {
if (!nvis[u] && type[u] == addType) {
pq.add(new State(heights[u], gains[u], u));
}
}
}
while (!pq.isEmpty()) {
State state = pq.poll();
if (state.height <= height) {
height = Math.min(height + state.gain, INF);
nvis[state.id] = true;
for (int next : g[state.id]) if (!nvis[next] && type[next] == addType){
pq.add(new State(heights[next], gains[next], next));
}
}
}
return height;
}
int N;
ArrayList<Integer>[] g;
long[] heights;
int[] type;
long[] gains;
ArrayList<Integer> list;
int[] scaleId;
long INF = (long) 1234567890;
final int addType = 1;
final int scaleType = 2;
class State implements Comparable<State> {
long height;
long gain;
int id;
public State(long height, long gain, int id) {
this.height = height;
this.gain = gain;
this.id = id;
}
public int compareTo(State o) {
return Long.compare(height, o.height);
};
}
public void run() {
FastScanner sc=new FastScanner();
PrintWriter pw=new PrintWriter(System.out);
N = sc.nextInt();
g = new ArrayList[N];
for (int i = 0; i < N; ++i) {
g[i] = new ArrayList<>();
}
heights = new long[N];
type = new int[N];
gains = new long[N];
list = new ArrayList<>();
for (int i = 1; i < N; ++i) {
int p = sc.nextInt() - 1;
g[i].add(p);
g[p].add(i);
type[i] = sc.nextInt();
heights[i] = sc.nextInt();
gains[i] = sc.nextInt();
if (type[i] == scaleType) list.add(i);
}
scaleId = new int[N];
Arrays.fill(scaleId, -1);
for (int i = 0; i < list.size(); ++i) scaleId[list.get(i)] = i;
long[] dp = new long[1 << list.size()];
Arrays.fill(dp, -1);
dp[0] = extend(new boolean[N], 1);
for (int set = 0; set < 1 << list.size(); ++set) {
if (dp[set] == -1) continue;
Queue<Integer> que = new ArrayDeque<>();
que.add(0);
boolean[] vis = new boolean[N];
ArrayList<Integer> next = new ArrayList<>();
vis[0] = true;
while (!que.isEmpty()) {
int v = que.poll();
for (int u : g[v]) {
if (vis[u]) continue;
if (type[u] == addType && heights[u] > dp[set]) continue;
if (type[u] == scaleType && (set >> scaleId[u]) % 2 == 0) continue;
que.add(u);
vis[u] = true;
}
}
for (int i = 0; i < N; ++i) {
if (vis[i]) {
for (int u : g[i]) {
if (type[u] == scaleType && (set >> scaleId[u]) % 2 == 0) next.add(u);
}
}
}
for (int add : next) {
int nset = set | (1 << scaleId[add]);
vis[add] = true;
long height = dp[set];
height = Math.min(height * gains[add], INF);
dp[nset] = Math.max(dp[nset], extend(vis, height));
vis[add] = false;
}
}
long need = 0;
for (int i = 0; i < N; ++i) if (type[i] == addType) need = Math.max(need, heights[i]);
pw.println(Arrays.stream(dp).max().getAsLong() >= need ? "Yes" : "No");
pw.close();
}
void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;}
public boolean hasNext() { skipUnprintable(); return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
return (int)nextLong();
}
} | ConDefects/ConDefects/Code/abc319_f/Java/45429079 |
condefects-java_data_1285 | import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long L = sc.nextLong();
long R = sc.nextLong();
List<List<Long>> ans = new ArrayList<>();
while (L < R) {
long i = 0;
while (L % (1L << (i + 1)) == 0 && L + (1L << (i + 1)) <= R) {
i++;
}
List<Long> range = new ArrayList<>();
range.add(L);
range.add(L + (1L << i) - 1);
ans.add(range);
L += (1L << i);
}
System.out.println(ans.size());
for (List<Long> range : ans) {
System.out.println(range.get(0) + " " + range.get(1));
}
}
}
import java.util.Scanner;
import java.util.ArrayList;
import java.util.List;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long L = sc.nextLong();
long R = sc.nextLong();
List<List<Long>> ans = new ArrayList<>();
while (L < R) {
long i = 0;
while (L % (1L << (i + 1)) == 0 && L + (1L << (i + 1)) <= R) {
i++;
}
List<Long> range = new ArrayList<>();
range.add(L);
range.add(L + (1L << i));
ans.add(range);
L += (1L << i);
}
System.out.println(ans.size());
for (List<Long> range : ans) {
System.out.println(range.get(0) + " " + range.get(1));
}
}
}
| ConDefects/ConDefects/Code/abc349_d/Java/52373290 |
condefects-java_data_1286 | import java.util.*;
class Pair {
private long x;
private long y;
public Pair(long x, long y) {
this.x = x;
this.y = y;
}
public void setX(long x) {
this.x = x;
}
public void setY(long y) {
this.y = y;
}
public long getX() {
return this.x;
}
public long getY() {
return this.y;
}
}
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long left = Long.parseLong(sc.next());
long right = Long.parseLong(sc.next());
List<Pair> answer = new ArrayList<>();
while (left < right) {
for (int i = 60; i >= 0; i--) {
long w = 1 << i;
if (left % w != 0) {
continue;
}
if (left + w > right) {
continue;
}
answer.add(new Pair(left, left + w));
left += w;
break;
}
}
System.out.println(answer.size());
for (int i = 0; i < answer.size(); i++) {
System.out.println(answer.get(i).getX() + " " + answer.get(i).getY());
}
}
}
import java.util.*;
class Pair {
private long x;
private long y;
public Pair(long x, long y) {
this.x = x;
this.y = y;
}
public void setX(long x) {
this.x = x;
}
public void setY(long y) {
this.y = y;
}
public long getX() {
return this.x;
}
public long getY() {
return this.y;
}
}
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long left = Long.parseLong(sc.next());
long right = Long.parseLong(sc.next());
List<Pair> answer = new ArrayList<>();
while (left < right) {
for (int i = 60; i >= 0; i--) {
long w = 1L << i;
if (left % w != 0) {
continue;
}
if (left + w > right) {
continue;
}
answer.add(new Pair(left, left + w));
left += w;
break;
}
}
System.out.println(answer.size());
for (int i = 0; i < answer.size(); i++) {
System.out.println(answer.get(i).getX() + " " + answer.get(i).getY());
}
}
}
| ConDefects/ConDefects/Code/abc349_d/Java/53933579 |
condefects-java_data_1287 | import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
class Main{
public static void main(String[] args){
var in = new MyReader(System.in);
int N = in.it();
int[] A = new int[N];
int[] B = new int[N];
int[] cntA = new int[N];
int[] cntB = new int[N];
boolean has2 = false;
for (int i = 0;i < N;i++) {
A[i] = in.it() -1;
cntA[A[i]]++;
if (cntA[A[i]] == 2)
has2 = true;
}
for (int i = 0;i < N;i++) {
B[i] = in.it() -1;
cntB[B[i]]++;
}
if (!Arrays.equals(cntA,cntB)) {
System.out.println("No");
return;
}
if (has2) {
System.out.println("Yes");
return;
}
System.out.println(tento(A,N) == tento(B,N) ? "Yes" : "No");
}
static byte tento(int[] arr,int max){
BIT bit = new BIT(max);
byte ans = 0;
for (var a:arr) {
ans ^= bit.sum(a +1);
bit.upd(a,(byte) 1);
}
return ans;
}
}
class BIT{
int n;
byte[] bit;
BIT(int n){
this.n = n;
bit = new byte[n +1];
}
void upd(int x,byte v){
for (x++;x <= n;x += x &-x)
bit[x] += v;
}
byte sum(int x){
byte ret = 0;
for (;x > 0;x -= x &-x)
ret ^= bit[x];
return ret;
}
}
class MyReader{
byte[] buf = new byte[1 <<16];
int ptr = 0;
int tail = 0;
InputStream in;
MyReader(InputStream in){ this.in = in; }
byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
boolean isPrintable(byte c){ return 32 < c && c < 127; }
boolean isNum(byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
int it(){
byte i = nextPrintable();
boolean negative = i == 45;
int n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
class Main{
public static void main(String[] args){
var in = new MyReader(System.in);
int N = in.it();
int[] A = new int[N];
int[] B = new int[N];
int[] cntA = new int[N];
int[] cntB = new int[N];
boolean has2 = false;
for (int i = 0;i < N;i++) {
A[i] = in.it() -1;
cntA[A[i]]++;
if (cntA[A[i]] == 2)
has2 = true;
}
for (int i = 0;i < N;i++) {
B[i] = in.it() -1;
cntB[B[i]]++;
}
if (!Arrays.equals(cntA,cntB)) {
System.out.println("No");
return;
}
if (has2) {
System.out.println("Yes");
return;
}
System.out.println(tento(A,N) == tento(B,N) ? "Yes" : "No");
}
static byte tento(int[] arr,int max){
BIT bit = new BIT(max);
byte ans = 0;
for (var a:arr) {
ans ^= bit.sum(a +1);
bit.upd(a,(byte) 1);
}
return ans;
}
}
class BIT{
int n;
byte[] bit;
BIT(int n){
this.n = n;
bit = new byte[n +1];
}
void upd(int x,byte v){
for (x++;x <= n;x += x &-x)
bit[x] ^= v;
}
byte sum(int x){
byte ret = 0;
for (;x > 0;x -= x &-x)
ret ^= bit[x];
return ret;
}
}
class MyReader{
byte[] buf = new byte[1 <<16];
int ptr = 0;
int tail = 0;
InputStream in;
MyReader(InputStream in){ this.in = in; }
byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
boolean isPrintable(byte c){ return 32 < c && c < 127; }
boolean isNum(byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
int it(){
byte i = nextPrintable();
boolean negative = i == 45;
int n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
}
| ConDefects/ConDefects/Code/abc296_f/Java/40294319 |
condefects-java_data_1288 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] buill = new int[N];
for (int i = 0; i < N; i++) {
buill[i] = sc.nextInt();
}
sc.close();
int standard = buill[0];
boolean found = false;
for (int i = 1; i < buill.length; i++) {
if (standard < buill[i]) {
System.out.println(i);
found = true;
break;
}
}
if (!found) {
System.out.println(-1);
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] buill = new int[N];
for (int i = 0; i < N; i++) {
buill[i] = sc.nextInt();
}
sc.close();
int standard = buill[0];
boolean found = false;
for (int i = 1; i < buill.length; i++) {
if (standard < buill[i]) {
System.out.println(i + 1);
found = true;
break;
}
}
if (!found) {
System.out.println(-1);
}
}
} | ConDefects/ConDefects/Code/abc353_a/Java/54698070 |
condefects-java_data_1289 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int N = sc.nextInt();
int[] NBox = new int[N];
for (int i = 0; i < N; i++) {
NBox[i] = sc.nextInt();
}
int H1 = NBox[0];
int H = -1;
for (int i = 1; i < N; i++) {
if (H1 > NBox[i]) {
H = i + 1;
break;
}
}
System.out.println(H);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int N = sc.nextInt();
int[] NBox = new int[N];
for (int i = 0; i < N; i++) {
NBox[i] = sc.nextInt();
}
int H1 = NBox[0];
int H = -1;
for (int i = 1; i < N; i++) {
if (H1 < NBox[i]) {
H = i + 1;
break;
}
}
System.out.println(H);
}
}
}
| ConDefects/ConDefects/Code/abc353_a/Java/54694274 |
condefects-java_data_1290 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int maxA = Integer.MIN_VALUE, minB = Integer.MAX_VALUE;
StringBuilder sb = new StringBuilder();
for (int i = 0;i < n;i++ ) {
maxA = Math.max(maxA, sc.nextInt());
minB = Math.min(minB, sc.nextInt());
if (maxA <= minB) sb.append(0).append('\n');
else sb.append((maxA - minB) / 2).append('\n');
}
sb.deleteCharAt(sb.length() - 1);
System.out.println(sb);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int maxA = Integer.MIN_VALUE, minB = Integer.MAX_VALUE;
StringBuilder sb = new StringBuilder();
for (int i = 0;i < n;i++ ) {
maxA = Math.max(maxA, sc.nextInt());
minB = Math.min(minB, sc.nextInt());
if (maxA <= minB) sb.append(0).append('\n');
else sb.append((int) Math.ceil((double) (maxA - minB) / 2)).append('\n');
}
sb.deleteCharAt(sb.length() - 1);
System.out.println(sb);
}
} | ConDefects/ConDefects/Code/arc129_b/Java/28645654 |
condefects-java_data_1291 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.List;
import java.util.Objects;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(final String[] args) {
final FastScanner scanner = new FastScanner(System.in);
final int n = scanner.nextInt();
final List<Pair<Integer, Integer>> list = Stream.generate(() -> new Pair<>(scanner.nextInt(), scanner.nextInt()))
.limit(n)
.collect(Collectors.toList());
int maxL = 0;
int minR = Integer.MAX_VALUE;
final StringJoiner joiner = new StringJoiner("\n");
for (final Pair<Integer, Integer> pair : list) {
maxL = Math.max(maxL, pair.first);
minR = Math.min(minR, pair.second);
joiner.add(Integer.toString(Math.max((maxL - minR) / 2, 0)));
}
System.out.println(joiner);
}
private static class FastScanner {
private final BufferedReader reader;
private StringTokenizer tokenizer;
FastScanner(final InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
}
String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (final IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
private static class Pair<T1, T2> {
final T1 first;
final T2 second;
Pair(final T1 first, final T2 second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(final Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
final Pair<?, ?> pair = (Pair<?, ?>) o;
return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
}
@Override
public int hashCode() {
return Objects.hash(first, second);
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.List;
import java.util.Objects;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(final String[] args) {
final FastScanner scanner = new FastScanner(System.in);
final int n = scanner.nextInt();
final List<Pair<Integer, Integer>> list = Stream.generate(() -> new Pair<>(scanner.nextInt(), scanner.nextInt()))
.limit(n)
.collect(Collectors.toList());
int maxL = 0;
int minR = Integer.MAX_VALUE;
final StringJoiner joiner = new StringJoiner("\n");
for (final Pair<Integer, Integer> pair : list) {
maxL = Math.max(maxL, pair.first);
minR = Math.min(minR, pair.second);
joiner.add(Integer.toString(Math.max((maxL - minR + 1) / 2, 0)));
}
System.out.println(joiner);
}
private static class FastScanner {
private final BufferedReader reader;
private StringTokenizer tokenizer;
FastScanner(final InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
}
String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (final IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
private static class Pair<T1, T2> {
final T1 first;
final T2 second;
Pair(final T1 first, final T2 second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(final Object o) {
if (this == o) {
return true;
}
if (o == null || getClass() != o.getClass()) {
return false;
}
final Pair<?, ?> pair = (Pair<?, ?>) o;
return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
}
@Override
public int hashCode() {
return Objects.hash(first, second);
}
}
}
| ConDefects/ConDefects/Code/arc129_b/Java/27445668 |
condefects-java_data_1292 | import java.io.*;
import java.util.*;
class Main{
public static long mod = (long)1e9+7;
public static ArrayList<Integer>[] graph;
public static void sort(int[] array){
ArrayList<Integer> list = new ArrayList<>();
for(int k:array) list.add(k);
Collections.sort(list);
for (int i = 0; i < array.length; i++) {
array[i] = list.get(i);
}
}
public static void sort(long[] array){
ArrayList<Long> list = new ArrayList<>();
for(long k:array) list.add(k);
Collections.sort(list);
for (int i = 0; i < array.length; i++) {
array[i] = list.get(i);
}
}
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
int t = 1;
//t = in.nextInt();
for(int i = 1;i<=t ;i++){
solve(in,out,i);
}
out.close();
}
static boolean change;
private static void solve(InputReader in, PrintWriter out,int caseID) {
long N = in.nextLong();
long ak = -1;
long bk = (int)1e9 + 7;
for (int i = 0; i < N; i++) {
ak = Math.max(ak,in.nextInt());
bk = Math.min(bk,in.nextInt());
if(ak<=bk) out.println(0);
else out.println((ak-bk)/2);
}
}
public static long calculate(long L, long R, long start,long end){
return Math.max(0,Math.min(R,end) - Math.max(start,L) +1);
}
public static int calc(int[] list, int l ,int r, int x){
int ans = 0;
if(x<=list[l]) return r-l+1;
if(x>list[r]) return 0;
int lo = l;
int hi = r;
while(lo<=hi){
int mid = lo + (hi-lo)/2;
if(list[mid] >= x){
ans = mid;
hi = mid-1;
}
else lo = mid+1;
}
return r-ans+1;
}
public static int[] tinker(int[] list){
// ArrayList<Integer> re = new ArrayList<>();
ArrayList<Integer> temp = new ArrayList<>();
for (int i = 0; i < 10; i++) {
int j = (i+1)%10;
temp = new ArrayList<>();
int k = 0;
for (k = 0; k < list.length-1;) {
int a = list[k];
int b = list[k+1];
if(a==i && b==j){
change = true;
temp.add((j+1)%10);
k+=2;
}
else{
temp.add(a);
//if(k==(list.length-2)) temp.add(b);
k++;
}
}
if(k==list.length-1) temp.add(list[k]);
if(change){
int[] nlist = new int[temp.size()];
int io = 0;
for(int oi:temp) nlist[io++] = oi;
return nlist;
}
}
return null;
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble(){
return Double.parseDouble(next());
}
public int[] readIntArray(int size){
int[] list = new int[size];
for(int i = 0;i<size;i++) list[i] = nextInt();
return list;
}
public long[] readLongArray(int size){
long[] list = new long[size];
for(int i = 0;i<size;i++) list[i] = nextLong();
return list;
}
public double[] readDoubleArray(int size){
double[] list = new double[size];
for(int i = 0;i<size;i++) list[i] = nextDouble();
return list;
}
public String linereader() {
String s = null;
try{
s = reader.readLine();
}
catch (IOException e) {
throw new RuntimeException(e);
}
return s;
}
}
class Pair<T extends Comparable<T>,K extends Comparable<K> > implements Comparable<Pair<T,K>>{
T first;
K second;
public Pair(T first, K second){
this.first = first;
this.second = second;
}
@Override
public String toString(){
return first+" "+second;
}
@Override
public int compareTo(Pair<T,K> o) {
// TODO Auto-generated method stub
if((first).compareTo(o.first)!=0) return first.compareTo(o.first);
else return second.compareTo(o.second);
}
}
import java.io.*;
import java.util.*;
class Main{
public static long mod = (long)1e9+7;
public static ArrayList<Integer>[] graph;
public static void sort(int[] array){
ArrayList<Integer> list = new ArrayList<>();
for(int k:array) list.add(k);
Collections.sort(list);
for (int i = 0; i < array.length; i++) {
array[i] = list.get(i);
}
}
public static void sort(long[] array){
ArrayList<Long> list = new ArrayList<>();
for(long k:array) list.add(k);
Collections.sort(list);
for (int i = 0; i < array.length; i++) {
array[i] = list.get(i);
}
}
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
int t = 1;
//t = in.nextInt();
for(int i = 1;i<=t ;i++){
solve(in,out,i);
}
out.close();
}
static boolean change;
private static void solve(InputReader in, PrintWriter out,int caseID) {
long N = in.nextLong();
long ak = -1;
long bk = (int)1e9 + 7;
for (int i = 0; i < N; i++) {
ak = Math.max(ak,in.nextInt());
bk = Math.min(bk,in.nextInt());
if(ak<=bk) out.println(0);
else out.println((ak-bk + 1)/2);
}
}
public static long calculate(long L, long R, long start,long end){
return Math.max(0,Math.min(R,end) - Math.max(start,L) +1);
}
public static int calc(int[] list, int l ,int r, int x){
int ans = 0;
if(x<=list[l]) return r-l+1;
if(x>list[r]) return 0;
int lo = l;
int hi = r;
while(lo<=hi){
int mid = lo + (hi-lo)/2;
if(list[mid] >= x){
ans = mid;
hi = mid-1;
}
else lo = mid+1;
}
return r-ans+1;
}
public static int[] tinker(int[] list){
// ArrayList<Integer> re = new ArrayList<>();
ArrayList<Integer> temp = new ArrayList<>();
for (int i = 0; i < 10; i++) {
int j = (i+1)%10;
temp = new ArrayList<>();
int k = 0;
for (k = 0; k < list.length-1;) {
int a = list[k];
int b = list[k+1];
if(a==i && b==j){
change = true;
temp.add((j+1)%10);
k+=2;
}
else{
temp.add(a);
//if(k==(list.length-2)) temp.add(b);
k++;
}
}
if(k==list.length-1) temp.add(list[k]);
if(change){
int[] nlist = new int[temp.size()];
int io = 0;
for(int oi:temp) nlist[io++] = oi;
return nlist;
}
}
return null;
}
}
class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble(){
return Double.parseDouble(next());
}
public int[] readIntArray(int size){
int[] list = new int[size];
for(int i = 0;i<size;i++) list[i] = nextInt();
return list;
}
public long[] readLongArray(int size){
long[] list = new long[size];
for(int i = 0;i<size;i++) list[i] = nextLong();
return list;
}
public double[] readDoubleArray(int size){
double[] list = new double[size];
for(int i = 0;i<size;i++) list[i] = nextDouble();
return list;
}
public String linereader() {
String s = null;
try{
s = reader.readLine();
}
catch (IOException e) {
throw new RuntimeException(e);
}
return s;
}
}
class Pair<T extends Comparable<T>,K extends Comparable<K> > implements Comparable<Pair<T,K>>{
T first;
K second;
public Pair(T first, K second){
this.first = first;
this.second = second;
}
@Override
public String toString(){
return first+" "+second;
}
@Override
public int compareTo(Pair<T,K> o) {
// TODO Auto-generated method stub
if((first).compareTo(o.first)!=0) return first.compareTo(o.first);
else return second.compareTo(o.second);
}
} | ConDefects/ConDefects/Code/arc129_b/Java/27466468 |
condefects-java_data_1293 | import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
var map = new HashMap<Integer, Integer>();
int nowmax = 0;
int[] pre = new int[n + 1];
for (int i = 1; i <= n; i++) {
int now = in.nextInt();
if (!map.containsKey(now)){
nowmax++;
map.put(now, nowmax);
pre[i] = nowmax;
} else {
pre[i] = pre[i - 1];
}
}
int[] bpre = new int[n + 1];
int mx = 0, now = 0;
var set = new HashSet<Integer>();
for (int i = 1; i <= n; i++){
int btemp = in.nextInt();
if (!map.containsKey(btemp)){
mx = (int) (2e9);
} else {
now = map.get(btemp);
mx = (now > mx) ? now : mx;
set.add(now);
if (mx == set.size()) bpre[i] = mx;
}
}
int k = in.nextInt();
for (int i = 0; i < k; i++){
int x = in.nextInt();
int y = in.nextInt();
System.out.println(pre[x] == bpre[y] ? "YES" : "NO");
}
}
}
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
var map = new HashMap<Integer, Integer>();
int nowmax = 0;
int[] pre = new int[n + 1];
for (int i = 1; i <= n; i++) {
int now = in.nextInt();
if (!map.containsKey(now)){
nowmax++;
map.put(now, nowmax);
pre[i] = nowmax;
} else {
pre[i] = pre[i - 1];
}
}
int[] bpre = new int[n + 1];
int mx = 0, now = 0;
var set = new HashSet<Integer>();
for (int i = 1; i <= n; i++){
int btemp = in.nextInt();
if (!map.containsKey(btemp)){
mx = (int) (2e9);
} else {
now = map.get(btemp);
mx = (now > mx) ? now : mx;
set.add(now);
if (mx == set.size()) bpre[i] = mx;
}
}
int k = in.nextInt();
for (int i = 0; i < k; i++){
int x = in.nextInt();
int y = in.nextInt();
System.out.println(pre[x] == bpre[y] ? "Yes" : "No");
}
}
}
| ConDefects/ConDefects/Code/abc250_e/Java/35840794 |
condefects-java_data_1294 | import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] srgs){
Scanner scan = new Scanner(System.in);
int N = Integer.parseInt(scan.nextLine());
String[] stdata = new String[N];
for(int i=0;i<N;i++){
stdata[i] = scan.nextLine();
System.out.println(stdata[i]+" :2");
}
for(int i=0;i<N;i++){
String search = stdata[i];
for(int j=0;j<N;j++){
if(i!=j && search.equals(stdata[j])){
System.out.println("1");
end();
}
}
}
for(int i=0;i<N;i++){
String[] splitdata = stdata[i].split("");
if(!(splitdata[0].matches("H|D|C|S"))){
// System.out.println(splitdata[0]+" :2");
// System.out.println(stdata[i]+" :2");
end();
}
if(!splitdata[1].matches( "A|2|3|4|5|6|7|8|9|T|J|Q|K")){
end();
}
}
System.out.println("Yes");
}
public static void end(){
System.out.println("No");
System.exit(0);
}
}
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] srgs){
Scanner scan = new Scanner(System.in);
int N = Integer.parseInt(scan.nextLine());
String[] stdata = new String[N];
for(int i=0;i<N;i++){
stdata[i] = scan.nextLine();
}
for(int i=0;i<N;i++){
String search = stdata[i];
for(int j=0;j<N;j++){
if(i!=j && search.equals(stdata[j])){
end();
}
}
}
for(int i=0;i<N;i++){
String[] splitdata = stdata[i].split("");
if(!(splitdata[0].matches("H|D|C|S"))){
// System.out.println(splitdata[0]+" :2");
// System.out.println(stdata[i]+" :2");
end();
}
if(!splitdata[1].matches( "A|2|3|4|5|6|7|8|9|T|J|Q|K")){
end();
}
}
System.out.println("Yes");
}
public static void end(){
System.out.println("No");
System.exit(0);
}
}
| ConDefects/ConDefects/Code/abc277_b/Java/37037027 |
condefects-java_data_1295 | import java.util.Scanner;
import java.util.HashSet;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
HashSet<String> set = new HashSet<>();
boolean flag = true;
for(int i=0;i<N;i++){
String S = sc.next();
flag &= S.charAt(0)=='H'||S.charAt(0)=='D'||S.charAt(0)=='C'||S.charAt(0)=='S';
flag &= '2'<=S.charAt(1)&&S.charAt(1)<='9'||S.charAt(1)=='A'||S.charAt(1)=='J'||S.charAt(1)=='Q'||S.charAt(1)=='K';
set.add(S);
}
System.out.println(flag&&set.size()==N?"Yes":"No");
}
}
import java.util.Scanner;
import java.util.HashSet;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
HashSet<String> set = new HashSet<>();
boolean flag = true;
for(int i=0;i<N;i++){
String S = sc.next();
flag &= S.charAt(0)=='H'||S.charAt(0)=='D'||S.charAt(0)=='C'||S.charAt(0)=='S';
flag &= ('2'<=S.charAt(1)&&S.charAt(1)<='9')||S.charAt(1)=='A'||S.charAt(1)=='T'||S.charAt(1)=='J'||S.charAt(1)=='Q'||S.charAt(1)=='K';
set.add(S);
}
System.out.println(flag&&set.size()==N?"Yes":"No");
}
}
| ConDefects/ConDefects/Code/abc277_b/Java/37378925 |
condefects-java_data_1296 | import java.util.*;
import java.util.regex.*;
class Main {
static int n;
public static int sum (int x) {
if (x == 0) {
return x;
}
return x - 1 + sum(x - 1);
}
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
n = Integer.parseInt(sc.next());
List<String> s = new ArrayList<>();
String ans = "No";
int cnt = 0;
for (int i = 0; i < n; i++) {
s.add(sc.next());
}
if (n == 1) {
if (Pattern.matches("[SDCH][ATJQK2-9]", s.get(0))) {
ans = "Yes";
}
} else {
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (Pattern.matches("[SDCH][ATJQK2-9]", s.get(i))) {
if (s.get(i).equals(s.get(j))) {
continue;
} else {
cnt++;
// System.out.println(cnt);
}
}
}
}
}
if (cnt == sum(n) && n != 1) {
ans = "Yes";
}
System.out.println(ans);
//System.out.println(sum(2));
//System.out.println(cnt);
}
}
import java.util.*;
import java.util.regex.*;
class Main {
static int n;
public static int sum (int x) {
if (x == 0) {
return x;
}
return x - 1 + sum(x - 1);
}
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
n = Integer.parseInt(sc.next());
List<String> s = new ArrayList<>();
String ans = "No";
int cnt = 0;
for (int i = 0; i < n; i++) {
s.add(sc.next());
}
if (n == 1) {
if (Pattern.matches("[SDCH][ATJQK2-9]", s.get(0))) {
ans = "Yes";
}
} else {
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (Pattern.matches("[SDCH][ATJQK2-9]", s.get(i)) && Pattern.matches("[SDCH][ATJQK2-9]", s.get(j))) {
if (s.get(i).equals(s.get(j))) {
continue;
} else {
cnt++;
// System.out.println(cnt);
}
}
}
}
}
if (cnt == sum(n) && n != 1) {
ans = "Yes";
}
System.out.println(ans);
//System.out.println(sum(2));
//System.out.println(cnt);
}
}
| ConDefects/ConDefects/Code/abc277_b/Java/42085215 |
condefects-java_data_1297 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({"unused"})
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final int N = getNextInt();
final int M = getNextInt();
final int[] A = getIntArray(N);
final int[][] UV = get2dIntArray(M, 2, i -> i - 1);
final UnionFindTree sameAuft = new UnionFindTree(N);
for(int edge = 0; edge < M; edge++) {
if(A[UV[edge][0]] == A[UV[edge][1]]) {
sameAuft.unite(UV[edge][0], UV[edge][1]);
}
}
final List<List<Integer>> increasingEdgeList = Stream.generate(ArrayList<Integer>::new).limit(N).collect(Collectors.toCollection(ArrayList::new));
for(int edge = 0; edge < M; edge++) {
if(A[UV[edge][0]] < A[UV[edge][1]]) {
increasingEdgeList.get(sameAuft.getRoot(UV[edge][0])).add(sameAuft.getRoot(UV[edge][1]));
} else if(A[UV[edge][0]] > A[UV[edge][1]]) {
increasingEdgeList.get(sameAuft.getRoot(UV[edge][1])).add(sameAuft.getRoot(UV[edge][0]));
}
}
final PriorityQueue<int[]> pq = new PriorityQueue<>((e1, e2) -> e1[0] == e2[0] ? e2[2] - e1[2] : e1[0] - e2[0]);
final boolean[] passed = new boolean[N];
pq.add(new int[] {A[sameAuft.getRoot(0)], sameAuft.getRoot(0), 1});
int result = 0;
while(!pq.isEmpty()) {
final int[] pqGet = pq.poll();
final int vertex = pqGet[1];
final int step = pqGet[2];
if(vertex == N - 1) {
result = step;
break;
}
if(passed[vertex]) {
continue;
}
passed[vertex] = true;
for(int next: increasingEdgeList.get(vertex)) {
if(!passed[next]) {
pq.add(new int[] {A[next], next, step + 1});
}
}
}
println(result);
flush();
}
private static class UnionFindTree {
int[] parent;
int[] size;
int[] dist;
int unionCount;
UnionFindTree(int size) {
super();
this.parent = new int[size];
this.size = new int[size];
this.dist = new int[size];
clear();
}
UnionFindTree(UnionFindTree other) {
this.parent = Arrays.copyOf(other.parent, other.parent.length);
this.size = Arrays.copyOf(other.size, other.size.length);
this.dist = Arrays.copyOf(other.dist, other.dist.length);
this.unionCount = other.unionCount;
}
void clear() {
Arrays.fill(this.parent, -1);
Arrays.fill(this.size, 1);
Arrays.fill(this.dist, 0);
unionCount = this.size.length;
}
int getRoot(int node) {
if (parent[node] == -1) {
return node;
} else {
int prevParent = parent[node];
parent[node] = getRoot(parent[node]);
dist[node] += dist[prevParent];
return parent[node];
}
}
int getDist(int node) {
if(parent[node] == -1) {
return dist[node];
} else {
getRoot(node);
return dist[node];
}
}
boolean hasLink(int x, int y) {
return getRoot(x) == getRoot(y);
}
final void unite(int x, int y) {
unite(x, y, 0);
}
final void unite(int x, int y, int p) {
int rootx = getRoot(x);
int rooty = getRoot(y);
if (rootx == rooty) {
return;
}
if (size[rootx] < size[rooty]) {
int tmp = rootx;
rootx = rooty;
rooty = tmp;
tmp = x;
x = y;
y = tmp;
}
parent[rooty] = rootx;
dist[rooty] = p + dist[x] - dist[y];
size[rootx] += size[rooty];
unionCount--;
}
int getSize(int x) {
return size[getRoot(x)];
}
int getUnionCount() {
return unionCount;
}
}
// 以下Utility
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static int[] concat(int[]... arys) {
IntStream st = Arrays.stream(arys[0]);
for(int idx = 1; idx < arys.length; idx++) {
st = IntStream.concat(st, Arrays.stream(arys[idx]));
}
return st.toArray();
}
@SafeVarargs
private static <E> List<E> concat(List<E>... lists) {
Stream<E> st = lists[0].stream();
for(int idx = 1; idx < lists.length; idx++) {
st = Stream.concat(st, lists[idx].stream());
}
return st.collect(Collectors.toList());
}
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if(readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for(int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for(int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for(int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for(Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({"unused"})
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final int N = getNextInt();
final int M = getNextInt();
final int[] A = getIntArray(N);
final int[][] UV = get2dIntArray(M, 2, i -> i - 1);
final UnionFindTree sameAuft = new UnionFindTree(N);
for(int edge = 0; edge < M; edge++) {
if(A[UV[edge][0]] == A[UV[edge][1]]) {
sameAuft.unite(UV[edge][0], UV[edge][1]);
}
}
final List<List<Integer>> increasingEdgeList = Stream.generate(ArrayList<Integer>::new).limit(N).collect(Collectors.toCollection(ArrayList::new));
for(int edge = 0; edge < M; edge++) {
if(A[UV[edge][0]] < A[UV[edge][1]]) {
increasingEdgeList.get(sameAuft.getRoot(UV[edge][0])).add(sameAuft.getRoot(UV[edge][1]));
} else if(A[UV[edge][0]] > A[UV[edge][1]]) {
increasingEdgeList.get(sameAuft.getRoot(UV[edge][1])).add(sameAuft.getRoot(UV[edge][0]));
}
}
final PriorityQueue<int[]> pq = new PriorityQueue<>((e1, e2) -> e1[0] == e2[0] ? e2[2] - e1[2] : e1[0] - e2[0]);
final boolean[] passed = new boolean[N];
pq.add(new int[] {A[sameAuft.getRoot(0)], sameAuft.getRoot(0), 1});
int result = 0;
while(!pq.isEmpty()) {
final int[] pqGet = pq.poll();
final int vertex = pqGet[1];
final int step = pqGet[2];
if(vertex == sameAuft.getRoot(N - 1)) {
result = step;
break;
}
if(passed[vertex]) {
continue;
}
passed[vertex] = true;
for(int next: increasingEdgeList.get(vertex)) {
if(!passed[next]) {
pq.add(new int[] {A[next], next, step + 1});
}
}
}
println(result);
flush();
}
private static class UnionFindTree {
int[] parent;
int[] size;
int[] dist;
int unionCount;
UnionFindTree(int size) {
super();
this.parent = new int[size];
this.size = new int[size];
this.dist = new int[size];
clear();
}
UnionFindTree(UnionFindTree other) {
this.parent = Arrays.copyOf(other.parent, other.parent.length);
this.size = Arrays.copyOf(other.size, other.size.length);
this.dist = Arrays.copyOf(other.dist, other.dist.length);
this.unionCount = other.unionCount;
}
void clear() {
Arrays.fill(this.parent, -1);
Arrays.fill(this.size, 1);
Arrays.fill(this.dist, 0);
unionCount = this.size.length;
}
int getRoot(int node) {
if (parent[node] == -1) {
return node;
} else {
int prevParent = parent[node];
parent[node] = getRoot(parent[node]);
dist[node] += dist[prevParent];
return parent[node];
}
}
int getDist(int node) {
if(parent[node] == -1) {
return dist[node];
} else {
getRoot(node);
return dist[node];
}
}
boolean hasLink(int x, int y) {
return getRoot(x) == getRoot(y);
}
final void unite(int x, int y) {
unite(x, y, 0);
}
final void unite(int x, int y, int p) {
int rootx = getRoot(x);
int rooty = getRoot(y);
if (rootx == rooty) {
return;
}
if (size[rootx] < size[rooty]) {
int tmp = rootx;
rootx = rooty;
rooty = tmp;
tmp = x;
x = y;
y = tmp;
}
parent[rooty] = rootx;
dist[rooty] = p + dist[x] - dist[y];
size[rootx] += size[rooty];
unionCount--;
}
int getSize(int x) {
return size[getRoot(x)];
}
int getUnionCount() {
return unionCount;
}
}
// 以下Utility
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static int[] concat(int[]... arys) {
IntStream st = Arrays.stream(arys[0]);
for(int idx = 1; idx < arys.length; idx++) {
st = IntStream.concat(st, Arrays.stream(arys[idx]));
}
return st.toArray();
}
@SafeVarargs
private static <E> List<E> concat(List<E>... lists) {
Stream<E> st = lists[0].stream();
for(int idx = 1; idx < lists.length; idx++) {
st = Stream.concat(st, lists[idx].stream());
}
return st.collect(Collectors.toList());
}
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if(readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for(int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for(int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for(int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows).collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for(int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for(Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
| ConDefects/ConDefects/Code/abc335_e/Java/49393000 |
condefects-java_data_1298 | import java.io.*;
import java.util.*;
class Main {
int N, M;
int[] A;
UnionFind uf;
@SuppressWarnings("unchecked")
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1];
uf = new UnionFind(N);
A = nextInts();
List<int[]>[] no = new List[200001]; Arrays.setAll(no, i -> new ArrayList<>());
for (int i = 0; i < M; i++) {
int[] uv = nextInts();
int u = uv[0] - 1, v = uv[1] - 1;
if (A[u] == A[v]) uf.connect(u, v);
if (A[u] < A[v]) no[A[u]].add(new int[] {u, v});
if (A[u] > A[v]) no[A[v]].add(new int[] {v, u});
}
var dp = new int[N]; Arrays.fill(dp, -1);
int r0 = uf.getRoot(0);
dp[r0] = 1;
for (var n: no) {
for (int[] uv: n) {
int u = uf.getRoot(uv[0]), v = uf.getRoot(uv[1]);
if (dp[u] > 0) dp[v] = Math.max(dp[v], dp[u]+1);
}
}
System.out.println(dp[uf.getRoot(N-1)]);
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
final class UnionFind {
int[] size, parent;
UnionFind(int n) {
size = new int[n];
parent = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
size[i] = 1;
}
}
boolean isConnected(int x, int y) {
return getRoot(x) == getRoot(y);
}
boolean connect(int x, int y) {
int ix = getRoot(x);
int iy = getRoot(y);
if (ix == iy) return false;
if (size[ix] > size[iy]) {
parent[iy] = ix;
size[ix] += size[iy];
} else {
parent[ix] = iy;
size[iy] += size[ix];
}
return true;
}
int getRoot(int x) {
if (x != parent[x]) {
parent[x] = getRoot(parent[x]);
}
return parent[x];
}
int size(int x) { return size[getRoot(x)]; }
}
import java.io.*;
import java.util.*;
class Main {
int N, M;
int[] A;
UnionFind uf;
@SuppressWarnings("unchecked")
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1];
uf = new UnionFind(N);
A = nextInts();
List<int[]>[] no = new List[200001]; Arrays.setAll(no, i -> new ArrayList<>());
for (int i = 0; i < M; i++) {
int[] uv = nextInts();
int u = uv[0] - 1, v = uv[1] - 1;
if (A[u] == A[v]) uf.connect(u, v);
if (A[u] < A[v]) no[A[u]].add(new int[] {u, v});
if (A[u] > A[v]) no[A[v]].add(new int[] {v, u});
}
var dp = new int[N];
int r0 = uf.getRoot(0);
dp[r0] = 1;
for (var n: no) {
for (int[] uv: n) {
int u = uf.getRoot(uv[0]), v = uf.getRoot(uv[1]);
if (dp[u] > 0) dp[v] = Math.max(dp[v], dp[u]+1);
}
}
System.out.println(dp[uf.getRoot(N-1)]);
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
final class UnionFind {
int[] size, parent;
UnionFind(int n) {
size = new int[n];
parent = new int[n];
for (int i = 0; i < n; i++) {
parent[i] = i;
size[i] = 1;
}
}
boolean isConnected(int x, int y) {
return getRoot(x) == getRoot(y);
}
boolean connect(int x, int y) {
int ix = getRoot(x);
int iy = getRoot(y);
if (ix == iy) return false;
if (size[ix] > size[iy]) {
parent[iy] = ix;
size[ix] += size[iy];
} else {
parent[ix] = iy;
size[iy] += size[ix];
}
return true;
}
int getRoot(int x) {
if (x != parent[x]) {
parent[x] = getRoot(parent[x]);
}
return parent[x];
}
int size(int x) { return size[getRoot(x)]; }
}
| ConDefects/ConDefects/Code/abc335_e/Java/49240128 |
condefects-java_data_1299 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
int[] a = new int[n];
for(int i = 0; i < n; i++) a[i] = Integer.parseInt(sc.next());
List<List<Integer>> g = new ArrayList<List<Integer>>();
for(int i = 0; i < n; i++) g.add(new ArrayList<Integer>());
for(int i = 0; i < m; i++) {
int u = Integer.parseInt(sc.next());
int v = Integer.parseInt(sc.next());
u--;v--;
g.get(u).add(v);
g.get(v).add(u);
}
int[] dist = new int[n];
boolean[] used = new boolean[n];
final int INF = 1 << 30;
Arrays.fill(dist, -INF);
dist[0] = 1;
PriorityQueue<Integer[]> pq = new PriorityQueue<Integer[]>((u, v) -> {
if(Integer.compare(u[0], v[0]) == 0) {
return Integer.compare(v[1], u[1]);
}
return Integer.compare(u[0], v[0]);
});
pq.add(new Integer[] {a[0], -dist[0], 0});
while(!pq.isEmpty()) {
int v = pq.peek()[2];
pq.poll();
if(used[v]) continue;
used[v] = true;
for(int to : g.get(v)) {
if(a[v] <= a[to]) {
dist[to] = Math.max(dist[to], dist[v] + (a[v] != a[to] ? 1 : 0));
pq.add(new Integer[] {a[to], -dist[to], to});
}
}
}
System.out.println(Math.max(dist[n - 1], 0));
}
}
static class UnionFind{
private int[] par;
private int[] siz;
public UnionFind(int n) {
par = new int[n];
siz= new int[n];
Arrays.fill(par, -1);
Arrays.fill(siz, 1);
}
public int root(int x) {
if(par[x] == -1) return x;
return par[x] = root(par[x]);
}
public boolean same(int x, int y) {
return root(x) == root(y);
}
public int siz(int x) {
return siz[root(x)];
}
public boolean unite(int x, int y) {
x = root(x);
y = root(y);
if(x == y) return false;
if(siz[x] > siz[y]) {
int tmp = x;
x = y;
y = tmp;
}
par[x] = y;
siz[y] += siz[x];
return true;
}
}
}
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
int[] a = new int[n];
for(int i = 0; i < n; i++) a[i] = Integer.parseInt(sc.next());
List<List<Integer>> g = new ArrayList<List<Integer>>();
for(int i = 0; i < n; i++) g.add(new ArrayList<Integer>());
for(int i = 0; i < m; i++) {
int u = Integer.parseInt(sc.next());
int v = Integer.parseInt(sc.next());
u--;v--;
g.get(u).add(v);
g.get(v).add(u);
}
int[] dist = new int[n];
boolean[] used = new boolean[n];
final int INF = 1 << 30;
Arrays.fill(dist, -INF);
dist[0] = 1;
PriorityQueue<Integer[]> pq = new PriorityQueue<Integer[]>((u, v) -> {
if(Integer.compare(u[0], v[0]) == 0) {
return Integer.compare(u[1], v[1]);
}
return Integer.compare(u[0], v[0]);
});
pq.add(new Integer[] {a[0], -dist[0], 0});
while(!pq.isEmpty()) {
int v = pq.peek()[2];
pq.poll();
if(used[v]) continue;
used[v] = true;
for(int to : g.get(v)) {
if(a[v] <= a[to]) {
dist[to] = Math.max(dist[to], dist[v] + (a[v] != a[to] ? 1 : 0));
pq.add(new Integer[] {a[to], -dist[to], to});
}
}
}
System.out.println(Math.max(dist[n - 1], 0));
}
}
static class UnionFind{
private int[] par;
private int[] siz;
public UnionFind(int n) {
par = new int[n];
siz= new int[n];
Arrays.fill(par, -1);
Arrays.fill(siz, 1);
}
public int root(int x) {
if(par[x] == -1) return x;
return par[x] = root(par[x]);
}
public boolean same(int x, int y) {
return root(x) == root(y);
}
public int siz(int x) {
return siz[root(x)];
}
public boolean unite(int x, int y) {
x = root(x);
y = root(y);
if(x == y) return false;
if(siz[x] > siz[y]) {
int tmp = x;
x = y;
y = tmp;
}
par[x] = y;
siz[y] += siz[x];
return true;
}
}
}
| ConDefects/ConDefects/Code/abc335_e/Java/52280841 |
condefects-java_data_1300 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.ArrayList;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int M = in.it();
int[] A = in.idx(N);
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < N;i++)
g.add(new ArrayList<>());
for (int i = 0;i < M;i++) {
int u = in.idx();
int v = in.idx();
g.get(u).add(v);
g.get(v).add(u);
}
List<List<Integer>> list = new ArrayList<>();
for (int i = 0;i < 200000;i++)
list.add(new ArrayList<>());
for (int i = 0;i < N;i++)
list.get(A[i]).add(i);
int[] num = new int[N];
fill(num,-infI);
num[0] = 1;
for (var que:list) {
que.sort(Comparator.comparing(i -> num[i]));
while (!que.isEmpty()) {
int u = que.remove(que.size() -1);
for (int v:g.get(u)) {
if (A[u] > A[v])
continue;
if (A[u] == A[v] && num[v] < num[u]) {
num[v] = num[u];
que.add(v);
}
if (A[u] < A[v] && num[v] < num[u] +1)
num[v] = num[u] +1;
}
}
}
return num[N -1];
}
<T extends BaseV> void log(AVLTree<Data> seg,int n){
Data[] a = new Data[n];
for (int i = 0;i < n;i++)
a[i] = seg.get(i);
for (int i = 1;i < n;i++)
assert a[i -1].v < a[i].v;
log.println(a);
}
private long hash(int[] A){
long ret = 0;
for (var a:A) {
ret = mul(ret,mod) +a;
if (ret >= MOD)
ret -= MOD;
}
return ret;
}
final static long MASK30 = (1L <<30) -1;
final static long MASK31 = (1L <<31) -1;
final static long MOD = (1L <<61) -1;
private static long mul(final long l,final long r){
final long lu = l >>31;
final long ld = l &MASK31;
final long ru = r >>31;
final long rd = r &MASK31;
final long middleBit = ld *ru +lu *rd;
return mod((lu *ru <<1) +ld *rd +((middleBit &MASK30) <<31) +(middleBit >>30));
}
private static long mod(long val){
while (val < 0)
val += MOD;
val = (val &MOD) +(val >>61);
return val > MOD ? val -MOD : val;
}
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
class RollingHash{
private static long MASK30 = (1L <<30) -1;
private static long MASK31 = (1L <<31) -1;
private static long MOD = (1L <<61) -1;
public static long m = base();
private static long[] pow = {1};
int n;
private long[] hash,S;
private boolean updatable;
private RollingHash rev;
public RollingHash(char[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(int[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(long[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(int n,IntToLongFunction f,boolean updatale){
S = new long[n];
updatable = updatale;
this.n = S.length;
hash = new long[n +1];
setPow(n);
for (int i = 0;i < n;i++)
set(i,f.applyAsLong(i));
}
public long get(int l,int r){
if (l > r)
return (rev == null ? rev = rev() : rev).get(n -l,n -r);
return mod(hash(r) -mul(hash(l),pow[r -l]));
}
public void upd(int i,long v){
assert updatable;
set(i,v);
if (rev != null)
rev.set(n -i -1,v);
}
private void set(int i,long v){
if (updatable)
for (int x = i +1;x <= n;x += x &-x)
hash[x] = mod(hash[x] +mul(v -S[i],pow[x -i -1]));
else
hash[i +1] = mod(mul(hash[i],m) +v);
S[i] = v;
}
private long hash(int i){
long ret = 0;
if (updatable)
for (int x = i;x > 0;x -= x &-x)
ret = mod(ret +mul(hash[x],pow[i -x]));
else
ret = hash[i];
return ret;
}
private void setPow(int n){
if (n < pow.length)
return;
int s = pow.length;
pow = copyOf(pow,max(pow.length <<1,n +1));
for (int i = s;i < pow.length;i++)
pow[i] = mul(pow[i -1],m);
}
private RollingHash rev(){
long[] s = new long[n];
for (int i = 0;i < n;i++)
s[i] = S[n -1 -i];
return new RollingHash(s,updatable);
}
private static long mul(long a,long b){
long lu = a >>31;
long ld = a &MASK31;
long ru = b >>31;
long rd = b &MASK31;
long mid = ld *ru +lu *rd;
return mod((lu *ru <<1) +ld *rd +((mid &MASK30) <<31) +(mid >>30));
}
private static long mod(long val){
while (val < 0)
val += MOD;
val = (val &MOD) +(val >>61);
return val > MOD ? val -MOD : val;
}
private static long pow(long x,long n){
long ret = 1;
do {
if ((n &1) == 1)
ret = mul(ret,x);
x = mul(x,x);
} while (0 < (n >>= 1));
return ret;
}
private static long base(){
long m = 0;
for (int k = 1;m < Util.infI;m = pow(37,k))
while (!isPrimeRoot(k))
k = ThreadLocalRandom.current().nextInt(Util.infI);
return m;
}
private static boolean isPrimeRoot(long a){
long b = MOD -1;
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a > 1;
}
}
abstract class AVLTree<V extends BaseV> {
private V e = e(),t = e();
private Node root;
private Comparator<V> cmp;
public AVLTree(){ this(Util.cast(Comparator.naturalOrder())); }
public AVLTree(Comparator<V> cmp){ this.cmp = cmp; }
public void add(V v){
if (root == null)
root = new Node(v,1);
else
root = add(root,v);
}
private Node add(Node nd,V v){
if (nd.leaf) {
int c = cmp.compare(nd.val,v);
if (c == 0) {
nd.sz++;
return nd;
} else {
var ret = new Node(e(),0);
ret.cld(-c,new Node(v,1));
ret.cld(c,nd);
nd = ret;
}
} else {
int c = cmp.compare(v,nd.rht.l);
nd.cld(-1,c < 0 ? add(nd.lft,v) : nd.lft);
nd.cld(1,c < 0 ? nd.rht : add(nd.rht,v));
}
return balance(nd);
}
public V del(V v){
var ret = e();
root = del(ret,root,v);
return ret;
}
private Node del(V ret,Node nd,V v){
if (nd.leaf) {
int c = cmp.compare(nd.val,v);
if (c == 0) {
nd.sz--;
ag(ret,e,nd.val);
}
return c != 0 || 0 < nd.sz ? nd : null;
}
int c = cmp.compare(v,nd.rht.l) *2 +1;
Node del = del(ret,c < 0 ? nd.lft : nd.rht,v);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.leaf)
ag(ret,ret,pw(nd.val,r -l));
else {
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
for (ag(t,e,a);0 < n;n >>= 1,ag(t,t,t))
if (0 < (n &1))
ag(v,v,t);
}
private V pw(V a,int n){
V ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis);
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int bis,rnk;
private int sz;
private V val,l;
private Node lft,rht;
private boolean leaf = true;
private Node(V val,int sz){
this.sz = sz;
this.val = l = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
l = lft.l;
sz = val.sz;
leaf = false;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return leaf && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class KetaDp<T> {
private int B;
private int[] N;
private T[] dp;
public KetaDp(char[] N){ this(N,10); }
public KetaDp(char[] N,int B){
this.N = new int[N.length];
for (int i = 0;i < N.length;i++)
this.N[i] = N[i] -'0';
dp = Util.cast(Array.newInstance(init().getClass(),N.length +1 <<1));
this.B = B;
setAll(dp,i -> init());
}
protected abstract T init();
protected abstract void f(T pd,T dp,int n,int k);
protected void mod(T dp){}
public T get(int i,int same){ return dp[i *2 +same]; }
public void calc(){
for (int i = 0;i < N.length;i++) {
int t = N[i];
for (int n = 0;n < B;n++) {
if (n == t)
f(get(i +1,1),get(i,1),n,N.length -1 -i);
if (n < t)
f(get(i +1,0),get(i,1),n,N.length -1 -i);
if (0 < i)
f(get(i +1,0),get(i,0),n,N.length -1 -i);
}
mod(get(i +1,0));
mod(get(i +1,1));
}
}
}
abstract class LazySegmentTree<V extends BaseV, F> extends Seg<V, F>{
public LazySegmentTree(int n){ super(n); }
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
up(l,r);
}
@Override
public V get(int i){ return get(i,i +1); }
@Override
public V get(int l,int r){
down(l,r);
return super.get(l,r);
}
}
abstract class Seg<V extends BaseV, F> {
private int n,log;
private V[] val;
private F[] lazy;
protected Seg(int n){
this.n = n;
while (1 <<log <= n)
log++;
val = Util.cast(new BaseV[n <<1]);
lazy = Util.cast(new Object[n]);
for (int i = -1;++i < n;)
(val[i +n] = init(i)).sz = 1;
for (int i = n;--i > 0;merge(i))
(val[i] = e()).sz = val[i <<1].sz +val[i <<1 |1].sz;
}
public void upd(int i,F f){ prop(i +n,f); }
public void upd(int l,int r,F f){
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
prop(l++,f);
if ((r &1) == 1)
prop(--r,f);
}
}
public V get(int i){ return val[i +n]; }
public V get(int l,int r){
V[] ret = Util.cast(new BaseV[]{e(), e()});
int i = 0;
for (var v:getList(l,r)) {
agg(ret[i],ret[i ^1],v);
ret[i].sz = ret[i ^= 1].sz +v.sz;
}
return ret[i ^1];
}
public V[] getList(int l,int r){
int sz = 0;
for (int li = l += n,ri = r += n;li < ri;li = li +1 >>1,ri >>= 1)
sz += (li &1) +(ri &1);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (int i = 0;l < r;l >>= 1,r >>= 1) {
if ((l &1) > 0)
arr[i++] = val[l++];
if ((r &1) > 0)
arr[--sz] = val[--r];
}
return arr;
}
public V[] getPath(int i){
int sz = 32 -Integer.numberOfLeadingZeros(i +n);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (i += n;0 < i;i >>= 1)
arr[--sz] = val[i];
return arr;
}
protected V init(int i){ return e(); }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
protected void up(int l,int r){
for (l = oddPart(l +n),r = oddPart(r +n);l != r;)
merge(l > r ? (l >>= 1) : (r >>= 1));
while (1 < l)
merge(l >>= 1);
}
protected void down(int l,int r){
int i = log;
for (l = oddPart(l +n),r = oddPart(r +n);i > 0;i--) {
push(l >>i);
push(r >>i);
}
}
private void merge(int i){ agg(val[i],val[i <<1],val[i <<1 |1]); }
private void push(int i){
if (lazy[i] != null) {
prop(i <<1,lazy[i]);
prop(i <<1 |1,lazy[i]);
lazy[i] = null;
}
}
private void prop(int i,F f){
map(val[i],f);
if (i < n) {
lazy[i] = lazy[i] == null ? f : comp(lazy[i],f);
if (val[i].fail) {
push(i);
merge(i);
}
}
}
private int oddPart(int i){ return i /(i &-i); }
}
abstract class SegmentTree<V extends BaseV, F> extends Seg<V, F>{
public SegmentTree(int n){ super(n); }
@Override
protected F comp(F f,F g){ return null; }
@Override
public void upd(int i,F f){
super.upd(i,f);
up(i,i +1);
}
}
abstract class DualSegmentTree<V extends BaseV, F> extends Seg<V, F>{
public DualSegmentTree(int n){ super(n); }
@Override
protected void agg(V v,V a,V b){}
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
}
@Override
public V get(int i){
down(i,i +1);
return super.get(i);
}
}
class UnionFind{
int num;
protected int[] dat;
protected int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
public int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
public boolean same(int u,int v){ return root(u) == root(v); }
public boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
public int size(int x){ return -dat[root(x)]; }
public int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[n]); }
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){ return copyOf(arr,sz); }
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long inv(long x,long mod){ return pow(x,mod -2,mod); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
public int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.ArrayList;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends BaseSolver{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
public Object solve(){
int N = in.it();
int M = in.it();
int[] A = in.idx(N);
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < N;i++)
g.add(new ArrayList<>());
for (int i = 0;i < M;i++) {
int u = in.idx();
int v = in.idx();
g.get(u).add(v);
g.get(v).add(u);
}
List<List<Integer>> list = new ArrayList<>();
for (int i = 0;i < 200000;i++)
list.add(new ArrayList<>());
for (int i = 0;i < N;i++)
list.get(A[i]).add(i);
int[] num = new int[N];
fill(num,-infI);
num[0] = 1;
for (var que:list) {
que.sort(Comparator.comparing(i -> num[i]));
while (!que.isEmpty()) {
int u = que.remove(que.size() -1);
for (int v:g.get(u)) {
if (A[u] > A[v])
continue;
if (A[u] == A[v] && num[v] < num[u]) {
num[v] = num[u];
que.add(v);
}
if (A[u] < A[v] && num[v] < num[u] +1)
num[v] = num[u] +1;
}
}
}
return max(0,num[N -1]);
}
<T extends BaseV> void log(AVLTree<Data> seg,int n){
Data[] a = new Data[n];
for (int i = 0;i < n;i++)
a[i] = seg.get(i);
for (int i = 1;i < n;i++)
assert a[i -1].v < a[i].v;
log.println(a);
}
private long hash(int[] A){
long ret = 0;
for (var a:A) {
ret = mul(ret,mod) +a;
if (ret >= MOD)
ret -= MOD;
}
return ret;
}
final static long MASK30 = (1L <<30) -1;
final static long MASK31 = (1L <<31) -1;
final static long MOD = (1L <<61) -1;
private static long mul(final long l,final long r){
final long lu = l >>31;
final long ld = l &MASK31;
final long ru = r >>31;
final long rd = r &MASK31;
final long middleBit = ld *ru +lu *rd;
return mod((lu *ru <<1) +ld *rd +((middleBit &MASK30) <<31) +(middleBit >>30));
}
private static long mod(long val){
while (val < 0)
val += MOD;
val = (val &MOD) +(val >>61);
return val > MOD ? val -MOD : val;
}
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
class RollingHash{
private static long MASK30 = (1L <<30) -1;
private static long MASK31 = (1L <<31) -1;
private static long MOD = (1L <<61) -1;
public static long m = base();
private static long[] pow = {1};
int n;
private long[] hash,S;
private boolean updatable;
private RollingHash rev;
public RollingHash(char[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(int[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(long[] S,boolean updatable){ this(S.length,i -> S[i],updatable); }
public RollingHash(int n,IntToLongFunction f,boolean updatale){
S = new long[n];
updatable = updatale;
this.n = S.length;
hash = new long[n +1];
setPow(n);
for (int i = 0;i < n;i++)
set(i,f.applyAsLong(i));
}
public long get(int l,int r){
if (l > r)
return (rev == null ? rev = rev() : rev).get(n -l,n -r);
return mod(hash(r) -mul(hash(l),pow[r -l]));
}
public void upd(int i,long v){
assert updatable;
set(i,v);
if (rev != null)
rev.set(n -i -1,v);
}
private void set(int i,long v){
if (updatable)
for (int x = i +1;x <= n;x += x &-x)
hash[x] = mod(hash[x] +mul(v -S[i],pow[x -i -1]));
else
hash[i +1] = mod(mul(hash[i],m) +v);
S[i] = v;
}
private long hash(int i){
long ret = 0;
if (updatable)
for (int x = i;x > 0;x -= x &-x)
ret = mod(ret +mul(hash[x],pow[i -x]));
else
ret = hash[i];
return ret;
}
private void setPow(int n){
if (n < pow.length)
return;
int s = pow.length;
pow = copyOf(pow,max(pow.length <<1,n +1));
for (int i = s;i < pow.length;i++)
pow[i] = mul(pow[i -1],m);
}
private RollingHash rev(){
long[] s = new long[n];
for (int i = 0;i < n;i++)
s[i] = S[n -1 -i];
return new RollingHash(s,updatable);
}
private static long mul(long a,long b){
long lu = a >>31;
long ld = a &MASK31;
long ru = b >>31;
long rd = b &MASK31;
long mid = ld *ru +lu *rd;
return mod((lu *ru <<1) +ld *rd +((mid &MASK30) <<31) +(mid >>30));
}
private static long mod(long val){
while (val < 0)
val += MOD;
val = (val &MOD) +(val >>61);
return val > MOD ? val -MOD : val;
}
private static long pow(long x,long n){
long ret = 1;
do {
if ((n &1) == 1)
ret = mul(ret,x);
x = mul(x,x);
} while (0 < (n >>= 1));
return ret;
}
private static long base(){
long m = 0;
for (int k = 1;m < Util.infI;m = pow(37,k))
while (!isPrimeRoot(k))
k = ThreadLocalRandom.current().nextInt(Util.infI);
return m;
}
private static boolean isPrimeRoot(long a){
long b = MOD -1;
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a > 1;
}
}
abstract class AVLTree<V extends BaseV> {
private V e = e(),t = e();
private Node root;
private Comparator<V> cmp;
public AVLTree(){ this(Util.cast(Comparator.naturalOrder())); }
public AVLTree(Comparator<V> cmp){ this.cmp = cmp; }
public void add(V v){
if (root == null)
root = new Node(v,1);
else
root = add(root,v);
}
private Node add(Node nd,V v){
if (nd.leaf) {
int c = cmp.compare(nd.val,v);
if (c == 0) {
nd.sz++;
return nd;
} else {
var ret = new Node(e(),0);
ret.cld(-c,new Node(v,1));
ret.cld(c,nd);
nd = ret;
}
} else {
int c = cmp.compare(v,nd.rht.l);
nd.cld(-1,c < 0 ? add(nd.lft,v) : nd.lft);
nd.cld(1,c < 0 ? nd.rht : add(nd.rht,v));
}
return balance(nd);
}
public V del(V v){
var ret = e();
root = del(ret,root,v);
return ret;
}
private Node del(V ret,Node nd,V v){
if (nd.leaf) {
int c = cmp.compare(nd.val,v);
if (c == 0) {
nd.sz--;
ag(ret,e,nd.val);
}
return c != 0 || 0 < nd.sz ? nd : null;
}
int c = cmp.compare(v,nd.rht.l) *2 +1;
Node del = del(ret,c < 0 ? nd.lft : nd.rht,v);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.leaf)
ag(ret,ret,pw(nd.val,r -l));
else {
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
for (ag(t,e,a);0 < n;n >>= 1,ag(t,t,t))
if (0 < (n &1))
ag(v,v,t);
}
private V pw(V a,int n){
V ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis);
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int bis,rnk;
private int sz;
private V val,l;
private Node lft,rht;
private boolean leaf = true;
private Node(V val,int sz){
this.sz = sz;
this.val = l = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
l = lft.l;
sz = val.sz;
leaf = false;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return leaf && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class KetaDp<T> {
private int B;
private int[] N;
private T[] dp;
public KetaDp(char[] N){ this(N,10); }
public KetaDp(char[] N,int B){
this.N = new int[N.length];
for (int i = 0;i < N.length;i++)
this.N[i] = N[i] -'0';
dp = Util.cast(Array.newInstance(init().getClass(),N.length +1 <<1));
this.B = B;
setAll(dp,i -> init());
}
protected abstract T init();
protected abstract void f(T pd,T dp,int n,int k);
protected void mod(T dp){}
public T get(int i,int same){ return dp[i *2 +same]; }
public void calc(){
for (int i = 0;i < N.length;i++) {
int t = N[i];
for (int n = 0;n < B;n++) {
if (n == t)
f(get(i +1,1),get(i,1),n,N.length -1 -i);
if (n < t)
f(get(i +1,0),get(i,1),n,N.length -1 -i);
if (0 < i)
f(get(i +1,0),get(i,0),n,N.length -1 -i);
}
mod(get(i +1,0));
mod(get(i +1,1));
}
}
}
abstract class LazySegmentTree<V extends BaseV, F> extends Seg<V, F>{
public LazySegmentTree(int n){ super(n); }
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
up(l,r);
}
@Override
public V get(int i){ return get(i,i +1); }
@Override
public V get(int l,int r){
down(l,r);
return super.get(l,r);
}
}
abstract class Seg<V extends BaseV, F> {
private int n,log;
private V[] val;
private F[] lazy;
protected Seg(int n){
this.n = n;
while (1 <<log <= n)
log++;
val = Util.cast(new BaseV[n <<1]);
lazy = Util.cast(new Object[n]);
for (int i = -1;++i < n;)
(val[i +n] = init(i)).sz = 1;
for (int i = n;--i > 0;merge(i))
(val[i] = e()).sz = val[i <<1].sz +val[i <<1 |1].sz;
}
public void upd(int i,F f){ prop(i +n,f); }
public void upd(int l,int r,F f){
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
prop(l++,f);
if ((r &1) == 1)
prop(--r,f);
}
}
public V get(int i){ return val[i +n]; }
public V get(int l,int r){
V[] ret = Util.cast(new BaseV[]{e(), e()});
int i = 0;
for (var v:getList(l,r)) {
agg(ret[i],ret[i ^1],v);
ret[i].sz = ret[i ^= 1].sz +v.sz;
}
return ret[i ^1];
}
public V[] getList(int l,int r){
int sz = 0;
for (int li = l += n,ri = r += n;li < ri;li = li +1 >>1,ri >>= 1)
sz += (li &1) +(ri &1);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (int i = 0;l < r;l >>= 1,r >>= 1) {
if ((l &1) > 0)
arr[i++] = val[l++];
if ((r &1) > 0)
arr[--sz] = val[--r];
}
return arr;
}
public V[] getPath(int i){
int sz = 32 -Integer.numberOfLeadingZeros(i +n);
V[] arr = Util.cast(Array.newInstance(e().getClass(),sz));
for (i += n;0 < i;i >>= 1)
arr[--sz] = val[i];
return arr;
}
protected V init(int i){ return e(); }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
protected void up(int l,int r){
for (l = oddPart(l +n),r = oddPart(r +n);l != r;)
merge(l > r ? (l >>= 1) : (r >>= 1));
while (1 < l)
merge(l >>= 1);
}
protected void down(int l,int r){
int i = log;
for (l = oddPart(l +n),r = oddPart(r +n);i > 0;i--) {
push(l >>i);
push(r >>i);
}
}
private void merge(int i){ agg(val[i],val[i <<1],val[i <<1 |1]); }
private void push(int i){
if (lazy[i] != null) {
prop(i <<1,lazy[i]);
prop(i <<1 |1,lazy[i]);
lazy[i] = null;
}
}
private void prop(int i,F f){
map(val[i],f);
if (i < n) {
lazy[i] = lazy[i] == null ? f : comp(lazy[i],f);
if (val[i].fail) {
push(i);
merge(i);
}
}
}
private int oddPart(int i){ return i /(i &-i); }
}
abstract class SegmentTree<V extends BaseV, F> extends Seg<V, F>{
public SegmentTree(int n){ super(n); }
@Override
protected F comp(F f,F g){ return null; }
@Override
public void upd(int i,F f){
super.upd(i,f);
up(i,i +1);
}
}
abstract class DualSegmentTree<V extends BaseV, F> extends Seg<V, F>{
public DualSegmentTree(int n){ super(n); }
@Override
protected void agg(V v,V a,V b){}
@Override
public void upd(int i,F f){ upd(i,i +1,f); }
@Override
public void upd(int l,int r,F f){
down(l,r);
super.upd(l,r,f);
}
@Override
public V get(int i){
down(i,i +1);
return super.get(i);
}
}
class UnionFind{
int num;
protected int[] dat;
protected int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
public int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
public boolean same(int u,int v){ return root(u) == root(v); }
public boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
public int size(int x){ return -dat[root(x)]; }
public int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
abstract class BaseV{
public int sz;
public boolean fail;
}
class MyStack<T> extends MyList<T>{
public T pop(){ return remove(size() -1); }
public T peek(){ return get(size() -1); }
}
class MyList<T> implements Iterable<T>{
private T[] arr;
private int sz;
public MyList(){ this(16); }
public MyList(int n){ arr = Util.cast(new Object[n]); }
public boolean isEmpty(){ return sz == 0; }
public int size(){ return sz; }
public T get(int i){ return arr[i]; }
public void add(T t){ (arr = sz < arr.length ? arr : copyOf(arr,sz *5 >>2))[sz++] = t; }
public T remove(int i){
var ret = arr[i];
sz--;
for (int j = i;j < sz;j++)
arr[j] = arr[j +1];
return ret;
}
public T removeFast(int i){
var ret = arr[i];
arr[i] = arr[--sz];
return ret;
}
public void sort(){ sort(Util.cast(Comparator.naturalOrder())); }
public void sort(Comparator<T> cmp){ Arrays.sort(arr,0,sz,cmp); }
@Override
public Iterator<T> iterator(){
return new Iterator<>(){
int i = 0;
@Override
public boolean hasNext(){ return i < sz; }
@Override
public T next(){ return arr[i++]; }
};
}
public <U> MyList<U> map(Function<T, U> func){
MyList<U> ret = new MyList<>(sz);
forEach(t -> ret.add(func.apply(t)));
return ret;
}
public T[] toArray(){ return copyOf(arr,sz); }
public void swap(int i,int j){
var t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
public void set(int i,T t){ arr[i] = t; }
}
class BaseSolver extends Util{
public MyReader in;
public MyWriter out,log;
public BaseSolver(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long inv(long x,long mod){ return pow(x,mod -2,mod); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1,
mod = 998244353;
public static Random rd = ThreadLocalRandom.current();
private long st = System.currentTimeMillis();
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
public int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
@SuppressWarnings("unchecked")
public static <T> T cast(Object obj){ return (T) obj; }
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
| ConDefects/ConDefects/Code/abc335_e/Java/50943713 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.