id stringlengths 22 25 | content stringlengths 327 628k | max_stars_repo_path stringlengths 49 49 |
|---|---|---|
condefects-java_data_1401 | import java.util.*;
import java.util.Map.Entry;
import java.util.stream.Collectors;
import java.io.*;
public class Main {
static final long INF = 1l << 60;
static final int inf = 1 << 30;
static final int MOD = 998244353;
//static final int MOD = 1000000007;
static final double EPS = 1e-9;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
Mod mod = new Mod(MOD);
long n = sc.nextLong();
long m = sc.nextLong();
if (n>=60) {pw.println(0);return;}
long[] a = new long[60];
for (int i = 0; i < 60; i++) {
if (((1l<<(i+1))-1) < m) a[i] = mod.pow(2, i);
else {a[i] = mod.mod(m+1-(1l<<i));break;}
}
long[][] dp = new long[(int)n+1][60];
dp[0][0] = dp[1][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 60; j++) for (int k = j+1; k < 60; k++) {
dp[i+1][k] = mod.add(dp[i+1][k], mod.mul(dp[i][j], a[k]));
}
}
long ans = 0;
for (long x : dp[(int)n]) ans = mod.add(ans, x);
pw.println(ans);
pw.close();
}
}
class Mod {
private long mod;
public Mod(long mod) { this.mod = mod; }
public long getMod() { return mod; }
public long mod(long x) { x %= mod; return x < 0 ? x + mod : x; }
public long add(long x, long y) { return mod(mod(x) + mod(y)); }
public long sub(long x, long y) { return mod(mod(x) - mod(y)); }
public long mul(long x, long y) { return mod(mod(x) * mod(y)); }
public long div(long x, long y) { return mul(mod(x), inv(y)); }
public long inv(long x) {
x = mod(x);
long y = mod, u = 1, v = 0;
while (y > 0) {
long t = x / y;
x -= t * y;
u -= t * v;
t = x; x = y; y = t;
t = u; u = v; v = t;
}
return mod(u);
}
public long pow(long x, long n) {
long res = 1; x = mod(x);
while (n > 0) {
if ((n & 1) == 1) res = mul(res, x);
x = mul(x, x);
n >>= 1;
}
return res;
}
public long[][] comb(int n) {
long[][] res = new long[n+1][n+1];
res[0][0] = 1;
for (int i = 1; i <= n; i++) {
res[i][0] = 1;
for (int j = 1; j <= n; j++) {
res[i][j] = add(res[i-1][j-1], res[i-1][j]);
}
}
return res;
}
}
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.util.Map.Entry;
import java.util.stream.Collectors;
import java.io.*;
public class Main {
static final long INF = 1l << 60;
static final int inf = 1 << 30;
static final int MOD = 998244353;
//static final int MOD = 1000000007;
static final double EPS = 1e-9;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
Mod mod = new Mod(MOD);
long n = sc.nextLong();
long m = sc.nextLong();
if (n>=60) {pw.println(0);pw.close();return;}
long[] a = new long[60];
for (int i = 0; i < 60; i++) {
if (((1l<<(i+1))-1) < m) a[i] = mod.pow(2, i);
else {a[i] = mod.mod(m+1-(1l<<i));break;}
}
long[][] dp = new long[(int)n+1][60];
dp[0][0] = dp[1][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 60; j++) for (int k = j+1; k < 60; k++) {
dp[i+1][k] = mod.add(dp[i+1][k], mod.mul(dp[i][j], a[k]));
}
}
long ans = 0;
for (long x : dp[(int)n]) ans = mod.add(ans, x);
pw.println(ans);
pw.close();
}
}
class Mod {
private long mod;
public Mod(long mod) { this.mod = mod; }
public long getMod() { return mod; }
public long mod(long x) { x %= mod; return x < 0 ? x + mod : x; }
public long add(long x, long y) { return mod(mod(x) + mod(y)); }
public long sub(long x, long y) { return mod(mod(x) - mod(y)); }
public long mul(long x, long y) { return mod(mod(x) * mod(y)); }
public long div(long x, long y) { return mul(mod(x), inv(y)); }
public long inv(long x) {
x = mod(x);
long y = mod, u = 1, v = 0;
while (y > 0) {
long t = x / y;
x -= t * y;
u -= t * v;
t = x; x = y; y = t;
t = u; u = v; v = t;
}
return mod(u);
}
public long pow(long x, long n) {
long res = 1; x = mod(x);
while (n > 0) {
if ((n & 1) == 1) res = mul(res, x);
x = mul(x, x);
n >>= 1;
}
return res;
}
public long[][] comb(int n) {
long[][] res = new long[n+1][n+1];
res[0][0] = 1;
for (int i = 1; i <= n; i++) {
res[i][0] = 1;
for (int j = 1; j <= n; j++) {
res[i][j] = add(res[i-1][j-1], res[i-1][j]);
}
}
return res;
}
}
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/arc141_b/Java/32092749 |
condefects-java_data_1402 |
import java.io.*;
import java.util.*;
public class Main {
public static void solve() throws IOException{
int n = in.nextInt();
long a = in.nextInt();
long b = in.nextInt();
Deque<Character> que = new ArrayDeque<>();
String s = in.nextLine();
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (que.isEmpty() || ch == '(') que.addLast(ch);
else {
if (que.peekLast() == '(') que.pollLast();
else que.addLast(ch);
}
}
List<Character> list = new ArrayList<>();
while (!que.isEmpty()) list.add(que.pollFirst());
if (list.size() == 0) {
out.println(0);
return;
}
//))()((((()()((
//))((((((
//)))(()
if (list.get(0) == '(' && list.get(list.size()-1) == '(') {
out.println(b * list.size() / 2);
}else if (list.get(0) == ')' && list.get(list.size()-1) == ')') {
out.println(b * list.size() / 2);
}else {
long sumR = 0; //)))((
for (int i = 0; i < list.size(); i++) {
if (list.get(i) == ')') sumR++;
}
long sumL = list.size() - sumR;
if (2L * b <= a) { //替换
long ans = b * (sumR / 2) + b * (sumL / 2);
sumR %= 2;
out.println(ans + Math.min(a, b) * sumR);
}else {
long mi = Math.min(sumR, sumL);
long mx = Math.max(sumR, sumL);
if (mi % 2 == 0) {
long ans = mi / 2 * a;
mx -= mi;
out.println(ans + b * mx / 2);
}else {
long ans = mi / 2 * a;
mx -= mi - 1;
if (2 * b >= a) {
mx--;
ans += a;
}
ans += b * mx / 2;
out.println(ans);
}
}
}
}
static boolean MULTI_CASE = false;
public static void main(String[] args) throws IOException {
if (MULTI_CASE) {
int T = in.nextInt();
for (int i = 0; i < T; ++i) {
solve();
}
} else {
solve();
}
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
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());
}
}
}
/*
))((((((
1234
1456789
5
9
4
*/
import java.io.*;
import java.util.*;
public class Main {
public static void solve() throws IOException{
int n = in.nextInt();
long a = in.nextInt();
long b = in.nextInt();
Deque<Character> que = new ArrayDeque<>();
String s = in.nextLine();
for (int i = 0; i < s.length(); i++) {
char ch = s.charAt(i);
if (que.isEmpty() || ch == '(') que.addLast(ch);
else {
if (que.peekLast() == '(') que.pollLast();
else que.addLast(ch);
}
}
List<Character> list = new ArrayList<>();
while (!que.isEmpty()) list.add(que.pollFirst());
if (list.size() == 0) {
out.println(0);
return;
}
//))()((((()()((
//))((((((
//)))(()
if (list.get(0) == '(' && list.get(list.size()-1) == '(') {
out.println(b * list.size() / 2);
}else if (list.get(0) == ')' && list.get(list.size()-1) == ')') {
out.println(b * list.size() / 2);
}else {
long sumR = 0; //)))((
for (int i = 0; i < list.size(); i++) {
if (list.get(i) == ')') sumR++;
}
long sumL = list.size() - sumR;
if (2L * b <= a) { //替换
long ans = b * (sumR / 2) + b * (sumL / 2);
sumR %= 2;
out.println(ans + b * 2 * sumR);
}else {
long mi = Math.min(sumR, sumL);
long mx = Math.max(sumR, sumL);
if (mi % 2 == 0) {
long ans = mi / 2 * a;
mx -= mi;
out.println(ans + b * mx / 2);
}else {
long ans = mi / 2 * a;
mx -= mi - 1;
if (2 * b >= a) {
mx--;
ans += a;
}
ans += b * mx / 2;
out.println(ans);
}
}
}
}
static boolean MULTI_CASE = false;
public static void main(String[] args) throws IOException {
if (MULTI_CASE) {
int T = in.nextInt();
for (int i = 0; i < T; ++i) {
solve();
}
} else {
solve();
}
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
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());
}
}
}
/*
))((((((
1234
1456789
5
9
4
*/ | ConDefects/ConDefects/Code/arc175_b/Java/51655523 |
condefects-java_data_1403 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
class Main {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
int N = sc.nextInt();
int A = sc.nextInt();
int B = sc.nextInt();
String S = sc.next();
int L = 0;
int R = 0;
for (int i = 0; i < 2*N; i++) {
if (S.charAt(i) == '('){
L++;
}else {
if (L > 0){
L--;
}else R++;
}
}
if (A <= 2*B){
long answer = 0;
while (L > 0 && R > 0){
if (L >= 2 && R >= 2){
answer += A;
L -= 2;
R -= 2;
}else if (A <= 2*B){
answer += A;
L --;
R --;
}else {
break;
}
}
System.out.println(answer + ((long) (L+R)/2*B));
}else {
long answer = Math.min(L/2,R/2);
answer += (long) (L / 2) *B;
answer += (long) (R / 2) *B;
L %= 2;
R %= 2;
System.out.println(answer + (long) (L + R) *B);
}
out.flush();
}
private static 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();
}
return buflen > 0;
}
}
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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
class Main {
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
int N = sc.nextInt();
int A = sc.nextInt();
int B = sc.nextInt();
String S = sc.next();
int L = 0;
int R = 0;
for (int i = 0; i < 2*N; i++) {
if (S.charAt(i) == '('){
L++;
}else {
if (L > 0){
L--;
}else R++;
}
}
if (A <= 2*B){
long answer = 0;
while (L > 0 && R > 0){
if (L >= 2 && R >= 2){
answer += A;
L -= 2;
R -= 2;
}else if (A <= 2*B){
answer += A;
L --;
R --;
}else {
break;
}
}
System.out.println(answer + ((long) (L+R)/2*B));
}else {
long answer = 0;
answer += (long) (L / 2) *B;
answer += (long) (R / 2) *B;
L %= 2;
R %= 2;
System.out.println(answer + (long) (L + R) *B);
}
out.flush();
}
private static 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();
}
return buflen > 0;
}
}
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/arc175_b/Java/51651721 |
condefects-java_data_1404 | import java.io.*;
import java.util.StringTokenizer;
public class Main {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
st = new StringTokenizer(reader.readLine());
int N = Integer.parseInt(st.nextToken());
long A = Long.parseLong(st.nextToken());
long B = Long.parseLong(st.nextToken());
st = new StringTokenizer(reader.readLine());
String S = st.nextToken();
int open = 0;
int sum = 0;
int minSum = 0;
for (char c : S.toCharArray()) {
if (c == '(') {
open++;
sum++;
} else {
sum--;
}
minSum = Math.min(minSum, sum);
}
if (open >= N) {
writer.write(Long.toString(B * (open - N) + Math.min(A, 2 * B) * ((Math.abs(minSum) + 1) / 2)));
} else {
writer.write(Long.toString(B * (N - open) + Math.min(A, 2 * B) * ((open - N - minSum + 1) / 2)));
}
writer.newLine();
writer.flush();
}
}
import java.io.*;
import java.util.StringTokenizer;
public class Main {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
private static StringTokenizer st;
public static void main(String[] args) throws IOException {
st = new StringTokenizer(reader.readLine());
int N = Integer.parseInt(st.nextToken());
long A = Long.parseLong(st.nextToken());
long B = Long.parseLong(st.nextToken());
st = new StringTokenizer(reader.readLine());
String S = st.nextToken();
int open = 0;
int sum = 0;
int minSum = 0;
for (char c : S.toCharArray()) {
if (c == '(') {
open++;
sum++;
} else {
sum--;
}
minSum = Math.min(minSum, sum);
}
if (open >= N) {
writer.write(Long.toString(B * (open - N) + Math.min(A, 2 * B) * ((Math.abs(minSum) + 1) / 2)));
} else {
writer.write(Long.toString(B * (N - open) + Math.min(A, 2 * B) * ((2L * (open - N) - minSum + 1) / 2)));
}
writer.newLine();
writer.flush();
}
}
| ConDefects/ConDefects/Code/arc175_b/Java/51651324 |
condefects-java_data_1405 | import java.util.Scanner;
import java.util.Stack;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int swapCost = scanner.nextInt();
int replaceCost = scanner.nextInt();
String s = scanner.next();
char[] charArray = s.toCharArray();
long balance = getBalance(charArray);
long ans = 0;
if (balance > 0) {
for (int i = 0; i < charArray.length; i++) {
if (balance > 0 && charArray[i] == ')') {
charArray[i] = '(';
ans += replaceCost;
balance -= 2;
}
}
} else if (balance < 0) {
for (int i = charArray.length - 1; i >= 0; i--) {
if (balance < 0 && charArray[i] == '(') {
charArray[i] = ')';
ans += replaceCost;
balance += 2;
}
}
}
Stack<Character> stack = new Stack<>();
for (int i = 0; i < charArray.length; i++) {
char c = charArray[i];
if (c == '(') {
stack.add(c);
} else {
if (!stack.isEmpty() && stack.peek() == '(') {
stack.pop();
} else {
stack.add(c);
}
}
}
System.out.println(ans + ((stack.size() + 1L) / 2 * Math.min(swapCost, 2 * replaceCost)));
}
private static long getBalance(char[] chars) {
long balance = 0;
for (int i = 0; i < chars.length; i++) {
if (chars[i] == '(') {
balance--;
} else {
balance++;
}
}
return balance;
}
}
import java.util.Scanner;
import java.util.Stack;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int swapCost = scanner.nextInt();
int replaceCost = scanner.nextInt();
String s = scanner.next();
char[] charArray = s.toCharArray();
long balance = getBalance(charArray);
long ans = 0;
if (balance > 0) {
for (int i = 0; i < charArray.length; i++) {
if (balance > 0 && charArray[i] == ')') {
charArray[i] = '(';
ans += replaceCost;
balance -= 2;
}
}
} else if (balance < 0) {
for (int i = charArray.length - 1; i >= 0; i--) {
if (balance < 0 && charArray[i] == '(') {
charArray[i] = ')';
ans += replaceCost;
balance += 2;
}
}
}
Stack<Character> stack = new Stack<>();
for (int i = 0; i < charArray.length; i++) {
char c = charArray[i];
if (c == '(') {
stack.add(c);
} else {
if (!stack.isEmpty() && stack.peek() == '(') {
stack.pop();
} else {
stack.add(c);
}
}
}
System.out.println(ans + ((stack.size() / 2L + 1L) / 2 * Math.min(swapCost, 2 * replaceCost)));
}
private static long getBalance(char[] chars) {
long balance = 0;
for (int i = 0; i < chars.length; i++) {
if (chars[i] == '(') {
balance--;
} else {
balance++;
}
}
return balance;
}
}
| ConDefects/ConDefects/Code/arc175_b/Java/52225618 |
condefects-java_data_1406 | 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));
PrintWriter pw = new PrintWriter(System.out);
int t = Integer.parseInt(br.readLine());
while(t-->0){
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n];
int[] brr = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
ArrayList<Integer> string = new ArrayList<>();
boolean circle = false;
for(int i=0; i<n; i++){
arr[i]=Integer.parseInt(st.nextToken());
if(i==0){
string.add(arr[i]);
}
else{
if(!string.get(string.size()-1).equals(arr[i])){
string.add(arr[i]);
}
else{
circle = true;
}
}
}
if(string.size()!=1&&string.get(0).equals(string.get(string.size()-1))){
string.remove(string.size()-1);
circle = true;
}
st = new StringTokenizer(br.readLine());
ArrayList<Integer> brace = new ArrayList<>();
for(int i=0; i<n; i++){
brr[i]=Integer.parseInt(st.nextToken());
if(i==0){
brace.add(brr[i]);
}
else{
if(!brace.get(brace.size()-1).equals(brr[i])){
brace.add(brr[i]);
}
else{
circle = true;
}
}
}
if(brace.size()!=1&&brace.get(0).equals(brace.get(brace.size()-1))){
brace.remove(brace.size()-1);
circle = true;
}
String ans = "Yes";
if(circle){
for(int z=0; z<string.size(); z++){
int start = z;
ans="Yes";
for(int i=0; i<brace.size(); i++){
while(start!=z+string.size()&&string.get(start%string.size())!=brace.get(i)){
start++;
}
if(start==z+string.size()){
ans="No";
break;
}
}
if(ans.equals("Yes"))break;
}
}
else{
for(int i=0; i<n; i++){
if(arr[i]!=brr[i]){
ans="No";
break;
}
}
}
pw.println(ans);
}
pw.close();
}
}
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));
PrintWriter pw = new PrintWriter(System.out);
int t = Integer.parseInt(br.readLine());
while(t-->0){
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n];
int[] brr = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
ArrayList<Integer> string = new ArrayList<>();
boolean circle = false;
for(int i=0; i<n; i++){
arr[i]=Integer.parseInt(st.nextToken());
if(i==0){
string.add(arr[i]);
}
else{
if(!string.get(string.size()-1).equals(arr[i])){
string.add(arr[i]);
}
else{
circle = true;
}
}
}
if(string.size()!=1&&string.get(0).equals(string.get(string.size()-1))){
string.remove(string.size()-1);
circle = true;
}
st = new StringTokenizer(br.readLine());
ArrayList<Integer> brace = new ArrayList<>();
for(int i=0; i<n; i++){
brr[i]=Integer.parseInt(st.nextToken());
if(i==0){
brace.add(brr[i]);
}
else{
if(!brace.get(brace.size()-1).equals(brr[i])){
brace.add(brr[i]);
}
else{
circle = true;
}
}
}
if(brace.size()!=1&&brace.get(0).equals(brace.get(brace.size()-1))){
brace.remove(brace.size()-1);
circle = true;
}
String ans = "Yes";
if(circle){
for(int z=0; z<string.size(); z++){
int start = z;
ans="Yes";
for(int i=0; i<brace.size(); i++){
while(start!=z+string.size()&&!string.get(start%string.size()).equals(brace.get(i))){
start++;
}
if(start==z+string.size()){
ans="No";
break;
}
}
if(ans.equals("Yes"))break;
}
}
else{
for(int i=0; i<n; i++){
if(arr[i]!=brr[i]){
ans="No";
break;
}
}
}
pw.println(ans);
}
pw.close();
}
}
| ConDefects/ConDefects/Code/arc154_c/Java/38272362 |
condefects-java_data_1407 | // C - Roller
import java.util.*;
import java.io.*;
public class Main {
static void solve() {
StringBuilder res = new StringBuilder();
int n = sc.nextInt();
int[] arr =sc.readIntArray(n);
int[] brr =sc.readIntArray(n);
int lim = n;
while (lim>1&&brr[lim-1]==brr[0]) lim--;
boolean g = false;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[(i + 1) % n]) {
g = true;
break;
}
}
for (int i = 0; i < n; i++) {
int k = i,c = 0,j=0;
boolean f = false,is= true;
for (j = 0; j < lim; ) {
c=0;
while(k<n+i-1&&arr[k%n]!=brr[j]){
k++;c++;
}
if(c>1) f = true;
if(arr[k%n]!=brr[j]){
is = false;
break;
}
int p = brr[j];
while (j<lim&&brr[j]==p) j++;
}
if(k<n+i) f = true;
if(is&&k<=n+i&&j==lim&&(i==0||f)) {
print("Yes");
return;
}
}
print("No");
}
static int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
static FastReader sc;
static PrintWriter out;
public static void main(String[] args) throws IOException {
sc = new FastReader();
out = new PrintWriter(System.out);
int tt = sc.nextInt();
for (int t = 1; t <= tt; t++) {
solve();
}
out.close();
}
static <E> void print(E res) {
out.println(res);
}
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 {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++)
res[i] = nextInt();
return res;
}
long[] readLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++)
res[i] = nextLong();
return res;
}
}
}
// C - Roller
import java.util.*;
import java.io.*;
public class Main {
static void solve() {
StringBuilder res = new StringBuilder();
int n = sc.nextInt();
int[] arr =sc.readIntArray(n);
int[] brr =sc.readIntArray(n);
int lim = n;
while (lim>1&&brr[lim-1]==brr[0]) lim--;
boolean g = false;
for (int i = 0; i < n; i++) {
if (arr[i] == arr[(i + 1) % n]) {
g = true;
break;
}
}
for (int i = 0; i < n; i++) {
int k = i,c = 0,j=0;
boolean f = false,is= true;
for (j = 0; j < lim; ) {
c=0;
while(k<n+i-1&&arr[k%n]!=brr[j]){
k++;c++;
}
if(c>1) f = true;
if(arr[k%n]!=brr[j]){
is = false;
break;
}
int p = brr[j];
while (j<lim&&brr[j]==p) j++;
}
if(k<n+i-1) f = true;
if(is&&k<=n+i&&j==lim&&(i==0||f)) {
print("Yes");
return;
}
}
print("No");
}
static int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
static FastReader sc;
static PrintWriter out;
public static void main(String[] args) throws IOException {
sc = new FastReader();
out = new PrintWriter(System.out);
int tt = sc.nextInt();
for (int t = 1; t <= tt; t++) {
solve();
}
out.close();
}
static <E> void print(E res) {
out.println(res);
}
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 {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++)
res[i] = nextInt();
return res;
}
long[] readLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++)
res[i] = nextLong();
return res;
}
}
}
| ConDefects/ConDefects/Code/arc154_c/Java/38264305 |
condefects-java_data_1408 | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var pw = new PrintWriter(System.out);
int T = Integer.parseInt(sc.next());
label:for(int t = 0; t < T; t++){
int n = Integer.parseInt(sc.next());
var a = new int[n];
for(int i = 0; i < n; i++){
a[i] = Integer.parseInt(sc.next());
}
var b = new int[n];
for(int i = 0; i < n; i++){
b[i] = Integer.parseInt(sc.next());
}
var a2 = new ArrayList<Integer>();
a2.add(a[0]);
for(int i = 1; i < n; i++){
if(a[i] != a[i-1]){
a2.add(a[i]);
}
}
if(a2.size() >= 2 && a[0] == a[n-1]){
a2.remove(a2.size()-1);
}
var b2 = new ArrayList<Integer>();
b2.add(b[0]);
for(int i = 1; i < n; i++){
if(b[i] != b[i-1]){
b2.add(b[i]);
}
}
if(b2.size() >= 2 && b[0] == b[n-1]){
b2.remove(b2.size()-1);
}
int sizeA = a2.size();
int sizeB = b2.size();
if(sizeA < sizeB){
pw.println("No");
continue;
}
for(int i = 0; i < sizeB; i++){
int indexB = i;
int count = 0;
for(Integer ai : a2){
if(ai.equals(b2.get(indexB))){
indexB = (indexB + 1) % sizeB;
count++;
if(count == sizeB){
pw.println("Yes");
continue label;
}
}
}
}
pw.println("No");
}
pw.flush();
}
}
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
var pw = new PrintWriter(System.out);
int T = Integer.parseInt(sc.next());
label:for(int t = 0; t < T; t++){
int n = Integer.parseInt(sc.next());
var a = new int[n];
for(int i = 0; i < n; i++){
a[i] = Integer.parseInt(sc.next());
}
var b = new int[n];
for(int i = 0; i < n; i++){
b[i] = Integer.parseInt(sc.next());
}
var a2 = new ArrayList<Integer>();
a2.add(a[0]);
for(int i = 1; i < n; i++){
if(a[i] != a[i-1]){
a2.add(a[i]);
}
}
if(a2.size() >= 2 && a[0] == a[n-1]){
a2.remove(a2.size()-1);
}
var b2 = new ArrayList<Integer>();
b2.add(b[0]);
for(int i = 1; i < n; i++){
if(b[i] != b[i-1]){
b2.add(b[i]);
}
}
if(b2.size() >= 2 && b[0] == b[n-1]){
b2.remove(b2.size()-1);
}
int sizeA = a2.size();
int sizeB = b2.size();
if(sizeA < sizeB){
pw.println("No");
continue;
}
for(int i = 0; i < sizeB; i++){
int indexB = i;
int count = 0;
for(Integer ai : a2){
if(ai.equals(b2.get(indexB))){
indexB = (indexB + 1) % sizeB;
count++;
if(count == sizeB && (sizeB < n || (sizeB == n && i == 0))){
pw.println("Yes");
continue label;
}
}
}
}
pw.println("No");
}
pw.flush();
}
} | ConDefects/ConDefects/Code/arc154_c/Java/38258839 |
condefects-java_data_1409 | import java.io.*;
import java.util.*;
import java.util.function.*;
public class Main{
/* 定数 */
static int infI = (int) 1e9;
static long infL = (long) 1e18;
// static long mod = (int) 1e9 +7;
static long mod = 998244353;
static String yes = "Yes";
static String no = "No";
/* 入出力とか */
long st = System.currentTimeMillis();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyLogger log = new MyLogger();
boolean local(){
// out.out = new ByteArrayOutputStream();
return true;
}
int T = in.it();
Long solve(){
while (T-- > 0) {
int N = in.it();
int[] A = in.it(N);
int[] B = in.it(N);
out.println(solve(N,A,B));
}
return null;
}
boolean solve(int N,int[] A,int[] B){
List<Integer> listB = new ArrayList<>();
listB.add(B[0]);
boolean canRotate = B[N -1] == B[0];
for (int i = 1;i < N;i++)
if (B[i -1] != B[i])
listB.add(B[i]);
else
canRotate = true;
A = Arrays.copyOf(A,N <<1);
for (int i = 0;i < N;i++)
A[i +N] = A[i];
for (int s = 0;s < N;s++)
if (can(N,Arrays.copyOf(A,N <<1),B,s,canRotate))
return true;
return false;
}
boolean can(int N,int[] A,int[] B,int s,boolean canRotate){
if (!canRotate) {
for (int i = 0;i < N;i++)
if (A[i +s] != B[i])
return false;
return true;
}
int a = s;
int t = B[0] == B[N -1] ? 1 : 0;
for (int i = 0;i < N;i++) {
while (a < s +N +t && B[i] != A[a])
a++;
if (a == s +N +t)
return false;
}
return true;
}
/* Util */
static long mod(long n){ return (n %mod +mod) %mod; }
static int[][] trans(int[][] M){
int[][] ret = new int[M[0].length][M.length];
for (int i = 0;i < M.length;i++)
for (int j = 0;j < M[0].length;j++)
ret[j][i] = M[i][j];
return ret;
}
static long[][] trans(long[][] M){
long[][] ret = new long[M[0].length][M.length];
for (int i = 0;i < M.length;i++)
for (int j = 0;j < M[0].length;j++)
ret[j][i] = M[i][j];
return ret;
}
static int[][] toi(char[][] s){
int[][] ret = new int[s.length][];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
static int[] toi(char[] s){
int[] ret = new int[s.length];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
static int toi(char c){
if (c == '.')
return 0;
if (c == '#')
return 1;
if ('a' <= c && c <= 'z')
return c -'a';
if ('A' <= c && c <= 'Z')
return c -'A';
if ('0' <= c && c <= '9')
return c -'0';
return c;
}
/* 実行 */
public static void main(String[] args){ new Main().exe(); }
long elapsed(){ return System.currentTimeMillis() -st; }
void exe(){
assert local();
Optional.ofNullable(solve()).ifPresent(out::println);
out.flush();
log.println(elapsed());
}
/* 入力 */
static 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(){ return (int) lg(); }
int[] it(int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
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;
}
long[] lg(int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
double[][] dbl(int H,int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;isPrintable(c = read()) || c == ' ';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(T[] arr,IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
int[][] g(int N,int M,boolean d){
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < N;i++)
g.add(new ArrayList<>());
for (int i = 0,u,v;i < M;i++) {
g.get(u = idx()).add(v = idx());
if (!d)
g.get(v).add(u);
}
int[][] ret = new int[N][];
for (int u = 0;u < N;u++) {
ret[u] = new int[g.get(u).size()];
for (int i = 0;i < ret[u].length;i++)
ret[u][i] = g.get(u).get(i);
}
return ret;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
void sp(){ write((byte) ' '); }
void ln(){ write((byte) '\n'); }
void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
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);
write(ibuf,i,ibuf.length -i);
}
void println(boolean b){ println(b ? yes : no); }
void println(long n){
write(n);
ln();
}
void println(double d){ println(String.valueOf(d)); }
void println(String s){ println(s.toCharArray()); }
void println(char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(double[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
for (char b:String.valueOf(a[i]).toCharArray())
write((byte) b);
}
ln();
}
}
/* デバッグ用 */
static class MyLogger{
MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
void println(Object obj){ assert write(obj); }
boolean write(Object obj){
if (obj instanceof Boolean)
log.println((boolean) obj);
else if (obj instanceof char[])
log.println((char[]) obj);
else if (obj instanceof int[])
log.println((int[]) obj);
else if (obj instanceof long[])
log.println((long[]) obj);
else if (obj instanceof double[])
log.println((double[]) obj);
else
log.println(Objects.toString(obj));
return true;
}
}
}
import java.io.*;
import java.util.*;
import java.util.function.*;
public class Main{
/* 定数 */
static int infI = (int) 1e9;
static long infL = (long) 1e18;
// static long mod = (int) 1e9 +7;
static long mod = 998244353;
static String yes = "Yes";
static String no = "No";
/* 入出力とか */
long st = System.currentTimeMillis();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyLogger log = new MyLogger();
boolean local(){
// out.out = new ByteArrayOutputStream();
return true;
}
int T = in.it();
Long solve(){
while (T-- > 0) {
int N = in.it();
int[] A = in.it(N);
int[] B = in.it(N);
out.println(solve(N,A,B));
}
return null;
}
boolean solve(int N,int[] A,int[] B){
List<Integer> listB = new ArrayList<>();
listB.add(B[0]);
boolean canRotate = B[N -1] == B[0];
for (int i = 1;i < N;i++)
if (B[i -1] != B[i])
listB.add(B[i]);
else
canRotate = true;
A = Arrays.copyOf(A,N <<1);
for (int i = 0;i < N;i++)
A[i +N] = A[i];
for (int s = 0;s < N;s++)
if (can(N,Arrays.copyOf(A,N <<1),B,s,canRotate))
return true;
return false;
}
boolean can(int N,int[] A,int[] B,int s,boolean canRotate){
if (!canRotate) {
if (0 < s)
return false;
for (int i = 0;i < N;i++)
if (A[i +s] != B[i])
return false;
return true;
}
int a = s;
int t = B[0] == B[N -1] ? 1 : 0;
for (int i = 0;i < N;i++) {
while (a < s +N +t && B[i] != A[a])
a++;
if (a == s +N +t)
return false;
}
return true;
}
/* Util */
static long mod(long n){ return (n %mod +mod) %mod; }
static int[][] trans(int[][] M){
int[][] ret = new int[M[0].length][M.length];
for (int i = 0;i < M.length;i++)
for (int j = 0;j < M[0].length;j++)
ret[j][i] = M[i][j];
return ret;
}
static long[][] trans(long[][] M){
long[][] ret = new long[M[0].length][M.length];
for (int i = 0;i < M.length;i++)
for (int j = 0;j < M[0].length;j++)
ret[j][i] = M[i][j];
return ret;
}
static int[][] toi(char[][] s){
int[][] ret = new int[s.length][];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
static int[] toi(char[] s){
int[] ret = new int[s.length];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
static int toi(char c){
if (c == '.')
return 0;
if (c == '#')
return 1;
if ('a' <= c && c <= 'z')
return c -'a';
if ('A' <= c && c <= 'Z')
return c -'A';
if ('0' <= c && c <= '9')
return c -'0';
return c;
}
/* 実行 */
public static void main(String[] args){ new Main().exe(); }
long elapsed(){ return System.currentTimeMillis() -st; }
void exe(){
assert local();
Optional.ofNullable(solve()).ifPresent(out::println);
out.flush();
log.println(elapsed());
}
/* 入力 */
static 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(){ return (int) lg(); }
int[] it(int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
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;
}
long[] lg(int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
double[][] dbl(int H,int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;isPrintable(c = read()) || c == ' ';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(T[] arr,IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
int[][] g(int N,int M,boolean d){
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < N;i++)
g.add(new ArrayList<>());
for (int i = 0,u,v;i < M;i++) {
g.get(u = idx()).add(v = idx());
if (!d)
g.get(v).add(u);
}
int[][] ret = new int[N][];
for (int u = 0;u < N;u++) {
ret[u] = new int[g.get(u).size()];
for (int i = 0;i < ret[u].length;i++)
ret[u][i] = g.get(u).get(i);
}
return ret;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
void sp(){ write((byte) ' '); }
void ln(){ write((byte) '\n'); }
void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
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);
write(ibuf,i,ibuf.length -i);
}
void println(boolean b){ println(b ? yes : no); }
void println(long n){
write(n);
ln();
}
void println(double d){ println(String.valueOf(d)); }
void println(String s){ println(s.toCharArray()); }
void println(char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(double[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
for (char b:String.valueOf(a[i]).toCharArray())
write((byte) b);
}
ln();
}
}
/* デバッグ用 */
static class MyLogger{
MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
void println(Object obj){ assert write(obj); }
boolean write(Object obj){
if (obj instanceof Boolean)
log.println((boolean) obj);
else if (obj instanceof char[])
log.println((char[]) obj);
else if (obj instanceof int[])
log.println((int[]) obj);
else if (obj instanceof long[])
log.println((long[]) obj);
else if (obj instanceof double[])
log.println((double[]) obj);
else
log.println(Objects.toString(obj));
return true;
}
}
} | ConDefects/ConDefects/Code/arc154_c/Java/38261256 |
condefects-java_data_1410 | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
Main o = new Main();
o.solve();
}
static final String YES = "Yes";
static final String NO = "No";
public void solve() {
FastScanner sc = new FastScanner(System.in);
int T = sc.nextInt();
StringBuilder ans = new StringBuilder();
for (int t = 0; t < T; t++) {
int N = sc.nextInt();
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) A[i] = sc.nextInt();
for (int i = 0; i < N; i++) B[i] = sc.nextInt();
ans.append(solve0(N, A, B) ? YES : NO);
ans.append("\n");
}
System.out.print(ans.toString());
}
boolean solve0(int N, int[] A, int[] B) {
for (int i = 0; i < N; i++) {
if ( solve1(N, A, B, i) ) {
return true;
}
}
return false;
}
boolean solve1(int N, int[] A, int[] B, int si) {
int ai = 0;
int bi = si;
boolean skip = false;
while ( true ) {
int cnt = 0;
while ( A[ai] != B[bi] ) {
ai++;
if ( ai >= N ) {
return false;
}
cnt++;
}
if ( cnt >= 2 || (bi == si && cnt > 0)) {
skip = true;
}
bi = (bi + 1) % N;
if ( bi == si ) break;
}
if ( si != 0 && skip == false ) {
return false;
} else {
return true;
}
}
class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner( InputStream source ) { this.in = source; }
private boolean hasNextByte() {
if ( ptr < buflen ) return true;
else {
ptr = 0;
try { buflen = in.read(buf); } catch (IOException e) { e.printStackTrace(); }
if ( buflen <= 0 ) return false;
}
return true;
}
private int readByte() { if ( hasNextByte() ) return buf[ptr++]; else return -1; }
private boolean isPrintableChar( int c ) { return 33 <= c && c <= 126; }
private boolean isNumeric( int c ) { return '0' <= c && c <= '9'; }
private void skipToNextPrintableChar() { while ( hasNextByte() && !isPrintableChar(buf[ptr]) ) ptr++; }
public boolean hasNext() { skipToNextPrintableChar(); return hasNextByte(); }
public String next() {
if ( !hasNext() ) throw new NoSuchElementException();
StringBuilder ret = new StringBuilder();
int b = readByte();
while ( isPrintableChar(b) ) { ret.appendCodePoint(b); b = readByte(); }
return ret.toString();
}
public long nextLong() {
if ( !hasNext() ) throw new NoSuchElementException();
long ret = 0;
int b = readByte();
boolean negative = false;
if ( b == '-' ) { negative = true; if ( hasNextByte() ) b = readByte(); }
if ( !isNumeric(b) ) throw new NumberFormatException();
while ( true ) {
if ( isNumeric(b) ) ret = ret * 10 + b - '0';
else if ( b == -1 || !isPrintableChar(b) ) return negative ? -ret : ret;
else throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() { return (int)nextLong(); }
public double nextDouble() { return Double.parseDouble(next()); }
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
Main o = new Main();
o.solve();
}
static final String YES = "Yes";
static final String NO = "No";
public void solve() {
FastScanner sc = new FastScanner(System.in);
int T = sc.nextInt();
StringBuilder ans = new StringBuilder();
for (int t = 0; t < T; t++) {
int N = sc.nextInt();
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) A[i] = sc.nextInt();
for (int i = 0; i < N; i++) B[i] = sc.nextInt();
ans.append(solve0(N, A, B) ? YES : NO);
ans.append("\n");
}
System.out.print(ans.toString());
}
boolean solve0(int N, int[] A, int[] B) {
for (int i = 0; i < N; i++) {
if ( solve1(N, A, B, i) ) {
return true;
}
}
return false;
}
boolean solve1(int N, int[] A, int[] B, int si) {
int ai = 0;
int bi = si;
boolean skip = false;
while ( true ) {
int cnt = 0;
while ( A[ai] != B[bi] ) {
ai++;
if ( ai >= N ) {
return false;
}
cnt++;
}
if ( cnt >= 2 || (bi == si && cnt > 0)) {
skip = true;
}
bi = (bi + 1) % N;
if ( bi == si ) break;
}
if ( si != 0 && skip == false && ai == N - 1) {
return false;
} else {
return true;
}
}
class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner( InputStream source ) { this.in = source; }
private boolean hasNextByte() {
if ( ptr < buflen ) return true;
else {
ptr = 0;
try { buflen = in.read(buf); } catch (IOException e) { e.printStackTrace(); }
if ( buflen <= 0 ) return false;
}
return true;
}
private int readByte() { if ( hasNextByte() ) return buf[ptr++]; else return -1; }
private boolean isPrintableChar( int c ) { return 33 <= c && c <= 126; }
private boolean isNumeric( int c ) { return '0' <= c && c <= '9'; }
private void skipToNextPrintableChar() { while ( hasNextByte() && !isPrintableChar(buf[ptr]) ) ptr++; }
public boolean hasNext() { skipToNextPrintableChar(); return hasNextByte(); }
public String next() {
if ( !hasNext() ) throw new NoSuchElementException();
StringBuilder ret = new StringBuilder();
int b = readByte();
while ( isPrintableChar(b) ) { ret.appendCodePoint(b); b = readByte(); }
return ret.toString();
}
public long nextLong() {
if ( !hasNext() ) throw new NoSuchElementException();
long ret = 0;
int b = readByte();
boolean negative = false;
if ( b == '-' ) { negative = true; if ( hasNextByte() ) b = readByte(); }
if ( !isNumeric(b) ) throw new NumberFormatException();
while ( true ) {
if ( isNumeric(b) ) ret = ret * 10 + b - '0';
else if ( b == -1 || !isPrintableChar(b) ) return negative ? -ret : ret;
else throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() { return (int)nextLong(); }
public double nextDouble() { return Double.parseDouble(next()); }
}
}
| ConDefects/ConDefects/Code/arc154_c/Java/38258653 |
condefects-java_data_1411 | import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
public class Main {
static int mod = (int) (Math.pow(10, 9)+7);
static final int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
static final int[] dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }, dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 };
static final int[] dx9 = { -1, -1, -1, 0, 0, 0, 1, 1, 1 }, dy9 = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
static final int inf = Integer.MAX_VALUE / 2;
static final int minf = inf * -1;
static final long infL = Long.MAX_VALUE / 2;
static final long minfL = infL * -1;
static final double infD = Double.MAX_VALUE / 3;
static final double eps = 1e-10;
static final double pi = Math.PI;
static final double pi2 = pi*2;
static int H, W;
static StringBuilder out = new StringBuilder();
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
int n = sc.nextInt();
int[] s = new int[n];
for(int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
while(true) {
int[] bc = new int[31];
for(int i = 0; i < n; i++) {
int tmp = s[i];
for(int j = 0; j < 31; j++) {
if((tmp & 1) == 1) {
bc[j]++;
}
tmp >>= 1;
}
}
long max = 0;
int maxv = -1;
for(int i = 0; i < n; i++) {
int tmp = s[i];
long sum = 0;
for(int j = 0; j < 31; j++) {
if((tmp & 1) == 1) {
sum += (n-bc[j]*2)*(1L<<(j*2));
}
tmp >>= 1;
}
if(sum > max) {
max = sum;
maxv = s[i];
}
}
if(maxv == -1)
break;
for(int i = 0; i < n; i++)
s[i] ^= maxv;
}
long ans = 0;
for(int i = 0; i < n; i++) {
ans += s[i];
}
out.append(ans);
System.out.println(out);
}
/// ///
/// ライブラリ ///
/// ///
public static boolean[][] rotate(int d, boolean[][] arr){
if(d == 0)
return arr;
int h = arr.length;
int w = arr[0].length;
boolean[][] ret = new boolean[h][w];
for(int i = 0; i < h; i++) {
int y = i;
if(d == 2 || d == 3)
y = h-i-1;
for(int j = 0; j < w; j++) {
int x = j;
if(d == 1 || d == 3)
x = w-j-1;
ret[i][j] = arr[y][x];
}
}
return ret;
}
public static int bitsMsb(int bits) {
bits = bits | (bits >> 1);
bits = bits | (bits >> 2);
bits = bits | (bits >> 4);
bits = bits | (bits >> 8);
bits = bits | (bits >> 16);
return bits ^ (bits >> 1);
}
public static long bitsMsb(long bits) {
for(int i = 1; i <= 32; i *= 2)
bits |= bits >>i;
return bits ^ (bits>>1);
}
public static double log2(double x) {
// 特殊な値
if (Double.isNaN(x) || x < 0.0) return Double.NaN;
if (x == Double.POSITIVE_INFINITY) return Double.POSITIVE_INFINITY;
if (x == 0.0) return Double.NEGATIVE_INFINITY;
// ここから
int k = Math.getExponent(x);
if (k < Double.MIN_EXPONENT) {
// 非正規化数は取扱い注意！
k = Math.getExponent(x * 0x1.0p52) - 52;
}
if (k < 0) {
k++;
}
double s = Math.scalb(x, -k);
final double LOG2_E = 1.4426950408889634;
return k + LOG2_E * Math.log(s);
}
// 組み合わせの数を計算する(a個の中からb個を選ぶ）
//(10*9*8)/(3*2*1);
//10*9*8 -> ansMul
//3*2*1 -> ansDiv
static long calcComb(int a, int b) {
if (b > a - b) return calcComb(a, a - b);
long ansMul = 1;
long ansDiv = 1;
for (int i = 0; i < b; i++) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= mod;
ansDiv %= mod;
}
long ans = ansMul * modpow(ansDiv, mod - 2, mod) % mod;
return ans;
}
static boolean isOutBoard(int y, int x) {
return y < 0 || y >= H || x < 0 || x >= W;
}
static <T> int upperBound(T[] ar, T x) {
if(ar instanceof Integer[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Integer)t1 - (Integer)t2 > 0 ? 1 : -1);
}
else if(ar instanceof Long[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Long)t1 - (Long)t2 > 0 ? 1 : -1);
}
else if(ar instanceof Double[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Double)t1 - (Double)t2 > 0 ? 1 : -1);
}
else {
System.err.println(String.format("%s:数値でない配列を二分探索しています。",Thread.currentThread().getStackTrace()[1].getMethodName()));
throw new RuntimeException();
}
}
static <T> int lowerBound(T[] ar, T x) {
if(ar instanceof Integer[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Integer)t1 - (Integer)t2 >= 0 ? 1 : -1);
}
else if(ar instanceof Long[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Long)t1 - (Long)t2 >= 0 ? 1 : -1);
}
else if(ar instanceof Double[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Double)t1 - (Double)t2 >= 0 ? 1 : -1);
}
else {
System.err.println(String.format("%s:数値でない配列を二分探索しています。",Thread.currentThread().getStackTrace()[1].getMethodName()));
throw new RuntimeException();
}
}
// O(N log log N)
public static boolean[] sieve(int n) {
boolean[] isPrime = new boolean[n+1];
Arrays.fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for(int i = 2; i <= n; i++) {
if(isPrime[i]) {
for(int j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
// 与えられた配列の中身を辞書順に、次の順列をセットする（次がなければ false を返す）
public static boolean next_permutation(int[] a) {
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] < a[i + 1]) {
for (int j = a.length - 1;; j--) {
if (a[i] < a[j]) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
for (i++, j = a.length - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
}
}
return false;
}
public static boolean next_permutation(long[] a) {
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] < a[i + 1]) {
for (int j = a.length - 1;; j--) {
if (a[i] < a[j]) {
long temp = a[i];
a[i] = a[j];
a[j] = temp;
for (i++, j = a.length - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
}
}
return false;
}
private static int binarySearch2D(long key, long[][] a, int ind) {
return binarySearch2D(key, a, ind, 0, a.length);
}
private static int binarySearch2D(long key, long[][] ps, int ind, int fromIndex, int toIndex) {
int low = fromIndex;
int high = toIndex - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
long midVal = ps[mid][ind];
if (midVal < key)
low = mid + 1;
else if (midVal > key)
high = mid - 1;
else
return mid; // key found
}
return -(low + 1); // key not found.
}
private static int binarySearch2D(double key, double[][] a, int ind) {
return binarySearch2D(key, a, ind, 0, a.length);
}
private static int binarySearch2D(double key, double[][] ps, int ind, int fromIndex, int toIndex) {
int low = fromIndex;
int high = toIndex - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
double midVal = ps[mid][ind];
if (midVal < key)
low = mid + 1;
else if (midVal > key)
high = mid - 1;
else
return mid; // key found
}
return -(low + 1); // key not found.
}
//b^e mod m
private static long modpow(long b, long e, int m) {
long result = 1;
b %= m;
while(e > 0) {
if((e&1) == 1) result = (result * b) % m;
e >>= 1;
b = (b*b) % m;
}
return result;
}
private static int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a%b);
}
private static long gcd(long a, long b) {
if(b == 0) return a;
return gcd(b, a%b);
}
public static int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/** 拡張ユークリッド互除法
* ax + by = gcd(a, b) となる a, b の最大公約数と解 x, y を求める
* @param a ： 数値１(>0)
* @param b ： 数値２(>0)
* @return<int[] ： {[0]:gcd, [1]:x, [2]:y}：最大公約数(なし=1 [互いに素])と解 x, y
*/
public static final int[] extgcd(int a, int b) {
int x0 = 1, x1 = 0;
int y0 = 0, y1 = 1;
while (b != 0) {
int q = a / b;
int r = a % b;
int x2 = x0 - q * x1;
int y2 = y0 - q * y1;
a = b; b = r;
x0 = x1; x1 = x2;
y0 = y1; y1 = y2;
}
return new int[]{a, x0, y0};
}
static int digits(long x) {
int numDigits;
long d;
if (x < 0) {
if (x == Long.MIN_VALUE) return 20;
numDigits = 1;
d = - x;
} else {
numDigits = 0;
d = x;
}
if (d >= 1_0000_0000_0000_0000L) {
d /= 1_0000_0000_0000_0000L;
numDigits += 16;
}
if (d >= 1_0000_0000L) {
d /= 1_0000_0000L;
numDigits += 8;
}
if (d >= 1_0000L) {
d /= 1_0000L;
numDigits += 4;
}
if (d >= 1_00L) {
d /= 1_00L;
numDigits += 2;
}
return numDigits + (d >= 10L ? 2 : 1);
}
static int digits(int y) {
long x = y;
int numDigits;
long d;
if (x < 0) {
if (x == Long.MIN_VALUE) return 20;
numDigits = 1;
d = - x;
} else {
numDigits = 0;
d = x;
}
if (d >= 1_0000_0000_0000_0000L) {
d /= 1_0000_0000_0000_0000L;
numDigits += 16;
}
if (d >= 1_0000_0000L) {
d /= 1_0000_0000L;
numDigits += 8;
}
if (d >= 1_0000L) {
d /= 1_0000L;
numDigits += 4;
}
if (d >= 1_00L) {
d /= 1_00L;
numDigits += 2;
}
return numDigits + (d >= 10L ? 2 : 1);
}
}
class SegmentTree {
int inf = 0;
int[] node, lazy;
int n;
int mod = 998244353;
SegmentTree(int n){
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new int[x*2 -1];
lazy = new int[x*2 -1];
refresh();
}
SegmentTree(int[] arr){
int n = arr.length;
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new int[x*2 -1];
lazy = new int[x*2 -1];
reset(arr);
}
public int merge(int a, int b) {
return (a+b)%mod;
}
public int setNode(int k) {
return lazy[k];
}
public int empty() {
return -1;
}
public void reset(int[] arr) {
int ln = arr.length;
int i;
for(i = 0; i < ln; i++) {
node[i+n-1] = arr[i];
}
for(i = i+n; i < node.length; i++)
node[i] = inf;
for(i = n-2; i >= 0; i--)
node[i] = merge(node[i*2 +1], node[i*2 +2]);
Arrays.fill(lazy, inf);
}
public void refresh() {
Arrays.fill(node,inf);
Arrays.fill(lazy, inf);
}
public void update(int a, int b, int x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, int x, int k, int l, int r) {
if(b <= l || r <= a)
return;
if(a <= l && r <= b) {
lazy[k] = x;
eval(k);
}else {
update(a, b, x, k*2 +1, l, (l+r)/2);
update(a, b, x, k*2 +2, (l+r)/2, r);
node[k] = merge(node[k*2 +1], node[k*2 +2]);
}
}
public int query(int a, int b) {
int re = query(a, b, 0, 0, n);
if(re == inf)
re = empty();
return re;
}
public int query(int a, int b, int k, int l, int r) {
if(b <= l || r <= a)
return inf;
eval(k);
if(a <= l && r <= b)
return node[k];
else
return merge(query(a, b, k*2 +1, l, (l+r)/2), query(a, b, k*2 +2, (l+r)/2, r));
}
public void eval(int k) {
if(lazy[k] != inf) {
node[k] = setNode(k);
if(k*2 +2 < node.length) {
lazy[k*2 +1] = lazy[k];
lazy[k*2 +2] = lazy[k];
}
lazy[k] = inf;
}
}
public void evalAll() {
for(int j = 0; j < lazy.length; j++) {
eval(j);
}
}
public void getArr(int[] arr) {
int ln = arr.length;
evalAll();
for(int i = 0; i < ln; i++) {
int re = node[i+n-1];
if(re == inf)
re = empty();
arr[i] = re;
}
}
}
class SegmentTreeL {
long inf = Long.MIN_VALUE/2;
long[] node, lazy;
int n;
SegmentTreeL(int n){
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new long[x*2 -1];
lazy = new long[x*2 -1];
refresh();
}
SegmentTreeL(long[] arr){
int n = arr.length;
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new long[x*2 -1];
lazy = new long[x*2 -1];
reset(arr);
}
public long merge(long a, long b) {
return Math.max(a, b);
}
public long setNode(int k) {
return lazy[k];
}
public long empty() {
return -1;
}
public void reset(long[] arr) {
int ln = arr.length;
int i;
for(i = 0; i < ln; i++) {
node[i+n-1] = arr[i];
}
for(i = i+n; i < node.length; i++)
node[i] = inf;
for(i = n-2; i >= 0; i--)
node[i] = merge(node[i*2 +1], node[i*2 +2]);
Arrays.fill(lazy, inf);
}
public void refresh() {
Arrays.fill(node,inf);
Arrays.fill(lazy, inf);
}
public void update(int a, int b, long x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, long x, int k, int l, int r) {
if(b <= l || r <= a)
return;
if(a <= l && r <= b) {
lazy[k] = x;
eval(k);
}else {
update(a, b, x, k*2 +1, l, (l+r)/2);
update(a, b, x, k*2 +2, (l+r)/2, r);
node[k] = merge(node[k*2 +1], node[k*2 +2]);
}
}
public long query(int a, int b) {
long re = query(a, b, 0, 0, n);
if(re == inf)
re = empty();
return re;
}
public long query(int a, int b, int k, int l, int r) {
if(b <= l || r <= a)
return inf;
eval(k);
if(a <= l && r <= b)
return node[k];
else
return merge(query(a, b, k*2 +1, l, (l+r)/2), query(a, b, k*2 +2, (l+r)/2, r));
}
public void eval(int k) {
if(lazy[k] != inf) {
node[k] = setNode(k);
if(k*2 +2 < node.length) {
lazy[k*2 +1] = lazy[k];
lazy[k*2 +2] = lazy[k];
}
lazy[k] = inf;
}
}
public void evalAll() {
for(int j = 0; j < lazy.length; j++) {
eval(j);
}
}
public void getArr(long[] arr) {
int ln = arr.length;
evalAll();
for(int i = 0; i < ln; i++) {
long re = node[i+n-1];
if(re == inf)
re = empty();
arr[i] = re;
}
}
}
class a {
public List<Integer> l = new ArrayList<>();
public a(){
}
public void add(int n){
l.add(n);
}
public int gf() {
return l.get(0);
}
public int get(int n) {
return l.get(n);
}
public int size() {
return l.size();
}
}
class cmp implements Comparator<a> {
@Override
public int compare(a p1, a p2) {
int ind = 0;
while(ind < p1.size()) {
if(p1.get(ind) != p2.get(ind))
return p1.get(ind) - p2.get(ind);
ind++;
}
return 0;
}
}
//class Pair{
// int a;
// int b;
//
// public Pair(int a, int b) {
// this.a = a;
// this.b = b;
// }
//}
class Pair{
int a;
Integer b;
public Pair(int a, int b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
Pair p = (Pair)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class PairIL{
int a;
Long b;
public PairIL(int a, long b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
PairIL p = (PairIL)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class PairID{
int a;
Double b;
public PairID(int a, double b) {
this.a = a;
this.b = b;
}
}
class PairLL{
long a;
long b;
public PairLL(long a, long b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
PairLL p = (PairLL)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class Trio{
int a;
int b;
int c;
public Trio(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioILI{
int a;
long b;
int c;
public TrioILI(int a, long b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioILL{
int a;
Long b;
Long c;
public TrioILL(int a, long b, long c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioIIL{
int a;
int b;
Long c;
public TrioIIL(int a, int b, long c) {
this.a = a;
this.b = b;
this.c = c;
}
public boolean equals(Object o) {
TrioIIL t = (TrioIIL)o;
return (this.a == t.a && this.b == t.b && this.c == t.c);
}
public int hashCode() {
return ("" + a + " " + b + " " + c).hashCode();
}
}
class Quar{
int a;
int b;
int c;
int d;
public Quar(int a, int b, int c, int d) {
this.a = a;
this.b = b;
this.c = c;
this.d = d;
}
}
class UnionFind{
int[] parent;
int[] rank;
int[] size;
public UnionFind(int n){
this.parent = new int[n];
this.rank = new int[n];
this.size = new int[n];
for(int i = 0; i < n; i++) set(i);
}
public void set(int i) {
parent[i] = i;
rank[i] = 0;
size[i] = 1;
}
public int find(int i) {
if (i == parent[i])
return parent[i];
else
return parent[i] = find(parent[i]);
}
public boolean same(int x, int y){
return find(x) == find(y);
}
public void unite(int x, int y) {
int xroot = find(x);
int yroot = find(y);
if(xroot == yroot)
return;
if(rank[xroot] > rank[yroot]) {
parent[yroot] = xroot;
size[xroot] += size[yroot];
}
else if(rank[xroot] < rank[yroot]) {
parent[xroot] = yroot;
size[yroot] += size[xroot];
}
else {
parent[yroot] = xroot;
size[xroot] += size[yroot];
rank[xroot]++;
}
}
public int get_size(int i) {
return size[find(i)];
}
public int group_num() {
Set<Integer> parents = new HashSet<>();
for(int i = 1; i < this.parent.length; i++)
parents.add(find(i));
return parents.size();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in2) {
}
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 static boolean isNewLineChar(int c) {return 10 <= c && c <= 13;}
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 String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLineChar(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());}
}
/*
* AVL木
*
* add O(logN)
* remove O(logN)
* find O(logN) return true | false
* get O(logN) 存在しなかったらnullを返す
* get_upper O(logN) 存在しなかったらnullを返す
* get_lower O(logN) 存在しなかったらnullを返す
* get_greater O(logN) 存在しなかったらnullを返す
* get_less_than O(logN) 存在しなかったらnullを返す
* get_list O(N)
*
* getSize O(1)
* getArray O(N)
*
*/
class AVLTree<K extends Comparable<? super K>> { // K:キーの型, V:値の型
///////////////////////////////////////////////////////////////////////////
// 共通定義
///////////////////////////////////////////////////////////////////////////
private class Node { // ノードの型
int height; // そのノードを根とする部分木の高さ
K key; // そのノードのキー
Node lst = null; // 左部分木
Node rst = null; // 右部分木
Node(int height, K key) {
this.height = height;
this.key = key;
}
}
private Node root = null; // AVL木の根
private boolean change; // 修正が必要かを示すフラグ(true:必要, false:不要)
private K lmax; // 左部分木のキーの最大値
private int size = 0;
// 部分木 t の高さを返す
private int height(Node t) { return t == null ? 0 : t.height; }
// 左右の部分木の高さの差を返す。左が高いと正、右が高いと負
private int bias(Node t) { return height(t.lst) - height(t.rst); }
// 左右の部分木の高さから、その木の高さを計算して修正する
private void modHeight(Node t) {
t.height = 1 + Math.max(height(t.lst), height(t.rst));
}
// ２分探索木 v の左回転。回転した木を返す
private Node rotateL(Node v) {
Node u = v.rst, t2 = u.lst;
u.lst = v; v.rst = t2;
modHeight(u.lst);
modHeight(u);
return u;
}
// ２分探索木 u の右回転。回転した木を返す
private Node rotateR(Node u) {
Node v = u.lst, t2 = v.rst;
v.rst = u; u.lst = t2;
modHeight(v.rst);
modHeight(v);
return v;
}
// ２分探索木 t の二重回転(左回転 -> 右回転)。回転した木を返す
private Node rotateLR(Node t) {
t.lst = rotateL(t.lst);
return rotateR(t);
}
// ２分探索木 t の二重回転(右回転 -> 左回転)。回転した木を返す
private Node rotateRL(Node t) {
t.rst = rotateR(t.rst);
return rotateL(t);
}
///////////////////////////////////////////////////////////////////////////
// バランス回復
///////////////////////////////////////////////////////////////////////////
// 挿入時の修正(balanceLi:左部分木への挿入, balanceRi:右部分木への挿入)
private Node balanceLi(Node t) { return balanceL(t); }
private Node balanceRi(Node t) { return balanceR(t); }
// 削除時の修正(balanceLd:左部分木での削除, balanceRd:右部分木での削除)
private Node balanceLd(Node t) { return balanceR(t); }
private Node balanceRd(Node t) { return balanceL(t); }
// 部分木 t のバランスを回復して戻り値で返す
// 左部分木への挿入に伴うAVL木の修正
// 右部分木での削除に伴うAVL木の修正
private Node balanceL(Node t) {
if (!change) return t;
int h = height(t);
if (bias(t) == 2) {
if (bias(t.lst) >= 0)
t = rotateR(t);
else
t = rotateLR(t);
}
else modHeight(t);
change = (h != height(t));
return t;
}
// 部分木 t のバランスを回復して戻り値で返す
// 右部分木への挿入に伴うAVL木の修正
// 左部分木での削除に伴うAVL木の修正
private Node balanceR(Node t) {
if (!change) return t;
int h = height(t);
if (bias(t) == -2) {
if (bias(t.rst) <= 0)
t = rotateL(t);
else
t = rotateRL(t);
}
else modHeight(t);
change = (h != height(t));
return t;
}
///////////////////////////////////////////////////////////////////////////
// insert(挿入)
///////////////////////////////////////////////////////////////////////////
// エントリー(key, x のペア)を挿入する
public void add(K key) {
root = add(root, key);
size++;
}
private Node add(Node t, K key) {
if (t == null) {
change = true;
return new Node(1, key);
}
else if (key.compareTo(t.key) < 0) {
t.lst = add(t.lst, key);
return balanceLi(t);
}
else if (key.compareTo(t.key) > 0) {
t.rst = add(t.rst, key);
return balanceRi(t);
}
else {
change = false;
size--;
return t;
}
}
///////////////////////////////////////////////////////////////////////////
// delete(削除)
///////////////////////////////////////////////////////////////////////////
// key で指すエントリー(ノード)を削除する
public void remove(K key) {
root = remove(root, key);
size--;
}
private Node remove(Node t, K key) {
if (t == null) {
change = false;
size++;
return null;
}
else if (key.compareTo(t.key) < 0) {
t.lst = remove(t.lst, key);
return balanceLd(t);
}
else if (key.compareTo(t.key) > 0) {
t.rst = remove(t.rst, key);
return balanceRd(t);
}
else {
if (t.lst == null) {
change = true;
return t.rst; // 右部分木を昇格させる
}
else {
t.lst = deleteMax(t.lst); // 左部分木の最大値を削除する
t.key = lmax; // 左部分木の削除した最大値で置き換える
return balanceLd(t);
}
}
}
// 部分木 t の最大値のノードを削除する
// 戻り値は削除により修正された部分木
// 削除した最大値を lmax に保存する
private Node deleteMax(Node t) {
if (t.rst != null) {
t.rst = deleteMax(t.rst);
return balanceRd(t);
}
else {
change = true;
lmax = t.key; // 部分木のキーの最大値を保存
return t.lst; // 左部分木を昇格させる
}
}
///////////////////////////////////////////////////////////////////////////
// 検索等
///////////////////////////////////////////////////////////////////////////
// キーの検索。ヒットすれば true、しなければ false
public boolean find(K key) {
Node t = root;
while (t != null) {
if (key.compareTo(t.key) < 0) t = t.lst;
else if (key.compareTo(t.key) > 0) t = t.rst;
else return true;
}
return false;
}
// キーから値を得る。キーがヒットしない場合は null を返す
public K get(K key) {
Node t = root;
while (t != null) {
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else return t.key;
}
return null;
}
public K get_upper(K key) {
K up = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) >= 0)
if(up == null)
up = t.key;
else if(t.key.compareTo(up) < 0)
up = t.key;
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else
return t.key;
}
return up;
}
public K get_lower(K key) {
K lw = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) <= 0)
if(lw == null)
lw = t.key;
else if(t.key.compareTo(lw) > 0)
lw = t.key;
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else
return t.key;
}
return lw;
}
public K get_greater(K key) {
K gt = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) > 0)
if(gt == null)
gt = t.key;
else if(t.key.compareTo(gt) < 0)
gt = t.key;
if(key.compareTo(t.key) < 0)
t = t.lst;
else
t = t.rst;
}
return gt;
}
public K get_less_than(K key) {
K lt = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) < 0)
if(lt == null)
lt = t.key;
else if(t.key.compareTo(lt) > 0)
lt = t.key;
if(key.compareTo(t.key) <= 0)
t = t.lst;
else
t = t.rst;
}
return lt;
}
// マップが空なら true、空でないなら false
public boolean isEmpty() { return root == null; }
// マップを空にする
public void clear() { root = null; }
// キーのリスト
public ArrayList<K> keys() {
ArrayList<K> al = new ArrayList<K>();
keys(root, al);
return al;
}
public int getSize() {
return size;
}
// キーの最小値
public K min() {
Node t = root;
if (t == null) return null;
while (t.lst != null) t = t.lst;
return t.key;
}
// キーの最大値
public K max() {
Node t = root;
if (t == null) return null;
while (t.rst != null) t = t.rst;
return t.key;
}
private void keys(Node t, ArrayList<K> al) {
if (t != null) {
keys(t.lst, al);
al.add(t.key);
keys(t.rst, al);
}
}
///////////////////////////////////////////////////////////////////////////
// debug 用ルーチン
///////////////////////////////////////////////////////////////////////////
// AVL木をグラフ文字列に変換する
public String toString() {
return toGraph("", "", root).replaceAll("\\s+$", "");
}
// AVL木のバランスが取れているか確認する
public boolean balanced() { return balanced(root); }
// ２分探索木になっているか確認する
public boolean bstValid() { return bstValid(root); }
private String toGraph(String head, String bar, Node t) {
String graph = "";
if (t != null) {
graph += toGraph(head + " ", "／", t.rst);
String node = "" + t.height;
node += ":" + t.key;
graph += String.format("%s%s%s%n", head, bar, node);
graph += toGraph(head + " ", "＼", t.lst);
}
return graph;
}
private boolean balanced(Node t) {
if (t == null) return true;
return Math.abs(bias(t)) <= 1 && balanced(t.lst) && balanced(t.rst);
}
private boolean bstValid(Node t) {
if (t == null) return true;
boolean flag = small(t.key, t.lst) && large(t.key, t.rst);
return flag && bstValid(t.lst) && bstValid(t.rst);
}
private boolean small(K key, Node t) {
if (t == null) return true;
boolean flag = key.compareTo(t.key) > 0;
return flag && small(key, t.lst) && small(key, t.rst);
}
private boolean large(K key, Node t) {
if (t == null) return true;
boolean flag = key.compareTo(t.key) < 0;
return flag && large(key, t.lst) && large(key, t.rst);
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.Set;
public class Main {
static int mod = (int) (Math.pow(10, 9)+7);
static final int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
static final int[] dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }, dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 };
static final int[] dx9 = { -1, -1, -1, 0, 0, 0, 1, 1, 1 }, dy9 = { -1, 0, 1, -1, 0, 1, -1, 0, 1 };
static final int inf = Integer.MAX_VALUE / 2;
static final int minf = inf * -1;
static final long infL = Long.MAX_VALUE / 2;
static final long minfL = infL * -1;
static final double infD = Double.MAX_VALUE / 3;
static final double eps = 1e-10;
static final double pi = Math.PI;
static final double pi2 = pi*2;
static int H, W;
static StringBuilder out = new StringBuilder();
public static void main(String[] args) {
FastScanner sc = new FastScanner(System.in);
int n = sc.nextInt();
int[] s = new int[n];
for(int i = 0; i < n; i++) {
s[i] = sc.nextInt();
}
while(true) {
int[] bc = new int[31];
for(int i = 0; i < n; i++) {
int tmp = s[i];
for(int j = 0; j < 31; j++) {
if((tmp & 1) == 1) {
bc[j]++;
}
tmp >>= 1;
}
}
long max = 0;
int maxv = -1;
for(int i = 0; i < n; i++) {
int tmp = s[i];
long sum = 0;
for(int j = 0; j < 31; j++) {
if((tmp & 1) == 1) {
sum += (n-bc[j]*2)*(1L<<(j+3));
}
tmp >>= 1;
}
if(sum > max) {
max = sum;
maxv = s[i];
}
}
if(maxv == -1)
break;
for(int i = 0; i < n; i++)
s[i] ^= maxv;
}
long ans = 0;
for(int i = 0; i < n; i++) {
ans += s[i];
}
out.append(ans);
System.out.println(out);
}
/// ///
/// ライブラリ ///
/// ///
public static boolean[][] rotate(int d, boolean[][] arr){
if(d == 0)
return arr;
int h = arr.length;
int w = arr[0].length;
boolean[][] ret = new boolean[h][w];
for(int i = 0; i < h; i++) {
int y = i;
if(d == 2 || d == 3)
y = h-i-1;
for(int j = 0; j < w; j++) {
int x = j;
if(d == 1 || d == 3)
x = w-j-1;
ret[i][j] = arr[y][x];
}
}
return ret;
}
public static int bitsMsb(int bits) {
bits = bits | (bits >> 1);
bits = bits | (bits >> 2);
bits = bits | (bits >> 4);
bits = bits | (bits >> 8);
bits = bits | (bits >> 16);
return bits ^ (bits >> 1);
}
public static long bitsMsb(long bits) {
for(int i = 1; i <= 32; i *= 2)
bits |= bits >>i;
return bits ^ (bits>>1);
}
public static double log2(double x) {
// 特殊な値
if (Double.isNaN(x) || x < 0.0) return Double.NaN;
if (x == Double.POSITIVE_INFINITY) return Double.POSITIVE_INFINITY;
if (x == 0.0) return Double.NEGATIVE_INFINITY;
// ここから
int k = Math.getExponent(x);
if (k < Double.MIN_EXPONENT) {
// 非正規化数は取扱い注意！
k = Math.getExponent(x * 0x1.0p52) - 52;
}
if (k < 0) {
k++;
}
double s = Math.scalb(x, -k);
final double LOG2_E = 1.4426950408889634;
return k + LOG2_E * Math.log(s);
}
// 組み合わせの数を計算する(a個の中からb個を選ぶ）
//(10*9*8)/(3*2*1);
//10*9*8 -> ansMul
//3*2*1 -> ansDiv
static long calcComb(int a, int b) {
if (b > a - b) return calcComb(a, a - b);
long ansMul = 1;
long ansDiv = 1;
for (int i = 0; i < b; i++) {
ansMul *= (a - i);
ansDiv *= (i + 1);
ansMul %= mod;
ansDiv %= mod;
}
long ans = ansMul * modpow(ansDiv, mod - 2, mod) % mod;
return ans;
}
static boolean isOutBoard(int y, int x) {
return y < 0 || y >= H || x < 0 || x >= W;
}
static <T> int upperBound(T[] ar, T x) {
if(ar instanceof Integer[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Integer)t1 - (Integer)t2 > 0 ? 1 : -1);
}
else if(ar instanceof Long[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Long)t1 - (Long)t2 > 0 ? 1 : -1);
}
else if(ar instanceof Double[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Double)t1 - (Double)t2 > 0 ? 1 : -1);
}
else {
System.err.println(String.format("%s:数値でない配列を二分探索しています。",Thread.currentThread().getStackTrace()[1].getMethodName()));
throw new RuntimeException();
}
}
static <T> int lowerBound(T[] ar, T x) {
if(ar instanceof Integer[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Integer)t1 - (Integer)t2 >= 0 ? 1 : -1);
}
else if(ar instanceof Long[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Long)t1 - (Long)t2 >= 0 ? 1 : -1);
}
else if(ar instanceof Double[]) {
return ~Arrays.binarySearch(ar, x, (t1, t2) -> (Double)t1 - (Double)t2 >= 0 ? 1 : -1);
}
else {
System.err.println(String.format("%s:数値でない配列を二分探索しています。",Thread.currentThread().getStackTrace()[1].getMethodName()));
throw new RuntimeException();
}
}
// O(N log log N)
public static boolean[] sieve(int n) {
boolean[] isPrime = new boolean[n+1];
Arrays.fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for(int i = 2; i <= n; i++) {
if(isPrime[i]) {
for(int j = 2 * i; j <= n; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
// 与えられた配列の中身を辞書順に、次の順列をセットする（次がなければ false を返す）
public static boolean next_permutation(int[] a) {
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] < a[i + 1]) {
for (int j = a.length - 1;; j--) {
if (a[i] < a[j]) {
int temp = a[i];
a[i] = a[j];
a[j] = temp;
for (i++, j = a.length - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
}
}
return false;
}
public static boolean next_permutation(long[] a) {
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] < a[i + 1]) {
for (int j = a.length - 1;; j--) {
if (a[i] < a[j]) {
long temp = a[i];
a[i] = a[j];
a[j] = temp;
for (i++, j = a.length - 1; i < j; i++, j--) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
return true;
}
}
}
}
return false;
}
private static int binarySearch2D(long key, long[][] a, int ind) {
return binarySearch2D(key, a, ind, 0, a.length);
}
private static int binarySearch2D(long key, long[][] ps, int ind, int fromIndex, int toIndex) {
int low = fromIndex;
int high = toIndex - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
long midVal = ps[mid][ind];
if (midVal < key)
low = mid + 1;
else if (midVal > key)
high = mid - 1;
else
return mid; // key found
}
return -(low + 1); // key not found.
}
private static int binarySearch2D(double key, double[][] a, int ind) {
return binarySearch2D(key, a, ind, 0, a.length);
}
private static int binarySearch2D(double key, double[][] ps, int ind, int fromIndex, int toIndex) {
int low = fromIndex;
int high = toIndex - 1;
while (low <= high) {
int mid = (low + high) >>> 1;
double midVal = ps[mid][ind];
if (midVal < key)
low = mid + 1;
else if (midVal > key)
high = mid - 1;
else
return mid; // key found
}
return -(low + 1); // key not found.
}
//b^e mod m
private static long modpow(long b, long e, int m) {
long result = 1;
b %= m;
while(e > 0) {
if((e&1) == 1) result = (result * b) % m;
e >>= 1;
b = (b*b) % m;
}
return result;
}
private static int gcd(int a, int b) {
if(b == 0) return a;
return gcd(b, a%b);
}
private static long gcd(long a, long b) {
if(b == 0) return a;
return gcd(b, a%b);
}
public static int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
public static long lcm(long a, long b) {
return a / gcd(a, b) * b;
}
/** 拡張ユークリッド互除法
* ax + by = gcd(a, b) となる a, b の最大公約数と解 x, y を求める
* @param a ： 数値１(>0)
* @param b ： 数値２(>0)
* @return<int[] ： {[0]:gcd, [1]:x, [2]:y}：最大公約数(なし=1 [互いに素])と解 x, y
*/
public static final int[] extgcd(int a, int b) {
int x0 = 1, x1 = 0;
int y0 = 0, y1 = 1;
while (b != 0) {
int q = a / b;
int r = a % b;
int x2 = x0 - q * x1;
int y2 = y0 - q * y1;
a = b; b = r;
x0 = x1; x1 = x2;
y0 = y1; y1 = y2;
}
return new int[]{a, x0, y0};
}
static int digits(long x) {
int numDigits;
long d;
if (x < 0) {
if (x == Long.MIN_VALUE) return 20;
numDigits = 1;
d = - x;
} else {
numDigits = 0;
d = x;
}
if (d >= 1_0000_0000_0000_0000L) {
d /= 1_0000_0000_0000_0000L;
numDigits += 16;
}
if (d >= 1_0000_0000L) {
d /= 1_0000_0000L;
numDigits += 8;
}
if (d >= 1_0000L) {
d /= 1_0000L;
numDigits += 4;
}
if (d >= 1_00L) {
d /= 1_00L;
numDigits += 2;
}
return numDigits + (d >= 10L ? 2 : 1);
}
static int digits(int y) {
long x = y;
int numDigits;
long d;
if (x < 0) {
if (x == Long.MIN_VALUE) return 20;
numDigits = 1;
d = - x;
} else {
numDigits = 0;
d = x;
}
if (d >= 1_0000_0000_0000_0000L) {
d /= 1_0000_0000_0000_0000L;
numDigits += 16;
}
if (d >= 1_0000_0000L) {
d /= 1_0000_0000L;
numDigits += 8;
}
if (d >= 1_0000L) {
d /= 1_0000L;
numDigits += 4;
}
if (d >= 1_00L) {
d /= 1_00L;
numDigits += 2;
}
return numDigits + (d >= 10L ? 2 : 1);
}
}
class SegmentTree {
int inf = 0;
int[] node, lazy;
int n;
int mod = 998244353;
SegmentTree(int n){
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new int[x*2 -1];
lazy = new int[x*2 -1];
refresh();
}
SegmentTree(int[] arr){
int n = arr.length;
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new int[x*2 -1];
lazy = new int[x*2 -1];
reset(arr);
}
public int merge(int a, int b) {
return (a+b)%mod;
}
public int setNode(int k) {
return lazy[k];
}
public int empty() {
return -1;
}
public void reset(int[] arr) {
int ln = arr.length;
int i;
for(i = 0; i < ln; i++) {
node[i+n-1] = arr[i];
}
for(i = i+n; i < node.length; i++)
node[i] = inf;
for(i = n-2; i >= 0; i--)
node[i] = merge(node[i*2 +1], node[i*2 +2]);
Arrays.fill(lazy, inf);
}
public void refresh() {
Arrays.fill(node,inf);
Arrays.fill(lazy, inf);
}
public void update(int a, int b, int x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, int x, int k, int l, int r) {
if(b <= l || r <= a)
return;
if(a <= l && r <= b) {
lazy[k] = x;
eval(k);
}else {
update(a, b, x, k*2 +1, l, (l+r)/2);
update(a, b, x, k*2 +2, (l+r)/2, r);
node[k] = merge(node[k*2 +1], node[k*2 +2]);
}
}
public int query(int a, int b) {
int re = query(a, b, 0, 0, n);
if(re == inf)
re = empty();
return re;
}
public int query(int a, int b, int k, int l, int r) {
if(b <= l || r <= a)
return inf;
eval(k);
if(a <= l && r <= b)
return node[k];
else
return merge(query(a, b, k*2 +1, l, (l+r)/2), query(a, b, k*2 +2, (l+r)/2, r));
}
public void eval(int k) {
if(lazy[k] != inf) {
node[k] = setNode(k);
if(k*2 +2 < node.length) {
lazy[k*2 +1] = lazy[k];
lazy[k*2 +2] = lazy[k];
}
lazy[k] = inf;
}
}
public void evalAll() {
for(int j = 0; j < lazy.length; j++) {
eval(j);
}
}
public void getArr(int[] arr) {
int ln = arr.length;
evalAll();
for(int i = 0; i < ln; i++) {
int re = node[i+n-1];
if(re == inf)
re = empty();
arr[i] = re;
}
}
}
class SegmentTreeL {
long inf = Long.MIN_VALUE/2;
long[] node, lazy;
int n;
SegmentTreeL(int n){
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new long[x*2 -1];
lazy = new long[x*2 -1];
refresh();
}
SegmentTreeL(long[] arr){
int n = arr.length;
int x = 1;
while(n > x) x *= 2;
this.n = x;
node = new long[x*2 -1];
lazy = new long[x*2 -1];
reset(arr);
}
public long merge(long a, long b) {
return Math.max(a, b);
}
public long setNode(int k) {
return lazy[k];
}
public long empty() {
return -1;
}
public void reset(long[] arr) {
int ln = arr.length;
int i;
for(i = 0; i < ln; i++) {
node[i+n-1] = arr[i];
}
for(i = i+n; i < node.length; i++)
node[i] = inf;
for(i = n-2; i >= 0; i--)
node[i] = merge(node[i*2 +1], node[i*2 +2]);
Arrays.fill(lazy, inf);
}
public void refresh() {
Arrays.fill(node,inf);
Arrays.fill(lazy, inf);
}
public void update(int a, int b, long x) {
update(a, b, x, 0, 0, n);
}
public void update(int a, int b, long x, int k, int l, int r) {
if(b <= l || r <= a)
return;
if(a <= l && r <= b) {
lazy[k] = x;
eval(k);
}else {
update(a, b, x, k*2 +1, l, (l+r)/2);
update(a, b, x, k*2 +2, (l+r)/2, r);
node[k] = merge(node[k*2 +1], node[k*2 +2]);
}
}
public long query(int a, int b) {
long re = query(a, b, 0, 0, n);
if(re == inf)
re = empty();
return re;
}
public long query(int a, int b, int k, int l, int r) {
if(b <= l || r <= a)
return inf;
eval(k);
if(a <= l && r <= b)
return node[k];
else
return merge(query(a, b, k*2 +1, l, (l+r)/2), query(a, b, k*2 +2, (l+r)/2, r));
}
public void eval(int k) {
if(lazy[k] != inf) {
node[k] = setNode(k);
if(k*2 +2 < node.length) {
lazy[k*2 +1] = lazy[k];
lazy[k*2 +2] = lazy[k];
}
lazy[k] = inf;
}
}
public void evalAll() {
for(int j = 0; j < lazy.length; j++) {
eval(j);
}
}
public void getArr(long[] arr) {
int ln = arr.length;
evalAll();
for(int i = 0; i < ln; i++) {
long re = node[i+n-1];
if(re == inf)
re = empty();
arr[i] = re;
}
}
}
class a {
public List<Integer> l = new ArrayList<>();
public a(){
}
public void add(int n){
l.add(n);
}
public int gf() {
return l.get(0);
}
public int get(int n) {
return l.get(n);
}
public int size() {
return l.size();
}
}
class cmp implements Comparator<a> {
@Override
public int compare(a p1, a p2) {
int ind = 0;
while(ind < p1.size()) {
if(p1.get(ind) != p2.get(ind))
return p1.get(ind) - p2.get(ind);
ind++;
}
return 0;
}
}
//class Pair{
// int a;
// int b;
//
// public Pair(int a, int b) {
// this.a = a;
// this.b = b;
// }
//}
class Pair{
int a;
Integer b;
public Pair(int a, int b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
Pair p = (Pair)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class PairIL{
int a;
Long b;
public PairIL(int a, long b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
PairIL p = (PairIL)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class PairID{
int a;
Double b;
public PairID(int a, double b) {
this.a = a;
this.b = b;
}
}
class PairLL{
long a;
long b;
public PairLL(long a, long b) {
this.a = a;
this.b = b;
}
public boolean equals(Object o) {
PairLL p = (PairLL)o;
return (this.a == p.a && this.b == p.b);
}
public int hashCode() {
return ("" + a + " " + b).hashCode();
}
}
class Trio{
int a;
int b;
int c;
public Trio(int a, int b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioILI{
int a;
long b;
int c;
public TrioILI(int a, long b, int c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioILL{
int a;
Long b;
Long c;
public TrioILL(int a, long b, long c) {
this.a = a;
this.b = b;
this.c = c;
}
}
class TrioIIL{
int a;
int b;
Long c;
public TrioIIL(int a, int b, long c) {
this.a = a;
this.b = b;
this.c = c;
}
public boolean equals(Object o) {
TrioIIL t = (TrioIIL)o;
return (this.a == t.a && this.b == t.b && this.c == t.c);
}
public int hashCode() {
return ("" + a + " " + b + " " + c).hashCode();
}
}
class Quar{
int a;
int b;
int c;
int d;
public Quar(int a, int b, int c, int d) {
this.a = a;
this.b = b;
this.c = c;
this.d = d;
}
}
class UnionFind{
int[] parent;
int[] rank;
int[] size;
public UnionFind(int n){
this.parent = new int[n];
this.rank = new int[n];
this.size = new int[n];
for(int i = 0; i < n; i++) set(i);
}
public void set(int i) {
parent[i] = i;
rank[i] = 0;
size[i] = 1;
}
public int find(int i) {
if (i == parent[i])
return parent[i];
else
return parent[i] = find(parent[i]);
}
public boolean same(int x, int y){
return find(x) == find(y);
}
public void unite(int x, int y) {
int xroot = find(x);
int yroot = find(y);
if(xroot == yroot)
return;
if(rank[xroot] > rank[yroot]) {
parent[yroot] = xroot;
size[xroot] += size[yroot];
}
else if(rank[xroot] < rank[yroot]) {
parent[xroot] = yroot;
size[yroot] += size[xroot];
}
else {
parent[yroot] = xroot;
size[xroot] += size[yroot];
rank[xroot]++;
}
}
public int get_size(int i) {
return size[find(i)];
}
public int group_num() {
Set<Integer> parents = new HashSet<>();
for(int i = 1; i < this.parent.length; i++)
parents.add(find(i));
return parents.size();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in2) {
}
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 static boolean isNewLineChar(int c) {return 10 <= c && c <= 13;}
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 String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(!isNewLineChar(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());}
}
/*
* AVL木
*
* add O(logN)
* remove O(logN)
* find O(logN) return true | false
* get O(logN) 存在しなかったらnullを返す
* get_upper O(logN) 存在しなかったらnullを返す
* get_lower O(logN) 存在しなかったらnullを返す
* get_greater O(logN) 存在しなかったらnullを返す
* get_less_than O(logN) 存在しなかったらnullを返す
* get_list O(N)
*
* getSize O(1)
* getArray O(N)
*
*/
class AVLTree<K extends Comparable<? super K>> { // K:キーの型, V:値の型
///////////////////////////////////////////////////////////////////////////
// 共通定義
///////////////////////////////////////////////////////////////////////////
private class Node { // ノードの型
int height; // そのノードを根とする部分木の高さ
K key; // そのノードのキー
Node lst = null; // 左部分木
Node rst = null; // 右部分木
Node(int height, K key) {
this.height = height;
this.key = key;
}
}
private Node root = null; // AVL木の根
private boolean change; // 修正が必要かを示すフラグ(true:必要, false:不要)
private K lmax; // 左部分木のキーの最大値
private int size = 0;
// 部分木 t の高さを返す
private int height(Node t) { return t == null ? 0 : t.height; }
// 左右の部分木の高さの差を返す。左が高いと正、右が高いと負
private int bias(Node t) { return height(t.lst) - height(t.rst); }
// 左右の部分木の高さから、その木の高さを計算して修正する
private void modHeight(Node t) {
t.height = 1 + Math.max(height(t.lst), height(t.rst));
}
// ２分探索木 v の左回転。回転した木を返す
private Node rotateL(Node v) {
Node u = v.rst, t2 = u.lst;
u.lst = v; v.rst = t2;
modHeight(u.lst);
modHeight(u);
return u;
}
// ２分探索木 u の右回転。回転した木を返す
private Node rotateR(Node u) {
Node v = u.lst, t2 = v.rst;
v.rst = u; u.lst = t2;
modHeight(v.rst);
modHeight(v);
return v;
}
// ２分探索木 t の二重回転(左回転 -> 右回転)。回転した木を返す
private Node rotateLR(Node t) {
t.lst = rotateL(t.lst);
return rotateR(t);
}
// ２分探索木 t の二重回転(右回転 -> 左回転)。回転した木を返す
private Node rotateRL(Node t) {
t.rst = rotateR(t.rst);
return rotateL(t);
}
///////////////////////////////////////////////////////////////////////////
// バランス回復
///////////////////////////////////////////////////////////////////////////
// 挿入時の修正(balanceLi:左部分木への挿入, balanceRi:右部分木への挿入)
private Node balanceLi(Node t) { return balanceL(t); }
private Node balanceRi(Node t) { return balanceR(t); }
// 削除時の修正(balanceLd:左部分木での削除, balanceRd:右部分木での削除)
private Node balanceLd(Node t) { return balanceR(t); }
private Node balanceRd(Node t) { return balanceL(t); }
// 部分木 t のバランスを回復して戻り値で返す
// 左部分木への挿入に伴うAVL木の修正
// 右部分木での削除に伴うAVL木の修正
private Node balanceL(Node t) {
if (!change) return t;
int h = height(t);
if (bias(t) == 2) {
if (bias(t.lst) >= 0)
t = rotateR(t);
else
t = rotateLR(t);
}
else modHeight(t);
change = (h != height(t));
return t;
}
// 部分木 t のバランスを回復して戻り値で返す
// 右部分木への挿入に伴うAVL木の修正
// 左部分木での削除に伴うAVL木の修正
private Node balanceR(Node t) {
if (!change) return t;
int h = height(t);
if (bias(t) == -2) {
if (bias(t.rst) <= 0)
t = rotateL(t);
else
t = rotateRL(t);
}
else modHeight(t);
change = (h != height(t));
return t;
}
///////////////////////////////////////////////////////////////////////////
// insert(挿入)
///////////////////////////////////////////////////////////////////////////
// エントリー(key, x のペア)を挿入する
public void add(K key) {
root = add(root, key);
size++;
}
private Node add(Node t, K key) {
if (t == null) {
change = true;
return new Node(1, key);
}
else if (key.compareTo(t.key) < 0) {
t.lst = add(t.lst, key);
return balanceLi(t);
}
else if (key.compareTo(t.key) > 0) {
t.rst = add(t.rst, key);
return balanceRi(t);
}
else {
change = false;
size--;
return t;
}
}
///////////////////////////////////////////////////////////////////////////
// delete(削除)
///////////////////////////////////////////////////////////////////////////
// key で指すエントリー(ノード)を削除する
public void remove(K key) {
root = remove(root, key);
size--;
}
private Node remove(Node t, K key) {
if (t == null) {
change = false;
size++;
return null;
}
else if (key.compareTo(t.key) < 0) {
t.lst = remove(t.lst, key);
return balanceLd(t);
}
else if (key.compareTo(t.key) > 0) {
t.rst = remove(t.rst, key);
return balanceRd(t);
}
else {
if (t.lst == null) {
change = true;
return t.rst; // 右部分木を昇格させる
}
else {
t.lst = deleteMax(t.lst); // 左部分木の最大値を削除する
t.key = lmax; // 左部分木の削除した最大値で置き換える
return balanceLd(t);
}
}
}
// 部分木 t の最大値のノードを削除する
// 戻り値は削除により修正された部分木
// 削除した最大値を lmax に保存する
private Node deleteMax(Node t) {
if (t.rst != null) {
t.rst = deleteMax(t.rst);
return balanceRd(t);
}
else {
change = true;
lmax = t.key; // 部分木のキーの最大値を保存
return t.lst; // 左部分木を昇格させる
}
}
///////////////////////////////////////////////////////////////////////////
// 検索等
///////////////////////////////////////////////////////////////////////////
// キーの検索。ヒットすれば true、しなければ false
public boolean find(K key) {
Node t = root;
while (t != null) {
if (key.compareTo(t.key) < 0) t = t.lst;
else if (key.compareTo(t.key) > 0) t = t.rst;
else return true;
}
return false;
}
// キーから値を得る。キーがヒットしない場合は null を返す
public K get(K key) {
Node t = root;
while (t != null) {
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else return t.key;
}
return null;
}
public K get_upper(K key) {
K up = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) >= 0)
if(up == null)
up = t.key;
else if(t.key.compareTo(up) < 0)
up = t.key;
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else
return t.key;
}
return up;
}
public K get_lower(K key) {
K lw = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) <= 0)
if(lw == null)
lw = t.key;
else if(t.key.compareTo(lw) > 0)
lw = t.key;
if (key.compareTo(t.key) < 0)
t = t.lst;
else if (key.compareTo(t.key) > 0)
t = t.rst;
else
return t.key;
}
return lw;
}
public K get_greater(K key) {
K gt = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) > 0)
if(gt == null)
gt = t.key;
else if(t.key.compareTo(gt) < 0)
gt = t.key;
if(key.compareTo(t.key) < 0)
t = t.lst;
else
t = t.rst;
}
return gt;
}
public K get_less_than(K key) {
K lt = null;
Node t = root;
while (t != null) {
if(t.key.compareTo(key) < 0)
if(lt == null)
lt = t.key;
else if(t.key.compareTo(lt) > 0)
lt = t.key;
if(key.compareTo(t.key) <= 0)
t = t.lst;
else
t = t.rst;
}
return lt;
}
// マップが空なら true、空でないなら false
public boolean isEmpty() { return root == null; }
// マップを空にする
public void clear() { root = null; }
// キーのリスト
public ArrayList<K> keys() {
ArrayList<K> al = new ArrayList<K>();
keys(root, al);
return al;
}
public int getSize() {
return size;
}
// キーの最小値
public K min() {
Node t = root;
if (t == null) return null;
while (t.lst != null) t = t.lst;
return t.key;
}
// キーの最大値
public K max() {
Node t = root;
if (t == null) return null;
while (t.rst != null) t = t.rst;
return t.key;
}
private void keys(Node t, ArrayList<K> al) {
if (t != null) {
keys(t.lst, al);
al.add(t.key);
keys(t.rst, al);
}
}
///////////////////////////////////////////////////////////////////////////
// debug 用ルーチン
///////////////////////////////////////////////////////////////////////////
// AVL木をグラフ文字列に変換する
public String toString() {
return toGraph("", "", root).replaceAll("\\s+$", "");
}
// AVL木のバランスが取れているか確認する
public boolean balanced() { return balanced(root); }
// ２分探索木になっているか確認する
public boolean bstValid() { return bstValid(root); }
private String toGraph(String head, String bar, Node t) {
String graph = "";
if (t != null) {
graph += toGraph(head + " ", "／", t.rst);
String node = "" + t.height;
node += ":" + t.key;
graph += String.format("%s%s%s%n", head, bar, node);
graph += toGraph(head + " ", "＼", t.lst);
}
return graph;
}
private boolean balanced(Node t) {
if (t == null) return true;
return Math.abs(bias(t)) <= 1 && balanced(t.lst) && balanced(t.rst);
}
private boolean bstValid(Node t) {
if (t == null) return true;
boolean flag = small(t.key, t.lst) && large(t.key, t.rst);
return flag && bstValid(t.lst) && bstValid(t.rst);
}
private boolean small(K key, Node t) {
if (t == null) return true;
boolean flag = key.compareTo(t.key) > 0;
return flag && small(key, t.lst) && small(key, t.rst);
}
private boolean large(K key, Node t) {
if (t == null) return true;
boolean flag = key.compareTo(t.key) < 0;
return flag && large(key, t.lst) && large(key, t.rst);
}
}
| ConDefects/ConDefects/Code/arc135_c/Java/29312995 |
condefects-java_data_1412 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
long[] array_a = new long[n];
String[] input_a = br.readLine().split(" ");
long sum = 0;
int[] binary_bit_cnt = new int[30];
for (int i = 0; i < n; i++) {
array_a[i] = Long.parseLong(input_a[i]);
sum += array_a[i];
for (int k = 0; array_a[i] >> k > 0; k++) {
if ((array_a[i] >> k) % 2 == 1) {
binary_bit_cnt[k] += 1;
}
}
}
br.close();
long score = 0;
for (int i = 0; i < n; i++) {
long tmp_score = 0;
for (int k = 0; array_a[i] >> k > 0; k++) {
if ((array_a[i] >> k) % 2 == 1) {
tmp_score += (n - (2 * binary_bit_cnt[k])) * (1 << k);
}
}
score = Math.max(tmp_score, score);
}
System.out.println(sum + score);
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
long[] array_a = new long[n];
String[] input_a = br.readLine().split(" ");
long sum = 0;
int[] binary_bit_cnt = new int[30];
for (int i = 0; i < n; i++) {
array_a[i] = Long.parseLong(input_a[i]);
sum += array_a[i];
for (int k = 0; array_a[i] >> k > 0; k++) {
if ((array_a[i] >> k) % 2 == 1) {
binary_bit_cnt[k] += 1;
}
}
}
br.close();
long score = 0;
for (int i = 0; i < n; i++) {
long tmp_score = 0;
for (int k = 0; array_a[i] >> k > 0; k++) {
if ((array_a[i] >> k) % 2 == 1) {
tmp_score += (n - (2 * binary_bit_cnt[k])) * (1l << k);
}
}
score = Math.max(tmp_score, score);
}
System.out.println(sum + score);
}
}
| ConDefects/ConDefects/Code/arc135_c/Java/29355449 |
condefects-java_data_1413 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double a = scan.nextDouble();
int answer = (int)a;
System.out.println(answer);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double a = scan.nextDouble();
int answer = (int) Math.round(a);
System.out.println(answer);
}
}
| ConDefects/ConDefects/Code/abc226_a/Java/35825007 |
condefects-java_data_1414 | import java.io.ByteArrayInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static String OUTPUT = "";
//global
private final static long BASE = 998244353L;
private final static int INF_I = 1001001001;
private final static long INF_L = 1001001001001001001L;
static void solve() {
double X = readDouble();
out.println((int)Math.floor(X));
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
if (INPUT=="") {
is = System.in;
} else {
File file = new File(INPUT);
is = new FileInputStream(file);
}
if (OUTPUT == "") out = new PrintWriter(System.out);
else out = new PrintWriter(OUTPUT);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static class CustomClass<T extends Number & Comparable<T>> implements Comparable<CustomClass<T>> {
public CustomClass() {}
@Override
public int compareTo(CustomClass<T> o) {
return 0;
}
}
private static class ClassComparator<T extends Comparable<T>> implements Comparator<T> {
public ClassComparator() {}
@Override
public int compare(T a, T b) {
return a.compareTo(b);
}
}
private static class ListComparator<T extends Comparable<T>> implements Comparator<List<T>> {
public ListComparator() {}
@Override
public int compare(List<T> o1, List<T> o2) {
for (int i = 0; i < Math.min(o1.size(), o2.size()); i++) {
int c = o1.get(i).compareTo(o2.get(i));
if (c != 0) {
return c;
}
}
return Integer.compare(o1.size(), o2.size());
}
}
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 readDouble() { return Double.parseDouble(readString()); }
private static char readChar() { return (char)skip(); }
private static String readString()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] readChar(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[][] readTable(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = readChar(m);
return map;
}
private static int[] readIntArray(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = readInt();
return a;
}
private static long[] readLongArray(int n) {
long[] a = new long[n];
for (int i=0;i<n;i++) a[i] = readLong();
return a;
}
private static int readInt()
{
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 readLong()
{
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.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
@SuppressWarnings("unused")
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static String OUTPUT = "";
//global
private final static long BASE = 998244353L;
private final static int INF_I = 1001001001;
private final static long INF_L = 1001001001001001001L;
static void solve() {
double X = readDouble();
out.println((int)Math.round(X));
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
if (INPUT=="") {
is = System.in;
} else {
File file = new File(INPUT);
is = new FileInputStream(file);
}
if (OUTPUT == "") out = new PrintWriter(System.out);
else out = new PrintWriter(OUTPUT);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static class CustomClass<T extends Number & Comparable<T>> implements Comparable<CustomClass<T>> {
public CustomClass() {}
@Override
public int compareTo(CustomClass<T> o) {
return 0;
}
}
private static class ClassComparator<T extends Comparable<T>> implements Comparator<T> {
public ClassComparator() {}
@Override
public int compare(T a, T b) {
return a.compareTo(b);
}
}
private static class ListComparator<T extends Comparable<T>> implements Comparator<List<T>> {
public ListComparator() {}
@Override
public int compare(List<T> o1, List<T> o2) {
for (int i = 0; i < Math.min(o1.size(), o2.size()); i++) {
int c = o1.get(i).compareTo(o2.get(i));
if (c != 0) {
return c;
}
}
return Integer.compare(o1.size(), o2.size());
}
}
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 readDouble() { return Double.parseDouble(readString()); }
private static char readChar() { return (char)skip(); }
private static String readString()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] readChar(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[][] readTable(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = readChar(m);
return map;
}
private static int[] readIntArray(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = readInt();
return a;
}
private static long[] readLongArray(int n) {
long[] a = new long[n];
for (int i=0;i<n;i++) a[i] = readLong();
return a;
}
private static int readInt()
{
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 readLong()
{
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/abc226_a/Java/31492602 |
condefects-java_data_1415 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x = scan.nextDouble();
scan.close();
System.out.println((int)Math.ceil(x));
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x = scan.nextDouble();
scan.close();
System.out.println((int)Math.round(x));
}
}
| ConDefects/ConDefects/Code/abc226_a/Java/35824355 |
condefects-java_data_1416 | import java.util.*;
import java.io.PrintWriter;
import java.math.BigDecimal;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
BigDecimal x = sc.nextBigDecimal();
double result = x.setScale(0,BigDecimal.ROUND_HALF_UP).doubleValue();
System.out.println(result);
}
}
import java.util.*;
import java.io.PrintWriter;
import java.math.BigDecimal;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
BigDecimal x = sc.nextBigDecimal();
int result = x.setScale(0,BigDecimal.ROUND_HALF_UP).intValue();
System.out.println(result);
}
} | ConDefects/ConDefects/Code/abc226_a/Java/45935806 |
condefects-java_data_1417 |
import java.util.Scanner;
public class Main {//반올림 소수
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double X = scan.nextDouble();
double round = Math.round(X);
System.out.println(round);
}//main
}//class
import java.util.Scanner;
public class Main {//반올림 소수
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double X = scan.nextDouble();
int round = (int)(Math.round(X));
System.out.println(round);
}//main
}//class
| ConDefects/ConDefects/Code/abc226_a/Java/35931888 |
condefects-java_data_1418 | import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.Stack;
import java.util.function.BiFunction;
import java.util.function.BinaryOperator;
import java.util.function.Predicate;
public class Main {
public static void main(String[] args) throws Exception {
ContestScanner in = new ContestScanner(System.in);
ContestPrinter out = new ContestPrinter(System.out);
Task solver = new Task();
solver.solve(in, out);
out.flush();
out.close();
}
}
class Task {
static final long mod = 998244353;
long powmod(long a, long b) {
long ans = 1, d = a;
while (b > 0) {
if (b % 2 == 1) ans = ans * d % mod;
b >>= 1;
d = d * d % mod;
}
return ans;
}
long deg(long num, int deg) { return num & (1L << deg); }
public void solve(ContestScanner in, ContestPrinter out) throws Exception {
int n = in.nextInt();
long L = in.nextLong();
long R = in.nextLong();
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = in.nextLong();
}
int row = 1;
for (int col = 60; col >= 0 && row <= n; --col) {
for (int i = row; i <= n; ++i) {
if (deg(a[i], col) > 0) {
swap(a, row, i);
break;
}
}
if (deg(a[row], col) == 0) continue;
for (int i = 1; i <= n; ++i) {
if (i == row) continue;
if (deg(a[i], col) > 0) {
a[i] ^= a[row];
}
}
++row;
}
for (long i = L; i <= R; i++) {
out.print(cal(a, row - 1, i - 1) + " ");
}
}
private long cal(long[] a, int row, long x) {
long ans = 0;
for (int i = 0; i < row; i++) {
if ((x & (1 << i)) != 0) {
ans ^= a[row - i];
}
}
return ans;
}
private void swap(long[] a, int i, int j) {
long tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.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 java.util.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 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') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}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());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collections;
import java.util.Stack;
import java.util.function.BiFunction;
import java.util.function.BinaryOperator;
import java.util.function.Predicate;
public class Main {
public static void main(String[] args) throws Exception {
ContestScanner in = new ContestScanner(System.in);
ContestPrinter out = new ContestPrinter(System.out);
Task solver = new Task();
solver.solve(in, out);
out.flush();
out.close();
}
}
class Task {
static final long mod = 998244353;
long powmod(long a, long b) {
long ans = 1, d = a;
while (b > 0) {
if (b % 2 == 1) ans = ans * d % mod;
b >>= 1;
d = d * d % mod;
}
return ans;
}
long deg(long num, int deg) { return num & (1L << deg); }
public void solve(ContestScanner in, ContestPrinter out) throws Exception {
int n = in.nextInt();
long L = in.nextLong();
long R = in.nextLong();
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = in.nextLong();
}
int row = 1;
for (int col = 60; col >= 0 && row <= n; --col) {
for (int i = row; i <= n; ++i) {
if (deg(a[i], col) > 0) {
swap(a, row, i);
break;
}
}
if (deg(a[row], col) == 0) continue;
for (int i = 1; i <= n; ++i) {
if (i == row) continue;
if (deg(a[i], col) > 0) {
a[i] ^= a[row];
}
}
++row;
}
for (long i = L; i <= R; i++) {
out.print(cal(a, row - 1, i - 1) + " ");
}
}
private long cal(long[] a, int row, long x) {
long ans = 0;
for (int i = 0; i < row; i++) {
if ((x & (1L << i)) != 0) {
ans ^= a[row - i];
}
}
return ans;
}
private void swap(long[] a, int i, int j) {
long tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.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 java.util.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 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') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}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());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter {
public ContestPrinter(java.io.PrintStream stream) {
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException {
super(new java.io.PrintStream(file));
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
| ConDefects/ConDefects/Code/abc283_g/Java/37541557 |
condefects-java_data_1419 | public class Main {
public static void main(String[] args) throws Exception {
final FastScanner sc = new FastScanner(System.in);
final int n = sc.nextInt();
sc.close();
final int[] arr_x = new int[n];
final long[] arr_y = new long[n];
for (int i = 0; i < n; i++) {
arr_x[i] = sc.nextInt();
arr_y[i] = sc.nextLong();
}
//dp[i][j]:=j個目まで食べるかどうか決めて、状態i(0:お腹を壊してない 1:お腹を壊している)の時の最大スコア
final long[][] dp = new long[2][n + 1];
dp[0][0] = 0;
dp[1][0] = Long.MIN_VALUE / 2;
for (int i = 1; i <= n; i++) {
if (arr_x[i - 1] == 0) {
dp[0][i] = Math.max(dp[0][i - 1] + arr_y[i - 1], dp[0][i - 1]);
dp[0][i] = Math.max(dp[1][i - 1] + arr_y[i - 1], dp[0][i]);
dp[1][i] = dp[1][i - 1];
} else {
dp[0][i] = dp[0][i - 1];
dp[1][i] = Math.max(dp[0][i - 1] + arr_y[i - 1], dp[1][i - 1]);
}
}
System.out.println(Math.max(dp[0][n], dp[1][n]));
}
// FastScannerライブラリ
static class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner(java.io.InputStream source) {
this.in = source;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) {
return buf[ptr++];
} else {
return -1;
}
}
private boolean isPrintableChar(final int c) {
return 33 <= c && c <= 126;
}
private boolean isNumeric(final int c) {
return '0' <= c && c <= '9';
}
private void skipToNextPrintableChar() {
while (hasNextByte() && !isPrintableChar(buf[ptr])) {
ptr++;
}
}
public boolean hasNext() {
skipToNextPrintableChar();
return hasNextByte();
}
public String next() {
if (!hasNext()) {
throw new java.util.NoSuchElementException();
}
StringBuilder ret = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
ret.appendCodePoint(b);
b = readByte();
}
return ret.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new java.util.NoSuchElementException();
}
long ret = 0;
int b = readByte();
boolean negative = false;
if (b == '-') {
negative = true;
if (hasNextByte()) {
b = readByte();
}
}
if (!isNumeric(b)) {
throw new NumberFormatException();
}
while (true) {
if (isNumeric(b)) {
ret = ret * 10 + b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return negative ? -ret : ret;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
return (int) nextLong();
}
public double nextDouble() {
return Double.parseDouble(next());
}
@Override
public void close() throws Exception {
in.close();
}
}
}
public class Main {
public static void main(String[] args) throws Exception {
final FastScanner sc = new FastScanner(System.in);
final int n = sc.nextInt();
final int[] arr_x = new int[n];
final long[] arr_y = new long[n];
for (int i = 0; i < n; i++) {
arr_x[i] = sc.nextInt();
arr_y[i] = sc.nextLong();
}
sc.close();
//dp[i][j]:=j個目まで食べるかどうか決めて、状態i(0:お腹を壊してない 1:お腹を壊している)の時の最大スコア
final long[][] dp = new long[2][n + 1];
dp[0][0] = 0;
dp[1][0] = Long.MIN_VALUE / 2;
for (int i = 1; i <= n; i++) {
if (arr_x[i - 1] == 0) {
dp[0][i] = Math.max(dp[0][i - 1] + arr_y[i - 1], dp[0][i - 1]);
dp[0][i] = Math.max(dp[1][i - 1] + arr_y[i - 1], dp[0][i]);
dp[1][i] = dp[1][i - 1];
} else {
dp[0][i] = dp[0][i - 1];
dp[1][i] = Math.max(dp[0][i - 1] + arr_y[i - 1], dp[1][i - 1]);
}
}
System.out.println(Math.max(dp[0][n], dp[1][n]));
}
// FastScannerライブラリ
static class FastScanner implements AutoCloseable {
private final java.io.InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner(java.io.InputStream source) {
this.in = source;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buf);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) {
return buf[ptr++];
} else {
return -1;
}
}
private boolean isPrintableChar(final int c) {
return 33 <= c && c <= 126;
}
private boolean isNumeric(final int c) {
return '0' <= c && c <= '9';
}
private void skipToNextPrintableChar() {
while (hasNextByte() && !isPrintableChar(buf[ptr])) {
ptr++;
}
}
public boolean hasNext() {
skipToNextPrintableChar();
return hasNextByte();
}
public String next() {
if (!hasNext()) {
throw new java.util.NoSuchElementException();
}
StringBuilder ret = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
ret.appendCodePoint(b);
b = readByte();
}
return ret.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new java.util.NoSuchElementException();
}
long ret = 0;
int b = readByte();
boolean negative = false;
if (b == '-') {
negative = true;
if (hasNextByte()) {
b = readByte();
}
}
if (!isNumeric(b)) {
throw new NumberFormatException();
}
while (true) {
if (isNumeric(b)) {
ret = ret * 10 + b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return negative ? -ret : ret;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
return (int) nextLong();
}
public double nextDouble() {
return Double.parseDouble(next());
}
@Override
public void close() throws Exception {
in.close();
}
}
}
| ConDefects/ConDefects/Code/abc306_d/Java/43076461 |
condefects-java_data_1420 | import java.io.*;
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() {
int n = in.nextInt();
int q = in.nextInt();
char[] s = in.nextCharArray();
int[] d = new int[n];
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + (s[i - 1] != s[i] ? 1 : 0);
}
for (int i = 0; i < q; i++) {
int l = in.nextInt() - 1;
int r = in.nextInt() - 1;
int dd = d[r] - d[l] + (s[l] != s[r] ? 1 : 0);
out.println(l, r, (dd + 1) / 2);
}
}
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.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() {
int n = in.nextInt();
int q = in.nextInt();
char[] s = in.nextCharArray();
int[] d = new int[n];
for (int i = 1; i < n; i++) {
d[i] = d[i - 1] + (s[i - 1] != s[i] ? 1 : 0);
}
for (int i = 0; i < q; i++) {
int l = in.nextInt() - 1;
int r = in.nextInt() - 1;
int dd = d[r] - d[l] + (s[l] != s[r] ? 1 : 0);
out.println((dd + 1) / 2);
}
}
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/agc059_a/Java/37019602 |
condefects-java_data_1421 | 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));
PrintWriter pw = new PrintWriter(System.out);
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int q = Integer.parseInt(st.nextToken());
String s = br.readLine();
int[] pre = new int[n];
for(int i=1; i<n; i++){
pre[i]+=pre[i-1];
if(s.charAt(i)!=s.charAt(i-1)){
pre[i]++;
}
}
for(int i=0; i<q; i++){
st = new StringTokenizer(br.readLine());
int l = Integer.parseInt(st.nextToken())-1;
int r = Integer.parseInt(st.nextToken())-1;
pw.println(((pre[r]-pre[l])/2)+Math.min(1,pre[r]-pre[l]));
}
pw.close();
}
}
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));
PrintWriter pw = new PrintWriter(System.out);
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int q = Integer.parseInt(st.nextToken());
String s = br.readLine();
int[] pre = new int[n];
for(int i=1; i<n; i++){
pre[i]+=pre[i-1];
if(s.charAt(i)!=s.charAt(i-1)){
pre[i]++;
}
}
for(int i=0; i<q; i++){
st = new StringTokenizer(br.readLine());
int l = Integer.parseInt(st.nextToken())-1;
int r = Integer.parseInt(st.nextToken())-1;
pw.println((((pre[r]-pre[l]-((s.charAt(l)==s.charAt(r))? 1 : 0)))/2)+Math.min(pre[r]-pre[l], 1));
}
pw.close();
}
}
| ConDefects/ConDefects/Code/agc059_a/Java/37033016 |
condefects-java_data_1422 |
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 166 A問題
* 考察メモ
* Cは、前から見た時にA優先で変換で良い
* とすると、前から見ていって、
* 1. Aが足りない: 終わり
* 2: Bが足りない: 後で持ってくる
* あ、Cも出現するのか……移動できないので適当に分断されるのね
*
* つまり？
* 1. AA: そのまま
* 2. AB: Bを後で持ってくるフラグを立てる
* 3. BA: Bを持ってくるフラグが立っているならAが来る、そうでないなら無理
* 4. BB: そのまま
* 5. CA: 一旦はCをAだと思っておく
* 6. CB: 一旦はCをAだと思って余剰を加算
* で、Cについては、CCはカット、AC, BCは不可
*
* 余りの計算
* 1. こっちの方がA, Bが多い→無理
* 2. 少ない→その分をCから変換するはず
*/
int T = io.nextInt();
if (T < 0) {
test(-T);
} else {
while(T --> 0) {
int N = io.nextInt();
char[] X = io.nextChars();
char[] Y = io.nextChars();
io.println(solve(X, Y) ? "Yes" : "No");
}
}
}
void test(int N) {
char[] X = new char[N], Y = new char[N];
for (int i = 0;i < pow(3, N);++ i) {
for (int j = 0;j < pow(3, N);++ j) {
int x = i, y = j;
for (int k = 0;k < N;++ k) {
X[k] = (char)(x % 3 + 'A');
Y[k] = (char)(y % 3 + 'A');
x /= 3;
y /= 3;
}
if (solve(X.clone(), Y.clone()) != greedy(X.clone(), Y.clone())) {
io.println(N + " " + new String(X) + " " + new String(Y));
io.println(solve(X.clone(), Y.clone()) + "," + greedy(X.clone(), Y.clone()));
}
}
}
}
boolean solve(char[] X, char[] Y) {
X = ArrayUtility.add(X, 'C');
Y = ArrayUtility.add(Y, 'C');
int N = X.length;
int[] cnt = {0, 0, 0};
int last = 0;
for (int i = 0;i < N;++ i) {
if (Y[i] == 'C') {
if (X[i] != 'C' || Math.abs(cnt[0]) + Math.abs(cnt[1]) != cnt[2]) return false;
if (!solve2(Arrays.copyOfRange(X, last, i), Arrays.copyOfRange(Y, last, i), -cnt[0])) return false;
last = i + 1;
} else {
++ cnt[X[i] - 'A'];
-- cnt[Y[i] - 'A'];
}
}
return true;
}
boolean solve2(char[] X, char[] Y, int a) {
int N = X.length;
int wait = 0;
for (int i = 0;i < N;++ i) {
if (X[i] == 'C') {
if (a != 0) {
X[i] = 'A';
-- a;
} else {
X[i] = 'B';
}
}
if (X[i] == Y[i]) continue;
if (X[i] == 'A') ++ wait;
else -- wait;
if (wait < 0) return false;
}
return true;
}
boolean greedy(char[] X, char[] Y) {
int N = X.length;
for (int i = 0;i < N;++ i) {
if (X[i] == 'C') {
if (Y[i] == 'C') continue;
X[i] = 'A';
if (greedy(X, Y)) return true;
X[i] = 'B';
return greedy(X, Y);
}
if (Y[i] == 'C') return false;
}
cont: for (int i = 0;i < N;++ i) {
if (X[i] == Y[i]) continue;
if (X[i] == 'A') {
for (int j = i + 1;j < N;++ j) {
if (X[j] == 'B') {
X[i] = 'B';
X[j] = 'A';
continue cont;
}
}
}
return false;
}
return true;
}
/** デバッグ用コードのお供に */
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;
}
public static class BezoutCoefficients {
public final long a, b;
public final long x, y;
public final long gcd;
private BezoutCoefficients(long a, long b, long x, long y, long gcd) {
this.a = a;
this.b = b;
this.x = x;
this.y = y;
this.gcd = gcd;
}
/**
* lx≦i<rxかつly≦j<ryを満たす整数i, jであって、ai+bj=ax+byとなる解の個数を求めます。
* @param lx iの下限(これを含む)
* @param rx iの上限(これを含まない)
* @param ly jの下限(これを含む)
* @param ry jの上限(これを含まない)
* @return 解の個数
* @complexity O(1)
*/
public long countSatisfySolution(long lx, long rx, long ly, long ry) {
long ag = a / gcd, bg = b / gcd;
long la = Math.floorDiv(lx - x + bg - 1, bg), ra = Math.floorDiv(rx - x - 1, bg) + 1;
long lb = Math.floorDiv(y - ry, ag) + 1, rb = Math.floorDiv(y - ly, ag) + 1;
return Math.max(0, Math.min(ra, rb) - Math.max(la, lb));
}
@Override
public String toString() {
return "(" + x + ", " + y + "), gcd=" + gcd;
}
/**
* ax+by=gcd(a, b)となるような解を一つ求めます。
* この時、|x|≦|b/gcd(a,b)|、|y|≦|a/gcd(a,b)|であることが保証されます。
* @param a 整数
* @param b 整数
* @return 与えられた一次不定方程式の解
* @complexity O(log(min(a, b)))
*/
public static BezoutCoefficients solve(long a, long b) {
int as = Long.signum(a);
int bs = Long.signum(b);
long aa = Math.abs(a);
long ba = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(ba != 0){
long c = aa / ba;
long e;
e = aa; aa = ba; ba = e % ba;
e = p; p = q; q = e - c * q;
e = r; r = s; s = e - c * s;
}
return new BezoutCoefficients(a, b, p * as, r * bs, aa);
}
/**
* ax+by=dとなるような解を一つ求めます。
* @param a 整数
* @param b 整数
* @param d 不定方程式の解
* @return 与えられた一次不定方程式の解(存在しなければnull)
* @complexity O(log(min(a, b)))
*/
public static BezoutCoefficients solve(long a, long b, long d) {
int as = Long.signum(a);
int bs = Long.signum(b);
long aa = Math.abs(a);
long ba = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(ba != 0){
long c = aa / ba;
long e;
e = aa; aa = ba; ba = e % ba;
e = p; p = q; q = e - c * q;
e = r; r = s; s = e - c * s;
}
if (d % aa != 0) return null;
long divd = d / a, modd = d % a / aa;
return new BezoutCoefficients(a, b, p * as * modd + divd, r * bs * modd, aa);
}
}
}
/**
* @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 166 A問題
* 考察メモ
* Cは、前から見た時にA優先で変換で良い
* とすると、前から見ていって、
* 1. Aが足りない: 終わり
* 2: Bが足りない: 後で持ってくる
* あ、Cも出現するのか……移動できないので適当に分断されるのね
*
* つまり？
* 1. AA: そのまま
* 2. AB: Bを後で持ってくるフラグを立てる
* 3. BA: Bを持ってくるフラグが立っているならAが来る、そうでないなら無理
* 4. BB: そのまま
* 5. CA: 一旦はCをAだと思っておく
* 6. CB: 一旦はCをAだと思って余剰を加算
* で、Cについては、CCはカット、AC, BCは不可
*
* 余りの計算
* 1. こっちの方がA, Bが多い→無理
* 2. 少ない→その分をCから変換するはず
*/
int T = io.nextInt();
if (T < 0) {
test(-T);
} else {
while(T --> 0) {
int N = io.nextInt();
char[] X = io.nextChars();
char[] Y = io.nextChars();
io.println(solve(X, Y) ? "Yes" : "No");
}
}
}
void test(int N) {
char[] X = new char[N], Y = new char[N];
for (int i = 0;i < pow(3, N);++ i) {
for (int j = 0;j < pow(3, N);++ j) {
int x = i, y = j;
for (int k = 0;k < N;++ k) {
X[k] = (char)(x % 3 + 'A');
Y[k] = (char)(y % 3 + 'A');
x /= 3;
y /= 3;
}
if (solve(X.clone(), Y.clone()) != greedy(X.clone(), Y.clone())) {
io.println(N + " " + new String(X) + " " + new String(Y));
io.println(solve(X.clone(), Y.clone()) + "," + greedy(X.clone(), Y.clone()));
}
}
}
}
boolean solve(char[] X, char[] Y) {
X = ArrayUtility.add(X, 'C');
Y = ArrayUtility.add(Y, 'C');
int N = X.length;
int[] cnt = {0, 0, 0};
int last = 0;
for (int i = 0;i < N;++ i) {
if (Y[i] == 'C') {
if (X[i] != 'C' || Math.abs(cnt[0]) + Math.abs(cnt[1]) != cnt[2]) return false;
if (!solve2(Arrays.copyOfRange(X, last, i), Arrays.copyOfRange(Y, last, i), -cnt[0])) return false;
last = i + 1;
Arrays.fill(cnt, 0);
} else {
++ cnt[X[i] - 'A'];
-- cnt[Y[i] - 'A'];
}
}
return true;
}
boolean solve2(char[] X, char[] Y, int a) {
int N = X.length;
int wait = 0;
for (int i = 0;i < N;++ i) {
if (X[i] == 'C') {
if (a != 0) {
X[i] = 'A';
-- a;
} else {
X[i] = 'B';
}
}
if (X[i] == Y[i]) continue;
if (X[i] == 'A') ++ wait;
else -- wait;
if (wait < 0) return false;
}
return true;
}
boolean greedy(char[] X, char[] Y) {
int N = X.length;
for (int i = 0;i < N;++ i) {
if (X[i] == 'C') {
if (Y[i] == 'C') continue;
X[i] = 'A';
if (greedy(X, Y)) return true;
X[i] = 'B';
return greedy(X, Y);
}
if (Y[i] == 'C') return false;
}
X = X.clone();
cont: for (int i = 0;i < N;++ i) {
if (X[i] == Y[i]) continue;
if (X[i] == 'A') {
for (int j = i + 1;j < N;++ j) {
if (X[j] == 'B') {
X[i] = 'B';
X[j] = 'A';
continue cont;
}
}
}
return false;
}
return true;
}
/** デバッグ用コードのお供に */
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;
}
public static class BezoutCoefficients {
public final long a, b;
public final long x, y;
public final long gcd;
private BezoutCoefficients(long a, long b, long x, long y, long gcd) {
this.a = a;
this.b = b;
this.x = x;
this.y = y;
this.gcd = gcd;
}
/**
* lx≦i<rxかつly≦j<ryを満たす整数i, jであって、ai+bj=ax+byとなる解の個数を求めます。
* @param lx iの下限(これを含む)
* @param rx iの上限(これを含まない)
* @param ly jの下限(これを含む)
* @param ry jの上限(これを含まない)
* @return 解の個数
* @complexity O(1)
*/
public long countSatisfySolution(long lx, long rx, long ly, long ry) {
long ag = a / gcd, bg = b / gcd;
long la = Math.floorDiv(lx - x + bg - 1, bg), ra = Math.floorDiv(rx - x - 1, bg) + 1;
long lb = Math.floorDiv(y - ry, ag) + 1, rb = Math.floorDiv(y - ly, ag) + 1;
return Math.max(0, Math.min(ra, rb) - Math.max(la, lb));
}
@Override
public String toString() {
return "(" + x + ", " + y + "), gcd=" + gcd;
}
/**
* ax+by=gcd(a, b)となるような解を一つ求めます。
* この時、|x|≦|b/gcd(a,b)|、|y|≦|a/gcd(a,b)|であることが保証されます。
* @param a 整数
* @param b 整数
* @return 与えられた一次不定方程式の解
* @complexity O(log(min(a, b)))
*/
public static BezoutCoefficients solve(long a, long b) {
int as = Long.signum(a);
int bs = Long.signum(b);
long aa = Math.abs(a);
long ba = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(ba != 0){
long c = aa / ba;
long e;
e = aa; aa = ba; ba = e % ba;
e = p; p = q; q = e - c * q;
e = r; r = s; s = e - c * s;
}
return new BezoutCoefficients(a, b, p * as, r * bs, aa);
}
/**
* ax+by=dとなるような解を一つ求めます。
* @param a 整数
* @param b 整数
* @param d 不定方程式の解
* @return 与えられた一次不定方程式の解(存在しなければnull)
* @complexity O(log(min(a, b)))
*/
public static BezoutCoefficients solve(long a, long b, long d) {
int as = Long.signum(a);
int bs = Long.signum(b);
long aa = Math.abs(a);
long ba = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(ba != 0){
long c = aa / ba;
long e;
e = aa; aa = ba; ba = e % ba;
e = p; p = q; q = e - c * q;
e = r; r = s; s = e - c * s;
}
if (d % aa != 0) return null;
long divd = d / a, modd = d % a / aa;
return new BezoutCoefficients(a, b, p * as * modd + divd, r * bs * modd, aa);
}
}
}
/**
* @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/arc166_a/Java/46382268 |
condefects-java_data_1423 | 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.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();
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int times = sc.nextInt();
for (int time = 0; time < times; time++) {
int n = sc.nextInt();
String s1 = sc.next();
String s2 = sc.next();
boolean bool = true;
for (int i = 0; i < n; i++) {
if (s2.charAt(i) == 'C' && s1.charAt(i) != 'C') {
bool = false;
pw.println("No");
break;
}
}
if (bool) {
int acountX = 0;
int ccountX = 0;
int acountY = 0;
int changeA = 0;
for (int i = 0; i < n; i++) {
if (s1.charAt(i) == 'C' && s2.charAt(i) == 'C') {
if (acountX + changeA != acountY || changeA > ccountX) {
bool = false;
pw.println("No");
break;
} else {
acountX = 0;
ccountX = 0;
acountY = 0;
changeA = 0;
}
}
if (s1.charAt(i) == 'C' && s2.charAt(i) != 'C') {
ccountX++;
}
if (s1.charAt(i) == 'A') {
acountX++;
}
if (s2.charAt(i) == 'A') {
acountY++;
if (acountX < acountY) {
changeA++;
if (changeA>ccountX) {
pw.println("No");
bool= false;
break;
}
}
}
}
if (bool && (acountX + changeA != acountY || changeA > ccountX)) {
bool = false;
pw.println("No");
}
if (bool) {
pw.println("Yes");
}
}
}
}
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;
}
}
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 index;
long x;
long y;
public Target(int a, long b, long c) {
index = a;
x = b;
y = 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 implements Comparable {
int index;
long a;
public PointTemp(int c, long x) {
index = c;
a = x;
}
public int compareTo(Object p) {
PointTemp t = (PointTemp) p;
if (this.a < t.a) {
return -1;
}
if (this.a > t.a) {
return 1;
}
return this.index - t.index;
}
public boolean equals(Object p) {
PointTemp t = (PointTemp) p;
return this.index == t.index;
}
}
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.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();
}
public static void solve(FastScanner sc, FastPrintStream pw) throws Exception {
int times = sc.nextInt();
for (int time = 0; time < times; time++) {
int n = sc.nextInt();
String s1 = sc.next();
String s2 = sc.next();
boolean bool = true;
for (int i = 0; i < n; i++) {
if (s2.charAt(i) == 'C' && s1.charAt(i) != 'C') {
bool = false;
pw.println("No");
break;
}
}
if (bool) {
int acountX = 0;
int ccountX = 0;
int acountY = 0;
int changeA = 0;
for (int i = 0; i < n; i++) {
if (s1.charAt(i) == 'C' && s2.charAt(i) == 'C') {
if (acountX + changeA != acountY || changeA > ccountX) {
bool = false;
pw.println("No");
break;
} else {
acountX = 0;
ccountX = 0;
acountY = 0;
changeA = 0;
}
}
if (s1.charAt(i) == 'C' && s2.charAt(i) != 'C') {
ccountX++;
}
if (s1.charAt(i) == 'A') {
acountX++;
}
if (s2.charAt(i) == 'A') {
acountY++;
if (acountX+changeA < acountY) {
changeA++;
if (changeA>ccountX) {
pw.println("No");
bool= false;
break;
}
}
}
}
if (bool && (acountX + changeA != acountY || changeA > ccountX)) {
bool = false;
pw.println("No");
}
if (bool) {
pw.println("Yes");
}
}
}
}
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;
}
}
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 index;
long x;
long y;
public Target(int a, long b, long c) {
index = a;
x = b;
y = 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 implements Comparable {
int index;
long a;
public PointTemp(int c, long x) {
index = c;
a = x;
}
public int compareTo(Object p) {
PointTemp t = (PointTemp) p;
if (this.a < t.a) {
return -1;
}
if (this.a > t.a) {
return 1;
}
return this.index - t.index;
}
public boolean equals(Object p) {
PointTemp t = (PointTemp) p;
return this.index == t.index;
}
}
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/arc166_a/Java/46383429 |
condefects-java_data_1424 | import java.util.Scanner;
/**
* @ProjectName: study3
* @FileName: Ex5
* @author:HWJ
* @Data: 2023/10/8 20:08
*/
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
for (int i = 0; i < n; i++) {
int m = input.nextInt();
String s1 = input.next();
String s2 = input.next();
char[] str1 = s1.toCharArray();
char[] str2 = s2.toCharArray();
int start = 0;
boolean a = true;
int j = 0;
for (; j < m; j++) {
if (!a) {
break;
}
if (str1[j] == 'C' && str2[j] == 'C') {
a = f(str1, str2, start, j - 1);
start = j + 1;
}
if (str1[j] != 'C' && str2[j] == 'C') {
a = false;
}
}
a = a && f(str1, str2, start, j - 1);
if (a) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
public static boolean f(char[] str1, char[] str2, int start, int end) {
int cnta = 0;
int cntb = 0;
for (int i = start; i <= end; i++) {
if (str1[i] == 'B' || str1[i] == 'C') {
cnta++;
}
if (str2[i] == 'B') {
cntb++;
}
if (cnta < cntb) {
return false;
}
}
cnta = 0;
cntb = 0;
for (int i = start; i <= end; i++) {
if (str1[i] == 'A' || str1[i] == 'C') {
cnta++;
}
if (str2[i] == 'A') {
cntb++;
}
if (cnta < cntb) {
return false;
}
}
return true;
}
}
import java.util.Scanner;
/**
* @ProjectName: study3
* @FileName: Ex5
* @author:HWJ
* @Data: 2023/10/8 20:08
*/
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
for (int i = 0; i < n; i++) {
int m = input.nextInt();
String s1 = input.next();
String s2 = input.next();
char[] str1 = s1.toCharArray();
char[] str2 = s2.toCharArray();
int start = 0;
boolean a = true;
int j = 0;
for (; j < m; j++) {
if (!a) {
break;
}
if (str1[j] == 'C' && str2[j] == 'C') {
a = f(str1, str2, start, j - 1);
start = j + 1;
}
if (str1[j] != 'C' && str2[j] == 'C') {
a = false;
}
}
a = a && f(str1, str2, start, j - 1);
if (a) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
public static boolean f(char[] str1, char[] str2, int start, int end) {
int cnta = 0;
int cntb = 0;
for (int i = end; i >= start; i--) {
if (str1[i] == 'B' || str1[i] == 'C') {
cnta++;
}
if (str2[i] == 'B') {
cntb++;
}
if (cnta < cntb) {
return false;
}
}
cnta = 0;
cntb = 0;
for (int i = start; i <= end; i++) {
if (str1[i] == 'A' || str1[i] == 'C') {
cnta++;
}
if (str2[i] == 'A') {
cntb++;
}
if (cnta < cntb) {
return false;
}
}
return true;
}
}
| ConDefects/ConDefects/Code/arc166_a/Java/46412636 |
condefects-java_data_1425 | import java.util.*;
public class Main{
public static void main(String[]args){
Scanner sc = new Scanner(System.in);
String s = sc.next();
int snum = s.length();
String [] ss = new String[snum];
String sum = "";
for(int i = 0;i < snum;i ++){
ss[i] = s.substring(i);
sum += ss[i] + " ";
}
System.out.println(sum);
}
}
import java.util.*;
public class Main{
public static void main(String[]args){
Scanner sc = new Scanner(System.in);
String s = sc.next();
int snum = s.length();
String [] ss = new String[snum];
String sum = "";
for(int i = 0;i < snum;i ++){
ss[i] = s.substring(i,i + 1);
sum += ss[i] + " ";
}
System.out.println(sum);
}
} | ConDefects/ConDefects/Code/abc329_a/Java/53717043 |
condefects-java_data_1426 | import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
String S = sc.next();
for(int i = 0; i < S.length(); i++){
System.out.print(S.charAt(i));
if(i < S.length()-1){
System.out.print(" ");
}
}
}
}
import java.util.*;
public class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
String S = sc.next();
for(int i = 0; i < S.length(); i++){
System.out.print(S.charAt(i));
if(i < S.length()-1){
System.out.print(" ");
}
}
}
} | ConDefects/ConDefects/Code/abc329_a/Java/48986562 |
condefects-java_data_1427 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
sc.close();
String[] S = s.split("");
StringBuilder sb = new StringBuilder(S[0]);
for (int i = 1; i < S.length; i++) {
sb.append(S[i]);
}
System.out.println(sb);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
sc.close();
String[] S = s.split("");
StringBuilder sb = new StringBuilder(S[0]);
for (int i = 1; i < S.length; i++) {
sb.append(" " + S[i]);
}
System.out.println(sb);
}
} | ConDefects/ConDefects/Code/abc329_a/Java/54304216 |
condefects-java_data_1428 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
String N =sc.next();
for(int i=0;i<N.length();i++) {
System.out.print(N.charAt(i));
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
String N =sc.next();
for(int i=0;i<N.length();i++) {
System.out.print(N.charAt(i)+" ");
}
}
}
| ConDefects/ConDefects/Code/abc329_a/Java/49671217 |
condefects-java_data_1429 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
private static BufferedReader br;
private static int getInt() throws IOException {
return Integer.parseInt(br.readLine());
}
private static int[] intArray() throws IOException {
return Arrays.stream(br.readLine().split(" ")).mapToInt(m -> Integer.parseInt(m)).toArray();
}
private static long[] longArray() throws IOException {
return Arrays.stream(br.readLine().split(" ")).mapToLong(m -> Long.parseLong(m)).toArray();
}
private static void init() {
br = new BufferedReader(new InputStreamReader(System.in));
}
private static void print(Object o) {
System.out.println(o);
}
private static void printI(int[] p) {
boolean first = true;
for (int i: p) {
if (first) {
first = false;
} else {
System.out.print(" ");
}
System.out.print(i);
}
System.out.println();
}
public static void main(String[] args) throws IOException {
init();
int n = getInt();
for (int i = 0; i< n; i++) {
long[] as = longArray();
long a = as[0];
long s = as[1];
if (s <= a) {
print("No");
continue;
}
long s2 = s - a - a;
if ((s2 & a) == 0) {
print("Yes");
} else {
print("No");
}
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
private static BufferedReader br;
private static int getInt() throws IOException {
return Integer.parseInt(br.readLine());
}
private static int[] intArray() throws IOException {
return Arrays.stream(br.readLine().split(" ")).mapToInt(m -> Integer.parseInt(m)).toArray();
}
private static long[] longArray() throws IOException {
return Arrays.stream(br.readLine().split(" ")).mapToLong(m -> Long.parseLong(m)).toArray();
}
private static void init() {
br = new BufferedReader(new InputStreamReader(System.in));
}
private static void print(Object o) {
System.out.println(o);
}
private static void printI(int[] p) {
boolean first = true;
for (int i: p) {
if (first) {
first = false;
} else {
System.out.print(" ");
}
System.out.print(i);
}
System.out.println();
}
public static void main(String[] args) throws IOException {
init();
int n = getInt();
for (int i = 0; i< n; i++) {
long[] as = longArray();
long a = as[0];
long s = as[1];
if (s < a) {
print("No");
continue;
}
long s2 = s - a - a;
if ((s2 & a) == 0) {
print("Yes");
} else {
print("No");
}
}
}
}
| ConDefects/ConDefects/Code/abc238_d/Java/32576769 |
condefects-java_data_1430 | import java.util.*;
import java.io.*;
import java.util.regex.*;
public class Main {
public static void main(String[] args) {
FScanner sc = new FScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(sc, out);
out.flush();
sc.close();
}
public static void solve(FScanner sc, PrintWriter out) {
int n = sc.nextInt();
while(n-- > 0) {
long a = sc.nextLong(), b = sc.nextLong();
if(a * 2 <= b) {
out.println("Yes");
} else {
out.println("No");
}
}
}
}
class FScanner {
private InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FScanner(InputStream in) {
this.in = in;
}
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 int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
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 (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public boolean close() {
return true;
}
}
import java.util.*;
import java.io.*;
import java.util.regex.*;
public class Main {
public static void main(String[] args) {
FScanner sc = new FScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(sc, out);
out.flush();
sc.close();
}
public static void solve(FScanner sc, PrintWriter out) {
int n = sc.nextInt();
while(n-- > 0) {
long a = sc.nextLong(), b = sc.nextLong();
if(a * 2 <= b && ((b - a * 2) & a) == 0) {
out.println("Yes");
} else {
out.println("No");
}
}
}
}
class FScanner {
private InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FScanner(InputStream in) {
this.in = in;
}
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 int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
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 (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public boolean close() {
return true;
}
} | ConDefects/ConDefects/Code/abc238_d/Java/33790374 |
condefects-java_data_1431 | //Some of the methods are copied from GeeksforGeeks Website
import java.util.*;
import java.lang.*;
import java.io.*;
@SuppressWarnings("unchecked")
//@SuppressWarnings("deprecation")
public class Main
{
//static Scanner sc=new Scanner(System.in);
//static Reader sc=new Reader();
static FastReader sc=new FastReader(System.in);
static long mod = (long)(1e9)+7;
static int max_num=(int)1e5+5;
static int MAXN=(int)1e5+5;
static List<Integer> gr[];
public static void main (String[] args) throws java.lang.Exception
{
/* out.println("Case #"+tt+": "+ans );
gr=new ArrayList[n];
for(int i=0;i<n;i++) gr[i]=new ArrayList<>();
int l=0,r=n,ans=0;
while(l<=r)
{
int m=l+(r-l)/2;
if(val(m))
{
ans=m;
l=m+1;
}
else
r=m-1;
}
Collections.sort(al,Collections.reverseOrder());
StringBuilder sb=new StringBuilder(""); sb.append(cur); sb=sb.reverse(); String rev=sb.toString();
map.put(a[i],map.getOrDefault(a[i],0)+1);
map.putIfAbsent(x,new ArrayList<>());
long n=sc.nextLong();
String s=sc.next();
char a[]=s.toCharArray();
*/
int t = sc.nextInt();
for(int tt=1;tt<=t;tt++)
{
long a=sc.nextLong();
long b=sc.nextLong();
long ans=b-2l*a;
boolean f=false;
if(ans>=0) f=true;
flag(f);
}
out.flush();
out.close();
}
/*------------------SOLUTION ENDS HERE--------------------------- */
static void flag(boolean flag)
{
out.println(flag ? "Yes" : "No");
out.flush();
}
// static class Pair
// {
// int x,y;
// Pair(int x,int y)
// {
// this.x=x;
// this.y=y;
// }
// }
/*
Arrays.sort(p, new Comparator<Pair>()
{
@Override
public int compare(Pair o1,Pair o2)
{
if(o1.x>o2.x) return 1;
else if(o1.x==o2.x)
{
if(o1.y>o2.y) return 1;
else return -1;
}
else return -1;
}});
*/
/*
Map<Integer,Integer> map=new HashMap<>();
for(int i=0;i<n;i++)
{
if(!map.containsKey(a[i]))
map.put(a[i],1);
else
map.replace(a[i],map.get(a[i])+1);
}
Set<Map.Entry<Integer,Integer>> hmap=map.entrySet();
for(Map.Entry<Integer,Integer> data : hmap)
{
}
Iterator<Integer> itr = set.iterator();
while(itr.hasNext())
{
int val=itr.next();
}
*/
static void print(int a[])
{
int n=a.length;
for(int i=0;i<n;i++)
{
out.print(a[i]+" ");
}
out.println();
out.flush();
}
static void print(long a[])
{
int n=a.length;
for(int i=0;i<n;i++)
{
out.print(a[i]+" ");
}
out.println();
out.flush();
}
static void print_int(List<Integer> al)
{
int si=al.size();
for(int i=0;i<si;i++)
{
out.print(al.get(i)+" ");
}
out.println();
out.flush();
}
static void print_long(List<Long> al)
{
int si=al.size();
for(int i=0;i<si;i++)
{
out.print(al.get(i)+" ");
}
out.println();
out.flush();
}
static void pn(int x)
{
out.println(x);
out.flush();
}
static void pn(long x)
{
out.println(x);
out.flush();
}
static void pn(String x)
{
out.println(x);
out.flush();
}
static int LowerBound(int a[], int start,int end,int x)
{
int l=start,r=end,ans=-1;
while(l<=r)
{
int m=l+(r-l)/2;
if(a[m]<=x)
{
ans=m;
l=m+1;
}
else r=m-1;
}
return ans;
}
static int UpperBound(int a[], int start,int end,int x)
{
int l=start,r=end,ans=a.length;
while(l<=r)
{
int m=l+(r-l)/2;
if(a[m]>=x)
{
ans=m;
r=m-1;
}
else l=m+1;
}
return ans;
}
static List<Integer> get_primes(int num)
{
boolean[] bool = new boolean[num];
for (int i = 0; i< bool.length; i++)
{
bool[i] = true;
}
for(int i = 2; i< Math.sqrt(num); i++)
{
if(bool[i] == true)
{
for(int j = (i*i); j<num; j = j+i)
{
bool[j] = false;
}
}
}
if(num >= 0)
{
bool[0] = false;
bool[1] = false;
}
List<Integer> al=new ArrayList<>();
for(int i=0;i<bool.length;i++) if(bool[i]) al.add(i);
return al;
}
static int spf[] = new int[MAXN];
// Calculating SPF (Smallest Prime Factor) for every number till MAXN
// Time Complexity : O(nloglogn)
static void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++)
// marking smallest prime factor for every
// number to be itself.
spf[i] = i;
// separately marking spf for every even
// number as 2
for (int i=4; i<MAXN; i+=2)
spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
// checking if i is prime
if (spf[i] == i)
{
// marking SPF for all numbers divisible by i
for (int j=i*i; j<MAXN; j+=i)
// marking spf[j] if it is not
// previously marked
if (spf[j]==j)
spf[j] = i;
}
}
}
// A O(log n) function returning primefactorization
// by dividing by smallest prime factor at every step
static List<Integer> getFactorization(int x)
{
List<Integer> ret = new ArrayList<>();
while (x != 1)
{
ret.add(spf[x]);
x = x / spf[x];
}
return ret;
}
static long nCr(long a,long b,long mod)
{
return (((fact[(int)a] * modInverse(fact[(int)b],mod))%mod * modInverse(fact[(int)(a - b)],mod))%mod + mod)%mod;
}
static long fact[]=new long[max_num];
static void fact_fill()
{
fact[0]=1l;
for(int i=1;i<max_num;i++)
{
fact[i]=(fact[i-1]*(long)i);
if(fact[i]>=mod)
fact[i]%=mod;
}
}
static long modInverse(long a, long m)
{
return power(a, m - 2, m);
}
static long power(long x, long y, long m)
{
if (y == 0)
return 1;
long p = power(x, y / 2, m) % m;
p = (long)((p * (long)p) % m);
if (y % 2 == 0)
return p;
else
return (long)((x * (long)p) % m);
}
static class UF
{
int[] parents;
int count;
UF(int n)
{
parents = new int[n];
for (int i = 0; i < n; i++)
{
parents[i] = i;
}
count = n;
}
int find(int i)
{
if (parents[i] == i)
return i;
parents[i] = find(parents[i]);
return parents[i];
}
void union(int i, int j)
{
int a = find(i);
int b = find(j);
if (a != b)
{
parents[a] = b;
count--;
}
}
}
static long sum_array(int a[])
{
int n=a.length;
long sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
return sum;
}
static long sum_array(long a[])
{
int n=a.length;
long sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
return sum;
}
static void sort(int[] a)
{
ArrayList<Integer> l=new ArrayList<>();
for (int i:a) l.add(i);
Collections.sort(l);
for (int i=0; i<a.length; i++) a[i]=l.get(i);
}
static void sort(long[] a)
{
ArrayList<Long> l=new ArrayList<>();
for (long i:a) l.add(i);
Collections.sort(l);
for (int i=0; i<a.length; i++) a[i]=l.get(i);
}
static void reverse_array(int a[])
{
int n=a.length;
int i,t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
}
static void reverse_array(long a[])
{
int n=a.length;
int i; long t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
}
static long gcd(long a, long b)
{
if (a == 0)
return b;
return gcd(b%a, a);
}
static int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b%a, a);
}
static class FastReader{
byte[] buf = new byte[2048];
int index, total;
InputStream in;
FastReader(InputStream is) {
in = is;
}
int scan() throws IOException {
if (index >= total) {
index = 0;
total = in.read(buf);
if (total <= 0) {
return -1;
}
}
return buf[index++];
}
String next() throws IOException {
int c;
for (c = scan(); c <= 32; c = scan());
StringBuilder sb = new StringBuilder();
for (; c > 32; c = scan()) {
sb.append((char) c);
}
return sb.toString();
}
int nextInt() throws IOException {
int c, val = 0;
for (c = scan(); c <= 32; c = scan());
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
long nextLong() throws IOException {
int c;
long val = 0;
for (c = scan(); c <= 32; c = scan());
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
}
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]; // line length
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 * 10 + 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 void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
static PrintWriter out=new PrintWriter(System.out);
static int int_max=Integer.MAX_VALUE;
static int int_min=Integer.MIN_VALUE;
static long long_max=Long.MAX_VALUE;
static long long_min=Long.MIN_VALUE;
}
// Thank You !
//Some of the methods are copied from GeeksforGeeks Website
import java.util.*;
import java.lang.*;
import java.io.*;
@SuppressWarnings("unchecked")
//@SuppressWarnings("deprecation")
public class Main
{
//static Scanner sc=new Scanner(System.in);
//static Reader sc=new Reader();
static FastReader sc=new FastReader(System.in);
static long mod = (long)(1e9)+7;
static int max_num=(int)1e5+5;
static int MAXN=(int)1e5+5;
static List<Integer> gr[];
public static void main (String[] args) throws java.lang.Exception
{
/* out.println("Case #"+tt+": "+ans );
gr=new ArrayList[n];
for(int i=0;i<n;i++) gr[i]=new ArrayList<>();
int l=0,r=n,ans=0;
while(l<=r)
{
int m=l+(r-l)/2;
if(val(m))
{
ans=m;
l=m+1;
}
else
r=m-1;
}
Collections.sort(al,Collections.reverseOrder());
StringBuilder sb=new StringBuilder(""); sb.append(cur); sb=sb.reverse(); String rev=sb.toString();
map.put(a[i],map.getOrDefault(a[i],0)+1);
map.putIfAbsent(x,new ArrayList<>());
long n=sc.nextLong();
String s=sc.next();
char a[]=s.toCharArray();
*/
int t = sc.nextInt();
for(int tt=1;tt<=t;tt++)
{
long a=sc.nextLong();
long b=sc.nextLong();
long ans=b-2l*a;
boolean f=false;
if(ans>=0 && (ans&a)==0) f=true;
flag(f);
}
out.flush();
out.close();
}
/*------------------SOLUTION ENDS HERE--------------------------- */
static void flag(boolean flag)
{
out.println(flag ? "Yes" : "No");
out.flush();
}
// static class Pair
// {
// int x,y;
// Pair(int x,int y)
// {
// this.x=x;
// this.y=y;
// }
// }
/*
Arrays.sort(p, new Comparator<Pair>()
{
@Override
public int compare(Pair o1,Pair o2)
{
if(o1.x>o2.x) return 1;
else if(o1.x==o2.x)
{
if(o1.y>o2.y) return 1;
else return -1;
}
else return -1;
}});
*/
/*
Map<Integer,Integer> map=new HashMap<>();
for(int i=0;i<n;i++)
{
if(!map.containsKey(a[i]))
map.put(a[i],1);
else
map.replace(a[i],map.get(a[i])+1);
}
Set<Map.Entry<Integer,Integer>> hmap=map.entrySet();
for(Map.Entry<Integer,Integer> data : hmap)
{
}
Iterator<Integer> itr = set.iterator();
while(itr.hasNext())
{
int val=itr.next();
}
*/
static void print(int a[])
{
int n=a.length;
for(int i=0;i<n;i++)
{
out.print(a[i]+" ");
}
out.println();
out.flush();
}
static void print(long a[])
{
int n=a.length;
for(int i=0;i<n;i++)
{
out.print(a[i]+" ");
}
out.println();
out.flush();
}
static void print_int(List<Integer> al)
{
int si=al.size();
for(int i=0;i<si;i++)
{
out.print(al.get(i)+" ");
}
out.println();
out.flush();
}
static void print_long(List<Long> al)
{
int si=al.size();
for(int i=0;i<si;i++)
{
out.print(al.get(i)+" ");
}
out.println();
out.flush();
}
static void pn(int x)
{
out.println(x);
out.flush();
}
static void pn(long x)
{
out.println(x);
out.flush();
}
static void pn(String x)
{
out.println(x);
out.flush();
}
static int LowerBound(int a[], int start,int end,int x)
{
int l=start,r=end,ans=-1;
while(l<=r)
{
int m=l+(r-l)/2;
if(a[m]<=x)
{
ans=m;
l=m+1;
}
else r=m-1;
}
return ans;
}
static int UpperBound(int a[], int start,int end,int x)
{
int l=start,r=end,ans=a.length;
while(l<=r)
{
int m=l+(r-l)/2;
if(a[m]>=x)
{
ans=m;
r=m-1;
}
else l=m+1;
}
return ans;
}
static List<Integer> get_primes(int num)
{
boolean[] bool = new boolean[num];
for (int i = 0; i< bool.length; i++)
{
bool[i] = true;
}
for(int i = 2; i< Math.sqrt(num); i++)
{
if(bool[i] == true)
{
for(int j = (i*i); j<num; j = j+i)
{
bool[j] = false;
}
}
}
if(num >= 0)
{
bool[0] = false;
bool[1] = false;
}
List<Integer> al=new ArrayList<>();
for(int i=0;i<bool.length;i++) if(bool[i]) al.add(i);
return al;
}
static int spf[] = new int[MAXN];
// Calculating SPF (Smallest Prime Factor) for every number till MAXN
// Time Complexity : O(nloglogn)
static void sieve()
{
spf[1] = 1;
for (int i=2; i<MAXN; i++)
// marking smallest prime factor for every
// number to be itself.
spf[i] = i;
// separately marking spf for every even
// number as 2
for (int i=4; i<MAXN; i+=2)
spf[i] = 2;
for (int i=3; i*i<MAXN; i++)
{
// checking if i is prime
if (spf[i] == i)
{
// marking SPF for all numbers divisible by i
for (int j=i*i; j<MAXN; j+=i)
// marking spf[j] if it is not
// previously marked
if (spf[j]==j)
spf[j] = i;
}
}
}
// A O(log n) function returning primefactorization
// by dividing by smallest prime factor at every step
static List<Integer> getFactorization(int x)
{
List<Integer> ret = new ArrayList<>();
while (x != 1)
{
ret.add(spf[x]);
x = x / spf[x];
}
return ret;
}
static long nCr(long a,long b,long mod)
{
return (((fact[(int)a] * modInverse(fact[(int)b],mod))%mod * modInverse(fact[(int)(a - b)],mod))%mod + mod)%mod;
}
static long fact[]=new long[max_num];
static void fact_fill()
{
fact[0]=1l;
for(int i=1;i<max_num;i++)
{
fact[i]=(fact[i-1]*(long)i);
if(fact[i]>=mod)
fact[i]%=mod;
}
}
static long modInverse(long a, long m)
{
return power(a, m - 2, m);
}
static long power(long x, long y, long m)
{
if (y == 0)
return 1;
long p = power(x, y / 2, m) % m;
p = (long)((p * (long)p) % m);
if (y % 2 == 0)
return p;
else
return (long)((x * (long)p) % m);
}
static class UF
{
int[] parents;
int count;
UF(int n)
{
parents = new int[n];
for (int i = 0; i < n; i++)
{
parents[i] = i;
}
count = n;
}
int find(int i)
{
if (parents[i] == i)
return i;
parents[i] = find(parents[i]);
return parents[i];
}
void union(int i, int j)
{
int a = find(i);
int b = find(j);
if (a != b)
{
parents[a] = b;
count--;
}
}
}
static long sum_array(int a[])
{
int n=a.length;
long sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
return sum;
}
static long sum_array(long a[])
{
int n=a.length;
long sum=0;
for(int i=0;i<n;i++)
sum+=a[i];
return sum;
}
static void sort(int[] a)
{
ArrayList<Integer> l=new ArrayList<>();
for (int i:a) l.add(i);
Collections.sort(l);
for (int i=0; i<a.length; i++) a[i]=l.get(i);
}
static void sort(long[] a)
{
ArrayList<Long> l=new ArrayList<>();
for (long i:a) l.add(i);
Collections.sort(l);
for (int i=0; i<a.length; i++) a[i]=l.get(i);
}
static void reverse_array(int a[])
{
int n=a.length;
int i,t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
}
static void reverse_array(long a[])
{
int n=a.length;
int i; long t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
}
static long gcd(long a, long b)
{
if (a == 0)
return b;
return gcd(b%a, a);
}
static int gcd(int a, int b)
{
if (a == 0)
return b;
return gcd(b%a, a);
}
static class FastReader{
byte[] buf = new byte[2048];
int index, total;
InputStream in;
FastReader(InputStream is) {
in = is;
}
int scan() throws IOException {
if (index >= total) {
index = 0;
total = in.read(buf);
if (total <= 0) {
return -1;
}
}
return buf[index++];
}
String next() throws IOException {
int c;
for (c = scan(); c <= 32; c = scan());
StringBuilder sb = new StringBuilder();
for (; c > 32; c = scan()) {
sb.append((char) c);
}
return sb.toString();
}
int nextInt() throws IOException {
int c, val = 0;
for (c = scan(); c <= 32; c = scan());
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
long nextLong() throws IOException {
int c;
long val = 0;
for (c = scan(); c <= 32; c = scan());
boolean neg = c == '-';
if (c == '-' || c == '+') {
c = scan();
}
for (; c >= '0' && c <= '9'; c = scan()) {
val = (val << 3) + (val << 1) + (c & 15);
}
return neg ? -val : val;
}
}
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]; // line length
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 * 10 + 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 void close() throws IOException
{
if (din == null)
return;
din.close();
}
}
static PrintWriter out=new PrintWriter(System.out);
static int int_max=Integer.MAX_VALUE;
static int int_min=Integer.MIN_VALUE;
static long long_max=Long.MAX_VALUE;
static long long_min=Long.MIN_VALUE;
}
// Thank You ! | ConDefects/ConDefects/Code/abc238_d/Java/37584869 |
condefects-java_data_1432 |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
for(int T = ni();T > 0;T--)go();
}
static void go()
{
long x = ni(), y = ni();
char[] s = ns(8);
if(x < 0){
x = -x;
{char d = s[0]; s[0] = s[4]; s[4] = d;}
{char d = s[1]; s[1] = s[3]; s[3] = d;}
{char d = s[5]; s[5] = s[7]; s[7] = d;}
}
if(y < 0){
y = -y;
{char d = s[1]; s[1] = s[7]; s[7] = d;}
{char d = s[2]; s[2] = s[6]; s[6] = d;}
{char d = s[3]; s[3] = s[5]; s[5] = d;}
}
if(x < y){
long z = x; x = y; y = z;
{char d = s[0]; s[0] = s[2]; s[2] = d;}
{char d = s[3]; s[3] = s[7]; s[7] = d;}
{char d = s[4]; s[4] = s[6]; s[6] = d;}
}
// x >= y >= 0
if(x == 0 && y == 0){
out.println(0);
return;
}
long ret = Long.MAX_VALUE;
if(s[0] == '1' && y == 0){
ret = Math.min(ret, x);
}
if(s[1] == '1' && y == x){
ret = Math.min(ret, x);
}
if(s[0] == '1' && s[2] == '1'){
ret = Math.min(ret, x+y);
}
if(s[0] == '1' && s[1] == '1'){
ret = Math.min(ret, x);
}
if(s[0] == '1' && s[3] == '1'){
ret = Math.min(ret, x+y+y);
}
if(s[6] == '1' && s[1] == '1'){
ret = Math.min(ret, 2*x-y);
}
if(s[7] == '1' && s[1] == '1'){
if((x+y) % 2 == 0) {
ret = Math.min(ret, x);
}
}
if(s[7] == '1' && s[1] == '1' && s[0] == '1'){
ret = Math.min(ret, x);
}
if(s[7] == '1' && s[1] == '1' && s[2] == '1'){
ret = Math.min(ret, x+1);
}
if(s[7] == '1' && s[1] == '1' && s[5] == '1'){
ret = Math.min(ret, x+2);
}
if(s[7] == '1' && s[1] == '1' && s[6] == '1'){
ret = Math.min(ret, x+1);
}
if(s[2] == '1' && s[7] == '1'){
ret = Math.min(ret, 2*x+y);
}
out.println(ret == Long.MAX_VALUE ? -1 : ret);
}
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.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
for(int T = ni();T > 0;T--)go();
}
static void go()
{
long x = ni(), y = ni();
char[] s = ns(8);
if(x < 0){
x = -x;
{char d = s[0]; s[0] = s[4]; s[4] = d;}
{char d = s[1]; s[1] = s[3]; s[3] = d;}
{char d = s[5]; s[5] = s[7]; s[7] = d;}
}
if(y < 0){
y = -y;
{char d = s[1]; s[1] = s[7]; s[7] = d;}
{char d = s[2]; s[2] = s[6]; s[6] = d;}
{char d = s[3]; s[3] = s[5]; s[5] = d;}
}
if(x < y){
long z = x; x = y; y = z;
{char d = s[0]; s[0] = s[2]; s[2] = d;}
{char d = s[3]; s[3] = s[7]; s[7] = d;}
{char d = s[4]; s[4] = s[6]; s[6] = d;}
}
// x >= y >= 0
if(x == 0 && y == 0){
out.println(0);
return;
}
long ret = Long.MAX_VALUE;
if(s[0] == '1' && y == 0){
ret = Math.min(ret, x);
}
if(s[1] == '1' && y == x){
ret = Math.min(ret, x);
}
if(s[0] == '1' && s[2] == '1'){
ret = Math.min(ret, x+y);
}
if(s[0] == '1' && s[1] == '1'){
ret = Math.min(ret, x);
}
if(s[0] == '1' && s[3] == '1'){
ret = Math.min(ret, x+y+y);
}
if(s[6] == '1' && s[1] == '1'){
ret = Math.min(ret, 2*x-y);
}
if(s[7] == '1' && s[1] == '1'){
if((x+y) % 2 == 0) {
ret = Math.min(ret, x);
}
}
if(s[7] == '1' && s[1] == '1' && s[0] == '1'){
ret = Math.min(ret, x);
}
if(s[7] == '1' && s[1] == '1' && s[2] == '1'){
ret = Math.min(ret, x+1);
}
if(s[7] == '1' && s[1] == '1' && s[4] == '1'){
ret = Math.min(ret, x+2);
}
if(s[7] == '1' && s[1] == '1' && s[6] == '1'){
ret = Math.min(ret, x+1);
}
if(s[2] == '1' && s[7] == '1'){
ret = Math.min(ret, 2*x+y);
}
out.println(ret == Long.MAX_VALUE ? -1 : ret);
}
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/abc271_h/Java/35328871 |
condefects-java_data_1433 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.*;
public class Main {
public static void main(String[] args) {
Solver.SOLVE();
}
}
class UnionFind {
private int[] roots;
public UnionFind(int n){
roots = new int[n];
for (int i = 0; i < n; i++) {
roots[i] = i;
}
}
public int root(int x){
if(roots[x] == x){
return x;
}
return roots[x] = root(roots[x]);
}
public void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
return;
}
roots[rx] = ry;
}
public boolean same(int x,int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
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))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
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))
throw new IndexOutOfBoundsException("" + a);
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<>(n);
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(ArrayList::isEmpty);
return result;
}
}
class PairL implements Comparable<PairL>, Comparator<PairL> {
public long x,y;
public PairL(long x,long y) {
this.x = x;
this.y = y;
}
public void swap(){
long t = x;
x = y;
y = t;
}
@Override
public int compare(PairL o1, PairL o2) {
return o1.compareTo(o2);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairL pairl = (PairL) o;
return x == pairl.x && y == pairl.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
public PairL add(PairL p){
return new PairL(x+p.x,y+p.y);
}
@Override
public int compareTo(PairL o) {
return Long.compare(x,o.x);
}
}
class PairI implements Comparable<PairI>, Comparator<PairI> {
public int x,y;
public PairI(int x,int y) {
this.x = x;
this.y = y;
}
public void swap(){
int t = x;
x = y;
y = t;
}
@Override
public int compare(PairI o1, PairI o2) {
if(o1.x == o2.x){
return Integer.compare(o1.y,o2.y);
}
return Integer.compare(o1.x,o2.x);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return x == pairI.x && y == pairI.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public int compareTo(PairI o) {
if(x == o.x){
return Integer.compare(y,o.y);
}
return Integer.compare(x,o.x);
}
public PairI add(PairI p){
return new PairI(x+p.x,y+p.y);
}
public PairI sub(PairI p){
return new PairI(x-p.x,y-p.y);
}
public PairI addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new PairI(x,y);
}
return null;
}
}
class Line{
//ax+bx+c=0
long a,b,c;
public Line(int x0, int y0, int x1, int y1) {
long dx = x1-x0;
long dy = y1-y0;
long gcd = Solver.gcd(dx,dy);
dx/=gcd;
dy/=gcd;
if(dx < 0){
dx=-dx;
dy=-dy;
}
if(dx == 0 && dy < 0){
dy=-dy;
}
a = dy;
b = -dx;
c = dx*y0-dy*x0;
}
public boolean onLine(int x,int y){
return a*x + b*y + c == 0;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Line line = (Line) o;
return a == line.a && b == line.b && c == line.c;
}
@Override
public int hashCode() {
return Objects.hash(a, b, c);
}
}
class Dist extends PairI{
int d;
public Dist(int x,int y,int d){
super(x,y);
this.d = d;
}
public Dist addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new Dist(x,y,d+1);
}
return null;
}
}
class Tuple implements Comparable<Tuple>{
public int x,y,z;
public Tuple(int x, int y, int z) {
this.x = x;
this.y = y;
this.z = z;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Tuple three = (Tuple) o;
return x == three.x && y == three.y && z == three.z;
}
@Override
public int hashCode() {
return Objects.hash(x, y, z);
}
@Override
public int compareTo(Tuple o) {
return Integer.compare(z,o.z);
}
}
class Node implements Comparable<Node>{
public int from;
public int to;
public long d;
public Node(int to,long d){
this.to = to;
this.d = d;
}
public Node(int from,int to,long d){
this.to = to;
this.from = from;
this.d = d;
}
@Override
public int compareTo(Node o) {
return Long.compare(d,o.d);
}
}
class PairC{
char a,b;
public PairC(char a, char b){
this.a = a;
this.b = b;
}
}
class IB{
int i;
boolean b;
IB(int i,boolean b){
this.i = i;
this.b = b;
}
}
class CI{
char c;
int i;
CI(char c,int i){
this.c = c;
this.i = i;
}
}
class Solver {
public static final int MOD1 = 1000000007;
public static final int MOD9 = 998244353;
public static Scanner sc = new Scanner(System.in);
public static final int inf = 2000000000;
public static final int ninf = -inf;
public static final char[] alpha = "abcdefghijklmnopqrstuvwxyz".toCharArray();
public static final char[] ALPHA = "abcdefghijklmnopqrstuvwxyz".toUpperCase().toCharArray();
public static FastScanner fs = new FastScanner();
public static PrintWriter out = new PrintWriter(System.out);
public static final PairI[] move = new PairI[]{new PairI(1,0),new PairI(0,1),new PairI(-1,0),new PairI(0,-1)};
public static void solve() {
long n = rL();
long ans = 0;
long before = n;
for (long i = 1; i*i <= n; i++) {
ans += n/i;
if(i*i != n){
ans += (before-n/(i+1))*i;
}
before = n/(i+1);
}
oL(ans);
}
static boolean check(long t,long a,long b){
for (long x = 0; x < t; x++) {
long y = t-x;
if((b+y)%(a+x) == 0){
return true;
}
}
return false;
}
static int degL(long x){
return String.valueOf(x).length();
}
static int degN(long x,int d){
x/=pow(10,d);
return (int)(x%10);
}
static long comb(int n,int r){
if(r*2 > n){
r = n-r;
}
long ans = 1;
for (int i = 0; i < r; i++) {
ans*=(n-i);
ans/=(i+1);
}
return ans;
}
static boolean isPalindrome(int a,int b,String s){
int dif = b-a;
boolean ok = true;
for (int i = 0; i < dif; i++) {
if (s.charAt(i + a) != s.charAt(b - i)) {
ok = false;
break;
}
}
return ok;
}
static int intValue(char c){
return Integer.parseInt(String.valueOf(c));
}
@SuppressWarnings("unchecked")
static class SegTree<T>{
T[] data;
int size;
BinaryOperator<T> op;
T e;
int inisize;
SegTree(T[] a,BinaryOperator<T> op,T e){
size = 1;
inisize = a.length;
while (size < a.length){
size <<= 1;
}
this.e = e;
this.op = op;
data = (T[])new Object[size*2];
Arrays.fill(data,e);
System.arraycopy(a,0,data,size,a.length);
for (int i = size-1; i > 0; i--) {
data[i] = op.apply(data[i*2],data[i*2+1]);
}
}
void update(int i,T x){
if(i < 0) throw new IllegalArgumentException();
i += size;
data[i] = x;
while (i > 1){
data[i >> 1] = op.apply(data[i],data[i^1]);
i >>= 1;
}
}
T query(int l,int r){
if(l < 0) throw new IllegalArgumentException();
if(r < 0) throw new IllegalArgumentException();
T res = e;
l += size;
r += size;
while (l < r){
if((l & 1) == 1) {
res = op.apply(res,data[l]);
l++;
}
if((r & 1) == 1){
res = op.apply(res,data[r-1]);
}
l >>= 1;
r >>= 1;
}
return res;
}
int maxRight(int l,Predicate<T> pr){
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if(l == inisize) return l;
l+=size;
T sum = e;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!pr.test(op.apply(sum, data[l]))) {
while (l < size) {
l = l << 1;
if (pr.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - size;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return inisize;
}
public int minLeft(int r,Predicate<T> pr) {
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if (r == 0) {
return 0;
}
r += size;
T sum = e;
do {
r--;
while (r > 1 && (r & 1) == 1) {
r >>= 1;
}
if (!pr.test(op.apply(data[r], sum))) {
while (r < size) {
r = r << 1 | 1;
if (pr.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - size;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
}
public static int toIntC(char c){
for (int i = 0; i < ALPHA.length; i++) {
if(c == ALPHA[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static int toInt(char c){
for (int i = 0; i < alpha.length; i++) {
if(c == alpha[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static void reverse(int[] a){
int[] tmp = a.clone();
for (int i = 0; i < a.length; i++) {
a[i] = tmp[a.length - 1 - i];
}
}
public static int[] compress(int[] a){
int[] ans = new int[a.length];
int[] b = erase(a);
Arrays.sort(b);
for (int i = 0; i < a.length; i++) {
ans[i] = lower(b,a[i]);
}
return ans;
}
public static int lower(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int lower(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int upper(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int upper(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int[] erase(int[] a){
HashSet<Integer> used = new HashSet<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < a.length; i++) {
if(!used.contains(a[i])){
used.add(a[i]);
ans.add(a[i]);
}
}
return convI(ans);
}
public static int abs(int a){
return Math.abs(a);
}
public static long abs(long a){
return Math.abs(a);
}
public static int max(int a,int b){
return Math.max(a,b);
}
public static int max(int... a){
int max = Integer.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static long max(long a,long b){
return Math.max(a,b);
}
public static long max(long... a){
long max = Long.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static int min(int a,int b){
return Math.min(a,b);
}
public static int min(int... a){
int min = Integer.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static long min(long a,long b){
return Math.min(a, b);
}
public static long min(long... a){
long min = Long.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static final class MC {
private final int mod;
public MC(final int mod) {
this.mod = mod;
}
public long mod(long x) {
x %= mod;
if (x < 0) {
x += mod;
}
return x;
}
public long add(final long a, final long b) {
return mod(mod(a) + mod(b));
}
public long add(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = add(ans,a[i]);
}
return mod(ans);
}
public long mul(final long a, final long b) {
return mod(mod(a) * mod(b));
}
public long mul(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = mul(ans,a[i]);
}
return mod(ans);
}
public long div(final long numerator, final long denominator) {
return mod(numerator * inverse(denominator));
}
public long power(long base, long exp) {
long ret = 1;
base %= mod;
while (exp > 0) {
if ((exp & 1) == 1) {
ret = mul(ret, base);
}
base = mul(base, base);
exp >>= 1;
}
return ret;
}
public long inverse(final long x) {
return power(x, mod - 2);
}
public long factorial(final int n) {
return product(1, n);
}
public long product(final int start, final int end) {
long result = 1;
for (int i = start; i <= end; i++) {
result *= i;
result %= mod;
}
return result;
}
public long combination(final int n, int r) {
if (r > n) {
return 0;
}
return div(product(n - r + 1, n), factorial(r));
}
}
public static long pow(long x,long n){
long ans = 1L;
long tmp = x;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
}
tmp *=tmp;
n = n >> 1;
}
return ans;
}
public static long modPow(long x,long n,long m){
long ans = 1L;
long tmp = x%m;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
ans%=m;
}
tmp *=tmp;
tmp%=m;
n = n >> 1;
}
return ans;
}
public static int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static long gcd(long a,long b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static int gcd(int... a){
int ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long gcd(long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long lcm(int a,int b){
return (long) a / gcd(a, b) * b;
}
public static long lcm(long a,long b){
return a / gcd(a,b) * b;
}
public static boolean isPrime(long x){
if(x < 2) return false;
else if(x == 2) return true;
if(x%2 == 0) return false;
for(long i = 3; i*i <= x; i+= 2){
if(x%i == 0) return false;
}
return true;
}
public static int rI() {
return fs.nextInt();
}
public static int[] rIv(int length) {
int[] res = new int[length];
for (int i = 0; i < length; i++) {
res[i] = fs.nextInt();
}
return res;
}
public static String rS() {
return fs.next();
}
public static String[] rSv(int length) {
String[] res = new String[length];
for (int i = 0; i < length; i++) res[i] = fs.next();
return res;
}
public static long rL() {
return fs.nextLong();
}
public static long[] rLv(int length) {
long[] res = new long[length];
for (int i = 0; i < length; i++) res[i] = fs.nextLong();
return res;
}
public static double rD(){
return fs.nextDouble();
}
public static double[] rDv(int length){
double[] res = new double[length];
for (int i = 0; i < length; i++) res[i] = rD();
return res;
}
public static String aiS(int[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String alS(long[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String adS(double[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String acS(char[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String asS(String[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a, IntUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsInt(a.get(i)));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a, LongUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsLong(a.get(i)));
}
return ans.toString();
}
public static String ldS(ArrayList<Double> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lcS(ArrayList<Character> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lsS(ArrayList<String> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static void nL(){
out.println();
}
public static void oI(int a) {
out.println(a);
}
public static void onI(int a){
out.print(a);
}
public static void oIv(int[] a) {
oS(aiS(a));
}
public static void oS(String s) {
out.println(s);
}
public static void onS(String s) {
out.print(s);
}
public static void oSv(String[] a) {
oS(asS(a));
}
public static void oL(long l) {
out.println(l);
}
public static void onL(long l) {
out.print(l);
}
public static void oLv(long[] a) {
oS(alS(a));
}
public static void oD(double d){
out.println(d);
}
public static void onD(double d){
out.print(d);
}
public static void oDv(double[] d){
oS(adS(d));
}
public static void oC(char c){
out.println(c);
}
public static void onC(char c){
out.print(c);
}
public static void oCv(char[] c){
oS(acS(c));
}
public static void yes_no(boolean yes){
if(yes){
oS("Yes");
return;
}
oS("No");
}
public static int fact(int num) {
if (num == 0) {
return 1;
} else if (num == 1) {
return 1;
} else if (num < 0) {
throw new IllegalArgumentException("factorial should be bigger than 0");
}
return num * fact(num - 1);
}
public static int[] convI(ArrayList<Integer> list) {
int[] res = new int[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static long[] convL(ArrayList<Long> list) {
long[] res = new long[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static String[] convS(ArrayList<String> list) {
String[] res = new String[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static ArrayList<Integer> convI(int[] vec) {
ArrayList<Integer> list = new ArrayList<>();
for (int i : vec) list.add(i);
return list;
}
public static ArrayList<Long> convL(long[] vec) {
ArrayList<Long> list = new ArrayList<>();
for (long i : vec) list.add(i);
return list;
}
public static ArrayList<String> convS(String[] vec) {
return new ArrayList<>(Arrays.asList(vec));
}
public static ArrayList<ArrayList<Integer>> permutation(int a) {
int[] list = new int[a];
for (int i = 0; i < a; i++) {
list[i] = i;
}
return permutation(list);
}
public static ArrayList<ArrayList<Integer>> permutation(int[] seed) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
int[] perm = new int[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(int[] seed, int[] perm, boolean[] used, int index,ArrayList<ArrayList<Integer>> res) {
if (index == seed.length) {
res.add(convI(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static ArrayList<ArrayList<String>> permutation(String[] seed) {
ArrayList<ArrayList<String>> res = new ArrayList<>();
String[] perm = new String[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(String[] seed, String[] perm, boolean[] used, int index,ArrayList<ArrayList<String>> res) {
if (index == seed.length) {
res.add(convS(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static void swap(int[] a,int i1,int i2){
int t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void swap(char[] a,int i1,int i2){
char t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void SOLVE(){
solve();
out.flush();
}
}
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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.*;
public class Main {
public static void main(String[] args) {
Solver.SOLVE();
}
}
class UnionFind {
private int[] roots;
public UnionFind(int n){
roots = new int[n];
for (int i = 0; i < n; i++) {
roots[i] = i;
}
}
public int root(int x){
if(roots[x] == x){
return x;
}
return roots[x] = root(roots[x]);
}
public void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
return;
}
roots[rx] = ry;
}
public boolean same(int x,int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
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))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
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))
throw new IndexOutOfBoundsException("" + a);
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<>(n);
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(ArrayList::isEmpty);
return result;
}
}
class PairL implements Comparable<PairL>, Comparator<PairL> {
public long x,y;
public PairL(long x,long y) {
this.x = x;
this.y = y;
}
public void swap(){
long t = x;
x = y;
y = t;
}
@Override
public int compare(PairL o1, PairL o2) {
return o1.compareTo(o2);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairL pairl = (PairL) o;
return x == pairl.x && y == pairl.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
public PairL add(PairL p){
return new PairL(x+p.x,y+p.y);
}
@Override
public int compareTo(PairL o) {
return Long.compare(x,o.x);
}
}
class PairI implements Comparable<PairI>, Comparator<PairI> {
public int x,y;
public PairI(int x,int y) {
this.x = x;
this.y = y;
}
public void swap(){
int t = x;
x = y;
y = t;
}
@Override
public int compare(PairI o1, PairI o2) {
if(o1.x == o2.x){
return Integer.compare(o1.y,o2.y);
}
return Integer.compare(o1.x,o2.x);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return x == pairI.x && y == pairI.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public int compareTo(PairI o) {
if(x == o.x){
return Integer.compare(y,o.y);
}
return Integer.compare(x,o.x);
}
public PairI add(PairI p){
return new PairI(x+p.x,y+p.y);
}
public PairI sub(PairI p){
return new PairI(x-p.x,y-p.y);
}
public PairI addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new PairI(x,y);
}
return null;
}
}
class Line{
//ax+bx+c=0
long a,b,c;
public Line(int x0, int y0, int x1, int y1) {
long dx = x1-x0;
long dy = y1-y0;
long gcd = Solver.gcd(dx,dy);
dx/=gcd;
dy/=gcd;
if(dx < 0){
dx=-dx;
dy=-dy;
}
if(dx == 0 && dy < 0){
dy=-dy;
}
a = dy;
b = -dx;
c = dx*y0-dy*x0;
}
public boolean onLine(int x,int y){
return a*x + b*y + c == 0;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Line line = (Line) o;
return a == line.a && b == line.b && c == line.c;
}
@Override
public int hashCode() {
return Objects.hash(a, b, c);
}
}
class Dist extends PairI{
int d;
public Dist(int x,int y,int d){
super(x,y);
this.d = d;
}
public Dist addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new Dist(x,y,d+1);
}
return null;
}
}
class Tuple implements Comparable<Tuple>{
public int x,y,z;
public Tuple(int x, int y, int z) {
this.x = x;
this.y = y;
this.z = z;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Tuple three = (Tuple) o;
return x == three.x && y == three.y && z == three.z;
}
@Override
public int hashCode() {
return Objects.hash(x, y, z);
}
@Override
public int compareTo(Tuple o) {
return Integer.compare(z,o.z);
}
}
class Node implements Comparable<Node>{
public int from;
public int to;
public long d;
public Node(int to,long d){
this.to = to;
this.d = d;
}
public Node(int from,int to,long d){
this.to = to;
this.from = from;
this.d = d;
}
@Override
public int compareTo(Node o) {
return Long.compare(d,o.d);
}
}
class PairC{
char a,b;
public PairC(char a, char b){
this.a = a;
this.b = b;
}
}
class IB{
int i;
boolean b;
IB(int i,boolean b){
this.i = i;
this.b = b;
}
}
class CI{
char c;
int i;
CI(char c,int i){
this.c = c;
this.i = i;
}
}
class Solver {
public static final int MOD1 = 1000000007;
public static final int MOD9 = 998244353;
public static Scanner sc = new Scanner(System.in);
public static final int inf = 2000000000;
public static final int ninf = -inf;
public static final char[] alpha = "abcdefghijklmnopqrstuvwxyz".toCharArray();
public static final char[] ALPHA = "abcdefghijklmnopqrstuvwxyz".toUpperCase().toCharArray();
public static FastScanner fs = new FastScanner();
public static PrintWriter out = new PrintWriter(System.out);
public static final PairI[] move = new PairI[]{new PairI(1,0),new PairI(0,1),new PairI(-1,0),new PairI(0,-1)};
public static void solve() {
long n = rL();
long ans = 0;
long before = n;
for (long i = 1; i*i <= n; i++) {
ans += n/i;
if(n/i != i){
ans += (before-n/(i+1))*i;
}
before = n/(i+1);
}
oL(ans);
}
static boolean check(long t,long a,long b){
for (long x = 0; x < t; x++) {
long y = t-x;
if((b+y)%(a+x) == 0){
return true;
}
}
return false;
}
static int degL(long x){
return String.valueOf(x).length();
}
static int degN(long x,int d){
x/=pow(10,d);
return (int)(x%10);
}
static long comb(int n,int r){
if(r*2 > n){
r = n-r;
}
long ans = 1;
for (int i = 0; i < r; i++) {
ans*=(n-i);
ans/=(i+1);
}
return ans;
}
static boolean isPalindrome(int a,int b,String s){
int dif = b-a;
boolean ok = true;
for (int i = 0; i < dif; i++) {
if (s.charAt(i + a) != s.charAt(b - i)) {
ok = false;
break;
}
}
return ok;
}
static int intValue(char c){
return Integer.parseInt(String.valueOf(c));
}
@SuppressWarnings("unchecked")
static class SegTree<T>{
T[] data;
int size;
BinaryOperator<T> op;
T e;
int inisize;
SegTree(T[] a,BinaryOperator<T> op,T e){
size = 1;
inisize = a.length;
while (size < a.length){
size <<= 1;
}
this.e = e;
this.op = op;
data = (T[])new Object[size*2];
Arrays.fill(data,e);
System.arraycopy(a,0,data,size,a.length);
for (int i = size-1; i > 0; i--) {
data[i] = op.apply(data[i*2],data[i*2+1]);
}
}
void update(int i,T x){
if(i < 0) throw new IllegalArgumentException();
i += size;
data[i] = x;
while (i > 1){
data[i >> 1] = op.apply(data[i],data[i^1]);
i >>= 1;
}
}
T query(int l,int r){
if(l < 0) throw new IllegalArgumentException();
if(r < 0) throw new IllegalArgumentException();
T res = e;
l += size;
r += size;
while (l < r){
if((l & 1) == 1) {
res = op.apply(res,data[l]);
l++;
}
if((r & 1) == 1){
res = op.apply(res,data[r-1]);
}
l >>= 1;
r >>= 1;
}
return res;
}
int maxRight(int l,Predicate<T> pr){
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if(l == inisize) return l;
l+=size;
T sum = e;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!pr.test(op.apply(sum, data[l]))) {
while (l < size) {
l = l << 1;
if (pr.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - size;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return inisize;
}
public int minLeft(int r,Predicate<T> pr) {
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if (r == 0) {
return 0;
}
r += size;
T sum = e;
do {
r--;
while (r > 1 && (r & 1) == 1) {
r >>= 1;
}
if (!pr.test(op.apply(data[r], sum))) {
while (r < size) {
r = r << 1 | 1;
if (pr.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - size;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
}
public static int toIntC(char c){
for (int i = 0; i < ALPHA.length; i++) {
if(c == ALPHA[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static int toInt(char c){
for (int i = 0; i < alpha.length; i++) {
if(c == alpha[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static void reverse(int[] a){
int[] tmp = a.clone();
for (int i = 0; i < a.length; i++) {
a[i] = tmp[a.length - 1 - i];
}
}
public static int[] compress(int[] a){
int[] ans = new int[a.length];
int[] b = erase(a);
Arrays.sort(b);
for (int i = 0; i < a.length; i++) {
ans[i] = lower(b,a[i]);
}
return ans;
}
public static int lower(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int lower(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int upper(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int upper(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int[] erase(int[] a){
HashSet<Integer> used = new HashSet<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < a.length; i++) {
if(!used.contains(a[i])){
used.add(a[i]);
ans.add(a[i]);
}
}
return convI(ans);
}
public static int abs(int a){
return Math.abs(a);
}
public static long abs(long a){
return Math.abs(a);
}
public static int max(int a,int b){
return Math.max(a,b);
}
public static int max(int... a){
int max = Integer.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static long max(long a,long b){
return Math.max(a,b);
}
public static long max(long... a){
long max = Long.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static int min(int a,int b){
return Math.min(a,b);
}
public static int min(int... a){
int min = Integer.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static long min(long a,long b){
return Math.min(a, b);
}
public static long min(long... a){
long min = Long.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static final class MC {
private final int mod;
public MC(final int mod) {
this.mod = mod;
}
public long mod(long x) {
x %= mod;
if (x < 0) {
x += mod;
}
return x;
}
public long add(final long a, final long b) {
return mod(mod(a) + mod(b));
}
public long add(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = add(ans,a[i]);
}
return mod(ans);
}
public long mul(final long a, final long b) {
return mod(mod(a) * mod(b));
}
public long mul(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = mul(ans,a[i]);
}
return mod(ans);
}
public long div(final long numerator, final long denominator) {
return mod(numerator * inverse(denominator));
}
public long power(long base, long exp) {
long ret = 1;
base %= mod;
while (exp > 0) {
if ((exp & 1) == 1) {
ret = mul(ret, base);
}
base = mul(base, base);
exp >>= 1;
}
return ret;
}
public long inverse(final long x) {
return power(x, mod - 2);
}
public long factorial(final int n) {
return product(1, n);
}
public long product(final int start, final int end) {
long result = 1;
for (int i = start; i <= end; i++) {
result *= i;
result %= mod;
}
return result;
}
public long combination(final int n, int r) {
if (r > n) {
return 0;
}
return div(product(n - r + 1, n), factorial(r));
}
}
public static long pow(long x,long n){
long ans = 1L;
long tmp = x;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
}
tmp *=tmp;
n = n >> 1;
}
return ans;
}
public static long modPow(long x,long n,long m){
long ans = 1L;
long tmp = x%m;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
ans%=m;
}
tmp *=tmp;
tmp%=m;
n = n >> 1;
}
return ans;
}
public static int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static long gcd(long a,long b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static int gcd(int... a){
int ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long gcd(long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long lcm(int a,int b){
return (long) a / gcd(a, b) * b;
}
public static long lcm(long a,long b){
return a / gcd(a,b) * b;
}
public static boolean isPrime(long x){
if(x < 2) return false;
else if(x == 2) return true;
if(x%2 == 0) return false;
for(long i = 3; i*i <= x; i+= 2){
if(x%i == 0) return false;
}
return true;
}
public static int rI() {
return fs.nextInt();
}
public static int[] rIv(int length) {
int[] res = new int[length];
for (int i = 0; i < length; i++) {
res[i] = fs.nextInt();
}
return res;
}
public static String rS() {
return fs.next();
}
public static String[] rSv(int length) {
String[] res = new String[length];
for (int i = 0; i < length; i++) res[i] = fs.next();
return res;
}
public static long rL() {
return fs.nextLong();
}
public static long[] rLv(int length) {
long[] res = new long[length];
for (int i = 0; i < length; i++) res[i] = fs.nextLong();
return res;
}
public static double rD(){
return fs.nextDouble();
}
public static double[] rDv(int length){
double[] res = new double[length];
for (int i = 0; i < length; i++) res[i] = rD();
return res;
}
public static String aiS(int[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String alS(long[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String adS(double[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String acS(char[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String asS(String[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a, IntUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsInt(a.get(i)));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a, LongUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsLong(a.get(i)));
}
return ans.toString();
}
public static String ldS(ArrayList<Double> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lcS(ArrayList<Character> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lsS(ArrayList<String> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static void nL(){
out.println();
}
public static void oI(int a) {
out.println(a);
}
public static void onI(int a){
out.print(a);
}
public static void oIv(int[] a) {
oS(aiS(a));
}
public static void oS(String s) {
out.println(s);
}
public static void onS(String s) {
out.print(s);
}
public static void oSv(String[] a) {
oS(asS(a));
}
public static void oL(long l) {
out.println(l);
}
public static void onL(long l) {
out.print(l);
}
public static void oLv(long[] a) {
oS(alS(a));
}
public static void oD(double d){
out.println(d);
}
public static void onD(double d){
out.print(d);
}
public static void oDv(double[] d){
oS(adS(d));
}
public static void oC(char c){
out.println(c);
}
public static void onC(char c){
out.print(c);
}
public static void oCv(char[] c){
oS(acS(c));
}
public static void yes_no(boolean yes){
if(yes){
oS("Yes");
return;
}
oS("No");
}
public static int fact(int num) {
if (num == 0) {
return 1;
} else if (num == 1) {
return 1;
} else if (num < 0) {
throw new IllegalArgumentException("factorial should be bigger than 0");
}
return num * fact(num - 1);
}
public static int[] convI(ArrayList<Integer> list) {
int[] res = new int[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static long[] convL(ArrayList<Long> list) {
long[] res = new long[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static String[] convS(ArrayList<String> list) {
String[] res = new String[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static ArrayList<Integer> convI(int[] vec) {
ArrayList<Integer> list = new ArrayList<>();
for (int i : vec) list.add(i);
return list;
}
public static ArrayList<Long> convL(long[] vec) {
ArrayList<Long> list = new ArrayList<>();
for (long i : vec) list.add(i);
return list;
}
public static ArrayList<String> convS(String[] vec) {
return new ArrayList<>(Arrays.asList(vec));
}
public static ArrayList<ArrayList<Integer>> permutation(int a) {
int[] list = new int[a];
for (int i = 0; i < a; i++) {
list[i] = i;
}
return permutation(list);
}
public static ArrayList<ArrayList<Integer>> permutation(int[] seed) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
int[] perm = new int[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(int[] seed, int[] perm, boolean[] used, int index,ArrayList<ArrayList<Integer>> res) {
if (index == seed.length) {
res.add(convI(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static ArrayList<ArrayList<String>> permutation(String[] seed) {
ArrayList<ArrayList<String>> res = new ArrayList<>();
String[] perm = new String[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(String[] seed, String[] perm, boolean[] used, int index,ArrayList<ArrayList<String>> res) {
if (index == seed.length) {
res.add(convS(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static void swap(int[] a,int i1,int i2){
int t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void swap(char[] a,int i1,int i2){
char t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void SOLVE(){
solve();
out.flush();
}
}
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/abc230_e/Java/39285635 |
condefects-java_data_1434 | import java.io.PrintWriter;
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 {
static void solve () {
int n = nextInt();
int[] a = new int[n];
for (int i=1; i<n; i++) {
a[i] = nextInt() - 1;
}
int[] dp = new int[n];
for (int i=1; i<n; i++) {
//dp[i] 人i+1は人1の何代後か
//人i+1の親は？ 添え字で求めておく
int parent = a[i];
//人i+1の人1との遠ざかり度（仮）は、
//人i+1の親の遠ざかり度+1である（これは理解できる）
int value = parent + 1;
dp[i] = value;
}
println(dp[n-1]);
}
public static String yesno(boolean b) {return b?"Yes":"No";}
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static String next() {return in.next();}
public static char nextChar() {return next().charAt(0);}
public static int nextInt() {return in.nextInt();}
public static Double nextDouble() {return in.nextDouble();}
public static Long nextLong() {return in.nextLong();}
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 String[] nextStringArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static char[] nextCharArray() {
return next().toCharArray();
}
public static char[][] nextCharTable(int h, int w) {
char[][] a = new char[h][w];
for (int i=0; i<h; i++) {
a[i] = next().toCharArray();
}
return a;
}
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("");
}
}
static Scanner in = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
solve();
in.close();
out.close();
}
}
import java.io.PrintWriter;
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 {
static void solve () {
int n = nextInt();
int[] a = new int[n];
for (int i=1; i<n; i++) {
a[i] = nextInt() - 1;
}
int[] dp = new int[n];
for (int i=1; i<n; i++) {
//dp[i] 人i+1は人1の何代後か
//人i+1の親は？ 添え字で求めておく
int parent = a[i];
//人i+1の人1との遠ざかり度（仮）は、
//人i+1の親の遠ざかり度+1である（これは理解できる）
int value = dp[parent] + 1;
dp[i] = value;
}
println(dp[n-1]);
}
public static String yesno(boolean b) {return b?"Yes":"No";}
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static String next() {return in.next();}
public static char nextChar() {return next().charAt(0);}
public static int nextInt() {return in.nextInt();}
public static Double nextDouble() {return in.nextDouble();}
public static Long nextLong() {return in.nextLong();}
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 String[] nextStringArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static char[] nextCharArray() {
return next().toCharArray();
}
public static char[][] nextCharTable(int h, int w) {
char[][] a = new char[h][w];
for (int i=0; i<h; i++) {
a[i] = next().toCharArray();
}
return a;
}
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("");
}
}
static Scanner in = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
solve();
in.close();
out.close();
}
} | ConDefects/ConDefects/Code/abc263_b/Java/38101805 |
condefects-java_data_1435 | import java.util.*;
class Main {
public static void main(String[] args) {
var s = new Scanner(System.in);
int n = s.nextInt();
int m = s.nextInt();
int[][] e = new int[n][n];
for (int i = 0; i < m; i++) {
int a, b, c;
a = s.nextInt() - 1;
b = s.nextInt() - 1;
c = s.nextInt();
e[a][b] = e[b][a] = c;
}
for (int i = 0; i < e.length; i++) dfs(e, i, 0);
System.out.println(ans);
}
static boolean[] used = new boolean[11];
static int ans;
static void dfs(int[][] e, int v, int sum) {
used[v] = true;
ans = ans > sum ? ans : sum;
for (int i = 0; i < e.length; i++)
if (!used[i])
dfs(e, i, sum + e[v][i]);
used[v] = false;
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
var s = new Scanner(System.in);
int n = s.nextInt();
int m = s.nextInt();
int[][] e = new int[n][n];
for (int i = 0; i < m; i++) {
int a, b, c;
a = s.nextInt() - 1;
b = s.nextInt() - 1;
c = s.nextInt();
e[a][b] = e[b][a] = c;
}
for (int i = 0; i < e.length; i++) dfs(e, i, 0);
System.out.println(ans);
}
static boolean[] used = new boolean[11];
static int ans;
static void dfs(int[][] e, int v, int sum) {
used[v] = true;
ans = ans > sum ? ans : sum;
for (int i = 0; i < e.length; i++)
if (!used[i] && e[v][i] != 0)
dfs(e, i, sum + e[v][i]);
used[v] = false;
}
} | ConDefects/ConDefects/Code/abc317_c/Java/48610217 |
condefects-java_data_1436 |
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
route = new int[n][n];
used = new boolean[n];
for(int i = 0; i < m; i++){
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int c = sc.nextInt();
route[a][b] = c;
route[b][a] = c;
}
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < n; j++){
// System.out.print(route[i][j] + " ");
// }
// System.out.println();
// }
for(int i = 3; i < n; i++){
dfs(i, 0, n, 0);
}
System.out.println(result);
}
static int route[][];
static boolean used[];
static long result = -1;
static void dfs (int pos, int depth, int n, long total) {
// System.out.println("pos : " + pos + " depth: " + depth + " total: " + total);
if(depth == n) {
// result = Math.max(result, total);
return;
}
used[pos] = true;
for(int i = 0; i < n; i++) {
if(!used[i] && route[pos][i] > 0) {
result = Math.max(result, total + route[pos][i]);
dfs(i, depth + 1, n, total + route[pos][i]);
}
}
used[pos] = false;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
route = new int[n][n];
used = new boolean[n];
for(int i = 0; i < m; i++){
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
int c = sc.nextInt();
route[a][b] = c;
route[b][a] = c;
}
// for(int i = 0; i < n; i++) {
// for(int j = 0; j < n; j++){
// System.out.print(route[i][j] + " ");
// }
// System.out.println();
// }
for(int i = 0; i < n; i++){
dfs(i, 0, n, 0);
}
System.out.println(result);
}
static int route[][];
static boolean used[];
static long result = -1;
static void dfs (int pos, int depth, int n, long total) {
// System.out.println("pos : " + pos + " depth: " + depth + " total: " + total);
if(depth == n) {
// result = Math.max(result, total);
return;
}
used[pos] = true;
for(int i = 0; i < n; i++) {
if(!used[i] && route[pos][i] > 0) {
result = Math.max(result, total + route[pos][i]);
dfs(i, depth + 1, n, total + route[pos][i]);
}
}
used[pos] = false;
}
}
| ConDefects/ConDefects/Code/abc317_c/Java/45035180 |
condefects-java_data_1437 | 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
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int sx = sc.nextInt();
int sy = sc.nextInt();
int tx = sc.nextInt();
int ty = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
if (a == b && c == d) {
if (sx == tx && sy == ty) {
System.out.println("Yes");
}else if (tx == 2 * a - sx && ty == 2 * c - sy) {
System.out.println("Yes");
System.out.println(a + " " + b);
}else {
System.out.println("No");
}
return;
}
int nowx = sx;
int nowy = sy;
boolean xok = a == b ? (sx == tx || tx == 2 * a - sx) : (sx % 2 == tx % 2);
boolean yok = c == d ? (sy == ty || ty == 2 * a - sy) : (sy % 2 == ty % 2);
if (xok && yok) {
ArrayList<String> ans = new ArrayList<>();
if ((a == b && tx == 2 * a - sx) || c == d && ty == 2 * c - sy) {
ans.add(a + " " + c);
nowx = f(nowx, a);
nowy = f(nowy, c);
}
while (nowx != tx) {
if (nowx < tx) {
ans.add(a + " " + c);
ans.add((a + 1) + " " + c);
nowx = f(nowx, a);
nowx = f(nowx, a + 1);
}else {
ans.add((a + 1) + " " + c);
ans.add(a + " " + c);
nowx = f(nowx, a + 1);
nowx = f(nowx, a);
}
}
while (nowy != ty) {
if (nowy < ty) {
ans.add(a + " " + c);
ans.add(a + " " + (c + 1));
nowy = f(nowy, c);
nowy = f(nowy, c + 1);
}else {
ans.add(a + " " + (c + 1));
ans.add(a + " " + c);
nowy = f(nowy, c + 1);
nowy = f(nowy, c);
}
}
out.println("Yes");
for (String string : ans) {
out.println(string);
}
out.flush();
}else {
System.out.println("No");
}
}
static int f(int from, int mid) {
return 2 * mid - from;
}
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
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int sx = sc.nextInt();
int sy = sc.nextInt();
int tx = sc.nextInt();
int ty = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
if (a == b && c == d) {
if (sx == tx && sy == ty) {
System.out.println("Yes");
}else if (tx == 2 * a - sx && ty == 2 * c - sy) {
System.out.println("Yes");
System.out.println(a + " " + b);
}else {
System.out.println("No");
}
return;
}
int nowx = sx;
int nowy = sy;
boolean xok = a == b ? (sx == tx || tx == 2 * a - sx) : (sx % 2 == tx % 2);
boolean yok = c == d ? (sy == ty || ty == 2 * c - sy) : (sy % 2 == ty % 2);
if (xok && yok) {
ArrayList<String> ans = new ArrayList<>();
if ((a == b && tx == 2 * a - sx) || c == d && ty == 2 * c - sy) {
ans.add(a + " " + c);
nowx = f(nowx, a);
nowy = f(nowy, c);
}
while (nowx != tx) {
if (nowx < tx) {
ans.add(a + " " + c);
ans.add((a + 1) + " " + c);
nowx = f(nowx, a);
nowx = f(nowx, a + 1);
}else {
ans.add((a + 1) + " " + c);
ans.add(a + " " + c);
nowx = f(nowx, a + 1);
nowx = f(nowx, a);
}
}
while (nowy != ty) {
if (nowy < ty) {
ans.add(a + " " + c);
ans.add(a + " " + (c + 1));
nowy = f(nowy, c);
nowy = f(nowy, c + 1);
}else {
ans.add(a + " " + (c + 1));
ans.add(a + " " + c);
nowy = f(nowy, c + 1);
nowy = f(nowy, c);
}
}
out.println("Yes");
for (String string : ans) {
out.println(string);
}
out.flush();
}else {
System.out.println("No");
}
}
static int f(int from, int mid) {
return 2 * mid - from;
}
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/abc289_f/Java/39399172 |
condefects-java_data_1438 | import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
String s = sc.next();
char[] seq = s.toCharArray();
Arrays.sort(seq);
String ss = new String(seq);
out.println();
out.flush();
}
}
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
String s = sc.next();
char[] seq = s.toCharArray();
Arrays.sort(seq);
String ss = new String(seq);
out.println(ss);
out.flush();
}
} | ConDefects/ConDefects/Code/abc242_b/Java/42744914 |
condefects-java_data_1439 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] a = sc.next().toCharArray();
Arrays.sort(a);
System.out.println();
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
char[] a = sc.next().toCharArray();
Arrays.sort(a);
System.out.println(a);
}
}
| ConDefects/ConDefects/Code/abc242_b/Java/39520861 |
condefects-java_data_1440 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
Reader reader = new Reader();
final int N = reader.readInt();
int[] Q = new int[N];
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) {
Q[i] = reader.readInt();
}
int n_max = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
A[i] = reader.readInt();
if (A[i] != 0) {
int n = (int) (Q[i] / A[i]);
if (n_max > n) {
n_max = n;
}
}
}
for (int i = 0; i < N; i++) {
B[i] = reader.readInt();
}
reader.close();
int total_max = 0;
for (int n = 0; n < n_max; n++) {
int m_max = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if (B[i] != 0) {
int m = (Q[i] - A[i] * n) / B[i];
if (m < m_max) {
m_max = m;
}
}
}
if (total_max < n + m_max) {
total_max = n + m_max;
}
}
System.out.println(total_max);
}
}
class Reader extends BufferedReader {
final int OFFSET_DIGIT = 48;
public Reader() {
super(new InputStreamReader(System.in));
}
public char readChar() throws IOException {
return (char) read();
}
public char readFirstNonSpaceChar() throws IOException {
char ch = readChar();
while (Character.isWhitespace(ch)) {
ch = readChar();
}
return ch;
}
public String readString() throws IOException {
StringBuffer buf = new StringBuffer();
char ch = readFirstNonSpaceChar();
while (!Character.isWhitespace(ch)) {
buf.append(ch);
ch = readChar();
}
return new String(buf);
}
public int readPositiveInt() throws IOException {
int n = 0;
char ch = readFirstNonSpaceChar();
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
return n;
}
public int readInt() throws IOException {
int n = 0;
char ch = readFirstNonSpaceChar();
boolean isNeg = false;
if (ch == '-') {
isNeg = true;
ch = readChar();
}
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
if (isNeg) {
n = -n;
}
return n;
}
public long readPositiveLong() throws IOException {
long n = 0;
char ch = readFirstNonSpaceChar();
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
return n;
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
Reader reader = new Reader();
final int N = reader.readInt();
int[] Q = new int[N];
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) {
Q[i] = reader.readInt();
}
int n_max = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
A[i] = reader.readInt();
if (A[i] != 0) {
int n = (int) (Q[i] / A[i]);
if (n_max > n) {
n_max = n;
}
}
}
for (int i = 0; i < N; i++) {
B[i] = reader.readInt();
}
reader.close();
int total_max = 0;
for (int n = 0; n <= n_max; n++) {
int m_max = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if (B[i] != 0) {
int m = (Q[i] - A[i] * n) / B[i];
if (m < m_max) {
m_max = m;
}
}
}
if (total_max < n + m_max) {
total_max = n + m_max;
}
}
System.out.println(total_max);
}
}
class Reader extends BufferedReader {
final int OFFSET_DIGIT = 48;
public Reader() {
super(new InputStreamReader(System.in));
}
public char readChar() throws IOException {
return (char) read();
}
public char readFirstNonSpaceChar() throws IOException {
char ch = readChar();
while (Character.isWhitespace(ch)) {
ch = readChar();
}
return ch;
}
public String readString() throws IOException {
StringBuffer buf = new StringBuffer();
char ch = readFirstNonSpaceChar();
while (!Character.isWhitespace(ch)) {
buf.append(ch);
ch = readChar();
}
return new String(buf);
}
public int readPositiveInt() throws IOException {
int n = 0;
char ch = readFirstNonSpaceChar();
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
return n;
}
public int readInt() throws IOException {
int n = 0;
char ch = readFirstNonSpaceChar();
boolean isNeg = false;
if (ch == '-') {
isNeg = true;
ch = readChar();
}
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
if (isNeg) {
n = -n;
}
return n;
}
public long readPositiveLong() throws IOException {
long n = 0;
char ch = readFirstNonSpaceChar();
while (Character.isDigit(ch)) {
n = 10 * n + (int) (ch - OFFSET_DIGIT);
ch = readChar();
}
return n;
}
} | ConDefects/ConDefects/Code/abc338_c/Java/51440457 |
condefects-java_data_1441 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Integer> q = new ArrayList<>();
List<Integer> a = new ArrayList<>();
List<Integer> b = new ArrayList<>();
for (int i = 0; i < n; i++) {
q.add(Integer.parseInt(sc.next()));
}
for (int i = 0; i < n; i++) {
a.add(Integer.parseInt(sc.next()));
}
for (int i = 0; i < n; i++) {
b.add(Integer.parseInt(sc.next()));
}
int answer = 0;
int x = 0;
while (true) {
x++;
List<Integer> r = new ArrayList<>();
for (int i = 0; i < n; i++) {
r.add(q.get(i) - a.get(i) * x);
}
boolean ok = true;
for (int i = 0; i < n; i++) {
if (r.get(i) < 0) {
ok = false;
}
}
if (!ok) {
break;
}
int y = 1000000000;
for (int i = 0; i < n; i++) {
if (b.get(i) == 0) {
continue;
}
y = Math.min(y, r.get(i) / b.get(i));
}
answer = Math.max(answer, x + y);
}
System.out.println(answer);
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Integer> q = new ArrayList<>();
List<Integer> a = new ArrayList<>();
List<Integer> b = new ArrayList<>();
for (int i = 0; i < n; i++) {
q.add(Integer.parseInt(sc.next()));
}
for (int i = 0; i < n; i++) {
a.add(Integer.parseInt(sc.next()));
}
for (int i = 0; i < n; i++) {
b.add(Integer.parseInt(sc.next()));
}
int answer = 0;
int x = -1;
while (true) {
x++;
List<Integer> r = new ArrayList<>();
for (int i = 0; i < n; i++) {
r.add(q.get(i) - a.get(i) * x);
}
boolean ok = true;
for (int i = 0; i < n; i++) {
if (r.get(i) < 0) {
ok = false;
}
}
if (!ok) {
break;
}
int y = 1000000000;
for (int i = 0; i < n; i++) {
if (b.get(i) == 0) {
continue;
}
y = Math.min(y, r.get(i) / b.get(i));
}
answer = Math.max(answer, x + y);
}
System.out.println(answer);
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/54317929 |
condefects-java_data_1442 | import java.util.*;
public class Main {
public static void main(String [] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
ArrayList<Integer> Q = new ArrayList<>();
ArrayList<Integer> A = new ArrayList<>();
ArrayList<Integer> B = new ArrayList<>();
for(int i=0;i<N;i++) Q.add(sc.nextInt());
for(int i=0;i<N;i++) A.add(sc.nextInt());
for(int i=0;i<N;i++) B.add(sc.nextInt());
//料理Aのmax数算出
int A_MAX_NUM = Integer.MAX_VALUE;
for(int i=0;i<N;i++){
if(A.get(i)==0) continue;
A_MAX_NUM = Integer.min(A_MAX_NUM,Q.get(i)/A.get(i));
}
if(A_MAX_NUM==Integer.MAX_VALUE) A_MAX_NUM = 0;
int MAX_NUM = 0;
for(int i=1;i<=A_MAX_NUM;i++){
int B_MAX_NUM = Integer.MAX_VALUE;
for(int j=0;j<N;j++){
if(B.get(j)==0) continue;
B_MAX_NUM = Integer.min(B_MAX_NUM,(Q.get(j)-A.get(j)*i)/B.get(j));
}
if(B_MAX_NUM==Integer.MAX_VALUE) B_MAX_NUM = 0;
MAX_NUM = Integer.max(MAX_NUM,(i+B_MAX_NUM));
}
System.out.println(MAX_NUM);
}
}
import java.util.*;
public class Main {
public static void main(String [] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
ArrayList<Integer> Q = new ArrayList<>();
ArrayList<Integer> A = new ArrayList<>();
ArrayList<Integer> B = new ArrayList<>();
for(int i=0;i<N;i++) Q.add(sc.nextInt());
for(int i=0;i<N;i++) A.add(sc.nextInt());
for(int i=0;i<N;i++) B.add(sc.nextInt());
//料理Aのmax数算出
int A_MAX_NUM = Integer.MAX_VALUE;
for(int i=0;i<N;i++){
if(A.get(i)==0) continue;
A_MAX_NUM = Integer.min(A_MAX_NUM,Q.get(i)/A.get(i));
}
if(A_MAX_NUM==Integer.MAX_VALUE) A_MAX_NUM = 0;
int MAX_NUM = 0;
for(int i=0;i<=A_MAX_NUM;i++){
int B_MAX_NUM = Integer.MAX_VALUE;
for(int j=0;j<N;j++){
if(B.get(j)==0) continue;
B_MAX_NUM = Integer.min(B_MAX_NUM,(Q.get(j)-A.get(j)*i)/B.get(j));
}
if(B_MAX_NUM==Integer.MAX_VALUE) B_MAX_NUM = 0;
MAX_NUM = Integer.max(MAX_NUM,(i+B_MAX_NUM));
}
System.out.println(MAX_NUM);
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/50525216 |
condefects-java_data_1443 |
import java.util.Scanner;
public class Main {
static int number;
static int[] stock, food1, food2;
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
number = sc.nextInt();
stock = new int[number];
food1 = new int[number];
food2 = new int[number];
for (int i = 0; i < number; i++) {
stock[i] = sc.nextInt();
}
for (int i = 0; i < number; i++) {
food1[i] = sc.nextInt();
}
for (int i = 0; i < number; i++) {
food2[i] = sc.nextInt();
}
int max = 0;
while (checkStock(max, 0)) {
max++;
}
max--;
int maxA = max;
int maxB = 0;
for (int i = 0; i < max; i++) {
while (checkStock(maxA, maxB)) {
if (max < maxA + maxB)
max = maxA + maxB;
maxB++;
}
maxA--;
}
System.out.println(max);
}
}
static boolean checkStock(int a, int b) {
for (int i = 0; i < number; i++) {
if (a * food1[i] + b * food2[i] > stock[i])
return false;
}
return true;
}
}
import java.util.Scanner;
public class Main {
static int number;
static int[] stock, food1, food2;
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
number = sc.nextInt();
stock = new int[number];
food1 = new int[number];
food2 = new int[number];
for (int i = 0; i < number; i++) {
stock[i] = sc.nextInt();
}
for (int i = 0; i < number; i++) {
food1[i] = sc.nextInt();
}
for (int i = 0; i < number; i++) {
food2[i] = sc.nextInt();
}
int max = 0;
while (checkStock(max, 0)) {
max++;
}
max--;
int maxA = max;
int maxB = 0;
while (maxA > -1) {
while (checkStock(maxA, maxB)) {
if (max < maxA + maxB)
max = maxA + maxB;
maxB++;
}
maxA--;
}
System.out.println(max);
}
}
static boolean checkStock(int a, int b) {
for (int i = 0; i < number; i++) {
if (a * food1[i] + b * food2[i] > stock[i])
return false;
}
return true;
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/51503806 |
condefects-java_data_1444 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int MAXMAKE = 1000000;
int N = Integer.parseInt(sc.next());
int[] Qi = new int[N];
int[] Ai = new int[N];
int[] Bi = new int[N];
int ans = Integer.MIN_VALUE;
int canY = Integer.MAX_VALUE;
ArrayList<Integer> canMakeX = new ArrayList<>();
boolean canMake;
for (int i = 0; i < N; i++) {
Qi[i]=Integer.parseInt(sc.next());
}
for (int i = 0; i < N; i++) {
Ai[i]=Integer.parseInt(sc.next());
}
for (int i = 0; i < N; i++) {
Bi[i]=Integer.parseInt(sc.next());
}
for (int x = 0; x < MAXMAKE; x++) {
canMake = true;
for (int i = 0; i < N; i++) {
if(Qi[i]-Ai[i]*x<0){
canMake = false;
break;
}
}
if(canMake==true) canMakeX.add(x);
else break;
}
for (int x:canMakeX) {
canY = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if (Bi[i]==0) continue;
canY = Math.min(canY,(Qi[i] - Ai[i]*x)/Bi[i]);
}
ans = Math.max(ans, x+canY);
}
System.out.println(ans);
}
}
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final int MAXMAKE = 1000000;
int N = Integer.parseInt(sc.next());
int[] Qi = new int[N];
int[] Ai = new int[N];
int[] Bi = new int[N];
int ans = Integer.MIN_VALUE;
int canY = Integer.MAX_VALUE;
ArrayList<Integer> canMakeX = new ArrayList<>();
boolean canMake;
for (int i = 0; i < N; i++) {
Qi[i]=Integer.parseInt(sc.next());
}
for (int i = 0; i < N; i++) {
Ai[i]=Integer.parseInt(sc.next());
}
for (int i = 0; i < N; i++) {
Bi[i]=Integer.parseInt(sc.next());
}
for (int x = 0; x <= MAXMAKE; x++) {
canMake = true;
for (int i = 0; i < N; i++) {
if(Qi[i]-Ai[i]*x<0){
canMake = false;
break;
}
}
if(canMake==true) canMakeX.add(x);
else break;
}
for (int x:canMakeX) {
canY = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if (Bi[i]==0) continue;
canY = Math.min(canY,(Qi[i] - Ai[i]*x)/Bi[i]);
}
ans = Math.max(ans, x+canY);
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/54698761 |
condefects-java_data_1445 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] Q = new int[N];
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) {
Q[i]=sc.nextInt();
}
for (int i = 0; i < N; i++) {
A[i]=sc.nextInt();
}
for (int i = 0; i < N; i++) {
B[i]=sc.nextInt();
}
int x_min = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if(A[i]!=0) x_min=Math.min(x_min,Q[i]/A[i]);
}
int ans=0;
for (int i = x_min; i >=0; i--) {
int y_min=Integer.MAX_VALUE;
for (int j = 0; j < N; j++) {
if(B[j]!=0) y_min=Math.min(y_min,(Q[j]-A[j]*i)/B[j]);
}
ans=Math.max(ans,y_min+x_min);
}
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[] Q = new int[N];
int[] A = new int[N];
int[] B = new int[N];
for (int i = 0; i < N; i++) {
Q[i]=sc.nextInt();
}
for (int i = 0; i < N; i++) {
A[i]=sc.nextInt();
}
for (int i = 0; i < N; i++) {
B[i]=sc.nextInt();
}
int x_min = Integer.MAX_VALUE;
for (int i = 0; i < N; i++) {
if(A[i]!=0) x_min=Math.min(x_min,Q[i]/A[i]);
}
int ans=0;
for (int i = x_min; i >=0; i--) {
int y_min=Integer.MAX_VALUE;
for (int j = 0; j < N; j++) {
if(B[j]!=0) y_min=Math.min(y_min,(Q[j]-A[j]*i)/B[j]);
}
ans=Math.max(ans,y_min+i);
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/51442152 |
condefects-java_data_1446 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] q = new int[n + 1];
int[] a = new int[n + 1];
int[] b = new int[n + 1];
int maxa = Integer.MAX_VALUE;
int maxb = Integer.MAX_VALUE;
int res = 0;
for (int i = 1; i <= n; i++) {
q[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
a[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
b[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
if(a[i] == 0)
continue;
maxa = Math.min(maxa,q[i] / a[i]);
}
for (int i = 1; i <= maxa; i++) {
for (int j = 1; j <= n; j++) {
if (b[j] == 0)
continue;
maxb = Math.min(maxb,(q[j] - a[j] * i)/b[j]);
}
res = Math.max(res, i + maxb);
}
System.out.println(res);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] q = new int[n + 1];
int[] a = new int[n + 1];
int[] b = new int[n + 1];
int maxa = Integer.MAX_VALUE;
int maxb = Integer.MAX_VALUE;
int res = 0;
for (int i = 1; i <= n; i++) {
q[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
a[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
b[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
if(a[i] == 0)
continue;
maxa = Math.min(maxa,q[i] / a[i]);
}
for (int i = 0; i <= maxa; i++) {
for (int j = 1; j <= n; j++) {
if (b[j] == 0)
continue;
maxb = Math.min(maxb,(q[j] - a[j] * i)/b[j]);
}
res = Math.max(res, i + maxb);
}
System.out.println(res);
}
}
| ConDefects/ConDefects/Code/abc338_c/Java/51015686 |
condefects-java_data_1447 | import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
int[] Qn = new int[N];
int[] An = new int[N];
int[] Bn = new int[N];
int loopCnt = 1000000;
for(int i = 0; i < N; i++){
Qn[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
An[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
Bn[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
if(An[i] == 0) continue;
loopCnt = Qn[i]/An[i] < loopCnt ? Qn[i]/An[i] : loopCnt;
}
int max = 0;
for(int i = 0; i < loopCnt; i++){
int b_min = 1000000;
for(int j = 0; j < N; j++){
if(Bn[j] == 0) continue;
b_min = (Qn[j] - i * An[j])/Bn[j] < b_min ? (Qn[j] - i * An[j])/Bn[j] : b_min;
}
max = (i + b_min) > max ? (i + b_min) : max;
}
System.out.println(max);
}
}
import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
final int N = sc.nextInt();
int[] Qn = new int[N];
int[] An = new int[N];
int[] Bn = new int[N];
int loopCnt = 1000000;
for(int i = 0; i < N; i++){
Qn[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
An[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
Bn[i] = sc.nextInt();
}
for(int i = 0; i < N; i++){
if(An[i] == 0) continue;
loopCnt = Qn[i]/An[i] < loopCnt ? Qn[i]/An[i] : loopCnt;
}
int max = 0;
for(int i = 0; i <= loopCnt; i++){
int b_min = 1000000;
for(int j = 0; j < N; j++){
if(Bn[j] == 0) continue;
b_min = (Qn[j] - i * An[j])/Bn[j] < b_min ? (Qn[j] - i * An[j])/Bn[j] : b_min;
}
max = (i + b_min) > max ? (i + b_min) : max;
}
System.out.println(max);
}
} | ConDefects/ConDefects/Code/abc338_c/Java/54769603 |
condefects-java_data_1448 | import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int cnt = 0;
for(int i = 0; i < n; i++) {
String str = s.next();
if(str.equals("For"))
cnt++;
}
System.out.println(cnt);
if (cnt > (n >> 1))
System.out.println("Yes");
else
System.out.println("No");
}
}
import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int cnt = 0;
for(int i = 0; i < n; i++) {
String str = s.next();
if(str.equals("For"))
cnt++;
}
// System.out.println(cnt);
if (cnt > (n >> 1))
System.out.println("Yes");
else
System.out.println("No");
}
} | ConDefects/ConDefects/Code/abc287_a/Java/43267300 |
condefects-java_data_1449 | import java.util.*;
import java.lang.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = (n + 1) / 2;
for (int i = 0; i < n; i++) if(sc.next() == "For") count--;
if (count > 0) System.out.println("Yes");
else System.out.println("No");
}
}
import java.util.*;
import java.lang.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int count = (n + 1) / 2;
for (int i = 0; i < n; i++) if(sc.next().equals("Against")) count--;
if (count > 0) System.out.println("Yes");
else System.out.println("No");
}
}
| ConDefects/ConDefects/Code/abc287_a/Java/39996733 |
condefects-java_data_1450 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;
public class Main{
void solve(){
int s = scanner.nextInt(), t = scanner.nextInt(), m = scanner.nextInt();
List<Integer>[] g = new List[s+1];
for(int i = 1; i <= s; i++){
g[i]=new ArrayList<>();
}
for(int i = 1; i <= m; i++){
int u = scanner.nextInt(), v = scanner.nextInt();
g[u].add(v);
}
int[][] seen = new int[t+1][t+1];
for(int i = 1; i <= s; i++){
List<Integer> list = g[i];
for(int a = 0; a < list.size(); a++){
for(int b = a+1; b < list.size(); b++){
int x = list.get(a), y = list.get(b);
if(seen[x-s][y-s] == 0){
seen[x-s][y-s] = seen[x-s][y-s]=i;
}
else{
out.println(x + " " + y + " " + i + " " + seen[x-s][y-s]);
return;
}
}
}
}
out.println(-1);
}
private static final boolean memory = false;
private static final boolean singleTest = true;
// ----- runner templates ----- //
void run() {
int numOfTests = singleTest? 1: scanner.nextInt();
for(int testIdx = 1; testIdx <= numOfTests; testIdx++){
solve();
}
out.flush();
out.close();
}
// ----- runner templates ----- //
public static void main(String[] args) {
if(memory) {
new Thread(null, () -> new Main().run(), "go", 1 << 26).start();
}
else{
new Main().run();
}
}
//------ input and output ------//
public static FastScanner scanner = new FastScanner(System.in);
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static class FastScanner {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar, numChars;
public FastScanner(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) return -1;
}
return buf[curChar++];
}
public int nextInt() {
return (int) nextLong();
}
public long nextLong() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
boolean negative = false;
if (c == '-') {
negative = true;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = read();
} while (!isWhitespace(c));
return negative ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
return (char) c;
}
public String next() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isWhitespace(c));
return res.toString();
}
private boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
int[] nextIntArray(int n, int base){
int[] arr = new int[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextInt();}
return arr;
}
long[] nextLongArray(int n, int base){
long[] arr = new long[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextLong();}
return arr;
}
int[][] nextIntGrid(int n, int m, int base){
int[][] grid = new int[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextInt();}}
return grid;
}
long[][] nextLongGrid(int n, int m, int base){
long[][] grid = new long[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextLong();}}
return grid;
}
char[][] nextCharGrid(int n, int m, int base){
char[][] grid = new char[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextChar();}}
return grid;
}
//------ debug and print functions ------//
void debug(Object...os){out.println(deepToString(os));}
void print(int[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(long[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(char[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(Object... o){for(int i = 0; i < o.length; i++){out.print(o[i]);out.print(i==o.length-1?'\n':' ');}}
<T> void printArrayList(List<T> arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr.get(i));out.print(i==end? '\n':' ');}}
//------ sort primitive type arrays ------//
static void sort(int[] arr){
List<Integer> temp = new ArrayList<>();
for(int val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(long[] arr){
List<Long> temp = new ArrayList<>();
for(long val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(char[] arr) {
List<Character> temp = new ArrayList<>();
for (char val : arr) {temp.add(val);}
Collections.sort(temp);
for (int i = 0; i < arr.length; i++) {arr[i] = temp.get(i);}
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.util.*;
public class Main{
void solve(){
int s = scanner.nextInt(), t = scanner.nextInt(), m = scanner.nextInt();
List<Integer>[] g = new List[s+1];
for(int i = 1; i <= s; i++){
g[i]=new ArrayList<>();
}
for(int i = 1; i <= m; i++){
int u = scanner.nextInt(), v = scanner.nextInt();
g[u].add(v);
}
int[][] seen = new int[t+1][t+1];
for(int i = 1; i <= s; i++){
List<Integer> list = g[i];
for(int a = 0; a < list.size(); a++){
for(int b = a+1; b < list.size(); b++){
int x = list.get(a), y = list.get(b);
if(seen[x-s][y-s] == 0){
seen[x-s][y-s] = seen[y-s][x-s]=i;
}
else{
out.println(x + " " + y + " " + i + " " + seen[x-s][y-s]);
return;
}
}
}
}
out.println(-1);
}
private static final boolean memory = false;
private static final boolean singleTest = true;
// ----- runner templates ----- //
void run() {
int numOfTests = singleTest? 1: scanner.nextInt();
for(int testIdx = 1; testIdx <= numOfTests; testIdx++){
solve();
}
out.flush();
out.close();
}
// ----- runner templates ----- //
public static void main(String[] args) {
if(memory) {
new Thread(null, () -> new Main().run(), "go", 1 << 26).start();
}
else{
new Main().run();
}
}
//------ input and output ------//
public static FastScanner scanner = new FastScanner(System.in);
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static class FastScanner {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar, numChars;
public FastScanner(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) throw new InputMismatchException();
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) return -1;
}
return buf[curChar++];
}
public int nextInt() {
return (int) nextLong();
}
public long nextLong() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
boolean negative = false;
if (c == '-') {
negative = true;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = read();
} while (!isWhitespace(c));
return negative ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public char nextChar() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
return (char) c;
}
public String next() {
int c = read();
while (isWhitespace(c)) {
c = read();
}
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isWhitespace(c));
return res.toString();
}
private boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
}
int[] nextIntArray(int n, int base){
int[] arr = new int[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextInt();}
return arr;
}
long[] nextLongArray(int n, int base){
long[] arr = new long[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextLong();}
return arr;
}
int[][] nextIntGrid(int n, int m, int base){
int[][] grid = new int[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextInt();}}
return grid;
}
long[][] nextLongGrid(int n, int m, int base){
long[][] grid = new long[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextLong();}}
return grid;
}
char[][] nextCharGrid(int n, int m, int base){
char[][] grid = new char[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextChar();}}
return grid;
}
//------ debug and print functions ------//
void debug(Object...os){out.println(deepToString(os));}
void print(int[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(long[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(char[] arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr[i]);out.print(i==end? '\n':' ');}}
void print(Object... o){for(int i = 0; i < o.length; i++){out.print(o[i]);out.print(i==o.length-1?'\n':' ');}}
<T> void printArrayList(List<T> arr, int start, int end){for(int i = start; i <= end; i++){out.print(arr.get(i));out.print(i==end? '\n':' ');}}
//------ sort primitive type arrays ------//
static void sort(int[] arr){
List<Integer> temp = new ArrayList<>();
for(int val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(long[] arr){
List<Long> temp = new ArrayList<>();
for(long val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(char[] arr) {
List<Character> temp = new ArrayList<>();
for (char val : arr) {temp.add(val);}
Collections.sort(temp);
for (int i = 0; i < arr.length; i++) {arr[i] = temp.get(i);}
}
} | ConDefects/ConDefects/Code/abc260_f/Java/40111396 |
condefects-java_data_1451 | 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[] t = new int[n];
int[] x = new int[n];
for (int i = 0; i < n; i++) {
t[i] = Integer.parseInt(sc.next());
x[i] = Integer.parseInt(sc.next());
}
int[] task = new int[n + 300000];
boolean[] hirou = new boolean[n];
for (int i = n - 1; 0 <= i; i--) {
if (t[i] == 2) {
task[x[i]]++;
} else {
if (1 <= task[x[i]]) {
task[x[i]]--;
hirou[i] = true;
}
}
}
// 敗北したケース
for (int i = 0; i < n; i++) {
if (task[i] != 0) {
System.out.println(-1);
return;
}
}
// 勝利したケース
int have = 0;
int haveMax = 0;
for (int i = 0; i < n; i++) {
if (t[i] == 1) {
have += (hirou[i] ? 1 : 0);
haveMax = Math.max(haveMax, have);
} else {
have--;
}
}
System.out.println(haveMax);
StringBuilder answer = new StringBuilder();
for (int i = 0; i < n; i++) {
if (t[i] == 1) {
answer.append((hirou[i] ? 1 : 0));
answer.append(" ");
}
}
System.out.println(answer);
}
}
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[] t = new int[n];
int[] x = new int[n];
for (int i = 0; i < n; i++) {
t[i] = Integer.parseInt(sc.next());
x[i] = Integer.parseInt(sc.next());
}
int[] task = new int[n + 300000];
boolean[] hirou = new boolean[n];
for (int i = n - 1; 0 <= i; i--) {
if (t[i] == 2) {
task[x[i]]++;
} else {
if (1 <= task[x[i]]) {
task[x[i]]--;
hirou[i] = true;
}
}
}
// 敗北したケース
for (int i = 0; i <= n; i++) {
if (task[i] != 0) {
System.out.println(-1);
return;
}
}
// 勝利したケース
int have = 0;
int haveMax = 0;
for (int i = 0; i < n; i++) {
if (t[i] == 1) {
have += (hirou[i] ? 1 : 0);
haveMax = Math.max(haveMax, have);
} else {
have--;
}
}
System.out.println(haveMax);
StringBuilder answer = new StringBuilder();
for (int i = 0; i < n; i++) {
if (t[i] == 1) {
answer.append((hirou[i] ? 1 : 0));
answer.append(" ");
}
}
System.out.println(answer);
}
} | ConDefects/ConDefects/Code/abc333_e/Java/48595528 |
condefects-java_data_1452 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int t = 1;
while(t-->0)
{
int n = scn.nextInt();
int[][] arr = new int[n][2];
int[] co = new int[n+1];
for(int i=0;i<n;i++)
{
arr[i][0] = scn.nextInt();
arr[i][1] = scn.nextInt();
}
boolean[] fl = new boolean[n];
for(int i=n-1;i>=0;i--)
{
if(arr[i][0]==2)
{
co[arr[i][1]]++;
}
else
{
if(co[arr[i][1]] > 0)
{
fl[i] = true;
co[arr[i][1]]--;
}
else
fl[i] = false;
}
}
// for(boolean ff : fl)
// System.out.print(ff+" ");
// System.out.println();
boolean f = true;
for(int val : co)
{
if(val > 0)
{
f = false;
break;
}
}
if(f == false)
{
System.out.println("-1");
continue;
}
int ans = 0,max = 0;
for(int i=0;i<n;i++)
{
if(arr[i][0] == 2)
max = 0;
else
{
if(arr[i][0] == 1 && fl[i]==true)
max++;
}
ans = Math.max(ans,max);
}
System.out.println(ans);
for(int i=0;i<n;i++)
{
if(arr[i][0] == 2)
continue;
if(fl[i]==false)
System.out.print("0 ");
else
System.out.print("1 ");
}
System.out.println();
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int t = 1;
while(t-->0)
{
int n = scn.nextInt();
int[][] arr = new int[n][2];
int[] co = new int[n+1];
for(int i=0;i<n;i++)
{
arr[i][0] = scn.nextInt();
arr[i][1] = scn.nextInt();
}
boolean[] fl = new boolean[n];
for(int i=n-1;i>=0;i--)
{
if(arr[i][0]==2)
{
co[arr[i][1]]++;
}
else
{
if(co[arr[i][1]] > 0)
{
fl[i] = true;
co[arr[i][1]]--;
}
else
fl[i] = false;
}
}
// for(boolean ff : fl)
// System.out.print(ff+" ");
// System.out.println();
boolean f = true;
for(int val : co)
{
if(val > 0)
{
f = false;
break;
}
}
if(f == false)
{
System.out.println("-1");
continue;
}
int ans = 0,max = 0;
for(int i=0;i<n;i++)
{
if(arr[i][0] == 2)
max--;
else
{
if(arr[i][0] == 1 && fl[i]==true)
max++;
}
ans = Math.max(ans,max);
}
System.out.println(ans);
for(int i=0;i<n;i++)
{
if(arr[i][0] == 2)
continue;
if(fl[i]==false)
System.out.print("0 ");
else
System.out.print("1 ");
}
System.out.println();
}
}
} | ConDefects/ConDefects/Code/abc333_e/Java/48882400 |
condefects-java_data_1453 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
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 StringTokenizer st = new StringTokenizer(br.readLine());
final int n = Integer.parseInt(st.nextToken());
final int k = Integer.parseInt(st.nextToken());
final String s = br.readLine();
br.close();
int cnt_x = 0;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == 'X') {
cnt_x++;
}
}
int ans = 0;
if (cnt_x == n) {
//ALLXの場合、できるだけYYを繋げれば良い
ans = k > 1 ? k - 1 : 0;
} else if (cnt_x == 0) {
//ALLYの場合、片側からXに置き換え
ans = n - 1 - k;
} else if (cnt_x == k) {
//Xを全部Yにできる場合は、全部Yにすればよい
ans = n - 1;
} else {
int remain = k;
char as_y = 'Y';
if (k > cnt_x) {
remain = n - k;
as_y = 'X';
}
boolean flg_y = s.charAt(0) == as_y;
PriorityQueue<Integer> queue = new PriorityQueue<>();
int cnt_xx = 0;
for (int i = 1; i < n; i++) {
if (s.charAt(i) == as_y) {
flg_y = true;
//Yの場合、前の文字がYならYYを一個増やす。
//前の文字がXならこれまでのX個数をキューに
if (s.charAt(i - 1) == as_y) {
ans++;
} else {
if (cnt_xx > 0) {
queue.add(cnt_xx);
cnt_xx = 0;
}
}
} else {
//Xの場合、以前にYが一つでもあればX連続個数を増やす
if (flg_y) {
cnt_xx++;
}
}
}
while (!queue.isEmpty() && remain > 0) {
int cnt = queue.poll();
if (remain >= cnt) {
remain -= cnt;
ans += cnt + 1;
}
}
//最後に両サイドのXをできるだけYにする
ans += remain;
}
System.out.println(ans);
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.PriorityQueue;
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 StringTokenizer st = new StringTokenizer(br.readLine());
final int n = Integer.parseInt(st.nextToken());
final int k = Integer.parseInt(st.nextToken());
final String s = br.readLine();
br.close();
int cnt_x = 0;
for (int i = 0; i < n; i++) {
if (s.charAt(i) == 'X') {
cnt_x++;
}
}
int ans = 0;
if (cnt_x == n) {
//ALLXの場合、できるだけYYを繋げれば良い
ans = k > 1 ? k - 1 : 0;
} else if (cnt_x == 0) {
//ALLYの場合、片側からXに置き換え
ans = Math.max(n - 1 - k, 0);
} else if (cnt_x == k) {
//Xを全部Yにできる場合は、全部Yにすればよい
ans = n - 1;
} else {
int remain = k;
char as_y = 'Y';
if (k > cnt_x) {
remain = n - k;
as_y = 'X';
}
boolean flg_y = s.charAt(0) == as_y;
PriorityQueue<Integer> queue = new PriorityQueue<>();
int cnt_xx = 0;
for (int i = 1; i < n; i++) {
if (s.charAt(i) == as_y) {
flg_y = true;
//Yの場合、前の文字がYならYYを一個増やす。
//前の文字がXならこれまでのX個数をキューに
if (s.charAt(i - 1) == as_y) {
ans++;
} else {
if (cnt_xx > 0) {
queue.add(cnt_xx);
cnt_xx = 0;
}
}
} else {
//Xの場合、以前にYが一つでもあればX連続個数を増やす
if (flg_y) {
cnt_xx++;
}
}
}
while (!queue.isEmpty() && remain > 0) {
int cnt = queue.poll();
if (remain >= cnt) {
remain -= cnt;
ans += cnt + 1;
}
}
//最後に両サイドのXをできるだけYにする
ans += remain;
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/arc157_b/Java/39495868 |
condefects-java_data_1454 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
static int N, K;
static String S;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
K = sc.nextInt();
S = sc.next();
System.out.println(solve());
}
static boolean isAll(String S, char c) {
for (int i = 0; i < S.length(); i++) {
if( S.charAt(i) != c ) return false;
}
return true;
}
static int solve() {
if( isAll(S, 'X') ) {
return N-1;
}
if( isAll(S, 'Y') ) {
if( N == K ) {
return 0;
} else {
return N-1-K;
}
}
// 頑張ってシミュレーション
// 端の処理、X->Yした後のX->Yの処理が面倒臭い
// 何か頭のいい方法がありそうだが...
var xq = new PriorityQueue<XClustor>();
var yq = new PriorityQueue<YClustor>();
boolean prevIsX = S.charAt(0) == 'X';
boolean prevIsEdge = true;
int cnt = 1;
for (int i = 1; i < N; i++) {
if( prevIsX == (S.charAt(i) == 'X') ) {
cnt++;
} else {
if( prevIsX ) {
xq.add( new XClustor(cnt, prevIsEdge) );
} else {
yq.add( new YClustor(cnt, prevIsEdge));
}
prevIsX = (S.charAt(i) == 'X');
cnt = 1;
prevIsEdge = false;
}
}
boolean edge = true;
if( prevIsX ) {
xq.add( new XClustor(cnt, edge) );
} else {
yq.add( new YClustor(cnt, edge));
}
int point = 0;
for (int i = 0; i < N-1; i++) {
if( S.charAt(i) == 'Y' && S.charAt(i+1) == 'Y' ) {
point++;
}
}
int r = K;
while( r > 0 && !xq.isEmpty() ) {
// YXY 2
// YXXY 2 1
// YXX 1 1
var x = xq.poll();
if( x.size == 1 ) {
point += (x.edge ? 1 : 2);
} else {
point += 1;
x.size--;
xq.add(x);
}
r--;
}
while( r > 0 && !yq.isEmpty() ) {
// yYY 1 1
// yYYYy 2 1 1
// yYYy 2 1
// yYy 2
var y = yq.poll();
point -= y.edge ? 1 : 2;
r--;
y.size--;
while(r > 0 && y.size > 0) {
point -= 1;
r--;
y.size--;
}
}
return point;
}
static class XClustor implements Comparable<XClustor> {
int size;
final boolean edge;
public XClustor(int size, boolean edge) {
this.size = size;
this.edge = edge;
}
@Override
public int compareTo(XClustor arg) {
// 端は後から得になることもないので後回し
if( edge && !arg.edge ) {
return 1;
} else if( !edge && arg.edge ) {
return -1;
} else {
return Integer.compare(size, arg.size);
}
}
}
static class YClustor implements Comparable<YClustor> {
int size;
final boolean edge;
public YClustor(int size, boolean edge) {
this.size = size;
this.edge = edge;
}
@Override
public int compareTo(YClustor arg) {
// 端から消費したほうが得
if( edge && !arg.edge ) {
return -1;
} else if( !edge && arg.edge ) {
return 1;
} else {
// 大きいものから消費する
return Integer.compare(arg.size, size);
}
}
}
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.util.*;
public class Main {
static int N, K;
static String S;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
K = sc.nextInt();
S = sc.next();
System.out.println(solve());
}
static boolean isAll(String S, char c) {
for (int i = 0; i < S.length(); i++) {
if( S.charAt(i) != c ) return false;
}
return true;
}
static int solve() {
if( isAll(S, 'X') ) {
return Math.max(K-1, 0);
}
if( isAll(S, 'Y') ) {
if( N == K ) {
return 0;
} else {
return N-1-K;
}
}
// 頑張ってシミュレーション
// 端の処理、X->Yした後のX->Yの処理が面倒臭い
// 何か頭のいい方法がありそうだが...
var xq = new PriorityQueue<XClustor>();
var yq = new PriorityQueue<YClustor>();
boolean prevIsX = S.charAt(0) == 'X';
boolean prevIsEdge = true;
int cnt = 1;
for (int i = 1; i < N; i++) {
if( prevIsX == (S.charAt(i) == 'X') ) {
cnt++;
} else {
if( prevIsX ) {
xq.add( new XClustor(cnt, prevIsEdge) );
} else {
yq.add( new YClustor(cnt, prevIsEdge));
}
prevIsX = (S.charAt(i) == 'X');
cnt = 1;
prevIsEdge = false;
}
}
boolean edge = true;
if( prevIsX ) {
xq.add( new XClustor(cnt, edge) );
} else {
yq.add( new YClustor(cnt, edge));
}
int point = 0;
for (int i = 0; i < N-1; i++) {
if( S.charAt(i) == 'Y' && S.charAt(i+1) == 'Y' ) {
point++;
}
}
int r = K;
while( r > 0 && !xq.isEmpty() ) {
// YXY 2
// YXXY 2 1
// YXX 1 1
var x = xq.poll();
if( x.size == 1 ) {
point += (x.edge ? 1 : 2);
} else {
point += 1;
x.size--;
xq.add(x);
}
r--;
}
while( r > 0 && !yq.isEmpty() ) {
// yYY 1 1
// yYYYy 2 1 1
// yYYy 2 1
// yYy 2
var y = yq.poll();
point -= y.edge ? 1 : 2;
r--;
y.size--;
while(r > 0 && y.size > 0) {
point -= 1;
r--;
y.size--;
}
}
return point;
}
static class XClustor implements Comparable<XClustor> {
int size;
final boolean edge;
public XClustor(int size, boolean edge) {
this.size = size;
this.edge = edge;
}
@Override
public int compareTo(XClustor arg) {
// 端は後から得になることもないので後回し
if( edge && !arg.edge ) {
return 1;
} else if( !edge && arg.edge ) {
return -1;
} else {
return Integer.compare(size, arg.size);
}
}
}
static class YClustor implements Comparable<YClustor> {
int size;
final boolean edge;
public YClustor(int size, boolean edge) {
this.size = size;
this.edge = edge;
}
@Override
public int compareTo(YClustor arg) {
// 端から消費したほうが得
if( edge && !arg.edge ) {
return -1;
} else if( !edge && arg.edge ) {
return 1;
} else {
// 大きいものから消費する
return Integer.compare(arg.size, size);
}
}
}
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/arc157_b/Java/42093281 |
condefects-java_data_1455 | import java.io.*;
import java.util.*;
class FastScaner {
InputStream in;
FastScaner() {
this.in = System.in;
}
char nextChar() {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n');
return ch;
} catch(IOException e) {
throw new IllegalStateException(e);
}
}
int nextInt() {
return (int) nextLong();
}
long nextLong() {
try {
long result = 0;
int flag = 1;
int ch;
do {
ch = in.read();
if(ch=='-') {
flag = -1;
}
} while(!Character.isDigit(ch));
do {
result *= 10;
result += ch - '0';
ch = in.read();
} while(Character.isDigit(ch));
return result * flag;
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
char[] nextCharArray(int start, int end) {
char[] result = new char[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextChar();
}
return result;
}
int[] nextIntArray(int start, int end) {
int[] result = new int[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextInt();
}
return result;
}
long[] nextLongArray(int start, int end) {
long[] result = new long[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextLong();
}
return result;
}
char[][] nextCharMatrix(int s1, int e1, int s2, int e2) {
char[][] result = new char[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextChar();
}
}
return result;
}
int[][] nextIntMatrix(int s1, int e1, int s2, int e2) {
int[][] result = new int[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextInt();
}
}
return result;
}
long[][] nextLongMatrix(int s1, int e1, int s2, int e2) {
long[][] result = new long[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextLong();
}
}
return result;
}
String next() {
return next(' ');
}
String nextLine() {
return next((char)-1);
}
String next(char a) {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n' || ch==a);
StringBuilder buf = new StringBuilder();
do {
buf.append(ch);
ch = (char)in.read();
} while(ch != '\r' && ch != '\n' && ch != a);
return buf.toString();
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
}
class FastWriter {
public static final String LINE_SEPARATOR = System.getProperty("line.separator");
PrintStream out;
StringBuilder buf;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
}
FastWriter pr(char ch) {
buf.append(ch);
return this;
}
FastWriter pr(int o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(long o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(double o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(Object o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(Iterable<?> o) {
for(var e : o) {
buf.append(e);
buf.append(' ');
}
return this;
}
FastWriter ln() {
int l = buf.length();
if(l >= 1) {
if(buf.charAt(l-1)==' ') {
buf.deleteCharAt(l-1);
}
}
buf.append(LINE_SEPARATOR);
return this;
}
void flush() {
System.out.print(buf);
}
}
//非連結無向グラフ
class DisjointSetUnion {
int rank[];
int next[];
DisjointSetUnion(int nodeSize) {
rank = new int[nodeSize+1];
next = new int[nodeSize+1];
Arrays.fill(rank, 1);
}
void addNode(int a, int b) {
a = getRoot(a);
b = getRoot(b);
if(a==b) {
return;
}
if(rank[a] < rank[b]) {
next[a] = b;
rank[b] += rank[a];
} else {
next[b] = a;
rank[a] += rank[b];
}
}
int size(int v) {
return rank[getRoot(v)];
}
boolean isJoint(int a, int b) {
return getRoot(a) == getRoot(b);
}
int getRoot(int v) {
if(next[v] == 0) {
return v;
}
return next[v] = getRoot(next[v]);
}
Set<Integer> getRootSet() {
Set<Integer> result = new HashSet<>();
for(int i=1; i<rank.length; i++) {
result.add( getRoot(i) );
}
return result;
}
}
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
int K = in.nextInt();
XY[] xys = new XY[N];
TreeSet<XY> tree = new TreeSet<XY>();
void solve() {
var chars = in.nextCharArray(0, N-1);
for(int i=0; i<chars.length; i++) {
xys[i] = new XY(i,chars[i]);
}
int preY = -1;
for(int i=0; i<N; i++) {
if(xys[i].ch=='Y') {
if(preY == -1) {
preY = i;
} else {
for(int j=preY+1; j<i; j++) {
xys[j].groupSize = i - preY - 1;
}
}
}
}
for(var xy : xys) {
xy.update();
tree.add(xy);
}
boolean xtoy = true;
while(!tree.isEmpty() && K>=1) {
var t = tree.pollFirst();
if(xtoy && t.ch == 'Y') {
xtoy = false;
var dsu = new DisjointSetUnion(N);
boolean pre = true;
for(int i=0; i<N; i++) {
if(!xys[i].changed && !pre) {
dsu.addNode(i, i+1);
}
pre = xys[i].changed;
}
tree = new TreeSet<XY>();
for(int i=0; i<N; i++) {
if(!xys[i].changed) {
xys[i].groupSize = dsu.size(i+1);
xys[i].update();
tree.add(xys[i]);
}
}
continue;
}
t.change();
K --;
if(t.index >= 1 && !xys[t.index-1].changed) {
tree.remove(xys[t.index-1]);
xys[t.index-1].update();
tree.add(xys[t.index-1]);
}
if(t.index < N-1 && !xys[t.index+1].changed) {
tree.remove(xys[t.index+1]);
xys[t.index+1].update();
tree.add(xys[t.index+1]);
}
}
int ans = 0;
boolean pre = false;
for(int i=0; i<N; i++) {
if(xys[i].ch == 'Y' && pre) {
ans ++;
}
pre = xys[i].ch == 'Y';
}
out.pr(ans).ln();
}
class XY implements Comparable<XY>{
int index;
char ch;
int priority;
boolean changed;
int groupSize;
public XY(int index, char ch) {
this.index = index;
this.ch = ch;
changed = false;
}
void change() {
changed = true;
ch = ch=='X' ? 'Y' : 'X';
}
void update() {
if(ch=='X') {
int c = 1;
if(index >= 1 && xys[index-1].ch == 'Y') {
c ++;
}
if(index < N-1 && xys[index+1].ch == 'Y') {
c ++;
}
c *= 1000000;
if(groupSize >= 1) {
c += 1000000 - groupSize;
}
priority = c;
} else {
int c = -1;
if(index >= 1 && xys[index-1].ch == 'Y') {
c --;
}
if(index < N-1 && xys[index+1].ch == 'Y') {
c --;
}
c *= 1000000;
c += groupSize;
priority = c;
}
}
@Override
public int compareTo(Main.XY o) {
if(priority == o.priority) {
return index - o.index;
}
return o.priority - priority;
}
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
import java.io.*;
import java.util.*;
class FastScaner {
InputStream in;
FastScaner() {
this.in = System.in;
}
char nextChar() {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n');
return ch;
} catch(IOException e) {
throw new IllegalStateException(e);
}
}
int nextInt() {
return (int) nextLong();
}
long nextLong() {
try {
long result = 0;
int flag = 1;
int ch;
do {
ch = in.read();
if(ch=='-') {
flag = -1;
}
} while(!Character.isDigit(ch));
do {
result *= 10;
result += ch - '0';
ch = in.read();
} while(Character.isDigit(ch));
return result * flag;
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
char[] nextCharArray(int start, int end) {
char[] result = new char[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextChar();
}
return result;
}
int[] nextIntArray(int start, int end) {
int[] result = new int[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextInt();
}
return result;
}
long[] nextLongArray(int start, int end) {
long[] result = new long[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextLong();
}
return result;
}
char[][] nextCharMatrix(int s1, int e1, int s2, int e2) {
char[][] result = new char[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextChar();
}
}
return result;
}
int[][] nextIntMatrix(int s1, int e1, int s2, int e2) {
int[][] result = new int[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextInt();
}
}
return result;
}
long[][] nextLongMatrix(int s1, int e1, int s2, int e2) {
long[][] result = new long[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextLong();
}
}
return result;
}
String next() {
return next(' ');
}
String nextLine() {
return next((char)-1);
}
String next(char a) {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n' || ch==a);
StringBuilder buf = new StringBuilder();
do {
buf.append(ch);
ch = (char)in.read();
} while(ch != '\r' && ch != '\n' && ch != a);
return buf.toString();
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
}
class FastWriter {
public static final String LINE_SEPARATOR = System.getProperty("line.separator");
PrintStream out;
StringBuilder buf;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
}
FastWriter pr(char ch) {
buf.append(ch);
return this;
}
FastWriter pr(int o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(long o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(double o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(Object o) {
buf.append(o);
buf.append(' ');
return this;
}
FastWriter pr(Iterable<?> o) {
for(var e : o) {
buf.append(e);
buf.append(' ');
}
return this;
}
FastWriter ln() {
int l = buf.length();
if(l >= 1) {
if(buf.charAt(l-1)==' ') {
buf.deleteCharAt(l-1);
}
}
buf.append(LINE_SEPARATOR);
return this;
}
void flush() {
System.out.print(buf);
}
}
//非連結無向グラフ
class DisjointSetUnion {
int rank[];
int next[];
DisjointSetUnion(int nodeSize) {
rank = new int[nodeSize+1];
next = new int[nodeSize+1];
Arrays.fill(rank, 1);
}
void addNode(int a, int b) {
a = getRoot(a);
b = getRoot(b);
if(a==b) {
return;
}
if(rank[a] < rank[b]) {
next[a] = b;
rank[b] += rank[a];
} else {
next[b] = a;
rank[a] += rank[b];
}
}
int size(int v) {
return rank[getRoot(v)];
}
boolean isJoint(int a, int b) {
return getRoot(a) == getRoot(b);
}
int getRoot(int v) {
if(next[v] == 0) {
return v;
}
return next[v] = getRoot(next[v]);
}
Set<Integer> getRootSet() {
Set<Integer> result = new HashSet<>();
for(int i=1; i<rank.length; i++) {
result.add( getRoot(i) );
}
return result;
}
}
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
int K = in.nextInt();
XY[] xys = new XY[N];
TreeSet<XY> tree = new TreeSet<XY>();
void solve() {
var chars = in.nextCharArray(0, N-1);
for(int i=0; i<chars.length; i++) {
xys[i] = new XY(i,chars[i]);
}
int preY = -1;
for(int i=0; i<N; i++) {
if(xys[i].ch=='Y') {
if(preY == -1) {
} else {
for(int j=preY+1; j<i; j++) {
xys[j].groupSize = i - preY - 1;
}
}
preY = i;
}
}
for(var xy : xys) {
xy.update();
tree.add(xy);
}
boolean xtoy = true;
while(!tree.isEmpty() && K>=1) {
var t = tree.pollFirst();
if(xtoy && t.ch == 'Y') {
xtoy = false;
var dsu = new DisjointSetUnion(N);
boolean pre = true;
for(int i=0; i<N; i++) {
if(!xys[i].changed && !pre) {
dsu.addNode(i, i+1);
}
pre = xys[i].changed;
}
tree = new TreeSet<XY>();
for(int i=0; i<N; i++) {
if(!xys[i].changed) {
xys[i].groupSize = dsu.size(i+1);
xys[i].update();
tree.add(xys[i]);
}
}
continue;
}
t.change();
K --;
if(t.index >= 1 && !xys[t.index-1].changed) {
tree.remove(xys[t.index-1]);
xys[t.index-1].update();
tree.add(xys[t.index-1]);
}
if(t.index < N-1 && !xys[t.index+1].changed) {
tree.remove(xys[t.index+1]);
xys[t.index+1].update();
tree.add(xys[t.index+1]);
}
}
int ans = 0;
boolean pre = false;
for(int i=0; i<N; i++) {
if(xys[i].ch == 'Y' && pre) {
ans ++;
}
pre = xys[i].ch == 'Y';
}
out.pr(ans).ln();
}
class XY implements Comparable<XY>{
int index;
char ch;
int priority;
boolean changed;
int groupSize;
public XY(int index, char ch) {
this.index = index;
this.ch = ch;
changed = false;
}
void change() {
changed = true;
ch = ch=='X' ? 'Y' : 'X';
}
void update() {
if(ch=='X') {
int c = 1;
if(index >= 1 && xys[index-1].ch == 'Y') {
c ++;
}
if(index < N-1 && xys[index+1].ch == 'Y') {
c ++;
}
c *= 1000000;
if(groupSize >= 1) {
c += 1000000 - groupSize;
}
priority = c;
} else {
int c = -1;
if(index >= 1 && xys[index-1].ch == 'Y') {
c --;
}
if(index < N-1 && xys[index+1].ch == 'Y') {
c --;
}
c *= 1000000;
c += groupSize;
priority = c;
}
}
@Override
public int compareTo(Main.XY o) {
if(priority == o.priority) {
return index - o.index;
}
return o.priority - priority;
}
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
| ConDefects/ConDefects/Code/arc157_b/Java/41285154 |
condefects-java_data_1456 | import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int k = Integer.parseInt(sc.next());
char[] s = sc.next().toCharArray();
int x = 0;
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
x++;
}
}
if(x == n){
System.out.println(Math.max(k-1, 0));
}else if(k == 0 || k == n){
if(k == n){
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
s[i] = 'Y';
}else{
s[i] = 'X';
}
}
}
int ans = 0;
for(int i = 0; i < n-1; i++){
if(s[i] == 'Y' && s[i+1] == 'Y'){
ans++;
}
}
System.out.println(ans);
}else if(k == x){
System.out.println(n-1);
}else{
if(k > x){
k = n-k;
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
s[i] = 'Y';
}else{
s[i] = 'X';
}
}
}
int ans = 0;
for(int i = 0; i < n-1; i++){
if(s[i] == 'Y' && s[i+1] == 'Y'){
ans++;
}
}
int left = 0;
while(left < n && s[left] == 'X'){
left++;
}
while(left < n && s[left] == 'Y'){
left++;
}
int right = n-1;
while(0 <= right && s[right] == 'X'){
right--;
}
while(0 <= right && s[right] == 'Y'){
right--;
}
var pq = new PriorityQueue<Integer>();
pq.add(Integer.MAX_VALUE);
int count = 0;
for(int i = left; i <= right; i++){
if(s[i] == 'X'){
count++;
}
if(s[i] == 'Y' || i == right){
if(count >= 1){
pq.add(count);
count = 0;
}
}
}
int countX = 0;
for(int i = 0; i < k; i++){
if(countX == 0){
countX = pq.poll();
}
countX--;
ans++;
if(countX == 0){
ans++;
}
}
System.out.println(ans);
}
}
}
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
var sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int k = Integer.parseInt(sc.next());
char[] s = sc.next().toCharArray();
int x = 0;
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
x++;
}
}
if(x == n){
System.out.println(Math.max(k-1, 0));
}else if(x == 0){
System.out.println(Math.max(n-k-1, 0));
}else if(k == 0 || k == n){
if(k == n){
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
s[i] = 'Y';
}else{
s[i] = 'X';
}
}
}
int ans = 0;
for(int i = 0; i < n-1; i++){
if(s[i] == 'Y' && s[i+1] == 'Y'){
ans++;
}
}
System.out.println(ans);
}else if(k == x){
System.out.println(n-1);
}else{
if(k > x){
k = n-k;
for(int i = 0; i < n; i++){
if(s[i] == 'X'){
s[i] = 'Y';
}else{
s[i] = 'X';
}
}
}
int ans = 0;
for(int i = 0; i < n-1; i++){
if(s[i] == 'Y' && s[i+1] == 'Y'){
ans++;
}
}
int left = 0;
while(left < n && s[left] == 'X'){
left++;
}
while(left < n && s[left] == 'Y'){
left++;
}
int right = n-1;
while(0 <= right && s[right] == 'X'){
right--;
}
while(0 <= right && s[right] == 'Y'){
right--;
}
var pq = new PriorityQueue<Integer>();
pq.add(Integer.MAX_VALUE);
int count = 0;
for(int i = left; i <= right; i++){
if(s[i] == 'X'){
count++;
}
if(s[i] == 'Y' || i == right){
if(count >= 1){
pq.add(count);
count = 0;
}
}
}
int countX = 0;
for(int i = 0; i < k; i++){
if(countX == 0){
countX = pq.poll();
}
countX--;
ans++;
if(countX == 0){
ans++;
}
}
System.out.println(ans);
}
}
} | ConDefects/ConDefects/Code/arc157_b/Java/39198988 |
condefects-java_data_1457 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int i, t = 0;
int k = 1;
for(i=0; t<=h; i++) {
if(i > 0) k *= 2;
t += k;
}
System.out.println(--i);
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int i, t = 0;
int k = 1;
for(i=0; t<=h; i++) {
if(i > 0) k *= 2;
t += k;
}
System.out.println(i);
}
} | ConDefects/ConDefects/Code/abc354_a/Java/54752020 |
condefects-java_data_1458 | import java.util.*;
public class Main{
public static void main(String[] args)throws Exception{
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int count = 0;
int p = 1;
while(p<h){
count++;
p*=2;
}
System.out.println(count);
}
}
import java.util.*;
public class Main{
public static void main(String[] args)throws Exception{
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int count = 0;
int p = 1;
while(p-1<=h){
count++;
p*=2;
}
System.out.println(count);
}
} | ConDefects/ConDefects/Code/abc354_a/Java/54257398 |
condefects-java_data_1459 | import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int syo = 0;
int day;
for(day=0; syo<h; day++){
syo += Math.pow(2, day);
}
System.out.println(day);
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int syo = 0;
int day;
for(day=0; syo<=h; day++){
syo += Math.pow(2, day);
}
System.out.println(day);
}
} | ConDefects/ConDefects/Code/abc354_a/Java/54214149 |
condefects-java_data_1460 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int takaHeight = scan.nextInt();
scan.close();
int plantHeight = 0;
int date = 0;
while (takaHeight > plantHeight) {
plantHeight += Math.pow(2, date);
date++;
}
System.out.println(date);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int takaHeight = scan.nextInt();
scan.close();
int plantHeight = 0;
int date = 0;
while (takaHeight >= plantHeight) {
plantHeight += Math.pow(2, date);
date++;
}
System.out.println(date);
}
}
| ConDefects/ConDefects/Code/abc354_a/Java/54750905 |
condefects-java_data_1461 | import java.util.*;
public class Main {
private static Scanner in;
public static void solve() {
// int n = in.nextInt();
// String s = in.next();
// long m = in.nextLong();
int H = in.nextInt();
int height = 1;
int growth = 2;
for (int i = 0; i < H; i++)
{
if (height > H)
{
System.out.print(i+1);
return;
}
height = height + growth;
growth = growth*2;
}
}
public static void main(String[] args) {
in = new Scanner(System.in);
solve();
in.close();
}
}
import java.util.*;
public class Main {
private static Scanner in;
public static void solve() {
// int n = in.nextInt();
// String s = in.next();
// long m = in.nextLong();
int H = in.nextInt();
int height = 1;
int growth = 2;
for (int i = 0; i < H+1; i++)
{
if (height > H)
{
System.out.print(i+1);
return;
}
height = height + growth;
growth = growth*2;
}
}
public static void main(String[] args) {
in = new Scanner(System.in);
solve();
in.close();
}
} | ConDefects/ConDefects/Code/abc354_a/Java/54301267 |
condefects-java_data_1462 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.lang.reflect.Parameter;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.util.concurrent.CompletableFuture;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.copyOfRange;
import static java.util.Arrays.fill;
public class Main {
public static void main(String[] args) throws Exception {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Task solver = new Task();
solver.solve(in, out);
out.close();
}
}
class Task {
int mod = 998244353;
public void solve(InputReader in, PrintWriter out) throws Exception {
int n = in.nextInt();
long x = in.nextLong();
long y = in.nextLong();
long[] a = new long[n];
long[] b = new long[n];
for (int i = 0; i < n; i++) {
a[i] = in.nextLong();
}
for (int i = 0; i < n; i++) {
b[i] = in.nextLong();
}
long[] dp = new long[1 << n];
Arrays.fill(dp, Long.MAX_VALUE);
dp[0] = 0;
for (int i = 1; i < (1 << n); i++) {
for (int j = 0; j < n; j++) if ((i & (1 << j)) != 0) {
dp[i] = Math.min(dp[i], dp[i ^ (1 << j)] + Math.abs(b[Integer.bitCount(i) - 1] - a[j]) * x + count(i, Integer.bitCount(i) - 1) * y);
}
}
out.println(dp[(1 << n) - 1]);
}
private long count(int b, int x) {
int cnt = 0;
for (int i = x + 1; i <= 20; i++) if ((b & (1 <<i)) != 0) {
cnt++;
}
return cnt;
}
}
class InputReader {
private final BufferedReader reader;
private StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String nextLine() {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(nextLine());
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.lang.reflect.Parameter;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.util.concurrent.CompletableFuture;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.copyOfRange;
import static java.util.Arrays.fill;
public class Main {
public static void main(String[] args) throws Exception {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Task solver = new Task();
solver.solve(in, out);
out.close();
}
}
class Task {
int mod = 998244353;
public void solve(InputReader in, PrintWriter out) throws Exception {
int n = in.nextInt();
long x = in.nextLong();
long y = in.nextLong();
long[] a = new long[n];
long[] b = new long[n];
for (int i = 0; i < n; i++) {
a[i] = in.nextLong();
}
for (int i = 0; i < n; i++) {
b[i] = in.nextLong();
}
long[] dp = new long[1 << n];
Arrays.fill(dp, Long.MAX_VALUE);
dp[0] = 0;
for (int i = 1; i < (1 << n); i++) {
for (int j = 0; j < n; j++) if ((i & (1 << j)) != 0) {
dp[i] = Math.min(dp[i], dp[i ^ (1 << j)] + Math.abs(b[Integer.bitCount(i) - 1] - a[j]) * x + count(i, j) * y);
}
}
out.println(dp[(1 << n) - 1]);
}
private long count(int b, int x) {
int cnt = 0;
for (int i = x + 1; i <= 20; i++) if ((b & (1 <<i)) != 0) {
cnt++;
}
return cnt;
}
}
class InputReader {
private final BufferedReader reader;
private StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream));
tokenizer = null;
}
public String nextLine() {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(nextLine());
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
} | ConDefects/ConDefects/Code/abc232_f/Java/28030454 |
condefects-java_data_1463 | import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int l = sc.nextInt();
int a = sc.nextInt();
int count = 0;
for(int i = 0; i < n; i++) {
if( a >= l) {
count++;
}
}
System.out.println(count);
}
}
import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int l = sc.nextInt();
int count = 0;
for(int i = 0; i < n; i++) {
int a = sc.nextInt();
if( a >= l) {
count++;
}
}
System.out.println(count);
}
} | ConDefects/ConDefects/Code/abc330_a/Java/49387736 |
condefects-java_data_1464 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int L = scanner.nextInt();
int cnt = 0;
for (int i = 0; i < N; i++) {
int score = scanner.nextInt();
if (score > L){
cnt++;
}
}
System.out.println(cnt);
// Scannerを閉じる
scanner.close();
}
}
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int L = scanner.nextInt();
int cnt = 0;
for (int i = 0; i < N; i++) {
int score = scanner.nextInt();
if (score >= L){
cnt++;
}
}
System.out.println(cnt);
// Scannerを閉じる
scanner.close();
}
}
| ConDefects/ConDefects/Code/abc330_a/Java/52199302 |
condefects-java_data_1465 | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int L = scanner.nextInt();
int gokaku = 0;
for (int i = 0; i<N; i++) {
int A = scanner.nextInt();
if(A >= 60){
gokaku++;
}
}
System.out.println(gokaku);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int L = scanner.nextInt();
int gokaku = 0;
for (int i = 0; i<N; i++) {
int A = scanner.nextInt();
if(A >= L){
gokaku++;
}
}
System.out.println(gokaku);
}
}
| ConDefects/ConDefects/Code/abc330_a/Java/51675946 |
condefects-java_data_1466 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int testNum = sc.nextInt();
int passingPoint = sc.nextInt();
int passingPointNum = 0;
for (int i = 0; i < testNum; i++) {
int score = sc.nextInt();
if(passingPoint < score) passingPointNum++;
}
// 出力
System.out.println(passingPointNum);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int testNum = sc.nextInt();
int passingPoint = sc.nextInt();
int passingPointNum = 0;
for (int i = 0; i < testNum; i++) {
int score = sc.nextInt();
if(passingPoint <= score) passingPointNum++;
}
// 出力
System.out.println(passingPointNum);
}
} | ConDefects/ConDefects/Code/abc330_a/Java/52257772 |
condefects-java_data_1467 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int L = sc.nextInt();
int ans = 0;
for(int i=0;i<N;i++){
int a = sc.nextInt();
if(a>=L)ans++;
}
System.err.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 L = sc.nextInt();
int ans = 0;
for(int i=0;i<N;i++){
int a = sc.nextInt();
if(a>=L)ans++;
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc330_a/Java/53403849 |
condefects-java_data_1468 |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
class Main{
static long p[]=new long[64];
public static void main(String[] args) {
ac in=new ac();
p[0]=1;
long res=0L;
for(int i=1;i<64;i++){
p[i]=p[i-1]*2L;
}
for(int i=0;i<63;i++){
res+=p[i]*in.nextInt();
}
String ans="";
if (p[63] == 1) {
ans= String.valueOf(new BigInteger("9223372036854775808").add(new BigInteger(String.valueOf(res))));
}if(p[63]!=1)
in.print(res);
in.print(ans);
in.flush();
}
}
class ac extends PrintWriter {
BufferedReader br;
StringTokenizer st;
ac() {
this(System.in, System.out);
}
ac(InputStream i, OutputStream o) {
super(o);
br = new BufferedReader(new InputStreamReader(i));
}
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.*;
class Main{
static long p[]=new long[64];
public static void main(String[] args) {
ac in=new ac();
p[0]=1;
long res=0L;
for(int i=1;i<64;i++){
p[i]=p[i-1]*2L;
}
for(int i=0;i<63;i++){
res+=p[i]*in.nextInt();
}p[63]=in.nextInt();
String ans="";
if (p[63] == 1) {
ans= String.valueOf(new BigInteger("9223372036854775808").add(new BigInteger(String.valueOf(res))));
}if(p[63]!=1)
in.print(res);
in.print(ans);
in.flush();
}
}
class ac extends PrintWriter {
BufferedReader br;
StringTokenizer st;
ac() {
this(System.in, System.out);
}
ac(InputStream i, OutputStream o) {
super(o);
br = new BufferedReader(new InputStreamReader(i));
}
String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
| ConDefects/ConDefects/Code/abc306_b/Java/43478751 |
condefects-java_data_1469 | import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long ans = 0L;
String[] strAry = sc.nextLine().split(" ", 0);
long[] longAry = new long[strAry.length];
for (int i = 0; i < strAry.length; i++) {
longAry[i] = Long.parseLong(strAry[i]);
}
for (int i = 0; i < 63; i++) {
ans += longAry[i] << i;
}
if (longAry[63] == 1) {
long L = 9223372036854775807L;
BigInteger bians;
bians = BigInteger.valueOf(ans + 1).add(BigInteger.valueOf(L));
System.out.println(bians);
}else {
System.out.println(BigInteger.valueOf(ans));
}
}
}
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long ans = 0L;
String[] strAry = sc.nextLine().split(" ", 0);
long[] longAry = new long[strAry.length];
for (int i = 0; i < strAry.length; i++) {
longAry[i] = Long.parseLong(strAry[i]);
}
for (int i = 0; i < 63; i++) {
ans += longAry[i] << i;
}
if (longAry[63] == 1) {
long L = 9223372036854775807L;
BigInteger bians;
bians = BigInteger.valueOf(ans).add(BigInteger.valueOf(L)).add(BigInteger.valueOf(1));
System.out.println(bians);
}else {
System.out.println(BigInteger.valueOf(ans));
}
}
}
| ConDefects/ConDefects/Code/abc306_b/Java/43212247 |
condefects-java_data_1470 | import java.util.Scanner;
import java.math.BigDecimal;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigDecimal result = new BigDecimal("0");
for(int i = 0; i < 64; i++) {
BigDecimal plus = new BigDecimal("0");
if(sc.nextInt() == 1) {
plus = pow2(i);
}
result = result.add(plus);
}
System.out.println(result.longValue());
}
public static BigDecimal pow2(int n) {
if(n == 0) {
return BigDecimal.valueOf(1);
}
return pow2(n - 1).multiply(BigDecimal.valueOf(2));
}
}
import java.util.Scanner;
import java.math.BigDecimal;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigDecimal result = new BigDecimal("0");
for(int i = 0; i < 64; i++) {
BigDecimal plus = new BigDecimal("0");
if(sc.nextInt() == 1) {
plus = pow2(i);
}
result = result.add(plus);
}
System.out.println(result);
}
public static BigDecimal pow2(int n) {
if(n == 0) {
return BigDecimal.valueOf(1);
}
return pow2(n - 1).multiply(BigDecimal.valueOf(2));
}
} | ConDefects/ConDefects/Code/abc306_b/Java/43107476 |
condefects-java_data_1471 | import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
BigInteger plus = BigInteger.ONE;
BigInteger ans = BigInteger.ZERO;
for(int i = 0;i < 63;i++) {
int a = sc.nextInt();
if(a == 1) {
//System.out.print(ans + ", ");
ans = ans.add(plus);
//System.out.println(ans);
}
plus = plus.multiply(BigInteger.TWO);
//System.out.println(plus);
}
System.out.print(ans);
}
}
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
BigInteger plus = BigInteger.ONE;
BigInteger ans = BigInteger.ZERO;
for(int i = 0;i < 64;i++) {
int a = sc.nextInt();
if(a == 1) {
//System.out.print(ans + ", ");
ans = ans.add(plus);
//System.out.println(ans);
}
plus = plus.multiply(BigInteger.TWO);
//System.out.println(plus);
}
System.out.print(ans);
}
} | ConDefects/ConDefects/Code/abc306_b/Java/44423557 |
condefects-java_data_1472 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long A[] = new long[64];
long result = 0;
long plusNo = 2;
for(int i = 0; i<64; i++){
A[i] = sc.nextInt();
if(A[i]==1){
// 最初のみ
if(i == 0){
result += 1;
continue;
}
if(i == 1){
result += 2;
continue;
}
result += plusNo;
}
if(i == 0 || i ==1){
continue;
}
plusNo = plusNo*2;
}
System.out.print(Long.toUnsignedString(result));
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long A[] = new long[64];
long result = 0;
long plusNo = 4;
for(int i = 0; i<64; i++){
A[i] = sc.nextInt();
if(A[i]==1){
// 最初のみ
if(i == 0){
result += 1;
continue;
}
if(i == 1){
result += 2;
continue;
}
result += plusNo;
}
if(i == 0 || i ==1){
continue;
}
plusNo = plusNo*2;
}
System.out.print(Long.toUnsignedString(result));
}
} | ConDefects/ConDefects/Code/abc306_b/Java/43081155 |
condefects-java_data_1473 | import java.util.*;
import java.io.*;
import java.nio.charset.StandardCharsets;
public class Main {
public static void main(String[] args) throws IOException {
InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
BufferedReader in = new BufferedReader(reader);
Main ins = new Main(in);
ins.calc();
ins.showResult();
}
PrintWriter writer = new PrintWriter(System.out);
BufferedReader in = null;
int N;
long L;
long[] A;
Main(BufferedReader in) throws IOException {
String[] tokens = in.readLine().split(" ");
this.N = Integer.parseInt(tokens[0]);
this.L = Long.parseLong(tokens[1]);
this.A = new long[N];
tokens = in.readLine().split(" ");
for (int i = 0; i < N; ++i) {
this.A[i] = Long.parseLong(tokens[i]);
}
}
void calc() {
Queue<Long> que = new PriorityQueue<>(new Comparator<Long>() {
@Override
public int compare(Long o1, Long o2) {
return Long.compare(o1, o2);
}
});
long sum = 0L;
for (int i = 0; i < N; ++i) {
que.add(A[i]);
sum += A[i];
}
if (sum != 0L) {
que.add(L - sum);
}
long result = 0L;
while (que.size() >= 2) {
Long val0 = que.poll();
Long val1 = que.poll();
long val = val0 + val1;
result += val;
que.add(val);
}
this.writer.println(result);
}
void showResult() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.nio.charset.StandardCharsets;
public class Main {
public static void main(String[] args) throws IOException {
InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
BufferedReader in = new BufferedReader(reader);
Main ins = new Main(in);
ins.calc();
ins.showResult();
}
PrintWriter writer = new PrintWriter(System.out);
BufferedReader in = null;
int N;
long L;
long[] A;
Main(BufferedReader in) throws IOException {
String[] tokens = in.readLine().split(" ");
this.N = Integer.parseInt(tokens[0]);
this.L = Long.parseLong(tokens[1]);
this.A = new long[N];
tokens = in.readLine().split(" ");
for (int i = 0; i < N; ++i) {
this.A[i] = Long.parseLong(tokens[i]);
}
}
void calc() {
Queue<Long> que = new PriorityQueue<>(new Comparator<Long>() {
@Override
public int compare(Long o1, Long o2) {
return Long.compare(o1, o2);
}
});
long sum = 0L;
for (int i = 0; i < N; ++i) {
que.add(A[i]);
sum += A[i];
}
if (sum != L) {
que.add(L - sum);
}
long result = 0L;
while (que.size() >= 2) {
Long val0 = que.poll();
Long val1 = que.poll();
long val = val0 + val1;
result += val;
que.add(val);
}
this.writer.println(result);
}
void showResult() {
writer.flush();
}
} | ConDefects/ConDefects/Code/abc252_f/Java/31880572 |
condefects-java_data_1474 | import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static boolean check(int x1, int y1, int x2, int y2, int x3, int y3) {
// x1 - x2 / y1 - y2 == x1 - x3 / y1 - y3
return (long) (y1 - y2) * (x1 - x3) == (x1 - x2) * (y1 - y3);
}
public static void solve() throws IOException{
int n = in.nextInt();
int[] x = new int[n];
int[] y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = in.nextInt();
y[i] = in.nextInt();
}
int tot = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int cnt = 2;
for (int k = 0; k < n; k++) {
if (k == i || k == j) continue;
if (check(x[i], y[i], x[j], y[j], x[k], y[k])) cnt++;
}
tot = Math.max(tot, cnt);
}
}
out.println(Math.min(n / 3, n - tot));
}
static boolean MULTI_CASE = false;
public static void main(String[] args) throws IOException {
if (MULTI_CASE) {
int T = in.nextInt();
for (int i = 0; i < T; ++i) {
solve();
}
} else {
solve();
}
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
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());
}
}
}
/*
*/
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static boolean check(int x1, int y1, int x2, int y2, int x3, int y3) {
// x1 - x2 / y1 - y2 == x1 - x3 / y1 - y3
return (long) (y1 - y2) * (x1 - x3) == (long) (x1 - x2) * (y1 - y3);
}
public static void solve() throws IOException{
int n = in.nextInt();
int[] x = new int[n];
int[] y = new int[n];
for (int i = 0; i < n; i++) {
x[i] = in.nextInt();
y[i] = in.nextInt();
}
int tot = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int cnt = 2;
for (int k = 0; k < n; k++) {
if (k == i || k == j) continue;
if (check(x[i], y[i], x[j], y[j], x[k], y[k])) cnt++;
}
tot = Math.max(tot, cnt);
}
}
out.println(Math.min(n / 3, n - tot));
}
static boolean MULTI_CASE = false;
public static void main(String[] args) throws IOException {
if (MULTI_CASE) {
int T = in.nextInt();
for (int i = 0; i < T; ++i) {
solve();
}
} else {
solve();
}
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
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());
}
}
}
/*
*/ | ConDefects/ConDefects/Code/arc173_b/Java/51488324 |
condefects-java_data_1475 | import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int[] a=new int[n];
int sum=0;
for(int i=0;i<n;i++)
{
a[i]=s.nextInt();
sum=sum+a[i];
}
int mid=(sum+1)/2;
int x=0;
for(int i=0;i<n;i++)
{
x=x+a[i];
if(x>mid)
{
int y=x-mid;
int z=a[i]-y;
System.out.println((i+1)+" "+z);
break;
}
}
}
}
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
int[] a=new int[n];
int sum=0;
for(int i=0;i<n;i++)
{
a[i]=s.nextInt();
sum=sum+a[i];
}
int mid=(sum+1)/2;
int x=0;
for(int i=0;i<n;i++)
{
x=x+a[i];
if(x>=mid)
{
int y=x-mid;
int z=a[i]-y;
System.out.println((i+1)+" "+z);
break;
}
}
}
} | ConDefects/ConDefects/Code/abc315_b/Java/45097689 |
condefects-java_data_1476 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int m=sc.nextInt();
int[] dayArray=new int[m];
int totalday1=0;
for (int i = 0; i < m; i++) {
int day=sc.nextInt();
dayArray[i]=day;
totalday1+=day;
}
sc.close();
int totalday2=totalday1/2+1;
for (int i = 0; i < m; i++) {
if (totalday2-dayArray[i]<0) {
System.out.println((i+1)+" "+totalday2);
break;
} else {
totalday2-= dayArray[i];
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int m=sc.nextInt();
int[] dayArray=new int[m];
int totalday1=0;
for (int i = 0; i < m; i++) {
int day=sc.nextInt();
dayArray[i]=day;
totalday1+=day;
}
sc.close();
int totalday2=totalday1/2+1;
for (int i = 0; i < m; i++) {
if (totalday2-dayArray[i]<=0) {
System.out.println((i+1)+" "+totalday2);
break;
} else {
totalday2-= dayArray[i];
}
}
}
} | ConDefects/ConDefects/Code/abc315_b/Java/44893259 |
condefects-java_data_1477 |
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
int N = Utility.readInt();
int[] month = new int[N];
int sum = 0;
for(int i = 0; i < N; i++) {
month[i] = Utility.readInt();
sum += month[i];
}
int remain = (sum + 1) / 2;
for(int i = 0; i < N; i++) {
if(remain < month[i]) {
System.out.println((i+1) + " " + remain);
break;
}
remain -= month[i];
}
}
}
class Utility {
// Static properties...
private static Scanner scanner = new Scanner(System.in);
/**
* Function: Read a menu selection input from the keyboard, value: range from 1 to 5.
* @return 1 to 5
*/
public static char readMenuSelection() {
char c;
for (;;) {
String str = readKeyBoard(1, false); // Contains a single character string
c = str.charAt(0); // Convert the string to a single character of char type
if (c != '1' && c != '2' && c != '3' && c != '4' && c != '5') {
System.out.print("Selection error, please re-enter: ");
} else break;
}
return c;
}
/**
* Function: Read a character input from the keyboard.
* @return A character
*/
public static char readChar() {
String str = readKeyBoard(1, false); // Single character input
return str.charAt(0);
}
/**
* Function: Read a character input from the keyboard. If Enter is pressed, return the specified default value; otherwise return the entered character.
* @param defaultValue Specified default value
* @return Default value or the entered character
*/
public static char readChar(char defaultValue) {
String str = readKeyBoard(1, true); // Either an empty string or a single character
return (str.length() == 0) ? defaultValue : str.charAt(0);
}
/**
* Function: Read an integer input from the keyboard, length less than 10 digits.
* @return Integer
*/
public static int readInt() {
int n = scanner.nextInt();
return n;
}
/**
* Function: Read an integer input from the keyboard, or return the default value if Enter is pressed. Otherwise, return the entered integer.
* @param defaultValue Specified default value
* @return Integer or default value
*/
public static int readInt(int defaultValue) {
int n;
for (;;) {
String str = readKeyBoard(10, true);
if (str.equals("")) {
return defaultValue;
}
// Exception handling...
try {
n = Integer.parseInt(str);
break;
} catch (NumberFormatException e) {
System.out.print("Number input error, please re-enter: ");
}
}
return n;
}
/**
* Function: Read a string of specified length from the keyboard.
* @param limit Length limit
* @return String of specified length
*/
public static String readString(int limit) {
return readKeyBoard(limit, false);
}
/**
* Function: Read a string of specified length from the keyboard, or return the default value if Enter is pressed. Otherwise, return the entered string.
* @param limit Length limit
* @param defaultValue Specified default value
* @return String of specified length
*/
public static String readString(int limit, String defaultValue) {
String str = readKeyBoard(limit, true);
return str.equals("") ? defaultValue : str;
}
/**
* Function: Read a confirmation selection input from the keyboard, Y or N.
* Wrap smaller functionality within a method.
* @return Y or N
*/
public static char readConfirmSelection() {
System.out.println("Please enter your choice (Y/N): Please choose carefully.");
char c;
for (;;) {
String str = readKeyBoard(1, false).toUpperCase();
c = str.charAt(0);
if (c == 'Y' || c == 'N') {
break;
} else {
System.out.print("Selection error, please re-enter: ");
}
}
return c;
}
/**
* Function: Read a string.
* @param limit Length to be read
* @param blankReturn If true, it can read an empty string. If false, it cannot read an empty string.
* If the input is empty or longer than the limit, it will prompt for re-entry.
* @return String
*/
private static String readKeyBoard(int limit, boolean blankReturn) {
String line = "";
while (scanner.hasNextLine()) {
line = scanner.nextLine();
if (line.length() == 0) {
if (blankReturn) return line;
else continue;
}
if (line.length() < 1 || line.length() > limit) {
System.out.print("Input length (cannot exceed " + limit + ") error, please re-enter: ");
continue;
}
break;
}
return line;
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
int N = Utility.readInt();
int[] month = new int[N];
int sum = 0;
for(int i = 0; i < N; i++) {
month[i] = Utility.readInt();
sum += month[i];
}
int remain = (sum + 1) / 2;
for(int i = 0; i < N; i++) {
if(remain <= month[i]) {
System.out.println((i+1) + " " + remain);
break;
}
remain -= month[i];
}
}
}
class Utility {
// Static properties...
private static Scanner scanner = new Scanner(System.in);
/**
* Function: Read a menu selection input from the keyboard, value: range from 1 to 5.
* @return 1 to 5
*/
public static char readMenuSelection() {
char c;
for (;;) {
String str = readKeyBoard(1, false); // Contains a single character string
c = str.charAt(0); // Convert the string to a single character of char type
if (c != '1' && c != '2' && c != '3' && c != '4' && c != '5') {
System.out.print("Selection error, please re-enter: ");
} else break;
}
return c;
}
/**
* Function: Read a character input from the keyboard.
* @return A character
*/
public static char readChar() {
String str = readKeyBoard(1, false); // Single character input
return str.charAt(0);
}
/**
* Function: Read a character input from the keyboard. If Enter is pressed, return the specified default value; otherwise return the entered character.
* @param defaultValue Specified default value
* @return Default value or the entered character
*/
public static char readChar(char defaultValue) {
String str = readKeyBoard(1, true); // Either an empty string or a single character
return (str.length() == 0) ? defaultValue : str.charAt(0);
}
/**
* Function: Read an integer input from the keyboard, length less than 10 digits.
* @return Integer
*/
public static int readInt() {
int n = scanner.nextInt();
return n;
}
/**
* Function: Read an integer input from the keyboard, or return the default value if Enter is pressed. Otherwise, return the entered integer.
* @param defaultValue Specified default value
* @return Integer or default value
*/
public static int readInt(int defaultValue) {
int n;
for (;;) {
String str = readKeyBoard(10, true);
if (str.equals("")) {
return defaultValue;
}
// Exception handling...
try {
n = Integer.parseInt(str);
break;
} catch (NumberFormatException e) {
System.out.print("Number input error, please re-enter: ");
}
}
return n;
}
/**
* Function: Read a string of specified length from the keyboard.
* @param limit Length limit
* @return String of specified length
*/
public static String readString(int limit) {
return readKeyBoard(limit, false);
}
/**
* Function: Read a string of specified length from the keyboard, or return the default value if Enter is pressed. Otherwise, return the entered string.
* @param limit Length limit
* @param defaultValue Specified default value
* @return String of specified length
*/
public static String readString(int limit, String defaultValue) {
String str = readKeyBoard(limit, true);
return str.equals("") ? defaultValue : str;
}
/**
* Function: Read a confirmation selection input from the keyboard, Y or N.
* Wrap smaller functionality within a method.
* @return Y or N
*/
public static char readConfirmSelection() {
System.out.println("Please enter your choice (Y/N): Please choose carefully.");
char c;
for (;;) {
String str = readKeyBoard(1, false).toUpperCase();
c = str.charAt(0);
if (c == 'Y' || c == 'N') {
break;
} else {
System.out.print("Selection error, please re-enter: ");
}
}
return c;
}
/**
* Function: Read a string.
* @param limit Length to be read
* @param blankReturn If true, it can read an empty string. If false, it cannot read an empty string.
* If the input is empty or longer than the limit, it will prompt for re-entry.
* @return String
*/
private static String readKeyBoard(int limit, boolean blankReturn) {
String line = "";
while (scanner.hasNextLine()) {
line = scanner.nextLine();
if (line.length() == 0) {
if (blankReturn) return line;
else continue;
}
if (line.length() < 1 || line.length() > limit) {
System.out.print("Input length (cannot exceed " + limit + ") error, please re-enter: ");
continue;
}
break;
}
return line;
}
}
| ConDefects/ConDefects/Code/abc315_b/Java/44900819 |
condefects-java_data_1478 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
sc.useDelimiter("");
int n = sc.nextInt();
String dush = sc.nextLine();
String[] a = new String[n];
for(int k = 0; k < n; k++){
a[k] = sc.next();
}
int a_ch = 0;
int b_ch = 0;
int c_ch = 0;
for(int k = 0; k < n; k++){
if(a[k].equals("A")){
a_ch = 1;
}
if(a[k].equals("B")){
b_ch = 1;
}
if(a[k].equals("C")){
c_ch = 1;
}
if(a_ch == 1 && b_ch == 1 && c_ch == 1){
System.out.println(k + 1);
break;
}
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.useDelimiter("");
String dush = sc.nextLine();
String[] a = new String[n];
for(int k = 0; k < n; k++){
a[k] = sc.next();
}
int a_ch = 0;
int b_ch = 0;
int c_ch = 0;
for(int k = 0; k < n; k++){
if(a[k].equals("A")){
a_ch = 1;
}
if(a[k].equals("B")){
b_ch = 1;
}
if(a[k].equals("C")){
c_ch = 1;
}
if(a_ch == 1 && b_ch == 1 && c_ch == 1){
System.out.println(k + 1);
break;
}
}
}
} | ConDefects/ConDefects/Code/abc311_a/Java/44361826 |
condefects-java_data_1479 | import java.util.*;
class Main {
static public void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = Integer.parseInt(scan.next());
String S = scan.next();
int counter = 0;
Boolean flagA = false;
Boolean flagB = false;
Boolean flagC = false;
for (int i=0; i < 5; i++) {
if (S.charAt(i) == 'A') {
flagA = true;
counter++;
} else if (S.charAt(i) == 'B') {
flagB = true;
counter++;
} else if (S.charAt(i) == 'C') {
flagC = true;
counter++;
}
if (flagA == true && flagB == true && flagC == true) {
System.out.println(counter);
break;
}
}
scan.close();
}
}
import java.util.*;
class Main {
static public void main(String[] args) {
Scanner scan = new Scanner(System.in);
int N = Integer.parseInt(scan.next());
String S = scan.next();
int counter = 0;
Boolean flagA = false;
Boolean flagB = false;
Boolean flagC = false;
for (int i=0; i < N; i++) {
if (S.charAt(i) == 'A') {
flagA = true;
counter++;
} else if (S.charAt(i) == 'B') {
flagB = true;
counter++;
} else if (S.charAt(i) == 'C') {
flagC = true;
counter++;
}
if (flagA == true && flagB == true && flagC == true) {
System.out.println(counter);
break;
}
}
scan.close();
}
} | ConDefects/ConDefects/Code/abc311_a/Java/43924544 |
condefects-java_data_1480 | import static java.lang.Math.*;
import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Formatter;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Stack;
import java.util.TreeMap;
import java.util.function.BiFunction;
import java.util.function.BiPredicate;
import java.util.function.BinaryOperator;
import java.util.function.Consumer;
import java.util.function.DoublePredicate;
import java.util.function.IntPredicate;
import java.util.function.IntUnaryOperator;
import java.util.function.LongBinaryOperator;
import java.util.function.LongPredicate;
import java.util.function.LongUnaryOperator;
import java.util.function.Predicate;
import java.util.function.UnaryOperator;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
final class Main {
public static void main(final String[] args) {
final long begin = System.currentTimeMillis(), end;
IntStream.range(0, VvyLw.MULTI ? VvyLw.io.ni() : 1).mapToObj(VvyLw::solve).filter(Objects::nonNull).forEach(VvyLw.io::out);
end = System.currentTimeMillis();
VvyLw.io.dump(end - begin + "ms");
VvyLw.io.close();
}
}
final class VvyLw extends Utility {
static final IO io = new IO(System.in, System.out, System.err, false);
static final Random rd = new Random();
static final boolean MULTI = false;
static final int INF = 1 << 30;
static final long LINF = (1L << 61) - 1;
static final double EPS = 1e-18;
static final int MOD = 998244353;
static final int M0D = (int) 1e9 + 7;
static final int[] dx = {0, -1, 1, 0, 0, -1, -1, 1, 1};
static final int[] dy = {0, 0, 0, -1, 1, -1, 1, -1, 1};
static final Object solve(final int Huitloxopetl) {
final int n = io.ni();
if(n == 1) {
return 1;
}
final var s = io.nt();
final var cnt = new int[26];
for(int i = 0, tmp = 1; i + 1 < n; ++i) {
if(s[i] == s[i + 1]) {
tmp++;
if(i + 2 == n) {
tmp++;
}
} else {
cnt[s[i] - 'a'] = max(cnt[s[i] - 'a'], tmp);
tmp = 1;
if(i + 2 == n) {
cnt[s[i + 1] - 'a'] = max(cnt[s[i + 1] - 'a'], tmp);
}
}
}
return sum(cnt);
}
}
class Utility {
protected static final String yes(final boolean ok){ return ok ? "Yes" : "No"; }
protected static final String no(final boolean ok){ return yes(!ok); }
protected static final long sqr(final long x){ return x * x; }
protected static final long cub(final long x){ return x * x * x; }
protected static final int mod(long n, final int m) {
n %= m;
return (int) (n < 0 ? n + m : n);
}
protected static final long mod(long n, final long m) {
n %= m;
return n < 0 ? n + m : n;
}
protected static final double log(final double x, final long base){ return Math.log(x) / Math.log(base); }
protected static final long intCeil(final long a, final long b){ return a == 0 ? 0 : (a - 1) / b + 1; }
protected static final double intRound(final double a, final long b, final int c) {
final long d = intPow(10, c);
return rint((a * d) / b) / d;
}
protected static final long intPow(long a, int b) {
long res = 1;
while(b > 0) {
if(b % 2 == 1) {
res *= a;
}
a *= a;
b >>= 1;
}
return res;
}
protected static final long intPow(long a, long b, final long m) {
long res = 1;
while(b > 0) {
if(b % 2 == 1) {
res *= a;
res = mod(res, m);
}
a *= a;
a = mod(a, m);
b >>= 1;
}
return res;
}
protected static final long inv(long a, final long m) {
long b = m, u = 1, v = 0;
while(b > 0) {
final long t = a / b;
a -= t * b;
a ^= b;
b ^= a;
a ^= b;
u -= t * v;
u ^= v;
v ^= u;
u ^= v;
}
return mod(u, m);
}
protected static final long lcm(final long a, final long b){ return a / gcd(a, b) * b; }
protected static final long lcm(final int... a){ return Arrays.stream(a).asLongStream().reduce(1, (x, y) -> lcm(x, y)); }
protected static final long lcm(final long... a){ return Arrays.stream(a).reduce(1, (x, y) -> lcm(x, y)); }
protected static final long gcd(final long a, final long b){ return b > 0 ? gcd(b, a % b) : a; }
protected static final int gcd(final int... a){ return Arrays.stream(a).reduce(0, (x, y) -> (int) gcd(x, y)); }
protected static final long gcd(final long... a){ return Arrays.stream(a).reduce(0, (x, y) -> gcd(x, y)); }
protected static final int min(final int... a){ return Arrays.stream(a).min().getAsInt(); }
protected static final long min(final long... a){ return Arrays.stream(a).min().getAsLong(); }
protected static final double min(final double... a){ return Arrays.stream(a).min().getAsDouble(); }
protected static final int max(final int... a){ return Arrays.stream(a).max().getAsInt(); }
protected static final long max(final long... a){ return Arrays.stream(a).max().getAsLong(); }
protected static final double max(final double... a){ return Arrays.stream(a).max().getAsDouble(); }
protected static final long sum(final int... a){ return Arrays.stream(a).asLongStream().sum(); }
protected static final long sum(final long... a){ return Arrays.stream(a).sum(); }
protected static final double sum(final double... a){ return Arrays.stream(a).sum(); }
protected static final long prod(final int... a){ return Arrays.stream(a).asLongStream().reduce(1, (x, y) -> x * y); }
protected static final long prod(final long... a){ return Arrays.stream(a).reduce(1, (x, y) -> x * y); }
protected static final double prod(final double... a){ return Arrays.stream(a).reduce(1, (x, y) -> x * y); }
protected static final double ave(final int... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double ave(final long... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double ave(final double... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double median(final int[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2.0;
}
protected static final double median(final long[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2.0;
}
protected static final double median(final double[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2;
}
protected static final long[] div(final long n) {
final ArrayList<Long> d = new ArrayList<>();
for(long i = 1; i * i <= n; ++i) {
if(n % i == 0) {
d.add(i);
if(i * i != n) {
d.add(n / i);
}
}
}
return d.stream().mapToLong(i -> i).sorted().toArray();
}
protected static final IntPair[] primeFactor(long n) {
final ArrayList<IntPair> pf = new ArrayList<>();
for(long i = 2; i * i <= n; ++i) {
if(n % i != 0) {
continue;
}
int cnt = 0;
while(n % i == 0) {
cnt++;
n /= i;
}
pf.add(IntPair.of(i, cnt));
}
if(n != 1) {
pf.add(IntPair.of(n, 1));
}
return pf.toArray(IntPair[]::new);
}
protected static final long eulerPhi(long n) {
long res = n;
for(long i = 2; i * i <= n; ++i) {
if(n % i == 0) {
res -= res / i;
while(n % i == 0) {
n /= i;
}
}
}
if(n > 1) {
res -= res / n;
}
return res;
}
protected static final long sigma(final long n){ return n * (n + 1) / 2; }
protected static final long sigma(final long a, final long b) {
assert a <= b;
return sigma(b) - sigma(a - 1);
}
protected static final long fact(int n) {
long res = 1;
while(n > 0) {
res *= n--;
}
return res;
}
protected static final long fact(int n, final long mod) {
long res = 1;
while(n > 0) {
res *= n--;
res %= mod;
}
return res;
}
protected static final long perm(final int n, final int r) {
int m = n;
long res = 1;
while(m > n - r) {
res *= m--;
}
return res;
}
protected static final long perm(final int n, final int r, final long mod) {
int m = n;
long res = 1;
while(m > n - r) {
res *= m--;
res %= mod;
}
return res;
}
protected static final long binom(final int n, final int r) {
if(r < 0 || n < r) {
return 0;
}
int tmp = n;
long res = 1;
for(int i = 1; i <= min(n - r, r); ++i) {
res *= tmp--;
res /= i;
}
return res;
}
protected static final long binom(final int n, final int r, final long mod) {
if(r < 0 || n < r) {
return 0;
}
int tmp = n;
long res = 1;
for(int i = 1; i <= min(n - r, r); ++i) {
res *= tmp--;
res = mod;
res /= i;
res %= mod;
}
return res;
}
protected static final boolean isInt(final double n){ return n == (long) floor(n); }
protected static final boolean isSqr(final long n){ return isInt(sqrt(n)); }
protected static final boolean isPrime(final long n) {
if(n == 1) {
return false;
}
for(long i = 2; i * i <= n; ++i) {
if(n % i == 0) {
return false;
}
}
return true;
}
protected static final boolean scope(final int l, final int x, final int r){ return l <= x && x <= r; }
protected static final boolean scope(final long l, final long x, final long r){ return l <= x && x <= r; }
protected static final boolean scope(final double l, final double x, final double r){ return l <= x && x <= r; }
protected static final int clamp(final int l, final int x, final int r){ return x < l ? l : x > r ? r : x; }
protected static final long clamp(final long l, final long x, final long r){ return x < l ? l : x > r ? r : x; }
protected static final double clamp(final double l, final double x, final double r){ return x < l ? l : x > r ? r : x; }
protected static final boolean isBit(final long i, final long j){ return (i >> j & 1) == 1; }
protected static final boolean nextPerm(final int[] a) {
try {
final int[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final long[] a) {
try {
final long[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final double[] a) {
try {
final double[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final char[] a) {
try {
final char[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean prevPerm(final int[] a) {
try {
final int[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final int[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final long[] a) {
try {
final long[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final long[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final double[] a) {
try {
final double[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final double[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final char[] a) {
try {
final char[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final char[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
private static final int[] nextPermutation(final int[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final long[] nextPermutation(final long[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final double[] nextPermutation(final double[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final char[] nextPermutation(final char[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final int[] prevPermutation(final int[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final long[] prevPermutation(final long[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final double[] prevPermutation(final double[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final char[] prevPermutation(final char[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final int find(final int dest, final int[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final long dest, final long[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final double dest, final double[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final char dest, final char[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int findRev(final int dest, final int[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final long dest, final long[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final double dest, final double[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final char dest, final char[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static void reverse(final int[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final long[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final double[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final char[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
protected static final int find(final int[] a, final int x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final long[] a, final long x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final double[] a, final double x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final char[] s, final char c) {
for(int i = 0; i < s.length; ++i) {
if(s[i] == c) {
return i;
}
}
return -1;
}
protected static final int find(final Object[] a, final Object x) {
for(int i = 0; i < a.length; ++i) {
if(a[i].equals(x)) {
return i;
}
}
return -1;
}
protected static final int findRev(final int[] a, final int x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final long[] a, final long x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final double[] a, final double x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final char[] s, final char c) {
for(int i = s.length; --i >= 0;) {
if(s[i] == c) {
return i;
}
}
return -1;
}
protected static final int findRev(final Object[] a, final Object x) {
for(int i = a.length; --i >= 0;) {
if(a[i].equals(x)) {
return i;
}
}
return -1;
}
protected static final boolean binarySearch(final int[] a, final int x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final boolean binarySearch(final long[] a, final long x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final <T extends Comparable<? super T>> boolean binarySearch(final T[] a, final T x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final <T extends Comparable<? super T>> boolean binarySearch(final List<T> a, final T x){ return Collections.binarySearch(a, x, null) >= 0; }
protected static final int lowerBound(final int[] a, final int x){ return bins(a.length, -1, (IntPredicate) y -> a[y] >= x); }
protected static final int lowerBound(final long[] a, final long x){ return bins(a.length, -1, (IntPredicate) y -> a[y] >= x); }
protected static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T x){ return lowerBound(Arrays.asList(a), x); }
protected static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T x){ return ~Collections.binarySearch(a, x, (p, q) -> p.compareTo(q) >= 0 ? 1 : -1); }
protected static final int upperBound(final int[] a, final int x){ return bins(a.length, -1, (IntPredicate) y -> a[y] > x); }
protected static final int upperBound(final long[] a, final long x){ return bins(a.length, -1, (IntPredicate) y -> a[y] > x); }
protected static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T x){ return upperBound(Arrays.asList(a), x); }
protected static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T x){ return ~Collections.binarySearch(a, x, (p, q) -> p.compareTo(q) > 0 ? 1 : -1); }
protected static final String sorted(final String s){ return s.chars().sorted().mapToObj(Character::toString).collect(Collectors.joining()); }
protected static final int[] sorted(final int[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final long[] sorted(final long[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final double[] sorted(final double[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final char[] sorted(final char[] a){ return sorted(new String(a)).toCharArray(); }
protected static final <T extends Comparable<? super T>> T[] sorted(final T[] a){ return Arrays.stream(a).sorted().toArray(n -> Arrays.copyOf(a, n)); }
protected static final boolean isSorted(final String s){ return s.equals(sorted(s)); }
protected static final boolean isSorted(final int[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final long[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final double[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final char[] a){ return Arrays.equals(a, sorted(a)); }
protected static final <T extends Comparable<? super T>> boolean isSorted(final T[] a){ return Arrays.equals(a, sorted(a)); }
protected static final String reverse(final String s){ return new StringBuilder(s).reverse().toString(); }
protected static final int[] reverse(final int[] a) {
final int n = a.length;
final int[] b = new int[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final long[] reverse(final long[] a) {
final int n = a.length;
final long[] b = new long[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final double[] reverse(final double[] a) {
final int n = a.length;
final double[] b = new double[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final char[] reverse(final char[] a) {
final int n = a.length;
final char[] b = new char[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final Object[] reverse(final Object[] a) {
final int n = a.length;
final Object[] b = new Object[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final int[] rotate(final int[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final int[] res = new int[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final long[] rotate(final long[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final long[] res = new long[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final double[] rotate(final double[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final double[] res = new double[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final char[] rotate(final char[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final char[] res = new char[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final boolean[] rotate(final boolean[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final boolean[] res = new boolean[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final Object[] rotate(final Object[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final Object[] res = new Object[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final String rotate(final String s, final int id) {
final List<Character> t = s.chars().mapToObj(i -> (char) i).collect(Collectors.toList());
Collections.rotate(t, -id);
return t.stream().map(String::valueOf).collect(Collectors.joining());
}
protected static final int[][] rotateR(final int[][] a) {
final int h = a.length, w = a[0].length;
final int[][] b = new int[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final long[][] rotateR(final long[][] a) {
final int h = a.length, w = a[0].length;
final long[][] b = new long[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final double[][] rotateR(final double[][] a) {
final int h = a.length, w = a[0].length;
final double[][] b = new double[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final char[][] rotateR(final char[][] a) {
final int h = a.length, w = a[0].length;
final char[][] b = new char[w][h];
IntStream.range(0, h).forEach(i -> {
IntStream.range(0, w).forEach(j -> b[j][i] = a[i][j]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final int[][] rotateL(final int[][] a) {
final int h = a.length, w = a[0].length;
final int[][] b = new int[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final long[][] rotateL(final long[][] a) {
final int h = a.length, w = a[0].length;
final long[][] b = new long[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final double[][] rotateL(final double[][] a) {
final int h = a.length, w = a[0].length;
final double[][] b = new double[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final char[][] rotateL(final char[][] a) {
final int h = a.length, w = a[0].length;
final char[][] b = new char[w][h];
IntStream.range(0, h).forEach(i -> {
IntStream.range(0, w).forEach(j -> b[w - j - 1][i] = a[i][j]);
});
return b;
}
protected static final void swap(final int[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final long[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final double[] a, final int i, final int j) {
final double tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
protected static final void swap(final char[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final boolean[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final Object[] a, final int i, final int j) {
final Object tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
protected static final void swap(final int[] a, final int[] b) {
assert a.length == b.length;
final int n = a.length;
final int[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final long[] a, final long[] b) {
assert a.length == b.length;
final int n = a.length;
final long[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final double[] a, final double[] b) {
assert a.length == b.length;
final int n = a.length;
final double[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final char[] a, final char[] b) {
assert a.length == b.length;
final int n = a.length;
final char[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final boolean[] a, final boolean[] b) {
assert a.length == b.length;
final int n = a.length;
final boolean[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final Object[] a, final Object[] b) {
assert a.length == b.length;
final int n = a.length;
final Object[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> Pair<S, F>[] swap(final Pair<F, S>[] p) {
@SuppressWarnings("unchecked")
final Pair<S, F>[] q = new Pair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
protected static final IntPair[] swap(final IntPair[] p) {
final IntPair[] q = new IntPair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
protected static final FloatPair[] swap(final FloatPair[] p) {
final FloatPair[] q = new FloatPair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
@SuppressWarnings("unchecked")
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> F[] first(final Pair<F, S>[] p){ return (F[]) Arrays.stream(p).map(i -> i.first).toArray(); }
protected static final long[] first(final IntPair[] p){ return Arrays.stream(p).mapToLong(i -> i.first).toArray(); }
protected static final double[] first(final FloatPair[] p){ return Arrays.stream(p).mapToDouble(i -> i.first).toArray(); }
@SuppressWarnings("unchecked")
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> S[] second(final Pair<F, S>[] p){ return (S[]) Arrays.stream(p).map(i -> i.second).toArray(); }
protected static final long[] second(final IntPair[] p){ return Arrays.stream(p).mapToLong(i -> i.second).toArray(); }
protected static final double[] second(final FloatPair[] p){ return Arrays.stream(p).mapToDouble(i -> i.second).toArray(); }
protected static final IntStream iota(final int n){ return IntStream.range(0, n); }
protected static final IntStream iota(final int n, final int init){ return IntStream.range(0 + init, n + init); }
protected static final int bins(int ok, int ng, final IntPredicate fn) {
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final long bins(long ok, long ng, final LongPredicate fn) {
while(abs(ok - ng) > 1) {
final long mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final double bins(double ok, double ng, final DoublePredicate fn) {
while(abs(ok - ng) > VvyLw.EPS) {
final double mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final Map<Integer, Integer> counter(final int[] a) {
final Map<Integer, Integer> res = new HashMap<>();
for(final int i: a) {
res.merge(i, 1, (x, y) -> x + y);
}
return res;
}
protected static final Map<Long, Integer> counter(final long[] a) {
final Map<Long, Integer> res = new HashMap<>();
for(final long i: a) {
res.merge(i, 1, (x, y) -> x + y);
}
return res;
}
protected static final long innerProd(final IntPair... p){ return iota(p.length).mapToLong(i -> p[i].first.longValue() * p[i].second.longValue()).sum(); }
protected static final double innerProd(final FloatPair... p){ return iota(p.length).mapToDouble(i -> p[i].first.doubleValue() * p[i].second.doubleValue()).sum(); }
protected static final FloatPair intersection(final IntPair a, final long sec1, final IntPair b, final long sec2) {
double m1, m2, b1, b2;
if(a.second.longValue() == 0 && b.second.longValue() == 0) {
return null;
} else if(a.second.longValue() == 0) {
m2 = -b.first.doubleValue() / b.second.longValue();
b2 = -sec2 / b.second.doubleValue();
final double x = -sec1 / a.first.doubleValue(), y = b2 + m2 * x;
return FloatPair.of(x, y);
} else if(b.second.longValue() == 0) {
m1 = -a.first.doubleValue() / a.second.longValue();
b1 = -sec1 / a.second.doubleValue();
final double x = -sec2 / b.first.doubleValue(), y = b1 + m1 * x;
return FloatPair.of(x, y);
}
m1 = -a.first.doubleValue() / a.second.longValue();
m2 = -b.first.doubleValue() / b.second.longValue();
b1 = -sec1 / a.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
assert m1 != m2;
final double x = (b1 - b2) / (m2 - m1), y = m1 * x + b1;
return FloatPair.of(x, y);
}
protected static final FloatPair intersection(final FloatPair a, final double sec1, final FloatPair b, final double sec2) {
double m1, m2, b1, b2;
if(a.second.doubleValue() == 0 && b.second.doubleValue() == 0) {
return null;
} else if(a.second.doubleValue() == 0) {
m2 = -b.first.doubleValue() / b.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
final double x = -sec1 / a.first.doubleValue(), y = b2 + m2 * x;
return FloatPair.of(x, y);
} else if(b.second.doubleValue() == 0) {
m1 = -a.first.doubleValue() / a.second.doubleValue();
b1 = -sec1 / a.second.doubleValue();
final double x = -sec2 / b.first.doubleValue(), y = b1 + m1 * x;
return FloatPair.of(x, y);
}
m1 = -a.first.doubleValue() / a.second.doubleValue();
m2 = -b.first.doubleValue() / b.second.doubleValue();
b1 = -sec1 / a.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
assert m1 != m2;
final double x = (b1 - b2) / (m2 - m1), y = m1 * x + b1;
return FloatPair.of(x, y);
}
protected static final int[] corPress(final int[] a) {
final int[] res = new int[a.length];
final int[] x = Arrays.stream(a).sorted().distinct().toArray();
Arrays.setAll(res, i -> lowerBound(x, a[i]));
return res;
}
protected static final int[] corPress(final long[] a) {
final int[] res = new int[a.length];
final long[] x = Arrays.stream(a).sorted().distinct().toArray();
Arrays.setAll(res, i -> lowerBound(x, a[i]));
return res;
}
protected static final String runLenPress(final String s) {
final int n = s.length();
final StringBuilder sb = new StringBuilder();
for(int l = 0; l < n;) {
int r = l + 1;
for(; r < n && s.charAt(l) == s.charAt(r); ++r){}
sb.append(s.charAt(l));
sb.append(r - l);
l = r;
}
return sb.toString();
}
protected static final String runLenRev(final String s) {
final int n = s.length();
final StringBuilder sb = new StringBuilder();
for(int l = 0; l < n;) {
int r = l + 1;
for(; r < n && scope('0', s.charAt(r), '9'); ++r){}
sb.append(String.valueOf(s.charAt(l)).repeat(Integer.parseInt(s.substring(l + 1, r))));
l = r;
}
return sb.toString();
}
protected static final int[] zAlgorithm(final String s) {
final int n = s.length();
int j = 0;
final int[] pre = new int[n];
for(int i = 0; ++i < n;) {
if(i + pre[i - j] < j + pre[j]) {
pre[i] = pre[i - j];
}
else {
int k = max(0, j + pre[j] - i);
while(i + k < n && s.charAt(k) == s.charAt(i + k)) {
++k;
}
pre[i] = k;
j = i;
}
}
pre[0] = n;
return pre;
}
protected static final int[] manacher(final String s_, final boolean calcEven) {
int n = s_.length();
final char[] s;
if(calcEven) {
s = new char[2 * n - 1];
IntStream.range(0, n).forEach(i -> s[i] = s_.charAt(i));
for(int i = n; --i >= 0;) {
s[2 * i] = s_.charAt(i);
}
final char d = Collections.min(s_.chars().mapToObj(c -> (char) c).collect(Collectors.toList()));
for(int i = 0; i < n - 1; ++i) {
s[2 * i + 1] = d;
}
} else {
s = new char[n];
IntStream.range(0, n).forEach(i -> s[i] = s_.charAt(i));
}
n = s.length;
final int[] rad = new int[n];
for(int i = 0, j = 0; i < n;) {
while(i - j >= 0 && i + j < n && s[i - j] == s[i + j]) {
++j;
}
rad[i] = j;
int k = 1;
while(i - k >= 0 && i + k < n && k + rad[i - k] < j) {
rad[i + k] = rad[i - k];
++k;
}
i += k;
j -= k;
}
if(calcEven) {
for(int i = 0; i < n; ++i) {
if(((i ^ rad[i]) & 1) == 0) {
rad[i]--;
}
}
} else {
for(int x: rad) {
x = 2 * x - 1;
}
}
return rad;
}
protected static final long kthRoot(final long n, final int k) {
if(k == 1) {
return n;
}
final LongPredicate chk = x -> {
long mul = 1;
for(int j = 0; j < k; ++j) {
try {
mul = multiplyExact(mul, x);
} catch(final ArithmeticException e) {
return false;
}
}
return mul <= n;
};
long ret = 0;
for(int i = 32; --i >= 0;) {
if(chk.test(ret | (1L << i))) {
ret |= 1L << i;
}
}
return ret;
}
protected static final long tetration(final long a, final long b, final long m) {
if(m == 1) {
return 0;
}
if(a == 0) {
return (b & 1) == 0 ? 1 : 0;
}
if(b == 0) {
return 1;
}
if(b == 1) {
return a % m;
}
if(b == 2) {
return intPow(a, a, m);
}
final long phi = eulerPhi(m);
long tmp = tetration(a, b - 1, phi);
if(tmp == 0) {
tmp += phi;
}
return intPow(a, tmp, m);
}
protected static final long floorSum(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 ym = (a * n + b) / m, xm = (ym * m - b);
if(ym == 0) {
return ans;
}
ans += (n - (xm + a - 1) / a) * ym;
ans += floorSum(ym, a, m, (a - xm % a) % a);
return ans;
}
}
interface TriFunction<T, U, V, R> {
R apply(final T a, final U b, final V c);
}
interface QuadFunction<A, B, C, D, R> {
R apply(final A a, final B b, final C c, final D d);
}
interface TriConsumer<T, U, V> {
void accept(final T a, final U b, final V c);
}
interface TriPredicate<T, U, V> {
boolean test(final T a, final U b, final V c);
}
interface RecursiveFunction<T, R> {
R apply(final RecursiveFunction<T, R> rec, final T n);
}
interface RecursiveBiFunction<T, U, R> {
R apply(final RecursiveBiFunction<T, U, R> rec, final T n, final U m);
}
interface RecursiveTriFunction<T, U, V, R> {
R apply(final RecursiveTriFunction<T, U, V, R> rec, final T p, final U q, final V r);
}
interface RecursiveUnaryOperator<T> {
T apply(final RecursiveUnaryOperator<T> rec, final T n);
}
interface RecursiveBinaryOperator<T> {
T apply(final RecursiveBinaryOperator<T> rec, final T a, final T b);
}
interface RecursiveConsumer<T> {
void accept(final RecursiveConsumer<T> rec, final T x);
}
interface RecursiveBiConsumer<T, U> {
void accept(final RecursiveBiConsumer<T, U> rec, final T x, final U y);
}
interface RecursiveTriConsumer<T, U, V> {
void accept(final RecursiveTriConsumer<T, U, V> rec, final T x, final U y, final V z);
}
interface RecursivePredicate<T> {
boolean test(final RecursivePredicate<T> rec, final T n);
}
interface RecursiveBiPredicate<T, U> {
boolean test(final RecursiveBiPredicate<T, U> rec, final T x, final U y);
}
interface RecursiveTriPredicate<T, U, V> {
boolean test(final RecursiveTriPredicate<T, U, V> rec, final T x, final U y, final V z);
}
interface RecursiveIntFunction<R> {
R apply(final RecursiveIntFunction<R> rec, final int n);
}
interface RecursiveLongFunction<R> {
R apply(final RecursiveLongFunction<R> rec, final long n);
}
interface RecursiveDoubleFunction<R> {
R apply(final RecursiveDoubleFunction<R> rec, final double n);
}
interface RecursiveIntUnaryOperator {
int apply(final RecursiveIntUnaryOperator rec, final int n);
}
interface RecursiveLongUnaryOperator {
long apply(final RecursiveLongUnaryOperator rec, final long n);
}
interface RecursiveDoubleUnaryOperator {
double apply(final RecursiveDoubleUnaryOperator rec, final double n);
}
interface RecursiveIntBinaryOperator {
int apply(final RecursiveIntBinaryOperator rec, final int a, final int b);
}
interface RecursiveLongBinaryOperator {
long apply(final RecursiveLongBinaryOperator rec, final long a, final long b);
}
interface RecursiveDoubleBinaryOperator {
double apply(final RecursiveDoubleBinaryOperator rec, final double a, final double b);
}
interface RecursiveIntConsumer {
void accept(final RecursiveIntConsumer rec, final int n);
}
interface RecursiveLongConsumer {
void accept(final RecursiveLongConsumer rec, final long n);
}
interface RecursiveDoubleConsumer {
void accept(final RecursiveDoubleConsumer rec, final double n);
}
interface RecursiveIntPredicate {
boolean test(final RecursiveIntPredicate rec, final int n);
}
interface RecursiveLongPredicate {
boolean test(final RecursiveLongPredicate rec, final long n);
}
interface RecursiveDoublePredicate {
boolean test(final RecursiveDoublePredicate rec, final double n);
}
final class IO implements Closeable, AutoCloseable {
private final MyScanner in;
private final MyPrinter out, err;
IO(final InputStream in, final OutputStream out, final OutputStream err, final boolean autoFlush) {
this.in = new MyScanner(in);
this.out = new MyPrinter(out, autoFlush);
this.err = new MyPrinter(err, true);
}
final int ni(){ return in.ni(); }
final long nl(){ return in.nl(); }
final double nd(){ return in.nd(); }
final char nc(){ return in.nc(); }
final String ns(){ return in.ns(); }
final char[] nt(){ return in.nt(); }
final BigInteger nb(){ return in.nb(); }
final IntPair pi(){ return in.pi(); }
final FloatPair pf(){ return in.pf(); }
final int[] ni(final int n) {
final int[] a = new int[n];
Arrays.setAll(a, i -> ni());
return a;
}
final int[] ni(final int n, final IntUnaryOperator f){ return Arrays.stream(ni(n)).map(f).toArray(); }
final long[] nl(final int n) {
final long[] a = new long[n];
Arrays.setAll(a, i -> nl());
return a;
}
final long[] nl(final int n, final LongUnaryOperator f){ return Arrays.stream(nl(n)).map(f).toArray(); }
final double[] nd(final int n) {
final double[] a = new double[n];
Arrays.setAll(a, i -> nd());
return a;
}
final char[] nc(final int n) {
final char[] a = new char[n];
IntStream.range(0, n).forEach(i -> a[i] = nc());
return a;
}
final String[] ns(final int n) {
final String[] a = new String[n];
Arrays.setAll(a, i -> ns());
return a;
}
final char[][] nt(final int n) {
final char[][] a = new char[n][];
Arrays.setAll(a, i -> nt());
return a;
}
final BigInteger[] nb(final int n) {
final BigInteger[] a = new BigInteger[n];
Arrays.setAll(a, i -> nb());
return a;
}
final IntPair[] pi(final int n) {
final IntPair[] a = new IntPair[n];
Arrays.setAll(a, i -> pi());
return a;
}
final IntPair[] pi(final int n, final UnaryOperator<IntPair> f){ return Arrays.stream(pi(n)).map(f).toArray(IntPair[]::new); }
final FloatPair[] pf(final int n) {
final FloatPair[] a = new FloatPair[n];
Arrays.setAll(a, i -> pf());
return a;
}
final int[][] ni(final int h, final int w) {
final int[][] a = new int[h][w];
Arrays.setAll(a, i -> ni(w));
return a;
}
final long[][] nl(final int h, final int w) {
final long[][] a = new long[h][w];
Arrays.setAll(a, i -> nl(w));
return a;
}
final double[][] nd(final int h, final int w) {
final double[][] a = new double[h][w];
Arrays.setAll(a, i -> nd(w));
return a;
}
final char[][] nc(final int h, final int w) {
final char[][] a = new char[h][w];
Arrays.setAll(a, i -> nc(w));
return a;
}
final String[][] ns(final int h, final int w) {
final String[][] a = new String[h][w];
Arrays.setAll(a, i -> ns(w));
return a;
}
final BigInteger[][] nb(final int h, final int w) {
final BigInteger[][] a = new BigInteger[h][w];
Arrays.setAll(a, i -> nb(w));
return a;
}
final String line(){ return in.line(); }
final void print(final Object arg){ out.print(arg); }
final void printf(final String fmt, final Object... args){ out.printf(fmt, args); }
final void out(){ out.out(); }
final void out(final Object head, final Object... tail){ out.out(head, tail); }
final void out(final int[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final long[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final double[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final boolean[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final char[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final Object[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void outl(final Object head, final Object... tail){ out.outl(head, tail); }
final void dump(final Object head, final Object... tail){ err.out(head, tail); }
final void dump(final int[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final long[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final double[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final boolean[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final char[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final Object[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dumpl(final Object head, final Object... tail){ err.outl(head, tail); }
@Override
public final void close() {
out.flush();
in.close();
out.close();
err.close();
}
private final class MyScanner implements Closeable, AutoCloseable {
private int pos, lim;
private final byte[] buf;
private final InputStream is;
private boolean check;
MyScanner(final InputStream is) {
this.is = is;
pos = lim = 0;
buf = new byte[1 << 17];
check = false;
}
private final boolean isPunct(final byte bt){ return !Utility.scope(33, bt, 126); }
private final boolean isNum(final byte bt){ return Utility.scope('0', bt, '9'); }
private final byte read() {
if(pos == lim && lim != -1) {
try {
lim = is.read(buf);
pos = 0;
} catch(final IOException e) {
e.printStackTrace();
}
}
return buf[pos++];
}
private final byte next() {
byte bt;
if(check) {
check = false;
bt = buf[pos - 1];
if(!isPunct(bt)) {
return bt;
}
}
while(isPunct(bt = read())){}
return bt;
}
final int ni(){ return toIntExact(nl()); }
final long nl() {
byte c = next();
final boolean neg = c == '-';
if(neg) {
c = next();
}
assert isNum(c);
long res = c - '0';
while(isNum(c = read())) {
res = 10 * res + c - '0';
}
check = !isNum(c);
return neg ? -res : res;
}
final double nd() {
byte c = next();
final boolean neg = c == '-';
if(neg) {
c = next();
}
assert isNum(c);
double res = c - '0';
while(isNum(c = read())) {
res = 10 * res + c - '0';
}
if(c != '.') {
check = true;
return res;
}
int i;
for(i = 0; isNum(c = read()); ++i) {
res = res * 10 + c - '0';
}
res /= pow(10, i);
check = true;
return neg ? -res : res;
}
final char nc(){ return (char) next(); }
final String ns() {
final StringBuilder sb = new StringBuilder();
byte c = next();
while(!isPunct(c)) {
sb.append((char) c);
c = read();
}
return sb.toString();
}
final char[] nt(){ return ns().toCharArray(); }
final BigInteger nb(){ return new BigInteger(ns()); }
final IntPair pi(){ return IntPair.of(nl(), nl()); }
final FloatPair pf(){ return FloatPair.of(nd(), nd()); }
final String line() {
final StringBuilder sb = new StringBuilder();
byte c;
while((c = read()) != '\n') {
sb.append((char) c);
}
return sb.toString();
}
@Override
public final void close() {
try {
is.close();
} catch(final IOException e) {
e.printStackTrace();
}
}
}
private final class MyPrinter implements Closeable, Flushable, AutoCloseable {
private OutputStream os;
private final boolean autoFlush;
private final byte[] buf;
private int pos;
private final boolean debug;
MyPrinter(final OutputStream os, final boolean autoFlush){
this.os = os;
this.autoFlush = autoFlush;
buf = new byte[1 << 17];
pos = 0;
debug = os == System.err;
}
private final void write(final byte bt) {
buf[pos++] = bt;
if(pos == buf.length) {
flush();
}
}
private final void newLine() {
write((byte) '\n');
if(autoFlush) {
flush();
}
}
final void print(final Object arg) {
if(arg instanceof final String s) {
for(final char c: s.toCharArray()) {
write((byte) c);
}
} else {
final StringBuilder sb = new StringBuilder();
if(arg instanceof final int[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final long[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final double[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final boolean[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final char[] a) {
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final Object[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
print(a[0]);
for(int i = 0; ++i < a.length;) {
print("\n");
print(a[i]);
}
return;
} else {
if(debug) {
print(arg.toString());
return;
} else if(arg instanceof final Pair<?, ?> p) {
sb.append(p.first + " " + p.second);
} else if(arg instanceof final Collection<?> c) {
int i = 0;
for(final Object el: c) {
sb.append(el);
if(++i != c.size()) {
sb.append(' ');
}
}
} else if(sb.isEmpty()) {
print(arg.toString());
return;
}
}
print(sb.toString());
}
if(autoFlush) {
flush();
}
}
final void printf(final String fmt, final Object... args){ print(new Formatter().format(fmt, args)); }
final void out(){ newLine(); }
final void out(final Object head, final Object... tail) {
print(head);
for(final Object el: tail) {
print(" ");
print(el);
}
newLine();
}
final void outl(final Object head, final Object... tail) {
out(head);
for(final Object el: tail) {
out(el);
}
}
@Override
public final void flush() {
try {
os.write(buf, 0, pos);
pos = 0;
} catch(final IOException e) {
e.printStackTrace();
}
}
@Override
public final void close() {
if(os == null) {
return;
}
try {
os.close();
os = null;
} catch(final IOException e) {
e.printStackTrace();
}
}
}
}
class Pair<F extends Comparable<? super F>, S extends Comparable<? super S>> implements Comparable<Pair<F, S>>, Cloneable {
public F first;
public S second;
protected Pair(final F first, final S second) {
this.first = first;
this.second = second;
}
static final <F extends Comparable<? super F>, S extends Comparable<? super S>> Pair<F, S> of(final F a, final S b){ return new Pair<>(a, b); }
Pair<S, F> swap(){ return Pair.of(second, first); }
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Pair<?, ?> p = (Pair<?, ?>) o;
return first.equals(p.first) && second.equals(p.second);
}
@Override
public final int hashCode(){ return Objects.hash(first, second); }
@Override
public final String toString(){ return "(" + first + ", " + second + ")"; }
@SuppressWarnings("unchecked")
@Override
public final Pair<F, S> clone() {
try {
return (Pair<F, S>) super.clone();
} catch(final CloneNotSupportedException e){
e.printStackTrace();
}
throw new Error();
}
@Override
public final int compareTo(final Pair<F, S> p) {
if(first.compareTo(p.first) == 0) {
return second.compareTo(p.second);
}
return first.compareTo(p.first);
}
}
final class IntPair extends Pair<Long, Long> {
private IntPair(final long first, final long second){ super(first, second); }
static final IntPair ZERO = new IntPair(0, 0);
static final IntPair ONE = new IntPair(1, 1);
static final IntPair of(final long a, final long b){ return new IntPair(a, b); }
@Override
final IntPair swap(){ return new IntPair(second, first); }
final IntPair add(final IntPair p){ return new IntPair(first + p.first, second + p.second); }
final IntPair sub(final IntPair p){ return new IntPair(first - p.first, second - p.second); }
final IntPair mul(final IntPair p){ return new IntPair(first * p.first, second * p.second); }
final IntPair div(final IntPair p){ return new IntPair(first / p.first, second / p.second); }
final IntPair mod(final IntPair p){ return new IntPair(first % p.first, second % p.second); }
final IntPair rotate(){ return new IntPair(-second, first); }
final FloatPair rotate(final int ang) {
final double rad = toRadians(Utility.mod(ang, 360));
return FloatPair.of(first * cos(rad) - second * sin(rad), first * sin(rad) + second * cos(rad));
}
final long dot(final IntPair p){ return first * p.first + second * p.second; }
final long cross(final IntPair p){ return rotate().dot(p); }
final long sqr(){ return dot(this); }
final double grad() {
try {
return 1.0 * second / first;
} catch(final ArithmeticException e) {
e.printStackTrace();
}
throw new Error();
}
final double abs(){ return hypot(first, second); }
final long lcm(){ return Utility.lcm(first, second); }
final long gcd(){ return Utility.gcd(first, second); }
final IntPair extgcd() {
long x = 1, y = 0, t1 = 0, t2 = 0, t3 = 1, a = first, b = second;
while(b > 0) {
t1 = a / b;
a -= t1 * b;
a ^= b;
b ^= a;
a ^= b;
x -= t1 * t2;
x ^= t2;
t2 ^= x;
x ^= t2;
y -= t1 * t3;
y ^= t3;
t3 ^= y;
y ^= t3;
}
return new IntPair(x, y);
}
}
final class FloatPair extends Pair<Double, Double> {
private FloatPair(final double first, final double second){ super(first, second); }
static final FloatPair of(final double a, final double b){ return new FloatPair(a, b); }
@Override
final FloatPair swap(){ return new FloatPair(second, first); }
final FloatPair add(final FloatPair p){ return new FloatPair(first + p.first, second + p.second); }
final FloatPair sub(final FloatPair p){ return new FloatPair(first - p.first, second - p.second); }
final FloatPair mul(final FloatPair p){ return new FloatPair(first * p.first, second * p.second); }
final FloatPair div(final FloatPair p){ return new FloatPair(first / p.first, second / p.second); }
final FloatPair rotate(){ return new FloatPair(-second, first); }
final FloatPair rotate(final int ang) {
final double rad = toRadians(Utility.mod(ang, 360));
return FloatPair.of(first * cos(rad) - second * sin(rad), first * sin(rad) + second * cos(rad));
}
final double dot(final FloatPair p){ return first * p.first + second * p.second; }
final double cross(final FloatPair p){ return rotate().dot(p); }
final double sqr(){ return dot(this); }
final double grad() {
try {
return second / first;
} catch(final ArithmeticException e) {
e.printStackTrace();
}
throw new Error();
}
final double abs(){ return hypot(first, second); }
}
final class Why {
static final boolean isBipartite(final UnionFind uf) {
assert uf.size() % 2 == 0;
final int n = uf.size() / 2;
boolean ok = true;
for(int i = 0; i < n; ++i) {
ok &= !uf.same(i, i + n);
}
return ok;
}
static final long invNum(final int[] a) {
final int[] b = Utility.sorted(a);
final Map<Integer, Integer> id = new HashMap<>();
for(int i = 0; i < a.length; ++i) {
id.put(b[i], i);
}
final FenwickTree bit = new FenwickTree(a.length);
long res = 0;
for(int i = 0; i < a.length; ++i) {
res += i - bit.sum(id.get(a[i]));
bit.add(id.get(a[i]), 1);
}
return res;
}
static final long invNum(final long[] a) {
final long[] b = Utility.sorted(a);
final Map<Long, Integer> id = new HashMap<>();
for(int i = 0; i < a.length; ++i) {
id.put(b[i], i);
}
final FenwickTree bit = new FenwickTree(a.length);
long res = 0;
for(int i = 0; i < a.length; ++i) {
res += i - bit.sum(id.get(a[i]));
bit.add(id.get(a[i]), 1);
}
return res;
}
}
final class Edge {
public int src, to, id;
public long cost;
Edge(final int src, final int to, final int id) {
this.src = src;
this.to = to;
this.id = id;
}
Edge(final int src, final int to, final long cost, final int id) {
this.src = src;
this.to = to;
this.cost = cost;
this.id = id;
}
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Edge e = (Edge) o;
return src == e.src && to == e.to && cost == e.cost;
}
@Override
public final int hashCode(){ return Objects.hash(src, to, cost, id); }
@Override
public final String toString(){ return "(" + src + ", " + to + ", " + cost + ")"; }
}
class Graph extends ArrayList<ArrayList<Edge>> {
protected final boolean undirected;
protected final int n, indexed;
protected int id;
protected final ArrayList<Edge> edge;
Graph(final int n, final boolean undirected){ this(n, 1, undirected); }
Graph(final int n, final int indexed, final boolean undirected) {
this.n = n;
this.indexed = indexed;
this.undirected = undirected;
id = 0;
edge = new ArrayList<>();
IntStream.range(0, n).forEach(i -> add(new ArrayList<>()));
}
static Graph of(final List<ArrayList<Edge>> g, final boolean undirected) {
int max = 0, min = Integer.MAX_VALUE;
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
max = max(e.src, e.to);
min = min(e.src, e.to);
}
}
final Graph gp = new Graph(max, min, undirected);
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
gp.addEdge(e.src, e.to);
}
}
return gp;
}
protected final void addEdge(int a, int b) {
a -= indexed;
b -= indexed;
this.get(a).add(new Edge(a, b, id));
edge.add(new Edge(a, b, id));
if(undirected) {
this.get(b).add(new Edge(b, a, id));
edge.add(new Edge(b, a, id));
}
id++;
}
protected void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni())); }
protected final ArrayList<Edge> getEdge(){ return edge; }
protected final String output() {
final StringBuilder sb = new StringBuilder();
for(int i = 0, j; i < n;) {
j = 0;
for(final var ed: get(i)) {
sb.append(ed.to);
if(++j < get(i).size()) {
sb.append(' ');
}
}
if(++i < n) {
sb.append('\n');
}
}
return sb.toString();
}
protected final int[] allDist(final int v) {
final int[] d = new int[n];
Arrays.fill(d, -1);
final Queue<Integer> q = new ArrayDeque<>();
d[v] = 0;
q.add(v);
while(!q.isEmpty()) {
final int tmp = q.poll();
for(final Edge el: this.get(tmp)) {
if(d[el.to] != -1) {
continue;
}
d[el.to] = d[tmp] + 1;
q.add(el.to);
}
}
return d;
}
protected final int dist(final int u, final int v){ return allDist(u)[v]; }
protected final ArrayList<Integer> topologicalSort() {
final int[] deg = new int[n];
for(int i = 0; i < n; ++i) {
for(final Edge ed: this.get(i)) {
deg[ed.to]++;
}
}
final Stack<Integer> sk = new Stack<>();
for(int i = 0; i < n; ++i) {
if(deg[i] == 0) {
sk.add(i);
}
}
final ArrayList<Integer> ord = new ArrayList<>();
while(!sk.isEmpty()) {
final int tmp = sk.pop();
ord.add(tmp);
for(final Edge ed: this.get(tmp)) {
if(--deg[ed.to] == 0) {
sk.add(ed.to);
}
}
}
return n == ord.size() ? ord : null;
}
protected final int[] cycleDetector() {
final int[] used = new int[n];
final Edge[] pre = new Edge[n];
final ArrayList<Edge> cycle = new ArrayList<>();
final RecursiveIntPredicate dfs = (rec, i) -> {
used[i] = 1;
for(final Edge e: get(i)) {
if(used[e.to] == 0) {
pre[e.to] = e;
if(rec.test(rec, e.to)) {
return true;
}
} else if(used[e.to] == 1) {
int now = i;
while(now != e.to) {
cycle.add(pre[now]);
now = pre[now].src;
}
cycle.add(e);
return true;
}
}
used[i] = 2;
return false;
};
for(int i = 0; i < n; ++i) {
if(used[i] == 0 && dfs.test(dfs, i)) {
Collections.reverse(cycle);
return cycle.stream().mapToInt(e -> e.to).toArray();
}
}
return null;
}
@Override
public String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; ++i) {
final int m = get(i).size();
sb.append(i + ": [");
for(int j = 0; j < m; ++j) {
sb.append(get(i).get(j).to);
if(j + 1 < m) {
sb.append(", ");
}
}
sb.append(']');
if(i + 1 < n) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class ShortestPath {
private final long[] cost;
private final int[] src;
ShortestPath(final long[] cost, final int[] src) {
this.cost = cost;
this.src = src;
}
final boolean isThru(final int i){ return src[i] != -1; }
final int[] path(int i) {
final List<Integer> res = new ArrayList<>();
for(; i != -1; i = src[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(k -> k).toArray();
}
final long[] get(){ return cost; }
}
final class MST {
public final ArrayList<Edge> tree;
public final long cost;
MST(final ArrayList<Edge> tree, final long cost) {
this.tree = tree;
this.cost = cost;
}
}
final class WeightedGraph extends Graph {
WeightedGraph(final int n, final boolean undirected){ super(n, undirected); }
WeightedGraph(final int n, final int indexed, final boolean undirected){ super(n, indexed, undirected); }
static final WeightedGraph of(final List<ArrayList<Edge>> g, final boolean undirected) {
int max = 0, min = Integer.MAX_VALUE;
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
max = max(e.src, e.to);
min = min(e.src, e.to);
}
}
final WeightedGraph gp = new WeightedGraph(max, min, undirected);
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
gp.addEdge(e.src, e.to, e.cost);
}
}
return gp;
}
final void addEdge(int a, int b, final long cost) {
a -= indexed;
b -= indexed;
this.get(a).add(new Edge(a, b, cost, id));
edge.add(new Edge(a, b, cost, id));
if(undirected) {
this.get(b).add(new Edge(b, a, cost, id));
edge.add(new Edge(b, a, cost, id));
}
id++;
}
@Override
protected final void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni(), VvyLw.io.nl())); }
final ShortestPath dijkstra(final int v) {
final long[] cost = new long[n];
final int[] src = new int[n];
Arrays.fill(cost, Long.MAX_VALUE);
Arrays.fill(src, -1);
final Queue<IntPair> dj = new PriorityQueue<>();
cost[v] = 0;
dj.add(IntPair.of(cost[v], v));
while(!dj.isEmpty()) {
final IntPair tmp = dj.poll();
if(cost[tmp.second.intValue()] < tmp.first.longValue()) {
continue;
}
for(final Edge ed: this.get(tmp.second.intValue())) {
final long next = tmp.first.longValue() + ed.cost;
if(cost[ed.to] <= next) {
continue;
}
cost[ed.to] = next;
src[ed.to] = tmp.second.intValue();
dj.add(IntPair.of(cost[ed.to], ed.to));
}
}
return new ShortestPath(cost, src);
}
final long[] spfa(final int v) {
final long[] cost = new long[n];
Arrays.fill(cost, Long.MAX_VALUE);
final boolean[] pend = new boolean[n];
final int[] cnt = new int[n];
final Queue<Integer> q = new ArrayDeque<>();
q.add(v);
pend[v] = true;
cnt[v]++;
cost[v] = 0;
while(!q.isEmpty()) {
final int p = q.poll();
pend[p] = false;
for(final Edge e: this.get(p)) {
final long next = cost[p] + e.cost;
if(next >= cost[e.to]) {
continue;
}
cost[e.to] = next;
if(!pend[e.to]) {
if(++cnt[e.to] >= n) {
return null;
}
pend[e.to] = true;
q.add(e.to);
}
}
}
return cost;
}
final long[][] floydWarshall() {
final long[][] cost = new long[n][n];
IntStream.range(0, n).forEach(i -> Arrays.fill(cost[i], VvyLw.LINF));
IntStream.range(0, n).forEach(i -> cost[i][i] = 0);
for(int i = 0; i < n; ++i) {
for(final Edge j: this.get(i)) {
cost[i][j.to] = j.cost;
}
}
for(int k = 0; k < n; ++k) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
if(cost[i][k] == VvyLw.LINF || cost[k][j] == VvyLw.LINF) {
continue;
}
if(cost[i][j] > cost[i][k] + cost[k][j]) {
cost[i][j] = cost[i][k] + cost[k][j];
}
}
}
}
return cost;
}
final MST kruskal() {
final UnionFind uf = new UnionFind(n);
final ArrayList<Edge> e = new ArrayList<>();
long res = 0;
for(final Edge ed: edge.stream().sorted(Comparator.comparing(ed -> ed.cost)).collect(Collectors.toList())) {
if(uf.unite(ed.src, ed.to)) {
e.add(ed);
res += ed.cost;
}
}
return new MST(e, res);
}
final MST directed(final int v) {
@SuppressWarnings("unchecked")
final ArrayList<Edge> ed = (ArrayList<Edge>) edge.clone();
for(int i = 0; i < n; ++i) {
if(i != v) {
ed.add(new Edge(i, v, 0));
}
}
int x = 0;
final int[] par = new int[2 * n], vis = new int[2 * n], link = new int[2 * n];
Arrays.fill(par, -1);
Arrays.fill(vis, -1);
Arrays.fill(link, -1);
final SkewHeap heap = new SkewHeap(true);
final SkewHeap.Node[] ins = new SkewHeap.Node[2 * n];
Arrays.fill(ins, null);
for(int i = 0; i < ed.size(); i++) {
final Edge e = ed.get(i);
ins[e.to] = heap.push(ins[e.to], e.cost, i);
}
final ArrayList<Integer> st = new ArrayList<>();
final IntUnaryOperator go = z -> {
z = ed.get(ins[z].idx).src;
while(link[z] != -1) {
st.add(z);
z = link[z];
}
for(final int p: st) {
link[p] = z;
}
st.clear();
return z;
};
for(int i = n; ins[x] != null; ++i) {
while(vis[x] == -1) {
vis[x] = 0;
x = go.applyAsInt(x);
}
while(x != i) {
final long w = ins[x].key;
SkewHeap.Node z = heap.pop(ins[x]);
z = heap.add(z, -w);
ins[i] = heap.meld(ins[i], z);
par[x] = i;
link[x] = i;
x = go.applyAsInt(x);
}
while(ins[x] != null && go.applyAsInt(x) == x) {
ins[x] = heap.pop(ins[x]);
}
}
for(int i = v; i != -1; i = par[i]) {
vis[i] = 1;
}
long cost = 0;
final ArrayList<Edge> e = new ArrayList<>();
for(int i = x; i >= 0; i--) {
if(vis[i] == 1) {
continue;
}
cost += ed.get(ins[i].idx).cost;
e.add(ed.get(ins[i].idx));
for(int j = ed.get(ins[i].idx).to; j != -1 && vis[j] == 0; j = par[j]) {
vis[j] = 1;
}
}
return new MST(e, cost);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; ++i) {
final int m = get(i).size();
sb.append(i + ": [");
for(int j = 0; j < m; ++j) {
sb.append("(to: " + get(i).get(j).to + ", cost: " + get(i).get(j).cost + ')');
if(j + 1 < m) {
sb.append(", ");
}
}
sb.append(']');
if(i + 1 < n) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class SkewHeap {
static final class Node {
long key, lazy;
Node l, r;
final int idx;
Node(final long key, final int idx) {
this.key = key;
this.idx = idx;
lazy = 0;
l = null;
r = null;
}
}
private final boolean isMin;
SkewHeap(final boolean isMin){ this.isMin = isMin; }
private final Node alloc(final long key, final int idx){ return new Node(key, idx); }
private final Node propagate(final Node t) {
if(t != null && t.lazy != 0) {
if(t.l != null) {
t.l.lazy += t.lazy;
}
if(t.r != null) {
t.r.lazy += t.lazy;
}
t.key += t.lazy;
t.lazy = 0;
}
return t;
}
final Node meld(Node x, Node y) {
propagate(x);
propagate(y);
if(x == null || y == null) {
return x != null ? x : y;
}
if((x.key < y.key) ^ isMin) {
final Node tmp = x;
x = y;
y = tmp;
}
x.r = meld(y, x.r);
final Node tmp = x.l;
x.l = x.r;
x.r = tmp;
return x;
}
final Node push(final Node t, final long key, final int idx){ return meld(t, alloc(key, idx)); }
final Node pop(final Node t) {
if(t == null) {
throw new NullPointerException();
}
return meld(t.l, t.r);
}
final Node add(final Node t, final long lazy) {
if(t != null) {
t.lazy += lazy;
propagate(t);
}
return t;
}
}
final class SCC {
private final int n, indexed;
private int m;
private final ArrayList<Edge> edge;
private final int[] start, ids;
private int[][] groups;
private boolean notBuilt;
SCC(final int n){ this(n, 1); }
SCC(final int n, final int indexed) {
this.n = n;
this.indexed = indexed;
edge = new ArrayList<>();
start = new int[n + 1];
ids = new int[n];
m = 0;
notBuilt = true;
}
final void addEdge(int from, int to) {
from -= indexed;
to -= indexed;
rangeCheck(from);
rangeCheck(to);
edge.add(new Edge(from, to, m++));
start[from + 1]++;
}
final void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni())); }
final int id(final int i) {
if(notBuilt) {
throw new UnsupportedOperationException("Graph hasn't been built.");
}
rangeCheck(i);
return ids[i];
}
final void build() {
for(int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] ed = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for(final Edge e: edge) {
ed[count[e.src]++] = e;
}
int nowOrd = 0, groupNum = 0, k = 0, ptr = 0;
final int[] par = new int[n], vis = new int[n], low = new int[n], ord = new int[n];
Arrays.fill(ord, -1);
final long[] stack = new long[n];
for(int i = 0; i < n; i++) {
if(ord[i] >= 0) {
continue;
}
par[i] = -1;
stack[ptr++] = 0L << 32 | i;
while(ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & 0xffff_ffffl);
int j = (int) (p >>> 32);
if(j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if(start[u] + j < count[u]) {
int to = ed[start[u] + j].to;
stack[ptr++] += 1l << 32;
if(ord[to] == -1) {
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else {
low[u] = min(low[u], ord[to]);
}
} else {
while(j --> 0) {
final int to = ed[start[u] + j].to;
if(par[to] == u) {
low[u] = min(low[u], low[to]);
}
}
if(low[u] == ord[u]) {
while(true) {
final 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];
}
final int[] counts = new int[groupNum];
for(final int x: ids) {
counts[x]++;
}
groups = new int[groupNum][];
for(int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for(int i = 0; i < n; i++) {
int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
notBuilt = false;
}
final int[][] groups() {
if(notBuilt) {
throw new UnsupportedOperationException("Graph hasn't been built.");
}
return groups;
}
private final void rangeCheck(final int i) {
if(!Utility.scope(0, i, n - 1)) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
final class LowestCommonAncestor {
private final int log;
private final int[] dep, sum;
private final Graph g;
private final int[][] table;
LowestCommonAncestor(final Graph g) {
this.g = g;
final int n = g.size();
dep = new int[n];
sum = new int[n];
log = Integer.toBinaryString(n).length();
table = new int[log][n];
IntStream.range(0, log).forEach(i -> Arrays.fill(table[i], -1));
build();
}
private final void dfs(final int idx, final int par, final int d) {
table[0][idx] = par;
dep[idx] = d;
for(final Edge el: g.get(idx)) {
if(el.to != par) {
sum[el.to] = (int) (sum[idx] + el.cost);
dfs(el.to, idx, d + 1);
}
}
}
private final void build() {
dfs(0, -1, 0);
for(int k = 0; k < log - 1; ++k) {
for(int i = 0; i < table[k].length; ++i) {
if(table[k][i] == -1) {
table[k + 1][i] = -1;
} else {
table[k + 1][i] = table[k][table[k][i]];
}
}
}
}
final int query(int u, int v) {
if(dep[u] > dep[v]) {
u ^= v;
v ^= u;
u ^= v;
}
v = climb(v, dep[v] - dep[u]);
if(u == v) {
return u;
}
for(int i = log; --i >= 0;) {
if(table[i][u] != table[i][v]) {
u = table[i][u];
v = table[i][v];
}
}
return table[0][u];
}
final int climb(int u, final int k) {
if(dep[u] < k) {
return -1;
}
for(int i = log; --i >= 0;) {
if(((k >> i) % 2) == 1) {
u = table[i][u];
}
}
return u;
}
final int dist(final int u, final int v){ return sum[u] + sum[v] - 2 * sum[query(u, v)]; }
}
interface DSU {
int root(final int i);
int size(final int i);
int size();
default boolean same(final int i, final int j){ return root(i) == root(j); }
boolean unite(int i, int j);
ArrayList<ArrayList<Integer>> groups();
}
class UnionFind implements DSU {
protected final int[] par;
UnionFind(final int n) {
par = new int[n];
Arrays.fill(par, -1);
}
@Override
public final int root(final int i){ return par[i] >= 0 ? par[i] = root(par[i]) : i; }
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public boolean unite(int i, int j) {
i = root(i);
j = root(j);
if(i == j) {
return false;
}
if(i > j) {
i ^= j;
j ^= i;
i ^= j;
}
par[i] += par[j];
par[j] = i;
return true;
}
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>(n);
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
}
abstract class MergeUnionFind<T> extends UnionFind {
MergeUnionFind(final int n){ super(n); }
abstract void merge(final int i, final int j);
abstract T get(final int i);
@Override
public final boolean unite(int i, int j) {
i = root(i);
j = root(j);
if(i == j) {
return false;
}
if(i > j) {
i ^= j;
j ^= i;
i ^= j;
}
par[i] += par[j];
par[j] = i;
merge(i, j);
return true;
}
}
final class WeightedUnionFind implements DSU {
private final int[] par;
private final long[] weight;
WeightedUnionFind(final int n) {
par = new int[n];
weight = new long[n];
Arrays.fill(par, -1);
}
@Override
public final int root(final int i) {
if(par[i] < 0) {
return i;
}
final int r = root(par[i]);
weight[i] += weight[par[i]];
return par[i] = r;
}
final long get(final int i) {
root(i);
return weight[i];
}
final long diff(final int x, final int y){ return get(y) - get(x); }
final int unite(int x, int y, long w) {
w += diff(y, x);
x = root(x);
y = root(y);
if(x == y) {
return w == 0 ? 0 : -1;
}
if(par[x] > par[y]) {
x ^= y;
y ^= x;
x ^= y;
w = -w;
}
par[x] += par[y];
par[y] = x;
weight[y] = w;
return 1;
}
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>();
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
// deprecated
@Override
public final boolean unite(final int i, final int j){ return unite(i, j, 0) > 0; }
}
final class UndoUnionFind implements DSU {
private final int[] par;
private final Stack<Pair<Integer, Integer>> his;
UndoUnionFind(final int n) {
par = new int[n];
Arrays.fill(par, -1);
his = new Stack<>();
}
@Override
public final boolean unite(int x, int y) {
x = root(x);
y = root(y);
his.add(Pair.of(x, par[x]));
his.add(Pair.of(y, par[y]));
if(x == y) {
return false;
}
if(par[x] > par[y]) {
x ^= y;
y ^= x;
x ^= y;
}
par[x] += par[y];
par[y] = x;
return true;
}
@Override
public final int root(final int i) {
if(par[i] < 0) {
return i;
}
return root(par[i]);
}
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>();
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
final void undo() {
final Pair<Integer, Integer> pop1 = his.pop(), pop2 = his.pop();
par[pop1.first] = pop1.second;
par[pop2.first] = pop2.second;
}
final void snapshot() {
while(!his.empty()) {
his.pop();
}
}
final void rollback() {
while(!his.empty()) {
undo();
}
}
}
final class PrimeTable {
private final int[] p;
private final boolean[] sieve;
PrimeTable(final int n) {
sieve = new boolean[n + 1];
Arrays.fill(sieve, true);
sieve[0] = sieve[1] = false;
for(int i = 2; i <= n; ++i) {
if(!sieve[i]) {
continue;
}
for(long j = (long) i * i; j <= n; j += i) {
sieve[(int) j] = false;
}
}
final int size = (int) IntStream.rangeClosed(0, n).filter(i -> sieve[i]).count();
int j = 0;
p = new int[size];
for(int i = 2; i <= n; ++i) {
if(sieve[i]) {
p[j++] = i;
}
}
}
final boolean[] table(){ return sieve; }
final int[] get(){ return p; }
}
final class PrimeFactor {
private final int[] spf;
PrimeFactor(final int n) {
spf = Utility.iota(n + 1).toArray();
for(int i = 2; i * i <= n; ++i) {
if(spf[i] != i) {
continue;
}
for(int j = i * i; j <= n; j += i) {
if(spf[j] == j) {
spf[j] = i;
}
}
}
}
final TreeMap<Integer, Integer> get(int n) {
final TreeMap<Integer, Integer> m = new TreeMap<>();
while(n != 1) {
m.merge(spf[n], 1, (a, b) -> (a + b));
n /= spf[n];
}
return m;
}
}
final class PrimeCounter {
private final int sq;
private final boolean[] p;
private final int[] psum;
private final ArrayList<Integer> ps;
PrimeCounter(final long n) {
sq = (int) kthRooti(n, 2);
psum = new int[sq + 1];
p = new PrimeTable(sq).table();
for(int i = 1; i <= sq; ++i) {
psum[i] = psum[i - 1] + (p[i] ? 1 : 0);
}
ps = new ArrayList<>();
for(int i = 1; i <= sq; ++i) {
if(p[i]) {
ps.add(i);
}
}
}
private final long kthRooti(final long n, final int k){ return Utility.kthRoot(n, k); }
private final long p2(final long x, final long y) {
if(x < 4) {
return 0;
}
final long a = pi(y);
final long b = pi(kthRooti(x, 2));
if(a >= b) {
return 0;
}
long sum = (long) (a - 2) * (a + 1) / 2 - (b - 2) * (b + 1) / 2;
for(long i = a; i < b; ++i) {
sum += pi(x / ps.get((int) i));
}
return sum;
}
private final long phi(final long m, final long a) {
if(m < 1) {
return 0;
}
if(a > m) {
return 1;
}
if(a < 1) {
return m;
}
if(m <= (long) ps.get((int) (a - 1)) * ps.get((int) (a - 1))) {
return pi(m) - a + 1;
}
if(m <= (long) ps.get((int) (a - 1)) * ps.get((int) (a - 1)) * ps.get((int) (a - 1)) && m <= sq) {
final long sx = pi(kthRooti(m, 2));
long ans = pi(m) - (long) (sx + a - 2) * (sx - a + 1) / 2;
for(long i = a; i < sx; ++i) {
ans += pi(m / ps.get((int) i));
}
return ans;
}
return phi(m, a - 1) - phi(m / ps.get((int) (a - 1)), a - 1);
}
final long pi(final long n) {
if(n <= sq) {
return psum[(int) n];
}
final long m = kthRooti(n, 3);
final long a = pi(m);
return phi(n, a) + a - 1 - p2(n, m);
}
}
// N <= 1e18;
final class LongPrime {
private static final int bsf(final long x){ return Long.numberOfTrailingZeros(x); }
private static final long gcd(long a, long b) {
a = abs(a);
b = abs(b);
if(a == 0) {
return b;
}
if(b == 0) {
return a;
}
final int shift = bsf(a|b);
a >>= bsf(a);
do {
b >>= bsf(b);
if(a > b) {
a ^= b;
b ^= a;
a ^= b;
}
b -= a;
} while(b > 0);
return a << shift;
}
static final boolean isPrime(final long n) {
if(n <= 1) {
return false;
}
if(n == 2) {
return true;
}
if(n % 2 == 0) {
return false;
}
long d = n - 1;
while(d % 2 == 0) {
d /= 2;
}
final long[] sample = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
for(final long a: sample) {
if(n <= a) {
break;
}
long t = d;
BigInteger y = BigInteger.valueOf(a).modPow(BigInteger.valueOf(t), BigInteger.valueOf(n));
while(t != n - 1 && !y.equals(BigInteger.ONE) && !y.equals(BigInteger.valueOf(n).subtract(BigInteger.ONE))) {
y = y.multiply(y).mod(BigInteger.valueOf(n));
t <<= 1;
}
if(!y.equals(BigInteger.valueOf(n).subtract(BigInteger.ONE)) && t % 2 == 0) {
return false;
}
}
return true;
}
private static final long find(final long n) {
if(isPrime(n)) {
return n;
}
if(n % 2 == 0) {
return 2;
}
long st = 0;
final LongBinaryOperator f = (x, y) -> { return BigInteger.valueOf(x).multiply(BigInteger.valueOf(x)).add(BigInteger.valueOf(y)).mod(BigInteger.valueOf(n)).longValue(); };
while(true) {
st++;
long x = st, y = f.applyAsLong(x, st);
while(true) {
final long p = gcd(y - x + n, n);
if(p == 0 || p == n) {
break;
}
if(p != 1) {
return p;
}
x = f.applyAsLong(x, st);
y = f.applyAsLong(f.applyAsLong(y, st), st);
}
}
}
static final ArrayList<Long> primeFactor(final long n) {
if(n == 1) return new ArrayList<>();
final long x = find(n);
if(x == n) return new ArrayList<>(Arrays.asList(x));
final ArrayList<Long> l = primeFactor(x), r = primeFactor(n / x);
l.addAll(r);
Collections.sort(l);
return l;
}
}
// N > 1e18
final class BigPrime {
private static final int bsf(final long x){ return Long.numberOfTrailingZeros(x); }
private static final BigInteger gcd(BigInteger a, BigInteger b) {
a = a.abs();
b = b.abs();
if(a.equals(BigInteger.ZERO)) {
return b;
}
if(b.equals(BigInteger.ZERO)) {
return a;
}
final int shift = bsf(a.or(b).longValue());
a = a.shiftRight(bsf(a.longValue()));
do {
b = b.shiftRight(bsf(b.longValue()));
if(a.compareTo(b) > 0) {
final BigInteger tmp = b;
b = a;
a = tmp;
}
b = b.subtract(a);
} while(b.compareTo(BigInteger.ZERO) > 0);
return a.shiftLeft(shift);
}
static final boolean isPrime(final BigInteger n) {
if(n.compareTo(BigInteger.ONE) <= 0) {
return false;
}
if(n.equals(BigInteger.TWO)) {
return true;
}
if(n.and(BigInteger.ONE).equals(BigInteger.valueOf(0))) {
return false;
}
BigInteger d = n.subtract(BigInteger.ONE);
while(d.and(BigInteger.ONE).equals(BigInteger.valueOf(0))) {
d = d.shiftRight(1);
}
final long[] sample = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
for(final long a: sample) {
if(n.compareTo(BigInteger.valueOf(a)) <= 0) {
break;
}
BigInteger t = d;
BigInteger y = BigInteger.valueOf(a).modPow(t, n);
while(!t.equals(n.subtract(BigInteger.ONE)) && !y.equals(BigInteger.ONE) && !y.equals(n.subtract(BigInteger.ONE))) {
y = y.multiply(y).mod(n);
t = t.shiftLeft(1);
}
if(!y.equals(n.subtract(BigInteger.ONE)) && t.and(BigInteger.ONE).equals(BigInteger.ZERO)) {
return false;
}
}
return true;
}
private static final BigInteger find(final BigInteger n) {
if(isPrime(n)) {
return n;
}
if(n.and(BigInteger.ONE).equals(BigInteger.ZERO)) {
return BigInteger.TWO;
}
int st = 0;
final BiFunction<BigInteger, Integer, BigInteger> f = (x, y) -> { return x.multiply(x).add(BigInteger.valueOf(y)).mod(n); };
while(true) {
st++;
BigInteger x = BigInteger.valueOf(st), y = f.apply(x, st);
while(true) {
final BigInteger p = gcd(y.subtract(x).add(n), n);
if(p.equals(BigInteger.ZERO) || p.equals(n)) {
break;
}
if(!p.equals(BigInteger.ONE)) {
return p;
}
x = f.apply(x, st);
y = f.apply(f.apply(y, st), st);
}
}
}
static final ArrayList<BigInteger> primeFactor(final BigInteger n) {
if(n.equals(BigInteger.ONE)) {
return new ArrayList<>();
}
final BigInteger x = find(n);
if(x.equals(n)) {
return new ArrayList<>(Arrays.asList(x));
}
final ArrayList<BigInteger> l = primeFactor(x), r = primeFactor(n.divide(x));
l.addAll(r);
Collections.sort(l);
return l;
}
}
final class ModPrime {
private final int len, mod;
private final long[] f, rf;
ModPrime(final int mod, final int sz) {
this.mod = mod;
len = min(sz + 1, mod);
f = new long[len];
rf = new long[len];
init();
}
private final long inv(long x) {
long res = 1, k = mod - 2;
while(k > 0) {
if(k % 2 == 1) {
res = (res * x) % mod;
}
x = (x * x) % mod;
k >>= 1;
}
return res;
}
private final void init() {
f[0] = 1;
for(int i = 0; ++i < len;) {
f[i] = (f[i - 1] * i) % mod;
}
rf[len - 1] = inv(f[len - 1]);
for(int i = len; --i > 0;) {
rf[i - 1] = (rf[i] * i) % mod;
}
}
final long C(final int n, final int k) {
if(k < 0 || n < k) {
return 0;
}
final long a = f[n], b = rf[n - k], c = rf[k], bc = (b * c) % mod;
return (a * bc) % mod;
}
final long P(final int n, final int k) {
if (k < 0 || n < k) {
return 0;
}
final long a = f[n], b = rf[n - k];
return (a * b) % mod;
}
final long H(final int n, final int k) {
if (n == 0 && k == 0) {
return 1;
}
return C(n + k - 1, k);
}
final long fact(final int n){ return f[n]; }
}
final class EulerPhiTable {
private final int[] euler;
EulerPhiTable(final int n) {
euler = Utility.iota(n + 1).toArray();
for(int i = 2; i <= n; ++i) {
if(euler[i] == i) {
for(int j = i; j <= n; j += i) {
euler[j] = euler[j] / i * (i - 1);
}
}
}
}
final int[] get(){ return euler; }
}
final class DP {
static final long knapsack01(final int[] a, final long[] v, final int w) {
final int n = a.length;
final long[] dp = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = w; j >= a[i]; j--) {
if(dp[j - a[i]] != Long.MIN_VALUE) {
if(dp[j - a[i]] + v[i] > dp[j]) {
dp[j] = dp[j - a[i]] + v[i];
}
}
}
}
return Utility.max(dp);
}
static final int knapsack01(final long[] a, final int[] v, final long w) {
final int n = a.length;
final int s = (int) Utility.sum(v);
final long[] dp = new long[s + 1];
Arrays.fill(dp, w + 1);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = s; j >= v[i]; j--) {
dp[j] = Math.min(dp[j], dp[j - v[i]] + a[i]);
}
}
int res = 0;
for(int i = 0; i <= s; i++) {
if(dp[i] <= w) {
res = i;
}
}
return res;
}
private static final long[] knapsack(final int[] a, final long[] v, final int[] m, final int w, final boolean less) {
final int n = a.length;
final long[] dp = new long[w + 1], deqv = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
final int[] deq = new int[w + 1];
for(int i = 0; i < n; ++i) {
if(a[i] == 0) {
for(int j = 0; j <= w; ++j) {
if(dp[j] != Long.MIN_VALUE && (less ? dp[j] + v[i] * m[i] < dp[j] : dp[j] + v[i] * m[i] > dp[j])) {
dp[j] = dp[j] + v[i] * m[i];
}
}
} else {
for(int k = 0; k < a[i]; ++k) {
int s = 0, t = 0;
for(int j = 0; a[i] * j + k <= w; ++j) {
if(dp[a[i] * j + k] != Long.MIN_VALUE) {
final long val = dp[a[i] * j + k] - j * v[i];
while(s < t && (less ? val < deqv[t - 1] : val > deqv[t - 1])) {
t--;
}
deq[t] = j;
deqv[t++] = val;
}
if(s < t) {
dp[j * a[i] + k] = deqv[s] + j * v[i];
if(deq[s] == j - m[i]) {
s++;
}
}
}
}
}
}
return dp;
}
static final long knapsack(final int[] a, final long[] v, final int[] m, final int w){ return Utility.max(knapsack(a, v, m, w, false)); }
static final long knapsack(final long[] a, final int[] v, final long[] m, final long w) {
final int n = a.length;
final int max = Utility.max(v);
if(max == 0) {
return 0;
}
final int[] ma = new int[n];
final long[] mb = new long[n];
for(int i = 0; i < n; i++) {
ma[i] = (int) Math.min(m[i], max - 1);
mb[i] = m[i] - ma[i];
}
int sum = 0;
for(int i = 0; i < n; ++i) {
sum += ma[i] * v[i];
}
final long[] dp = knapsack(v, a, ma, sum, true);
final int[] id = Utility.iota(n).boxed().sorted((i, j) -> -Long.compare(v[i] * a[j], v[j] * a[i])).mapToInt(i -> i).toArray();
long res = 0;
for(int i = 0; i < dp.length; ++i) {
if(dp[i] > w || dp[i] == Long.MIN_VALUE) {
continue;
}
long rest = w - dp[i], cost = i;
for(final int j: id) {
final long get = Math.min(mb[j], rest / a[j]);
if(get <= 0) {
continue;
}
cost += get * v[j];
rest -= get * a[j];
}
res = Math.max(res, cost);
}
return res;
}
static final long knapsack(final int[] a, final long[] v, final int w) {
final int n = a.length;
final long[] dp = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = a[i]; j <= w; j++) {
if(dp[j - a[i]] != Long.MIN_VALUE) {
if(dp[j - a[i]] + v[i] > dp[j]) {
dp[j] = dp[j - a[i]] + v[i];
}
}
}
}
return Utility.max(dp);
}
static final long maxRectangle(final int[] a) {
final Stack<Integer> sk = new Stack<>();
final long[] h = new long[a.length + 1];
for(int i = 0; i < a.length; ++i) {
h[i] = a[i];
}
final int[] l = new int[h.length];
long res = 0;
for(int i = 0; i < h.length; i++) {
while(!sk.isEmpty() && h[sk.peek()] >= h[i]) {
res = max(res, (i - l[sk.peek()] - 1) * h[sk.pop()]);
}
l[i] = sk.isEmpty() ? -1 : sk.peek();
sk.add(i);
}
return res;
}
static final long maxRectangle(final long[] a) {
final Stack<Integer> sk = new Stack<>();
final long[] h = Arrays.copyOf(a, a.length + 1);
final int[] l = new int[h.length];
long res = 0;
for(int i = 0; i < h.length; i++) {
while(!sk.isEmpty() && h[sk.peek()] >= h[i]) {
res = max(res, (i - l[sk.peek()] - 1) * h[sk.pop()]);
}
l[i] = sk.isEmpty() ? -1 : sk.peek();
sk.add(i);
}
return res;
}
static final int lcs(final String s, final String t) {
final int n = s.length();
final int[] dp = new int[n + 1], ndp = new int[n + 1];
for(int i = 0; i < t.length(); ++i) {
for(int j = 0; j < n; ++j) {
if(s.charAt(j) == t.charAt(i)) {
ndp[j + 1] = dp[j] + 1;
} else {
ndp[j + 1] = max(ndp[j], dp[j + 1]);
}
}
Utility.swap(dp, ndp);
}
return dp[n];
}
static final int[] lis(final int[] a) {
final int n = a.length;
List<IntPair> dp = new ArrayList<IntPair>();
final int[] p = new int[n];
Arrays.fill(p, -1);
for(int i = 0; i < n; ++i) {
final int id = Utility.lowerBound(dp, IntPair.of(a[i], -i));
if(id != 0) {
p[i] = -dp.get(id - 1).second.intValue();
}
if(id == dp.size()) {
dp.add(IntPair.of(a[i], -i));
} else {
dp.set(id, IntPair.of(a[i], -i));
}
}
final List<Integer> res = new ArrayList<Integer>();
for(int i = -dp.get(dp.size() - 1).second.intValue(); i != -1; i = p[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(i -> i).toArray();
}
static final int[] lis(final long[] a) {
final int n = a.length;
List<IntPair> dp = new ArrayList<IntPair>();
final int[] p = new int[n];
Arrays.fill(p, -1);
for(int i = 0; i < n; ++i) {
final int id = Utility.lowerBound(dp, IntPair.of(a[i], -i));
if(id != 0) {
p[i] = -dp.get(id - 1).second.intValue();
}
if(id == n) {
dp.add(IntPair.of(a[i], -i));
} else {
dp.set(id, IntPair.of(a[i], -i));
}
}
final List<Integer> res = new ArrayList<Integer>();
for(int i = -dp.get(dp.size() - 1).second.intValue(); i != -1; i = p[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(i -> i).toArray();
}
}
final class Matrix implements Cloneable {
private final int h, w;
private final long[][] mat;
Matrix(final int n){ this(n, n); }
Matrix(final int h, final int w) {
this.h = h;
this.w = w;
mat = new long[h][w];
}
Matrix(final int[][] m) {
this(m.length, m[0].length);
IntStream.range(0, h).forEach(i -> Arrays.setAll(mat[i], j -> m[i][j]));
}
Matrix(final long[][] m) {
this(m.length, m[0].length);
IntStream.range(0, h).forEach(i -> Arrays.setAll(mat[i], j -> m[i][j]));
}
static final Matrix E(final int n) {
final Matrix m = new Matrix(n);
IntStream.range(0, n).forEach(i -> m.set(i, i, 1));
return m;
}
final long[] getH(final int i){ return mat[i]; }
final long[] getW(final int i){ return IntStream.range(0, h).mapToLong(j -> mat[j][i]).toArray(); }
final long[][] get(){ return mat; }
final long get(final int i, final int j){ return mat[i][j]; }
final void set(final int i, final int j, final long x){ mat[i][j] = x; }
final Matrix add(final Matrix m) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, mat[i][j] + m.get(i, j));
}
}
return mt;
}
final Matrix add(final Matrix m, final long mod) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, Utility.mod(mat[i][j] + m.get(i, j), mod));
}
}
return mt;
}
final Matrix sub(final Matrix m) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, mat[i][j] - m.get(i, j));
}
}
return mt;
}
final Matrix sub(final Matrix m, final long mod) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, Utility.mod(mat[i][j] - m.get(i, j), mod));
}
}
return mt;
}
final Matrix mul(final Matrix m) {
assert w == m.h;
final Matrix mt = new Matrix(h, m.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < m.w; ++j) {
for(int k = 0; k < w; ++k) {
mt.set(i, j, mt.get(i, j) + mat[i][k] * m.get(k, j));
}
}
}
return mt;
}
final Matrix mul(final Matrix m, final long mod) {
assert w == m.h;
final Matrix mt = new Matrix(h, m.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < m.w; ++j) {
for(int k = 0; k < w; ++k) {
mt.set(i, j, Utility.mod(mt.get(i, j) + mat[i][k] * m.get(k, j), mod));
}
}
}
return mt;
}
final Matrix pow(int k) {
Matrix n = clone();
Matrix m = Matrix.E(h);
while(k > 0) {
if(k % 2 == 1) {
m = m.mul(n);
}
n = n.mul(n);
k >>= 1;
}
return m;
}
final Matrix pow(long k, final long mod) {
Matrix n = clone();
Matrix m = Matrix.E(h);
while(k > 0) {
if(k % 2 == 1) {
m = m.mul(n, mod);
}
n = n.mul(n, mod);
k >>= 1L;
}
return m;
}
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Matrix m = (Matrix) o;
if(h != m.h || w != m.w) {
return false;
}
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
if(mat[i][j] != m.get(i, j)) {
return false;
}
}
}
return true;
}
@Override
public final Matrix clone() {
final Matrix m = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
m.mat[i] = Arrays.copyOf(mat[i], w);
}
return m;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
final int interval = String.valueOf(IntStream.range(0, h).mapToLong(i -> IntStream.range(0, w).mapToLong(j -> mat[i][j]).max().getAsLong()).max().getAsLong()).length() + 1;
for(int i = 0; i < h; ++i) {
sb.append("[");
for(int j = 0; j < w; ++j) {
sb.append(String.format("%" + interval + "d", mat[i][j]));
if(j + 1 == w) {
sb.append("]");
}
}
if(i + 1 != h) {
sb.append("\n");
}
}
return sb.toString();
}
}
class InclusiveScan {
protected final int n;
protected long[] s;
protected InclusiveScan(final int n) {
this.n = n;
s = new long[n + 1];
}
InclusiveScan(final int[] a, final LongBinaryOperator op) {
n = a.length;
s = Arrays.stream(a).asLongStream().toArray();
Arrays.parallelPrefix(s, op);
}
InclusiveScan(final long[] a, final LongBinaryOperator op) {
n = a.length;
s = a.clone();
Arrays.parallelPrefix(s, op);
}
protected final long[] get(){ return s; }
}
final class PrefixSum extends InclusiveScan {
private boolean built;
PrefixSum(final int n) {
super(n);
built = false;
}
PrefixSum(final int[] a) {
super(a, Long::sum);
s = Utility.rotate(Arrays.copyOf(s, n + 1), -1);
}
PrefixSum(final long[] a) {
super(a, Long::sum);
s = Utility.rotate(Arrays.copyOf(s, n + 1), -1);
}
final long sum(final int l, final int r){ return s[r] - s[l]; }
final void add(final int l, final int r, final long x) {
if(built) {
throw new UnsupportedOperationException("Prefix Sum has been built.");
}
s[l] += x;
s[r] -= x;
}
final long[] build() {
assert !built;
Arrays.parallelPrefix(s, Long::sum);
built = true;
return Arrays.copyOf(s, n);
}
}
final class PrefixSum2D {
private final int h, w;
private final long[][] data;
private boolean built;
PrefixSum2D(final int h, final int w) {
this.h = h + 3;
this.w = w + 3;
data = new long[this.h][this.w];
built = false;
}
PrefixSum2D(final int[][] a) {
this(a.length, a[0].length);
for(int i = 0; i < a.length; ++i) {
for(int j = 0; j < a[i].length; ++j) {
add(i, j, a[i][j]);
}
}
}
PrefixSum2D(final long[][] a) {
this(a.length, a[0].length);
for(int i = 0; i < a.length; ++i) {
for(int j = 0; j < a[i].length; ++j) {
add(i, j, a[i][j]);
}
}
}
final void add(int i, int j, final long x) {
if(built) {
throw new UnsupportedOperationException("Prefix Sum 2D has been built.");
}
i++;
j++;
if(i >= h || j >= w) {
return;
}
data[i][j] += x;
}
final void add(final int i1, final int j1, final int i2, final int j2, final long x) {
add(i1, j1, x);
add(i1, j2, -x);
add(i2, j1, -x);
add(i2, j2, x);
}
final void build() {
assert !built;
for(int i = 0; ++i < h;) {
for(int j = 0; ++j < w;) {
data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];
}
}
built = true;
}
final long get(final int i1, final int j1, final int i2, final int j2) {
if(!built) {
throw new UnsupportedOperationException("Prefix Sum 2D hasn't been built.");
}
return data[i2][j2] - data[i1][j2] - data[i2][j1] + data[i1][j1];
}
final long get(final int i, final int j) {
if(!built) {
throw new UnsupportedOperationException("Prefix Sum 2D hasn't been built.");
}
return data[i + 1][j + 1];
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < h - 3; ++i) {
sb.append(get(i, 0));
for(int j = 0; ++j < w - 3;) {
sb.append(" " + get(i, j));
}
if(i + 1 < h) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class SuffixArray extends ArrayList<Integer> {
private final String vs;
SuffixArray(final String vs, final boolean compress) {
this.vs = vs;
final int[] newVS = new int[vs.length() + 1];
if(compress) {
final List<Integer> xs = vs.chars().sorted().distinct().boxed().collect(Collectors.toList());
for(int i = 0; i < vs.length(); ++i) {
newVS[i] = Utility.lowerBound(xs, (int) vs.charAt(i)) + 1;
}
} else {
final int d = vs.chars().min().getAsInt();
for(int i = 0; i < vs.length(); ++i) {
newVS[i] = vs.charAt(i) - d + 1;
}
}
this.addAll(Arrays.stream(SAIS(newVS)).boxed().collect(Collectors.toList()));
}
private final int[] SAIS(final int[] s) {
final int n = s.length;
final int[] ret = new int[n];
final boolean[] isS = new boolean[n], isLMS = new boolean[n];
int m = 0;
for(int i = n - 2; i >= 0; i--) {
isS[i] = (s[i] > s[i + 1]) || (s[i] == s[i + 1] && isS[i + 1]);
m += (isLMS[i + 1] = isS[i] && !isS[i + 1]) ? 1 : 0;
}
final Consumer<ArrayList<Integer>> inducedSort = (lms) -> {
final int upper = Arrays.stream(s).max().getAsInt();
final int[] l = new int[upper + 2], r = new int[upper + 2];
for(final int v: s) {
++l[v + 1];
++r[v];
}
Arrays.parallelPrefix(l, (x, y) -> x + y);
Arrays.parallelPrefix(r, (x, y) -> x + y);
Arrays.fill(ret, -1);
for(int i = lms.size(); --i >= 0;) {
ret[--r[s[lms.get(i)]]] = lms.get(i);
}
for(final int v: ret) {
if(v >= 1 && isS[v - 1]) {
ret[l[s[v - 1]]++] = v - 1;
}
}
Arrays.fill(r, 0);
for(final int v: s) {
++r[v];
}
Arrays.parallelPrefix(r, (x, y) -> x + y);
for(int k = ret.length - 1, i = ret[k]; k >= 1; i = ret[--k]) {
if(i >= 1 && !isS[i - 1]) {
ret[--r[s[i - 1]]] = i - 1;
}
}
};
final ArrayList<Integer> lms = new ArrayList<>(), newLMS = new ArrayList<>();
for(int i = 0; ++i < n;) {
if(isLMS[i]) {
lms.add(i);
}
}
inducedSort.accept(lms);
for(int i = 0; i < n; ++i) {
if(!isS[ret[i]] && ret[i] > 0 && isS[ret[i] - 1]) {
newLMS.add(ret[i]);
}
}
final BiPredicate<Integer, Integer> same = (a, b) -> {
if(s[a++] != s[b++]) {
return false;
}
while(true) {
if(s[a] != s[b]) {
return false;
}
if(isLMS[a] || isLMS[b]) {
return isLMS[a] && isLMS[b];
}
a++;
b++;
}
};
int rank = 0;
ret[n - 1] = 0;
for(int i = 0; ++i < m;) {
if(!same.test(newLMS.get(i - 1), newLMS.get(i))) {
++rank;
}
ret[newLMS.get(i)] = rank;
}
if(rank + 1 < m) {
final int[] newS = new int[m];
for(int i = 0; i < m; ++i) {
newS[i] = ret[lms.get(i)];
}
final var lmsSA = SAIS(newS);
IntStream.range(0, m).forEach(i -> newLMS.set(i, lms.get(lmsSA[i])));
}
inducedSort.accept(newLMS);
return ret;
}
private final boolean ltSubstr(final String t, int si, int ti) {
final int sn = vs.length(), tn = t.length();
while(si < sn && ti < tn) {
if(vs.charAt(si) < t.charAt(ti)) {
return true;
}
if(vs.charAt(si) > t.charAt(ti)) {
return false;
}
++si;
++ti;
}
return si >= sn && ti < tn;
}
final int lowerBound(final String t) {
int ok = this.size(), ng = 0;
while(ok - ng > 1) {
final int mid = (ok + ng) / 2;
if(ltSubstr(t, this.get(mid), 0)) {
ng = mid;
} else {
ok = mid;
}
}
return ok;
}
final Pair<Integer, Integer> equalRange(final String t) {
final int low = lowerBound(t);
int ng = low - 1, ok = this.size();
final StringBuilder sb = new StringBuilder(t);
sb.setCharAt(t.length() - 1, (char)(sb.charAt(sb.length() - 1) - 1));
final String u = sb.toString();
while(ok - ng > 1) {
final int mid = (ok + ng) / 2;
if(ltSubstr(u, this.get(mid), 0)) {
ng = mid;
} else {
ok = mid;
}
}
final int end = this.size() - 1;
this.add(end, this.get(end) - 1);
return Pair.of(low, ok);
}
final int[] lcpArray() {
final int n = this.size() - 1;
final int[] lcp = new int[n + 1], rank = new int[n + 1];
for(int i = 0; i <= n; ++i) {
rank[this.get(i)] = i;
}
int h = 0;
for(int i = 0; i <= n; ++i) {
if(rank[i] < n) {
final int j = this.get(rank[i] + 1);
for(; j + h < n && i + h < n; ++h) {
if(vs.charAt(j + h) != vs.charAt(i + h)) {
break;
}
}
lcp[rank[i] + 1] = h;
if(h > 0) {
h--;
}
}
}
return lcp;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < this.size(); ++i) {
sb.append(i + ":[" + this.get(i) + "]");
for(int j = this.get(i); j < vs.length(); ++j) {
sb.append(" " + vs.charAt(j));
}
if(i + 1 != this.size()) {
sb.append("\n");
}
}
return sb.toString();
}
}
final class Deque<T> implements Iterable<T> {
private int n, head, tail;
private Object[] buf;
Deque(){ this(1 << 17); }
private Deque(final int n) {
this.n = n;
head = tail = 0;
buf = new Object[n];
}
Deque(final T[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
private final int next(final int index) {
final int next = index + 1;
return next == n ? 0 : next;
}
private final int prev(final int index) {
final int prev = index - 1;
return prev == -1 ? n - 1 : prev;
}
private final int index(final int i) {
final int size = size();
assert i < size;
final int id = head + i;
return n <= id ? id - n : id;
}
private final void arraycopy(final int fromId, final T[] a, final int from, final int len) {
assert fromId + len <= size();
final int h = index(fromId);
if(h + len < n) {
System.arraycopy(buf, h, a, from, len);
} else {
final int back = n - h;
System.arraycopy(buf, h, a, from, back);
System.arraycopy(buf, 0, a, from + back, len - back);
}
}
@SuppressWarnings("unchecked")
private final void extend() {
final Object[] tmp = new Object[n << 1];
arraycopy(0, (T[]) tmp, 0, size());
buf = tmp;
n = buf.length;
}
final boolean isEmpty(){ return size() == 0; }
final int size() {
final int size = tail - head;
return size < 0 ? size + n : size;
}
final void addFirst(final T x) {
if(prev(head) == tail) {
extend();
}
head = prev(head);
buf[head] = x;
}
final void addLast(final T x) {
if(next(tail) == head) {
extend();
}
buf[tail] = x;
tail = next(tail);
}
final void removeFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
head = next(head);
}
final void removeLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
}
@SuppressWarnings("unchecked")
final T pollFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
final T ans = (T) buf[head];
head = next(head);
return ans;
}
@SuppressWarnings("unchecked")
final T pollLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
return (T) buf[tail];
}
final T peekFirst(){ return get(0); }
final T peekLast(){ return get(n - 1); }
@SuppressWarnings("unchecked")
final T get(final int i){ return (T) buf[index(i)]; }
final void set(final int i, final T x){ buf[index(i)] = x; }
final void add(final T x){ addLast(x); }
final T poll(){ return pollFirst(); }
final T peek(){ return peekFirst(); }
@SuppressWarnings("unchecked")
final void swap(final int a, final int b) {
final int i = index(a), j = index(b);
final T num = (T) buf[i];
buf[i] = buf[j];
buf[j] = num;
}
final void clear(){ head = tail = 0; }
@SuppressWarnings("unchecked")
final T[] toArray() {
final Object[] array = new Object[size()];
arraycopy(0, (T[]) array, 0, size());
return (T[]) array;
}
@Override
public final String toString(){ return Arrays.toString(toArray()); }
@Override
public final Iterator<T> iterator(){ return new DequeIterator(); }
private class DequeIterator implements Iterator<T> {
private int now = head;
private int rem = size();
@Override
public boolean hasNext(){ return rem > 0; }
@Override
public final T next() {
if(!hasNext()) {
throw new NoSuchElementException();
}
@SuppressWarnings("unchecked")
final T res = (T) buf[now];
now = (now + 1) % n;
rem--;
return res;
}
@Override
public final void remove() {
if(isEmpty()) {
throw new IllegalStateException();
}
now = (now - 1 + n) % n;
buf[now] = null;
head = (head + 1) % n;
rem++;
}
}
}
final class IntDeque {
private int n, head, tail;
private long[] buf;
IntDeque(){ this(1 << 17); }
private IntDeque(final int n) {
this.n = n;
head = tail = 0;
buf = new long[n];
}
IntDeque(final int[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
IntDeque(final long[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
private final int next(final int index) {
final int next = index + 1;
return next == n ? 0 : next;
}
private final int prev(final int index) {
final int prev = index - 1;
return prev == -1 ? n - 1 : prev;
}
private final int index(final int i) {
final int size = size();
assert i < size;
final int id = head + i;
return n <= id ? id - n : id;
}
private final void arraycopy(final int fromId, final long[] a, final int from, final int len) {
assert fromId + len <= size();
final int h = index(fromId);
if(h + len < n) {
System.arraycopy(buf, h, a, from, len);
} else {
final int back = n - h;
System.arraycopy(buf, h, a, from, back);
System.arraycopy(buf, 0, a, from + back, len - back);
}
}
private final void extend() {
final long[] tmp = new long[n << 1];
arraycopy(0, tmp, 0, size());
buf = tmp;
n = buf.length;
}
final boolean isEmpty(){ return size() == 0; }
final int size() {
final int size = tail - head;
return size < 0 ? size + n : size;
}
final void addFirst(final long x) {
head = prev(head);
if(head == tail) {
extend();
}
buf[head] = x;
}
final void addLast(final long x) {
if(next(tail) == head) {
extend();
}
buf[tail] = x;
tail = next(tail);
}
final void removeFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
head = next(head);
}
final void removeLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
}
final long pollFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
final long ans = buf[head];
head = next(head);
return ans;
}
final long pollLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
return buf[tail];
}
final long peekFirst(){ return get(0); }
final long peekLast(){ return get(n - 1); }
final long get(final int i){ return buf[index(i)]; }
final void set(final int i, final long x){ buf[index(i)] = x; }
final void add(final long x){ addLast(x); }
final long poll(){ return pollFirst(); }
final long peek(){ return peekFirst(); }
final void swap(final int a, final int b) {
final int i = index(a);
final int j = index(b);
final long num = buf[i];
buf[i] = buf[j];
buf[j] = num;
}
final void clear(){ head = tail = 0; }
final long[] toArray(){ return Arrays.copyOf(buf, size()); }
@Override
public final String toString(){ return Arrays.toString(toArray()); }
}
final class AVLTree<T extends Comparable<? super T>> {
static final class Node<T extends Comparable<? super T>> {
T val;
@SuppressWarnings("unchecked")
Node<T>[] ch = new Node[2];
int dep, size;
Node(final T val, final Node<T> l, final Node<T> r) {
this.val = val;
dep = size = 1;
ch[0] = l;
ch[1] = r;
}
}
private Node<T> root;
private final int depth(final Node<T> t){ return t == null ? 0 : t.dep; }
private final int count(final Node<T> t){ return t == null ? 0 : t.size; }
private final Node<T> update(final Node<T> t) {
t.dep = max(depth(t.ch[0]), depth(t.ch[1])) + 1;
t.size = count(t.ch[0]) + count(t.ch[1]) + 1;
return t;
}
private final Node<T> rotate(Node<T> t, final int b) {
Node<T> s = t.ch[1 - b];
t.ch[1 - b] = s.ch[b];
s.ch[b] = t;
t = update(t);
s = update(s);
return s;
}
private final Node<T> fetch(Node<T> t) {
if(t == null) {
return t;
}
if(depth(t.ch[0]) - depth(t.ch[1]) == 2) {
if(depth(t.ch[0].ch[1]) > depth(t.ch[0].ch[0])) {
t.ch[0] = rotate(t.ch[0], 0);
}
t = rotate(t, 1);
}
else if(depth(t.ch[0]) - depth(t.ch[1]) == -2) {
if (depth(t.ch[1].ch[0]) > depth(t.ch[1].ch[1])) {
t.ch[1] = rotate(t.ch[1], 1);
}
t = rotate(t, 0);
}
return t;
}
private final Node<T> insert(final Node<T> t, final int k, final T v) {
if(t == null) {
return new Node<T>(v, null, null);
}
final int c = count(t.ch[0]), b = (k > c) ? 1 : 0;
t.ch[b] = insert(t.ch[b], k - (b == 1 ? (c + 1) : 0), v);
update(t);
return fetch(t);
}
private final Node<T> erase(final Node<T> t) {
if(t == null || t.ch[0] == null && t.ch[1] == null) {
return null;
}
if(t.ch[0] == null || t.ch[1] == null) {
return t.ch[t.ch[0] == null ? 1 : 0];
}
return fetch(update(new Node<T>(find(t.ch[1], 0).val, t.ch[0], erase(t.ch[1], 0))));
}
private final Node<T> erase(Node<T> t, final int k) {
if(t == null) {
return null;
}
final int c = count(t.ch[0]);
if(k < c) {
t.ch[0] = erase(t.ch[0], k);
t = update(t);
}
else if(k > c) {
t.ch[1] = erase(t.ch[1], k - (c + 1));
t = update(t);
}
else {
t = erase(t);
}
return fetch(t);
}
private final Node<T> find(final Node<T> t, final int k) {
if(t == null) {
return t;
}
final int c = count(t.ch[0]);
return k < c ? find(t.ch[0], k) : k == c ? t : find(t.ch[1], k - (c + 1));
}
private final int cnt(final Node<T> t, final T v) {
if(t == null) {
return 0;
}
if(t.val.compareTo(v) < 0) {
return count(t.ch[0]) + 1 + cnt(t.ch[1], v);
}
if(t.val.equals(v)) {
return count(t.ch[0]);
}
return cnt(t.ch[0], v);
}
AVLTree(){ root = null; }
final void add(final T val){ root = insert(root, cnt(root, val), val); }
final void remove(final int k){ root = erase(root, k); }
final T get(final int k){ return find(root, k).val; }
final int count(final T val){ return cnt(root, val); }
final int size(){ return root.size; }
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < root.size;) {
sb.append(" ");
sb.append(get(i));
}
return "[" + sb.toString() + "]";
}
}
final class DoubleEndedPriorityQueue<T extends Number> {
private final ArrayList<T> d;
DoubleEndedPriorityQueue(final ArrayList<T> d) {
this.d = d;
makeHeap();
}
private final void makeHeap() {
for(int i = d.size(); i-- > 0;) {
if (i % 2 == 1 && d.get(i - 1).longValue() < d.get(i).longValue()) {
Collections.swap(d, i - 1, i);
}
up(down(i), i);
}
}
private final int down(int k) {
final int n = d.size();
if(k % 2 == 1) {
while(2 * k + 1 < n) {
int c = 2 * k + 3;
if(n <= c || d.get(c - 2).longValue() < d.get(c).longValue()) {
c -= 2;
}
if(c < n && d.get(c).longValue() < d.get(k).longValue()) {
Collections.swap(d, k, c);
k = c;
}
else {
break;
}
}
} else {
while(2 * k + 2 < n) {
int c = 2 * k + 4;
if(n <= c || d.get(c).longValue() < d.get(c - 2).longValue()) {
c -= 2;
}
if(c < n && d.get(k).longValue() < d.get(c).longValue()) {
Collections.swap(d, k, c);
k = c;
}
else {
break;
}
}
}
return k;
}
private final int up(int k, final int root) {
if((k | 1) < d.size() && d.get(k & ~1).longValue() < d.get(k | 1).longValue()) {
Collections.swap(d, k & ~1, k | 1);
k ^= 1;
}
int p;
while(root < k && d.get(p = parent(k)).longValue() < d.get(k).longValue()) {
Collections.swap(d, p, k);
k = p;
}
while(root < k && d.get(k).longValue() < d.get(p = parent(k) | 1).longValue()) {
Collections.swap(d, p, k);
k = p;
}
return k;
}
private final int parent(final int k){ return ((k >> 1) - 1) & ~1; }
private final void popBack(final ArrayList<T> d){ d.remove(d.size() - 1); }
final void push(final T x) {
final int k = d.size();
d.add(x);
up(k, 1);
}
final T popMin() {
final T res = getMin();
if(d.size() < 3) {
popBack(d);
} else {
Collections.swap(d, 1, d.size() - 1);
popBack(d);
up(down(1), 1);
}
return res;
}
final T popMax() {
final T res = getMax();
if(d.size() < 2) {
popBack(d);
} else {
Collections.swap(d, 0, d.size() - 1);
popBack(d);
up(down(0), 1);
}
return res;
}
final T getMin(){ return d.size() < 2 ? d.get(0) : d.get(1); }
final T getMax(){ return d.get(0); }
final int size(){ return d.size(); }
final boolean isEmpty(){ return d.isEmpty(); }
}
final class FenwickTree {
private final int n;
private final long[] data;
FenwickTree(final int n) {
this.n = n + 2;
data = new long[this.n + 1];
}
FenwickTree(final int[] a) {
this(a.length);
IntStream.range(0, a.length).forEach(i -> add(i, a[i]));
}
FenwickTree(final long[] a) {
this(a.length);
IntStream.range(0, a.length).forEach(i -> add(i, a[i]));
}
final long sum(int k) {
if(k < 0) {
return 0;
}
long ret = 0;
for(++k; k > 0; k -= k & -k) {
ret += data[k];
}
return ret;
}
final long sum(final int l, final int r){ return sum(r) - sum(l - 1); }
final long get(final int k){ return sum(k) - sum(k - 1); }
final void add(int k, final long x) {
for(++k; k < n; k += k & -k) {
data[k] += x;
}
}
final void add(final int l, final int r, final long x) {
add(l, x);
add(r + 1, -x);
}
private final int lg(final int n){ return 31 - Integer.numberOfLeadingZeros(n); }
final int lowerBound(long w) {
if(w <= 0) {
return 0;
}
int x = 0;
for(int k = 1 << lg(n); k > 0; k >>= 1) {
if(x + k <= n - 1 && data[x + k] < w) {
w -= data[x + k];
x += k;
}
}
return x;
}
final int upperBound(long w) {
if(w < 0) {
return 0;
}
int x = 0;
for(int k = 1 << lg(n); k > 0; k >>= 1) {
if(x + k <= n - 1 && data[x + k] <= w) {
w -= data[x + k];
x += k;
}
}
return x;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(sum(0));
for(int i = 0; ++i < n - 2;) {
sb.append(" " + sum(i));
}
return sb.toString();
}
}
final class RangeBIT {
private final int n;
private final FenwickTree a, b;
RangeBIT(final int n) {
this.n = n;
a = new FenwickTree(n + 1);
b = new FenwickTree(n + 1);
}
RangeBIT(final int[] arr) {
this(arr.length);
for(int i = 0; i < arr.length; ++i) {
add(i, i, arr[i]);
}
}
RangeBIT(final long[] arr) {
this(arr.length);
for(int i = 0; i < arr.length; ++i) {
add(i, i, arr[i]);
}
}
final void add(final int l, final int r, final long x) {
a.add(l, x);
a.add(r, -x);
b.add(l, x * (1 - l));
b.add(r, x * (r - 1));
}
final long get(final int i){ return sum(i, i + 1); }
final long sum(int l, int r) {
l--;
r--;
return a.sum(r) * r + b.sum(r) - a.sum(l) * l - b.sum(l);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class SegmentTree<T> {
private int n = 1, rank = 0;
private final int fini;
private final BinaryOperator<T> op;
private final T e;
private final Object[] dat;
SegmentTree(final int fini, final BinaryOperator<T> op, final T e) {
this.fini = fini;
this.op = op;
this.e = e;
while(this.fini > n) {
n <<= 1;
rank++;
}
dat = new Object[2 * n];
Arrays.fill(dat, e);
}
SegmentTree(final T[] a, final BinaryOperator<T> op, final T e) {
this(a.length, op, e);
IntStream.range(0, a.length).forEach(i -> update(i, a[i]));
}
@SuppressWarnings("unchecked")
final void update(int i, final T x) {
i += n;
dat[i] = x;
do {
i >>= 1;
dat[i] = op.apply((T) dat[2 * i], (T) dat[2 * i + 1]);
} while(i > 0);
}
final T get(final int i){ return query(i, i + 1); }
@SuppressWarnings("unchecked")
final T query(int a, int b) {
T l = e, r = e;
for(a += n, b += n; a < b; a >>= 1, b >>= 1) {
if(a % 2 == 1) {
l = op.apply(l, (T) dat[a++]);
}
if(b % 2 == 1) {
r = op.apply((T) dat[--b], r);
}
}
return op.apply(l, r);
}
@SuppressWarnings("unchecked")
final T all(){ return (T) dat[1]; }
@SuppressWarnings("unchecked")
final int findLeft(final int r, final Predicate<T> fn) {
if(r == 0) {
return 0;
}
int h = 0, i = r + n;
T val = e;
for(; h <= rank; h++) {
if(i >> (h & 1) > 0) {
final T val2 = op.apply(val, (T) dat[i >> (h ^ 1)]);
if(fn.test(val2)){
i -= 1 << h;
if(i == n) {
return 0;
}
val = val2;
}
else {
break;
}
}
}
for(; h-- > 0;) {
final T val2 = op.apply(val, (T) dat[(i >> h) - 1]);
if(fn.test(val2)){
i -= 1 << h;
if(i == n) {
return 0;
}
val = val2;
}
}
return i - n;
}
@SuppressWarnings("unchecked")
final int findRight(final int l, final Predicate<T> fn) {
if(l == fini) {
return fini;
}
int h = 0, i = l + n;
T val = e;
for(; h <= rank; h++) {
if(i >> (h & 1) > 0){
final T val2 = op.apply(val, (T) dat[i >> h]);
if(fn.test(val2)){
i += 1 << h;
if(i == n * 2) {
return fini;
}
val = val2;
}
else {
break;
}
}
}
for(; h-- > 0;) {
final T val2 = op.apply(val, (T) dat[i >> h]);
if(fn.test(val2)) {
i += 1 << h;
if(i == n * 2) {
return fini;
}
val = val2;
}
}
return min(i - n, fini);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < fini;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
class LazySegmentTree<T, U extends Comparable<? super U>> {
private final int n;
private int sz, h;
private final Object[] data, lazy;
private final BinaryOperator<T> f;
private final BiFunction<T, U, T> map;
private final BinaryOperator<U> comp;
private final T e;
private final U id;
@SuppressWarnings("unchecked")
private final void update(final int k){ data[k] = f.apply((T) data[2 * k], (T) data[2 * k + 1]); }
@SuppressWarnings("unchecked")
private final void allApply(final int k, final U x) {
data[k] = map.apply((T) data[k], x);
if(k < sz) {
lazy[k] = comp.apply((U) lazy[k], x);
}
}
@SuppressWarnings("unchecked")
private final void propagate(final int k) {
if(!lazy[k].equals(id)) {
allApply(2 * k, (U) lazy[k]);
allApply(2 * k + 1, (U) lazy[k]);
lazy[k] = id;
}
}
LazySegmentTree(final int n, final BinaryOperator<T> f, final BiFunction<T, U, T> map, final BinaryOperator<U> comp, final T e, final U id) {
this.n = n;
this.f = f;
this.map = map;
this.comp = comp;
this.e = e;
this.id = id;
sz = 1;
h = 0;
while(sz < n) {
sz <<= 1;
h++;
}
data = new Object[2 * sz];
Arrays.fill(data, e);
lazy = new Object[2 * sz];
Arrays.fill(lazy, id);
}
LazySegmentTree(final T[] a, final BinaryOperator<T> f, final BiFunction<T, U, T> map, final BinaryOperator<U> comp, final T e, final U id) {
this(a.length, f, map, comp, e, id);
build(a);
}
final void build(final T[] a) {
assert n == a.length;
for(int k = 0; k < n; ++k) {
data[k + sz] = a[k];
}
for(int k = sz; --k > 0;) {
update(k);
}
}
final void set(int k, final T x) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
data[k] = x;
for(int i = 0; ++i <= h;) {
update(k >> i);
}
}
@SuppressWarnings("unchecked")
final T get(int k) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
return (T) data[k];
}
@SuppressWarnings("unchecked")
final T query(int l, int r) {
if(l >= r) {
return e;
}
l += sz;
r += sz;
for(int i = h; i > 0; i--) {
if(((l >> i) << i) != l) {
propagate(l >> i);
}
if(((r >> i) << i) != r) {
propagate((r - 1) >> i);
}
}
T l2 = e, r2 = e;
for(; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
l2 = f.apply(l2, (T) data[l++]);
}
if(r % 2 == 1) {
r2 = f.apply((T) data[--r], r2);
}
}
return f.apply(l2, r2);
}
@SuppressWarnings("unchecked")
final T all(){ return (T) data[1]; }
@SuppressWarnings("unchecked")
final void apply(int k, final U x) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
data[k] = map.apply((T) data[k], x);
for(int i = 0; ++i <= h;) {
update(k >> i);
}
}
final void apply(int l, int r, final U x) {
if(l >= r) {
return;
}
l += sz;
r += sz;
for(int i = h; i > 0; i--) {
if(((l >> i) << i) != l) {
propagate(l >> i);
}
if(((r >> i) << i) != r) {
propagate((r - 1) >> i);
}
}
int l2 = l, r2 = r;
for(; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
allApply(l++, x);
}
if(r % 2 == 1) {
allApply(--r, x);
}
}
l = l2;
r = r2;
for(int i = 0; ++i <= h;) {
if(((l >> i) << i) != l) {
update(l >> i);
}
if(((r >> i) << i) != r) {
update((r - 1) >> i);
}
}
}
@SuppressWarnings("unchecked")
final int findFirst(int l, final Predicate<T> fn) {
if(l >= n) {
return n;
}
l += sz;
for(int i = h; i > 0; i--) {
propagate(l >> i);
}
T sum = e;
do {
while((l & 1) == 0) {
l >>= 1;
}
if(fn.test(f.apply(sum, (T) data[l]))) {
while(l < sz) {
propagate(l);
l <<= 1;
final T nxt = f.apply(sum, (T) data[l]);
if(!fn.test(nxt)) {
sum = nxt;
l++;
}
}
return l + 1 - sz;
}
sum = f.apply(sum, (T) data[l++]);
} while((l & -l) != l);
return n;
}
@SuppressWarnings("unchecked")
final int findLast(int r, final Predicate<T> fn) {
if(r <= 0) {
return -1;
}
r += sz;
for(int i = h; i > 0; i--) {
propagate((r - 1) >> i);
}
T sum = e;
do {
r--;
while(r > 1 && r % 2 == 1) {
r >>= 1;
}
if(fn.test(f.apply((T) data[r], sum))) {
while(r < sz) {
propagate(r);
r = (r << 1) + 1;
final T nxt = f.apply((T) data[r], sum);
if(!fn.test(nxt)) {
sum = nxt;
r--;
}
}
return r - sz;
}
sum = f.apply((T) data[r], sum);
} while((r & -r) != r);
return -1;
}
final void clear(){ Arrays.fill(data, e); }
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class Zwei<T> implements Cloneable {
public T first, second;
private Zwei(final T first, final T second) {
this.first = first;
this.second = second;
}
static final <T> Zwei<T> of(final T f, final T s){ return new Zwei<>(f, s); }
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Zwei<?> z = (Zwei<?>) o;
return first.equals(z.first) && second.equals(z.second);
}
@Override
public final int hashCode(){ return Objects.hash(first, second); }
@Override
public final String toString(){ return String.valueOf(first); }
@SuppressWarnings("unchecked")
@Override
public final Zwei<T> clone() {
try {
return (Zwei<T>) super.clone();
} catch(final CloneNotSupportedException e){
e.printStackTrace();
}
throw new Error();
}
}
final class RAMX extends LazySegmentTree<Long, Long> {
RAMX(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, Long::sum, Long::sum, Long.valueOf(Long.MIN_VALUE), Long.valueOf(0)); }
RAMX(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, Long::sum, Long::sum, Long.valueOf(Long.MIN_VALUE), Long.valueOf(0)); }
}
final class RAMN extends LazySegmentTree<Long, Long> {
RAMN(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, Long::sum, Long::sum, Long.valueOf(Long.MAX_VALUE), Long.valueOf(0)); }
RAMN(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, Long::sum, Long::sum, Long.valueOf(Long.MAX_VALUE), Long.valueOf(0)); }
}
final class RASM extends LazySegmentTree<Zwei<Long>, Long> {
private final int n;
private final Zwei<Long>[] b;
@SuppressWarnings("unchecked")
RASM(final int[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.first.longValue() + x.second.longValue() * y.longValue(), x.second.longValue()), Long::sum, Zwei.of(0L, 0L), Long.valueOf(0));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of((long) a[i], 1L);
}
build(b);
}
@SuppressWarnings("unchecked")
RASM(final long[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.first.longValue() + x.second.longValue() * y.longValue(), x.second.longValue()), Long::sum, Zwei.of(0L, 0L), Long.valueOf(0));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of(a[i], 1L);
}
build(b);
}
}
final class RUMX extends LazySegmentTree<Long, Long> {
RUMX(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MIN_VALUE), Long.valueOf(Long.MIN_VALUE)); }
RUMX(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MIN_VALUE), Long.valueOf(Long.MIN_VALUE)); }
}
final class RUMN extends LazySegmentTree<Long, Long> {
RUMN(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MAX_VALUE), Long.valueOf(Long.MAX_VALUE)); }
RUMN(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MAX_VALUE), Long.valueOf(Long.MAX_VALUE)); }
}
final class RUSM extends LazySegmentTree<Zwei<Long>, Long> {
private final int n;
private final Zwei<Long>[] b;
@SuppressWarnings("unchecked")
RUSM(final int[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.second.longValue() * y.longValue(), x.second.longValue()), (x, y) -> y, Zwei.of(0L, 0L), Long.valueOf(Long.MIN_VALUE));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of((long) a[i], 1L);
}
build(b);
}
@SuppressWarnings("unchecked")
RUSM(final long[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.second.longValue() * y.longValue(), x.second.longValue()), (x, y) -> y, Zwei.of(0L, 0L), Long.valueOf(Long.MIN_VALUE));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of(a[i], 1L);
}
build(b);
}
}
final class DualSegmentTree<T> {
private final int n;
private int sz, h;
private final Object[] lazy;
private final T id;
private final BinaryOperator<T> ap;
@SuppressWarnings("unchecked")
private final void propagate(final int k) {
if(lazy[k] != id) {
lazy[2 * k] = ap.apply((T) lazy[2 * k], (T) lazy[k]);
lazy[2 * k + 1] = ap.apply((T) lazy[2 * k + 1], (T) lazy[k]);
lazy[k] = id;
}
}
private final void thrust(final int k) {
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
}
DualSegmentTree(final int n, final BinaryOperator<T> ap, final T id) {
this.n = n;
this.ap = ap;
this.id = id;
sz = 1;
h = 0;
while(sz < n) {
sz <<= 1;
h++;
}
lazy = new Object[2 * sz];
Arrays.fill(lazy, id);
}
@SuppressWarnings("unchecked")
final void apply(int a, int b, final T x) {
thrust(a += sz);
thrust(b += sz - 1);
for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
lazy[l] = ap.apply((T) lazy[l], x);
l++;
}
if(r % 2 == 1) {
r--;
lazy[r] = ap.apply((T) lazy[r], x);
}
}
}
@SuppressWarnings("unchecked")
final T get(int k) {
thrust(k += sz);
return (T) lazy[k];
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class SparseTable {
private final long[][] st;
private final int[] lookup;
private final LongBinaryOperator op;
SparseTable(final int[] a, final LongBinaryOperator op) {
this.op = op;
int b = 0;
while((1 << b) <= a.length) {
++b;
}
st = new long[b][1 << b];
for(int i = 0; i < a.length; i++) {
st[0][i] = a[i];
}
for(int i = 1; i < b; i++) {
for(int j = 0; j + (1 << i) <= (1 << b); j++) {
st[i][j] = op.applyAsLong(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
lookup = new int[a.length + 1];
for(int i = 2; i < lookup.length; i++) {
lookup[i] = lookup[i >> 1] + 1;
}
}
SparseTable(final long[] a, final LongBinaryOperator op) {
this.op = op;
int b = 0;
while((1 << b) <= a.length) {
++b;
}
st = new long[b][1 << b];
for(int i = 0; i < a.length; i++) {
st[0][i] = a[i];
}
for(int i = 1; i < b; i++) {
for(int j = 0; j + (1 << i) <= (1 << b); j++) {
st[i][j] = op.applyAsLong(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
lookup = new int[a.length + 1];
for(int i = 2; i < lookup.length; i++) {
lookup[i] = lookup[i >> 1] + 1;
}
}
final long query(final int l, final int r) {
final int b = lookup[r - l];
return op.applyAsLong(st[b][l], st[b][r - (1 << b)]);
}
final int minLeft(final int x, final LongPredicate fn) {
if(x == 0) {
return 0;
}
int ok = x, ng = -1;
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(query(mid, x) - 1)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
final int maxRight(final int x, final LongPredicate fn) {
if(x == lookup.length - 1) {
return lookup.length - 1;
}
int ok = x, ng = lookup.length;
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(query(x, mid))) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
}
final class WaveletMatrix {
private final WaveletMatrixBeta mat;
private final long[] ys;
WaveletMatrix(final int[] arr){ this(arr, 20); }
WaveletMatrix(final long[] arr){ this(arr, 20); }
WaveletMatrix(final int[] arr, final int log) {
ys = Arrays.stream(arr).asLongStream().sorted().distinct().toArray();
final long[] t = new long[arr.length];
Arrays.setAll(t, i -> index(arr[i]));
mat = new WaveletMatrixBeta(t, log);
}
WaveletMatrix(final long[] arr, final int log) {
ys = Arrays.stream(arr).sorted().distinct().toArray();
final long[] t = new long[arr.length];
Arrays.setAll(t, i -> index(arr[i]));
mat = new WaveletMatrixBeta(t, log);
}
private final int index(final long x){ return Utility.lowerBound(ys, x); }
final long get(final int k){ return ys[(int) mat.access(k)]; }
final int rank(final int r, final long x) {
final int pos = index(x);
if(pos == ys.length || ys[pos] != x) {
return 0;
}
return mat.rank(pos, r);
}
final int rank(final int l, final int r, final long x){ return rank(r, x) - rank(l, x); }
final long kthMin(final int l, final int r, final int k){ return ys[(int) mat.kthMin(l, r, k)]; }
final long kthMax(final int l, final int r, final int k){ return ys[(int) mat.kthMax(l, r, k)]; }
final int rangeFreq(final int l, final int r, final long upper){ return mat.rangeFreq(l, r, index(upper)); }
final int rangeFreq(final int l, final int r, final long lower, final long upper){ return mat.rangeFreq(l, r, index(lower), index(upper)); }
final long prev(final int l, final int r, final long upper) {
final long ret = mat.prev(l, r, index(upper));
return ret == -1 ? -1 : ys[(int) ret];
}
final long next(final int l, final int r, final long lower) {
final long ret = mat.next(l, r, index(lower));
return ret == -1 ? -1 : ys[(int) ret];
}
private final class WaveletMatrixBeta {
private final int log;
private final SuccinctIndexableDictionary[] matrix;
private final int[] mid;
WaveletMatrixBeta(final long[] arr, final int log) {
final int len = arr.length;
this.log = log;
matrix = new SuccinctIndexableDictionary[log];
mid = new int[log];
final long[] l = new long[len], r = new long[len];
for(int level = log; --level >= 0;) {
matrix[level] = new SuccinctIndexableDictionary(len + 1);
int left = 0, right = 0;
for(int i = 0; i < len; ++i) {
if(((arr[i] >> level) & 1) == 1) {
matrix[level].set(i);
r[right++] = arr[i];
} else {
l[left++] = arr[i];
}
}
mid[level] = left;
matrix[level].build();
final long[] tmp = new long[len];
System.arraycopy(arr, 0, tmp, 0, len);
System.arraycopy(l, 0, arr, 0, len);
System.arraycopy(tmp, 0, l, 0, len);
for(int i = 0; i < right; ++i) {
arr[left + i] = r[i];
}
}
}
private final IntPair succ(final boolean f, final int l, final int r, final int level){ return IntPair.of(matrix[level].rank(f, l) + mid[level] * (f ? 1 : 0), matrix[level].rank(f, r) + mid[level] * (f ? 1 : 0)); }
final long access(int k) {
long ret = 0;
for(int level = log; --level >= 0;) {
final boolean f = matrix[level].get(k);
if(f) {
ret |= 1L << level;
}
k = matrix[level].rank(f, k) + mid[level] * (f ? 1 : 0);
}
return ret;
}
final int rank(final long x, int r) {
int l = 0;
for(int level = log; --level >= 0;) {
final IntPair p = succ(((x >> level) & 1) == 1, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return r - l;
}
final long kthMin(int l, int r, int k) {
if(!Utility.scope(0, k, r - l - 1)) {
throw new IndexOutOfBoundsException();
}
long ret = 0;
for(int level = log; --level >= 0;) {
final int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);
final boolean f = cnt <= k;
if(f) {
ret |= 1 << level;
k -= cnt;
}
final IntPair p = succ(f, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return ret;
}
final long kthMax(final int l, final int r, final int k){ return kthMin(l, r, r - l - k - 1); }
final int rangeFreq(int l, int r, final long upper) {
int ret = 0;
for(int level = log; --level >= 0;) {
final boolean f = ((upper >> level) & 1) == 1;
if(f) {
ret += matrix[level].rank(false, r) - matrix[level].rank(false, l);
}
final IntPair p = succ(f, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return ret;
}
final int rangeFreq(final int l, final int r, final long lower, final long upper){ return rangeFreq(l, r, upper) - rangeFreq(l, r, lower); }
final long prev(final int l, final int r, final long upper) {
final int cnt = rangeFreq(l, r, upper);
return cnt == 0 ? -1 : kthMin(l, r, cnt - 1);
}
final long next(final int l, final int r, final long lower) {
final int cnt = rangeFreq(l, r, lower);
return cnt == r - l ? -1 : kthMin(l, r, cnt);
}
private final class SuccinctIndexableDictionary {
private final int blk;
private final int[] bit, sum;
SuccinctIndexableDictionary(final int len) {
blk = (len + 31) >> 5;
bit = new int[blk];
sum = new int[blk];
}
final void set(final int k){ bit[k >> 5] |= 1 << (k & 31); }
final void build() {
sum[0] = 0;
for(int i = 0; i + 1 < blk; ++i) {
sum[i + 1] = sum[i] + Integer.bitCount(bit[i]);
}
}
final boolean get(final int k){ return ((bit[k >> 5] >> (k & 31)) & 1) == 1; }
final int rank(final int k){ return (sum[k >> 5] + Integer.bitCount(bit[k >> 5] & ((1 << (k & 31)) - 1))); }
final int rank(final boolean val, final int k){ return val ? rank(k) : k - rank(k); }
}
}
}
import static java.lang.Math.*;
import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Formatter;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Stack;
import java.util.TreeMap;
import java.util.function.BiFunction;
import java.util.function.BiPredicate;
import java.util.function.BinaryOperator;
import java.util.function.Consumer;
import java.util.function.DoublePredicate;
import java.util.function.IntPredicate;
import java.util.function.IntUnaryOperator;
import java.util.function.LongBinaryOperator;
import java.util.function.LongPredicate;
import java.util.function.LongUnaryOperator;
import java.util.function.Predicate;
import java.util.function.UnaryOperator;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
final class Main {
public static void main(final String[] args) {
final long begin = System.currentTimeMillis(), end;
IntStream.range(0, VvyLw.MULTI ? VvyLw.io.ni() : 1).mapToObj(VvyLw::solve).filter(Objects::nonNull).forEach(VvyLw.io::out);
end = System.currentTimeMillis();
VvyLw.io.dump(end - begin + "ms");
VvyLw.io.close();
}
}
final class VvyLw extends Utility {
static final IO io = new IO(System.in, System.out, System.err, false);
static final Random rd = new Random();
static final boolean MULTI = false;
static final int INF = 1 << 30;
static final long LINF = (1L << 61) - 1;
static final double EPS = 1e-18;
static final int MOD = 998244353;
static final int M0D = (int) 1e9 + 7;
static final int[] dx = {0, -1, 1, 0, 0, -1, -1, 1, 1};
static final int[] dy = {0, 0, 0, -1, 1, -1, 1, -1, 1};
static final Object solve(final int Huitloxopetl) {
final int n = io.ni();
if(n == 1) {
return 1;
}
final var s = io.nt();
final var cnt = new int[26];
for(int i = 0, tmp = 1; i + 1 < n; ++i) {
if(s[i] == s[i + 1]) {
tmp++;
if(i + 2 == n) {
cnt[s[i] - 'a'] = max(cnt[s[i] - 'a'], tmp);
}
} else {
cnt[s[i] - 'a'] = max(cnt[s[i] - 'a'], tmp);
tmp = 1;
if(i + 2 == n) {
cnt[s[i + 1] - 'a'] = max(cnt[s[i + 1] - 'a'], tmp);
}
}
}
return sum(cnt);
}
}
class Utility {
protected static final String yes(final boolean ok){ return ok ? "Yes" : "No"; }
protected static final String no(final boolean ok){ return yes(!ok); }
protected static final long sqr(final long x){ return x * x; }
protected static final long cub(final long x){ return x * x * x; }
protected static final int mod(long n, final int m) {
n %= m;
return (int) (n < 0 ? n + m : n);
}
protected static final long mod(long n, final long m) {
n %= m;
return n < 0 ? n + m : n;
}
protected static final double log(final double x, final long base){ return Math.log(x) / Math.log(base); }
protected static final long intCeil(final long a, final long b){ return a == 0 ? 0 : (a - 1) / b + 1; }
protected static final double intRound(final double a, final long b, final int c) {
final long d = intPow(10, c);
return rint((a * d) / b) / d;
}
protected static final long intPow(long a, int b) {
long res = 1;
while(b > 0) {
if(b % 2 == 1) {
res *= a;
}
a *= a;
b >>= 1;
}
return res;
}
protected static final long intPow(long a, long b, final long m) {
long res = 1;
while(b > 0) {
if(b % 2 == 1) {
res *= a;
res = mod(res, m);
}
a *= a;
a = mod(a, m);
b >>= 1;
}
return res;
}
protected static final long inv(long a, final long m) {
long b = m, u = 1, v = 0;
while(b > 0) {
final long t = a / b;
a -= t * b;
a ^= b;
b ^= a;
a ^= b;
u -= t * v;
u ^= v;
v ^= u;
u ^= v;
}
return mod(u, m);
}
protected static final long lcm(final long a, final long b){ return a / gcd(a, b) * b; }
protected static final long lcm(final int... a){ return Arrays.stream(a).asLongStream().reduce(1, (x, y) -> lcm(x, y)); }
protected static final long lcm(final long... a){ return Arrays.stream(a).reduce(1, (x, y) -> lcm(x, y)); }
protected static final long gcd(final long a, final long b){ return b > 0 ? gcd(b, a % b) : a; }
protected static final int gcd(final int... a){ return Arrays.stream(a).reduce(0, (x, y) -> (int) gcd(x, y)); }
protected static final long gcd(final long... a){ return Arrays.stream(a).reduce(0, (x, y) -> gcd(x, y)); }
protected static final int min(final int... a){ return Arrays.stream(a).min().getAsInt(); }
protected static final long min(final long... a){ return Arrays.stream(a).min().getAsLong(); }
protected static final double min(final double... a){ return Arrays.stream(a).min().getAsDouble(); }
protected static final int max(final int... a){ return Arrays.stream(a).max().getAsInt(); }
protected static final long max(final long... a){ return Arrays.stream(a).max().getAsLong(); }
protected static final double max(final double... a){ return Arrays.stream(a).max().getAsDouble(); }
protected static final long sum(final int... a){ return Arrays.stream(a).asLongStream().sum(); }
protected static final long sum(final long... a){ return Arrays.stream(a).sum(); }
protected static final double sum(final double... a){ return Arrays.stream(a).sum(); }
protected static final long prod(final int... a){ return Arrays.stream(a).asLongStream().reduce(1, (x, y) -> x * y); }
protected static final long prod(final long... a){ return Arrays.stream(a).reduce(1, (x, y) -> x * y); }
protected static final double prod(final double... a){ return Arrays.stream(a).reduce(1, (x, y) -> x * y); }
protected static final double ave(final int... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double ave(final long... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double ave(final double... a){ return Arrays.stream(a).average().getAsDouble(); }
protected static final double median(final int[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2.0;
}
protected static final double median(final long[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2.0;
}
protected static final double median(final double[] a) {
assert isSorted(a);
final int m = a.length / 2;
return a.length % 2 != 0 ? a[m] : (a[m - 1] + a[m]) / 2;
}
protected static final long[] div(final long n) {
final ArrayList<Long> d = new ArrayList<>();
for(long i = 1; i * i <= n; ++i) {
if(n % i == 0) {
d.add(i);
if(i * i != n) {
d.add(n / i);
}
}
}
return d.stream().mapToLong(i -> i).sorted().toArray();
}
protected static final IntPair[] primeFactor(long n) {
final ArrayList<IntPair> pf = new ArrayList<>();
for(long i = 2; i * i <= n; ++i) {
if(n % i != 0) {
continue;
}
int cnt = 0;
while(n % i == 0) {
cnt++;
n /= i;
}
pf.add(IntPair.of(i, cnt));
}
if(n != 1) {
pf.add(IntPair.of(n, 1));
}
return pf.toArray(IntPair[]::new);
}
protected static final long eulerPhi(long n) {
long res = n;
for(long i = 2; i * i <= n; ++i) {
if(n % i == 0) {
res -= res / i;
while(n % i == 0) {
n /= i;
}
}
}
if(n > 1) {
res -= res / n;
}
return res;
}
protected static final long sigma(final long n){ return n * (n + 1) / 2; }
protected static final long sigma(final long a, final long b) {
assert a <= b;
return sigma(b) - sigma(a - 1);
}
protected static final long fact(int n) {
long res = 1;
while(n > 0) {
res *= n--;
}
return res;
}
protected static final long fact(int n, final long mod) {
long res = 1;
while(n > 0) {
res *= n--;
res %= mod;
}
return res;
}
protected static final long perm(final int n, final int r) {
int m = n;
long res = 1;
while(m > n - r) {
res *= m--;
}
return res;
}
protected static final long perm(final int n, final int r, final long mod) {
int m = n;
long res = 1;
while(m > n - r) {
res *= m--;
res %= mod;
}
return res;
}
protected static final long binom(final int n, final int r) {
if(r < 0 || n < r) {
return 0;
}
int tmp = n;
long res = 1;
for(int i = 1; i <= min(n - r, r); ++i) {
res *= tmp--;
res /= i;
}
return res;
}
protected static final long binom(final int n, final int r, final long mod) {
if(r < 0 || n < r) {
return 0;
}
int tmp = n;
long res = 1;
for(int i = 1; i <= min(n - r, r); ++i) {
res *= tmp--;
res = mod;
res /= i;
res %= mod;
}
return res;
}
protected static final boolean isInt(final double n){ return n == (long) floor(n); }
protected static final boolean isSqr(final long n){ return isInt(sqrt(n)); }
protected static final boolean isPrime(final long n) {
if(n == 1) {
return false;
}
for(long i = 2; i * i <= n; ++i) {
if(n % i == 0) {
return false;
}
}
return true;
}
protected static final boolean scope(final int l, final int x, final int r){ return l <= x && x <= r; }
protected static final boolean scope(final long l, final long x, final long r){ return l <= x && x <= r; }
protected static final boolean scope(final double l, final double x, final double r){ return l <= x && x <= r; }
protected static final int clamp(final int l, final int x, final int r){ return x < l ? l : x > r ? r : x; }
protected static final long clamp(final long l, final long x, final long r){ return x < l ? l : x > r ? r : x; }
protected static final double clamp(final double l, final double x, final double r){ return x < l ? l : x > r ? r : x; }
protected static final boolean isBit(final long i, final long j){ return (i >> j & 1) == 1; }
protected static final boolean nextPerm(final int[] a) {
try {
final int[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final long[] a) {
try {
final long[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final double[] a) {
try {
final double[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean nextPerm(final char[] a) {
try {
final char[] res = nextPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
Arrays.sort(a);
return false;
}
}
protected static final boolean prevPerm(final int[] a) {
try {
final int[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final int[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final long[] a) {
try {
final long[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final long[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final double[] a) {
try {
final double[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final double[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
protected static final boolean prevPerm(final char[] a) {
try {
final char[] res = prevPermutation(a);
System.arraycopy(res, 0, a, 0, a.length);
return true;
} catch(final NullPointerException e) {
final char[] res = reverse(sorted(a));
System.arraycopy(res, 0, a, 0, a.length);
return false;
}
}
private static final int[] nextPermutation(final int[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final long[] nextPermutation(final long[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final double[] nextPermutation(final double[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final char[] nextPermutation(final char[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] < a[i]) {
final int j = find(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
return a;
}
}
return null;
}
private static final int[] prevPermutation(final int[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final long[] prevPermutation(final long[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final double[] prevPermutation(final double[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final char[] prevPermutation(final char[] a) {
for(int i = a.length; --i > 0;) {
if(a[i - 1] > a[i]) {
final int j = findRev(a[i - 1], a, i, a.length - 1);
swap(a, i - 1, j);
Arrays.sort(a, i, a.length);
reverse(a, i, a.length - 1);
return a;
}
}
return null;
}
private static final int find(final int dest, final int[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final long dest, final long[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final double dest, final double[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int find(final char dest, final char[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] <= dest ? find(dest, a, s, m - 1) : find(dest, a, m, e);
}
private static final int findRev(final int dest, final int[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final long dest, final long[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final double dest, final double[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static final int findRev(final char dest, final char[] a, final int s, final int e) {
if(s == e) {
return s;
}
final int m = (s + e + 1) / 2;
return a[m] > dest ? findRev(dest, a, s, m - 1) : findRev(dest, a, m, e);
}
private static void reverse(final int[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final long[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final double[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
private static void reverse(final char[] arr, int start, int end) {
while(start < end) {
swap(arr, start, end);
start++;
end--;
}
}
protected static final int find(final int[] a, final int x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final long[] a, final long x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final double[] a, final double x) {
for(int i = 0; i < a.length; ++i) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int find(final char[] s, final char c) {
for(int i = 0; i < s.length; ++i) {
if(s[i] == c) {
return i;
}
}
return -1;
}
protected static final int find(final Object[] a, final Object x) {
for(int i = 0; i < a.length; ++i) {
if(a[i].equals(x)) {
return i;
}
}
return -1;
}
protected static final int findRev(final int[] a, final int x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final long[] a, final long x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final double[] a, final double x) {
for(int i = a.length; --i >= 0;) {
if(a[i] == x) {
return i;
}
}
return -1;
}
protected static final int findRev(final char[] s, final char c) {
for(int i = s.length; --i >= 0;) {
if(s[i] == c) {
return i;
}
}
return -1;
}
protected static final int findRev(final Object[] a, final Object x) {
for(int i = a.length; --i >= 0;) {
if(a[i].equals(x)) {
return i;
}
}
return -1;
}
protected static final boolean binarySearch(final int[] a, final int x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final boolean binarySearch(final long[] a, final long x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final <T extends Comparable<? super T>> boolean binarySearch(final T[] a, final T x){ return Arrays.binarySearch(a, x) >= 0; }
protected static final <T extends Comparable<? super T>> boolean binarySearch(final List<T> a, final T x){ return Collections.binarySearch(a, x, null) >= 0; }
protected static final int lowerBound(final int[] a, final int x){ return bins(a.length, -1, (IntPredicate) y -> a[y] >= x); }
protected static final int lowerBound(final long[] a, final long x){ return bins(a.length, -1, (IntPredicate) y -> a[y] >= x); }
protected static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T x){ return lowerBound(Arrays.asList(a), x); }
protected static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T x){ return ~Collections.binarySearch(a, x, (p, q) -> p.compareTo(q) >= 0 ? 1 : -1); }
protected static final int upperBound(final int[] a, final int x){ return bins(a.length, -1, (IntPredicate) y -> a[y] > x); }
protected static final int upperBound(final long[] a, final long x){ return bins(a.length, -1, (IntPredicate) y -> a[y] > x); }
protected static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T x){ return upperBound(Arrays.asList(a), x); }
protected static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T x){ return ~Collections.binarySearch(a, x, (p, q) -> p.compareTo(q) > 0 ? 1 : -1); }
protected static final String sorted(final String s){ return s.chars().sorted().mapToObj(Character::toString).collect(Collectors.joining()); }
protected static final int[] sorted(final int[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final long[] sorted(final long[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final double[] sorted(final double[] a){ return Arrays.stream(a).sorted().toArray(); }
protected static final char[] sorted(final char[] a){ return sorted(new String(a)).toCharArray(); }
protected static final <T extends Comparable<? super T>> T[] sorted(final T[] a){ return Arrays.stream(a).sorted().toArray(n -> Arrays.copyOf(a, n)); }
protected static final boolean isSorted(final String s){ return s.equals(sorted(s)); }
protected static final boolean isSorted(final int[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final long[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final double[] a){ return Arrays.equals(a, sorted(a)); }
protected static final boolean isSorted(final char[] a){ return Arrays.equals(a, sorted(a)); }
protected static final <T extends Comparable<? super T>> boolean isSorted(final T[] a){ return Arrays.equals(a, sorted(a)); }
protected static final String reverse(final String s){ return new StringBuilder(s).reverse().toString(); }
protected static final int[] reverse(final int[] a) {
final int n = a.length;
final int[] b = new int[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final long[] reverse(final long[] a) {
final int n = a.length;
final long[] b = new long[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final double[] reverse(final double[] a) {
final int n = a.length;
final double[] b = new double[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final char[] reverse(final char[] a) {
final int n = a.length;
final char[] b = new char[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final Object[] reverse(final Object[] a) {
final int n = a.length;
final Object[] b = new Object[n];
for(int i = 0; i <= n / 2; ++i) {
b[i] = a[n - 1 - i];
b[n - 1 - i] = a[i];
}
return b;
}
protected static final int[] rotate(final int[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final int[] res = new int[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final long[] rotate(final long[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final long[] res = new long[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final double[] rotate(final double[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final double[] res = new double[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final char[] rotate(final char[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final char[] res = new char[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final boolean[] rotate(final boolean[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final boolean[] res = new boolean[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final Object[] rotate(final Object[] a, final int id) {
final int n = a.length, k = (int) mod(id, n);
final Object[] res = new Object[n];
System.arraycopy(a, k, res, 0, n - k);
System.arraycopy(a, 0, res, n - k, k);
return res;
}
protected static final String rotate(final String s, final int id) {
final List<Character> t = s.chars().mapToObj(i -> (char) i).collect(Collectors.toList());
Collections.rotate(t, -id);
return t.stream().map(String::valueOf).collect(Collectors.joining());
}
protected static final int[][] rotateR(final int[][] a) {
final int h = a.length, w = a[0].length;
final int[][] b = new int[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final long[][] rotateR(final long[][] a) {
final int h = a.length, w = a[0].length;
final long[][] b = new long[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final double[][] rotateR(final double[][] a) {
final int h = a.length, w = a[0].length;
final double[][] b = new double[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][i]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final char[][] rotateR(final char[][] a) {
final int h = a.length, w = a[0].length;
final char[][] b = new char[w][h];
IntStream.range(0, h).forEach(i -> {
IntStream.range(0, w).forEach(j -> b[j][i] = a[i][j]);
});
IntStream.range(0, w).forEach(i -> b[i] = reverse(b[i]));
return b;
}
protected static final int[][] rotateL(final int[][] a) {
final int h = a.length, w = a[0].length;
final int[][] b = new int[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final long[][] rotateL(final long[][] a) {
final int h = a.length, w = a[0].length;
final long[][] b = new long[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final double[][] rotateL(final double[][] a) {
final int h = a.length, w = a[0].length;
final double[][] b = new double[w][h];
IntStream.range(0, h).forEach(i -> {
Arrays.setAll(b[i], j -> a[j][w - i - 1]);
});
return b;
}
protected static final char[][] rotateL(final char[][] a) {
final int h = a.length, w = a[0].length;
final char[][] b = new char[w][h];
IntStream.range(0, h).forEach(i -> {
IntStream.range(0, w).forEach(j -> b[w - j - 1][i] = a[i][j]);
});
return b;
}
protected static final void swap(final int[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final long[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final double[] a, final int i, final int j) {
final double tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
protected static final void swap(final char[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final boolean[] a, final int i, final int j) {
a[i] ^= a[j];
a[j] ^= a[i];
a[i] ^= a[j];
}
protected static final void swap(final Object[] a, final int i, final int j) {
final Object tmp = a[i];
a[i] = a[j];
a[j] = tmp;
}
protected static final void swap(final int[] a, final int[] b) {
assert a.length == b.length;
final int n = a.length;
final int[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final long[] a, final long[] b) {
assert a.length == b.length;
final int n = a.length;
final long[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final double[] a, final double[] b) {
assert a.length == b.length;
final int n = a.length;
final double[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final char[] a, final char[] b) {
assert a.length == b.length;
final int n = a.length;
final char[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final boolean[] a, final boolean[] b) {
assert a.length == b.length;
final int n = a.length;
final boolean[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final void swap(final Object[] a, final Object[] b) {
assert a.length == b.length;
final int n = a.length;
final Object[] c = a.clone();
System.arraycopy(b, 0, a, 0, n);
System.arraycopy(c, 0, b, 0, n);
}
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> Pair<S, F>[] swap(final Pair<F, S>[] p) {
@SuppressWarnings("unchecked")
final Pair<S, F>[] q = new Pair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
protected static final IntPair[] swap(final IntPair[] p) {
final IntPair[] q = new IntPair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
protected static final FloatPair[] swap(final FloatPair[] p) {
final FloatPair[] q = new FloatPair[p.length];
Arrays.setAll(q, i -> p[i].swap());
return q;
}
@SuppressWarnings("unchecked")
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> F[] first(final Pair<F, S>[] p){ return (F[]) Arrays.stream(p).map(i -> i.first).toArray(); }
protected static final long[] first(final IntPair[] p){ return Arrays.stream(p).mapToLong(i -> i.first).toArray(); }
protected static final double[] first(final FloatPair[] p){ return Arrays.stream(p).mapToDouble(i -> i.first).toArray(); }
@SuppressWarnings("unchecked")
protected static final <F extends Comparable<? super F>, S extends Comparable<? super S>> S[] second(final Pair<F, S>[] p){ return (S[]) Arrays.stream(p).map(i -> i.second).toArray(); }
protected static final long[] second(final IntPair[] p){ return Arrays.stream(p).mapToLong(i -> i.second).toArray(); }
protected static final double[] second(final FloatPair[] p){ return Arrays.stream(p).mapToDouble(i -> i.second).toArray(); }
protected static final IntStream iota(final int n){ return IntStream.range(0, n); }
protected static final IntStream iota(final int n, final int init){ return IntStream.range(0 + init, n + init); }
protected static final int bins(int ok, int ng, final IntPredicate fn) {
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final long bins(long ok, long ng, final LongPredicate fn) {
while(abs(ok - ng) > 1) {
final long mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final double bins(double ok, double ng, final DoublePredicate fn) {
while(abs(ok - ng) > VvyLw.EPS) {
final double mid = (ok + ng) / 2;
if(fn.test(mid)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
protected static final Map<Integer, Integer> counter(final int[] a) {
final Map<Integer, Integer> res = new HashMap<>();
for(final int i: a) {
res.merge(i, 1, (x, y) -> x + y);
}
return res;
}
protected static final Map<Long, Integer> counter(final long[] a) {
final Map<Long, Integer> res = new HashMap<>();
for(final long i: a) {
res.merge(i, 1, (x, y) -> x + y);
}
return res;
}
protected static final long innerProd(final IntPair... p){ return iota(p.length).mapToLong(i -> p[i].first.longValue() * p[i].second.longValue()).sum(); }
protected static final double innerProd(final FloatPair... p){ return iota(p.length).mapToDouble(i -> p[i].first.doubleValue() * p[i].second.doubleValue()).sum(); }
protected static final FloatPair intersection(final IntPair a, final long sec1, final IntPair b, final long sec2) {
double m1, m2, b1, b2;
if(a.second.longValue() == 0 && b.second.longValue() == 0) {
return null;
} else if(a.second.longValue() == 0) {
m2 = -b.first.doubleValue() / b.second.longValue();
b2 = -sec2 / b.second.doubleValue();
final double x = -sec1 / a.first.doubleValue(), y = b2 + m2 * x;
return FloatPair.of(x, y);
} else if(b.second.longValue() == 0) {
m1 = -a.first.doubleValue() / a.second.longValue();
b1 = -sec1 / a.second.doubleValue();
final double x = -sec2 / b.first.doubleValue(), y = b1 + m1 * x;
return FloatPair.of(x, y);
}
m1 = -a.first.doubleValue() / a.second.longValue();
m2 = -b.first.doubleValue() / b.second.longValue();
b1 = -sec1 / a.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
assert m1 != m2;
final double x = (b1 - b2) / (m2 - m1), y = m1 * x + b1;
return FloatPair.of(x, y);
}
protected static final FloatPair intersection(final FloatPair a, final double sec1, final FloatPair b, final double sec2) {
double m1, m2, b1, b2;
if(a.second.doubleValue() == 0 && b.second.doubleValue() == 0) {
return null;
} else if(a.second.doubleValue() == 0) {
m2 = -b.first.doubleValue() / b.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
final double x = -sec1 / a.first.doubleValue(), y = b2 + m2 * x;
return FloatPair.of(x, y);
} else if(b.second.doubleValue() == 0) {
m1 = -a.first.doubleValue() / a.second.doubleValue();
b1 = -sec1 / a.second.doubleValue();
final double x = -sec2 / b.first.doubleValue(), y = b1 + m1 * x;
return FloatPair.of(x, y);
}
m1 = -a.first.doubleValue() / a.second.doubleValue();
m2 = -b.first.doubleValue() / b.second.doubleValue();
b1 = -sec1 / a.second.doubleValue();
b2 = -sec2 / b.second.doubleValue();
assert m1 != m2;
final double x = (b1 - b2) / (m2 - m1), y = m1 * x + b1;
return FloatPair.of(x, y);
}
protected static final int[] corPress(final int[] a) {
final int[] res = new int[a.length];
final int[] x = Arrays.stream(a).sorted().distinct().toArray();
Arrays.setAll(res, i -> lowerBound(x, a[i]));
return res;
}
protected static final int[] corPress(final long[] a) {
final int[] res = new int[a.length];
final long[] x = Arrays.stream(a).sorted().distinct().toArray();
Arrays.setAll(res, i -> lowerBound(x, a[i]));
return res;
}
protected static final String runLenPress(final String s) {
final int n = s.length();
final StringBuilder sb = new StringBuilder();
for(int l = 0; l < n;) {
int r = l + 1;
for(; r < n && s.charAt(l) == s.charAt(r); ++r){}
sb.append(s.charAt(l));
sb.append(r - l);
l = r;
}
return sb.toString();
}
protected static final String runLenRev(final String s) {
final int n = s.length();
final StringBuilder sb = new StringBuilder();
for(int l = 0; l < n;) {
int r = l + 1;
for(; r < n && scope('0', s.charAt(r), '9'); ++r){}
sb.append(String.valueOf(s.charAt(l)).repeat(Integer.parseInt(s.substring(l + 1, r))));
l = r;
}
return sb.toString();
}
protected static final int[] zAlgorithm(final String s) {
final int n = s.length();
int j = 0;
final int[] pre = new int[n];
for(int i = 0; ++i < n;) {
if(i + pre[i - j] < j + pre[j]) {
pre[i] = pre[i - j];
}
else {
int k = max(0, j + pre[j] - i);
while(i + k < n && s.charAt(k) == s.charAt(i + k)) {
++k;
}
pre[i] = k;
j = i;
}
}
pre[0] = n;
return pre;
}
protected static final int[] manacher(final String s_, final boolean calcEven) {
int n = s_.length();
final char[] s;
if(calcEven) {
s = new char[2 * n - 1];
IntStream.range(0, n).forEach(i -> s[i] = s_.charAt(i));
for(int i = n; --i >= 0;) {
s[2 * i] = s_.charAt(i);
}
final char d = Collections.min(s_.chars().mapToObj(c -> (char) c).collect(Collectors.toList()));
for(int i = 0; i < n - 1; ++i) {
s[2 * i + 1] = d;
}
} else {
s = new char[n];
IntStream.range(0, n).forEach(i -> s[i] = s_.charAt(i));
}
n = s.length;
final int[] rad = new int[n];
for(int i = 0, j = 0; i < n;) {
while(i - j >= 0 && i + j < n && s[i - j] == s[i + j]) {
++j;
}
rad[i] = j;
int k = 1;
while(i - k >= 0 && i + k < n && k + rad[i - k] < j) {
rad[i + k] = rad[i - k];
++k;
}
i += k;
j -= k;
}
if(calcEven) {
for(int i = 0; i < n; ++i) {
if(((i ^ rad[i]) & 1) == 0) {
rad[i]--;
}
}
} else {
for(int x: rad) {
x = 2 * x - 1;
}
}
return rad;
}
protected static final long kthRoot(final long n, final int k) {
if(k == 1) {
return n;
}
final LongPredicate chk = x -> {
long mul = 1;
for(int j = 0; j < k; ++j) {
try {
mul = multiplyExact(mul, x);
} catch(final ArithmeticException e) {
return false;
}
}
return mul <= n;
};
long ret = 0;
for(int i = 32; --i >= 0;) {
if(chk.test(ret | (1L << i))) {
ret |= 1L << i;
}
}
return ret;
}
protected static final long tetration(final long a, final long b, final long m) {
if(m == 1) {
return 0;
}
if(a == 0) {
return (b & 1) == 0 ? 1 : 0;
}
if(b == 0) {
return 1;
}
if(b == 1) {
return a % m;
}
if(b == 2) {
return intPow(a, a, m);
}
final long phi = eulerPhi(m);
long tmp = tetration(a, b - 1, phi);
if(tmp == 0) {
tmp += phi;
}
return intPow(a, tmp, m);
}
protected static final long floorSum(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 ym = (a * n + b) / m, xm = (ym * m - b);
if(ym == 0) {
return ans;
}
ans += (n - (xm + a - 1) / a) * ym;
ans += floorSum(ym, a, m, (a - xm % a) % a);
return ans;
}
}
interface TriFunction<T, U, V, R> {
R apply(final T a, final U b, final V c);
}
interface QuadFunction<A, B, C, D, R> {
R apply(final A a, final B b, final C c, final D d);
}
interface TriConsumer<T, U, V> {
void accept(final T a, final U b, final V c);
}
interface TriPredicate<T, U, V> {
boolean test(final T a, final U b, final V c);
}
interface RecursiveFunction<T, R> {
R apply(final RecursiveFunction<T, R> rec, final T n);
}
interface RecursiveBiFunction<T, U, R> {
R apply(final RecursiveBiFunction<T, U, R> rec, final T n, final U m);
}
interface RecursiveTriFunction<T, U, V, R> {
R apply(final RecursiveTriFunction<T, U, V, R> rec, final T p, final U q, final V r);
}
interface RecursiveUnaryOperator<T> {
T apply(final RecursiveUnaryOperator<T> rec, final T n);
}
interface RecursiveBinaryOperator<T> {
T apply(final RecursiveBinaryOperator<T> rec, final T a, final T b);
}
interface RecursiveConsumer<T> {
void accept(final RecursiveConsumer<T> rec, final T x);
}
interface RecursiveBiConsumer<T, U> {
void accept(final RecursiveBiConsumer<T, U> rec, final T x, final U y);
}
interface RecursiveTriConsumer<T, U, V> {
void accept(final RecursiveTriConsumer<T, U, V> rec, final T x, final U y, final V z);
}
interface RecursivePredicate<T> {
boolean test(final RecursivePredicate<T> rec, final T n);
}
interface RecursiveBiPredicate<T, U> {
boolean test(final RecursiveBiPredicate<T, U> rec, final T x, final U y);
}
interface RecursiveTriPredicate<T, U, V> {
boolean test(final RecursiveTriPredicate<T, U, V> rec, final T x, final U y, final V z);
}
interface RecursiveIntFunction<R> {
R apply(final RecursiveIntFunction<R> rec, final int n);
}
interface RecursiveLongFunction<R> {
R apply(final RecursiveLongFunction<R> rec, final long n);
}
interface RecursiveDoubleFunction<R> {
R apply(final RecursiveDoubleFunction<R> rec, final double n);
}
interface RecursiveIntUnaryOperator {
int apply(final RecursiveIntUnaryOperator rec, final int n);
}
interface RecursiveLongUnaryOperator {
long apply(final RecursiveLongUnaryOperator rec, final long n);
}
interface RecursiveDoubleUnaryOperator {
double apply(final RecursiveDoubleUnaryOperator rec, final double n);
}
interface RecursiveIntBinaryOperator {
int apply(final RecursiveIntBinaryOperator rec, final int a, final int b);
}
interface RecursiveLongBinaryOperator {
long apply(final RecursiveLongBinaryOperator rec, final long a, final long b);
}
interface RecursiveDoubleBinaryOperator {
double apply(final RecursiveDoubleBinaryOperator rec, final double a, final double b);
}
interface RecursiveIntConsumer {
void accept(final RecursiveIntConsumer rec, final int n);
}
interface RecursiveLongConsumer {
void accept(final RecursiveLongConsumer rec, final long n);
}
interface RecursiveDoubleConsumer {
void accept(final RecursiveDoubleConsumer rec, final double n);
}
interface RecursiveIntPredicate {
boolean test(final RecursiveIntPredicate rec, final int n);
}
interface RecursiveLongPredicate {
boolean test(final RecursiveLongPredicate rec, final long n);
}
interface RecursiveDoublePredicate {
boolean test(final RecursiveDoublePredicate rec, final double n);
}
final class IO implements Closeable, AutoCloseable {
private final MyScanner in;
private final MyPrinter out, err;
IO(final InputStream in, final OutputStream out, final OutputStream err, final boolean autoFlush) {
this.in = new MyScanner(in);
this.out = new MyPrinter(out, autoFlush);
this.err = new MyPrinter(err, true);
}
final int ni(){ return in.ni(); }
final long nl(){ return in.nl(); }
final double nd(){ return in.nd(); }
final char nc(){ return in.nc(); }
final String ns(){ return in.ns(); }
final char[] nt(){ return in.nt(); }
final BigInteger nb(){ return in.nb(); }
final IntPair pi(){ return in.pi(); }
final FloatPair pf(){ return in.pf(); }
final int[] ni(final int n) {
final int[] a = new int[n];
Arrays.setAll(a, i -> ni());
return a;
}
final int[] ni(final int n, final IntUnaryOperator f){ return Arrays.stream(ni(n)).map(f).toArray(); }
final long[] nl(final int n) {
final long[] a = new long[n];
Arrays.setAll(a, i -> nl());
return a;
}
final long[] nl(final int n, final LongUnaryOperator f){ return Arrays.stream(nl(n)).map(f).toArray(); }
final double[] nd(final int n) {
final double[] a = new double[n];
Arrays.setAll(a, i -> nd());
return a;
}
final char[] nc(final int n) {
final char[] a = new char[n];
IntStream.range(0, n).forEach(i -> a[i] = nc());
return a;
}
final String[] ns(final int n) {
final String[] a = new String[n];
Arrays.setAll(a, i -> ns());
return a;
}
final char[][] nt(final int n) {
final char[][] a = new char[n][];
Arrays.setAll(a, i -> nt());
return a;
}
final BigInteger[] nb(final int n) {
final BigInteger[] a = new BigInteger[n];
Arrays.setAll(a, i -> nb());
return a;
}
final IntPair[] pi(final int n) {
final IntPair[] a = new IntPair[n];
Arrays.setAll(a, i -> pi());
return a;
}
final IntPair[] pi(final int n, final UnaryOperator<IntPair> f){ return Arrays.stream(pi(n)).map(f).toArray(IntPair[]::new); }
final FloatPair[] pf(final int n) {
final FloatPair[] a = new FloatPair[n];
Arrays.setAll(a, i -> pf());
return a;
}
final int[][] ni(final int h, final int w) {
final int[][] a = new int[h][w];
Arrays.setAll(a, i -> ni(w));
return a;
}
final long[][] nl(final int h, final int w) {
final long[][] a = new long[h][w];
Arrays.setAll(a, i -> nl(w));
return a;
}
final double[][] nd(final int h, final int w) {
final double[][] a = new double[h][w];
Arrays.setAll(a, i -> nd(w));
return a;
}
final char[][] nc(final int h, final int w) {
final char[][] a = new char[h][w];
Arrays.setAll(a, i -> nc(w));
return a;
}
final String[][] ns(final int h, final int w) {
final String[][] a = new String[h][w];
Arrays.setAll(a, i -> ns(w));
return a;
}
final BigInteger[][] nb(final int h, final int w) {
final BigInteger[][] a = new BigInteger[h][w];
Arrays.setAll(a, i -> nb(w));
return a;
}
final String line(){ return in.line(); }
final void print(final Object arg){ out.print(arg); }
final void printf(final String fmt, final Object... args){ out.printf(fmt, args); }
final void out(){ out.out(); }
final void out(final Object head, final Object... tail){ out.out(head, tail); }
final void out(final int[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final long[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final double[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final boolean[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final char[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void out(final Object[][] args){ IntStream.range(0, args.length).forEach(i -> out(args[i])); }
final void outl(final Object head, final Object... tail){ out.outl(head, tail); }
final void dump(final Object head, final Object... tail){ err.out(head, tail); }
final void dump(final int[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final long[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final double[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final boolean[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final char[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dump(final Object[][] args){ IntStream.range(0, args.length).forEach(i -> dump(args[i])); }
final void dumpl(final Object head, final Object... tail){ err.outl(head, tail); }
@Override
public final void close() {
out.flush();
in.close();
out.close();
err.close();
}
private final class MyScanner implements Closeable, AutoCloseable {
private int pos, lim;
private final byte[] buf;
private final InputStream is;
private boolean check;
MyScanner(final InputStream is) {
this.is = is;
pos = lim = 0;
buf = new byte[1 << 17];
check = false;
}
private final boolean isPunct(final byte bt){ return !Utility.scope(33, bt, 126); }
private final boolean isNum(final byte bt){ return Utility.scope('0', bt, '9'); }
private final byte read() {
if(pos == lim && lim != -1) {
try {
lim = is.read(buf);
pos = 0;
} catch(final IOException e) {
e.printStackTrace();
}
}
return buf[pos++];
}
private final byte next() {
byte bt;
if(check) {
check = false;
bt = buf[pos - 1];
if(!isPunct(bt)) {
return bt;
}
}
while(isPunct(bt = read())){}
return bt;
}
final int ni(){ return toIntExact(nl()); }
final long nl() {
byte c = next();
final boolean neg = c == '-';
if(neg) {
c = next();
}
assert isNum(c);
long res = c - '0';
while(isNum(c = read())) {
res = 10 * res + c - '0';
}
check = !isNum(c);
return neg ? -res : res;
}
final double nd() {
byte c = next();
final boolean neg = c == '-';
if(neg) {
c = next();
}
assert isNum(c);
double res = c - '0';
while(isNum(c = read())) {
res = 10 * res + c - '0';
}
if(c != '.') {
check = true;
return res;
}
int i;
for(i = 0; isNum(c = read()); ++i) {
res = res * 10 + c - '0';
}
res /= pow(10, i);
check = true;
return neg ? -res : res;
}
final char nc(){ return (char) next(); }
final String ns() {
final StringBuilder sb = new StringBuilder();
byte c = next();
while(!isPunct(c)) {
sb.append((char) c);
c = read();
}
return sb.toString();
}
final char[] nt(){ return ns().toCharArray(); }
final BigInteger nb(){ return new BigInteger(ns()); }
final IntPair pi(){ return IntPair.of(nl(), nl()); }
final FloatPair pf(){ return FloatPair.of(nd(), nd()); }
final String line() {
final StringBuilder sb = new StringBuilder();
byte c;
while((c = read()) != '\n') {
sb.append((char) c);
}
return sb.toString();
}
@Override
public final void close() {
try {
is.close();
} catch(final IOException e) {
e.printStackTrace();
}
}
}
private final class MyPrinter implements Closeable, Flushable, AutoCloseable {
private OutputStream os;
private final boolean autoFlush;
private final byte[] buf;
private int pos;
private final boolean debug;
MyPrinter(final OutputStream os, final boolean autoFlush){
this.os = os;
this.autoFlush = autoFlush;
buf = new byte[1 << 17];
pos = 0;
debug = os == System.err;
}
private final void write(final byte bt) {
buf[pos++] = bt;
if(pos == buf.length) {
flush();
}
}
private final void newLine() {
write((byte) '\n');
if(autoFlush) {
flush();
}
}
final void print(final Object arg) {
if(arg instanceof final String s) {
for(final char c: s.toCharArray()) {
write((byte) c);
}
} else {
final StringBuilder sb = new StringBuilder();
if(arg instanceof final int[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final long[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final double[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final boolean[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final char[] a) {
if(a.length == 0) {
return;
}
sb.append(a[0]);
for(int i = 0; ++i < a.length;) {
sb.append(" " + a[i]);
}
} else if(arg instanceof final Object[] a) {
if(debug) {
print(Arrays.toString(a));
return;
}
if(a.length == 0) {
return;
}
print(a[0]);
for(int i = 0; ++i < a.length;) {
print("\n");
print(a[i]);
}
return;
} else {
if(debug) {
print(arg.toString());
return;
} else if(arg instanceof final Pair<?, ?> p) {
sb.append(p.first + " " + p.second);
} else if(arg instanceof final Collection<?> c) {
int i = 0;
for(final Object el: c) {
sb.append(el);
if(++i != c.size()) {
sb.append(' ');
}
}
} else if(sb.isEmpty()) {
print(arg.toString());
return;
}
}
print(sb.toString());
}
if(autoFlush) {
flush();
}
}
final void printf(final String fmt, final Object... args){ print(new Formatter().format(fmt, args)); }
final void out(){ newLine(); }
final void out(final Object head, final Object... tail) {
print(head);
for(final Object el: tail) {
print(" ");
print(el);
}
newLine();
}
final void outl(final Object head, final Object... tail) {
out(head);
for(final Object el: tail) {
out(el);
}
}
@Override
public final void flush() {
try {
os.write(buf, 0, pos);
pos = 0;
} catch(final IOException e) {
e.printStackTrace();
}
}
@Override
public final void close() {
if(os == null) {
return;
}
try {
os.close();
os = null;
} catch(final IOException e) {
e.printStackTrace();
}
}
}
}
class Pair<F extends Comparable<? super F>, S extends Comparable<? super S>> implements Comparable<Pair<F, S>>, Cloneable {
public F first;
public S second;
protected Pair(final F first, final S second) {
this.first = first;
this.second = second;
}
static final <F extends Comparable<? super F>, S extends Comparable<? super S>> Pair<F, S> of(final F a, final S b){ return new Pair<>(a, b); }
Pair<S, F> swap(){ return Pair.of(second, first); }
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Pair<?, ?> p = (Pair<?, ?>) o;
return first.equals(p.first) && second.equals(p.second);
}
@Override
public final int hashCode(){ return Objects.hash(first, second); }
@Override
public final String toString(){ return "(" + first + ", " + second + ")"; }
@SuppressWarnings("unchecked")
@Override
public final Pair<F, S> clone() {
try {
return (Pair<F, S>) super.clone();
} catch(final CloneNotSupportedException e){
e.printStackTrace();
}
throw new Error();
}
@Override
public final int compareTo(final Pair<F, S> p) {
if(first.compareTo(p.first) == 0) {
return second.compareTo(p.second);
}
return first.compareTo(p.first);
}
}
final class IntPair extends Pair<Long, Long> {
private IntPair(final long first, final long second){ super(first, second); }
static final IntPair ZERO = new IntPair(0, 0);
static final IntPair ONE = new IntPair(1, 1);
static final IntPair of(final long a, final long b){ return new IntPair(a, b); }
@Override
final IntPair swap(){ return new IntPair(second, first); }
final IntPair add(final IntPair p){ return new IntPair(first + p.first, second + p.second); }
final IntPair sub(final IntPair p){ return new IntPair(first - p.first, second - p.second); }
final IntPair mul(final IntPair p){ return new IntPair(first * p.first, second * p.second); }
final IntPair div(final IntPair p){ return new IntPair(first / p.first, second / p.second); }
final IntPair mod(final IntPair p){ return new IntPair(first % p.first, second % p.second); }
final IntPair rotate(){ return new IntPair(-second, first); }
final FloatPair rotate(final int ang) {
final double rad = toRadians(Utility.mod(ang, 360));
return FloatPair.of(first * cos(rad) - second * sin(rad), first * sin(rad) + second * cos(rad));
}
final long dot(final IntPair p){ return first * p.first + second * p.second; }
final long cross(final IntPair p){ return rotate().dot(p); }
final long sqr(){ return dot(this); }
final double grad() {
try {
return 1.0 * second / first;
} catch(final ArithmeticException e) {
e.printStackTrace();
}
throw new Error();
}
final double abs(){ return hypot(first, second); }
final long lcm(){ return Utility.lcm(first, second); }
final long gcd(){ return Utility.gcd(first, second); }
final IntPair extgcd() {
long x = 1, y = 0, t1 = 0, t2 = 0, t3 = 1, a = first, b = second;
while(b > 0) {
t1 = a / b;
a -= t1 * b;
a ^= b;
b ^= a;
a ^= b;
x -= t1 * t2;
x ^= t2;
t2 ^= x;
x ^= t2;
y -= t1 * t3;
y ^= t3;
t3 ^= y;
y ^= t3;
}
return new IntPair(x, y);
}
}
final class FloatPair extends Pair<Double, Double> {
private FloatPair(final double first, final double second){ super(first, second); }
static final FloatPair of(final double a, final double b){ return new FloatPair(a, b); }
@Override
final FloatPair swap(){ return new FloatPair(second, first); }
final FloatPair add(final FloatPair p){ return new FloatPair(first + p.first, second + p.second); }
final FloatPair sub(final FloatPair p){ return new FloatPair(first - p.first, second - p.second); }
final FloatPair mul(final FloatPair p){ return new FloatPair(first * p.first, second * p.second); }
final FloatPair div(final FloatPair p){ return new FloatPair(first / p.first, second / p.second); }
final FloatPair rotate(){ return new FloatPair(-second, first); }
final FloatPair rotate(final int ang) {
final double rad = toRadians(Utility.mod(ang, 360));
return FloatPair.of(first * cos(rad) - second * sin(rad), first * sin(rad) + second * cos(rad));
}
final double dot(final FloatPair p){ return first * p.first + second * p.second; }
final double cross(final FloatPair p){ return rotate().dot(p); }
final double sqr(){ return dot(this); }
final double grad() {
try {
return second / first;
} catch(final ArithmeticException e) {
e.printStackTrace();
}
throw new Error();
}
final double abs(){ return hypot(first, second); }
}
final class Why {
static final boolean isBipartite(final UnionFind uf) {
assert uf.size() % 2 == 0;
final int n = uf.size() / 2;
boolean ok = true;
for(int i = 0; i < n; ++i) {
ok &= !uf.same(i, i + n);
}
return ok;
}
static final long invNum(final int[] a) {
final int[] b = Utility.sorted(a);
final Map<Integer, Integer> id = new HashMap<>();
for(int i = 0; i < a.length; ++i) {
id.put(b[i], i);
}
final FenwickTree bit = new FenwickTree(a.length);
long res = 0;
for(int i = 0; i < a.length; ++i) {
res += i - bit.sum(id.get(a[i]));
bit.add(id.get(a[i]), 1);
}
return res;
}
static final long invNum(final long[] a) {
final long[] b = Utility.sorted(a);
final Map<Long, Integer> id = new HashMap<>();
for(int i = 0; i < a.length; ++i) {
id.put(b[i], i);
}
final FenwickTree bit = new FenwickTree(a.length);
long res = 0;
for(int i = 0; i < a.length; ++i) {
res += i - bit.sum(id.get(a[i]));
bit.add(id.get(a[i]), 1);
}
return res;
}
}
final class Edge {
public int src, to, id;
public long cost;
Edge(final int src, final int to, final int id) {
this.src = src;
this.to = to;
this.id = id;
}
Edge(final int src, final int to, final long cost, final int id) {
this.src = src;
this.to = to;
this.cost = cost;
this.id = id;
}
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Edge e = (Edge) o;
return src == e.src && to == e.to && cost == e.cost;
}
@Override
public final int hashCode(){ return Objects.hash(src, to, cost, id); }
@Override
public final String toString(){ return "(" + src + ", " + to + ", " + cost + ")"; }
}
class Graph extends ArrayList<ArrayList<Edge>> {
protected final boolean undirected;
protected final int n, indexed;
protected int id;
protected final ArrayList<Edge> edge;
Graph(final int n, final boolean undirected){ this(n, 1, undirected); }
Graph(final int n, final int indexed, final boolean undirected) {
this.n = n;
this.indexed = indexed;
this.undirected = undirected;
id = 0;
edge = new ArrayList<>();
IntStream.range(0, n).forEach(i -> add(new ArrayList<>()));
}
static Graph of(final List<ArrayList<Edge>> g, final boolean undirected) {
int max = 0, min = Integer.MAX_VALUE;
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
max = max(e.src, e.to);
min = min(e.src, e.to);
}
}
final Graph gp = new Graph(max, min, undirected);
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
gp.addEdge(e.src, e.to);
}
}
return gp;
}
protected final void addEdge(int a, int b) {
a -= indexed;
b -= indexed;
this.get(a).add(new Edge(a, b, id));
edge.add(new Edge(a, b, id));
if(undirected) {
this.get(b).add(new Edge(b, a, id));
edge.add(new Edge(b, a, id));
}
id++;
}
protected void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni())); }
protected final ArrayList<Edge> getEdge(){ return edge; }
protected final String output() {
final StringBuilder sb = new StringBuilder();
for(int i = 0, j; i < n;) {
j = 0;
for(final var ed: get(i)) {
sb.append(ed.to);
if(++j < get(i).size()) {
sb.append(' ');
}
}
if(++i < n) {
sb.append('\n');
}
}
return sb.toString();
}
protected final int[] allDist(final int v) {
final int[] d = new int[n];
Arrays.fill(d, -1);
final Queue<Integer> q = new ArrayDeque<>();
d[v] = 0;
q.add(v);
while(!q.isEmpty()) {
final int tmp = q.poll();
for(final Edge el: this.get(tmp)) {
if(d[el.to] != -1) {
continue;
}
d[el.to] = d[tmp] + 1;
q.add(el.to);
}
}
return d;
}
protected final int dist(final int u, final int v){ return allDist(u)[v]; }
protected final ArrayList<Integer> topologicalSort() {
final int[] deg = new int[n];
for(int i = 0; i < n; ++i) {
for(final Edge ed: this.get(i)) {
deg[ed.to]++;
}
}
final Stack<Integer> sk = new Stack<>();
for(int i = 0; i < n; ++i) {
if(deg[i] == 0) {
sk.add(i);
}
}
final ArrayList<Integer> ord = new ArrayList<>();
while(!sk.isEmpty()) {
final int tmp = sk.pop();
ord.add(tmp);
for(final Edge ed: this.get(tmp)) {
if(--deg[ed.to] == 0) {
sk.add(ed.to);
}
}
}
return n == ord.size() ? ord : null;
}
protected final int[] cycleDetector() {
final int[] used = new int[n];
final Edge[] pre = new Edge[n];
final ArrayList<Edge> cycle = new ArrayList<>();
final RecursiveIntPredicate dfs = (rec, i) -> {
used[i] = 1;
for(final Edge e: get(i)) {
if(used[e.to] == 0) {
pre[e.to] = e;
if(rec.test(rec, e.to)) {
return true;
}
} else if(used[e.to] == 1) {
int now = i;
while(now != e.to) {
cycle.add(pre[now]);
now = pre[now].src;
}
cycle.add(e);
return true;
}
}
used[i] = 2;
return false;
};
for(int i = 0; i < n; ++i) {
if(used[i] == 0 && dfs.test(dfs, i)) {
Collections.reverse(cycle);
return cycle.stream().mapToInt(e -> e.to).toArray();
}
}
return null;
}
@Override
public String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; ++i) {
final int m = get(i).size();
sb.append(i + ": [");
for(int j = 0; j < m; ++j) {
sb.append(get(i).get(j).to);
if(j + 1 < m) {
sb.append(", ");
}
}
sb.append(']');
if(i + 1 < n) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class ShortestPath {
private final long[] cost;
private final int[] src;
ShortestPath(final long[] cost, final int[] src) {
this.cost = cost;
this.src = src;
}
final boolean isThru(final int i){ return src[i] != -1; }
final int[] path(int i) {
final List<Integer> res = new ArrayList<>();
for(; i != -1; i = src[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(k -> k).toArray();
}
final long[] get(){ return cost; }
}
final class MST {
public final ArrayList<Edge> tree;
public final long cost;
MST(final ArrayList<Edge> tree, final long cost) {
this.tree = tree;
this.cost = cost;
}
}
final class WeightedGraph extends Graph {
WeightedGraph(final int n, final boolean undirected){ super(n, undirected); }
WeightedGraph(final int n, final int indexed, final boolean undirected){ super(n, indexed, undirected); }
static final WeightedGraph of(final List<ArrayList<Edge>> g, final boolean undirected) {
int max = 0, min = Integer.MAX_VALUE;
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
max = max(e.src, e.to);
min = min(e.src, e.to);
}
}
final WeightedGraph gp = new WeightedGraph(max, min, undirected);
for(int i = 0; i < g.size(); ++i) {
for(final Edge e: g.get(i)) {
gp.addEdge(e.src, e.to, e.cost);
}
}
return gp;
}
final void addEdge(int a, int b, final long cost) {
a -= indexed;
b -= indexed;
this.get(a).add(new Edge(a, b, cost, id));
edge.add(new Edge(a, b, cost, id));
if(undirected) {
this.get(b).add(new Edge(b, a, cost, id));
edge.add(new Edge(b, a, cost, id));
}
id++;
}
@Override
protected final void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni(), VvyLw.io.nl())); }
final ShortestPath dijkstra(final int v) {
final long[] cost = new long[n];
final int[] src = new int[n];
Arrays.fill(cost, Long.MAX_VALUE);
Arrays.fill(src, -1);
final Queue<IntPair> dj = new PriorityQueue<>();
cost[v] = 0;
dj.add(IntPair.of(cost[v], v));
while(!dj.isEmpty()) {
final IntPair tmp = dj.poll();
if(cost[tmp.second.intValue()] < tmp.first.longValue()) {
continue;
}
for(final Edge ed: this.get(tmp.second.intValue())) {
final long next = tmp.first.longValue() + ed.cost;
if(cost[ed.to] <= next) {
continue;
}
cost[ed.to] = next;
src[ed.to] = tmp.second.intValue();
dj.add(IntPair.of(cost[ed.to], ed.to));
}
}
return new ShortestPath(cost, src);
}
final long[] spfa(final int v) {
final long[] cost = new long[n];
Arrays.fill(cost, Long.MAX_VALUE);
final boolean[] pend = new boolean[n];
final int[] cnt = new int[n];
final Queue<Integer> q = new ArrayDeque<>();
q.add(v);
pend[v] = true;
cnt[v]++;
cost[v] = 0;
while(!q.isEmpty()) {
final int p = q.poll();
pend[p] = false;
for(final Edge e: this.get(p)) {
final long next = cost[p] + e.cost;
if(next >= cost[e.to]) {
continue;
}
cost[e.to] = next;
if(!pend[e.to]) {
if(++cnt[e.to] >= n) {
return null;
}
pend[e.to] = true;
q.add(e.to);
}
}
}
return cost;
}
final long[][] floydWarshall() {
final long[][] cost = new long[n][n];
IntStream.range(0, n).forEach(i -> Arrays.fill(cost[i], VvyLw.LINF));
IntStream.range(0, n).forEach(i -> cost[i][i] = 0);
for(int i = 0; i < n; ++i) {
for(final Edge j: this.get(i)) {
cost[i][j.to] = j.cost;
}
}
for(int k = 0; k < n; ++k) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
if(cost[i][k] == VvyLw.LINF || cost[k][j] == VvyLw.LINF) {
continue;
}
if(cost[i][j] > cost[i][k] + cost[k][j]) {
cost[i][j] = cost[i][k] + cost[k][j];
}
}
}
}
return cost;
}
final MST kruskal() {
final UnionFind uf = new UnionFind(n);
final ArrayList<Edge> e = new ArrayList<>();
long res = 0;
for(final Edge ed: edge.stream().sorted(Comparator.comparing(ed -> ed.cost)).collect(Collectors.toList())) {
if(uf.unite(ed.src, ed.to)) {
e.add(ed);
res += ed.cost;
}
}
return new MST(e, res);
}
final MST directed(final int v) {
@SuppressWarnings("unchecked")
final ArrayList<Edge> ed = (ArrayList<Edge>) edge.clone();
for(int i = 0; i < n; ++i) {
if(i != v) {
ed.add(new Edge(i, v, 0));
}
}
int x = 0;
final int[] par = new int[2 * n], vis = new int[2 * n], link = new int[2 * n];
Arrays.fill(par, -1);
Arrays.fill(vis, -1);
Arrays.fill(link, -1);
final SkewHeap heap = new SkewHeap(true);
final SkewHeap.Node[] ins = new SkewHeap.Node[2 * n];
Arrays.fill(ins, null);
for(int i = 0; i < ed.size(); i++) {
final Edge e = ed.get(i);
ins[e.to] = heap.push(ins[e.to], e.cost, i);
}
final ArrayList<Integer> st = new ArrayList<>();
final IntUnaryOperator go = z -> {
z = ed.get(ins[z].idx).src;
while(link[z] != -1) {
st.add(z);
z = link[z];
}
for(final int p: st) {
link[p] = z;
}
st.clear();
return z;
};
for(int i = n; ins[x] != null; ++i) {
while(vis[x] == -1) {
vis[x] = 0;
x = go.applyAsInt(x);
}
while(x != i) {
final long w = ins[x].key;
SkewHeap.Node z = heap.pop(ins[x]);
z = heap.add(z, -w);
ins[i] = heap.meld(ins[i], z);
par[x] = i;
link[x] = i;
x = go.applyAsInt(x);
}
while(ins[x] != null && go.applyAsInt(x) == x) {
ins[x] = heap.pop(ins[x]);
}
}
for(int i = v; i != -1; i = par[i]) {
vis[i] = 1;
}
long cost = 0;
final ArrayList<Edge> e = new ArrayList<>();
for(int i = x; i >= 0; i--) {
if(vis[i] == 1) {
continue;
}
cost += ed.get(ins[i].idx).cost;
e.add(ed.get(ins[i].idx));
for(int j = ed.get(ins[i].idx).to; j != -1 && vis[j] == 0; j = par[j]) {
vis[j] = 1;
}
}
return new MST(e, cost);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; ++i) {
final int m = get(i).size();
sb.append(i + ": [");
for(int j = 0; j < m; ++j) {
sb.append("(to: " + get(i).get(j).to + ", cost: " + get(i).get(j).cost + ')');
if(j + 1 < m) {
sb.append(", ");
}
}
sb.append(']');
if(i + 1 < n) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class SkewHeap {
static final class Node {
long key, lazy;
Node l, r;
final int idx;
Node(final long key, final int idx) {
this.key = key;
this.idx = idx;
lazy = 0;
l = null;
r = null;
}
}
private final boolean isMin;
SkewHeap(final boolean isMin){ this.isMin = isMin; }
private final Node alloc(final long key, final int idx){ return new Node(key, idx); }
private final Node propagate(final Node t) {
if(t != null && t.lazy != 0) {
if(t.l != null) {
t.l.lazy += t.lazy;
}
if(t.r != null) {
t.r.lazy += t.lazy;
}
t.key += t.lazy;
t.lazy = 0;
}
return t;
}
final Node meld(Node x, Node y) {
propagate(x);
propagate(y);
if(x == null || y == null) {
return x != null ? x : y;
}
if((x.key < y.key) ^ isMin) {
final Node tmp = x;
x = y;
y = tmp;
}
x.r = meld(y, x.r);
final Node tmp = x.l;
x.l = x.r;
x.r = tmp;
return x;
}
final Node push(final Node t, final long key, final int idx){ return meld(t, alloc(key, idx)); }
final Node pop(final Node t) {
if(t == null) {
throw new NullPointerException();
}
return meld(t.l, t.r);
}
final Node add(final Node t, final long lazy) {
if(t != null) {
t.lazy += lazy;
propagate(t);
}
return t;
}
}
final class SCC {
private final int n, indexed;
private int m;
private final ArrayList<Edge> edge;
private final int[] start, ids;
private int[][] groups;
private boolean notBuilt;
SCC(final int n){ this(n, 1); }
SCC(final int n, final int indexed) {
this.n = n;
this.indexed = indexed;
edge = new ArrayList<>();
start = new int[n + 1];
ids = new int[n];
m = 0;
notBuilt = true;
}
final void addEdge(int from, int to) {
from -= indexed;
to -= indexed;
rangeCheck(from);
rangeCheck(to);
edge.add(new Edge(from, to, m++));
start[from + 1]++;
}
final void input(final int m){ IntStream.range(0, m).forEach(i -> addEdge(VvyLw.io.ni(), VvyLw.io.ni())); }
final int id(final int i) {
if(notBuilt) {
throw new UnsupportedOperationException("Graph hasn't been built.");
}
rangeCheck(i);
return ids[i];
}
final void build() {
for(int i = 1; i <= n; i++) {
start[i] += start[i - 1];
}
final Edge[] ed = new Edge[m];
final int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for(final Edge e: edge) {
ed[count[e.src]++] = e;
}
int nowOrd = 0, groupNum = 0, k = 0, ptr = 0;
final int[] par = new int[n], vis = new int[n], low = new int[n], ord = new int[n];
Arrays.fill(ord, -1);
final long[] stack = new long[n];
for(int i = 0; i < n; i++) {
if(ord[i] >= 0) {
continue;
}
par[i] = -1;
stack[ptr++] = 0L << 32 | i;
while(ptr > 0) {
long p = stack[--ptr];
int u = (int) (p & 0xffff_ffffl);
int j = (int) (p >>> 32);
if(j == 0) {
low[u] = ord[u] = nowOrd++;
vis[k++] = u;
}
if(start[u] + j < count[u]) {
int to = ed[start[u] + j].to;
stack[ptr++] += 1l << 32;
if(ord[to] == -1) {
stack[ptr++] = 0l << 32 | to;
par[to] = u;
} else {
low[u] = min(low[u], ord[to]);
}
} else {
while(j --> 0) {
final int to = ed[start[u] + j].to;
if(par[to] == u) {
low[u] = min(low[u], low[to]);
}
}
if(low[u] == ord[u]) {
while(true) {
final 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];
}
final int[] counts = new int[groupNum];
for(final int x: ids) {
counts[x]++;
}
groups = new int[groupNum][];
for(int i = 0; i < groupNum; i++) {
groups[i] = new int[counts[i]];
}
for(int i = 0; i < n; i++) {
int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
notBuilt = false;
}
final int[][] groups() {
if(notBuilt) {
throw new UnsupportedOperationException("Graph hasn't been built.");
}
return groups;
}
private final void rangeCheck(final int i) {
if(!Utility.scope(0, i, n - 1)) {
throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, n));
}
}
}
final class LowestCommonAncestor {
private final int log;
private final int[] dep, sum;
private final Graph g;
private final int[][] table;
LowestCommonAncestor(final Graph g) {
this.g = g;
final int n = g.size();
dep = new int[n];
sum = new int[n];
log = Integer.toBinaryString(n).length();
table = new int[log][n];
IntStream.range(0, log).forEach(i -> Arrays.fill(table[i], -1));
build();
}
private final void dfs(final int idx, final int par, final int d) {
table[0][idx] = par;
dep[idx] = d;
for(final Edge el: g.get(idx)) {
if(el.to != par) {
sum[el.to] = (int) (sum[idx] + el.cost);
dfs(el.to, idx, d + 1);
}
}
}
private final void build() {
dfs(0, -1, 0);
for(int k = 0; k < log - 1; ++k) {
for(int i = 0; i < table[k].length; ++i) {
if(table[k][i] == -1) {
table[k + 1][i] = -1;
} else {
table[k + 1][i] = table[k][table[k][i]];
}
}
}
}
final int query(int u, int v) {
if(dep[u] > dep[v]) {
u ^= v;
v ^= u;
u ^= v;
}
v = climb(v, dep[v] - dep[u]);
if(u == v) {
return u;
}
for(int i = log; --i >= 0;) {
if(table[i][u] != table[i][v]) {
u = table[i][u];
v = table[i][v];
}
}
return table[0][u];
}
final int climb(int u, final int k) {
if(dep[u] < k) {
return -1;
}
for(int i = log; --i >= 0;) {
if(((k >> i) % 2) == 1) {
u = table[i][u];
}
}
return u;
}
final int dist(final int u, final int v){ return sum[u] + sum[v] - 2 * sum[query(u, v)]; }
}
interface DSU {
int root(final int i);
int size(final int i);
int size();
default boolean same(final int i, final int j){ return root(i) == root(j); }
boolean unite(int i, int j);
ArrayList<ArrayList<Integer>> groups();
}
class UnionFind implements DSU {
protected final int[] par;
UnionFind(final int n) {
par = new int[n];
Arrays.fill(par, -1);
}
@Override
public final int root(final int i){ return par[i] >= 0 ? par[i] = root(par[i]) : i; }
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public boolean unite(int i, int j) {
i = root(i);
j = root(j);
if(i == j) {
return false;
}
if(i > j) {
i ^= j;
j ^= i;
i ^= j;
}
par[i] += par[j];
par[j] = i;
return true;
}
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>(n);
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
}
abstract class MergeUnionFind<T> extends UnionFind {
MergeUnionFind(final int n){ super(n); }
abstract void merge(final int i, final int j);
abstract T get(final int i);
@Override
public final boolean unite(int i, int j) {
i = root(i);
j = root(j);
if(i == j) {
return false;
}
if(i > j) {
i ^= j;
j ^= i;
i ^= j;
}
par[i] += par[j];
par[j] = i;
merge(i, j);
return true;
}
}
final class WeightedUnionFind implements DSU {
private final int[] par;
private final long[] weight;
WeightedUnionFind(final int n) {
par = new int[n];
weight = new long[n];
Arrays.fill(par, -1);
}
@Override
public final int root(final int i) {
if(par[i] < 0) {
return i;
}
final int r = root(par[i]);
weight[i] += weight[par[i]];
return par[i] = r;
}
final long get(final int i) {
root(i);
return weight[i];
}
final long diff(final int x, final int y){ return get(y) - get(x); }
final int unite(int x, int y, long w) {
w += diff(y, x);
x = root(x);
y = root(y);
if(x == y) {
return w == 0 ? 0 : -1;
}
if(par[x] > par[y]) {
x ^= y;
y ^= x;
x ^= y;
w = -w;
}
par[x] += par[y];
par[y] = x;
weight[y] = w;
return 1;
}
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>();
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
// deprecated
@Override
public final boolean unite(final int i, final int j){ return unite(i, j, 0) > 0; }
}
final class UndoUnionFind implements DSU {
private final int[] par;
private final Stack<Pair<Integer, Integer>> his;
UndoUnionFind(final int n) {
par = new int[n];
Arrays.fill(par, -1);
his = new Stack<>();
}
@Override
public final boolean unite(int x, int y) {
x = root(x);
y = root(y);
his.add(Pair.of(x, par[x]));
his.add(Pair.of(y, par[y]));
if(x == y) {
return false;
}
if(par[x] > par[y]) {
x ^= y;
y ^= x;
x ^= y;
}
par[x] += par[y];
par[y] = x;
return true;
}
@Override
public final int root(final int i) {
if(par[i] < 0) {
return i;
}
return root(par[i]);
}
@Override
public final int size(final int i){ return -par[root(i)]; }
@Override
public final int size(){ return par.length; }
@Override
public final ArrayList<ArrayList<Integer>> groups() {
final int n = par.length;
final ArrayList<ArrayList<Integer>> res = new ArrayList<>();
IntStream.range(0, n).forEach(i -> res.add(new ArrayList<>()));
IntStream.range(0, n).forEach(i -> res.get(root(i)).add(i));
res.removeIf(ArrayList::isEmpty);
return res;
}
final void undo() {
final Pair<Integer, Integer> pop1 = his.pop(), pop2 = his.pop();
par[pop1.first] = pop1.second;
par[pop2.first] = pop2.second;
}
final void snapshot() {
while(!his.empty()) {
his.pop();
}
}
final void rollback() {
while(!his.empty()) {
undo();
}
}
}
final class PrimeTable {
private final int[] p;
private final boolean[] sieve;
PrimeTable(final int n) {
sieve = new boolean[n + 1];
Arrays.fill(sieve, true);
sieve[0] = sieve[1] = false;
for(int i = 2; i <= n; ++i) {
if(!sieve[i]) {
continue;
}
for(long j = (long) i * i; j <= n; j += i) {
sieve[(int) j] = false;
}
}
final int size = (int) IntStream.rangeClosed(0, n).filter(i -> sieve[i]).count();
int j = 0;
p = new int[size];
for(int i = 2; i <= n; ++i) {
if(sieve[i]) {
p[j++] = i;
}
}
}
final boolean[] table(){ return sieve; }
final int[] get(){ return p; }
}
final class PrimeFactor {
private final int[] spf;
PrimeFactor(final int n) {
spf = Utility.iota(n + 1).toArray();
for(int i = 2; i * i <= n; ++i) {
if(spf[i] != i) {
continue;
}
for(int j = i * i; j <= n; j += i) {
if(spf[j] == j) {
spf[j] = i;
}
}
}
}
final TreeMap<Integer, Integer> get(int n) {
final TreeMap<Integer, Integer> m = new TreeMap<>();
while(n != 1) {
m.merge(spf[n], 1, (a, b) -> (a + b));
n /= spf[n];
}
return m;
}
}
final class PrimeCounter {
private final int sq;
private final boolean[] p;
private final int[] psum;
private final ArrayList<Integer> ps;
PrimeCounter(final long n) {
sq = (int) kthRooti(n, 2);
psum = new int[sq + 1];
p = new PrimeTable(sq).table();
for(int i = 1; i <= sq; ++i) {
psum[i] = psum[i - 1] + (p[i] ? 1 : 0);
}
ps = new ArrayList<>();
for(int i = 1; i <= sq; ++i) {
if(p[i]) {
ps.add(i);
}
}
}
private final long kthRooti(final long n, final int k){ return Utility.kthRoot(n, k); }
private final long p2(final long x, final long y) {
if(x < 4) {
return 0;
}
final long a = pi(y);
final long b = pi(kthRooti(x, 2));
if(a >= b) {
return 0;
}
long sum = (long) (a - 2) * (a + 1) / 2 - (b - 2) * (b + 1) / 2;
for(long i = a; i < b; ++i) {
sum += pi(x / ps.get((int) i));
}
return sum;
}
private final long phi(final long m, final long a) {
if(m < 1) {
return 0;
}
if(a > m) {
return 1;
}
if(a < 1) {
return m;
}
if(m <= (long) ps.get((int) (a - 1)) * ps.get((int) (a - 1))) {
return pi(m) - a + 1;
}
if(m <= (long) ps.get((int) (a - 1)) * ps.get((int) (a - 1)) * ps.get((int) (a - 1)) && m <= sq) {
final long sx = pi(kthRooti(m, 2));
long ans = pi(m) - (long) (sx + a - 2) * (sx - a + 1) / 2;
for(long i = a; i < sx; ++i) {
ans += pi(m / ps.get((int) i));
}
return ans;
}
return phi(m, a - 1) - phi(m / ps.get((int) (a - 1)), a - 1);
}
final long pi(final long n) {
if(n <= sq) {
return psum[(int) n];
}
final long m = kthRooti(n, 3);
final long a = pi(m);
return phi(n, a) + a - 1 - p2(n, m);
}
}
// N <= 1e18;
final class LongPrime {
private static final int bsf(final long x){ return Long.numberOfTrailingZeros(x); }
private static final long gcd(long a, long b) {
a = abs(a);
b = abs(b);
if(a == 0) {
return b;
}
if(b == 0) {
return a;
}
final int shift = bsf(a|b);
a >>= bsf(a);
do {
b >>= bsf(b);
if(a > b) {
a ^= b;
b ^= a;
a ^= b;
}
b -= a;
} while(b > 0);
return a << shift;
}
static final boolean isPrime(final long n) {
if(n <= 1) {
return false;
}
if(n == 2) {
return true;
}
if(n % 2 == 0) {
return false;
}
long d = n - 1;
while(d % 2 == 0) {
d /= 2;
}
final long[] sample = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
for(final long a: sample) {
if(n <= a) {
break;
}
long t = d;
BigInteger y = BigInteger.valueOf(a).modPow(BigInteger.valueOf(t), BigInteger.valueOf(n));
while(t != n - 1 && !y.equals(BigInteger.ONE) && !y.equals(BigInteger.valueOf(n).subtract(BigInteger.ONE))) {
y = y.multiply(y).mod(BigInteger.valueOf(n));
t <<= 1;
}
if(!y.equals(BigInteger.valueOf(n).subtract(BigInteger.ONE)) && t % 2 == 0) {
return false;
}
}
return true;
}
private static final long find(final long n) {
if(isPrime(n)) {
return n;
}
if(n % 2 == 0) {
return 2;
}
long st = 0;
final LongBinaryOperator f = (x, y) -> { return BigInteger.valueOf(x).multiply(BigInteger.valueOf(x)).add(BigInteger.valueOf(y)).mod(BigInteger.valueOf(n)).longValue(); };
while(true) {
st++;
long x = st, y = f.applyAsLong(x, st);
while(true) {
final long p = gcd(y - x + n, n);
if(p == 0 || p == n) {
break;
}
if(p != 1) {
return p;
}
x = f.applyAsLong(x, st);
y = f.applyAsLong(f.applyAsLong(y, st), st);
}
}
}
static final ArrayList<Long> primeFactor(final long n) {
if(n == 1) return new ArrayList<>();
final long x = find(n);
if(x == n) return new ArrayList<>(Arrays.asList(x));
final ArrayList<Long> l = primeFactor(x), r = primeFactor(n / x);
l.addAll(r);
Collections.sort(l);
return l;
}
}
// N > 1e18
final class BigPrime {
private static final int bsf(final long x){ return Long.numberOfTrailingZeros(x); }
private static final BigInteger gcd(BigInteger a, BigInteger b) {
a = a.abs();
b = b.abs();
if(a.equals(BigInteger.ZERO)) {
return b;
}
if(b.equals(BigInteger.ZERO)) {
return a;
}
final int shift = bsf(a.or(b).longValue());
a = a.shiftRight(bsf(a.longValue()));
do {
b = b.shiftRight(bsf(b.longValue()));
if(a.compareTo(b) > 0) {
final BigInteger tmp = b;
b = a;
a = tmp;
}
b = b.subtract(a);
} while(b.compareTo(BigInteger.ZERO) > 0);
return a.shiftLeft(shift);
}
static final boolean isPrime(final BigInteger n) {
if(n.compareTo(BigInteger.ONE) <= 0) {
return false;
}
if(n.equals(BigInteger.TWO)) {
return true;
}
if(n.and(BigInteger.ONE).equals(BigInteger.valueOf(0))) {
return false;
}
BigInteger d = n.subtract(BigInteger.ONE);
while(d.and(BigInteger.ONE).equals(BigInteger.valueOf(0))) {
d = d.shiftRight(1);
}
final long[] sample = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37};
for(final long a: sample) {
if(n.compareTo(BigInteger.valueOf(a)) <= 0) {
break;
}
BigInteger t = d;
BigInteger y = BigInteger.valueOf(a).modPow(t, n);
while(!t.equals(n.subtract(BigInteger.ONE)) && !y.equals(BigInteger.ONE) && !y.equals(n.subtract(BigInteger.ONE))) {
y = y.multiply(y).mod(n);
t = t.shiftLeft(1);
}
if(!y.equals(n.subtract(BigInteger.ONE)) && t.and(BigInteger.ONE).equals(BigInteger.ZERO)) {
return false;
}
}
return true;
}
private static final BigInteger find(final BigInteger n) {
if(isPrime(n)) {
return n;
}
if(n.and(BigInteger.ONE).equals(BigInteger.ZERO)) {
return BigInteger.TWO;
}
int st = 0;
final BiFunction<BigInteger, Integer, BigInteger> f = (x, y) -> { return x.multiply(x).add(BigInteger.valueOf(y)).mod(n); };
while(true) {
st++;
BigInteger x = BigInteger.valueOf(st), y = f.apply(x, st);
while(true) {
final BigInteger p = gcd(y.subtract(x).add(n), n);
if(p.equals(BigInteger.ZERO) || p.equals(n)) {
break;
}
if(!p.equals(BigInteger.ONE)) {
return p;
}
x = f.apply(x, st);
y = f.apply(f.apply(y, st), st);
}
}
}
static final ArrayList<BigInteger> primeFactor(final BigInteger n) {
if(n.equals(BigInteger.ONE)) {
return new ArrayList<>();
}
final BigInteger x = find(n);
if(x.equals(n)) {
return new ArrayList<>(Arrays.asList(x));
}
final ArrayList<BigInteger> l = primeFactor(x), r = primeFactor(n.divide(x));
l.addAll(r);
Collections.sort(l);
return l;
}
}
final class ModPrime {
private final int len, mod;
private final long[] f, rf;
ModPrime(final int mod, final int sz) {
this.mod = mod;
len = min(sz + 1, mod);
f = new long[len];
rf = new long[len];
init();
}
private final long inv(long x) {
long res = 1, k = mod - 2;
while(k > 0) {
if(k % 2 == 1) {
res = (res * x) % mod;
}
x = (x * x) % mod;
k >>= 1;
}
return res;
}
private final void init() {
f[0] = 1;
for(int i = 0; ++i < len;) {
f[i] = (f[i - 1] * i) % mod;
}
rf[len - 1] = inv(f[len - 1]);
for(int i = len; --i > 0;) {
rf[i - 1] = (rf[i] * i) % mod;
}
}
final long C(final int n, final int k) {
if(k < 0 || n < k) {
return 0;
}
final long a = f[n], b = rf[n - k], c = rf[k], bc = (b * c) % mod;
return (a * bc) % mod;
}
final long P(final int n, final int k) {
if (k < 0 || n < k) {
return 0;
}
final long a = f[n], b = rf[n - k];
return (a * b) % mod;
}
final long H(final int n, final int k) {
if (n == 0 && k == 0) {
return 1;
}
return C(n + k - 1, k);
}
final long fact(final int n){ return f[n]; }
}
final class EulerPhiTable {
private final int[] euler;
EulerPhiTable(final int n) {
euler = Utility.iota(n + 1).toArray();
for(int i = 2; i <= n; ++i) {
if(euler[i] == i) {
for(int j = i; j <= n; j += i) {
euler[j] = euler[j] / i * (i - 1);
}
}
}
}
final int[] get(){ return euler; }
}
final class DP {
static final long knapsack01(final int[] a, final long[] v, final int w) {
final int n = a.length;
final long[] dp = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = w; j >= a[i]; j--) {
if(dp[j - a[i]] != Long.MIN_VALUE) {
if(dp[j - a[i]] + v[i] > dp[j]) {
dp[j] = dp[j - a[i]] + v[i];
}
}
}
}
return Utility.max(dp);
}
static final int knapsack01(final long[] a, final int[] v, final long w) {
final int n = a.length;
final int s = (int) Utility.sum(v);
final long[] dp = new long[s + 1];
Arrays.fill(dp, w + 1);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = s; j >= v[i]; j--) {
dp[j] = Math.min(dp[j], dp[j - v[i]] + a[i]);
}
}
int res = 0;
for(int i = 0; i <= s; i++) {
if(dp[i] <= w) {
res = i;
}
}
return res;
}
private static final long[] knapsack(final int[] a, final long[] v, final int[] m, final int w, final boolean less) {
final int n = a.length;
final long[] dp = new long[w + 1], deqv = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
final int[] deq = new int[w + 1];
for(int i = 0; i < n; ++i) {
if(a[i] == 0) {
for(int j = 0; j <= w; ++j) {
if(dp[j] != Long.MIN_VALUE && (less ? dp[j] + v[i] * m[i] < dp[j] : dp[j] + v[i] * m[i] > dp[j])) {
dp[j] = dp[j] + v[i] * m[i];
}
}
} else {
for(int k = 0; k < a[i]; ++k) {
int s = 0, t = 0;
for(int j = 0; a[i] * j + k <= w; ++j) {
if(dp[a[i] * j + k] != Long.MIN_VALUE) {
final long val = dp[a[i] * j + k] - j * v[i];
while(s < t && (less ? val < deqv[t - 1] : val > deqv[t - 1])) {
t--;
}
deq[t] = j;
deqv[t++] = val;
}
if(s < t) {
dp[j * a[i] + k] = deqv[s] + j * v[i];
if(deq[s] == j - m[i]) {
s++;
}
}
}
}
}
}
return dp;
}
static final long knapsack(final int[] a, final long[] v, final int[] m, final int w){ return Utility.max(knapsack(a, v, m, w, false)); }
static final long knapsack(final long[] a, final int[] v, final long[] m, final long w) {
final int n = a.length;
final int max = Utility.max(v);
if(max == 0) {
return 0;
}
final int[] ma = new int[n];
final long[] mb = new long[n];
for(int i = 0; i < n; i++) {
ma[i] = (int) Math.min(m[i], max - 1);
mb[i] = m[i] - ma[i];
}
int sum = 0;
for(int i = 0; i < n; ++i) {
sum += ma[i] * v[i];
}
final long[] dp = knapsack(v, a, ma, sum, true);
final int[] id = Utility.iota(n).boxed().sorted((i, j) -> -Long.compare(v[i] * a[j], v[j] * a[i])).mapToInt(i -> i).toArray();
long res = 0;
for(int i = 0; i < dp.length; ++i) {
if(dp[i] > w || dp[i] == Long.MIN_VALUE) {
continue;
}
long rest = w - dp[i], cost = i;
for(final int j: id) {
final long get = Math.min(mb[j], rest / a[j]);
if(get <= 0) {
continue;
}
cost += get * v[j];
rest -= get * a[j];
}
res = Math.max(res, cost);
}
return res;
}
static final long knapsack(final int[] a, final long[] v, final int w) {
final int n = a.length;
final long[] dp = new long[w + 1];
Arrays.fill(dp, Long.MIN_VALUE);
dp[0] = 0;
for(int i = 0; i < n; i++) {
for(int j = a[i]; j <= w; j++) {
if(dp[j - a[i]] != Long.MIN_VALUE) {
if(dp[j - a[i]] + v[i] > dp[j]) {
dp[j] = dp[j - a[i]] + v[i];
}
}
}
}
return Utility.max(dp);
}
static final long maxRectangle(final int[] a) {
final Stack<Integer> sk = new Stack<>();
final long[] h = new long[a.length + 1];
for(int i = 0; i < a.length; ++i) {
h[i] = a[i];
}
final int[] l = new int[h.length];
long res = 0;
for(int i = 0; i < h.length; i++) {
while(!sk.isEmpty() && h[sk.peek()] >= h[i]) {
res = max(res, (i - l[sk.peek()] - 1) * h[sk.pop()]);
}
l[i] = sk.isEmpty() ? -1 : sk.peek();
sk.add(i);
}
return res;
}
static final long maxRectangle(final long[] a) {
final Stack<Integer> sk = new Stack<>();
final long[] h = Arrays.copyOf(a, a.length + 1);
final int[] l = new int[h.length];
long res = 0;
for(int i = 0; i < h.length; i++) {
while(!sk.isEmpty() && h[sk.peek()] >= h[i]) {
res = max(res, (i - l[sk.peek()] - 1) * h[sk.pop()]);
}
l[i] = sk.isEmpty() ? -1 : sk.peek();
sk.add(i);
}
return res;
}
static final int lcs(final String s, final String t) {
final int n = s.length();
final int[] dp = new int[n + 1], ndp = new int[n + 1];
for(int i = 0; i < t.length(); ++i) {
for(int j = 0; j < n; ++j) {
if(s.charAt(j) == t.charAt(i)) {
ndp[j + 1] = dp[j] + 1;
} else {
ndp[j + 1] = max(ndp[j], dp[j + 1]);
}
}
Utility.swap(dp, ndp);
}
return dp[n];
}
static final int[] lis(final int[] a) {
final int n = a.length;
List<IntPair> dp = new ArrayList<IntPair>();
final int[] p = new int[n];
Arrays.fill(p, -1);
for(int i = 0; i < n; ++i) {
final int id = Utility.lowerBound(dp, IntPair.of(a[i], -i));
if(id != 0) {
p[i] = -dp.get(id - 1).second.intValue();
}
if(id == dp.size()) {
dp.add(IntPair.of(a[i], -i));
} else {
dp.set(id, IntPair.of(a[i], -i));
}
}
final List<Integer> res = new ArrayList<Integer>();
for(int i = -dp.get(dp.size() - 1).second.intValue(); i != -1; i = p[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(i -> i).toArray();
}
static final int[] lis(final long[] a) {
final int n = a.length;
List<IntPair> dp = new ArrayList<IntPair>();
final int[] p = new int[n];
Arrays.fill(p, -1);
for(int i = 0; i < n; ++i) {
final int id = Utility.lowerBound(dp, IntPair.of(a[i], -i));
if(id != 0) {
p[i] = -dp.get(id - 1).second.intValue();
}
if(id == n) {
dp.add(IntPair.of(a[i], -i));
} else {
dp.set(id, IntPair.of(a[i], -i));
}
}
final List<Integer> res = new ArrayList<Integer>();
for(int i = -dp.get(dp.size() - 1).second.intValue(); i != -1; i = p[i]) {
res.add(i);
}
Collections.reverse(res);
return res.stream().mapToInt(i -> i).toArray();
}
}
final class Matrix implements Cloneable {
private final int h, w;
private final long[][] mat;
Matrix(final int n){ this(n, n); }
Matrix(final int h, final int w) {
this.h = h;
this.w = w;
mat = new long[h][w];
}
Matrix(final int[][] m) {
this(m.length, m[0].length);
IntStream.range(0, h).forEach(i -> Arrays.setAll(mat[i], j -> m[i][j]));
}
Matrix(final long[][] m) {
this(m.length, m[0].length);
IntStream.range(0, h).forEach(i -> Arrays.setAll(mat[i], j -> m[i][j]));
}
static final Matrix E(final int n) {
final Matrix m = new Matrix(n);
IntStream.range(0, n).forEach(i -> m.set(i, i, 1));
return m;
}
final long[] getH(final int i){ return mat[i]; }
final long[] getW(final int i){ return IntStream.range(0, h).mapToLong(j -> mat[j][i]).toArray(); }
final long[][] get(){ return mat; }
final long get(final int i, final int j){ return mat[i][j]; }
final void set(final int i, final int j, final long x){ mat[i][j] = x; }
final Matrix add(final Matrix m) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, mat[i][j] + m.get(i, j));
}
}
return mt;
}
final Matrix add(final Matrix m, final long mod) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, Utility.mod(mat[i][j] + m.get(i, j), mod));
}
}
return mt;
}
final Matrix sub(final Matrix m) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, mat[i][j] - m.get(i, j));
}
}
return mt;
}
final Matrix sub(final Matrix m, final long mod) {
assert h == m.h && w == m.w;
final Matrix mt = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
mt.set(i, j, Utility.mod(mat[i][j] - m.get(i, j), mod));
}
}
return mt;
}
final Matrix mul(final Matrix m) {
assert w == m.h;
final Matrix mt = new Matrix(h, m.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < m.w; ++j) {
for(int k = 0; k < w; ++k) {
mt.set(i, j, mt.get(i, j) + mat[i][k] * m.get(k, j));
}
}
}
return mt;
}
final Matrix mul(final Matrix m, final long mod) {
assert w == m.h;
final Matrix mt = new Matrix(h, m.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < m.w; ++j) {
for(int k = 0; k < w; ++k) {
mt.set(i, j, Utility.mod(mt.get(i, j) + mat[i][k] * m.get(k, j), mod));
}
}
}
return mt;
}
final Matrix pow(int k) {
Matrix n = clone();
Matrix m = Matrix.E(h);
while(k > 0) {
if(k % 2 == 1) {
m = m.mul(n);
}
n = n.mul(n);
k >>= 1;
}
return m;
}
final Matrix pow(long k, final long mod) {
Matrix n = clone();
Matrix m = Matrix.E(h);
while(k > 0) {
if(k % 2 == 1) {
m = m.mul(n, mod);
}
n = n.mul(n, mod);
k >>= 1L;
}
return m;
}
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Matrix m = (Matrix) o;
if(h != m.h || w != m.w) {
return false;
}
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
if(mat[i][j] != m.get(i, j)) {
return false;
}
}
}
return true;
}
@Override
public final Matrix clone() {
final Matrix m = new Matrix(h, w);
for(int i = 0; i < h; ++i) {
m.mat[i] = Arrays.copyOf(mat[i], w);
}
return m;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
final int interval = String.valueOf(IntStream.range(0, h).mapToLong(i -> IntStream.range(0, w).mapToLong(j -> mat[i][j]).max().getAsLong()).max().getAsLong()).length() + 1;
for(int i = 0; i < h; ++i) {
sb.append("[");
for(int j = 0; j < w; ++j) {
sb.append(String.format("%" + interval + "d", mat[i][j]));
if(j + 1 == w) {
sb.append("]");
}
}
if(i + 1 != h) {
sb.append("\n");
}
}
return sb.toString();
}
}
class InclusiveScan {
protected final int n;
protected long[] s;
protected InclusiveScan(final int n) {
this.n = n;
s = new long[n + 1];
}
InclusiveScan(final int[] a, final LongBinaryOperator op) {
n = a.length;
s = Arrays.stream(a).asLongStream().toArray();
Arrays.parallelPrefix(s, op);
}
InclusiveScan(final long[] a, final LongBinaryOperator op) {
n = a.length;
s = a.clone();
Arrays.parallelPrefix(s, op);
}
protected final long[] get(){ return s; }
}
final class PrefixSum extends InclusiveScan {
private boolean built;
PrefixSum(final int n) {
super(n);
built = false;
}
PrefixSum(final int[] a) {
super(a, Long::sum);
s = Utility.rotate(Arrays.copyOf(s, n + 1), -1);
}
PrefixSum(final long[] a) {
super(a, Long::sum);
s = Utility.rotate(Arrays.copyOf(s, n + 1), -1);
}
final long sum(final int l, final int r){ return s[r] - s[l]; }
final void add(final int l, final int r, final long x) {
if(built) {
throw new UnsupportedOperationException("Prefix Sum has been built.");
}
s[l] += x;
s[r] -= x;
}
final long[] build() {
assert !built;
Arrays.parallelPrefix(s, Long::sum);
built = true;
return Arrays.copyOf(s, n);
}
}
final class PrefixSum2D {
private final int h, w;
private final long[][] data;
private boolean built;
PrefixSum2D(final int h, final int w) {
this.h = h + 3;
this.w = w + 3;
data = new long[this.h][this.w];
built = false;
}
PrefixSum2D(final int[][] a) {
this(a.length, a[0].length);
for(int i = 0; i < a.length; ++i) {
for(int j = 0; j < a[i].length; ++j) {
add(i, j, a[i][j]);
}
}
}
PrefixSum2D(final long[][] a) {
this(a.length, a[0].length);
for(int i = 0; i < a.length; ++i) {
for(int j = 0; j < a[i].length; ++j) {
add(i, j, a[i][j]);
}
}
}
final void add(int i, int j, final long x) {
if(built) {
throw new UnsupportedOperationException("Prefix Sum 2D has been built.");
}
i++;
j++;
if(i >= h || j >= w) {
return;
}
data[i][j] += x;
}
final void add(final int i1, final int j1, final int i2, final int j2, final long x) {
add(i1, j1, x);
add(i1, j2, -x);
add(i2, j1, -x);
add(i2, j2, x);
}
final void build() {
assert !built;
for(int i = 0; ++i < h;) {
for(int j = 0; ++j < w;) {
data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];
}
}
built = true;
}
final long get(final int i1, final int j1, final int i2, final int j2) {
if(!built) {
throw new UnsupportedOperationException("Prefix Sum 2D hasn't been built.");
}
return data[i2][j2] - data[i1][j2] - data[i2][j1] + data[i1][j1];
}
final long get(final int i, final int j) {
if(!built) {
throw new UnsupportedOperationException("Prefix Sum 2D hasn't been built.");
}
return data[i + 1][j + 1];
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < h - 3; ++i) {
sb.append(get(i, 0));
for(int j = 0; ++j < w - 3;) {
sb.append(" " + get(i, j));
}
if(i + 1 < h) {
sb.append('\n');
}
}
return sb.toString();
}
}
final class SuffixArray extends ArrayList<Integer> {
private final String vs;
SuffixArray(final String vs, final boolean compress) {
this.vs = vs;
final int[] newVS = new int[vs.length() + 1];
if(compress) {
final List<Integer> xs = vs.chars().sorted().distinct().boxed().collect(Collectors.toList());
for(int i = 0; i < vs.length(); ++i) {
newVS[i] = Utility.lowerBound(xs, (int) vs.charAt(i)) + 1;
}
} else {
final int d = vs.chars().min().getAsInt();
for(int i = 0; i < vs.length(); ++i) {
newVS[i] = vs.charAt(i) - d + 1;
}
}
this.addAll(Arrays.stream(SAIS(newVS)).boxed().collect(Collectors.toList()));
}
private final int[] SAIS(final int[] s) {
final int n = s.length;
final int[] ret = new int[n];
final boolean[] isS = new boolean[n], isLMS = new boolean[n];
int m = 0;
for(int i = n - 2; i >= 0; i--) {
isS[i] = (s[i] > s[i + 1]) || (s[i] == s[i + 1] && isS[i + 1]);
m += (isLMS[i + 1] = isS[i] && !isS[i + 1]) ? 1 : 0;
}
final Consumer<ArrayList<Integer>> inducedSort = (lms) -> {
final int upper = Arrays.stream(s).max().getAsInt();
final int[] l = new int[upper + 2], r = new int[upper + 2];
for(final int v: s) {
++l[v + 1];
++r[v];
}
Arrays.parallelPrefix(l, (x, y) -> x + y);
Arrays.parallelPrefix(r, (x, y) -> x + y);
Arrays.fill(ret, -1);
for(int i = lms.size(); --i >= 0;) {
ret[--r[s[lms.get(i)]]] = lms.get(i);
}
for(final int v: ret) {
if(v >= 1 && isS[v - 1]) {
ret[l[s[v - 1]]++] = v - 1;
}
}
Arrays.fill(r, 0);
for(final int v: s) {
++r[v];
}
Arrays.parallelPrefix(r, (x, y) -> x + y);
for(int k = ret.length - 1, i = ret[k]; k >= 1; i = ret[--k]) {
if(i >= 1 && !isS[i - 1]) {
ret[--r[s[i - 1]]] = i - 1;
}
}
};
final ArrayList<Integer> lms = new ArrayList<>(), newLMS = new ArrayList<>();
for(int i = 0; ++i < n;) {
if(isLMS[i]) {
lms.add(i);
}
}
inducedSort.accept(lms);
for(int i = 0; i < n; ++i) {
if(!isS[ret[i]] && ret[i] > 0 && isS[ret[i] - 1]) {
newLMS.add(ret[i]);
}
}
final BiPredicate<Integer, Integer> same = (a, b) -> {
if(s[a++] != s[b++]) {
return false;
}
while(true) {
if(s[a] != s[b]) {
return false;
}
if(isLMS[a] || isLMS[b]) {
return isLMS[a] && isLMS[b];
}
a++;
b++;
}
};
int rank = 0;
ret[n - 1] = 0;
for(int i = 0; ++i < m;) {
if(!same.test(newLMS.get(i - 1), newLMS.get(i))) {
++rank;
}
ret[newLMS.get(i)] = rank;
}
if(rank + 1 < m) {
final int[] newS = new int[m];
for(int i = 0; i < m; ++i) {
newS[i] = ret[lms.get(i)];
}
final var lmsSA = SAIS(newS);
IntStream.range(0, m).forEach(i -> newLMS.set(i, lms.get(lmsSA[i])));
}
inducedSort.accept(newLMS);
return ret;
}
private final boolean ltSubstr(final String t, int si, int ti) {
final int sn = vs.length(), tn = t.length();
while(si < sn && ti < tn) {
if(vs.charAt(si) < t.charAt(ti)) {
return true;
}
if(vs.charAt(si) > t.charAt(ti)) {
return false;
}
++si;
++ti;
}
return si >= sn && ti < tn;
}
final int lowerBound(final String t) {
int ok = this.size(), ng = 0;
while(ok - ng > 1) {
final int mid = (ok + ng) / 2;
if(ltSubstr(t, this.get(mid), 0)) {
ng = mid;
} else {
ok = mid;
}
}
return ok;
}
final Pair<Integer, Integer> equalRange(final String t) {
final int low = lowerBound(t);
int ng = low - 1, ok = this.size();
final StringBuilder sb = new StringBuilder(t);
sb.setCharAt(t.length() - 1, (char)(sb.charAt(sb.length() - 1) - 1));
final String u = sb.toString();
while(ok - ng > 1) {
final int mid = (ok + ng) / 2;
if(ltSubstr(u, this.get(mid), 0)) {
ng = mid;
} else {
ok = mid;
}
}
final int end = this.size() - 1;
this.add(end, this.get(end) - 1);
return Pair.of(low, ok);
}
final int[] lcpArray() {
final int n = this.size() - 1;
final int[] lcp = new int[n + 1], rank = new int[n + 1];
for(int i = 0; i <= n; ++i) {
rank[this.get(i)] = i;
}
int h = 0;
for(int i = 0; i <= n; ++i) {
if(rank[i] < n) {
final int j = this.get(rank[i] + 1);
for(; j + h < n && i + h < n; ++h) {
if(vs.charAt(j + h) != vs.charAt(i + h)) {
break;
}
}
lcp[rank[i] + 1] = h;
if(h > 0) {
h--;
}
}
}
return lcp;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
for(int i = 0; i < this.size(); ++i) {
sb.append(i + ":[" + this.get(i) + "]");
for(int j = this.get(i); j < vs.length(); ++j) {
sb.append(" " + vs.charAt(j));
}
if(i + 1 != this.size()) {
sb.append("\n");
}
}
return sb.toString();
}
}
final class Deque<T> implements Iterable<T> {
private int n, head, tail;
private Object[] buf;
Deque(){ this(1 << 17); }
private Deque(final int n) {
this.n = n;
head = tail = 0;
buf = new Object[n];
}
Deque(final T[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
private final int next(final int index) {
final int next = index + 1;
return next == n ? 0 : next;
}
private final int prev(final int index) {
final int prev = index - 1;
return prev == -1 ? n - 1 : prev;
}
private final int index(final int i) {
final int size = size();
assert i < size;
final int id = head + i;
return n <= id ? id - n : id;
}
private final void arraycopy(final int fromId, final T[] a, final int from, final int len) {
assert fromId + len <= size();
final int h = index(fromId);
if(h + len < n) {
System.arraycopy(buf, h, a, from, len);
} else {
final int back = n - h;
System.arraycopy(buf, h, a, from, back);
System.arraycopy(buf, 0, a, from + back, len - back);
}
}
@SuppressWarnings("unchecked")
private final void extend() {
final Object[] tmp = new Object[n << 1];
arraycopy(0, (T[]) tmp, 0, size());
buf = tmp;
n = buf.length;
}
final boolean isEmpty(){ return size() == 0; }
final int size() {
final int size = tail - head;
return size < 0 ? size + n : size;
}
final void addFirst(final T x) {
if(prev(head) == tail) {
extend();
}
head = prev(head);
buf[head] = x;
}
final void addLast(final T x) {
if(next(tail) == head) {
extend();
}
buf[tail] = x;
tail = next(tail);
}
final void removeFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
head = next(head);
}
final void removeLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
}
@SuppressWarnings("unchecked")
final T pollFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
final T ans = (T) buf[head];
head = next(head);
return ans;
}
@SuppressWarnings("unchecked")
final T pollLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
return (T) buf[tail];
}
final T peekFirst(){ return get(0); }
final T peekLast(){ return get(n - 1); }
@SuppressWarnings("unchecked")
final T get(final int i){ return (T) buf[index(i)]; }
final void set(final int i, final T x){ buf[index(i)] = x; }
final void add(final T x){ addLast(x); }
final T poll(){ return pollFirst(); }
final T peek(){ return peekFirst(); }
@SuppressWarnings("unchecked")
final void swap(final int a, final int b) {
final int i = index(a), j = index(b);
final T num = (T) buf[i];
buf[i] = buf[j];
buf[j] = num;
}
final void clear(){ head = tail = 0; }
@SuppressWarnings("unchecked")
final T[] toArray() {
final Object[] array = new Object[size()];
arraycopy(0, (T[]) array, 0, size());
return (T[]) array;
}
@Override
public final String toString(){ return Arrays.toString(toArray()); }
@Override
public final Iterator<T> iterator(){ return new DequeIterator(); }
private class DequeIterator implements Iterator<T> {
private int now = head;
private int rem = size();
@Override
public boolean hasNext(){ return rem > 0; }
@Override
public final T next() {
if(!hasNext()) {
throw new NoSuchElementException();
}
@SuppressWarnings("unchecked")
final T res = (T) buf[now];
now = (now + 1) % n;
rem--;
return res;
}
@Override
public final void remove() {
if(isEmpty()) {
throw new IllegalStateException();
}
now = (now - 1 + n) % n;
buf[now] = null;
head = (head + 1) % n;
rem++;
}
}
}
final class IntDeque {
private int n, head, tail;
private long[] buf;
IntDeque(){ this(1 << 17); }
private IntDeque(final int n) {
this.n = n;
head = tail = 0;
buf = new long[n];
}
IntDeque(final int[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
IntDeque(final long[] a) {
this(a.length);
Arrays.stream(a).forEach(i -> add(i));
}
private final int next(final int index) {
final int next = index + 1;
return next == n ? 0 : next;
}
private final int prev(final int index) {
final int prev = index - 1;
return prev == -1 ? n - 1 : prev;
}
private final int index(final int i) {
final int size = size();
assert i < size;
final int id = head + i;
return n <= id ? id - n : id;
}
private final void arraycopy(final int fromId, final long[] a, final int from, final int len) {
assert fromId + len <= size();
final int h = index(fromId);
if(h + len < n) {
System.arraycopy(buf, h, a, from, len);
} else {
final int back = n - h;
System.arraycopy(buf, h, a, from, back);
System.arraycopy(buf, 0, a, from + back, len - back);
}
}
private final void extend() {
final long[] tmp = new long[n << 1];
arraycopy(0, tmp, 0, size());
buf = tmp;
n = buf.length;
}
final boolean isEmpty(){ return size() == 0; }
final int size() {
final int size = tail - head;
return size < 0 ? size + n : size;
}
final void addFirst(final long x) {
head = prev(head);
if(head == tail) {
extend();
}
buf[head] = x;
}
final void addLast(final long x) {
if(next(tail) == head) {
extend();
}
buf[tail] = x;
tail = next(tail);
}
final void removeFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
head = next(head);
}
final void removeLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
}
final long pollFirst() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
final long ans = buf[head];
head = next(head);
return ans;
}
final long pollLast() {
if(head == tail) {
throw new NoSuchElementException("Deque is empty");
}
tail = prev(tail);
return buf[tail];
}
final long peekFirst(){ return get(0); }
final long peekLast(){ return get(n - 1); }
final long get(final int i){ return buf[index(i)]; }
final void set(final int i, final long x){ buf[index(i)] = x; }
final void add(final long x){ addLast(x); }
final long poll(){ return pollFirst(); }
final long peek(){ return peekFirst(); }
final void swap(final int a, final int b) {
final int i = index(a);
final int j = index(b);
final long num = buf[i];
buf[i] = buf[j];
buf[j] = num;
}
final void clear(){ head = tail = 0; }
final long[] toArray(){ return Arrays.copyOf(buf, size()); }
@Override
public final String toString(){ return Arrays.toString(toArray()); }
}
final class AVLTree<T extends Comparable<? super T>> {
static final class Node<T extends Comparable<? super T>> {
T val;
@SuppressWarnings("unchecked")
Node<T>[] ch = new Node[2];
int dep, size;
Node(final T val, final Node<T> l, final Node<T> r) {
this.val = val;
dep = size = 1;
ch[0] = l;
ch[1] = r;
}
}
private Node<T> root;
private final int depth(final Node<T> t){ return t == null ? 0 : t.dep; }
private final int count(final Node<T> t){ return t == null ? 0 : t.size; }
private final Node<T> update(final Node<T> t) {
t.dep = max(depth(t.ch[0]), depth(t.ch[1])) + 1;
t.size = count(t.ch[0]) + count(t.ch[1]) + 1;
return t;
}
private final Node<T> rotate(Node<T> t, final int b) {
Node<T> s = t.ch[1 - b];
t.ch[1 - b] = s.ch[b];
s.ch[b] = t;
t = update(t);
s = update(s);
return s;
}
private final Node<T> fetch(Node<T> t) {
if(t == null) {
return t;
}
if(depth(t.ch[0]) - depth(t.ch[1]) == 2) {
if(depth(t.ch[0].ch[1]) > depth(t.ch[0].ch[0])) {
t.ch[0] = rotate(t.ch[0], 0);
}
t = rotate(t, 1);
}
else if(depth(t.ch[0]) - depth(t.ch[1]) == -2) {
if (depth(t.ch[1].ch[0]) > depth(t.ch[1].ch[1])) {
t.ch[1] = rotate(t.ch[1], 1);
}
t = rotate(t, 0);
}
return t;
}
private final Node<T> insert(final Node<T> t, final int k, final T v) {
if(t == null) {
return new Node<T>(v, null, null);
}
final int c = count(t.ch[0]), b = (k > c) ? 1 : 0;
t.ch[b] = insert(t.ch[b], k - (b == 1 ? (c + 1) : 0), v);
update(t);
return fetch(t);
}
private final Node<T> erase(final Node<T> t) {
if(t == null || t.ch[0] == null && t.ch[1] == null) {
return null;
}
if(t.ch[0] == null || t.ch[1] == null) {
return t.ch[t.ch[0] == null ? 1 : 0];
}
return fetch(update(new Node<T>(find(t.ch[1], 0).val, t.ch[0], erase(t.ch[1], 0))));
}
private final Node<T> erase(Node<T> t, final int k) {
if(t == null) {
return null;
}
final int c = count(t.ch[0]);
if(k < c) {
t.ch[0] = erase(t.ch[0], k);
t = update(t);
}
else if(k > c) {
t.ch[1] = erase(t.ch[1], k - (c + 1));
t = update(t);
}
else {
t = erase(t);
}
return fetch(t);
}
private final Node<T> find(final Node<T> t, final int k) {
if(t == null) {
return t;
}
final int c = count(t.ch[0]);
return k < c ? find(t.ch[0], k) : k == c ? t : find(t.ch[1], k - (c + 1));
}
private final int cnt(final Node<T> t, final T v) {
if(t == null) {
return 0;
}
if(t.val.compareTo(v) < 0) {
return count(t.ch[0]) + 1 + cnt(t.ch[1], v);
}
if(t.val.equals(v)) {
return count(t.ch[0]);
}
return cnt(t.ch[0], v);
}
AVLTree(){ root = null; }
final void add(final T val){ root = insert(root, cnt(root, val), val); }
final void remove(final int k){ root = erase(root, k); }
final T get(final int k){ return find(root, k).val; }
final int count(final T val){ return cnt(root, val); }
final int size(){ return root.size; }
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < root.size;) {
sb.append(" ");
sb.append(get(i));
}
return "[" + sb.toString() + "]";
}
}
final class DoubleEndedPriorityQueue<T extends Number> {
private final ArrayList<T> d;
DoubleEndedPriorityQueue(final ArrayList<T> d) {
this.d = d;
makeHeap();
}
private final void makeHeap() {
for(int i = d.size(); i-- > 0;) {
if (i % 2 == 1 && d.get(i - 1).longValue() < d.get(i).longValue()) {
Collections.swap(d, i - 1, i);
}
up(down(i), i);
}
}
private final int down(int k) {
final int n = d.size();
if(k % 2 == 1) {
while(2 * k + 1 < n) {
int c = 2 * k + 3;
if(n <= c || d.get(c - 2).longValue() < d.get(c).longValue()) {
c -= 2;
}
if(c < n && d.get(c).longValue() < d.get(k).longValue()) {
Collections.swap(d, k, c);
k = c;
}
else {
break;
}
}
} else {
while(2 * k + 2 < n) {
int c = 2 * k + 4;
if(n <= c || d.get(c).longValue() < d.get(c - 2).longValue()) {
c -= 2;
}
if(c < n && d.get(k).longValue() < d.get(c).longValue()) {
Collections.swap(d, k, c);
k = c;
}
else {
break;
}
}
}
return k;
}
private final int up(int k, final int root) {
if((k | 1) < d.size() && d.get(k & ~1).longValue() < d.get(k | 1).longValue()) {
Collections.swap(d, k & ~1, k | 1);
k ^= 1;
}
int p;
while(root < k && d.get(p = parent(k)).longValue() < d.get(k).longValue()) {
Collections.swap(d, p, k);
k = p;
}
while(root < k && d.get(k).longValue() < d.get(p = parent(k) | 1).longValue()) {
Collections.swap(d, p, k);
k = p;
}
return k;
}
private final int parent(final int k){ return ((k >> 1) - 1) & ~1; }
private final void popBack(final ArrayList<T> d){ d.remove(d.size() - 1); }
final void push(final T x) {
final int k = d.size();
d.add(x);
up(k, 1);
}
final T popMin() {
final T res = getMin();
if(d.size() < 3) {
popBack(d);
} else {
Collections.swap(d, 1, d.size() - 1);
popBack(d);
up(down(1), 1);
}
return res;
}
final T popMax() {
final T res = getMax();
if(d.size() < 2) {
popBack(d);
} else {
Collections.swap(d, 0, d.size() - 1);
popBack(d);
up(down(0), 1);
}
return res;
}
final T getMin(){ return d.size() < 2 ? d.get(0) : d.get(1); }
final T getMax(){ return d.get(0); }
final int size(){ return d.size(); }
final boolean isEmpty(){ return d.isEmpty(); }
}
final class FenwickTree {
private final int n;
private final long[] data;
FenwickTree(final int n) {
this.n = n + 2;
data = new long[this.n + 1];
}
FenwickTree(final int[] a) {
this(a.length);
IntStream.range(0, a.length).forEach(i -> add(i, a[i]));
}
FenwickTree(final long[] a) {
this(a.length);
IntStream.range(0, a.length).forEach(i -> add(i, a[i]));
}
final long sum(int k) {
if(k < 0) {
return 0;
}
long ret = 0;
for(++k; k > 0; k -= k & -k) {
ret += data[k];
}
return ret;
}
final long sum(final int l, final int r){ return sum(r) - sum(l - 1); }
final long get(final int k){ return sum(k) - sum(k - 1); }
final void add(int k, final long x) {
for(++k; k < n; k += k & -k) {
data[k] += x;
}
}
final void add(final int l, final int r, final long x) {
add(l, x);
add(r + 1, -x);
}
private final int lg(final int n){ return 31 - Integer.numberOfLeadingZeros(n); }
final int lowerBound(long w) {
if(w <= 0) {
return 0;
}
int x = 0;
for(int k = 1 << lg(n); k > 0; k >>= 1) {
if(x + k <= n - 1 && data[x + k] < w) {
w -= data[x + k];
x += k;
}
}
return x;
}
final int upperBound(long w) {
if(w < 0) {
return 0;
}
int x = 0;
for(int k = 1 << lg(n); k > 0; k >>= 1) {
if(x + k <= n - 1 && data[x + k] <= w) {
w -= data[x + k];
x += k;
}
}
return x;
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(sum(0));
for(int i = 0; ++i < n - 2;) {
sb.append(" " + sum(i));
}
return sb.toString();
}
}
final class RangeBIT {
private final int n;
private final FenwickTree a, b;
RangeBIT(final int n) {
this.n = n;
a = new FenwickTree(n + 1);
b = new FenwickTree(n + 1);
}
RangeBIT(final int[] arr) {
this(arr.length);
for(int i = 0; i < arr.length; ++i) {
add(i, i, arr[i]);
}
}
RangeBIT(final long[] arr) {
this(arr.length);
for(int i = 0; i < arr.length; ++i) {
add(i, i, arr[i]);
}
}
final void add(final int l, final int r, final long x) {
a.add(l, x);
a.add(r, -x);
b.add(l, x * (1 - l));
b.add(r, x * (r - 1));
}
final long get(final int i){ return sum(i, i + 1); }
final long sum(int l, int r) {
l--;
r--;
return a.sum(r) * r + b.sum(r) - a.sum(l) * l - b.sum(l);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class SegmentTree<T> {
private int n = 1, rank = 0;
private final int fini;
private final BinaryOperator<T> op;
private final T e;
private final Object[] dat;
SegmentTree(final int fini, final BinaryOperator<T> op, final T e) {
this.fini = fini;
this.op = op;
this.e = e;
while(this.fini > n) {
n <<= 1;
rank++;
}
dat = new Object[2 * n];
Arrays.fill(dat, e);
}
SegmentTree(final T[] a, final BinaryOperator<T> op, final T e) {
this(a.length, op, e);
IntStream.range(0, a.length).forEach(i -> update(i, a[i]));
}
@SuppressWarnings("unchecked")
final void update(int i, final T x) {
i += n;
dat[i] = x;
do {
i >>= 1;
dat[i] = op.apply((T) dat[2 * i], (T) dat[2 * i + 1]);
} while(i > 0);
}
final T get(final int i){ return query(i, i + 1); }
@SuppressWarnings("unchecked")
final T query(int a, int b) {
T l = e, r = e;
for(a += n, b += n; a < b; a >>= 1, b >>= 1) {
if(a % 2 == 1) {
l = op.apply(l, (T) dat[a++]);
}
if(b % 2 == 1) {
r = op.apply((T) dat[--b], r);
}
}
return op.apply(l, r);
}
@SuppressWarnings("unchecked")
final T all(){ return (T) dat[1]; }
@SuppressWarnings("unchecked")
final int findLeft(final int r, final Predicate<T> fn) {
if(r == 0) {
return 0;
}
int h = 0, i = r + n;
T val = e;
for(; h <= rank; h++) {
if(i >> (h & 1) > 0) {
final T val2 = op.apply(val, (T) dat[i >> (h ^ 1)]);
if(fn.test(val2)){
i -= 1 << h;
if(i == n) {
return 0;
}
val = val2;
}
else {
break;
}
}
}
for(; h-- > 0;) {
final T val2 = op.apply(val, (T) dat[(i >> h) - 1]);
if(fn.test(val2)){
i -= 1 << h;
if(i == n) {
return 0;
}
val = val2;
}
}
return i - n;
}
@SuppressWarnings("unchecked")
final int findRight(final int l, final Predicate<T> fn) {
if(l == fini) {
return fini;
}
int h = 0, i = l + n;
T val = e;
for(; h <= rank; h++) {
if(i >> (h & 1) > 0){
final T val2 = op.apply(val, (T) dat[i >> h]);
if(fn.test(val2)){
i += 1 << h;
if(i == n * 2) {
return fini;
}
val = val2;
}
else {
break;
}
}
}
for(; h-- > 0;) {
final T val2 = op.apply(val, (T) dat[i >> h]);
if(fn.test(val2)) {
i += 1 << h;
if(i == n * 2) {
return fini;
}
val = val2;
}
}
return min(i - n, fini);
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < fini;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
class LazySegmentTree<T, U extends Comparable<? super U>> {
private final int n;
private int sz, h;
private final Object[] data, lazy;
private final BinaryOperator<T> f;
private final BiFunction<T, U, T> map;
private final BinaryOperator<U> comp;
private final T e;
private final U id;
@SuppressWarnings("unchecked")
private final void update(final int k){ data[k] = f.apply((T) data[2 * k], (T) data[2 * k + 1]); }
@SuppressWarnings("unchecked")
private final void allApply(final int k, final U x) {
data[k] = map.apply((T) data[k], x);
if(k < sz) {
lazy[k] = comp.apply((U) lazy[k], x);
}
}
@SuppressWarnings("unchecked")
private final void propagate(final int k) {
if(!lazy[k].equals(id)) {
allApply(2 * k, (U) lazy[k]);
allApply(2 * k + 1, (U) lazy[k]);
lazy[k] = id;
}
}
LazySegmentTree(final int n, final BinaryOperator<T> f, final BiFunction<T, U, T> map, final BinaryOperator<U> comp, final T e, final U id) {
this.n = n;
this.f = f;
this.map = map;
this.comp = comp;
this.e = e;
this.id = id;
sz = 1;
h = 0;
while(sz < n) {
sz <<= 1;
h++;
}
data = new Object[2 * sz];
Arrays.fill(data, e);
lazy = new Object[2 * sz];
Arrays.fill(lazy, id);
}
LazySegmentTree(final T[] a, final BinaryOperator<T> f, final BiFunction<T, U, T> map, final BinaryOperator<U> comp, final T e, final U id) {
this(a.length, f, map, comp, e, id);
build(a);
}
final void build(final T[] a) {
assert n == a.length;
for(int k = 0; k < n; ++k) {
data[k + sz] = a[k];
}
for(int k = sz; --k > 0;) {
update(k);
}
}
final void set(int k, final T x) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
data[k] = x;
for(int i = 0; ++i <= h;) {
update(k >> i);
}
}
@SuppressWarnings("unchecked")
final T get(int k) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
return (T) data[k];
}
@SuppressWarnings("unchecked")
final T query(int l, int r) {
if(l >= r) {
return e;
}
l += sz;
r += sz;
for(int i = h; i > 0; i--) {
if(((l >> i) << i) != l) {
propagate(l >> i);
}
if(((r >> i) << i) != r) {
propagate((r - 1) >> i);
}
}
T l2 = e, r2 = e;
for(; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
l2 = f.apply(l2, (T) data[l++]);
}
if(r % 2 == 1) {
r2 = f.apply((T) data[--r], r2);
}
}
return f.apply(l2, r2);
}
@SuppressWarnings("unchecked")
final T all(){ return (T) data[1]; }
@SuppressWarnings("unchecked")
final void apply(int k, final U x) {
k += sz;
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
data[k] = map.apply((T) data[k], x);
for(int i = 0; ++i <= h;) {
update(k >> i);
}
}
final void apply(int l, int r, final U x) {
if(l >= r) {
return;
}
l += sz;
r += sz;
for(int i = h; i > 0; i--) {
if(((l >> i) << i) != l) {
propagate(l >> i);
}
if(((r >> i) << i) != r) {
propagate((r - 1) >> i);
}
}
int l2 = l, r2 = r;
for(; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
allApply(l++, x);
}
if(r % 2 == 1) {
allApply(--r, x);
}
}
l = l2;
r = r2;
for(int i = 0; ++i <= h;) {
if(((l >> i) << i) != l) {
update(l >> i);
}
if(((r >> i) << i) != r) {
update((r - 1) >> i);
}
}
}
@SuppressWarnings("unchecked")
final int findFirst(int l, final Predicate<T> fn) {
if(l >= n) {
return n;
}
l += sz;
for(int i = h; i > 0; i--) {
propagate(l >> i);
}
T sum = e;
do {
while((l & 1) == 0) {
l >>= 1;
}
if(fn.test(f.apply(sum, (T) data[l]))) {
while(l < sz) {
propagate(l);
l <<= 1;
final T nxt = f.apply(sum, (T) data[l]);
if(!fn.test(nxt)) {
sum = nxt;
l++;
}
}
return l + 1 - sz;
}
sum = f.apply(sum, (T) data[l++]);
} while((l & -l) != l);
return n;
}
@SuppressWarnings("unchecked")
final int findLast(int r, final Predicate<T> fn) {
if(r <= 0) {
return -1;
}
r += sz;
for(int i = h; i > 0; i--) {
propagate((r - 1) >> i);
}
T sum = e;
do {
r--;
while(r > 1 && r % 2 == 1) {
r >>= 1;
}
if(fn.test(f.apply((T) data[r], sum))) {
while(r < sz) {
propagate(r);
r = (r << 1) + 1;
final T nxt = f.apply((T) data[r], sum);
if(!fn.test(nxt)) {
sum = nxt;
r--;
}
}
return r - sz;
}
sum = f.apply((T) data[r], sum);
} while((r & -r) != r);
return -1;
}
final void clear(){ Arrays.fill(data, e); }
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class Zwei<T> implements Cloneable {
public T first, second;
private Zwei(final T first, final T second) {
this.first = first;
this.second = second;
}
static final <T> Zwei<T> of(final T f, final T s){ return new Zwei<>(f, s); }
@Override
public final boolean equals(final Object o) {
if(this == o) {
return true;
}
if(o == null || getClass() != o.getClass()) {
return false;
}
final Zwei<?> z = (Zwei<?>) o;
return first.equals(z.first) && second.equals(z.second);
}
@Override
public final int hashCode(){ return Objects.hash(first, second); }
@Override
public final String toString(){ return String.valueOf(first); }
@SuppressWarnings("unchecked")
@Override
public final Zwei<T> clone() {
try {
return (Zwei<T>) super.clone();
} catch(final CloneNotSupportedException e){
e.printStackTrace();
}
throw new Error();
}
}
final class RAMX extends LazySegmentTree<Long, Long> {
RAMX(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, Long::sum, Long::sum, Long.valueOf(Long.MIN_VALUE), Long.valueOf(0)); }
RAMX(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, Long::sum, Long::sum, Long.valueOf(Long.MIN_VALUE), Long.valueOf(0)); }
}
final class RAMN extends LazySegmentTree<Long, Long> {
RAMN(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, Long::sum, Long::sum, Long.valueOf(Long.MAX_VALUE), Long.valueOf(0)); }
RAMN(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, Long::sum, Long::sum, Long.valueOf(Long.MAX_VALUE), Long.valueOf(0)); }
}
final class RASM extends LazySegmentTree<Zwei<Long>, Long> {
private final int n;
private final Zwei<Long>[] b;
@SuppressWarnings("unchecked")
RASM(final int[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.first.longValue() + x.second.longValue() * y.longValue(), x.second.longValue()), Long::sum, Zwei.of(0L, 0L), Long.valueOf(0));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of((long) a[i], 1L);
}
build(b);
}
@SuppressWarnings("unchecked")
RASM(final long[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.first.longValue() + x.second.longValue() * y.longValue(), x.second.longValue()), Long::sum, Zwei.of(0L, 0L), Long.valueOf(0));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of(a[i], 1L);
}
build(b);
}
}
final class RUMX extends LazySegmentTree<Long, Long> {
RUMX(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MIN_VALUE), Long.valueOf(Long.MIN_VALUE)); }
RUMX(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::max, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MIN_VALUE), Long.valueOf(Long.MIN_VALUE)); }
}
final class RUMN extends LazySegmentTree<Long, Long> {
RUMN(final int[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MAX_VALUE), Long.valueOf(Long.MAX_VALUE)); }
RUMN(final long[] a){ super(Arrays.stream(a).boxed().toArray(Long[]::new), Long::min, (x, y) -> y, (x, y) -> y, Long.valueOf(Long.MAX_VALUE), Long.valueOf(Long.MAX_VALUE)); }
}
final class RUSM extends LazySegmentTree<Zwei<Long>, Long> {
private final int n;
private final Zwei<Long>[] b;
@SuppressWarnings("unchecked")
RUSM(final int[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.second.longValue() * y.longValue(), x.second.longValue()), (x, y) -> y, Zwei.of(0L, 0L), Long.valueOf(Long.MIN_VALUE));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of((long) a[i], 1L);
}
build(b);
}
@SuppressWarnings("unchecked")
RUSM(final long[] a) {
super(a.length, (x, y) -> Zwei.of(x.first.longValue() + y.first.longValue(), x.second.longValue() + y.second.longValue()), (x, y) -> Zwei.of(x.second.longValue() * y.longValue(), x.second.longValue()), (x, y) -> y, Zwei.of(0L, 0L), Long.valueOf(Long.MIN_VALUE));
n = a.length;
b = new Zwei[n];
for(int i = 0; i < n; ++i) {
b[i] = Zwei.of(a[i], 1L);
}
build(b);
}
}
final class DualSegmentTree<T> {
private final int n;
private int sz, h;
private final Object[] lazy;
private final T id;
private final BinaryOperator<T> ap;
@SuppressWarnings("unchecked")
private final void propagate(final int k) {
if(lazy[k] != id) {
lazy[2 * k] = ap.apply((T) lazy[2 * k], (T) lazy[k]);
lazy[2 * k + 1] = ap.apply((T) lazy[2 * k + 1], (T) lazy[k]);
lazy[k] = id;
}
}
private final void thrust(final int k) {
for(int i = h; i > 0; i--) {
propagate(k >> i);
}
}
DualSegmentTree(final int n, final BinaryOperator<T> ap, final T id) {
this.n = n;
this.ap = ap;
this.id = id;
sz = 1;
h = 0;
while(sz < n) {
sz <<= 1;
h++;
}
lazy = new Object[2 * sz];
Arrays.fill(lazy, id);
}
@SuppressWarnings("unchecked")
final void apply(int a, int b, final T x) {
thrust(a += sz);
thrust(b += sz - 1);
for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if(l % 2 == 1) {
lazy[l] = ap.apply((T) lazy[l], x);
l++;
}
if(r % 2 == 1) {
r--;
lazy[r] = ap.apply((T) lazy[r], x);
}
}
}
@SuppressWarnings("unchecked")
final T get(int k) {
thrust(k += sz);
return (T) lazy[k];
}
@Override
public final String toString() {
final StringBuilder sb = new StringBuilder();
sb.append(get(0));
for(int i = 0; ++i < n;) {
sb.append(" " + get(i));
}
return sb.toString();
}
}
final class SparseTable {
private final long[][] st;
private final int[] lookup;
private final LongBinaryOperator op;
SparseTable(final int[] a, final LongBinaryOperator op) {
this.op = op;
int b = 0;
while((1 << b) <= a.length) {
++b;
}
st = new long[b][1 << b];
for(int i = 0; i < a.length; i++) {
st[0][i] = a[i];
}
for(int i = 1; i < b; i++) {
for(int j = 0; j + (1 << i) <= (1 << b); j++) {
st[i][j] = op.applyAsLong(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
lookup = new int[a.length + 1];
for(int i = 2; i < lookup.length; i++) {
lookup[i] = lookup[i >> 1] + 1;
}
}
SparseTable(final long[] a, final LongBinaryOperator op) {
this.op = op;
int b = 0;
while((1 << b) <= a.length) {
++b;
}
st = new long[b][1 << b];
for(int i = 0; i < a.length; i++) {
st[0][i] = a[i];
}
for(int i = 1; i < b; i++) {
for(int j = 0; j + (1 << i) <= (1 << b); j++) {
st[i][j] = op.applyAsLong(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
}
}
lookup = new int[a.length + 1];
for(int i = 2; i < lookup.length; i++) {
lookup[i] = lookup[i >> 1] + 1;
}
}
final long query(final int l, final int r) {
final int b = lookup[r - l];
return op.applyAsLong(st[b][l], st[b][r - (1 << b)]);
}
final int minLeft(final int x, final LongPredicate fn) {
if(x == 0) {
return 0;
}
int ok = x, ng = -1;
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(query(mid, x) - 1)) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
final int maxRight(final int x, final LongPredicate fn) {
if(x == lookup.length - 1) {
return lookup.length - 1;
}
int ok = x, ng = lookup.length;
while(abs(ok - ng) > 1) {
final int mid = (ok + ng) / 2;
if(fn.test(query(x, mid))) {
ok = mid;
}
else {
ng = mid;
}
}
return ok;
}
}
final class WaveletMatrix {
private final WaveletMatrixBeta mat;
private final long[] ys;
WaveletMatrix(final int[] arr){ this(arr, 20); }
WaveletMatrix(final long[] arr){ this(arr, 20); }
WaveletMatrix(final int[] arr, final int log) {
ys = Arrays.stream(arr).asLongStream().sorted().distinct().toArray();
final long[] t = new long[arr.length];
Arrays.setAll(t, i -> index(arr[i]));
mat = new WaveletMatrixBeta(t, log);
}
WaveletMatrix(final long[] arr, final int log) {
ys = Arrays.stream(arr).sorted().distinct().toArray();
final long[] t = new long[arr.length];
Arrays.setAll(t, i -> index(arr[i]));
mat = new WaveletMatrixBeta(t, log);
}
private final int index(final long x){ return Utility.lowerBound(ys, x); }
final long get(final int k){ return ys[(int) mat.access(k)]; }
final int rank(final int r, final long x) {
final int pos = index(x);
if(pos == ys.length || ys[pos] != x) {
return 0;
}
return mat.rank(pos, r);
}
final int rank(final int l, final int r, final long x){ return rank(r, x) - rank(l, x); }
final long kthMin(final int l, final int r, final int k){ return ys[(int) mat.kthMin(l, r, k)]; }
final long kthMax(final int l, final int r, final int k){ return ys[(int) mat.kthMax(l, r, k)]; }
final int rangeFreq(final int l, final int r, final long upper){ return mat.rangeFreq(l, r, index(upper)); }
final int rangeFreq(final int l, final int r, final long lower, final long upper){ return mat.rangeFreq(l, r, index(lower), index(upper)); }
final long prev(final int l, final int r, final long upper) {
final long ret = mat.prev(l, r, index(upper));
return ret == -1 ? -1 : ys[(int) ret];
}
final long next(final int l, final int r, final long lower) {
final long ret = mat.next(l, r, index(lower));
return ret == -1 ? -1 : ys[(int) ret];
}
private final class WaveletMatrixBeta {
private final int log;
private final SuccinctIndexableDictionary[] matrix;
private final int[] mid;
WaveletMatrixBeta(final long[] arr, final int log) {
final int len = arr.length;
this.log = log;
matrix = new SuccinctIndexableDictionary[log];
mid = new int[log];
final long[] l = new long[len], r = new long[len];
for(int level = log; --level >= 0;) {
matrix[level] = new SuccinctIndexableDictionary(len + 1);
int left = 0, right = 0;
for(int i = 0; i < len; ++i) {
if(((arr[i] >> level) & 1) == 1) {
matrix[level].set(i);
r[right++] = arr[i];
} else {
l[left++] = arr[i];
}
}
mid[level] = left;
matrix[level].build();
final long[] tmp = new long[len];
System.arraycopy(arr, 0, tmp, 0, len);
System.arraycopy(l, 0, arr, 0, len);
System.arraycopy(tmp, 0, l, 0, len);
for(int i = 0; i < right; ++i) {
arr[left + i] = r[i];
}
}
}
private final IntPair succ(final boolean f, final int l, final int r, final int level){ return IntPair.of(matrix[level].rank(f, l) + mid[level] * (f ? 1 : 0), matrix[level].rank(f, r) + mid[level] * (f ? 1 : 0)); }
final long access(int k) {
long ret = 0;
for(int level = log; --level >= 0;) {
final boolean f = matrix[level].get(k);
if(f) {
ret |= 1L << level;
}
k = matrix[level].rank(f, k) + mid[level] * (f ? 1 : 0);
}
return ret;
}
final int rank(final long x, int r) {
int l = 0;
for(int level = log; --level >= 0;) {
final IntPair p = succ(((x >> level) & 1) == 1, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return r - l;
}
final long kthMin(int l, int r, int k) {
if(!Utility.scope(0, k, r - l - 1)) {
throw new IndexOutOfBoundsException();
}
long ret = 0;
for(int level = log; --level >= 0;) {
final int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);
final boolean f = cnt <= k;
if(f) {
ret |= 1 << level;
k -= cnt;
}
final IntPair p = succ(f, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return ret;
}
final long kthMax(final int l, final int r, final int k){ return kthMin(l, r, r - l - k - 1); }
final int rangeFreq(int l, int r, final long upper) {
int ret = 0;
for(int level = log; --level >= 0;) {
final boolean f = ((upper >> level) & 1) == 1;
if(f) {
ret += matrix[level].rank(false, r) - matrix[level].rank(false, l);
}
final IntPair p = succ(f, l, r, level);
l = p.first.intValue();
r = p.second.intValue();
}
return ret;
}
final int rangeFreq(final int l, final int r, final long lower, final long upper){ return rangeFreq(l, r, upper) - rangeFreq(l, r, lower); }
final long prev(final int l, final int r, final long upper) {
final int cnt = rangeFreq(l, r, upper);
return cnt == 0 ? -1 : kthMin(l, r, cnt - 1);
}
final long next(final int l, final int r, final long lower) {
final int cnt = rangeFreq(l, r, lower);
return cnt == r - l ? -1 : kthMin(l, r, cnt);
}
private final class SuccinctIndexableDictionary {
private final int blk;
private final int[] bit, sum;
SuccinctIndexableDictionary(final int len) {
blk = (len + 31) >> 5;
bit = new int[blk];
sum = new int[blk];
}
final void set(final int k){ bit[k >> 5] |= 1 << (k & 31); }
final void build() {
sum[0] = 0;
for(int i = 0; i + 1 < blk; ++i) {
sum[i + 1] = sum[i] + Integer.bitCount(bit[i]);
}
}
final boolean get(final int k){ return ((bit[k >> 5] >> (k & 31)) & 1) == 1; }
final int rank(final int k){ return (sum[k >> 5] + Integer.bitCount(bit[k >> 5] & ((1 << (k & 31)) - 1))); }
final int rank(final boolean val, final int k){ return val ? rank(k) : k - rank(k); }
}
}
} | ConDefects/ConDefects/Code/abc329_c/Java/52162655 |
condefects-java_data_1481 | import java.io.*;
import java.util.Arrays;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer st = new StreamTokenizer(br);
static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static final int N = 2 * (int) 1e6;
static final int M = 26;
static int index;
static int[] cnt;
static int[][] mos;
static int ans;
public static void main(String[] args) throws Exception {
solve();
pw.close();
br.close();
}
public static void solve() throws Exception {
ans=0;
cnt= new int[N];
mos = new int[N][M];
int n=nextInt();
for (int i = 0; i < n; i++) add(nextString());
pw.println(ans);
}
public static int inquire(String str) {
int p = 0;
for (int i = 0, end = str.length(); i < end; ++i) {
int val = str.charAt(i) - 'a';
if (0 == mos[p][val]) return 0;
p = mos[p][val];
}
return cnt[p];
}
public static void add(String str) {
int p = 0;
for (int i = 0, end = str.length(); i < end; ++i) {
int val = str.charAt(i) - 'a';
if (0 == mos[p][val]) mos[p][val] = ++index;
p = mos[p][val];
ans+=cnt[p];
++cnt[p];
}
return;
}
public static String nextString() throws Exception {
st.nextToken();
return st.sval;
}
public static int nextInt() throws Exception {
st.nextToken();
return (int) st.nval;
}
public static long nextLong() throws Exception {
st.nextToken();
return (long) st.nval;
}
}
import java.io.*;
import java.util.Arrays;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer st = new StreamTokenizer(br);
static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static final int N = 2 * (int) 1e6;
static final int M = 26;
static int index;
static int[] cnt;
static int[][] mos;
static long ans;
public static void main(String[] args) throws Exception {
solve();
pw.close();
br.close();
}
public static void solve() throws Exception {
ans=0;
cnt= new int[N];
mos = new int[N][M];
int n=nextInt();
for (int i = 0; i < n; i++) add(nextString());
pw.println(ans);
}
public static int inquire(String str) {
int p = 0;
for (int i = 0, end = str.length(); i < end; ++i) {
int val = str.charAt(i) - 'a';
if (0 == mos[p][val]) return 0;
p = mos[p][val];
}
return cnt[p];
}
public static void add(String str) {
int p = 0;
for (int i = 0, end = str.length(); i < end; ++i) {
int val = str.charAt(i) - 'a';
if (0 == mos[p][val]) mos[p][val] = ++index;
p = mos[p][val];
ans+=cnt[p];
++cnt[p];
}
return;
}
public static String nextString() throws Exception {
st.nextToken();
return st.sval;
}
public static int nextInt() throws Exception {
st.nextToken();
return (int) st.nval;
}
public static long nextLong() throws Exception {
st.nextToken();
return (long) st.nval;
}
} | ConDefects/ConDefects/Code/abc353_e/Java/53444607 |
condefects-java_data_1482 | // 13:43:32 13-05-2024
// E - Yet Another Sigma Problem
// https://atcoder.jp/contests/abc353/tasks/abc353_e
// 2000 ms
import java.io.*;
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 , false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int n = inp();
String[] arr = in.nextStringArray(n);
Node node = new Node();
for(String ii : arr){
Node nnode = node;
for(char i : ii.toCharArray()){
if(nnode.arr[i-'a'] == null){
nnode.arr[i-'a'] = new Node();
}
nnode = nnode.arr[i-'a'];
nnode.cnt++;
}
}
int ans = 0;
for(int i = 0 ; i < n ; i++){
String x = arr[i];
Node nnode = node;
for(char ii : x.toCharArray()){
nnode = nnode.arr[ii-'a'];
nnode.cnt--;
ans = ans + nnode.cnt;
}
}
out.println(ans);
}
class Node{
int cnt = 0;
Node[] arr = new Node[26];
}
public static void main(String... args) {
int ntc = 1;
// ntc = in.nextInt();
for(int i = 1 ; i <= ntc ; i++)
new Main().solve();
out.flush();
}
int inp(){
return in.nextInt();
}
}
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;
boolean enableDebug;
Out(boolean enableDebug , boolean autoFlush) {
this.enableDebug = enableDebug;
this.autoFlush = autoFlush;
}
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();
}
}
// template - Yu_212
// 13:43:32 13-05-2024
// E - Yet Another Sigma Problem
// https://atcoder.jp/contests/abc353/tasks/abc353_e
// 2000 ms
import java.io.*;
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 , false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int n = inp();
String[] arr = in.nextStringArray(n);
Node node = new Node();
for(String ii : arr){
Node nnode = node;
for(char i : ii.toCharArray()){
if(nnode.arr[i-'a'] == null){
nnode.arr[i-'a'] = new Node();
}
nnode = nnode.arr[i-'a'];
nnode.cnt++;
}
}
long ans = 0;
for(int i = 0 ; i < n ; i++){
String x = arr[i];
Node nnode = node;
for(char ii : x.toCharArray()){
nnode = nnode.arr[ii-'a'];
nnode.cnt--;
ans = ans + nnode.cnt;
}
}
out.println(ans);
}
class Node{
int cnt = 0;
Node[] arr = new Node[26];
}
public static void main(String... args) {
int ntc = 1;
// ntc = in.nextInt();
for(int i = 1 ; i <= ntc ; i++)
new Main().solve();
out.flush();
}
int inp(){
return in.nextInt();
}
}
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;
boolean enableDebug;
Out(boolean enableDebug , boolean autoFlush) {
this.enableDebug = enableDebug;
this.autoFlush = autoFlush;
}
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();
}
}
// template - Yu_212 | ConDefects/ConDefects/Code/abc353_e/Java/53445461 |
condefects-java_data_1483 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int N = Integer.parseInt(input.readLine());
Trie trie = new Trie();
st = new StringTokenizer(input.readLine());
for (int i = 0; i < N; i++) {
String inputStr = st.nextToken();
trie.insert(inputStr);
}
System.out.println(trie.res);
}
}
class Trie {
int res;
private TrieNode rootNode;
public Trie() {
this.rootNode = new TrieNode();
}
public void insert(String inputStr) {
TrieNode curNode = rootNode;
for (int i = 0; i < inputStr.length(); i++) {
int idx = inputStr.charAt(i) - 'a';
if (curNode.childNodes[idx] == null) {
curNode.childNodes[idx] = this.makeNode();
}
curNode = curNode.childNodes[idx];
res += curNode.cnt;
curNode.cnt++;
}
}
private TrieNode makeNode() {
return new TrieNode();
}
}
class TrieNode {
TrieNode[] childNodes;
int cnt;
public TrieNode() {
childNodes = new TrieNode[26];
Arrays.fill(childNodes, null);
}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int N = Integer.parseInt(input.readLine());
Trie trie = new Trie();
st = new StringTokenizer(input.readLine());
for (int i = 0; i < N; i++) {
String inputStr = st.nextToken();
trie.insert(inputStr);
}
System.out.println(trie.res);
}
}
class Trie {
long res;
private TrieNode rootNode;
public Trie() {
this.rootNode = new TrieNode();
}
public void insert(String inputStr) {
TrieNode curNode = rootNode;
for (int i = 0; i < inputStr.length(); i++) {
int idx = inputStr.charAt(i) - 'a';
if (curNode.childNodes[idx] == null) {
curNode.childNodes[idx] = this.makeNode();
}
curNode = curNode.childNodes[idx];
res += curNode.cnt;
curNode.cnt++;
}
}
private TrieNode makeNode() {
return new TrieNode();
}
}
class TrieNode {
TrieNode[] childNodes;
int cnt;
public TrieNode() {
childNodes = new TrieNode[26];
Arrays.fill(childNodes, null);
}
}
| ConDefects/ConDefects/Code/abc353_e/Java/53412513 |
condefects-java_data_1484 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int n;
static class TrieNode {
TrieNode[] children = new TrieNode[26];
int cnt = 0;
int depth = 0;
char ch;
public long getValue() {
return cnt * (cnt - 1) / 2;
}
public TrieNode(char ch) {
this.ch = ch;
for (int i = 0; i < 26; i++) {
children[i] = null;
}
this.cnt = 0;
this.depth = 0;
}
public TrieNode getChild(char ch) {
return children[ch - 'a'];
}
public TrieNode(int parentDepth, char ch) {
this.depth = parentDepth + 1;
this.ch = ch;
this.cnt = 1;
for (int i = 0; i < 26; i++) {
children[i] = null;
}
}
public void addChild(TrieNode child) {
this.children[child.ch - 'a'] = child;
}
}
static TrieNode dummy = new TrieNode('a');
public static void build(String str) {
TrieNode curr = dummy;
for (int i = 0; i < str.length(); i++) {
int parentDepth = curr.depth;
char ch1 = str.charAt(i);
TrieNode child = curr.getChild(ch1);
if (child != null) {
child.cnt++;
} else {
child = new TrieNode(parentDepth, ch1);
curr.addChild(child);
}
curr = child;
}
}
public static long travel() {
ArrayDeque<TrieNode> arrayDeque = new ArrayDeque<>();
arrayDeque.add(dummy);
long ans = 0;
while (!arrayDeque.isEmpty()) {
TrieNode node = arrayDeque.poll();
long val1 = node.getValue();
long val2 = 0;
for (int i = 0; i < 26; i++) {
if (node.children[i] != null) {
val2 += node.children[i].getValue();
arrayDeque.add(node.children[i]);
}
}
ans += (val1 - val2) * node.depth;
}
return ans;
}
public static void main(String[] args) throws IOException {
n = rd.nextInt();
String[] str = rd.nextLine().split(" ");
for (int i = 0; i < n; i++) {
build(str[i]);
}
long ans = travel();
System.out.println(ans);
}
static class rd {
static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer tokenizer = new StringTokenizer("");
// nextLine()读取字符串
static String nextLine() throws IOException {
return reader.readLine();
}
// next()读取字符串
static String next() throws IOException {
while (!tokenizer.hasMoreTokens()) tokenizer = new StringTokenizer(reader.readLine());
return tokenizer.nextToken();
}
// 读取一个int型数值
static int nextInt() throws IOException {
return Integer.parseInt(next());
}
// 读取一个double型数值
static double nextDouble() throws IOException {
return Double.parseDouble(next());
}
// 读取一个long型数值
static long nextLong() throws IOException {
return Long.parseLong(next());
}
// 读取一个BigInteger
static BigInteger nextBigInteger() throws IOException {
BigInteger d = new BigInteger(rd.nextLine());
return d;
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int n;
static class TrieNode {
TrieNode[] children = new TrieNode[26];
int cnt = 0;
int depth = 0;
char ch;
public long getValue() {
return (long)cnt * (cnt - 1) / 2;
}
public TrieNode(char ch) {
this.ch = ch;
for (int i = 0; i < 26; i++) {
children[i] = null;
}
this.cnt = 0;
this.depth = 0;
}
public TrieNode getChild(char ch) {
return children[ch - 'a'];
}
public TrieNode(int parentDepth, char ch) {
this.depth = parentDepth + 1;
this.ch = ch;
this.cnt = 1;
for (int i = 0; i < 26; i++) {
children[i] = null;
}
}
public void addChild(TrieNode child) {
this.children[child.ch - 'a'] = child;
}
}
static TrieNode dummy = new TrieNode('a');
public static void build(String str) {
TrieNode curr = dummy;
for (int i = 0; i < str.length(); i++) {
int parentDepth = curr.depth;
char ch1 = str.charAt(i);
TrieNode child = curr.getChild(ch1);
if (child != null) {
child.cnt++;
} else {
child = new TrieNode(parentDepth, ch1);
curr.addChild(child);
}
curr = child;
}
}
public static long travel() {
ArrayDeque<TrieNode> arrayDeque = new ArrayDeque<>();
arrayDeque.add(dummy);
long ans = 0;
while (!arrayDeque.isEmpty()) {
TrieNode node = arrayDeque.poll();
long val1 = node.getValue();
long val2 = 0;
for (int i = 0; i < 26; i++) {
if (node.children[i] != null) {
val2 += node.children[i].getValue();
arrayDeque.add(node.children[i]);
}
}
ans += (val1 - val2) * node.depth;
}
return ans;
}
public static void main(String[] args) throws IOException {
n = rd.nextInt();
String[] str = rd.nextLine().split(" ");
for (int i = 0; i < n; i++) {
build(str[i]);
}
long ans = travel();
System.out.println(ans);
}
static class rd {
static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer tokenizer = new StringTokenizer("");
// nextLine()读取字符串
static String nextLine() throws IOException {
return reader.readLine();
}
// next()读取字符串
static String next() throws IOException {
while (!tokenizer.hasMoreTokens()) tokenizer = new StringTokenizer(reader.readLine());
return tokenizer.nextToken();
}
// 读取一个int型数值
static int nextInt() throws IOException {
return Integer.parseInt(next());
}
// 读取一个double型数值
static double nextDouble() throws IOException {
return Double.parseDouble(next());
}
// 读取一个long型数值
static long nextLong() throws IOException {
return Long.parseLong(next());
}
// 读取一个BigInteger
static BigInteger nextBigInteger() throws IOException {
BigInteger d = new BigInteger(rd.nextLine());
return d;
}
}
} | ConDefects/ConDefects/Code/abc353_e/Java/53368841 |
condefects-java_data_1485 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
System.out.println((s.length()+1)/2);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
System.out.println(s.charAt(s.length()/2));
}
} | ConDefects/ConDefects/Code/abc266_a/Java/35205903 |
condefects-java_data_1486 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringJoiner;
public class Main {
static int N;
static char[] R, C;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
R = sc.next().toCharArray();
C = sc.next().toCharArray();
solve();
}
static void solve() {
// 何をしても抜けがありそうなので枝狩り全探索を試す
char[][] A = new char[5][5];
for (int i = 0; i < N; i++) {
Arrays.fill(A[i], '?');
}
var ok = dfs(0, A);
if( ok ) {
System.out.println("Yes");
for (int i = 0; i < N; i++) {
System.out.println( new String(A[i]) );
}
} else {
System.out.println("No");
}
}
static char[] X = new char[]{'A', 'B', 'C', '.'};
static boolean dfs(int hw, char[][] A) {
if( hw == N*N ) {
// 何かが抜けてるのか通らないので最終チェックを入れてみる
return isAllOk(A);
}
int h = hw / N;
int w = hw % N;
for (char x : X) {
if( isOk(h, w, x, A) ) {
A[h][w] = x;
if( dfs(hw+1, A) ) {
return true;
} else {
A[h][w] = '?';
}
}
}
return false;
}
static boolean isOk(int h, int w, char x, char[][] A) {
// A自体現状okのはずなのでhwにxが置けるかどうかだけ見る
if( x == '.' ) {
int hc = 0, wc = 0;
for (int ph = 0; ph < h; ph++) {
if( A[ph][w] == '.' ) hc++;
}
for (int pw = 0; pw < w; pw++) {
if( A[h][pw] == '.' ) wc++;
}
return hc < N-3 && wc < N-3;
} else {
boolean firstInH = true, firstInW = true;
for (int pw = 0; pw < w; pw++) {
if( A[h][pw] == x ) return false;
if( A[h][pw] != '.' ) firstInH = false;
}
for (int ph = 0; ph < h; ph++) {
if( A[ph][w] == x ) return false;
if( A[ph][w] != '.' ) firstInW = false;
}
if( firstInH && R[h] != x ) {
return false;
}
if( firstInW && C[w] != x ) {
return false;
}
return true;
}
}
static boolean isAllOk(char[][] A) {
for (int h = 0; h < N; h++) {
for (int w = 0; w < N; w++) {
if( A[h][w] == '.' ) continue;
if( R[h] == A[h][w] ) {
break;
} else {
return false;
}
}
}
for (int w = 0; w < N; w++) {
for (int h = 0; h < N; h++) {
if( A[h][w] == '.' ) continue;
if( C[w] == A[h][w] ) {
break;
} else {
return false;
}
}
}
for (int h = 0; h < N; h++) {
int a = 0, b = 0, c = 0;
for (int w = 0; w < N; w++) {
switch( A[h][w] ) {
case 'A':
a++;
break;
case 'B':
b++;
break;
case 'C':
c++;
break;
}
}
if( a != 1 || b != 1 || c != 1 ) return false;
}
for (int w = 0; w < N; w++) {
int a = 0, b = 0, c = 0;
for (int h = 0; h < N; h++) {
switch( A[h][w] ) {
case 'A':
a++;
break;
case 'B':
b++;
break;
case 'C':
c++;
break;
}
}
if( a != 1 || b != 1 || c != 1 ) return false;
}
return true;
}
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.util.Arrays;
import java.util.HashMap;
import java.util.StringJoiner;
public class Main {
static int N;
static char[] R, C;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
R = sc.next().toCharArray();
C = sc.next().toCharArray();
solve();
}
static void solve() {
// 何をしても抜けがありそうなので枝狩り全探索を試す
char[][] A = new char[N][N];
for (int i = 0; i < N; i++) {
Arrays.fill(A[i], '?');
}
var ok = dfs(0, A);
if( ok ) {
System.out.println("Yes");
for (int i = 0; i < N; i++) {
System.out.println( new String(A[i]) );
}
} else {
System.out.println("No");
}
}
static char[] X = new char[]{'A', 'B', 'C', '.'};
static boolean dfs(int hw, char[][] A) {
if( hw == N*N ) {
// 何かが抜けてるのか通らないので最終チェックを入れてみる
return isAllOk(A);
}
int h = hw / N;
int w = hw % N;
for (char x : X) {
if( isOk(h, w, x, A) ) {
A[h][w] = x;
if( dfs(hw+1, A) ) {
return true;
} else {
A[h][w] = '?';
}
}
}
return false;
}
static boolean isOk(int h, int w, char x, char[][] A) {
// A自体現状okのはずなのでhwにxが置けるかどうかだけ見る
if( x == '.' ) {
int hc = 0, wc = 0;
for (int ph = 0; ph < h; ph++) {
if( A[ph][w] == '.' ) hc++;
}
for (int pw = 0; pw < w; pw++) {
if( A[h][pw] == '.' ) wc++;
}
return hc < N-3 && wc < N-3;
} else {
boolean firstInH = true, firstInW = true;
for (int pw = 0; pw < w; pw++) {
if( A[h][pw] == x ) return false;
if( A[h][pw] != '.' ) firstInH = false;
}
for (int ph = 0; ph < h; ph++) {
if( A[ph][w] == x ) return false;
if( A[ph][w] != '.' ) firstInW = false;
}
if( firstInH && R[h] != x ) {
return false;
}
if( firstInW && C[w] != x ) {
return false;
}
return true;
}
}
static boolean isAllOk(char[][] A) {
for (int h = 0; h < N; h++) {
for (int w = 0; w < N; w++) {
if( A[h][w] == '.' ) continue;
if( R[h] == A[h][w] ) {
break;
} else {
return false;
}
}
}
for (int w = 0; w < N; w++) {
for (int h = 0; h < N; h++) {
if( A[h][w] == '.' ) continue;
if( C[w] == A[h][w] ) {
break;
} else {
return false;
}
}
}
for (int h = 0; h < N; h++) {
int a = 0, b = 0, c = 0;
for (int w = 0; w < N; w++) {
switch( A[h][w] ) {
case 'A':
a++;
break;
case 'B':
b++;
break;
case 'C':
c++;
break;
}
}
if( a != 1 || b != 1 || c != 1 ) return false;
}
for (int w = 0; w < N; w++) {
int a = 0, b = 0, c = 0;
for (int h = 0; h < N; h++) {
switch( A[h][w] ) {
case 'A':
a++;
break;
case 'B':
b++;
break;
case 'C':
c++;
break;
}
}
if( a != 1 || b != 1 || c != 1 ) return false;
}
return true;
}
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/abc326_d/Java/47369714 |
condefects-java_data_1487 | import java.io.*;
import java.nio.charset.StandardCharsets;
import java.util.*;
public class Main {
// private static int[][] dirs = {{-1,-1}, {1, 1}, {-1, 1}, {1, -1}};
private static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
private static long inf = (long) 1e13;
private static long div = 998_244_353L;
// private static long div = ((long)1e9) + 7;
private static String[] combs = new String[] {"ABC", "ACB", "CBA", "BCA", "BAC", "CAB"};
private static boolean verify(char mtx[][], String r, String c) {
int N = r.length();
for(int row = 0;row < N; ++row) {
char curr = r.charAt(row);
for(int col = 0;col < N; ++col) {
if (mtx[row][col] == '.') {
continue;
}
if (mtx[row][col] == curr) {
break;
} else {
return false;
}
}
}
for(int col = 0;col < N; ++col) {
char curr = c.charAt(col);
for(int row = 0;row < N; ++row) {
if (mtx[row][col] == '.') {
continue;
} else if (mtx[row][col] == curr) {
break;
} else {
return false;
}
}
}
for(int col = 0;col < N; ++col) {
int[] count = new int[3];
for(int row = 0;row < N; ++row) {
if (mtx[row][col] == '.') {
continue;
}
count[mtx[row][col] - 'A']++;
if (count[mtx[row][col] - 'A'] != 1) {
return false;
}
}
}
StringBuilder sb = new StringBuilder();
for(int i = 0;i < N; ++i) {
for(int j = 0; j < N; ++j) {
sb.append(mtx[i][j]);
sb.append(' ');
}
sb.deleteCharAt(sb.length() - 1);
sb.append('\n');
}
System.out.println("Yes");
System.out.println(sb.toString());
return true;
}
private static boolean generate(int row, char[][] mtx, int N, String r, String c) {
if (row == N) {
return verify(mtx, r, c);
}
for(String comb:combs) {
if (comb.charAt(0) != r.charAt(row)) {
continue;
}
for(int i = 0;i < N; ++i) {
mtx[row][i] = comb.charAt(0);
for(int j = i + 1;j < N; ++j) {
mtx[row][j] = comb.charAt(1);
for(int k = j + 1; k < N; ++k) {
mtx[row][k] = comb.charAt(2);
boolean res = generate(row + 1, mtx, N, r, c);
if (res) {
return true;
}
mtx[row][k] = '.';
}
mtx[row][j] = '.';
}
mtx[row][i] = '.';
}
}
return false;
}
public static void main(String[] commands) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] parts = in.readLine().split(" ");
int N = Integer.parseInt(parts[0]);
String R = in.readLine();
String C = in.readLine();
char[][] mtx = new char[N][N];
for(char[] row:mtx) {
Arrays.fill(row, '.');
}
boolean res = generate(0, mtx, N, R, C);
if (!res) {
System.out.println("No");
}
}
}
import java.io.*;
import java.nio.charset.StandardCharsets;
import java.util.*;
public class Main {
// private static int[][] dirs = {{-1,-1}, {1, 1}, {-1, 1}, {1, -1}};
private static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
private static long inf = (long) 1e13;
private static long div = 998_244_353L;
// private static long div = ((long)1e9) + 7;
private static String[] combs = new String[] {"ABC", "ACB", "CBA", "BCA", "BAC", "CAB"};
private static boolean verify(char mtx[][], String r, String c) {
int N = r.length();
for(int row = 0;row < N; ++row) {
char curr = r.charAt(row);
for(int col = 0;col < N; ++col) {
if (mtx[row][col] == '.') {
continue;
}
if (mtx[row][col] == curr) {
break;
} else {
return false;
}
}
}
for(int col = 0;col < N; ++col) {
char curr = c.charAt(col);
for(int row = 0;row < N; ++row) {
if (mtx[row][col] == '.') {
continue;
} else if (mtx[row][col] == curr) {
break;
} else {
return false;
}
}
}
for(int col = 0;col < N; ++col) {
int[] count = new int[3];
for(int row = 0;row < N; ++row) {
if (mtx[row][col] == '.') {
continue;
}
count[mtx[row][col] - 'A']++;
if (count[mtx[row][col] - 'A'] != 1) {
return false;
}
}
}
StringBuilder sb = new StringBuilder();
for(int i = 0;i < N; ++i) {
for(int j = 0; j < N; ++j) {
sb.append(mtx[i][j]);
}
sb.append('\n');
}
System.out.println("Yes");
System.out.println(sb.toString());
return true;
}
private static boolean generate(int row, char[][] mtx, int N, String r, String c) {
if (row == N) {
return verify(mtx, r, c);
}
for(String comb:combs) {
if (comb.charAt(0) != r.charAt(row)) {
continue;
}
for(int i = 0;i < N; ++i) {
mtx[row][i] = comb.charAt(0);
for(int j = i + 1;j < N; ++j) {
mtx[row][j] = comb.charAt(1);
for(int k = j + 1; k < N; ++k) {
mtx[row][k] = comb.charAt(2);
boolean res = generate(row + 1, mtx, N, r, c);
if (res) {
return true;
}
mtx[row][k] = '.';
}
mtx[row][j] = '.';
}
mtx[row][i] = '.';
}
}
return false;
}
public static void main(String[] commands) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] parts = in.readLine().split(" ");
int N = Integer.parseInt(parts[0]);
String R = in.readLine();
String C = in.readLine();
char[][] mtx = new char[N][N];
for(char[] row:mtx) {
Arrays.fill(row, '.');
}
boolean res = generate(0, mtx, N, R, C);
if (!res) {
System.out.println("No");
}
}
}
| ConDefects/ConDefects/Code/abc326_d/Java/47052872 |
condefects-java_data_1488 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n;
static char[] r;
static char[] c;
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
n = Integer.parseInt(sc.next());
r = sc.next().toCharArray();
c = sc.next().toCharArray();
int[] x = new int[n];
for(int i = 0; i < n; i++) x[i] = i;
int a = 0;
do {
int[] y = new int[n];
for(int i = 0; i < n; i++) y[i] = i;
do {
int[] z = new int[n];
for(int i = 0; i < n; i++) z[i] = i;
do {
char[][] ans = new char[n][n];
for(int i = 0; i < n; i++) Arrays.fill(ans[i], '.');
boolean ok = true;
for(int i = 0; i < n; i++) ans[i][x[i]] = 'A';
for(int i = 0; i < n; i++) {
if(ans[i][y[i]] != '.') {
ok = false;
break;
}
ans[i][y[i]] = 'B';
}
if(!ok) continue;
for(int i = 0; i < n; i++) {
if(ans[i][z[i]] != '.') {
ok = false;
break;
}
ans[i][z[i]] = 'C';
}
if(ok && check(ans)) {
System.out.println("Yes");
for(int i = 0; i < n; i++) {
for(char c : ans[i]) System.out.print(c);
System.out.println();
return;
}
}
} while (nextPermutation(z));
} while (nextPermutation(y));
} while (nextPermutation(x));
System.out.println("No");
}
}
static boolean check(char[][] a) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(a[i][j] != '.' && a[i][j] != r[i]) {
return false;
}
if(a[i][j] == r[i]) {
break;
}
}
for(int j = 0; j < n; j++) {
if(a[j][i] != '.' && a[j][i] != c[i]) {
return false;
}
if(a[j][i] == c[i]) {
break;
}
}
}
return true;
}
static boolean nextPermutation(int[] arr) {
int len = arr.length;
int index = len - 2;
while(index >= 0 && arr[index] >= arr[index + 1]) index--;
if(index < 0) return false;
int target = index + 1;
for(int i = target; i < arr.length; i++) {
if(arr[i] > arr[index]) target = i;
}
int tmp = arr[index];
arr[index] = arr[target];
arr[target] = tmp;
Arrays.sort(arr, index + 1, arr.length);
return true;
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int n;
static char[] r;
static char[] c;
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
n = Integer.parseInt(sc.next());
r = sc.next().toCharArray();
c = sc.next().toCharArray();
int[] x = new int[n];
for(int i = 0; i < n; i++) x[i] = i;
int a = 0;
do {
int[] y = new int[n];
for(int i = 0; i < n; i++) y[i] = i;
do {
int[] z = new int[n];
for(int i = 0; i < n; i++) z[i] = i;
do {
char[][] ans = new char[n][n];
for(int i = 0; i < n; i++) Arrays.fill(ans[i], '.');
boolean ok = true;
for(int i = 0; i < n; i++) ans[i][x[i]] = 'A';
for(int i = 0; i < n; i++) {
if(ans[i][y[i]] != '.') {
ok = false;
break;
}
ans[i][y[i]] = 'B';
}
if(!ok) continue;
for(int i = 0; i < n; i++) {
if(ans[i][z[i]] != '.') {
ok = false;
break;
}
ans[i][z[i]] = 'C';
}
if(ok && check(ans)) {
System.out.println("Yes");
for(int i = 0; i < n; i++) {
for(char c : ans[i]) System.out.print(c);
System.out.println();
}
return;
}
} while (nextPermutation(z));
} while (nextPermutation(y));
} while (nextPermutation(x));
System.out.println("No");
}
}
static boolean check(char[][] a) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(a[i][j] != '.' && a[i][j] != r[i]) {
return false;
}
if(a[i][j] == r[i]) {
break;
}
}
for(int j = 0; j < n; j++) {
if(a[j][i] != '.' && a[j][i] != c[i]) {
return false;
}
if(a[j][i] == c[i]) {
break;
}
}
}
return true;
}
static boolean nextPermutation(int[] arr) {
int len = arr.length;
int index = len - 2;
while(index >= 0 && arr[index] >= arr[index + 1]) index--;
if(index < 0) return false;
int target = index + 1;
for(int i = target; i < arr.length; i++) {
if(arr[i] > arr[index]) target = i;
}
int tmp = arr[index];
arr[index] = arr[target];
arr[target] = tmp;
Arrays.sort(arr, index + 1, arr.length);
return true;
}
}
| ConDefects/ConDefects/Code/abc326_d/Java/47061122 |
condefects-java_data_1489 | import java.math.*;
import java.util.*;
import java.io.*;
import java.lang.*;
public class Main implements Runnable{
public void run(){
if(Static.CHECKER){
try{
System.setErr(new PrintStream(new FileOutputStream("error.txt")));
System.setOut(new PrintStream(new FileOutputStream("output.txt")));
System.setIn(new FileInputStream("input.txt"));
}catch(Exception e){
System.err.println("NOT A PROBLEM");
}
}
OutputWriter out = new OutputWriter(System.out);
Solution problem = new Solution(System.in , out);
int testCases = 1 , need = Static.NEED;
long s = 0l , e = 0l;
if(Static.HAS_TESTCASES != 0) testCases = problem.i();
for(int i = 1 ; i <= testCases ; i++){
if(need != 0) s = System.currentTimeMillis();
problem.solution();
if(need != 0) e = System.currentTimeMillis();
if(need != 0) System.err.println(i + " - " + (e - s) + " " + "ms");
}
out.flush();
out.close();
}
public static void main(String[] args) throws Exception{
new Thread(null , new Main() , "Main" , 1l << 26).start();
}
}
final class Static{
protected final static boolean CHECKER = System.getProperty("ONLINE_JUDGE") != null;
protected final static int HAS_TESTCASES = 0;
protected final static int NEED = 0;
}
class Solution{
boolean[][] col , row;
char[][] grid;
boolean[] r , c;
String s , t;
int n , a , b;
int cnt = (int) 100;
public void solution(){
n = a = b = i();
col = new boolean[n][3];
row = new boolean[n][3];
r = new boolean[n];
c = new boolean[n];
grid = new char[n][n];
s = s();
t = s();
for(int i = 0 ; i < n ; i++) Arrays.fill(grid[i] , '.');
if(finder(0 , 0)){
o.p(yes);
for(int i = 0 ; i < n ; i++){
o.p(new String(grid[i]));
}
}else{
o.p(no);
}
}
private boolean finder(int x , int y){
if(x == n){
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < 3 ; j++){
if(!row[i][j] || !col[i][j]) return false;
}
}
return a == 0 && b == 0;
}
if(y == n) return finder(x + 1 , 0);
for(char i = 'A' ; i < 'D' ; i++) if(!col[y][i - 'A'] && !row[x][i - 'A']){
if(!r[x] && i != s.charAt(x)) continue;
if(!c[y] && i != t.charAt(y)) continue;
boolean R = false , T = false;
if(!r[x]) r[x] = R = true;
if(!c[y]) c[y] = T = true;
if(R) a -= 1;
if(T) b -= 1;
grid[x][y] = i;
row[x][i - 'A'] = true;
col[y][i - 'A'] = true;
if(finder(x , y + 1)) return true;
grid[x][y] = '.';
row[x][i - 'A'] = !true;
col[y][i - 'A'] = !true;
if(R) r[x] = false;
if(T) c[y] = false;
if(R) a += 1;
if(T) b += 1;
}
return finder(x , y + 1);
}
private String yes = "Yes";
private String no = "No";
private final long mod = (long) 1e9 + 7;
private final int imin = 1 << -1;
private final int imax = -1 >>> 1;
private final long lmin = 1l << -1l;
private final long lmax = -1l >>> 1l;
private OutputWriter o;
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
private int min(int... arr){
int ret = arr[0];
for(int i : arr) ret=Math.min(ret,i);
return ret;
}
private int max(int... arr){
int ret = arr[0];
for(int i : arr) ret = Math.max(ret,i);
return ret;
}
private long min(long... arr){
long ret = arr[0];
for(long i : arr) ret = Math.min(ret , i);
return ret;
}
private long max(long... arr){
long ret = arr[0];
for(long i : arr) ret = Math.max(ret , i);
return ret;
}
private double min(double... arr){
//o.p(arr);
double ret = arr[0];
for(double i : arr) ret = Math.min(ret , i);
return ret;
}
private double max(double... arr){
double ret = arr[0];
for(double i : arr) ret = Math.max(ret , i);
return ret;
}
public Solution(InputStream stream , OutputWriter o){
this.stream = stream;
this.o = o;
}
public char[] sca(){
return s().toCharArray();
}
public int read(){
if(numChars == -1){
throw new InputMismatchException();
}
if(curChar >= numChars){
curChar = 0;
try{
numChars = stream.read(buf);
}catch(IOException e){
throw new InputMismatchException();
}
if(numChars <= 0){
return -1;
}
}
return buf[curChar++];
}
public int peek(){
if(numChars == -1){
return -1;
}
if(curChar >= numChars){
curChar = 0;
try{
numChars = stream.read(buf);
}catch(IOException e){
return -1;
}
if(numChars <= 0){
return -1;
}
}
return buf[curChar];
}
public int i(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn=1;
if(c == '-'){
sgn = -1;
c = read();
}
int res = 0;
do{
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
while(!isSpaceChar(c));
return res * sgn;
}
public long l(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn = 1;
if(c == '-'){
sgn = -1;
c = read();
}
long res = 0;
do{
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
while(!isSpaceChar(c));
return res * sgn;
}
public String s(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
StringBuilder res = new StringBuilder();
do{
if(Character.isValidCodePoint(c)){
res.appendCodePoint(c);
}
c = read();
}
while(!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c){
if(filter != null){
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c){
return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
}
private String readLine0(){
StringBuilder buf = new StringBuilder();
int c = read();
while(c != '\n' && c != -1){
if(c != '\r'){
buf.appendCodePoint(c);
}
c = read();
}
return buf.toString();
}
public String readLine(){
String s = readLine0();
while(s.trim().length() == 0){
s = readLine0();
}
return s;
}
public String readLine(boolean ignoreEmptyLines){
if(ignoreEmptyLines) return readLine();
return readLine0();
}
public char c(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
return (char)c;
}
public double d(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn = 1;
if(c == '-'){
sgn = -1;
c = read();
}
double res = 0;
while(!isSpaceChar(c) && c != '.'){
if(c == 'e' || c == 'E'){
return res * Math.pow(10, i());
}
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}if(c == '.'){
c = read();
double m = 1;
while(!isSpaceChar(c)){
if(c == 'e' || c == 'E'){
return res * Math.pow(10 , i());
}if(c < '0' || c > '9'){
throw new InputMismatchException();
}
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public boolean isExhausted(){
int value;
while(isSpaceChar(value = peek()) && value != -1){
read();
}
return value == -1;
}
public SpaceCharFilter getFilter(){
return filter;
}
public void setFilter(SpaceCharFilter filter){
this.filter = filter;
}
public interface SpaceCharFilter{
public boolean isSpaceChar(int ch);
}
public int[] ia(int n){
int[] array = new int[n];
for(int i = 0 ; i < n ; ++i) array[i]=i();
return array;
}
public int[][] im(int n , int m){
int[][] matrix = new int[n][m];
for(int i = 0 ; i < n ; ++i) for(int j = 0 ; j < m ; ++j) matrix[i][j] = i();
return matrix;
}
public int[][] im(int n){
return im(n , n);
}
}
class OutputWriter{
private final PrintWriter writer;
public OutputWriter(OutputStream outputStream){
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}
public OutputWriter(Writer writer){
this.writer = new PrintWriter(writer);
}
public void p(Object... objects){
for(int i = 0 ; i < objects.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(objects[i]);
}
writer.println();
}
public void p(double[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(int[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(long[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(char[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(String[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(int[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(double[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(long[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(char[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(String[][]matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(){
writer.println();
}
public void p_(char i){
writer.print(i);
}
public void p(char i){
writer.println(i);
}
public void close(){
writer.close();
}
public void flush(){
writer.flush();
}
public void p_(String x){
writer.print(x);
}
public void p_(long i){
writer.print(i);
}
public void p(long i){
writer.println(i);
}
public void p_(int i){
writer.print(i);
}
public void p(int i){
writer.println(i);
}
}
import java.math.*;
import java.util.*;
import java.io.*;
import java.lang.*;
public class Main implements Runnable{
public void run(){
if(Static.CHECKER){
try{
System.setErr(new PrintStream(new FileOutputStream("error.txt")));
System.setOut(new PrintStream(new FileOutputStream("output.txt")));
System.setIn(new FileInputStream("input.txt"));
}catch(Exception e){
System.err.println("NOT A PROBLEM");
}
}
OutputWriter out = new OutputWriter(System.out);
Solution problem = new Solution(System.in , out);
int testCases = 1 , need = Static.NEED;
long s = 0l , e = 0l;
if(Static.HAS_TESTCASES != 0) testCases = problem.i();
for(int i = 1 ; i <= testCases ; i++){
if(need != 0) s = System.currentTimeMillis();
problem.solution();
if(need != 0) e = System.currentTimeMillis();
if(need != 0) System.err.println(i + " - " + (e - s) + " " + "ms");
}
out.flush();
out.close();
}
public static void main(String[] args) throws Exception{
new Thread(null , new Main() , "Main" , 1l << 26).start();
}
}
final class Static{
protected final static boolean CHECKER = System.getProperty("ONLINE_JUDGE") == null;
protected final static int HAS_TESTCASES = 0;
protected final static int NEED = 0;
}
class Solution{
boolean[][] col , row;
char[][] grid;
boolean[] r , c;
String s , t;
int n , a , b;
int cnt = (int) 100;
public void solution(){
n = a = b = i();
col = new boolean[n][3];
row = new boolean[n][3];
r = new boolean[n];
c = new boolean[n];
grid = new char[n][n];
s = s();
t = s();
for(int i = 0 ; i < n ; i++) Arrays.fill(grid[i] , '.');
if(finder(0 , 0)){
o.p(yes);
for(int i = 0 ; i < n ; i++){
o.p(new String(grid[i]));
}
}else{
o.p(no);
}
}
private boolean finder(int x , int y){
if(x == n){
for(int i = 0 ; i < n ; i++){
for(int j = 0 ; j < 3 ; j++){
if(!row[i][j] || !col[i][j]) return false;
}
}
return a == 0 && b == 0;
}
if(y == n) return finder(x + 1 , 0);
for(char i = 'A' ; i < 'D' ; i++) if(!col[y][i - 'A'] && !row[x][i - 'A']){
if(!r[x] && i != s.charAt(x)) continue;
if(!c[y] && i != t.charAt(y)) continue;
boolean R = false , T = false;
if(!r[x]) r[x] = R = true;
if(!c[y]) c[y] = T = true;
if(R) a -= 1;
if(T) b -= 1;
grid[x][y] = i;
row[x][i - 'A'] = true;
col[y][i - 'A'] = true;
if(finder(x , y + 1)) return true;
grid[x][y] = '.';
row[x][i - 'A'] = !true;
col[y][i - 'A'] = !true;
if(R) r[x] = false;
if(T) c[y] = false;
if(R) a += 1;
if(T) b += 1;
}
return finder(x , y + 1);
}
private String yes = "Yes";
private String no = "No";
private final long mod = (long) 1e9 + 7;
private final int imin = 1 << -1;
private final int imax = -1 >>> 1;
private final long lmin = 1l << -1l;
private final long lmax = -1l >>> 1l;
private OutputWriter o;
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilter filter;
private int min(int... arr){
int ret = arr[0];
for(int i : arr) ret=Math.min(ret,i);
return ret;
}
private int max(int... arr){
int ret = arr[0];
for(int i : arr) ret = Math.max(ret,i);
return ret;
}
private long min(long... arr){
long ret = arr[0];
for(long i : arr) ret = Math.min(ret , i);
return ret;
}
private long max(long... arr){
long ret = arr[0];
for(long i : arr) ret = Math.max(ret , i);
return ret;
}
private double min(double... arr){
//o.p(arr);
double ret = arr[0];
for(double i : arr) ret = Math.min(ret , i);
return ret;
}
private double max(double... arr){
double ret = arr[0];
for(double i : arr) ret = Math.max(ret , i);
return ret;
}
public Solution(InputStream stream , OutputWriter o){
this.stream = stream;
this.o = o;
}
public char[] sca(){
return s().toCharArray();
}
public int read(){
if(numChars == -1){
throw new InputMismatchException();
}
if(curChar >= numChars){
curChar = 0;
try{
numChars = stream.read(buf);
}catch(IOException e){
throw new InputMismatchException();
}
if(numChars <= 0){
return -1;
}
}
return buf[curChar++];
}
public int peek(){
if(numChars == -1){
return -1;
}
if(curChar >= numChars){
curChar = 0;
try{
numChars = stream.read(buf);
}catch(IOException e){
return -1;
}
if(numChars <= 0){
return -1;
}
}
return buf[curChar];
}
public int i(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn=1;
if(c == '-'){
sgn = -1;
c = read();
}
int res = 0;
do{
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
while(!isSpaceChar(c));
return res * sgn;
}
public long l(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn = 1;
if(c == '-'){
sgn = -1;
c = read();
}
long res = 0;
do{
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}
while(!isSpaceChar(c));
return res * sgn;
}
public String s(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
StringBuilder res = new StringBuilder();
do{
if(Character.isValidCodePoint(c)){
res.appendCodePoint(c);
}
c = read();
}
while(!isSpaceChar(c));
return res.toString();
}
public boolean isSpaceChar(int c){
if(filter != null){
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c){
return c==' '||c=='\n'||c=='\r'||c=='\t'||c==-1;
}
private String readLine0(){
StringBuilder buf = new StringBuilder();
int c = read();
while(c != '\n' && c != -1){
if(c != '\r'){
buf.appendCodePoint(c);
}
c = read();
}
return buf.toString();
}
public String readLine(){
String s = readLine0();
while(s.trim().length() == 0){
s = readLine0();
}
return s;
}
public String readLine(boolean ignoreEmptyLines){
if(ignoreEmptyLines) return readLine();
return readLine0();
}
public char c(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
return (char)c;
}
public double d(){
int c = read();
while(isSpaceChar(c)){
c = read();
}
int sgn = 1;
if(c == '-'){
sgn = -1;
c = read();
}
double res = 0;
while(!isSpaceChar(c) && c != '.'){
if(c == 'e' || c == 'E'){
return res * Math.pow(10, i());
}
if(c < '0' || c > '9'){
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
}if(c == '.'){
c = read();
double m = 1;
while(!isSpaceChar(c)){
if(c == 'e' || c == 'E'){
return res * Math.pow(10 , i());
}if(c < '0' || c > '9'){
throw new InputMismatchException();
}
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public boolean isExhausted(){
int value;
while(isSpaceChar(value = peek()) && value != -1){
read();
}
return value == -1;
}
public SpaceCharFilter getFilter(){
return filter;
}
public void setFilter(SpaceCharFilter filter){
this.filter = filter;
}
public interface SpaceCharFilter{
public boolean isSpaceChar(int ch);
}
public int[] ia(int n){
int[] array = new int[n];
for(int i = 0 ; i < n ; ++i) array[i]=i();
return array;
}
public int[][] im(int n , int m){
int[][] matrix = new int[n][m];
for(int i = 0 ; i < n ; ++i) for(int j = 0 ; j < m ; ++j) matrix[i][j] = i();
return matrix;
}
public int[][] im(int n){
return im(n , n);
}
}
class OutputWriter{
private final PrintWriter writer;
public OutputWriter(OutputStream outputStream){
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}
public OutputWriter(Writer writer){
this.writer = new PrintWriter(writer);
}
public void p(Object... objects){
for(int i = 0 ; i < objects.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(objects[i]);
}
writer.println();
}
public void p(double[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(int[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(long[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(char[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(String[] array){
for(int i = 0 ; i < array.length ; i++){
if(i != 0){
writer.print(' ');
}
writer.print(array[i]);
}
writer.println();
}
public void p(int[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(double[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(long[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(char[][] matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(String[][]matrix){
for(int i = 0 ; i < matrix.length ; ++i){
p(matrix[i]);
}
writer.println();
}
public void p(){
writer.println();
}
public void p_(char i){
writer.print(i);
}
public void p(char i){
writer.println(i);
}
public void close(){
writer.close();
}
public void flush(){
writer.flush();
}
public void p_(String x){
writer.print(x);
}
public void p_(long i){
writer.print(i);
}
public void p(long i){
writer.println(i);
}
public void p_(int i){
writer.print(i);
}
public void p(int i){
writer.println(i);
}
}
| ConDefects/ConDefects/Code/abc326_d/Java/47082243 |
condefects-java_data_1490 | import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
static kattio sc = new kattio();
static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
Map<Integer, List<Integer>> map2 = new HashMap<Integer, List<Integer>>();
static List<Integer> idex;
static int[] zt, zhi;
public static void main(String[] args) {
// System.out.println((1l<<25));
// System.out.println("aaa");
// System.out.println(1<<shu(8));
// System.out.println(7|7|10);
int t = 1;
p = false;
while (t-- > 0) {
if (t == 5456 - 35) {
p = true;
}
sovle2();
p = false;
}
out.close();
}
static boolean p;
static Map<Integer, List<Integer>> map;
static long[] dp, ge, color;
static int[][] tu;
static long ans, ans1;
static Map<Integer, Map<Integer, Integer>> zmp;
static Map<Long, Long> va;
static int ui = 0;
static void sovle2() {
int n=sc.nextint();
int[]arr=new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i]=sc.nextint();
}
long ans=0;
//System.out.println(ji(7));
Map<Integer, Integer>map=new HashMap<Integer, Integer>();map.put(0, 0);
for (int i = 0; i < arr.length; i++) {
if (arr[i]!=0) {
arr[i]=ji(arr[i]);
}
map.put(arr[i], 0);
}
//System.out.println(Arrays.toString(arr));
for (int i = 0; i < arr.length; i++) {
if (arr[i]==0) {
ans+=i+1;
}else {
ans+=map.get(arr[i])+map.get(0);
}
map.put(arr[i], map.get(arr[i])+1);
}
out.println(ans);
}
static int ji(int x) {
int ans=1;
for (int i = 2; i <=x/i; i++) {
if (x%i==0) {
int ge=0;
while (x%i==0) {
x/=i;ge++;
}
if (ge%2==1) {
ans*=i;
}
}
}
if (x>1) {
ans*=x;
}
return ans;
}
static int[]bigson,size,L,R,xu,max,min,dian,cost;
static int id,l,r;
static int[][]zzz;
static void dfs1(int x,int fu,int n) {
size[x]=1;max[x]=x;min[x]=x;
L[x]=id;
xu[id]=x;id++;
for (int i : map.get(x)) {
cost[x]++;
if (i!=fu) {
dfs1(i, x,n);
size[x]+=size[i];
max[x]=Math.max(max[x], max[i]);
min[x]=Math.min(min[x], min[i]);
if (min[i]==1&&max[i]==n) {
bigson[x]=i;
}
if (min[i]==1&&max[i]==size[i]) {
cost[x]++;
}else if(max[i]==n&&max[i]-min[i]+1==size[i]){
cost[x]++;
}
}
}
R[x]=id;
}
static void dfs2(int x,int fu,boolean p) {
if (bigson[x]!=0) {
dfs2(bigson[x], x, p);
for (int i : map.get(x)) {
if (i!=bigson[x]&&i!=fu) {
for (int k = L[i]; k < R[i]; k++) {
dian[xu[k]]=1;
}
}
}
}else {
for (int i = L[x]; i < R[x]; i++) {
dian[xu[i]]=1;
}
}
while (l<r&&dian[l]+dian[l+1]!=1) {
l++;
}
if (dian[l]+dian[l+1]!=1) {
zzz[x][0]=l;
}
while (l<r&&dian[r]+dian[r-1]!=1) {
r--;
}
if (dian[r]+dian[r-1]!=1) {
zzz[x][1]=r;
}
}
static void sovle1() {
int n = sc.nextint();
long c = sc.nextlong();
int[] s = sc.arr(n);
long ans = (c + 1) * (c + 2) / 2;
int ji = 0;
int ou = 0;
for (int i = 0; i < s.length; i++) {
if (s[i] % 2 == 0) {
ou++;
} else {
ji++;
}
ans -= (c - s[i] + 1);
ans -= ((s[i]) / 2 + 1);
if (s[i] % 2 == 0) {
ans += ou;
} else {
ans += ji;
}
}
out.println(ans);
}
static int ipo = 0;
static void sovle() {
int n = sc.nextint();
int m = sc.nextint();
int[] c = sc.arr(n);
int[][] arr = new int[n][m + 1];
int[] chu = sc.arr(m);
// arr[0][3]=1;
for (int i = 1; i < arr.length; i++) {
for (int j = 0; j < m; j++) {
arr[i][j] = sc.nextint();
}
arr[i][m] = i;
}
long ans = Long.MAX_VALUE;
for (int i = 0; i < m; i++) {
ipo = i;
Arrays.sort(arr, (a, b) -> a[ipo] - b[ipo]);
Queue<long[]> queue = new PriorityQueue<long[]>(new Comparator<long[]>() {
@Override
public int compare(long[] o1, long[] o2) {
// TODO 自动生成的方法存根
if (o1[0] + o1[1] > o2[0] + o2[1]) {
return 1;
} else if (o1[0] + o1[1] < o2[0] + o2[1]) {
return -1;
} else {
if (o1[1] > o2[1]) {
return 1;
} else {
return -1;
}
}
}
});
long[] jia = new long[2];
jia[0] = 0;
jia[1] = chu[i];
queue.add(jia);
long min = Long.MAX_VALUE / 2;
long sum = Long.MAX_VALUE / 2;
for (int j = 1; j < arr.length; j++) {
// System.out.println(Arrays.toString(arr[j])+" "+arr.length);
while (!queue.isEmpty() && queue.peek()[1] < arr[j][i]) {
min = Math.min(min, queue.poll()[0]);
}
long[] add = new long[2];
add[1] = arr[j][i];
sum = Math.min(sum, min + c[arr[j][m]]);
if (!queue.isEmpty()) {
if (sum > queue.peek()[0] + queue.peek()[1] - arr[j][i]) {
add[1] = queue.peek()[1];
} else if (sum == queue.peek()[0] + queue.peek()[1] - arr[j][i]) {
add[1] = Math.min(queue.peek()[1], add[1]);
}
System.out.println("aaa" + (queue.peek()[0] + queue.peek()[1] - arr[j][i] + c[arr[j][m]]));
sum = Math.min(sum, queue.peek()[0] + queue.peek()[1] - arr[j][i] + c[arr[j][m]]);
}
add[0] = sum;
queue.add(add);
System.out.println(sum + " " + Arrays.toString(arr[j]) + " " + Arrays.toString(queue.peek()));
if (arr[j][m] == n - 1) {
break;
}
}
ans = Math.min(sum, ans);
System.out.println("*******************************");
}
out.println(ans);
}
static long ji(long u, long x) {
return u * x - (x - 1) * x / 2;
}
static List<int[]> list;
static int[] dx = { 1, -1, 1, -1 };
static int[] dy = { -1, 1, 1, -1 };
static int[] ls, rs;
static void build(int[] h) {
int n = h.length - 1;
int top = 0;
int[] stk = new int[n + 1];
for (int i = 1; i <= n; i++) {
int k = top;
// System.out.println(stk[k]);
while (k > 0 && h[stk[k]] < h[i])
k--;
if (k != 0)
rs[stk[k]] = i; // rs代表笛卡尔树每个节点的右儿子
if (k < top)
ls[i] = stk[k + 1]; // ls代表笛卡尔树每个节点的左儿子
stk[++k] = i;
top = k;
}
}
static long mod = 998244353;
static long pow(long a, long b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
long c = pow(a, b / 2);
return c * c % mod;
} else {
long c = pow(a, b / 2);
return c * c % mod * a % mod;
}
}
static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
static long[] c;
static int lowbit(int x) {
return x & -x;
}
static void add(int x, int v) {
while (x < c.length) {
c[x] += v;
x += lowbit(x);
}
}
static long sum(int x) {
long ans = 0;
while (x > 0) {
ans += c[x];
x -= lowbit(x);
}
return ans;
}
}
class kattio extends PrintWriter {
static BufferedReader r;
static StringTokenizer st;
public kattio() {
this(System.in, System.out);
}
public kattio(InputStream i, OutputStream o) {
super(o);
r = new BufferedReader(new InputStreamReader(i));
}
public kattio(String input, String out) throws IOException {
super(out);
r = new BufferedReader(new FileReader(input));
}
public String next() {
try {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(r.readLine());
}
return st.nextToken();
} catch (Exception e) {
// TODO: handle exception
return null;
}
}
public int nextint() {
return Integer.parseInt(next());
}
public long nextlong() {
return Long.parseLong(next());
}
public int[] arr(int n) {
int[] arr = new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i] = Integer.parseInt(next());
}
return arr;
}
public int[] Arr(int n) {
int[] arr = new int[n + 1];
for (int i = 1; i < arr.length; i++) {
arr[i] = Integer.parseInt(next());
}
return arr;
}
public double nextdouble() {
return Double.parseDouble(next());
}
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
public class Main {
static kattio sc = new kattio();
static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
Map<Integer, List<Integer>> map2 = new HashMap<Integer, List<Integer>>();
static List<Integer> idex;
static int[] zt, zhi;
public static void main(String[] args) {
// System.out.println((1l<<25));
// System.out.println("aaa");
// System.out.println(1<<shu(8));
// System.out.println(7|7|10);
int t = 1;
p = false;
while (t-- > 0) {
if (t == 5456 - 35) {
p = true;
}
sovle2();
p = false;
}
out.close();
}
static boolean p;
static Map<Integer, List<Integer>> map;
static long[] dp, ge, color;
static int[][] tu;
static long ans, ans1;
static Map<Integer, Map<Integer, Integer>> zmp;
static Map<Long, Long> va;
static int ui = 0;
static void sovle2() {
int n=sc.nextint();
int[]arr=new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i]=sc.nextint();
}
long ans=0;
//System.out.println(ji(7));
Map<Integer, Integer>map=new HashMap<Integer, Integer>();map.put(0, 0);
for (int i = 0; i < arr.length; i++) {
if (arr[i]!=0) {
arr[i]=ji(arr[i]);
}
map.put(arr[i], 0);
}
//System.out.println(Arrays.toString(arr));
for (int i = 0; i < arr.length; i++) {
if (arr[i]==0) {
ans+=i;
}else {
ans+=map.get(arr[i])+map.get(0);
}
map.put(arr[i], map.get(arr[i])+1);
}
out.println(ans);
}
static int ji(int x) {
int ans=1;
for (int i = 2; i <=x/i; i++) {
if (x%i==0) {
int ge=0;
while (x%i==0) {
x/=i;ge++;
}
if (ge%2==1) {
ans*=i;
}
}
}
if (x>1) {
ans*=x;
}
return ans;
}
static int[]bigson,size,L,R,xu,max,min,dian,cost;
static int id,l,r;
static int[][]zzz;
static void dfs1(int x,int fu,int n) {
size[x]=1;max[x]=x;min[x]=x;
L[x]=id;
xu[id]=x;id++;
for (int i : map.get(x)) {
cost[x]++;
if (i!=fu) {
dfs1(i, x,n);
size[x]+=size[i];
max[x]=Math.max(max[x], max[i]);
min[x]=Math.min(min[x], min[i]);
if (min[i]==1&&max[i]==n) {
bigson[x]=i;
}
if (min[i]==1&&max[i]==size[i]) {
cost[x]++;
}else if(max[i]==n&&max[i]-min[i]+1==size[i]){
cost[x]++;
}
}
}
R[x]=id;
}
static void dfs2(int x,int fu,boolean p) {
if (bigson[x]!=0) {
dfs2(bigson[x], x, p);
for (int i : map.get(x)) {
if (i!=bigson[x]&&i!=fu) {
for (int k = L[i]; k < R[i]; k++) {
dian[xu[k]]=1;
}
}
}
}else {
for (int i = L[x]; i < R[x]; i++) {
dian[xu[i]]=1;
}
}
while (l<r&&dian[l]+dian[l+1]!=1) {
l++;
}
if (dian[l]+dian[l+1]!=1) {
zzz[x][0]=l;
}
while (l<r&&dian[r]+dian[r-1]!=1) {
r--;
}
if (dian[r]+dian[r-1]!=1) {
zzz[x][1]=r;
}
}
static void sovle1() {
int n = sc.nextint();
long c = sc.nextlong();
int[] s = sc.arr(n);
long ans = (c + 1) * (c + 2) / 2;
int ji = 0;
int ou = 0;
for (int i = 0; i < s.length; i++) {
if (s[i] % 2 == 0) {
ou++;
} else {
ji++;
}
ans -= (c - s[i] + 1);
ans -= ((s[i]) / 2 + 1);
if (s[i] % 2 == 0) {
ans += ou;
} else {
ans += ji;
}
}
out.println(ans);
}
static int ipo = 0;
static void sovle() {
int n = sc.nextint();
int m = sc.nextint();
int[] c = sc.arr(n);
int[][] arr = new int[n][m + 1];
int[] chu = sc.arr(m);
// arr[0][3]=1;
for (int i = 1; i < arr.length; i++) {
for (int j = 0; j < m; j++) {
arr[i][j] = sc.nextint();
}
arr[i][m] = i;
}
long ans = Long.MAX_VALUE;
for (int i = 0; i < m; i++) {
ipo = i;
Arrays.sort(arr, (a, b) -> a[ipo] - b[ipo]);
Queue<long[]> queue = new PriorityQueue<long[]>(new Comparator<long[]>() {
@Override
public int compare(long[] o1, long[] o2) {
// TODO 自动生成的方法存根
if (o1[0] + o1[1] > o2[0] + o2[1]) {
return 1;
} else if (o1[0] + o1[1] < o2[0] + o2[1]) {
return -1;
} else {
if (o1[1] > o2[1]) {
return 1;
} else {
return -1;
}
}
}
});
long[] jia = new long[2];
jia[0] = 0;
jia[1] = chu[i];
queue.add(jia);
long min = Long.MAX_VALUE / 2;
long sum = Long.MAX_VALUE / 2;
for (int j = 1; j < arr.length; j++) {
// System.out.println(Arrays.toString(arr[j])+" "+arr.length);
while (!queue.isEmpty() && queue.peek()[1] < arr[j][i]) {
min = Math.min(min, queue.poll()[0]);
}
long[] add = new long[2];
add[1] = arr[j][i];
sum = Math.min(sum, min + c[arr[j][m]]);
if (!queue.isEmpty()) {
if (sum > queue.peek()[0] + queue.peek()[1] - arr[j][i]) {
add[1] = queue.peek()[1];
} else if (sum == queue.peek()[0] + queue.peek()[1] - arr[j][i]) {
add[1] = Math.min(queue.peek()[1], add[1]);
}
System.out.println("aaa" + (queue.peek()[0] + queue.peek()[1] - arr[j][i] + c[arr[j][m]]));
sum = Math.min(sum, queue.peek()[0] + queue.peek()[1] - arr[j][i] + c[arr[j][m]]);
}
add[0] = sum;
queue.add(add);
System.out.println(sum + " " + Arrays.toString(arr[j]) + " " + Arrays.toString(queue.peek()));
if (arr[j][m] == n - 1) {
break;
}
}
ans = Math.min(sum, ans);
System.out.println("*******************************");
}
out.println(ans);
}
static long ji(long u, long x) {
return u * x - (x - 1) * x / 2;
}
static List<int[]> list;
static int[] dx = { 1, -1, 1, -1 };
static int[] dy = { -1, 1, 1, -1 };
static int[] ls, rs;
static void build(int[] h) {
int n = h.length - 1;
int top = 0;
int[] stk = new int[n + 1];
for (int i = 1; i <= n; i++) {
int k = top;
// System.out.println(stk[k]);
while (k > 0 && h[stk[k]] < h[i])
k--;
if (k != 0)
rs[stk[k]] = i; // rs代表笛卡尔树每个节点的右儿子
if (k < top)
ls[i] = stk[k + 1]; // ls代表笛卡尔树每个节点的左儿子
stk[++k] = i;
top = k;
}
}
static long mod = 998244353;
static long pow(long a, long b) {
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
long c = pow(a, b / 2);
return c * c % mod;
} else {
long c = pow(a, b / 2);
return c * c % mod * a % mod;
}
}
static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
static long[] c;
static int lowbit(int x) {
return x & -x;
}
static void add(int x, int v) {
while (x < c.length) {
c[x] += v;
x += lowbit(x);
}
}
static long sum(int x) {
long ans = 0;
while (x > 0) {
ans += c[x];
x -= lowbit(x);
}
return ans;
}
}
class kattio extends PrintWriter {
static BufferedReader r;
static StringTokenizer st;
public kattio() {
this(System.in, System.out);
}
public kattio(InputStream i, OutputStream o) {
super(o);
r = new BufferedReader(new InputStreamReader(i));
}
public kattio(String input, String out) throws IOException {
super(out);
r = new BufferedReader(new FileReader(input));
}
public String next() {
try {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(r.readLine());
}
return st.nextToken();
} catch (Exception e) {
// TODO: handle exception
return null;
}
}
public int nextint() {
return Integer.parseInt(next());
}
public long nextlong() {
return Long.parseLong(next());
}
public int[] arr(int n) {
int[] arr = new int[n];
for (int i = 0; i < arr.length; i++) {
arr[i] = Integer.parseInt(next());
}
return arr;
}
public int[] Arr(int n) {
int[] arr = new int[n + 1];
for (int i = 1; i < arr.length; i++) {
arr[i] = Integer.parseInt(next());
}
return arr;
}
public double nextdouble() {
return Double.parseDouble(next());
}
} | ConDefects/ConDefects/Code/abc342_d/Java/51103385 |
condefects-java_data_1491 | 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[] a= new int[n];
int[] b = new int[200010];
for(int i = 0; i < n; i++) a[i] = Integer.parseInt(sc.next());
long ans = 0;
for(int i = 0; i < n; i++) {
int v = a[i];
for(int j = 2; j * j <= a[i]; j++) {
while(v % (j * j) == 0) {
v /= j * j;
}
}
ans += b[v];
b[v]++;
}
ans += b[0] * (n - b[0]);
System.out.println(ans);
}
}
}
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[] a= new int[n];
int[] b = new int[200010];
for(int i = 0; i < n; i++) a[i] = Integer.parseInt(sc.next());
long ans = 0;
for(int i = 0; i < n; i++) {
int v = a[i];
for(int j = 2; j * j <= a[i]; j++) {
while(v % (j * j) == 0) {
v /= j * j;
}
}
ans += b[v];
b[v]++;
}
ans += 1L * b[0] * (n - b[0]);
System.out.println(ans);
}
}
}
| ConDefects/ConDefects/Code/abc342_d/Java/51009390 |
condefects-java_data_1492 |
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));
PrintWriter pw = new PrintWriter(System.out);
StreamTokenizer in = new StreamTokenizer(br);
in.nextToken();
int n = (int)in.nval;
int ans = 0;
int cnt0 = 0;
int[] count = new int[200001];
for (int i = 0; i < n; i++) {
in.nextToken();
int num = (int)in.nval;
if(num == 0){
ans += i;
cnt0++;
continue;
}
//分解质因数，消掉偶数的质因子，留下质因子是奇数的
for(long j=2;j*j <= num;j++){
long k = j*j;
//分解质因数
while(num % k == 0){
num /= k;
}
}
//1 num >= 1
// num == 1,表示num本身就是 一个平方数，它可以和之前的平方数结合,之前的平方数分解后 num == 1
// num > 1 需要和 num 类型的结合。
//2.任何一个数可以和 0 相乘 结果 为 0
ans += count[num] + cnt0;
count[num]++;
}
pw.println(ans);
pw.flush();
pw.close();
}
}
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));
PrintWriter pw = new PrintWriter(System.out);
StreamTokenizer in = new StreamTokenizer(br);
in.nextToken();
int n = (int)in.nval;
long ans = 0;
int cnt0 = 0;
int[] count = new int[200001];
for (int i = 0; i < n; i++) {
in.nextToken();
int num = (int)in.nval;
if(num == 0){
ans += i;
cnt0++;
continue;
}
//分解质因数，消掉偶数的质因子，留下质因子是奇数的
for(long j=2;j*j <= num;j++){
long k = j*j;
//分解质因数
while(num % k == 0){
num /= k;
}
}
//1 num >= 1
// num == 1,表示num本身就是 一个平方数，它可以和之前的平方数结合,之前的平方数分解后 num == 1
// num > 1 需要和 num 类型的结合。
//2.任何一个数可以和 0 相乘 结果 为 0
ans += count[num] + cnt0;
count[num]++;
}
pw.println(ans);
pw.flush();
pw.close();
}
} | ConDefects/ConDefects/Code/abc342_d/Java/50726470 |
condefects-java_data_1493 | import java.util.*;
import java.util.stream.Collectors;
public class Main {
static Scanner sc = new Scanner(System.in);
//A
static boolean a(String s){
if (s.length()==1) return true;
for (int i = 1; i < s.length(); i++) {
if (s.charAt(i)-'0'>=s.charAt(i-1)-'0')return false;
}
return true;
}
static int b(int[] a,int tar){
Arrays.sort(a);
int sum = Arrays.stream(a).sum();
if (a[0]!=a[a.length-1]) sum -= a[0]+a[a.length-1];
else sum -= a[0];
int ans = tar - sum;
if (ans>100) return -1;
if (ans<0) return 0;
return ans;
}
public static void main(String[] args) {
int n = sc.nextInt();
int tar = sc.nextInt();
int[] a = new int[n-1];
for (int i = 0; i < n-1; i++) a[i] = sc.nextInt();
System.out.println(b(a,tar));
}
}
import java.util.*;
import java.util.stream.Collectors;
public class Main {
static Scanner sc = new Scanner(System.in);
//A
static boolean a(String s){
if (s.length()==1) return true;
for (int i = 1; i < s.length(); i++) {
if (s.charAt(i)-'0'>=s.charAt(i-1)-'0')return false;
}
return true;
}
static int b(int[] a,int tar){
Arrays.sort(a);
int sum = Arrays.stream(a).sum();
if(sum-a[a.length-1]>=tar) return 0;
if (a[0]!=a[a.length-1]) sum -= a[0]+a[a.length-1];
else sum -= a[0];
int ans = tar - sum;
if (ans<a[0]||ans>a[a.length-1]) return -1;
if (ans>100) return -1;
if (ans<0) return 0;
return ans;
}
public static void main(String[] args) {
int n = sc.nextInt();
int tar = sc.nextInt();
int[] a = new int[n-1];
for (int i = 0; i < n-1; i++) a[i] = sc.nextInt();
System.out.println(b(a,tar));
}
}
| ConDefects/ConDefects/Code/abc321_b/Java/48011976 |
condefects-java_data_1494 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int X = sc.nextInt();
int[] A = new int[N];
for(int i=1;i<=N-1;i++) {
A[i]=sc.nextInt();
}
A[0]=-1;
Arrays.sort(A);
int s1 = 0;
for(int i=1;i<=N-2;i++) {
s1+=A[i];
}
if(s1>=X) {
System.out.println(0);
return;
}
int s2=0;
for(int i=2;i<=N-2;i++) {
s2+=A[i];
}
if(A[1]<=X-s2 && X-s2<=A[N-1]) {
System.out.println(X-s2);
return;
}
int s3 =0;
for(int i=2;i<=N-1;i++) {
s3+=A[i];
}
if(X-s3>=A[N-1] && X-s3 <= 100) {
System.out.println(A[N-1]);
return;
}
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 X = sc.nextInt();
int[] A = new int[N];
for(int i=1;i<=N-1;i++) {
A[i]=sc.nextInt();
}
A[0]=-1;
Arrays.sort(A);
int s1 = 0;
for(int i=1;i<=N-2;i++) {
s1+=A[i];
}
if(s1>=X) {
System.out.println(0);
return;
}
int s2=0;
for(int i=2;i<=N-2;i++) {
s2+=A[i];
}
if(A[1]<=X-s2 && X-s2<=A[N-1]) {
System.out.println(X-s2);
return;
}
int s3 =0;
for(int i=2;i<=N-1;i++) {
s3+=A[i];
}
if(s3>=X) {
System.out.println(A[N-1]);
return;
}
System.out.println(-1);
}
}
| ConDefects/ConDefects/Code/abc321_b/Java/54974001 |
condefects-java_data_1495 | import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) {
int n, x;
int[] a;
try (var s = new Scanner(System.in)) {
n = s.nextInt();
x = s.nextInt();
a = new int[n];
for (int i = 0; i < n-1; i++) a[i] = s.nextInt();
}
int min = Integer.MAX_VALUE;
for (int i = 0; i <= 100; i++) {
int[] b = a.clone();
b[n-1] = i;
Arrays.sort(b);
//System.out.println(Arrays.toString(b));//debug
int sum = 0;
for (int j = 1; j < n-1; j++) sum += b[j];
//System.out.println(sum);//debug
if (sum == x) {
min = i;
break;
}
}
System.out.println(min == Integer.MAX_VALUE ? -1 : min);
}
}
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) {
int n, x;
int[] a;
try (var s = new Scanner(System.in)) {
n = s.nextInt();
x = s.nextInt();
a = new int[n];
for (int i = 0; i < n-1; i++) a[i] = s.nextInt();
}
int min = Integer.MAX_VALUE;
for (int i = 0; i <= 100; i++) {
int[] b = a.clone();
b[n-1] = i;
Arrays.sort(b);
//System.out.println(Arrays.toString(b));//debug
int sum = 0;
for (int j = 1; j < n-1; j++) sum += b[j];
//System.out.println(sum);//debug
if (sum >= x) {
min = i;
break;
}
}
System.out.println(min == Integer.MAX_VALUE ? -1 : min);
}
} | ConDefects/ConDefects/Code/abc321_b/Java/47882208 |
condefects-java_data_1496 |
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int X = sc.nextInt();
List<Integer> A = new ArrayList<Integer>();
for(int i = 0; i < N - 1; i++) {
A.add(sc.nextInt());
}
for(int i = 0; i <= 100; i++) {
// System.out.println("i=" + i);
int sum = 0;
List<Integer> A1 = new ArrayList<Integer>(A);
A1.add(i);
// System.out.print(A1);
Collections.sort(A1);
A1.remove(A1.size() - 1);
A1.remove(0);
// System.out.println(A1);
for(Integer a : A1) {
sum += a;
}
// System.out.println("sum=" + sum);
if(sum == X) {
System.out.println(i);
return;
}
}
System.out.println(-1);
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int X = sc.nextInt();
List<Integer> A = new ArrayList<Integer>();
for(int i = 0; i < N - 1; i++) {
A.add(sc.nextInt());
}
for(int i = 0; i <= 100; i++) {
// System.out.println("i=" + i);
int sum = 0;
List<Integer> A1 = new ArrayList<Integer>(A);
A1.add(i);
// System.out.print(A1);
Collections.sort(A1);
A1.remove(A1.size() - 1);
A1.remove(0);
// System.out.println(A1);
for(Integer a : A1) {
sum += a;
}
// System.out.println("sum=" + sum);
if(sum >= X) {
System.out.println(i);
return;
}
}
System.out.println(-1);
}
}
| ConDefects/ConDefects/Code/abc321_b/Java/47443321 |
condefects-java_data_1497 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static int INF = Integer.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
int N = scanner.nextInt();
int X = scanner.nextInt();
int[] a = new int[N-1];
Arrays.setAll(a, i -> scanner.nextInt());
for (int i = 0; i < 100; i++) {
int[] aa = new int[N];
for (int j = 0; j < a.length; j++) {
aa[j]=a[j];
}
aa[N-1]=i;
Arrays.sort(aa);
int sum = 0;
for (int j = 1; j < N-1; j++) {
sum += aa[j];
}
if (sum >= X) {
System.out.println(i);
return;
}
}
System.out.println(-1);
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static 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.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static int INF = Integer.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
int N = scanner.nextInt();
int X = scanner.nextInt();
int[] a = new int[N-1];
Arrays.setAll(a, i -> scanner.nextInt());
for (int i = 0; i <= 100; i++) {
int[] aa = new int[N];
for (int j = 0; j < a.length; j++) {
aa[j]=a[j];
}
aa[N-1]=i;
Arrays.sort(aa);
int sum = 0;
for (int j = 1; j < N-1; j++) {
sum += aa[j];
}
if (sum >= X) {
System.out.println(i);
return;
}
}
System.out.println(-1);
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static 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/abc321_b/Java/52832725 |
condefects-java_data_1498 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
int y = scan.nextInt()-x;
int count = 0;
x = 0;
if(y<0) {
System.out.println(count);
return;
}
while(true) {
x+=10;
count++;
if(x>=y) {
System.out.println(count);
return;
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
int y = scan.nextInt()-x;
int count = 0;
x = 0;
if(y<=0) {
System.out.println(count);
return;
}
while(true) {
x+=10;
count++;
if(x>=y) {
System.out.println(count);
return;
}
}
}
}
| ConDefects/ConDefects/Code/abc233_a/Java/35822527 |
condefects-java_data_1499 |
import java.util.Scanner;
public class Main {//10엔짜리 우표
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String input = scan.nextLine();
int X = Integer.parseInt(input.split(" ")[0]);
int Y = Integer.parseInt(input.split(" ")[1]);
//logic
int sum = X;
int stiker = 0;
while(true) {
stiker ++;
sum += 10;
if(sum >= Y) {break;}
}
System.out.println(stiker);
}//main
}
import java.util.Scanner;
public class Main {//10엔짜리 우표
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String input = scan.nextLine();
int X = Integer.parseInt(input.split(" ")[0]);
int Y = Integer.parseInt(input.split(" ")[1]);
//logic
int sum = X;
int stiker = 0;
while(true) {
if(sum >= Y) {break;}
stiker ++;
sum += 10;
}
System.out.println(stiker);
}//main
}
| ConDefects/ConDefects/Code/abc233_a/Java/35822050 |
condefects-java_data_1500 | import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int cnt = 0;
while(y >= x){
x += 10;
cnt ++;
}
System.out.println(cnt);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int cnt = 0;
while(y > x){
x += 10;
cnt ++;
}
System.out.println(cnt);
}
} | ConDefects/ConDefects/Code/abc233_a/Java/36376050 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.