id
stringlengths 22
25
| content
stringlengths 327
628k
| max_stars_repo_path
stringlengths 49
49
|
|---|---|---|
condefects-java_data_201 | import java.io.*;
import java.util.*;
class Main {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N, L, R;
int[] a;
BinaryIndexedTreeLight bit;
static int i(String is) {
return Integer.parseInt(is);
}
void calc() throws Exception {
String[] nlr = br.readLine().split(" ");
N = i(nlr[0]); L = i(nlr[1]); R = i(nlr[2]);
String[] as = br.readLine().split(" ");
a = Arrays.stream(as).mapToInt(s -> i(s)).toArray();
bit = new BinaryIndexedTreeLight(N+1);
long decL = 0;
bit.update(0, 0);
for (int i = 1; i <= N; i++) {
decL += (L - a[i-1]);
bit.update(i, decL);
}
long decR = 0;
long min = bit.calculate(N);
for (int i = 1; i <= N; i++) {
decR += (R - a[N-i]);
long val = bit.calculate(N-i) + decR;
min = Math.min(min, val);
}
System.out.println(L*N - decL + min);
}
public static void main(String[] args) throws Exception {
new Main().calc();
}
}
class BinaryIndexedTreeLight {
private int size;
private long[] st;
private static final long ID = Long.MAX_VALUE / 2;
public BinaryIndexedTreeLight(int size) {
st = new long[size];
this.size = size;
Arrays.fill(st, ID);
}
public void update(int index, long element) {
index++;
while (index <= size) {
st[index-1] = Math.min(st[index-1], element);
index += index & -index;
}
}
public long calculate(int e) {
if (e < 0) return ID;
if (e >= size) e = size - 1;
long s = ID;
e++;
while (e > 0) {
s = Math.min(s, st[e-1]);
e -= e & -e;
}
return s;
}
}
import java.io.*;
import java.util.*;
class Main {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int N, L, R;
int[] a;
BinaryIndexedTreeLight bit;
static int i(String is) {
return Integer.parseInt(is);
}
void calc() throws Exception {
String[] nlr = br.readLine().split(" ");
N = i(nlr[0]); L = i(nlr[1]); R = i(nlr[2]);
String[] as = br.readLine().split(" ");
a = Arrays.stream(as).mapToInt(s -> i(s)).toArray();
bit = new BinaryIndexedTreeLight(N+1);
long decL = 0;
bit.update(0, 0);
for (int i = 1; i <= N; i++) {
decL += (L - a[i-1]);
bit.update(i, decL);
}
long decR = 0;
long min = bit.calculate(N);
for (int i = 1; i <= N; i++) {
decR += (R - a[N-i]);
long val = bit.calculate(N-i) + decR;
min = Math.min(min, val);
}
System.out.println((long)L*N - decL + min);
}
public static void main(String[] args) throws Exception {
new Main().calc();
}
}
class BinaryIndexedTreeLight {
private int size;
private long[] st;
private static final long ID = Long.MAX_VALUE / 2;
public BinaryIndexedTreeLight(int size) {
st = new long[size];
this.size = size;
Arrays.fill(st, ID);
}
public void update(int index, long element) {
index++;
while (index <= size) {
st[index-1] = Math.min(st[index-1], element);
index += index & -index;
}
}
public long calculate(int e) {
if (e < 0) return ID;
if (e >= size) e = size - 1;
long s = ID;
e++;
while (e > 0) {
s = Math.min(s, st[e-1]);
e -= e & -e;
}
return s;
}
}
| ConDefects/ConDefects/Code/abc263_d/Java/38646312 |
condefects-java_data_202 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Objects;
import java.util.StringTokenizer;
import java.util.Map;
import java.util.Map.Entry;
import java.io.BufferedReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastScanner in = new FastScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Ex_Unite solver = new Ex_Unite();
solver.solve(1, in, out);
out.close();
}
static class Ex_Unite {
public void solve(int testNumber, FastScanner in, PrintWriter out) {
int height = in.nextInt();
int width = in.nextInt();
char[][] s = new char[height][];
for (int r = 0; r < height; r++) {
s[r] = in.next().toCharArray();
}
final int infinity = height * width;
Map<State, Integer> dp = new HashMap<>();
dp.put(new State(new int[width], 0), 0);
for (int r = 0; r < height; r++) {
for (int c = 0; c < width; c++) {
Map<State, Integer> ndp = new HashMap<>();
for (Map.Entry<State, Integer> e : dp.entrySet()) {
for (int x = 0; x < 2; x++) {
int cost = x;
if (s[r][c] == '#') {
if (x == 0) {
continue;
}
cost = 0;
}
State st = e.getKey();
int[] a = st.a.clone();
if (x == 0) {
if (a[c] != 0) {
int numWithCol = 0;
for (int v : a) {
if (v == a[c]) {
++numWithCol;
}
}
if (numWithCol == 1 && st.numCols != 1) {
continue;
}
}
a[c] = 0;
} else {
int colUp = a[c];
int colLeft = c == 0 ? 0 : a[c - 1];
if (colUp != 0 && colLeft != 0) {
a[c] = colLeft;
for (int i = 0; i < a.length; i++) {
if (a[i] == colUp) {
a[i] = colLeft;
}
}
} else if (colUp != 0) {
a[c] = colUp;
} else if (colLeft != 0) {
a[c] = colLeft;
} else {
a[c] = st.numCols + 1;
}
}
State nst = new State(a, st.seenBlack);
if (nst.numCols == 0) {
if (nst.seenBlack != 0) {
nst.seenBlack = 2;
}
} else {
if (nst.seenBlack == 2) {
continue;
}
nst.seenBlack = 1;
}
int val = e.getValue() + cost;
int old = ndp.getOrDefault(nst, infinity);
if (val < old) {
ndp.put(nst, val);
}
}
}
dp = ndp;
}
}
int ans = infinity;
for (Map.Entry<State, Integer> e : dp.entrySet()) {
State st = e.getKey();
if (st.seenBlack >= 1) {
ans = Math.min(ans, e.getValue());
}
}
out.println(ans);
}
class State {
int[] a;
int seenBlack;
int numCols;
State(int[] a, int seenBlack) {
this.seenBlack = seenBlack;
int maxCol = 0;
for (int x : a) {
maxCol = Math.max(maxCol, x);
}
int[] repaint = new int[maxCol + 1];
Arrays.fill(repaint, -1);
repaint[0] = 0;
numCols = 0;
for (int x : a) {
if (repaint[x] < 0) {
++numCols;
repaint[x] = numCols;
}
}
for (int i = 0; i < a.length; i++) {
a[i] = repaint[a[i]];
}
this.a = a;
}
public boolean equals(Object o) {
State state = (State) o;
return seenBlack == state.seenBlack && Arrays.equals(a, state.a);
}
public int hashCode() {
int result = Objects.hash(seenBlack);
result = 31 * result + Arrays.hashCode(a);
return result;
}
}
}
static class FastScanner {
private BufferedReader in;
private StringTokenizer st;
public FastScanner(InputStream stream) {
in = new BufferedReader(new InputStreamReader(stream));
}
public String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Objects;
import java.util.StringTokenizer;
import java.util.Map;
import java.util.Map.Entry;
import java.io.BufferedReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
FastScanner in = new FastScanner(inputStream);
PrintWriter out = new PrintWriter(outputStream);
Ex_Unite solver = new Ex_Unite();
solver.solve(1, in, out);
out.close();
}
static class Ex_Unite {
public void solve(int testNumber, FastScanner in, PrintWriter out) {
int height = in.nextInt();
int width = in.nextInt();
char[][] s = new char[height][];
for (int r = 0; r < height; r++) {
s[r] = in.next().toCharArray();
}
final int infinity = height * width;
Map<State, Integer> dp = new HashMap<>();
dp.put(new State(new int[width], 0), 0);
for (int r = 0; r < height; r++) {
for (int c = 0; c < width; c++) {
Map<State, Integer> ndp = new HashMap<>();
for (Map.Entry<State, Integer> e : dp.entrySet()) {
for (int x = 0; x < 2; x++) {
int cost = x;
if (s[r][c] == '#') {
if (x == 0) {
continue;
}
cost = 0;
}
State st = e.getKey();
int[] a = st.a.clone();
if (x == 0) {
if (a[c] != 0) {
int numWithCol = 0;
for (int v : a) {
if (v == a[c]) {
++numWithCol;
}
}
if (numWithCol == 1 && st.numCols != 1) {
continue;
}
}
a[c] = 0;
} else {
int colUp = a[c];
int colLeft = c == 0 ? 0 : a[c - 1];
if (colUp != 0 && colLeft != 0) {
a[c] = colLeft;
for (int i = 0; i < a.length; i++) {
if (a[i] == colUp) {
a[i] = colLeft;
}
}
} else if (colUp != 0) {
a[c] = colUp;
} else if (colLeft != 0) {
a[c] = colLeft;
} else {
a[c] = st.numCols + 1;
}
}
State nst = new State(a, st.seenBlack);
if (nst.numCols == 0) {
if (nst.seenBlack != 0) {
nst.seenBlack = 2;
}
} else {
if (nst.seenBlack == 2) {
continue;
}
nst.seenBlack = 1;
}
int val = e.getValue() + cost;
int old = ndp.getOrDefault(nst, infinity);
if (val < old) {
ndp.put(nst, val);
}
}
}
dp = ndp;
}
}
int ans = infinity;
for (Map.Entry<State, Integer> e : dp.entrySet()) {
State st = e.getKey();
if (st.seenBlack == 1 && st.numCols == 1 || st.seenBlack == 2) {
ans = Math.min(ans, e.getValue());
}
}
out.println(ans);
}
class State {
int[] a;
int seenBlack;
int numCols;
State(int[] a, int seenBlack) {
this.seenBlack = seenBlack;
int maxCol = 0;
for (int x : a) {
maxCol = Math.max(maxCol, x);
}
int[] repaint = new int[maxCol + 1];
Arrays.fill(repaint, -1);
repaint[0] = 0;
numCols = 0;
for (int x : a) {
if (repaint[x] < 0) {
++numCols;
repaint[x] = numCols;
}
}
for (int i = 0; i < a.length; i++) {
a[i] = repaint[a[i]];
}
this.a = a;
}
public boolean equals(Object o) {
State state = (State) o;
return seenBlack == state.seenBlack && Arrays.equals(a, state.a);
}
public int hashCode() {
int result = Objects.hash(seenBlack);
result = 31 * result + Arrays.hashCode(a);
return result;
}
}
}
static class FastScanner {
private BufferedReader in;
private StringTokenizer st;
public FastScanner(InputStream stream) {
in = new BufferedReader(new InputStreamReader(stream));
}
public String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(in.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
}
}
| ConDefects/ConDefects/Code/abc296_h/Java/40277377 |
condefects-java_data_203 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[][]a=new int[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
if(j==0||i==j){
a[i][j]=1;
} else{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<i+1;j++){
System.out.print(a[i][j]+" ");
}
System.out.println();
}
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[][]a=new int[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<=i;j++){
if(j==0||i==j){
a[i][j]=1;
} else{
a[i][j]=a[i-1][j-1]+a[i-1][j];
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<i+1;j++){
System.out.print(a[i][j]+" ");
}
System.out.println();
}
}
} | ConDefects/ConDefects/Code/abc254_b/Java/41619095 |
condefects-java_data_204 | import java.io.*;
import java.util.*;
/*
*/
public class Main{
static FastReader sc=null;
public static void main(String[] args) {
sc=new FastReader();
int n=sc.nextInt();
int a=sc.nextInt(),b=sc.nextInt();
int c[]=sc.readArray(n);
ruffleSort(c);
int l=c[0]-1,r=c[n-1]+2;
while(l+1<r) {
int mid=(l+r)/2;
if(pos(c,a,b,mid))l=mid;
else r=mid;
}
System.out.println(l);
}
static boolean pos(int c[],int a,int b,int k) {
int n=c.length;
int req=0,can=0;
for(int i=0;i<n;i++) {
if(c[i]>k) {
int d=c[i]-k;
can+=d/b;
}
else {
int d=k-c[i];
req+=(d+a-1)/a;
}
}
return can>=req;
}
static int[] ruffleSort(int a[]) {
ArrayList<Integer> al=new ArrayList<>();
for(int i:a)al.add(i);
Collections.sort(al);
for(int i=0;i<a.length;i++)a[i]=al.get(i);
return a;
}
static void print(int a[]) {
for(int e:a) {
System.out.print(e+" ");
}
System.out.println();
}
static class FastReader{
StringTokenizer st=new StringTokenizer("");
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String next() {
while(!st.hasMoreTokens())
try {
st=new StringTokenizer(br.readLine());
}
catch(IOException e){
e.printStackTrace();
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] readArray(int n) {
int a[]=new int[n];
for(int i=0;i<n;i++)a[i]=sc.nextInt();
return a;
}
}
}
import java.io.*;
import java.util.*;
/*
*/
public class Main{
static FastReader sc=null;
public static void main(String[] args) {
sc=new FastReader();
int n=sc.nextInt();
int a=sc.nextInt(),b=sc.nextInt();
int c[]=sc.readArray(n);
ruffleSort(c);
int l=c[0]-1,r=c[n-1]+2;
while(l+1<r) {
int mid=(l+r)/2;
if(pos(c,a,b,mid))l=mid;
else r=mid;
}
System.out.println(l);
}
static boolean pos(int c[],int a,int b,int k) {
int n=c.length;
long req=0,can=0;
for(int i=0;i<n;i++) {
if(c[i]>k) {
int d=c[i]-k;
can+=d/b;
}
else {
int d=k-c[i];
req+=(d+a-1)/a;
}
}
return can>=req;
}
static int[] ruffleSort(int a[]) {
ArrayList<Integer> al=new ArrayList<>();
for(int i:a)al.add(i);
Collections.sort(al);
for(int i=0;i<a.length;i++)a[i]=al.get(i);
return a;
}
static void print(int a[]) {
for(int e:a) {
System.out.print(e+" ");
}
System.out.println();
}
static class FastReader{
StringTokenizer st=new StringTokenizer("");
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String next() {
while(!st.hasMoreTokens())
try {
st=new StringTokenizer(br.readLine());
}
catch(IOException e){
e.printStackTrace();
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
int[] readArray(int n) {
int a[]=new int[n];
for(int i=0;i<n;i++)a[i]=sc.nextInt();
return a;
}
}
}
| ConDefects/ConDefects/Code/arc144_b/Java/33285875 |
condefects-java_data_205 | import java.io.*;
import java.util.*;
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
long a = in.nextLong();
long b = in.nextLong();
long[] A = in.nextLongArray(0, N-1);
void solve() {
Arrays.sort(A);
long s = A[0];
long e = A[N-1];
long mid = e;
while(true) {
long m = (s + e) / 2;
if(m == mid) {
break;
}
mid = m;
if(check(mid)) {
s = mid;
} else {
e = mid;
}
}
out.println(mid);
}
boolean check(long m) {
int up = 0, down = 0;
for(int i=0; i<N; i++) {
if(A[i] < m) {
up += (m - A[i]) / a + ((m - A[i])%a>0 ? 1 : 0);
} else if(A[i] > m) {
down += (A[i] - m) / b;
}
}
return up <= down;
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
class Ai implements Comparable<Ai>{
int id;
long a;
public Ai(int id, long a) {
super();
this.id = id;
this.a = a;
}
@Override
public int compareTo(Ai o) {
if(a == o.a) {
return id-o.id;
}
return Long.compare(a, o.a);
}
}
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;
boolean newLine;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
this.newLine = true;
}
void print(char ch) {
newLine = false;
buf.append(ch);
}
void print(Object o) {
if(!newLine) {
buf.append(" ");
} else {
newLine = false;
}
buf.append(o);
}
void println(int o) {
buf.append(o);
println();
}
void println(long o) {
buf.append(o);
println();
}
void println(double o) {
buf.append(o);
println();
}
void println(String o) {
buf.append(o);
println();
}
void println(Collection<?> o) {
for(var e : o) {
buf.append(e);
buf.append(" ");
}
if(o.size()>=1) {
buf.deleteCharAt(buf.length()-1);
}
println();
}
void println() {
buf.append(LINE_SEPARATOR);
newLine = true;
}
void flush() {
System.out.print(buf);
}
}
import java.io.*;
import java.util.*;
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
long a = in.nextLong();
long b = in.nextLong();
long[] A = in.nextLongArray(0, N-1);
void solve() {
Arrays.sort(A);
long s = A[0];
long e = A[N-1];
long mid = e;
while(true) {
long m = (s + e) / 2;
if(m == mid) {
break;
}
mid = m;
if(check(mid)) {
s = mid;
} else {
e = mid;
}
}
out.println(mid);
}
boolean check(long m) {
long up = 0, down = 0;
for(int i=0; i<N; i++) {
if(A[i] < m) {
up += (m - A[i]) / a + ((m - A[i])%a>0 ? 1 : 0);
} else if(A[i] > m) {
down += (A[i] - m) / b;
}
}
return up <= down;
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
class Ai implements Comparable<Ai>{
int id;
long a;
public Ai(int id, long a) {
super();
this.id = id;
this.a = a;
}
@Override
public int compareTo(Ai o) {
if(a == o.a) {
return id-o.id;
}
return Long.compare(a, o.a);
}
}
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;
boolean newLine;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
this.newLine = true;
}
void print(char ch) {
newLine = false;
buf.append(ch);
}
void print(Object o) {
if(!newLine) {
buf.append(" ");
} else {
newLine = false;
}
buf.append(o);
}
void println(int o) {
buf.append(o);
println();
}
void println(long o) {
buf.append(o);
println();
}
void println(double o) {
buf.append(o);
println();
}
void println(String o) {
buf.append(o);
println();
}
void println(Collection<?> o) {
for(var e : o) {
buf.append(e);
buf.append(" ");
}
if(o.size()>=1) {
buf.deleteCharAt(buf.length()-1);
}
println();
}
void println() {
buf.append(LINE_SEPARATOR);
newLine = true;
}
void flush() {
System.out.print(buf);
}
}
| ConDefects/ConDefects/Code/arc144_b/Java/41208437 |
condefects-java_data_206 | import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int[] values = new int[n];
for (int i = 0; i < n; i++) {
values[i] = sc.nextInt();
}
int left = 0;
int right = Integer.MAX_VALUE / 2;;
while (right - left > 1) {
int m = (left + right) / 2;
int count = 0;
for (int x : values) {
if (x <= m) {
count += (m - x + a - 1) / a;
} else {
count -= (x - m) / b;
}
}
if (count <= 0) {
left = m;
} else {
right = m;
}
}
System.out.println(left);
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
}
import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner();
int n = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
int[] values = new int[n];
for (int i = 0; i < n; i++) {
values[i] = sc.nextInt();
}
int left = 0;
int right = Integer.MAX_VALUE / 2;;
while (right - left > 1) {
int m = (left + right) / 2;
long count = 0;
for (int x : values) {
if (x <= m) {
count += (m - x + a - 1) / a;
} else {
count -= (x - m) / b;
}
}
if (count <= 0) {
left = m;
} else {
right = m;
}
}
System.out.println(left);
}
}
class Utilities {
static String arrayToLineString(Object[] arr) {
return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
}
static String arrayToLineString(int[] arr) {
return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
}
}
class Scanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer("");
StringBuilder sb = new StringBuilder();
public Scanner() throws Exception {
}
public int nextInt() throws Exception {
return Integer.parseInt(next());
}
public long nextLong() throws Exception {
return Long.parseLong(next());
}
public double nextDouble() throws Exception {
return Double.parseDouble(next());
}
public int[] nextIntArray() throws Exception {
return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
}
public String next() throws Exception {
while (!st.hasMoreTokens()) {
st = new StringTokenizer(br.readLine());
}
return st.nextToken();
}
} | ConDefects/ConDefects/Code/arc144_b/Java/41695431 |
condefects-java_data_207 | import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.util.stream.Collectors.toList;
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);
int n = sc.nextInt();
int _a = sc.nextInt();
int _b = sc.nextInt();
int[] a = new int[n];
int l = inf, r = 0;
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
l = min(l, a[i]);
r = max(r, a[i]);
}
while (r-l > 1) {
int mid = (l+r)/2;
int cntMinus = 0, cntPlus = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= mid) cntPlus += (a[i]-mid)/_b;
else cntMinus += ceilDivide(mid-a[i], _a);
}
if (cntPlus >= cntMinus) l = mid;
else r = mid;
}
pw.println(l);
pw.close();
}
static int ceilDivide(int a, int b) { return a <= 0 ? 0 : (a-1)/b + 1; }
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.util.stream.Collectors.toList;
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);
int n = sc.nextInt();
int _a = sc.nextInt();
int _b = sc.nextInt();
int[] a = new int[n];
int l = inf, r = 0;
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
l = min(l, a[i]);
r = max(r, a[i]);
}
while (r-l > 1) {
int mid = (l+r)/2;
long cntMinus = 0, cntPlus = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= mid) cntPlus += (a[i]-mid)/_b;
else cntMinus += ceilDivide(mid-a[i], _a);
}
if (cntPlus >= cntMinus) l = mid;
else r = mid;
}
pw.println(l);
pw.close();
}
static int ceilDivide(int a, int b) { return a <= 0 ? 0 : (a-1)/b + 1; }
}
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/arc144_b/Java/33274431 |
condefects-java_data_208 | import java.io.PrintWriter;
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 d = Integer.parseInt(sc.next());
if(d*n > n*(n-1)/2){
System.out.println("No");
return;
}
var pw = new PrintWriter(System.out);
pw.println("Yes");
for(int i = 1; i <= d; i++){
for(int a = 0; a < n; a++){
int b = (a+i)%n;
pw.println((a+1) + " " + (b+1));
}
}
pw.flush();
}
}
import java.io.PrintWriter;
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 d = Integer.parseInt(sc.next());
if(d*n > (long)n*(n-1)/2){
System.out.println("No");
return;
}
var pw = new PrintWriter(System.out);
pw.println("Yes");
for(int i = 1; i <= d; i++){
for(int a = 0; a < n; a++){
int b = (a+i)%n;
pw.println((a+1) + " " + (b+1));
}
}
pw.flush();
}
} | ConDefects/ConDefects/Code/arc161_d/Java/41811993 |
condefects-java_data_209 |
import java.io.*;
import java.util.*;
public class Main {
public void solve() throws Exception {
int n=nextInt(),d=nextInt();
if (n==1||n*(n-1)/2<=n*d) {
System.out.println("No");
return;
}
System.out.println("Yes");
for (int dd = 1; dd <= d; dd++) {
for (int i = 1; i < n + 1; i++) {
int j=i+dd;
if (j>n){
j-=n;
}
System.out.println(i+" "+(j));
}
}
}
public static void main(String[] args) throws Exception {
new Main().solve();
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
import java.io.*;
import java.util.*;
public class Main {
public void solve() throws Exception {
int n=nextInt(),d=nextInt();
if (2*d>=n) {
System.out.println("No");
return;
}
System.out.println("Yes");
for (int dd = 1; dd <= d; dd++) {
for (int i = 1; i < n + 1; i++) {
int j=i+dd;
if (j>n){
j-=n;
}
System.out.println(i+" "+(j));
}
}
}
public static void main(String[] args) throws Exception {
new Main().solve();
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
| ConDefects/ConDefects/Code/arc161_d/Java/41816008 |
condefects-java_data_210 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver {
long st = System.currentTimeMillis();
long elapsed() { return System.currentTimeMillis() - st; }
void reset() { st = System.currentTimeMillis(); }
static int infI = (1 << 30) - 1;
static long infL = 1L << 60;
// static long mod = (int) 1e9 +7;
static long mod = 998244353;
static String yes = "Yes";
static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err) {
@Override
void println(Object obj) { super.println(obj == null ? "null" : obj); };
@Override
protected void ln() {
super.ln();
flush();
};
};
int N = in.it();
int D = in.it();
Object solve() {
if (D * N > N * (N - 1) / 2)
return false;
out.println(true);
for (int u = 0; u < N; u++)
for (int d = 1; d <= D; d++)
out.println(u + 1, (u + d) % N + 1);
return null;
}
}
class Edge<L> extends Nd<L> {
Node<L> u, v;
Edge(int id, Node<L> u, Node<L> v, L val) {
super(id, val);
this.u = u;
this.v = v;
}
@Override
public String toString() { return "(" + getClass().getSimpleName() + "," + (u.id + 1) + "," + (v.id + 1) + ")"; }
}
class Node<L> extends Nd<L> {
Node<L> p;
int dpt;
Collection<Edge<L>> go, back;
Node(int id, L val) {
super(id, val);
go = new HashSet<>();
back = new HashSet<>();
}
@Override
public String toString() { return "" + (id + 1); }
}
class Nd<L> {
int id, in, out;
L val;
Nd(int id, L val) {
this.id = id;
this.val = val;
}
@Override
public int hashCode() { return Objects.hash(id); }
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Nd other = (Nd) obj;
return id == other.id;
}
}
class Graph<L> {
private int n;
private int eid;
Edge<L>[] es;
Node<L>[] nds;
Nd<L>[] tour;
private Node<L>[] lca;
@SuppressWarnings("unchecked")
public Graph(int n, int m, boolean dir) {
this.n = n;
nds = new Node[n];
tour = new Nd[2 * n];
for (int i = 0; i < n; i++) {
nds[i] = new Node<>(i, null);
if (!dir)
nds[i].back = nds[i].go;
}
es = new Edge[m];
}
public void addEdge(int u, int v, L l) {
Node<L> nu = nds[u];
Node<L> nv = nds[v];
Edge<L> e = new Edge<>(eid, nu, nv, l);
Edge<L> rev = new Edge<>(eid, nv, nu, l);
nu.go.add(e);
nv.back.add(rev);
es[eid++] = e;
}
public Collection<Edge<L>> go(int u) { return nds[u].go; }
public Collection<Edge<L>> back(int u) { return nds[u].back; }
public void makeTree(int s) {
lca = null;
Stack<Node<L>> stk = new Stack<>();
nds[s].dpt = -1;
nds[s].p = null;
stk.add(nds[s]);
stk.add(nds[s]);
int ei = 0;
while (!stk.isEmpty()) {
Node<L> u = stk.pop();
if (u.dpt < 0) {
tour[u.in = u.out = ei++] = u;
for (Edge<L> e : u.go)
if (e.v != u.p) {
es[e.id] = e;
e.v.dpt = u.dpt - 1;
e.v.p = u;
stk.add(e.v);
stk.add(e.v);
}
u.dpt = ~u.dpt;
} else {
u.out = ei;
tour[ei++] = u.p;
}
}
for (Edge<L> e : es) {
e.in = e.v.in;
e.out = e.v.out;
}
}
public Node<L> lca(int u, int v) { return lca(nds[u], nds[v]); }
public Node<L> lca(Node<L> u, Node<L> v) {
if (lca == null)
makeLca();
int l = u.in;
int r = v.in;
if (l > r) {
l ^= r;
r ^= l;
l ^= r;
}
r++;
int k = max(1, 31 - Integer.numberOfLeadingZeros(r - l - 1));
Node<L> a = lca[k * (2 * n - 1) + l];
Node<L> b = lca[k * (2 * n - 1) + r - (1 << k)];
return a.dpt < b.dpt ? a : b;
}
@SuppressWarnings("unchecked")
private void makeLca() {
int n = tour.length - 1;
int K = max(1, 32 - Integer.numberOfLeadingZeros(n - 1));
lca = new Node[K * n];
for (int i = 0; i < n; i++)
lca[i] = (Node<L>) tour[i];
for (int k = 0; k + 1 < K; k++)
for (int i = 0; i + (2 << k) <= n; i++) {
Node<L> a = lca[k * n + i];
Node<L> b = lca[k * n + i + (1 << k)];
lca[(k + 1) * n + i] = a.dpt < b.dpt ? a : b;
}
}
}
class UnionFind {
int num;
int[] par;
int[] size;
public UnionFind(int n) {
par = new int[n];
Arrays.setAll(par, i -> i);
size = new int[n];
Arrays.fill(size, 1);
num = n;
}
int root(int x) { return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(int u, int v) { return root(u) == root(v); }
boolean unite(int u, int v) {
if ((u = root(u)) == (v = root(v)))
return false;
if (size[u] < size[v]) {
u ^= v;
v ^= u;
u ^= v;
}
par[v] = u;
size[u] += size[v];
num--;
return true;
}
int size(int x) { return size[root(x)]; }
}
abstract class Seg<V, F> {
protected int n;
private V e;
private V[] val;
private F[] lazy;
private int[] rg;
private int[] stk = new int[100];
@SuppressWarnings("unchecked")
Seg(int n, V e, IntFunction<V> sup) {
this.n = n;
this.e = e;
val = (V[]) new Object[n << 1];
lazy = (F[]) new Object[n];
rg = new int[n << 1];
for (int i = n << 1; --i > 0;)
rg[i] = i < n ? rg[i << 1] : 1;
build(sup);
}
void build(IntFunction<V> sup) {
for (int i = 0; i < n; i++) {
val[i] = e;
val[i + n] = sup.apply(i);
}
}
V agg(V v0, V v1) { throw new UnsupportedOperationException("agg"); }
V map(V v, F f) { throw new UnsupportedOperationException("map"); }
F comp(F f0, F f1) { throw new UnsupportedOperationException("comp"); }
F powF(F f, int rg) { throw new UnsupportedOperationException("powF"); }
void merge(int i) { val[i] = agg(eval(i << 1), eval(i << 1 | 1)); }
void up(int l, int r) {
l += n;
r += n;
l /= l & -l;
r /= r & -r;
while (l != r)
if (l > r)
merge(l >>= 1);
else
merge(r >>= 1);
while (1 < l)
merge(l >>= 1);
}
private void comp(int i, F f) {
if (i < n)
lazy[i] = lazy[i] != null ? comp(lazy[i], f) : f;
else
val[i] = map(val[i], f);
}
private V eval(int i) {
if (i < n && lazy[i] != null) {
val[i] = map(val[i], powF(lazy[i], rg[i]));
comp(i << 1, lazy[i]);
comp(i << 1 | 1, lazy[i]);
lazy[i] = null;
}
return val[i];
}
protected void down(int l, int r) {
l += n;
r += n;
l /= l & -l;
r /= r & -r;
int s = 0;
while (0 < r) {
while (l > r) {
stk[++s] = l;
l >>= 1;
}
stk[++s] = r;
if (l == r)
l >>= 1;
r >>= 1;
}
while (0 < s)
eval(stk[s--]);
}
void upd(int i, F f) { upd(i, i + 1, f); }
void upd(int l, int r, F f) {
l += n;
r += n;
do {
if ((l & 1) == 1)
comp(l++, f);
if ((r & 1) == 1)
comp(--r, f);
} while ((l >>= 1) < (r >>= 1));
}
V get(int i) { return eval(i + n); }
V get(int l, int r) {
l += n;
r += n;
V vl = e;
V vr = e;
while (l < r) {
if ((l & 1) == 1)
vl = agg(vl, eval(l++));
if ((r & 1) == 1)
vr = agg(eval(--r), vr);
l >>= 1;
r >>= 1;
}
return agg(vl, vr);
}
}
class DualSegmentTree<V, F> extends Seg<V, F> {
DualSegmentTree(int n, V e) { this(n, e, i -> e); }
DualSegmentTree(int n, V e, IntFunction<V> sup) { super(n, e, sup); }
@Override
F powF(F f, int rg) { return f; }
@Override
protected void upd(int l, int r, F f) {
down(l, r);
super.upd(l, r, f);
}
@Override
V get(int i) {
down(i, i + 1);
return super.get(i);
}
}
class RelaxedNTT {
MyWriter log = new MyWriter(System.err) {
@Override
void println(Object obj) { super.println(obj == null ? "null" : obj); };
@Override
protected void ln() {
super.ln();
flush();
};
};
int n = 0;
long[] f = new long[16];
long[] g = new long[16];
long[] h = new long[16];
long append(long a, long b) {
f = grow(f, n);
g = grow(g, n);
f[n] = a;
g[n] = b;
n++;
int m = n + 1 & -(n + 1);
if (n < m) {
m = m - 1 >> 1;
calc(n >> 1, n, n >> 1, n);
}
int s = 0;
for (int i = 1; i <= m; s += i, i <<= 1) {
calc(n - i, n, s, s + i);
calc(s, s + i, n - i, n);
}
return h[n - 1];
}
private void calc(int l1, int r1, int l2, int r2) {
h = grow(h, r1 + r2 - 1);
long[] conv = NTT.convolution(f, l1, r1, g, l2, r2);
for (int i = 0; i < conv.length; i++)
h[i + l1 + l2] = (h[i + l1 + l2] + conv[i]) % 998_244_353;
}
private long[] grow(long[] arr, int i) { return i < arr.length ? arr : copyOf(arr, i << 1); }
}
class NTT {
static long[] convolution(long[] a, long[] b, int l) { return copyOf(convolution(a, b), l); }
static long[] convolution(long[] a, long[] b) { return convolution(a, 0, a.length, b, 0, b.length); }
static long[] convolution(long[] a, int al, int ar, long[] b, int bl, int br) {
while (al < ar && a[ar - 1] == 0)
ar--;
while (bl < br && b[br - 1] == 0)
br--;
int n = ar - al;
int m = br - bl;
if (n == 0 || m == 0)
return new long[0];
int z = max(1, Integer.highestOneBit(n + m - 2) << 1);
long[] ta = new long[z];
long[] tb = new long[z];
System.arraycopy(a, al, ta, 0, ar - al);
System.arraycopy(b, bl, tb, 0, br - bl);
a = ta;
b = tb;
int g = 3;
long[][] sum = sum(998_244_353, g);
butterfly(a, sum[0]);
butterfly(b, sum[0]);
for (int i = 0; i < z; i++)
a[i] = a[i] * b[i] % 998_244_353;
butterflyInv(a, sum[1]);
long iz = pow(z, 998_244_353 - 2);
for (int i = 0; i < a.length; i++)
a[i] = a[i] * iz % 998_244_353;
return a;
}
private static void butterflyInv(long[] a, long[] sum) {
int n = a.length;
int h = 32 - Integer.numberOfLeadingZeros(n - 1);
for (int ph = h; ph >= 1; ph--) {
int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
long l = a[i + offset];
long r = a[i + offset + p];
a[i + offset] = (l + r) % 998_244_353;
a[i + offset + p] = (998_244_353 + l - r) * now % 998_244_353;
}
int x = Integer.numberOfTrailingZeros(~s);
now = now * sum[x] % 998_244_353;
}
}
}
private static void butterfly(long[] a, long[] sum) {
int n = a.length;
int h = 32 - Integer.numberOfLeadingZeros(n - 1);
long ADD = (998_244_353 - 2L) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
long l = a[i + offset];
long r = a[i + offset + p] * now;
a[i + offset] = (l + r) % 998_244_353;
a[i + offset + p] = (l - r + ADD) % 998_244_353;
}
int x = Integer.numberOfTrailingZeros(~s);
now = now * sum[x] % 998_244_353;
}
}
}
private static long[][] sum(int mod, int g) {
long[][] sum = new long[2][30];
long[] es = new long[30];
long[] ies = new long[30];
int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = pow(g, mod - 1 >> cnt2);
long ie = pow(e, mod - 2);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long se = 1;
long sie = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum[0][i] = es[i] * se % mod;
se = se * ies[i] % mod;
sum[1][i] = ies[i] * sie % mod;
sie = sie * es[i] % mod;
}
return sum;
}
static long pow(long x, long n) {
x %= 998_244_353;
long ret = 1;
do {
if ((n & 1) == 1)
ret = ret * x % 998_244_353;
x = x * x % 998_244_353;
} while (0 < (n >>= 1));
return ret;
}
static long[] sum(long[] a, long[] b) {
long[] ret = new long[max(a.length, b.length)];
for (int i = 0; i < a.length; i++)
ret[i] += a[i];
for (int i = 0; i < b.length; i++)
ret[i] += b[i];
for (int i = 0; i < ret.length; i++)
if (998_244_353 < ret[i])
ret[i] -= 998_244_353;
return ret;
}
}
class Util {
static int[] arrI(int N, IntUnaryOperator f) {
int[] ret = new int[N];
setAll(ret, f);
return ret;
}
static long[] arrL(int N, IntToLongFunction f) {
long[] ret = new long[N];
setAll(ret, f);
return ret;
}
static double[] arrD(int N, IntToDoubleFunction f) {
double[] ret = new double[N];
setAll(ret, f);
return ret;
}
static <T> T[] arr(T[] arr, IntFunction<T> f) {
setAll(arr, f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N) { return Util.arrI(N, i -> it()); }
int[][] it(int H, int W) { return Util.arr(new int[H][], i -> it(W)); }
int idx() { return it() - 1; }
int[] idx(int N) { return Util.arrI(N, i -> idx()); }
int[][] idx(int H, int W) { return Util.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) { return Util.arrL(N, i -> lg()); }
long[][] lg(int H, int W) { return Util.arr(new long[H][], i -> lg(W)); }
double dbl() { return Double.parseDouble(str()); }
double[] dbl(int N) { return Util.arrD(N, i -> dbl()); }
double[][] dbl(int H, int W) { return Util.arr(new double[H][], i -> dbl(W)); }
char[] ch() { return str().toCharArray(); }
char[][] ch(int H) { return Util.arr(new char[H][], i -> ch()); }
String line() {
StringBuilder sb = new StringBuilder();
for (byte c; (c = read()) != '\n';)
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 Util.arr(new String[N], i -> str()); }
}
class MyWriter {
OutputStream out;
byte[] buf = new byte[1 << 16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out) { this.out = out; }
void flush() {
try {
out.write(buf, 0, tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln() { write((byte) '\n'); }
private void write(byte b) {
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b, int off, int len) {
for (int i = off; i < off + len; i++)
write(b[i]);
}
private void write(long n) {
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
}
private void print(Object obj) {
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b : (char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0; i < l; i++) {
print(Array.get(obj, i));
if (i + 1 < l)
write((byte) ' ');
}
} else
for (char b : Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o) {
print(Util.arr(new Object[o.length], i -> o[i]));
ln();
}
void println(Object obj) {
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e : (Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj, 0) instanceof char[])
&& Array.get(obj, 0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0; i < l; i++)
println(Array.get(obj, i));
} else {
print(obj);
ln();
}
}
}
class Main {
public static void main(String[] args) throws Exception {
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
// solver.log.println(solver.elapsed());
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver {
long st = System.currentTimeMillis();
long elapsed() { return System.currentTimeMillis() - st; }
void reset() { st = System.currentTimeMillis(); }
static int infI = (1 << 30) - 1;
static long infL = 1L << 60;
// static long mod = (int) 1e9 +7;
static long mod = 998244353;
static String yes = "Yes";
static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err) {
@Override
void println(Object obj) { super.println(obj == null ? "null" : obj); };
@Override
protected void ln() {
super.ln();
flush();
};
};
int N = in.it();
int D = in.it();
Object solve() {
if (D * N > N * (N - 1L) / 2)
return false;
out.println(true);
for (int u = 0; u < N; u++)
for (int d = 1; d <= D; d++)
out.println(u + 1, (u + d) % N + 1);
return null;
}
}
class Edge<L> extends Nd<L> {
Node<L> u, v;
Edge(int id, Node<L> u, Node<L> v, L val) {
super(id, val);
this.u = u;
this.v = v;
}
@Override
public String toString() { return "(" + getClass().getSimpleName() + "," + (u.id + 1) + "," + (v.id + 1) + ")"; }
}
class Node<L> extends Nd<L> {
Node<L> p;
int dpt;
Collection<Edge<L>> go, back;
Node(int id, L val) {
super(id, val);
go = new HashSet<>();
back = new HashSet<>();
}
@Override
public String toString() { return "" + (id + 1); }
}
class Nd<L> {
int id, in, out;
L val;
Nd(int id, L val) {
this.id = id;
this.val = val;
}
@Override
public int hashCode() { return Objects.hash(id); }
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (getClass() != obj.getClass())
return false;
Nd other = (Nd) obj;
return id == other.id;
}
}
class Graph<L> {
private int n;
private int eid;
Edge<L>[] es;
Node<L>[] nds;
Nd<L>[] tour;
private Node<L>[] lca;
@SuppressWarnings("unchecked")
public Graph(int n, int m, boolean dir) {
this.n = n;
nds = new Node[n];
tour = new Nd[2 * n];
for (int i = 0; i < n; i++) {
nds[i] = new Node<>(i, null);
if (!dir)
nds[i].back = nds[i].go;
}
es = new Edge[m];
}
public void addEdge(int u, int v, L l) {
Node<L> nu = nds[u];
Node<L> nv = nds[v];
Edge<L> e = new Edge<>(eid, nu, nv, l);
Edge<L> rev = new Edge<>(eid, nv, nu, l);
nu.go.add(e);
nv.back.add(rev);
es[eid++] = e;
}
public Collection<Edge<L>> go(int u) { return nds[u].go; }
public Collection<Edge<L>> back(int u) { return nds[u].back; }
public void makeTree(int s) {
lca = null;
Stack<Node<L>> stk = new Stack<>();
nds[s].dpt = -1;
nds[s].p = null;
stk.add(nds[s]);
stk.add(nds[s]);
int ei = 0;
while (!stk.isEmpty()) {
Node<L> u = stk.pop();
if (u.dpt < 0) {
tour[u.in = u.out = ei++] = u;
for (Edge<L> e : u.go)
if (e.v != u.p) {
es[e.id] = e;
e.v.dpt = u.dpt - 1;
e.v.p = u;
stk.add(e.v);
stk.add(e.v);
}
u.dpt = ~u.dpt;
} else {
u.out = ei;
tour[ei++] = u.p;
}
}
for (Edge<L> e : es) {
e.in = e.v.in;
e.out = e.v.out;
}
}
public Node<L> lca(int u, int v) { return lca(nds[u], nds[v]); }
public Node<L> lca(Node<L> u, Node<L> v) {
if (lca == null)
makeLca();
int l = u.in;
int r = v.in;
if (l > r) {
l ^= r;
r ^= l;
l ^= r;
}
r++;
int k = max(1, 31 - Integer.numberOfLeadingZeros(r - l - 1));
Node<L> a = lca[k * (2 * n - 1) + l];
Node<L> b = lca[k * (2 * n - 1) + r - (1 << k)];
return a.dpt < b.dpt ? a : b;
}
@SuppressWarnings("unchecked")
private void makeLca() {
int n = tour.length - 1;
int K = max(1, 32 - Integer.numberOfLeadingZeros(n - 1));
lca = new Node[K * n];
for (int i = 0; i < n; i++)
lca[i] = (Node<L>) tour[i];
for (int k = 0; k + 1 < K; k++)
for (int i = 0; i + (2 << k) <= n; i++) {
Node<L> a = lca[k * n + i];
Node<L> b = lca[k * n + i + (1 << k)];
lca[(k + 1) * n + i] = a.dpt < b.dpt ? a : b;
}
}
}
class UnionFind {
int num;
int[] par;
int[] size;
public UnionFind(int n) {
par = new int[n];
Arrays.setAll(par, i -> i);
size = new int[n];
Arrays.fill(size, 1);
num = n;
}
int root(int x) { return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(int u, int v) { return root(u) == root(v); }
boolean unite(int u, int v) {
if ((u = root(u)) == (v = root(v)))
return false;
if (size[u] < size[v]) {
u ^= v;
v ^= u;
u ^= v;
}
par[v] = u;
size[u] += size[v];
num--;
return true;
}
int size(int x) { return size[root(x)]; }
}
abstract class Seg<V, F> {
protected int n;
private V e;
private V[] val;
private F[] lazy;
private int[] rg;
private int[] stk = new int[100];
@SuppressWarnings("unchecked")
Seg(int n, V e, IntFunction<V> sup) {
this.n = n;
this.e = e;
val = (V[]) new Object[n << 1];
lazy = (F[]) new Object[n];
rg = new int[n << 1];
for (int i = n << 1; --i > 0;)
rg[i] = i < n ? rg[i << 1] : 1;
build(sup);
}
void build(IntFunction<V> sup) {
for (int i = 0; i < n; i++) {
val[i] = e;
val[i + n] = sup.apply(i);
}
}
V agg(V v0, V v1) { throw new UnsupportedOperationException("agg"); }
V map(V v, F f) { throw new UnsupportedOperationException("map"); }
F comp(F f0, F f1) { throw new UnsupportedOperationException("comp"); }
F powF(F f, int rg) { throw new UnsupportedOperationException("powF"); }
void merge(int i) { val[i] = agg(eval(i << 1), eval(i << 1 | 1)); }
void up(int l, int r) {
l += n;
r += n;
l /= l & -l;
r /= r & -r;
while (l != r)
if (l > r)
merge(l >>= 1);
else
merge(r >>= 1);
while (1 < l)
merge(l >>= 1);
}
private void comp(int i, F f) {
if (i < n)
lazy[i] = lazy[i] != null ? comp(lazy[i], f) : f;
else
val[i] = map(val[i], f);
}
private V eval(int i) {
if (i < n && lazy[i] != null) {
val[i] = map(val[i], powF(lazy[i], rg[i]));
comp(i << 1, lazy[i]);
comp(i << 1 | 1, lazy[i]);
lazy[i] = null;
}
return val[i];
}
protected void down(int l, int r) {
l += n;
r += n;
l /= l & -l;
r /= r & -r;
int s = 0;
while (0 < r) {
while (l > r) {
stk[++s] = l;
l >>= 1;
}
stk[++s] = r;
if (l == r)
l >>= 1;
r >>= 1;
}
while (0 < s)
eval(stk[s--]);
}
void upd(int i, F f) { upd(i, i + 1, f); }
void upd(int l, int r, F f) {
l += n;
r += n;
do {
if ((l & 1) == 1)
comp(l++, f);
if ((r & 1) == 1)
comp(--r, f);
} while ((l >>= 1) < (r >>= 1));
}
V get(int i) { return eval(i + n); }
V get(int l, int r) {
l += n;
r += n;
V vl = e;
V vr = e;
while (l < r) {
if ((l & 1) == 1)
vl = agg(vl, eval(l++));
if ((r & 1) == 1)
vr = agg(eval(--r), vr);
l >>= 1;
r >>= 1;
}
return agg(vl, vr);
}
}
class DualSegmentTree<V, F> extends Seg<V, F> {
DualSegmentTree(int n, V e) { this(n, e, i -> e); }
DualSegmentTree(int n, V e, IntFunction<V> sup) { super(n, e, sup); }
@Override
F powF(F f, int rg) { return f; }
@Override
protected void upd(int l, int r, F f) {
down(l, r);
super.upd(l, r, f);
}
@Override
V get(int i) {
down(i, i + 1);
return super.get(i);
}
}
class RelaxedNTT {
MyWriter log = new MyWriter(System.err) {
@Override
void println(Object obj) { super.println(obj == null ? "null" : obj); };
@Override
protected void ln() {
super.ln();
flush();
};
};
int n = 0;
long[] f = new long[16];
long[] g = new long[16];
long[] h = new long[16];
long append(long a, long b) {
f = grow(f, n);
g = grow(g, n);
f[n] = a;
g[n] = b;
n++;
int m = n + 1 & -(n + 1);
if (n < m) {
m = m - 1 >> 1;
calc(n >> 1, n, n >> 1, n);
}
int s = 0;
for (int i = 1; i <= m; s += i, i <<= 1) {
calc(n - i, n, s, s + i);
calc(s, s + i, n - i, n);
}
return h[n - 1];
}
private void calc(int l1, int r1, int l2, int r2) {
h = grow(h, r1 + r2 - 1);
long[] conv = NTT.convolution(f, l1, r1, g, l2, r2);
for (int i = 0; i < conv.length; i++)
h[i + l1 + l2] = (h[i + l1 + l2] + conv[i]) % 998_244_353;
}
private long[] grow(long[] arr, int i) { return i < arr.length ? arr : copyOf(arr, i << 1); }
}
class NTT {
static long[] convolution(long[] a, long[] b, int l) { return copyOf(convolution(a, b), l); }
static long[] convolution(long[] a, long[] b) { return convolution(a, 0, a.length, b, 0, b.length); }
static long[] convolution(long[] a, int al, int ar, long[] b, int bl, int br) {
while (al < ar && a[ar - 1] == 0)
ar--;
while (bl < br && b[br - 1] == 0)
br--;
int n = ar - al;
int m = br - bl;
if (n == 0 || m == 0)
return new long[0];
int z = max(1, Integer.highestOneBit(n + m - 2) << 1);
long[] ta = new long[z];
long[] tb = new long[z];
System.arraycopy(a, al, ta, 0, ar - al);
System.arraycopy(b, bl, tb, 0, br - bl);
a = ta;
b = tb;
int g = 3;
long[][] sum = sum(998_244_353, g);
butterfly(a, sum[0]);
butterfly(b, sum[0]);
for (int i = 0; i < z; i++)
a[i] = a[i] * b[i] % 998_244_353;
butterflyInv(a, sum[1]);
long iz = pow(z, 998_244_353 - 2);
for (int i = 0; i < a.length; i++)
a[i] = a[i] * iz % 998_244_353;
return a;
}
private static void butterflyInv(long[] a, long[] sum) {
int n = a.length;
int h = 32 - Integer.numberOfLeadingZeros(n - 1);
for (int ph = h; ph >= 1; ph--) {
int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
long l = a[i + offset];
long r = a[i + offset + p];
a[i + offset] = (l + r) % 998_244_353;
a[i + offset + p] = (998_244_353 + l - r) * now % 998_244_353;
}
int x = Integer.numberOfTrailingZeros(~s);
now = now * sum[x] % 998_244_353;
}
}
}
private static void butterfly(long[] a, long[] sum) {
int n = a.length;
int h = 32 - Integer.numberOfLeadingZeros(n - 1);
long ADD = (998_244_353 - 2L) * 998_244_353;
for (int ph = 1; ph <= h; ph++) {
int w = 1 << ph - 1, p = 1 << h - ph;
long now = 1;
for (int s = 0; s < w; s++) {
int offset = s << h - ph + 1;
for (int i = 0; i < p; i++) {
long l = a[i + offset];
long r = a[i + offset + p] * now;
a[i + offset] = (l + r) % 998_244_353;
a[i + offset + p] = (l - r + ADD) % 998_244_353;
}
int x = Integer.numberOfTrailingZeros(~s);
now = now * sum[x] % 998_244_353;
}
}
}
private static long[][] sum(int mod, int g) {
long[][] sum = new long[2][30];
long[] es = new long[30];
long[] ies = new long[30];
int cnt2 = Integer.numberOfTrailingZeros(mod - 1);
long e = pow(g, mod - 1 >> cnt2);
long ie = pow(e, mod - 2);
for (int i = cnt2; i >= 2; i--) {
es[i - 2] = e;
ies[i - 2] = ie;
e = e * e % mod;
ie = ie * ie % mod;
}
long se = 1;
long sie = 1;
for (int i = 0; i < cnt2 - 2; i++) {
sum[0][i] = es[i] * se % mod;
se = se * ies[i] % mod;
sum[1][i] = ies[i] * sie % mod;
sie = sie * es[i] % mod;
}
return sum;
}
static long pow(long x, long n) {
x %= 998_244_353;
long ret = 1;
do {
if ((n & 1) == 1)
ret = ret * x % 998_244_353;
x = x * x % 998_244_353;
} while (0 < (n >>= 1));
return ret;
}
static long[] sum(long[] a, long[] b) {
long[] ret = new long[max(a.length, b.length)];
for (int i = 0; i < a.length; i++)
ret[i] += a[i];
for (int i = 0; i < b.length; i++)
ret[i] += b[i];
for (int i = 0; i < ret.length; i++)
if (998_244_353 < ret[i])
ret[i] -= 998_244_353;
return ret;
}
}
class Util {
static int[] arrI(int N, IntUnaryOperator f) {
int[] ret = new int[N];
setAll(ret, f);
return ret;
}
static long[] arrL(int N, IntToLongFunction f) {
long[] ret = new long[N];
setAll(ret, f);
return ret;
}
static double[] arrD(int N, IntToDoubleFunction f) {
double[] ret = new double[N];
setAll(ret, f);
return ret;
}
static <T> T[] arr(T[] arr, IntFunction<T> f) {
setAll(arr, f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N) { return Util.arrI(N, i -> it()); }
int[][] it(int H, int W) { return Util.arr(new int[H][], i -> it(W)); }
int idx() { return it() - 1; }
int[] idx(int N) { return Util.arrI(N, i -> idx()); }
int[][] idx(int H, int W) { return Util.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) { return Util.arrL(N, i -> lg()); }
long[][] lg(int H, int W) { return Util.arr(new long[H][], i -> lg(W)); }
double dbl() { return Double.parseDouble(str()); }
double[] dbl(int N) { return Util.arrD(N, i -> dbl()); }
double[][] dbl(int H, int W) { return Util.arr(new double[H][], i -> dbl(W)); }
char[] ch() { return str().toCharArray(); }
char[][] ch(int H) { return Util.arr(new char[H][], i -> ch()); }
String line() {
StringBuilder sb = new StringBuilder();
for (byte c; (c = read()) != '\n';)
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 Util.arr(new String[N], i -> str()); }
}
class MyWriter {
OutputStream out;
byte[] buf = new byte[1 << 16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out) { this.out = out; }
void flush() {
try {
out.write(buf, 0, tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln() { write((byte) '\n'); }
private void write(byte b) {
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b, int off, int len) {
for (int i = off; i < off + len; i++)
write(b[i]);
}
private void write(long n) {
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
}
private void print(Object obj) {
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b : (char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0; i < l; i++) {
print(Array.get(obj, i));
if (i + 1 < l)
write((byte) ' ');
}
} else
for (char b : Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o) {
print(Util.arr(new Object[o.length], i -> o[i]));
ln();
}
void println(Object obj) {
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e : (Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj, 0) instanceof char[])
&& Array.get(obj, 0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0; i < l; i++)
println(Array.get(obj, i));
} else {
print(obj);
ln();
}
}
}
class Main {
public static void main(String[] args) throws Exception {
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
// solver.log.println(solver.elapsed());
}
}
| ConDefects/ConDefects/Code/arc161_d/Java/45082383 |
condefects-java_data_211 | import java.io.PrintWriter;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt(),d = sc.nextInt();
if(n*d>n*(n-1)/2){
out.println("No");
}else {
out.println("Yes");
int sum = n*d;
int end = 1;
Set<String> set = new HashSet<>();
int cnt =0;
out:while (true){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <=d; j++) {
out.println(i + " " + ((j+i-1)%n+1));
sum--;
if(sum==0){
break out;
}
}
// int a = i, b = ((i+end)%(n)==0?n:(i+end)%(n));
// int max = Math.max(a,b);
// int min = Math.min(a,b);
// if(set.contains(min + " " + max)){
// continue ;
// }
//
// System.out.println(cnt++);
// set.add(min + " " + max);
}
end++;
}
}
out.close();
}
}
import java.io.PrintWriter;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt(),d = sc.nextInt();
if((long) n *d>(long)n*(n-1)/2){
out.println("No");
}else {
out.println("Yes");
int sum = n*d;
int end = 1;
Set<String> set = new HashSet<>();
int cnt =0;
out:while (true){
for (int i = 1; i <= n; i++) {
for (int j = 1; j <=d; j++) {
out.println(i + " " + ((j+i-1)%n+1));
sum--;
if(sum==0){
break out;
}
}
// int a = i, b = ((i+end)%(n)==0?n:(i+end)%(n));
// int max = Math.max(a,b);
// int min = Math.min(a,b);
// if(set.contains(min + " " + max)){
// continue ;
// }
//
// System.out.println(cnt++);
// set.add(min + " " + max);
}
end++;
}
}
out.close();
}
} | ConDefects/ConDefects/Code/arc161_d/Java/41817542 |
condefects-java_data_212 | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] sa = br.readLine().split(" ");
int n = Integer.parseInt(sa[0]);
int d = Integer.parseInt(sa[1]);
br.close();
if (n * d > n * (n - 1) / 2) {
System.out.println("No");
return;
}
PrintWriter pw = new PrintWriter(System.out);
pw.println("Yes");
for (int i = 1; i <= d; i++) {
for (int j = 0; j < n; j++) {
int a = j + 1;
int b = (j + i) % n + 1;
pw.println(a + " " + b);
}
}
pw.flush();
}
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] sa = br.readLine().split(" ");
int n = Integer.parseInt(sa[0]);
int d = Integer.parseInt(sa[1]);
br.close();
if (n * d > (long) n * (n - 1) / 2) {
System.out.println("No");
return;
}
PrintWriter pw = new PrintWriter(System.out);
pw.println("Yes");
for (int i = 1; i <= d; i++) {
for (int j = 0; j < n; j++) {
int a = j + 1;
int b = (j + i) % n + 1;
pw.println(a + " " + b);
}
}
pw.flush();
}
}
| ConDefects/ConDefects/Code/arc161_d/Java/41809079 |
condefects-java_data_213 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static long INF_LONG = (long)1e18;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static long MAX = (long)1e12;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
boolean multiTest = false;
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {
loop++;
solve(o, sc);
}
} else solve(o, sc);
o.close();
} catch (Exception e){
e.printStackTrace();
}
}
static void solve(PrintWriter o, FastScanner sc){
try {
int n = sc.nextInt(), m = sc.nextInt(), res = 0;
List<int[]> edges = new ArrayList<>();
long[][] dist = new long[n][n];
for(int i=0;i<n;i++) Arrays.fill(dist[i], INF_LONG);
for(int i=0;i<m;i++){
int u = sc.nextInt()-1, v = sc.nextInt()-1, t = sc.nextInt();
edges.add(new int[]{u, v, t});
dist[u][v] = t;
dist[v][u] = t;
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
for(int[] edge: edges){
int u = edge[0], v = edge[1], t = edge[2];
boolean used = true;
for(int k=0;k<n;k++){
if(dist[u][k] + dist[k][v] < t){
used = false;
break;
}
}
if(!used) res++;
}
o.println(res);
} catch (Exception e){
e.printStackTrace();
}
}
public static int get_first_bit(long x){
for(int i=63;i>=0;i--){
if((x & 1l << i) > 0){
return i;
}
}
return -1;
}
public static int countOne(long x){
int count = 0;
for(int i=0;i<64;i++){
if((x & 1l << i) > 0){
count++;
}
}
return count;
}
public static int gcd(int a, int b){
return b == 0 ? a : gcd(b, a%b);
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long fac(int n){
long ret = 1;
while(n > 0){
ret = ret * n % mod;
n--;
}
return ret;
}
public static long qpow(int n, int m){
long n_ = n, ret = 1;
while(m > 0){
if((m&1) == 1){
ret = ret * n_ % mod;
}
m >>= 1;
n_ = n_ * n_ % mod;
}
return ret;
}
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());}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){
tokenizer = new StringTokenizer(reader.readLine());
}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException{
return Integer.parseInt(next());
}
public static Long nextLong() throws IOException{
return Long.parseLong(next());
}
public static double nextDouble() throws IOException{
return Double.parseDouble(next());
}
public static String nextLine() throws IOException{
return reader.readLine();
}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static long INF_LONG = (long)1e18;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static long MAX = (long)1e12;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
FastScanner sc = new FastScanner();
boolean multiTest = false;
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {
loop++;
solve(o, sc);
}
} else solve(o, sc);
o.close();
} catch (Exception e){
e.printStackTrace();
}
}
static void solve(PrintWriter o, FastScanner sc){
try {
int n = sc.nextInt(), m = sc.nextInt(), res = 0;
List<int[]> edges = new ArrayList<>();
long[][] dist = new long[n][n];
for(int i=0;i<n;i++) Arrays.fill(dist[i], INF_LONG);
for(int i=0;i<m;i++){
int u = sc.nextInt()-1, v = sc.nextInt()-1, t = sc.nextInt();
edges.add(new int[]{u, v, t});
dist[u][v] = t;
dist[v][u] = t;
}
for(int k=0;k<n;k++){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
}
}
}
for(int[] edge: edges){
int u = edge[0], v = edge[1], t = edge[2];
boolean used = true;
for(int k=0;k<n;k++){
if(dist[u][k] + dist[k][v] <= t){
used = false;
break;
}
}
if(!used) res++;
}
o.println(res);
} catch (Exception e){
e.printStackTrace();
}
}
public static int get_first_bit(long x){
for(int i=63;i>=0;i--){
if((x & 1l << i) > 0){
return i;
}
}
return -1;
}
public static int countOne(long x){
int count = 0;
for(int i=0;i<64;i++){
if((x & 1l << i) > 0){
count++;
}
}
return count;
}
public static int gcd(int a, int b){
return b == 0 ? a : gcd(b, a%b);
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long fac(int n){
long ret = 1;
while(n > 0){
ret = ret * n % mod;
n--;
}
return ret;
}
public static long qpow(int n, int m){
long n_ = n, ret = 1;
while(m > 0){
if((m&1) == 1){
ret = ret * n_ % mod;
}
m >>= 1;
n_ = n_ * n_ % mod;
}
return ret;
}
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());}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){
tokenizer = new StringTokenizer(reader.readLine());
}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException{
return Integer.parseInt(next());
}
public static Long nextLong() throws IOException{
return Long.parseLong(next());
}
public static double nextDouble() throws IOException{
return Double.parseDouble(next());
}
public static String nextLine() throws IOException{
return reader.readLine();
}
}
} | ConDefects/ConDefects/Code/abc243_e/Java/30165356 |
condefects-java_data_214 | import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int A = sc.nextInt();
int B = sc.nextInt();
ArrayList<Integer> people = new ArrayList<>(Arrays.asList(1, 2, 3));
if (A != B) {
people.remove(Integer.valueOf(A));
people.remove(Integer.valueOf(B));
System.out.println(people);
} else if (A == B) {
System.out.println(-1);
}
}
}
}
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int A = sc.nextInt();
int B = sc.nextInt();
ArrayList<Integer> people = new ArrayList<>(Arrays.asList(1, 2, 3));
if (A != B) {
people.remove(Integer.valueOf(A));
people.remove(Integer.valueOf(B));
System.out.println(people.get(0));
} else if (A == B) {
System.out.println(-1);
}
}
}
}
| ConDefects/ConDefects/Code/abc355_a/Java/54255476 |
condefects-java_data_215 | 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);
MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
int N = in.it();
int[] A = in.it(N);
long solve(){
long ans = 0;
long inv2 = pow(2,mod -2);
List<Integer> list = new ArrayList<>();
for (int i = 0;i < N;i++)
list.add(i);
list.sort(Comparator.comparing(t -> A[t]));
BIT bit = new BIT(N,Long::sum,Long::sum,a -> -a);
for (int i = 0;i < N;i++) {
int id = list.get(i);
Long tmp = bit.get(id);
if (tmp != null)
ans += tmp *pow(2,id -1) %mod;
bit.add(id,pow(inv2,id));
}
return ans %mod;
}
static class BIT{
int n;
final BinaryOperator<Long> upd;
final BinaryOperator<Long> opr;
final UnaryOperator<Long> inv;
final Long[] bit;
Long upd(final Long a,final Long b){
if (a == null)
return b;
return upd.apply(a,b);
}
Long opr(final Long a,final Long b){
if (a == null || b == null)
return a != null ? a : b;
return opr.apply(a,b);
}
Long inv(final Long t){ return t == null ? t : inv.apply(t); }
BIT(final int n,final BinaryOperator<Long> upd,
final BinaryOperator<Long> opr,
final UnaryOperator<Long> inv){
this.n = n;
this.upd = upd;
this.opr = opr;
this.inv = inv;
bit = new Long[n +1];
}
void add(int x,final Long v){
for (x++;x <= n;x += x &-x)
bit[x] = opr(bit[x],v);
}
Long get(int x){
Long ret = null;
for (x++;x > 0;x -= x &-x)
ret = opr(ret,bit[x]);
return ret;
}
Long get(final int l,final int r){ return opr(get(r -1),inv(get(l -1))); }
}
long pow(long x,long n){ return 1 < n ? pow(x *x %mod,n /2) *pow(x,n &1) %mod : 0 < n ? x : 1; }
/* Util */
long mod(long n){ return (n %mod +mod) %mod; }
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;
}
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;
}
int[][] toi(char[][] s){
int[][] ret = new int[s.length][];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
int[] toi(char[] s){
int[] ret = new int[s.length];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
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(){
out.println(solve());
out.flush();
log.println(elapsed());
}
/* 入力 */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(InputStream in){ this.in = in; }
byte read(){
if (head == tail)
try {
tail = in.read(buf);
head = 0;
} catch (IOException e) {
e.printStackTrace();
}
return buf[head++];
}
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();
}
}
}
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);
MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
int N = in.it();
int[] A = in.it(N);
long solve(){
long ans = 0;
long inv2 = pow(2,mod -2);
List<Integer> list = new ArrayList<>();
for (int i = 0;i < N;i++)
list.add(i);
list.sort(Comparator.comparing(t -> A[t]));
BIT bit = new BIT(N,Long::sum,(a,b) -> (a +b) %mod,a -> -a);
for (int i = 0;i < N;i++) {
int id = list.get(i);
Long tmp = bit.get(id);
if (tmp != null)
ans += tmp *pow(2,id -1) %mod;
bit.add(id,pow(inv2,id));
}
return ans %mod;
}
static class BIT{
int n;
final BinaryOperator<Long> upd;
final BinaryOperator<Long> opr;
final UnaryOperator<Long> inv;
final Long[] bit;
Long upd(final Long a,final Long b){
if (a == null)
return b;
return upd.apply(a,b);
}
Long opr(final Long a,final Long b){
if (a == null || b == null)
return a != null ? a : b;
return opr.apply(a,b);
}
Long inv(final Long t){ return t == null ? t : inv.apply(t); }
BIT(final int n,final BinaryOperator<Long> upd,
final BinaryOperator<Long> opr,
final UnaryOperator<Long> inv){
this.n = n;
this.upd = upd;
this.opr = opr;
this.inv = inv;
bit = new Long[n +1];
}
void add(int x,final Long v){
for (x++;x <= n;x += x &-x)
bit[x] = opr(bit[x],v);
}
Long get(int x){
Long ret = null;
for (x++;x > 0;x -= x &-x)
ret = opr(ret,bit[x]);
return ret;
}
Long get(final int l,final int r){ return opr(get(r -1),inv(get(l -1))); }
}
long pow(long x,long n){ return 1 < n ? pow(x *x %mod,n /2) *pow(x,n &1) %mod : 0 < n ? x : 1; }
/* Util */
long mod(long n){ return (n %mod +mod) %mod; }
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;
}
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;
}
int[][] toi(char[][] s){
int[][] ret = new int[s.length][];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
int[] toi(char[] s){
int[] ret = new int[s.length];
Arrays.setAll(ret,i -> toi(s[i]));
return ret;
}
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(){
out.println(solve());
out.flush();
log.println(elapsed());
}
/* 入力 */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(InputStream in){ this.in = in; }
byte read(){
if (head == tail)
try {
tail = in.read(buf);
head = 0;
} catch (IOException e) {
e.printStackTrace();
}
return buf[head++];
}
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();
}
}
}
| ConDefects/ConDefects/Code/abc221_e/Java/38084739 |
condefects-java_data_216 | import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main {
public static FastReader cin;
public static PrintWriter out;
public static SegmentTree[] tree;
public static long[] discretizationArr;
public static int MOD = 998244353;
public static long base = qpow(2, MOD - 2);
public static void main(String[] args) throws Exception {
out = new PrintWriter(new BufferedOutputStream(System.out));
cin = new FastReader();
// int ttt = cin.nextInt();
// label:for(int qqq = 0; qqq < ttt; qqq++){
// }
int n = cin.nextInt();
long[] arr = new long[n + 1];
long ans = 0;
for (int i = 1; i <= n; i++) {
arr[i] = cin.nextLong();
}
tree = new SegmentTree[4 * n + 5];
discretization(arr);
build(1, 1, n);
long[] bigger = new long[n + 1];
for (int i = 1; i <= n; i++) {
int rank = getRank(arr[i]);
// out.println("arr[i] = " + arr[i] + " rank = " + rank);
bigger[i] = ask(1,1, rank);
if (i != 1)ans = (ans + qpow(2, i - 1) * ask(1, 1, rank)) % MOD;
add(1, rank, qpow(base, i));
}
// out.println(Arrays.toString(bigger));
out.println(ans);
out.close();
}
private static long qpow(long a, long b) {
long ans = 1;
while (b > 0) {
if ((b & 1) == 1) ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
public static long lcm(long a,long b ){
long ans = a * b / gcd(a,b);
return ans;
}
public static long gcd(long a,long b){
if(b==0)return a;
else return gcd(b,a%b);
}
static class FastReader {
BufferedReader br;
StringTokenizer str;
public FastReader() {
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next() {
while (str == null || !str.hasMoreElements()) {
try {
str = new StringTokenizer(br.readLine());
} catch (IOException lastMonthOfVacation) {
lastMonthOfVacation.printStackTrace();
}
}
return str.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 lastMonthOfVacation) {
lastMonthOfVacation.printStackTrace();
}
return str;
}
}
//nums从0开始,discretizationArr从1开始
public static void discretization(long[] nums) {
int n = nums.length;
discretizationArr = Arrays.copyOf(nums,n);
Arrays.sort(discretizationArr);
}
//看x在离散化中排第几
public static int getRank(long x) {
return Arrays.binarySearch(discretizationArr, x);
}
static class SegmentTree{
long L,R;
long sum;
}
/**
* 建树
* @param p 当前结点对应的数组下标
* @param L 当前覆盖的左区间
* @param R 当前结点的区间
* 调用build(1,1,n)
*/
public static void build(int p,long L,long R){
tree[p] = new SegmentTree();
tree[p].L = L;
tree[p].R = R;
if(L == R) {
return;
}
long mid = (L + R) >> 1;
build(2 * p, L, mid);
build(2 * p + 1, mid + 1, R);
}
/**
* 线段树单点修改
* @param p 当前搜索到结点的下标
* @param index 需要修改的下标
* 调用change(1,需要修改元素的下标,需要修改的值)
*/
public static void add(int p,int index, long val){
if(tree[p].L == tree[p].R){//线段树的叶子结点
tree[p].sum += val;
tree[p].sum %= MOD;
return;
}
int mid = (int)(tree[p].L + tree[p].R >> 1);
if(index <= mid){
add(2 * p,index, val);
}else{
add(2 * p + 1,index,val);
}
tree[p].sum = tree[2 * p].sum + tree[2 * p + 1].sum;
}
/**
*
* @param p 当前结点的下标
* @param L 需要查询的左边界
* @param R 需要查询的右边界
* @return
* 调用方法ask(1,需要查询的左区间，右区间)
*/
public static long ask(int p ,long L ,long R){
//当前结点代表的区间被要查询的区间覆盖直接返回结果
// System.out.println("p = " + p);
if(L <= tree[p].L && tree[p].R <= R){
return tree[p].sum;
}
//查询区间不能覆盖当前结点代表的区间，需要递归子结点查询
long mid = (tree[p].L + tree[p].R) >> 1;
//区间最大值/最小值
long value = 0;//返回结果
if(L <= mid){
value += ask(2 * p, L, R);
}
if(R > mid){
value += ask(2 * p + 1, L, R);
}
return value;
}
}
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main {
public static FastReader cin;
public static PrintWriter out;
public static SegmentTree[] tree;
public static long[] discretizationArr;
public static int MOD = 998244353;
public static long base = qpow(2, MOD - 2);
public static void main(String[] args) throws Exception {
out = new PrintWriter(new BufferedOutputStream(System.out));
cin = new FastReader();
// int ttt = cin.nextInt();
// label:for(int qqq = 0; qqq < ttt; qqq++){
// }
int n = cin.nextInt();
long[] arr = new long[n + 1];
long ans = 0;
for (int i = 1; i <= n; i++) {
arr[i] = cin.nextLong();
}
tree = new SegmentTree[4 * n + 5];
discretization(arr);
build(1, 1, n);
long[] bigger = new long[n + 1];
for (int i = 1; i <= n; i++) {
int rank = getRank(arr[i]);
// out.println("arr[i] = " + arr[i] + " rank = " + rank);
bigger[i] = ask(1,1, rank);
if (i != 1)ans = (ans + (qpow(2, i - 1) % MOD) * (ask(1, 1, rank) % MOD)) % MOD;
add(1, rank, qpow(base, i));
}
// out.println(Arrays.toString(bigger));
out.println(ans);
out.close();
}
private static long qpow(long a, long b) {
long ans = 1;
while (b > 0) {
if ((b & 1) == 1) ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
public static long lcm(long a,long b ){
long ans = a * b / gcd(a,b);
return ans;
}
public static long gcd(long a,long b){
if(b==0)return a;
else return gcd(b,a%b);
}
static class FastReader {
BufferedReader br;
StringTokenizer str;
public FastReader() {
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next() {
while (str == null || !str.hasMoreElements()) {
try {
str = new StringTokenizer(br.readLine());
} catch (IOException lastMonthOfVacation) {
lastMonthOfVacation.printStackTrace();
}
}
return str.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 lastMonthOfVacation) {
lastMonthOfVacation.printStackTrace();
}
return str;
}
}
//nums从0开始,discretizationArr从1开始
public static void discretization(long[] nums) {
int n = nums.length;
discretizationArr = Arrays.copyOf(nums,n);
Arrays.sort(discretizationArr);
}
//看x在离散化中排第几
public static int getRank(long x) {
return Arrays.binarySearch(discretizationArr, x);
}
static class SegmentTree{
long L,R;
long sum;
}
/**
* 建树
* @param p 当前结点对应的数组下标
* @param L 当前覆盖的左区间
* @param R 当前结点的区间
* 调用build(1,1,n)
*/
public static void build(int p,long L,long R){
tree[p] = new SegmentTree();
tree[p].L = L;
tree[p].R = R;
if(L == R) {
return;
}
long mid = (L + R) >> 1;
build(2 * p, L, mid);
build(2 * p + 1, mid + 1, R);
}
/**
* 线段树单点修改
* @param p 当前搜索到结点的下标
* @param index 需要修改的下标
* 调用change(1,需要修改元素的下标,需要修改的值)
*/
public static void add(int p,int index, long val){
if(tree[p].L == tree[p].R){//线段树的叶子结点
tree[p].sum += val;
tree[p].sum %= MOD;
return;
}
int mid = (int)(tree[p].L + tree[p].R >> 1);
if(index <= mid){
add(2 * p,index, val);
}else{
add(2 * p + 1,index,val);
}
tree[p].sum = tree[2 * p].sum + tree[2 * p + 1].sum;
}
/**
*
* @param p 当前结点的下标
* @param L 需要查询的左边界
* @param R 需要查询的右边界
* @return
* 调用方法ask(1,需要查询的左区间，右区间)
*/
public static long ask(int p ,long L ,long R){
//当前结点代表的区间被要查询的区间覆盖直接返回结果
// System.out.println("p = " + p);
if(L <= tree[p].L && tree[p].R <= R){
return tree[p].sum;
}
//查询区间不能覆盖当前结点代表的区间，需要递归子结点查询
long mid = (tree[p].L + tree[p].R) >> 1;
//区间最大值/最小值
long value = 0;//返回结果
if(L <= mid){
value += ask(2 * p, L, R);
}
if(R > mid){
value += ask(2 * p + 1, L, R);
}
return value;
}
}
| ConDefects/ConDefects/Code/abc221_e/Java/37602331 |
condefects-java_data_217 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static final long MOD=998244353;
static final int NTT_MOD1 = 998244353;
static final int NTT_MOD2 = 1053818881;
static final int NTT_MOD3 = 1004535809;
static long MAX = 1000000000000000010l;//10^18
static int index = 2;
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
long[] A = sc.nextLongArray(n);
HashMap<Long, Integer> comp = compress(A, true);
long two_inv = modInv(2);
long[] two = new long[n + 1];
two[0] = 1;
for (int i = 1; i < two.length; i++) {
two[i] = (two[i - 1] * two_inv) % MOD;
}
SegTree<Long> seg = new SegTree<Long>(n, (x, y) -> (x + y) % MOD, 0l);
long ans = 0;
long po = 1l;
for (int i = 0; i < n; i++) {
int m = comp.get(A[i]);
long sum = seg.prod(0, m + 1);
ans = (ans + (sum * po) % MOD) % MOD;
po *= 2l;
seg.set(m, (seg.get(m) + two[i + 1]) % MOD);
}
System.out.println(ans);
}
static 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 >>= 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, 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)
);
}
}
}
static long modPow(long x, long y) {
long z = 1;
while (y > 0) {
if (y % 2 == 0) {
x = (x * x) % MOD;
y /= 2;
} else {
z = (z * x) % MOD;
y--;
}
}
return z;
}//xのy乗mod
static long modInv(long x) {
return modPow(x, MOD - 2);
}//xのmodでの逆元
static HashMap<Long, Integer> compress(long[] A,boolean is_duplication){
HashMap<Long, Integer> hashMap = new HashMap<>();
if (is_duplication) {
TreeSet<Long> treeSet = new TreeSet<>();
int now = 0;
for (int i = 0; i < A.length; i++) {
treeSet.add(A[i]);
}
while (!treeSet.isEmpty()) {
long a = treeSet.pollFirst();
hashMap.put(a, now);
now++;
}
}else {
PriorityQueue<Long> priorityQueue = new PriorityQueue<>();
int now = 0;
for (int i = 0; i < A.length; i++) {
priorityQueue.add(A[i]);
}
while (!priorityQueue.isEmpty()) {
long a = priorityQueue.poll();
hashMap.put(a, now);
now++;
}
}
return hashMap;
}
static class InputReader {
private InputStream in;
private byte[] buffer = new byte[1024];
private int curbuf;
private int lenbuf;
public InputReader(InputStream in) {
this.in = in;
this.curbuf = this.lenbuf = 0;
}
public boolean hasNextByte() {
if (curbuf >= lenbuf) {
curbuf = 0;
try {
lenbuf = in.read(buffer);
} catch (IOException e) {
throw new InputMismatchException();
}
if (lenbuf <= 0)
return false;
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[curbuf++];
else
return -1;
}
private boolean isSpaceChar(int c) {
return !(c >= 33 && c <= 126);
}
private void skip() {
while (hasNextByte() && isSpaceChar(buffer[curbuf]))
curbuf++;
}
public boolean hasNext() {
skip();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (!isSpaceChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
int c = readByte();
while (isSpaceChar(c))
c = readByte();
boolean minus = false;
if (c == '-') {
minus = true;
c = readByte();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res = res * 10 + c - '0';
c = readByte();
} while (!isSpaceChar(c));
return (minus) ? -res : res;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public double[] nextDoubleArray(int n) {
double[] a = new double[n];
for (int i = 0; i < n; i++)
a[i] = nextDouble();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
public char[][] nextCharMap(int n, int m) {
char[][] map = new char[n][m];
for (int i = 0; i < n; i++)
map[i] = next().toCharArray();
return map;
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static final long MOD=998244353;
static final int NTT_MOD1 = 998244353;
static final int NTT_MOD2 = 1053818881;
static final int NTT_MOD3 = 1004535809;
static long MAX = 1000000000000000010l;//10^18
static int index = 2;
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
long[] A = sc.nextLongArray(n);
HashMap<Long, Integer> comp = compress(A, true);
long two_inv = modInv(2);
long[] two = new long[n + 1];
two[0] = 1;
for (int i = 1; i < two.length; i++) {
two[i] = (two[i - 1] * two_inv) % MOD;
}
SegTree<Long> seg = new SegTree<Long>(n, (x, y) -> (x + y) % MOD, 0l);
long ans = 0;
long po = 1l;
for (int i = 0; i < n; i++) {
int m = comp.get(A[i]);
long sum = seg.prod(0, m + 1);
ans = (ans + (sum * po) % MOD) % MOD;
po = (po * 2l) % MOD;
seg.set(m, (seg.get(m) + two[i + 1]) % MOD);
}
System.out.println(ans);
}
static 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 >>= 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, 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)
);
}
}
}
static long modPow(long x, long y) {
long z = 1;
while (y > 0) {
if (y % 2 == 0) {
x = (x * x) % MOD;
y /= 2;
} else {
z = (z * x) % MOD;
y--;
}
}
return z;
}//xのy乗mod
static long modInv(long x) {
return modPow(x, MOD - 2);
}//xのmodでの逆元
static HashMap<Long, Integer> compress(long[] A,boolean is_duplication){
HashMap<Long, Integer> hashMap = new HashMap<>();
if (is_duplication) {
TreeSet<Long> treeSet = new TreeSet<>();
int now = 0;
for (int i = 0; i < A.length; i++) {
treeSet.add(A[i]);
}
while (!treeSet.isEmpty()) {
long a = treeSet.pollFirst();
hashMap.put(a, now);
now++;
}
}else {
PriorityQueue<Long> priorityQueue = new PriorityQueue<>();
int now = 0;
for (int i = 0; i < A.length; i++) {
priorityQueue.add(A[i]);
}
while (!priorityQueue.isEmpty()) {
long a = priorityQueue.poll();
hashMap.put(a, now);
now++;
}
}
return hashMap;
}
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/abc221_e/Java/37078836 |
condefects-java_data_218 | import java.io.*;
import java.util.*;
public class Main {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
new Main().solve();
out.flush();
}
public void solve() {
init(400010);
int n = sc.nextInt();
int k = sc.nextInt();
boolean[] b = new boolean[400010];
for(int i=0; i<n; i++) {
b[sc.nextInt()]=true;
}
long res = 0;
for(int i=0; i<40010 && k>=0; i++) {
if(!b[i]) {
res += conv(k+i-1, i-1);
res %= mod;
k--;
}
}
out.println(res);
}
private static long mod = 998244353;
static long[] fac;
static long[] finv;
static long[] inv;
static void init(int max) {
fac = new long[max];
finv = new long[max];
inv = new long[max];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i=2; i<max; i++) {
fac[i] = fac[i-1] * i % mod;
inv[i] = mod - inv[(int)mod%i] * (mod / i) % mod;
finv[i] = finv[i-1] * inv[i] % mod;
}
}
static long conv(int n, int k) {
if(n<k || n<0 || k<0) return 0;
return fac[n] * (finv[k]*finv[n-k]%mod) % mod;
}
static long perm(int n, int k) {
if(n<k || n<0 || k<0) return 0;
return fac[n] * finv[n-k] % mod;
}
}
import java.io.*;
import java.util.*;
public class Main {
static Scanner sc;
static PrintWriter out;
public static void main(String[] args) {
sc = new Scanner(System.in);
out = new PrintWriter(System.out);
new Main().solve();
out.flush();
}
public void solve() {
init(400010);
int n = sc.nextInt();
int k = sc.nextInt();
boolean[] b = new boolean[400010];
for(int i=0; i<n; i++) {
b[sc.nextInt()]=true;
}
long res = 0;
for(int i=0; i<400010 && k>=0; i++) {
if(!b[i]) {
res += conv(k+i-1, i-1);
res %= mod;
k--;
}
}
out.println(res);
}
private static long mod = 998244353;
static long[] fac;
static long[] finv;
static long[] inv;
static void init(int max) {
fac = new long[max];
finv = new long[max];
inv = new long[max];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for(int i=2; i<max; i++) {
fac[i] = fac[i-1] * i % mod;
inv[i] = mod - inv[(int)mod%i] * (mod / i) % mod;
finv[i] = finv[i-1] * inv[i] % mod;
}
}
static long conv(int n, int k) {
if(n<k || n<0 || k<0) return 0;
return fac[n] * (finv[k]*finv[n-k]%mod) % mod;
}
static long perm(int n, int k) {
if(n<k || n<0 || k<0) return 0;
return fac[n] * finv[n-k] % mod;
}
}
| ConDefects/ConDefects/Code/arc156_b/Java/38974440 |
condefects-java_data_219 | import java.io.*;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
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";
Random rd = ThreadLocalRandom.current();
/* 入出力とか */
static InputStream is;
MyReader in = new MyReader(is);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
boolean println(Object obj){
assert println(obj);
return true;
};
@Override
void ln(){
super.ln();
flush();
};
};
long st = System.currentTimeMillis();
int N = in.it();
int K = in.it();
int[] A = in.it(N);
int M = 200000;
int[] cnt = new int[M +1];
Object solve(){
for (var a:A)
cnt[a]++;
TreeSet<Integer> mex = new TreeSet<>();
for (int i = 0;i <= M;i++)
if (cnt[i] == 0)
mex.add(i);
for (int i = M +1;i < 3 *M +100;i++)
mex.add(i);
if (mex.first() == 0) {
mex.pollFirst();
K--;
cnt[0]++;
}
long ans = 1;
Combin cm = new Combin(3 *M +100);
while (K > 0) {
int m = mex.pollFirst();
ans += cm.nHr(m,K);
K--;
}
return ans;
}
static class Combin{
final long[] fac;
final long[] finv;
long[] inv;
public Combin(final int n){
fac = new long[n];
finv = new long[n];
inv = new long[n];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2;i < n;i++) {
fac[i] = fac[i -1] *i %mod;
inv[i] = mod -inv[(int) (mod %i)] *(mod /i) %mod;
finv[i] = finv[i -1] *inv[i] %mod;
}
}
long nHr(int n,int r){ return r < 0 ? 0 : nCr(n +r -1,r); }
long nCr(final int n,final int r){
if (r < 0 || n -r < 0)
return 0;
return fac[n] *(finv[r] *finv[n -r] %mod) %mod;
}
}
long solve2(){
int N = in.it();
char[] S = in.ch();
log.println(S);
List<Integer> list = new ArrayList<>();
for (int i = 0;i < N;i++) {
char c = S[i];
if (c == '1')
list.add(i);
}
int cnt = list.size();
if (cnt == 0)
return 0;
if (cnt %2 == 1)
return -1;
if (cnt == 2 && list.get(0) +1 == list.get(1))
return 2;
return cnt /2;
}
long pop(long x){
x -= x >>1 &0x5555555555555555L;
x = (x &0x3333333333333333L) +(x >>2 &0x3333333333333333L);
x = x +(x >>4) &0x0f0f0f0f0f0f0f0fL;
x += x >>8;
x += x >>16;
x += x >>32;
return x &0x0000007f;
}
long pow(final long l,final long i){
if (i == 0)
return 1;
if (i == 1)
return l;
return pow(l *l %mod,i /2) *pow(l,i &1) %mod;
}
long mod(final long n){ return (n %mod +mod) %mod; }
static class SegmentTree<V> {
Seg<V, V> seg;
SegmentTree(Seg<V, V> seg){ this.seg = seg; }
void upd(int i,V f){
seg.upd(i,i +1,f);
seg.up(i,i +1);
}
void set(int i,V v){
seg.set(i,i +1,v);
seg.up(i,i +1);
}
V get(int i){ return get(i,i +1); }
V get(int l,int r){ return seg.get(l,r); }
}
static class DualSegmentTree<V, F> {
Seg<V, F> seg;
DualSegmentTree(Seg<V, F> seg){ this.seg = seg; }
void upd(int i,F f){ upd(i,i +1,f); }
void upd(int l,int r,F f){
seg.down(l,r);
seg.upd(l,r,f);
}
void set(int i,V v){ set(i,i +1,v); }
void set(int l,int r,V v){
seg.down(l,r);
seg.set(l,r,v);
}
V get(int i){
seg.down(i,i +1);
return seg.get(i,i +1);
}
}
static class LazySegmentTree<V, F> {
Seg<V, F> seg;
LazySegmentTree(Seg<V, F> seg){ this.seg = seg; }
void upd(int i,F f){ upd(i,i +1,f); }
void upd(int l,int r,F f){
seg.down(l,r);
seg.upd(l,r,f);
seg.up(l,r);
}
void set(int i,V v){ set(i,i +1,v); }
void set(int l,int r,V v){
seg.down(l,r);
seg.set(l,r,v);
seg.up(l,r);
}
V get(int i){ return get(i,i +1); }
V get(int l,int r){
seg.down(l,r);
return seg.get(l,r);
}
}
static abstract class Seg<V, F> {
int n;
V e;
V[] val;
F[] lazy;
V[] over;
int[][] lr;
@SuppressWarnings("unchecked")
Seg(int n,V e){
this.n = n;
this.e = e;
val = (V[]) new Object[n <<1];
lazy = (F[]) new Object[n];
over = (V[]) new Object[n];
lr = new int[n <<1][];
for (int i = n <<1;--i > 0;)
lr[i] = new int[]{i < n ? lr[i <<1][0] : i, i < n ? lr[i <<1 |1][1] : i +1};
}
abstract V agg(V v0,V v1);
abstract V map(V v,F f);
abstract F comp(F f0,F f1);
abstract F powF(F f,int[] lr);
abstract V powV(V v,int[] lr);
void merge(int i){ val[i] = agg(eval(i <<1),eval(i <<1 |1)); }
void uprec(int l,int r){
if (l == r) {
while (0 < (l >>= 1))
merge(l);
return;
}
if (l < r)
merge(r >>= 1);
uprec(r,l);
}
void up(int l,int r){
l += n;
r += n;
uprec(l /(l &-l),r /(r &-r));
}
void over(int i,V v){
if (i < n) {
over[i] = v;
lazy[i] = null;
} else
val[i] = v;
}
void comp(int i,F f){
if (i < n)
lazy[i] = lazy[i] != null ? comp(lazy[i],f) : f;
else
val[i] = map(val[i],f);
}
V eval(int i){
if (i < n && over[i] != null) {
val[i] = powV(over[i],lr[i]);
for (int c = 0;c < 2;c++)
over(i <<1 |c,over[i]);
over[i] = null;
}
if (i < n && lazy[i] != null) {
val[i] = map(val[i],powF(lazy[i],lr[i]));
for (int c = 0;c < 2;c++)
comp(i <<1 |c,lazy[i]);
lazy[i] = null;
}
return val[i] != null ? val[i] : e;
}
void downrec(int l,int r){
if (l > r) {
downrec(r,l);
return;
}
if (1 < r)
downrec(r >>1,l);
eval(r);
if (l < r)
eval(l);
}
void down(int l,int r){
l += n;
r += n;
downrec(l /(l &-l),r /(r &-r));
}
void upd(int l,int r,F f){
l += n;
r += n;
do {
if ((l &1) == 1)
comp(l++,f);
if ((r &1) == 1)
comp(--r,f);
} while ((l >>= 1) < (r >>= 1));
}
void set(int l,int r,V v){
v = v == null ? e : v;
l += n;
r += n;
do {
if ((l &1) == 1)
over(l++,v);
if ((r &1) == 1)
over(--r,v);
} while ((l >>= 1) < (r >>= 1));
}
V get(int l,int r){
l += n;
r += n;
V vl = e;
V vr = e;
do {
if ((l &1) == 1)
vl = agg(vl,val[l++]);
if ((r &1) == 1)
vr = agg(val[--r],vr);
} while ((l >>= 1) < (r >>= 1));
return agg(vl,vr);
}
}
/* 実行 */
public static void main(String[] args) throws Exception{
is = System.in;
assert local();
new Main().exe();
}
static boolean local() throws Exception{
is = new FileInputStream("src/input.txt");
return true;
}
long elapsed(){ return System.currentTimeMillis() -st; }
void exe(){
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;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
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();
}
boolean println(Object obj){
if (obj instanceof Boolean)
println((boolean) obj);
else if (obj instanceof char[])
println((char[]) obj);
else if (obj instanceof int[])
println((int[]) obj);
else if (obj instanceof long[])
println((long[]) obj);
else if (obj instanceof double[])
println((double[]) obj);
else
println(Objects.toString(obj));
return true;
}
}
}
import java.io.*;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
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";
Random rd = ThreadLocalRandom.current();
/* 入出力とか */
static InputStream is;
MyReader in = new MyReader(is);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
boolean println(Object obj){
assert println(obj);
return true;
};
@Override
void ln(){
super.ln();
flush();
};
};
long st = System.currentTimeMillis();
int N = in.it();
int K = in.it();
int[] A = in.it(N);
int M = 200000;
int[] cnt = new int[M +1];
Object solve(){
for (var a:A)
cnt[a]++;
TreeSet<Integer> mex = new TreeSet<>();
for (int i = 0;i <= M;i++)
if (cnt[i] == 0)
mex.add(i);
for (int i = M +1;i < 3 *M +100;i++)
mex.add(i);
if (mex.first() == 0) {
mex.pollFirst();
K--;
cnt[0]++;
}
long ans = 1;
Combin cm = new Combin(3 *M +100);
while (K > 0) {
int m = mex.pollFirst();
ans += cm.nHr(m,K);
K--;
}
return ans %mod;
}
static class Combin{
final long[] fac;
final long[] finv;
long[] inv;
public Combin(final int n){
fac = new long[n];
finv = new long[n];
inv = new long[n];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2;i < n;i++) {
fac[i] = fac[i -1] *i %mod;
inv[i] = mod -inv[(int) (mod %i)] *(mod /i) %mod;
finv[i] = finv[i -1] *inv[i] %mod;
}
}
long nHr(int n,int r){ return r < 0 ? 0 : nCr(n +r -1,r); }
long nCr(final int n,final int r){
if (r < 0 || n -r < 0)
return 0;
return fac[n] *(finv[r] *finv[n -r] %mod) %mod;
}
}
long solve2(){
int N = in.it();
char[] S = in.ch();
log.println(S);
List<Integer> list = new ArrayList<>();
for (int i = 0;i < N;i++) {
char c = S[i];
if (c == '1')
list.add(i);
}
int cnt = list.size();
if (cnt == 0)
return 0;
if (cnt %2 == 1)
return -1;
if (cnt == 2 && list.get(0) +1 == list.get(1))
return 2;
return cnt /2;
}
long pop(long x){
x -= x >>1 &0x5555555555555555L;
x = (x &0x3333333333333333L) +(x >>2 &0x3333333333333333L);
x = x +(x >>4) &0x0f0f0f0f0f0f0f0fL;
x += x >>8;
x += x >>16;
x += x >>32;
return x &0x0000007f;
}
long pow(final long l,final long i){
if (i == 0)
return 1;
if (i == 1)
return l;
return pow(l *l %mod,i /2) *pow(l,i &1) %mod;
}
long mod(final long n){ return (n %mod +mod) %mod; }
static class SegmentTree<V> {
Seg<V, V> seg;
SegmentTree(Seg<V, V> seg){ this.seg = seg; }
void upd(int i,V f){
seg.upd(i,i +1,f);
seg.up(i,i +1);
}
void set(int i,V v){
seg.set(i,i +1,v);
seg.up(i,i +1);
}
V get(int i){ return get(i,i +1); }
V get(int l,int r){ return seg.get(l,r); }
}
static class DualSegmentTree<V, F> {
Seg<V, F> seg;
DualSegmentTree(Seg<V, F> seg){ this.seg = seg; }
void upd(int i,F f){ upd(i,i +1,f); }
void upd(int l,int r,F f){
seg.down(l,r);
seg.upd(l,r,f);
}
void set(int i,V v){ set(i,i +1,v); }
void set(int l,int r,V v){
seg.down(l,r);
seg.set(l,r,v);
}
V get(int i){
seg.down(i,i +1);
return seg.get(i,i +1);
}
}
static class LazySegmentTree<V, F> {
Seg<V, F> seg;
LazySegmentTree(Seg<V, F> seg){ this.seg = seg; }
void upd(int i,F f){ upd(i,i +1,f); }
void upd(int l,int r,F f){
seg.down(l,r);
seg.upd(l,r,f);
seg.up(l,r);
}
void set(int i,V v){ set(i,i +1,v); }
void set(int l,int r,V v){
seg.down(l,r);
seg.set(l,r,v);
seg.up(l,r);
}
V get(int i){ return get(i,i +1); }
V get(int l,int r){
seg.down(l,r);
return seg.get(l,r);
}
}
static abstract class Seg<V, F> {
int n;
V e;
V[] val;
F[] lazy;
V[] over;
int[][] lr;
@SuppressWarnings("unchecked")
Seg(int n,V e){
this.n = n;
this.e = e;
val = (V[]) new Object[n <<1];
lazy = (F[]) new Object[n];
over = (V[]) new Object[n];
lr = new int[n <<1][];
for (int i = n <<1;--i > 0;)
lr[i] = new int[]{i < n ? lr[i <<1][0] : i, i < n ? lr[i <<1 |1][1] : i +1};
}
abstract V agg(V v0,V v1);
abstract V map(V v,F f);
abstract F comp(F f0,F f1);
abstract F powF(F f,int[] lr);
abstract V powV(V v,int[] lr);
void merge(int i){ val[i] = agg(eval(i <<1),eval(i <<1 |1)); }
void uprec(int l,int r){
if (l == r) {
while (0 < (l >>= 1))
merge(l);
return;
}
if (l < r)
merge(r >>= 1);
uprec(r,l);
}
void up(int l,int r){
l += n;
r += n;
uprec(l /(l &-l),r /(r &-r));
}
void over(int i,V v){
if (i < n) {
over[i] = v;
lazy[i] = null;
} else
val[i] = v;
}
void comp(int i,F f){
if (i < n)
lazy[i] = lazy[i] != null ? comp(lazy[i],f) : f;
else
val[i] = map(val[i],f);
}
V eval(int i){
if (i < n && over[i] != null) {
val[i] = powV(over[i],lr[i]);
for (int c = 0;c < 2;c++)
over(i <<1 |c,over[i]);
over[i] = null;
}
if (i < n && lazy[i] != null) {
val[i] = map(val[i],powF(lazy[i],lr[i]));
for (int c = 0;c < 2;c++)
comp(i <<1 |c,lazy[i]);
lazy[i] = null;
}
return val[i] != null ? val[i] : e;
}
void downrec(int l,int r){
if (l > r) {
downrec(r,l);
return;
}
if (1 < r)
downrec(r >>1,l);
eval(r);
if (l < r)
eval(l);
}
void down(int l,int r){
l += n;
r += n;
downrec(l /(l &-l),r /(r &-r));
}
void upd(int l,int r,F f){
l += n;
r += n;
do {
if ((l &1) == 1)
comp(l++,f);
if ((r &1) == 1)
comp(--r,f);
} while ((l >>= 1) < (r >>= 1));
}
void set(int l,int r,V v){
v = v == null ? e : v;
l += n;
r += n;
do {
if ((l &1) == 1)
over(l++,v);
if ((r &1) == 1)
over(--r,v);
} while ((l >>= 1) < (r >>= 1));
}
V get(int l,int r){
l += n;
r += n;
V vl = e;
V vr = e;
do {
if ((l &1) == 1)
vl = agg(vl,val[l++]);
if ((r &1) == 1)
vr = agg(val[--r],vr);
} while ((l >>= 1) < (r >>= 1));
return agg(vl,vr);
}
}
/* 実行 */
public static void main(String[] args) throws Exception{
is = System.in;
assert local();
new Main().exe();
}
static boolean local() throws Exception{
is = new FileInputStream("src/input.txt");
return true;
}
long elapsed(){ return System.currentTimeMillis() -st; }
void exe(){
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;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
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();
}
boolean println(Object obj){
if (obj instanceof Boolean)
println((boolean) obj);
else if (obj instanceof char[])
println((char[]) obj);
else if (obj instanceof int[])
println((int[]) obj);
else if (obj instanceof long[])
println((long[]) obj);
else if (obj instanceof double[])
println((double[]) obj);
else
println(Objects.toString(obj));
return true;
}
}
}
| ConDefects/ConDefects/Code/arc156_b/Java/38977947 |
condefects-java_data_220 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt();
// *) layer 层次
int layer = (int)(Math.log(n)/Math.log(2)) + 1;
int[][] opt = new int[layer][n + 1];
int ptr = 1;
for (int i = 0; i < layer; i++) {
int t = 1 << i;
for (int j = 1; j + t - 1 <= n; j++) {
opt[i][j] = ptr++;
}
}
System.out.println(ptr - 1);
for (int i = 0; i < layer; i++) {
int t = 1 << i;
for (int j = 1; j + t - 1 <= n; j++) {
System.out.println(j + " " + (j + t - 1));
}
}
System.out.flush();
int q = sc.nextInt();
for (int i = 0; i < q; i++) {
int l = sc.nextInt(), r = sc.nextInt();
int d = r - l + 1;
int x = (int)Math.log(d);
System.out.println(opt[x][l] + " " + opt[x][r - (1 << x) + 1]);
System.out.flush();
}
}
static
class AReader {
private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return reader.readLine();
} catch (IOException ex) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String nextLine = innerNextLine();
if (nextLine == null) {
return false;
}
tokenizer = new StringTokenizer(nextLine);
}
return true;
}
public String nextLine() {
tokenizer = new StringTokenizer("");
return innerNextLine();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
// public BigInteger nextBigInt() {
// return new BigInteger(next());
// }
// 若需要nextDouble等方法，请自行调用Double.parseDouble包装
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt();
// *) layer 层次
int layer = (int)(Math.log(n)/Math.log(2)) + 1;
int[][] opt = new int[layer][n + 1];
int ptr = 1;
for (int i = 0; i < layer; i++) {
int t = 1 << i;
for (int j = 1; j + t - 1 <= n; j++) {
opt[i][j] = ptr++;
}
}
System.out.println(ptr - 1);
for (int i = 0; i < layer; i++) {
int t = 1 << i;
for (int j = 1; j + t - 1 <= n; j++) {
System.out.println(j + " " + (j + t - 1));
}
}
System.out.flush();
int q = sc.nextInt();
for (int i = 0; i < q; i++) {
int l = sc.nextInt(), r = sc.nextInt();
int d = r - l + 1;
int x = (int)(Math.log(d) / Math.log(2));
System.out.println(opt[x][l] + " " + opt[x][r - (1 << x) + 1]);
System.out.flush();
}
}
static
class AReader {
private BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return reader.readLine();
} catch (IOException ex) {
return null;
}
}
public boolean hasNext() {
while (!tokenizer.hasMoreTokens()) {
String nextLine = innerNextLine();
if (nextLine == null) {
return false;
}
tokenizer = new StringTokenizer(nextLine);
}
return true;
}
public String nextLine() {
tokenizer = new StringTokenizer("");
return innerNextLine();
}
public String next() {
hasNext();
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
// public BigInteger nextBigInt() {
// return new BigInteger(next());
// }
// 若需要nextDouble等方法，请自行调用Double.parseDouble包装
}
}
| ConDefects/ConDefects/Code/abc282_f/Java/43551496 |
condefects-java_data_221 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
static int N;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
solve(sc);
}
// rangeをいい感じに作ってQueryにいい感じに答える
static void solve(FastScanner sc) {
var ranges = new ArrayList<Range>();
var no = 1;
for (int l = 1; l <= N; l++) {
ranges.add(new Range(no++, l, l));
for (int p = 0; p <= 12; p++) {
int r = l + (int)Math.pow(2, p);
if( r <= N ) {
ranges.add(new Range(no++, l, r));
}
}
}
System.out.println(ranges.size());
System.out.flush();
var b = new StringBuilder();
for (Range range : ranges) {
String row = range.l + " " + range.r + "\n";
b.append(row);
}
System.out.println( b );
System.out.flush();
var byL = new HashMap<Integer, List<Range>>();
var byR = new HashMap<Integer, List<Range>>();
for (Range range : ranges) {
byL.computeIfAbsent(range.l, k -> new ArrayList<>()).add(range);
byR.computeIfAbsent(range.r, k -> new ArrayList<>()).add(range);
}
int Q = sc.nextInt();
for (int q = 0; q < Q; q++) {
int[] query = sc.nextIntArray(2);
int l = query[0];
int r = query[1];
find(l, r, byL, byR);
}
}
static void find(int l, int r, Map<Integer, List<Range>> byL, Map<Integer, List<Range>> byR) {
for (Range r1 : byL.get(l)) {
for (Range r2 : byR.get(r)) {
if( isOk(r1, r2, l, r) ) {
System.out.println(r1.no + " " + r2.no);
System.out.flush();
return;
}
}
}
throw new RuntimeException("oops");
}
static boolean isOk(Range r1, Range r2, int l, int r) {
return Math.min(r1.l, r2.l) == l && Math.max(r1.r, r2.r) == r && r1.noSpace(r2);
}
static class Range {
final int no, l, r;
public Range(int no, int l, int r) {
this.no = no;
this.l = l;
this.r = r;
}
boolean noSpace(Range range) {
if( range.l < l ) {
return range.r >= l;
} else {
return range.l <= r;
}
}
}
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;
public static void main(String[] args) {
var sc = new FastScanner(System.in);
N = sc.nextInt();
solve(sc);
}
// rangeをいい感じに作ってQueryにいい感じに答える
static void solve(FastScanner sc) {
var ranges = new ArrayList<Range>();
var no = 1;
for (int l = 1; l <= N; l++) {
ranges.add(new Range(no++, l, l));
for (int p = 0; p <= 12; p++) {
int r = l + (int)Math.pow(2, p);
if( r <= N ) {
ranges.add(new Range(no++, l, r));
}
}
}
System.out.println(ranges.size());
System.out.flush();
var b = new StringBuilder();
for (Range range : ranges) {
String row = range.l + " " + range.r + "\n";
b.append(row);
}
System.out.print( b );
System.out.flush();
var byL = new HashMap<Integer, List<Range>>();
var byR = new HashMap<Integer, List<Range>>();
for (Range range : ranges) {
byL.computeIfAbsent(range.l, k -> new ArrayList<>()).add(range);
byR.computeIfAbsent(range.r, k -> new ArrayList<>()).add(range);
}
int Q = sc.nextInt();
for (int q = 0; q < Q; q++) {
int[] query = sc.nextIntArray(2);
int l = query[0];
int r = query[1];
find(l, r, byL, byR);
}
}
static void find(int l, int r, Map<Integer, List<Range>> byL, Map<Integer, List<Range>> byR) {
for (Range r1 : byL.get(l)) {
for (Range r2 : byR.get(r)) {
if( isOk(r1, r2, l, r) ) {
System.out.println(r1.no + " " + r2.no);
System.out.flush();
return;
}
}
}
throw new RuntimeException("oops");
}
static boolean isOk(Range r1, Range r2, int l, int r) {
return Math.min(r1.l, r2.l) == l && Math.max(r1.r, r2.r) == r && r1.noSpace(r2);
}
static class Range {
final int no, l, r;
public Range(int no, int l, int r) {
this.no = no;
this.l = l;
this.r = r;
}
boolean noSpace(Range range) {
if( range.l < l ) {
return range.r >= l;
} else {
return range.l <= r;
}
}
}
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/abc282_f/Java/37940303 |
condefects-java_data_222 | import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); // 1からn日目まで
int m = sc.nextInt(); // 今日からm日目に満月
int p = sc.nextInt(); // p日ごとに満月
int watch = 0;
n = n - m;
while(n > 0){
n = n - p;
watch++;
}
System.out.println(watch);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); // 1からn日目まで
int m = sc.nextInt(); // 今日からm日目に満月
int p = sc.nextInt(); // p日ごとに満月
int watch = 0;
n = n - m;
while(n >= 0){
n = n - p;
watch++;
}
System.out.println(watch);
}
} | ConDefects/ConDefects/Code/abc318_a/Java/45462255 |
condefects-java_data_223 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
// Inputs are N, M, P
// N: Max number of days
// M: First day of full Moon
// P: Multiple
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
int p = scanner.nextInt();
int counter = 0;
for (int i = m; i <= n; i += counter * p) {
counter = counter + 1;
}
System.out.println(counter);
scanner.close();
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
// Inputs are N, M, P
// N: Max number of days
// M: First day of full Moon
// P: Multiple
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int m = scanner.nextInt();
int p = scanner.nextInt();
int counter = 0;
for (int i = m; i <= n; i += p) {
counter = counter + 1;
}
System.out.println(counter);
scanner.close();
}
}
| ConDefects/ConDefects/Code/abc318_a/Java/45222150 |
condefects-java_data_224 | import java.util.*;
public class Main
{
public static void fullmoon(int N,int M,int P){
int t;
if(N>M){
t = ((N-M)/P)+1;
}else{
t=0;
}
System.out.println(t);
}
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int P = sc.nextInt();
fullmoon(N,M,P);
}
}
import java.util.*;
public class Main
{
public static void fullmoon(int N,int M,int P){
int t;
if(N>0&&M>0&&P>0&&N>=P){
t = ((N-M)/P)+1;
}else{
t=0;
}
System.out.println(t);
}
public static void main(String[] args) {
Scanner sc= new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int P = sc.nextInt();
fullmoon(N,M,P);
}
}
| ConDefects/ConDefects/Code/abc318_a/Java/45198180 |
condefects-java_data_225 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in); // 標準入力受取内容を書く
int N = sc.nextInt();
int M = sc.nextInt();
int P = sc.nextInt();
int c = 0;
for(int i = 0; i < N; i++){
if(N >= M+P*i){
c += 1;
}else{
System.out.println(c);
break;
}
}
sc.close();
return; //「おわり」の呪文
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in); // 標準入力受取内容を書く
int N = sc.nextInt();
int M = sc.nextInt();
int P = sc.nextInt();
int c = 0;
for(int i = 0; i <= N; i++){
if(N >= M+P*i){
c += 1;
}else{
System.out.println(c);
break;
}
}
sc.close();
return; //「おわり」の呪文
}
}
| ConDefects/ConDefects/Code/abc318_a/Java/45552483 |
condefects-java_data_226 | 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 = "8752654402832944 -6857065241301125\n\n";
static String INPUT = "-2 0\n";
static void solve()
{
long x = nl(), y = nl();
long[] apq = exgcd(x, -y);
if(apq[0] > 2){
out.println(-1);
return;
}
long p = apq[1], q = apq[2];
// p * x + q * y = a
p *= 2/apq[0];
q *= 2/apq[0];
out.println(q + " " + p);
}
public static long[] exgcd(long a, long b)
{
if(a == 0 && b == 0)return null;
if(a == 0L)return new long[]{Math.abs(b), 0, Long.signum(b)};
if(b == 0L)return new long[]{Math.abs(a), Long.signum(a), 0};
int as = Long.signum(a);
int bs = Long.signum(b);
a = Math.abs(a); b = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(b > 0){
long c = a / b;
long d;
d = a; a = b; b = d % b;
d = p; p = q; q = d - c * q;
d = r; r = s; s = d - c * s;
}
return new long[]{a, p * as, r * bs};
}
public static long gcd(long a, long b) {
while (b > 0) {
long c = a;
a = b;
b = c % b;
}
return a;
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static 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 = "8752654402832944 -6857065241301125\n\n";
static String INPUT = "";
static void solve()
{
long x = nl(), y = nl();
long[] apq = exgcd(x, -y);
if(apq[0] > 2){
out.println(-1);
return;
}
long p = apq[1], q = apq[2];
// p * x + q * y = a
p *= 2/apq[0];
q *= 2/apq[0];
out.println(q + " " + p);
}
public static long[] exgcd(long a, long b)
{
if(a == 0 && b == 0)return null;
if(a == 0L)return new long[]{Math.abs(b), 0, Long.signum(b)};
if(b == 0L)return new long[]{Math.abs(a), Long.signum(a), 0};
int as = Long.signum(a);
int bs = Long.signum(b);
a = Math.abs(a); b = Math.abs(b);
long p = 1, q = 0, r = 0, s = 1;
while(b > 0){
long c = a / b;
long d;
d = a; a = b; b = d % b;
d = p; p = q; q = d - c * q;
d = r; r = s; s = d - c * s;
}
return new long[]{a, p * as, r * bs};
}
public static long gcd(long a, long b) {
while (b > 0) {
long c = a;
a = b;
b = c % b;
}
return a;
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
tr(G-S+"ms");
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static 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/abc340_f/Java/50186236 |
condefects-java_data_227 | //package atcoder.abc340;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static InputReader in;
static PrintWriter out;
public static void main(String[] args) {
//initReaderPrinter(true);
initReaderPrinter(false);
//solve(in.nextInt());
solve(1);
}
/*
General tips
1. It is ok to fail, but it is not ok to fail for the same mistakes over and over!
2. Train smarter, not harder!
3. If you find an answer and want to return immediately, don't forget to flush before return!
*/
/*
Read before practice
1. Set a timer based on a problem's difficulty level: 45 minutes at your current target practice level;
2. During a problem solving session, focus! Do not switch problems or even worse switch to do something else;
3. If fail to solve within timer limit, read editorials to get as little help as possible to get yourself unblocked;
4. If after reading the entire editorial and other people's code but still can not solve, move this problem to to-do list
and re-try in the future.
5. Keep a practice log about new thinking approaches, good tricks, bugs; Review regularly;
6. Also try this new approach suggested by um_nik: Solve with no intention to read editorial.
If getting stuck, skip it and solve other similar level problems.
Wait for 1 week then try to solve again. Only read editorial after you solved a problem.
7. Remember to also submit in the original problem link (if using gym) so that the 1 v 1 bot knows which problems I have solved already.
8. Form the habit of writing down an implementable solution idea before coding! You've taken enough hits during contests because you
rushed to coding!
*/
/*
Read before contests and lockout 1 v 1
Mistakes you've made in the past contests:
1. Tried to solve without going through given test examples -> wasting time on solving a different problem than asked;
2. Rushed to coding without getting a comprehensive sketch of your solution -> implementation bugs and WA; Write down your idea step
by step, no need to rush. It is always better to have all the steps considered before hand! Think about all the past contests that
you have failed because slow implementation and implementation bugs! This will be greatly reduced if you take your time to get a
thorough idea steps!
3. Forgot about possible integer overflow;
When stuck:
1. Understand problem statements? Walked through test examples?
2. Take a step back and think about other approaches?
3. Check rank board to see if you can skip to work on a possibly easier problem?
4. If none of the above works, take a guess?
5. Any chance you got WA due to integer overflow, especially if you are dealing with all subarrays. The sum
can get deceptively large! If in doubt, just use long instead of int.
*/
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
//ax + by = 1, given a, b, find x, y;
//ay - bx = 2, -bx + ay = 2; in this case -b is your a, a is your b
long a = in.nextLong(), b = in.nextLong();
long[] v = solveGcdEquation(-b, a);
if(v[2] % 2 != 0) {
out.println(-1);
}
else {
long x = v[0] * 2 / v[2], y = v[1] * 2 / v[2];
out.println(x + " " + y);
}
}
out.close();
}
static long[] solveGcdEquation(long a, long b) {
if(b == 0) {
return new long[]{1, 0, a};
}
long[] res = solveGcdEquation(b, a % b);
return new long[]{res[1], res[0] - (a / b) * res[1], res[2]};
}
static long addWithMod(long x, long y, long mod) {
return (x + y) % mod;
}
static long subtractWithMod(long x, long y, long mod) {
return ((x - y) % mod + mod) % mod;
}
static long multiplyWithMod(long x, long y, long mod) {
x %= mod;
y %= mod;
return x * y % mod;
}
static long modInv(long x, long mod) {
return fastPowMod(x, mod - 2, mod);
}
static long fastPowMod(long x, long n, long mod) {
if (n == 0) return 1;
long half = fastPowMod(x, n / 2, mod);
if (n % 2 == 0) return half * half % mod;
return half * half % mod * x % mod;
}
static void initReaderPrinter(boolean test) {
if (test) {
try {
in = new InputReader(new FileInputStream("input.in"));
out = new PrintWriter(new FileOutputStream("output.out"));
} catch (IOException e) {
e.printStackTrace();
}
} else {
in = new InputReader(System.in);
out = new PrintWriter(System.out);
}
}
static class InputReader {
BufferedReader br;
StringTokenizer st;
InputReader(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream), 32768);
} catch (Exception e) {
e.printStackTrace();
}
}
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());
}
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;
}
Integer[] nextIntArray(int n) {
Integer[] a = new Integer[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
int[] nextIntArrayPrimitive(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
int[] nextIntArrayPrimitiveOneIndexed(int n) {
int[] a = new int[n + 1];
for (int i = 1; i <= n; i++) a[i] = nextInt();
return a;
}
Long[] nextLongArray(int n) {
Long[] a = new Long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
long[] nextLongArrayPrimitive(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
long[] nextLongArrayPrimitiveOneIndexed(int n) {
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) a[i] = nextLong();
return a;
}
String[] nextStringArray(int n) {
String[] g = new String[n];
for (int i = 0; i < n; i++) g[i] = next();
return g;
}
List<Integer>[] readUnWeightedGraphOneIndexed(int n, int m) {
List<Integer>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphOneIndexed(int n, int m) {
List<int[]>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
List<Integer>[] readUnWeightedGraphZeroIndexed(int n, int m) {
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphZeroIndexed(int n, int m) {
List<int[]>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
/*
A more efficient way of building an undirected graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildUndirectedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building an undirected weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildUndirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]][0] = end2[i];
adj[end1[i]][idxForEachNode[end1[i]]][1] = weight[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]][0] = end1[i];
adj[end2[i]][idxForEachNode[end2[i]]][1] = weight[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildDirectedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]] = to[i];
idxForEachNode[from[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildDirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]][0] = to[i];
adj[from[i]][idxForEachNode[from[i]]][1] = weight[i];
idxForEachNode[from[i]]++;
}
return adj;
}
}
}
//package atcoder.abc340;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static InputReader in;
static PrintWriter out;
public static void main(String[] args) {
//initReaderPrinter(true);
initReaderPrinter(false);
//solve(in.nextInt());
solve(1);
}
/*
General tips
1. It is ok to fail, but it is not ok to fail for the same mistakes over and over!
2. Train smarter, not harder!
3. If you find an answer and want to return immediately, don't forget to flush before return!
*/
/*
Read before practice
1. Set a timer based on a problem's difficulty level: 45 minutes at your current target practice level;
2. During a problem solving session, focus! Do not switch problems or even worse switch to do something else;
3. If fail to solve within timer limit, read editorials to get as little help as possible to get yourself unblocked;
4. If after reading the entire editorial and other people's code but still can not solve, move this problem to to-do list
and re-try in the future.
5. Keep a practice log about new thinking approaches, good tricks, bugs; Review regularly;
6. Also try this new approach suggested by um_nik: Solve with no intention to read editorial.
If getting stuck, skip it and solve other similar level problems.
Wait for 1 week then try to solve again. Only read editorial after you solved a problem.
7. Remember to also submit in the original problem link (if using gym) so that the 1 v 1 bot knows which problems I have solved already.
8. Form the habit of writing down an implementable solution idea before coding! You've taken enough hits during contests because you
rushed to coding!
*/
/*
Read before contests and lockout 1 v 1
Mistakes you've made in the past contests:
1. Tried to solve without going through given test examples -> wasting time on solving a different problem than asked;
2. Rushed to coding without getting a comprehensive sketch of your solution -> implementation bugs and WA; Write down your idea step
by step, no need to rush. It is always better to have all the steps considered before hand! Think about all the past contests that
you have failed because slow implementation and implementation bugs! This will be greatly reduced if you take your time to get a
thorough idea steps!
3. Forgot about possible integer overflow;
When stuck:
1. Understand problem statements? Walked through test examples?
2. Take a step back and think about other approaches?
3. Check rank board to see if you can skip to work on a possibly easier problem?
4. If none of the above works, take a guess?
5. Any chance you got WA due to integer overflow, especially if you are dealing with all subarrays. The sum
can get deceptively large! If in doubt, just use long instead of int.
*/
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
//ax + by = 1, given a, b, find x, y;
//ay - bx = 2, -bx + ay = 2; in this case -b is your a, a is your b
long a = in.nextLong(), b = in.nextLong();
long[] v = solveGcdEquation(-b, a);
if(2 % v[2] != 0) {
out.println(-1);
}
else {
long x = v[0] * 2 / v[2], y = v[1] * 2 / v[2];
out.println(x + " " + y);
}
}
out.close();
}
static long[] solveGcdEquation(long a, long b) {
if(b == 0) {
return new long[]{1, 0, a};
}
long[] res = solveGcdEquation(b, a % b);
return new long[]{res[1], res[0] - (a / b) * res[1], res[2]};
}
static long addWithMod(long x, long y, long mod) {
return (x + y) % mod;
}
static long subtractWithMod(long x, long y, long mod) {
return ((x - y) % mod + mod) % mod;
}
static long multiplyWithMod(long x, long y, long mod) {
x %= mod;
y %= mod;
return x * y % mod;
}
static long modInv(long x, long mod) {
return fastPowMod(x, mod - 2, mod);
}
static long fastPowMod(long x, long n, long mod) {
if (n == 0) return 1;
long half = fastPowMod(x, n / 2, mod);
if (n % 2 == 0) return half * half % mod;
return half * half % mod * x % mod;
}
static void initReaderPrinter(boolean test) {
if (test) {
try {
in = new InputReader(new FileInputStream("input.in"));
out = new PrintWriter(new FileOutputStream("output.out"));
} catch (IOException e) {
e.printStackTrace();
}
} else {
in = new InputReader(System.in);
out = new PrintWriter(System.out);
}
}
static class InputReader {
BufferedReader br;
StringTokenizer st;
InputReader(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream), 32768);
} catch (Exception e) {
e.printStackTrace();
}
}
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());
}
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;
}
Integer[] nextIntArray(int n) {
Integer[] a = new Integer[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
int[] nextIntArrayPrimitive(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
int[] nextIntArrayPrimitiveOneIndexed(int n) {
int[] a = new int[n + 1];
for (int i = 1; i <= n; i++) a[i] = nextInt();
return a;
}
Long[] nextLongArray(int n) {
Long[] a = new Long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
long[] nextLongArrayPrimitive(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) a[i] = nextLong();
return a;
}
long[] nextLongArrayPrimitiveOneIndexed(int n) {
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) a[i] = nextLong();
return a;
}
String[] nextStringArray(int n) {
String[] g = new String[n];
for (int i = 0; i < n; i++) g[i] = next();
return g;
}
List<Integer>[] readUnWeightedGraphOneIndexed(int n, int m) {
List<Integer>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphOneIndexed(int n, int m) {
List<int[]>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
List<Integer>[] readUnWeightedGraphZeroIndexed(int n, int m) {
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphZeroIndexed(int n, int m) {
List<int[]>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
/*
A more efficient way of building an undirected graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildUndirectedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building an undirected weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildUndirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]][0] = end2[i];
adj[end1[i]][idxForEachNode[end1[i]]][1] = weight[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]][0] = end1[i];
adj[end2[i]][idxForEachNode[end2[i]]][1] = weight[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildDirectedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]] = to[i];
idxForEachNode[from[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildDirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]][0] = to[i];
adj[from[i]][idxForEachNode[from[i]]][1] = weight[i];
idxForEachNode[from[i]]++;
}
return adj;
}
}
}
| ConDefects/ConDefects/Code/abc340_f/Java/50191727 |
condefects-java_data_228 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
long x = nextLong(), y = nextLong();
long g = gcd(x, -y);
if(Math.abs(g) >= 3) {
o.println(-1);
return;
}
long[] ans = extgcd(x, -y);
ans[0] = ans[0]*2/g;
ans[1] = ans[1]*2/g;
o.println(ans[0] + " " + ans[1]);
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
long x = nextLong(), y = nextLong();
long g = gcd(x, -y);
if(Math.abs(g) >= 3) {
o.println(-1);
return;
}
long[] ans = extgcd(x, -y);
ans[0] = ans[0]*2/g;
ans[1] = ans[1]*2/g;
o.println(ans[1] + " " + ans[0]);
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
} | ConDefects/ConDefects/Code/abc340_f/Java/50439270 |
condefects-java_data_229 | import java.util.Scanner;
public class Main {
private static long[] exgcd(long a, long b) {
if (b == 0) {
return new long[] { 1, 0, a };
}
long[] xy = exgcd(b, a % b);
long x = xy[0], y = xy[1];
xy[0] = y;
xy[1] = a / b * x - y;
return xy;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long a, b;
a = in.nextLong();
b = in.nextLong();
long[] res = exgcd(Math.abs(b), Math.abs(a));
long x = res[0], y = res[1], g = res[2];
if (g > 2)
System.out.println(-1);
else {
if (g == 1) {
x *= 2;
y *= 2;
}
if (Math.abs(x) > 1E17 || Math.abs(y) > 1E17)
System.out.println(-1);
if (b < 0)
x *= -1;
if (a > 0)
y *= -1;
System.out.printf("%d %d", x, y);
}
in.close();
}
}
import java.util.Scanner;
public class Main {
private static long[] exgcd(long a, long b) {
if (b == 0) {
return new long[] { 1, 0, a };
}
long[] xy = exgcd(b, a % b);
long x = xy[0], y = xy[1];
xy[0] = y;
xy[1] = x - a / b * y;
return xy;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long a, b;
a = in.nextLong();
b = in.nextLong();
long[] res = exgcd(Math.abs(b), Math.abs(a));
long x = res[0], y = res[1], g = res[2];
if (g > 2)
System.out.println(-1);
else {
if (g == 1) {
x *= 2;
y *= 2;
}
if (Math.abs(x) > 1E17 || Math.abs(y) > 1E17)
System.out.println(-1);
if (b < 0)
x *= -1;
if (a > 0)
y *= -1;
System.out.printf("%d %d", x, y);
}
in.close();
}
} | ConDefects/ConDefects/Code/abc340_f/Java/51259466 |
condefects-java_data_230 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
long a = input.nextLong();
long b = input.nextLong();
long[] arr = exgcd(a, b);
if (2 % arr[0] != 0) out.println(-1);
else{
out.println(-arr[2] / arr[0] * 2+ " " + arr[1] / arr[0] * 2);
}
out.flush();
out.close();
br.close();
}
public static long[] exgcd(long a, long b){
if (b == 0) return new long[]{a, 1, 0};
long[] arr = exgcd(b, a % b);
long k = a / b;
return new long[]{arr[0], arr[2], arr[1] - k * arr[2]};
}
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static Input input = new Input(System.in);
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static class Input {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Input(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public char[] nextChars(){return next().toCharArray();}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
long a = input.nextLong();
long b = input.nextLong();
long[] arr = exgcd(a, b);
if (2 % arr[0] != 0) out.println(-1);
else{
out.println(-arr[2] * 2 / arr[0] + " " + arr[1] * 2 / arr[0]);
}
out.flush();
out.close();
br.close();
}
public static long[] exgcd(long a, long b){
if (b == 0) return new long[]{a, 1, 0};
long[] arr = exgcd(b, a % b);
long k = a / b;
return new long[]{arr[0], arr[2], arr[1] - k * arr[2]};
}
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static Input input = new Input(System.in);
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static class Input {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Input(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public char[] nextChars(){return next().toCharArray();}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
}
| ConDefects/ConDefects/Code/abc340_f/Java/50666511 |
condefects-java_data_231 | 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 Beginner Contest 340 F問題
* 考察メモ
* |XB-YA|=2
* 絶対値を外すと拡張ユークリッドのままか
* 片方が0の時、判定は簡単なのではい
*/
long X = io.nextLong(), Y = io.nextLong();
if (X == 0) {
if (Math.abs(Y) <= 2) io.println(2 / Y + " 0");
else io.println(-1);
return;
}
if (Y == 0) {
if (Math.abs(X) <= 2) io.println("0 " + 2 / X);
else io.println(-1);
return;
}
long gcd = ACL.MathLib.gcd(Math.abs(X), Math.abs(Y));
if (2 % gcd != 0) io.println(-1);
else {
long[] res = extgcd(X, Y);
res[1] *= 2 / gcd;
res[2] *= 2 / gcd;
io.println(res[2] + " " + res[1]);
}
}
public static final long[] extgcd(long a, long b) {
long x0 = 1, x1 = 0;
long y0 = 0, y1 = 1;
while (b != 0) {
long q = a / b;
long r = a % b;
long x2 = x0 - q * x1;
long y2 = y0 - q * y1;
a = b; b = r;
x0 = x1; x1 = x2;
y0 = y1; y1 = y2;
}
return new long[]{a, x0, y0};
}
/** デバッグ用コードのお供に */
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;
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;
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) {
MAX = n;
int k = 1;
while (k < n) k <<= 1;
N = k;
E = e;
this.op = op;
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) {
MAX = n;
int k = 1;
while (k < n) k <<= 1;
N = k;
Log = Integer.numberOfTrailingZeros(N);
Op = op;
E = e;
Mapping = mapping;
Composition = composition;
Id = id;
Dat = (S[]) new Object[N << 1];
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) { 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 Beginner Contest 340 F問題
* 考察メモ
* |XB-YA|=2
* 絶対値を外すと拡張ユークリッドのままか
* 片方が0の時、判定は簡単なのではい
*/
long X = io.nextLong(), Y = io.nextLong();
if (X == 0) {
if (Math.abs(Y) <= 2) io.println(2 / Y + " 0");
else io.println(-1);
return;
}
if (Y == 0) {
if (Math.abs(X) <= 2) io.println("0 " + 2 / X);
else io.println(-1);
return;
}
long gcd = ACL.MathLib.gcd(Math.abs(X), Math.abs(Y));
if (2 % gcd != 0) io.println(-1);
else {
long[] res = extgcd(X, -Y);
res[1] *= 2 / gcd;
res[2] *= 2 / gcd;
io.println(res[2] + " " + res[1]);
}
}
public static final long[] extgcd(long a, long b) {
long x0 = 1, x1 = 0;
long y0 = 0, y1 = 1;
while (b != 0) {
long q = a / b;
long r = a % b;
long x2 = x0 - q * x1;
long y2 = y0 - q * y1;
a = b; b = r;
x0 = x1; x1 = x2;
y0 = y1; y1 = y2;
}
return new long[]{a, x0, y0};
}
/** デバッグ用コードのお供に */
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;
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;
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) {
MAX = n;
int k = 1;
while (k < n) k <<= 1;
N = k;
E = e;
this.op = op;
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) {
MAX = n;
int k = 1;
while (k < n) k <<= 1;
N = k;
Log = Integer.numberOfTrailingZeros(N);
Op = op;
E = e;
Mapping = mapping;
Composition = composition;
Id = id;
Dat = (S[]) new Object[N << 1];
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) { 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/abc340_f/Java/50165616 |
condefects-java_data_232 |
import java.util.*;
public class Main {
//给你一个二维坐标点 (x,y)
//求一个二维坐标 (a,b),满足 (a,b),(x,y),(0,0) 所围成的三角形的面积为 1
//可以获得公式：|AX * BY| = 2
//可以使用扩欧
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long xx = sc.nextLong(), yy = sc.nextLong();
long d = exgcd(yy, -xx);
// System.out.println(d + " " + x + " " + y);
//输出 2 1 -1 表示 8 和 6 的 gcd 为 2 , (1,-1) 是方程 8 * x + 6 * y = 2 的一组特解
if (Math.abs(d) > 2) {
System.out.println(-1);
return;
}
if (d == 1) {
x *= 2;
y *= 2;
}
System.out.println(x + " " + y);
// System.out.println(triangleSquare(0, 0, x, y, xx, yy));
}
//给定三个点坐标，求三角形面积
static double triangleSquare(long x1, long y1, long x2, long y2, long x3, long y3) {
return Math.abs(x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0;
}
static long x, y;
static long exgcd(long a, long b) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long d = exgcd(b, a % b);
long x1 = x, y1 = y;
x = y1;
y = x1 - (a / b) * y1;
return d;
}
//求 a 和 b 的最大公约数,做法：辗转相除法
static long getGCD(long a, long b) {
if (b == 0) return a;
if (a % b == 0) return b;
return getGCD(b, a % b);
}
}
import java.util.*;
public class Main {
//给你一个二维坐标点 (x,y)
//求一个二维坐标 (a,b),满足 (a,b),(x,y),(0,0) 所围成的三角形的面积为 1
//可以获得公式：|AX * BY| = 2
//可以使用扩欧
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long xx = sc.nextLong(), yy = sc.nextLong();
long d = exgcd(yy, -xx);
// System.out.println(d + " " + x + " " + y);
//输出 2 1 -1 表示 8 和 6 的 gcd 为 2 , (1,-1) 是方程 8 * x + 6 * y = 2 的一组特解
if (Math.abs(d) > 2) {
System.out.println(-1);
return;
}
if (d == 1 || d == -1) {
x *= 2;
y *= 2;
}
System.out.println(x + " " + y);
// System.out.println(triangleSquare(0, 0, x, y, xx, yy));
}
//给定三个点坐标，求三角形面积
static double triangleSquare(long x1, long y1, long x2, long y2, long x3, long y3) {
return Math.abs(x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 2.0;
}
static long x, y;
static long exgcd(long a, long b) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long d = exgcd(b, a % b);
long x1 = x, y1 = y;
x = y1;
y = x1 - (a / b) * y1;
return d;
}
//求 a 和 b 的最大公约数,做法：辗转相除法
static long getGCD(long a, long b) {
if (b == 0) return a;
if (a % b == 0) return b;
return getGCD(b, a % b);
}
}
| ConDefects/ConDefects/Code/abc340_f/Java/50200473 |
condefects-java_data_233 | import java.util.*;
public class Main {
static int k = 0;
static long[] p = new long [20];
static long[] c = new long [20];
static long P = 998244353;
static long[] dp = new long [1 << 21];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long m = sc.nextLong();
long base_m = m;
for (long i = 2; i * i <= m; i++) {
if (m % i == 0) {
p[k] = i;
while(m % i == 0) {
m /= i;
c[k] += 1;
}
k++;
}
}
if (m > 1) {
p[k] = m;
c[k] = 1;
k++;
}
for (int i = 0; i < n; i++) {
var a = sc.nextLong();
if (a == gcd(base_m, a)) {
dp[encode(a)] += 1;
}
}
for (int i = 0; i < k; i++) {
for (int j = 0; j < 1 << k; j++) {
if ((j >> i & 1) == 1) {
dp[j] += dp[j ^ (1 << i)];
}
}
}
long ans = 0;
for (int i = 0; i < 1 << k; i++) {
int count = 0;
for(int j = 0; j < k; j++) {
if ((i >> j & 1) == 1) count += 1;
}
if ((k & 1) == (count & 1)) ans = (ans + qpow(2, dp[i])) % P;
else ans = (ans + P - qpow(2, dp[i])) % P;
}
System.out.println(m == 1 ? (ans + P - 1) % P : ans);
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static int encode(long x) {
int code = 0;
for (int i = 0; i < k; i++) {
int temp = 0;
while (x % p[i] == 0) {
x /= p[i];
temp += 1;
}
if (temp == c[i]) code |= 1 << i;
}
return code;
}
public static long qpow(long a, long n) {
long res = 1;
while (n > 0) {
if ((n & 1) == 1) res = res * a % P;
a = a * a % P;
n >>= 1;
}
return res;
}
}
import java.util.*;
public class Main {
static int k = 0;
static long[] p = new long [20];
static long[] c = new long [20];
static long P = 998244353;
static long[] dp = new long [1 << 21];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long m = sc.nextLong();
long base_m = m;
for (long i = 2; i * i <= m; i++) {
if (m % i == 0) {
p[k] = i;
while(m % i == 0) {
m /= i;
c[k] += 1;
}
k++;
}
}
if (m > 1) {
p[k] = m;
c[k] = 1;
k++;
}
for (int i = 0; i < n; i++) {
var a = sc.nextLong();
if (a == gcd(base_m, a)) {
dp[encode(a)] += 1;
}
}
for (int i = 0; i < k; i++) {
for (int j = 0; j < 1 << k; j++) {
if ((j >> i & 1) == 1) {
dp[j] += dp[j ^ (1 << i)];
}
}
}
long ans = 0;
for (int i = 0; i < 1 << k; i++) {
int count = 0;
for(int j = 0; j < k; j++) {
if ((i >> j & 1) == 1) count += 1;
}
if ((k & 1) == (count & 1)) ans = (ans + qpow(2, dp[i])) % P;
else ans = (ans + P - qpow(2, dp[i])) % P;
}
System.out.println(base_m == 1 ? (ans + P - 1) % P : ans);
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
public static int encode(long x) {
int code = 0;
for (int i = 0; i < k; i++) {
int temp = 0;
while (x % p[i] == 0) {
x /= p[i];
temp += 1;
}
if (temp == c[i]) code |= 1 << i;
}
return code;
}
public static long qpow(long a, long n) {
long res = 1;
while (n > 0) {
if ((n & 1) == 1) res = res * a % P;
a = a * a % P;
n >>= 1;
}
return res;
}
} | ConDefects/ConDefects/Code/abc349_f/Java/52832507 |
condefects-java_data_234 | import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final String s = sc.next();
final int n = s.length();
Map<Character, Long> map = new HashMap<>();
for (char c : s.toCharArray()) {
map.put(c, map.getOrDefault(c, 0L) + 1L);
}
long sum = n * (n - 1) / 2;
long dup = 0;
for (var e : map.entrySet()) {
if (e.getValue() > 1) {
dup += e.getValue() * (e.getValue() - 1) / 2;
}
}
if (dup > 0) {
System.out.println(sum - dup + 1);
} else {
System.out.println(sum);
}
}
}
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
final String s = sc.next();
final long n = s.length();
Map<Character, Long> map = new HashMap<>();
for (char c : s.toCharArray()) {
map.put(c, map.getOrDefault(c, 0L) + 1L);
}
long sum = n * (n - 1) / 2;
long dup = 0;
for (var e : map.entrySet()) {
if (e.getValue() > 1) {
dup += e.getValue() * (e.getValue() - 1) / 2;
}
}
if (dup > 0) {
System.out.println(sum - dup + 1);
} else {
System.out.println(sum);
}
}
} | ConDefects/ConDefects/Code/abc345_c/Java/54896819 |
condefects-java_data_235 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
var sc = new Scanner(System.in);
String word = sc.nextLine();
int[] some = new int[26];
for(int x = 0;x < word.length();x++){
some[word.charAt(x) - 'a']++;
}
long ans = (long)word.length() * (word.length() - 1) / 2;
boolean check = false;
for(int n:some){
if(n>=2){
ans -= n * (n - 1) / 2;
check = true;
}
}
if(check)
ans++;
System.out.println(ans);
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
var sc = new Scanner(System.in);
String word = sc.nextLine();
int[] some = new int[26];
for(int x = 0;x < word.length();x++){
some[word.charAt(x) - 'a']++;
}
long ans = (long)word.length() * (word.length() - 1) / 2;
boolean check = false;
for(int n:some){
if(n>=2){
ans -= (long)n * (n - 1) / 2;
check = true;
}
}
if(check)
ans++;
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc345_c/Java/54987728 |
condefects-java_data_236 | import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String S = scanner.nextLine();
long num=(long)S.length()*(S.length()-1)/2;
HashMap<Character, Integer>A=new HashMap<Character, Integer>();
for(int i=0; i<S.length();i++) {
char s = S.charAt(i);
if(A.containsKey(s)) {
A.put(s, A.get(s)+1);
}else {
A.put(s,1);
}
}
boolean v = false;
//System.out.println(S.length());
//System.out.println(num);
//System.out.println(1000000*(1000000-1)/2);
for(Character i:A.keySet()) {
//System.out.print(i);
//System.out.print(A.get(i));
num-=(A.get(i)*(A.get(i)-1)/2);
if(A.get(i)>1) {
v = true;
}
//System.out.println(num);
}
//System.out.println();
if(v==true) {
num+=1;
}
System.out.println(num);
scanner.close();
}
}
import java.util.HashMap;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String S = scanner.nextLine();
long num=(long)S.length()*(S.length()-1)/2;
HashMap<Character, Integer>A=new HashMap<Character, Integer>();
for(int i=0; i<S.length();i++) {
char s = S.charAt(i);
if(A.containsKey(s)) {
A.put(s, A.get(s)+1);
}else {
A.put(s,1);
}
}
boolean v = false;
//System.out.println(S.length());
//System.out.println(num);
//System.out.println(1000000*(1000000-1)/2);
for(Character i:A.keySet()) {
//System.out.print(i);
//System.out.print(A.get(i));
num-=((long)A.get(i)*(A.get(i)-1)/2);
if(A.get(i)>1) {
v = true;
}
//System.out.println(num);
}
//System.out.println();
if(v==true) {
num+=1;
}
System.out.println(num);
scanner.close();
}
}
| ConDefects/ConDefects/Code/abc345_c/Java/54756514 |
condefects-java_data_237 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
final static int infI = (1 <<30) -1;
final static long infL = 1L <<60;
final static long mod = (int) 1e9 +7;
// final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out){
// @Override
// void println(Object obj){};
};
MyWriter log = new MyWriter(System.err){
@Override
void println(Object obj){ super.println(obj == null ? "null" : obj); };
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
int K = in.it();
int[] P = in.it(N);
Object solve(){
int cnt = 0;
for (int i = 1;i < N;i++) {
if (P[i -1] < P[i])
cnt++;
else
cnt = 0;
if (cnt == K -1)
return P;
}
var a = copyOf(P,N);
var b = copyOf(P,N);
sort(a,N -K,N);
int[] min = copyOf(P,N);
for (int i = N -K +1;i < N;i++)
min[i] = min(min[i -1],P[i]);
int s = N -K;
while (0 < s && P[s -1] < P[s])
s--;
while (s < N -K) {
if (P[N -K -1] < min[s +K])
break;
s++;
}
sort(b,s,s +K);
for (int i = 0;i < N;i++) {
if (a[i] > b[i])
return a;
if (a[i] < b[i])
return b;
}
return a;
}
long gcd(long a,long b){ return b == 0 ? a : gcd(b,a %b); }
long lcm(long a,long b){ return b /gcd(a,b) *a; }
void reverse(Object arr){
if (!arr.getClass().isArray())
throw new UnsupportedOperationException("reverse");
int l = 0;
int r = Array.getLength(arr) -1;
while (l < r) {
Object t = Array.get(arr,l);
Array.set(arr,l,Array.get(arr,r));
Array.set(arr,r,t);
l++;
r--;
}
}
long ceil(long a,long b){ return (a +b -1) /b; }
int bSearchI(int o,int n,Predicate<Integer> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (int c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
long bSearchL(long o,long n,Predicate<Long> judge){
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
// <T> void log(BIT seg){
// long[] a = new long[seg.n];
// for (int i = 0;i < a.length;i++)
// a[i] = seg.get(i);
// log.println(a);
// log.println("");
// }
// double inv(long x){ return 1.0 /x; }
long inv(long x){ return pow(x,mod -2); }
long pow(long x,long n){ return pow(x,n,mod); }
long pow(long x,long n,long mod){
x %= mod;
long ret = 1;
do {
if ((n &1) == 1)
ret = ret *x %mod;
x = x *x %mod;
} while (0 < (n >>= 1));
return ret;
}
}
class Prime{
BitSet primes;
int[] spf;
int[] P;
Prime(){ this(10_000_000,1_000_000); }
Prime(int n,int s){
primes = new BitSet(n +1);
primes.set(2,n +1);
spf = new int[min(s,n) +1];
for (int p = 2;p *p <= n || p < spf.length;p++)
if (primes.get(p))
for (int nn = p;nn <= n;primes.clear(nn += p))
if (nn < spf.length)
spf[nn] = p;
P = primes.stream().toArray();
}
long[][] factorize(long n){
List<long[]> ret = new ArrayList<>();
for (int pi = 0;pi < P.length && n >= spf.length;pi++)
n = extracted(n,ret,P[pi]);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
for (long p = P[P.length -1];p *p <= n && n >= spf.length;p += 2)
n = extracted(n,ret,p);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
if (1 < n)
ret.add(new long[]{n, 1});
return ret.toArray(new long[ret.size()][]);
}
long extracted(long n,List<long[]> ret,long p){
int cnt = 0;
while (n %p == 0) {
cnt++;
n /= p;
}
if (0 < cnt)
ret.add(new long[]{p, cnt});
return n;
}
long[] divisors(long n){
long[][] facts = factorize(n);
int l = 1;
for (var f:facts)
l *= f[1] +1;
long[] ret = new long[l];
int id = 1;
ret[0] = 1;
for (var f:facts) {
int sz = id;
long p = f[0];
for (int i = 0;i < f[1];i++,p *= f[0])
for (int j = 0;j < sz;j++)
ret[id++] = ret[j] *p;
}
return ret;
}
}
class UnionFind{
int num;
int[] dat;
int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
int size(int x){ return -dat[root(x)]; }
int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
class BIT{
int n;
long[] bit;
long agg(long v0,long v1){ return v0 +v1; }
long sub(long v0,long v1){ return v0 -v1; }
BIT(int n){
this.n = n;
bit = new long[n +1];
}
void upd(int x,long v){
for (x++;x <= n;x += x &-x)
bit[x] = agg(bit[x],v);
}
long sum(int x){
long ret = 0;
for (;x > 0;x -= x &-x)
ret = agg(ret,bit[x]);
return ret;
}
long get(int i){ return get(i,i +1); }
long get(int l,int r){ return sub(sum(r),sum(l)); }
}
class Edge<L> extends Nd<L>{
Node<L> u,v;
Edge(int id,Node<L> u,Node<L> v,L val){
super(id,val);
this.u = u;
this.v = v;
}
@Override
public String toString(){ return "(" +getClass().getSimpleName() +"," +(u.id +1) +"," +(v.id +1) +")"; }
}
class Node<L> extends Nd<L>{
Node<L> p;
List<Edge<L>> go,back;
int dpt;
Node(int id,L val){ super(id,val); }
@Override
public String toString(){ return "" +(id +1); }
}
class Nd<L> {
int id,l,r;
L val;
Nd(int id,L val){
this.id = id;
this.val = val;
}
}
class Graph<L> {
public int n;
List<Edge<L>> es;
Node<L>[] nds;
@SuppressWarnings("unchecked")
public Graph(int n,int m,boolean dir){
this.n = n;
nds = new Node[n];
for (int i = 0;i < n;i++) {
nds[i] = new Node<>(i,null);
nds[i].go = new ArrayList<>();
nds[i].back = dir ? new ArrayList<>() : nds[i].go;
}
es = new ArrayList<>(m);
}
public void addEdge(int u,int v,L l){
Edge<L> e = new Edge<>(es.size(),nds[u],nds[v],l);
es.add(e);
e.u.go.add(e);
e.v.back.add(new Edge<>(e.id,e.v,e.u,e.val));
}
}
class HLD<L> extends Graph<L>{
Node<L>[] hPar;
@SuppressWarnings("unchecked")
HLD(int N,int M,boolean dir){
super(N,M,dir);
hPar = new Node[n];
}
List<int[]> path(int ui,int vi,boolean incLca){
var u = nds[ui];
var v = nds[vi];
List<int[]> ret = new ArrayList<>();
while (true) {
if (u.l > v.l) {
var t = u;
u = v;
v = t;
}
var h = hPar[v.l];
if (h.l <= u.l) {
ret.add(new int[]{u.l +(incLca ? 0 : 1), v.l +1, u.id});
return ret;
}
ret.add(new int[]{h.l, v.l +1});
v = h.p;
}
}
Node<L> lca(int ui,int vi){
List<int[]> path = path(ui,vi,false);
return nds[path.get(path.size() -1)[2]];
}
public void makeTree(int s){
Stack<Integer> stk = new Stack<>();
nds[s].p = nds[s];
nds[s].dpt = 0;
stk.add(s);
stk.add(~s);
while (!stk.isEmpty()) {
var ui = stk.pop();
if (ui < 0) {
var u = nds[~ui];
u.r = 1;
for (var e:u.go) {
if (e.v == u.p)
continue;
es.set(e.id,e);
e.v.dpt = u.dpt +1;
e.v.p = u;
stk.add(e.v.id);
stk.add(~e.v.id);
}
} else if (ui != s)
nds[ui].p.r += nds[ui].r;
}
for (var u:nds)
for (int i = 1;i < u.go.size();i++)
if (u.r < u.go.get(0).v.r || u.go.get(0).v.r < u.go.get(i).v.r && u.go.get(i).v.r < u.r)
Collections.swap(u.go,0,i);
int hid = 0;
fill(hPar,null);
stk.add(s);
while (!stk.isEmpty()) {
var u = nds[stk.pop()];
u.r += u.l = hid;
if (hPar[u.l] == null)
hPar[u.l] = u;
hid++;
for (int i = u.go.size();i-- > 0;) {
var e = u.go.get(i);
if (e.v == u.p)
continue;
if (i == 0)
hPar[hid] = hPar[u.l];
stk.add(e.v.id);
}
}
for (var e:es) {
e.l = e.v.l;
e.r = e.v.r;
}
}
}
class Util{
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.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){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
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 Util.arr(new String[N],i -> str()); }
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o){
print(Util.arr(new Object[o.length],i -> o[i]));
ln();
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
final static int infI = (1 <<30) -1;
final static long infL = 1L <<60;
final static long mod = (int) 1e9 +7;
// final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out){
// @Override
// void println(Object obj){};
};
MyWriter log = new MyWriter(System.err){
@Override
void println(Object obj){ super.println(obj == null ? "null" : obj); };
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
int K = in.it();
int[] P = in.it(N);
Object solve(){
int cnt = 0;
for (int i = 1;i < N;i++) {
if (P[i -1] < P[i])
cnt++;
else
cnt = 0;
if (cnt == K -1)
return P;
}
var a = copyOf(P,N);
var b = copyOf(P,N);
sort(a,N -K,N);
int[] min = copyOf(P,N);
for (int i = N -K +1;i < N;i++)
min[i] = min(min[i -1],P[i]);
int s = N -K;
while (0 < s && P[s -1] < P[s])
s--;
while (s < N -K) {
if (P[N -K -1] < min[s +K -1])
break;
s++;
}
sort(b,s,s +K);
for (int i = 0;i < N;i++) {
if (a[i] > b[i])
return a;
if (a[i] < b[i])
return b;
}
return a;
}
long gcd(long a,long b){ return b == 0 ? a : gcd(b,a %b); }
long lcm(long a,long b){ return b /gcd(a,b) *a; }
void reverse(Object arr){
if (!arr.getClass().isArray())
throw new UnsupportedOperationException("reverse");
int l = 0;
int r = Array.getLength(arr) -1;
while (l < r) {
Object t = Array.get(arr,l);
Array.set(arr,l,Array.get(arr,r));
Array.set(arr,r,t);
l++;
r--;
}
}
long ceil(long a,long b){ return (a +b -1) /b; }
int bSearchI(int o,int n,Predicate<Integer> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (int c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
long bSearchL(long o,long n,Predicate<Long> judge){
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
// <T> void log(BIT seg){
// long[] a = new long[seg.n];
// for (int i = 0;i < a.length;i++)
// a[i] = seg.get(i);
// log.println(a);
// log.println("");
// }
// double inv(long x){ return 1.0 /x; }
long inv(long x){ return pow(x,mod -2); }
long pow(long x,long n){ return pow(x,n,mod); }
long pow(long x,long n,long mod){
x %= mod;
long ret = 1;
do {
if ((n &1) == 1)
ret = ret *x %mod;
x = x *x %mod;
} while (0 < (n >>= 1));
return ret;
}
}
class Prime{
BitSet primes;
int[] spf;
int[] P;
Prime(){ this(10_000_000,1_000_000); }
Prime(int n,int s){
primes = new BitSet(n +1);
primes.set(2,n +1);
spf = new int[min(s,n) +1];
for (int p = 2;p *p <= n || p < spf.length;p++)
if (primes.get(p))
for (int nn = p;nn <= n;primes.clear(nn += p))
if (nn < spf.length)
spf[nn] = p;
P = primes.stream().toArray();
}
long[][] factorize(long n){
List<long[]> ret = new ArrayList<>();
for (int pi = 0;pi < P.length && n >= spf.length;pi++)
n = extracted(n,ret,P[pi]);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
for (long p = P[P.length -1];p *p <= n && n >= spf.length;p += 2)
n = extracted(n,ret,p);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
if (1 < n)
ret.add(new long[]{n, 1});
return ret.toArray(new long[ret.size()][]);
}
long extracted(long n,List<long[]> ret,long p){
int cnt = 0;
while (n %p == 0) {
cnt++;
n /= p;
}
if (0 < cnt)
ret.add(new long[]{p, cnt});
return n;
}
long[] divisors(long n){
long[][] facts = factorize(n);
int l = 1;
for (var f:facts)
l *= f[1] +1;
long[] ret = new long[l];
int id = 1;
ret[0] = 1;
for (var f:facts) {
int sz = id;
long p = f[0];
for (int i = 0;i < f[1];i++,p *= f[0])
for (int j = 0;j < sz;j++)
ret[id++] = ret[j] *p;
}
return ret;
}
}
class UnionFind{
int num;
int[] dat;
int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
int size(int x){ return -dat[root(x)]; }
int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
class BIT{
int n;
long[] bit;
long agg(long v0,long v1){ return v0 +v1; }
long sub(long v0,long v1){ return v0 -v1; }
BIT(int n){
this.n = n;
bit = new long[n +1];
}
void upd(int x,long v){
for (x++;x <= n;x += x &-x)
bit[x] = agg(bit[x],v);
}
long sum(int x){
long ret = 0;
for (;x > 0;x -= x &-x)
ret = agg(ret,bit[x]);
return ret;
}
long get(int i){ return get(i,i +1); }
long get(int l,int r){ return sub(sum(r),sum(l)); }
}
class Edge<L> extends Nd<L>{
Node<L> u,v;
Edge(int id,Node<L> u,Node<L> v,L val){
super(id,val);
this.u = u;
this.v = v;
}
@Override
public String toString(){ return "(" +getClass().getSimpleName() +"," +(u.id +1) +"," +(v.id +1) +")"; }
}
class Node<L> extends Nd<L>{
Node<L> p;
List<Edge<L>> go,back;
int dpt;
Node(int id,L val){ super(id,val); }
@Override
public String toString(){ return "" +(id +1); }
}
class Nd<L> {
int id,l,r;
L val;
Nd(int id,L val){
this.id = id;
this.val = val;
}
}
class Graph<L> {
public int n;
List<Edge<L>> es;
Node<L>[] nds;
@SuppressWarnings("unchecked")
public Graph(int n,int m,boolean dir){
this.n = n;
nds = new Node[n];
for (int i = 0;i < n;i++) {
nds[i] = new Node<>(i,null);
nds[i].go = new ArrayList<>();
nds[i].back = dir ? new ArrayList<>() : nds[i].go;
}
es = new ArrayList<>(m);
}
public void addEdge(int u,int v,L l){
Edge<L> e = new Edge<>(es.size(),nds[u],nds[v],l);
es.add(e);
e.u.go.add(e);
e.v.back.add(new Edge<>(e.id,e.v,e.u,e.val));
}
}
class HLD<L> extends Graph<L>{
Node<L>[] hPar;
@SuppressWarnings("unchecked")
HLD(int N,int M,boolean dir){
super(N,M,dir);
hPar = new Node[n];
}
List<int[]> path(int ui,int vi,boolean incLca){
var u = nds[ui];
var v = nds[vi];
List<int[]> ret = new ArrayList<>();
while (true) {
if (u.l > v.l) {
var t = u;
u = v;
v = t;
}
var h = hPar[v.l];
if (h.l <= u.l) {
ret.add(new int[]{u.l +(incLca ? 0 : 1), v.l +1, u.id});
return ret;
}
ret.add(new int[]{h.l, v.l +1});
v = h.p;
}
}
Node<L> lca(int ui,int vi){
List<int[]> path = path(ui,vi,false);
return nds[path.get(path.size() -1)[2]];
}
public void makeTree(int s){
Stack<Integer> stk = new Stack<>();
nds[s].p = nds[s];
nds[s].dpt = 0;
stk.add(s);
stk.add(~s);
while (!stk.isEmpty()) {
var ui = stk.pop();
if (ui < 0) {
var u = nds[~ui];
u.r = 1;
for (var e:u.go) {
if (e.v == u.p)
continue;
es.set(e.id,e);
e.v.dpt = u.dpt +1;
e.v.p = u;
stk.add(e.v.id);
stk.add(~e.v.id);
}
} else if (ui != s)
nds[ui].p.r += nds[ui].r;
}
for (var u:nds)
for (int i = 1;i < u.go.size();i++)
if (u.r < u.go.get(0).v.r || u.go.get(0).v.r < u.go.get(i).v.r && u.go.get(i).v.r < u.r)
Collections.swap(u.go,0,i);
int hid = 0;
fill(hPar,null);
stk.add(s);
while (!stk.isEmpty()) {
var u = nds[stk.pop()];
u.r += u.l = hid;
if (hPar[u.l] == null)
hPar[u.l] = u;
hid++;
for (int i = u.go.size();i-- > 0;) {
var e = u.go.get(i);
if (e.v == u.p)
continue;
if (i == 0)
hPar[hid] = hPar[u.l];
stk.add(e.v.id);
}
}
for (var e:es) {
e.l = e.v.l;
e.r = e.v.r;
}
}
}
class Util{
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.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){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
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 Util.arr(new String[N],i -> str()); }
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o){
print(Util.arr(new Object[o.length],i -> o[i]));
ln();
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
}
}
| ConDefects/ConDefects/Code/arc165_b/Java/45693189 |
condefects-java_data_238 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
final static int infI = (1 <<30) -1;
final static long infL = 1L <<60;
final static long mod = (int) 1e9 +7;
// final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out){
// @Override
// void println(Object obj){};
};
MyWriter log = new MyWriter(System.err){
@Override
void println(Object obj){ super.println(obj == null ? "null" : obj); };
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
int K = in.it();
int[] P = in.it(N);
Object solve(){
int cnt = 0;
for (int i = 1;i < N;i++) {
if (P[i -1] < P[i])
cnt++;
else
cnt = 0;
if (cnt == K)
return P;
}
int s = N -K;
while (0 < s && P[s -1] < P[s])
s--;
sort(P,s,s +K);
return P;
}
long gcd(long a,long b){ return b == 0 ? a : gcd(b,a %b); }
long lcm(long a,long b){ return b /gcd(a,b) *a; }
int[] divisors(int n){
Deque<Integer> q = new ArrayDeque<>();
for (int p = (int) Math.sqrt(n);p > 0;p--)
if (n %p == 0) {
q.addFirst(p);
if (p *p != n)
q.addLast(n /p);
}
return q.stream().mapToInt(i -> i).toArray();
}
void reverse(Object arr){
if (!arr.getClass().isArray())
throw new UnsupportedOperationException("reverse");
int l = 0;
int r = Array.getLength(arr) -1;
while (l < r) {
Object t = Array.get(arr,l);
Array.set(arr,l,Array.get(arr,r));
Array.set(arr,r,t);
l++;
r--;
}
}
long ceil(long a,long b){ return (a +b -1) /b; }
int bSearchI(int o,int n,Predicate<Integer> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (int c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
long bSearchL(long o,long n,Predicate<Long> judge){
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
// <T> void log(BIT seg){
// long[] a = new long[seg.n];
// for (int i = 0;i < a.length;i++)
// a[i] = seg.get(i);
// log.println(a);
// log.println("");
// }
// double inv(long x){ return 1.0 /x; }
long inv(long x){ return pow(x,mod -2); }
long pow(long x,long n){ return pow(x,n,mod); }
long pow(long x,long n,long mod){
x %= mod;
long ret = 1;
do {
if ((n &1) == 1)
ret = ret *x %mod;
x = x *x %mod;
} while (0 < (n >>= 1));
return ret;
}
}
class Prime{
BitSet primes;
int[] spf;
int[] P;
Prime(){ this(10_000_000,1_000_000); }
Prime(int n,int s){
primes = new BitSet(n +1);
primes.set(2,n +1);
spf = new int[min(s,n) +1];
for (int p = 2;p *p <= n || p < spf.length;p++)
if (primes.get(p))
for (int nn = p;nn <= n;primes.clear(nn += p))
if (nn < spf.length)
spf[nn] = p;
P = primes.stream().toArray();
}
long[][] factorize(long n){
List<long[]> ret = new ArrayList<>();
for (int pi = 0;pi < P.length && n >= spf.length;pi++)
n = extracted(n,ret,P[pi]);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
for (long p = P[P.length -1];p *p <= n && n >= spf.length;p += 2)
n = extracted(n,ret,p);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
if (1 < n)
ret.add(new long[]{n, 1});
return ret.toArray(new long[ret.size()][]);
}
long extracted(long n,List<long[]> ret,long p){
int cnt = 0;
while (n %p == 0) {
cnt++;
n /= p;
}
if (0 < cnt)
ret.add(new long[]{p, cnt});
return n;
}
long[] divisors(long n){
long[][] facts = factorize(n);
int l = 1;
for (var f:facts)
l *= f[1] +1;
long[] ret = new long[l];
int id = 1;
ret[0] = 1;
for (var f:facts) {
int sz = id;
long p = f[0];
for (int i = 0;i < f[1];i++,p *= f[0])
for (int j = 0;j < sz;j++)
ret[id++] = ret[j] *p;
}
return ret;
}
}
class UnionFind{
int num;
int[] dat;
int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
int size(int x){ return -dat[root(x)]; }
int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
class BIT{
int n;
long[] bit;
long agg(long v0,long v1){ return v0 +v1; }
long sub(long v0,long v1){ return v0 -v1; }
BIT(int n){
this.n = n;
bit = new long[n +1];
}
void upd(int x,long v){
for (x++;x <= n;x += x &-x)
bit[x] = agg(bit[x],v);
}
long sum(int x){
long ret = 0;
for (;x > 0;x -= x &-x)
ret = agg(ret,bit[x]);
return ret;
}
long get(int i){ return get(i,i +1); }
long get(int l,int r){ return sub(sum(r),sum(l)); }
}
class Edge<L> extends Nd<L>{
Node<L> u,v;
Edge(int id,Node<L> u,Node<L> v,L val){
super(id,val);
this.u = u;
this.v = v;
}
@Override
public String toString(){ return "(" +getClass().getSimpleName() +"," +(u.id +1) +"," +(v.id +1) +")"; }
}
class Node<L> extends Nd<L>{
Node<L> p;
List<Edge<L>> go,back;
int dpt;
Node(int id,L val){ super(id,val); }
@Override
public String toString(){ return "" +(id +1); }
}
class Nd<L> {
int id,l,r;
L val;
Nd(int id,L val){
this.id = id;
this.val = val;
}
}
class Graph<L> {
public int n;
List<Edge<L>> es;
Node<L>[] nds;
@SuppressWarnings("unchecked")
public Graph(int n,int m,boolean dir){
this.n = n;
nds = new Node[n];
for (int i = 0;i < n;i++) {
nds[i] = new Node<>(i,null);
nds[i].go = new ArrayList<>();
nds[i].back = dir ? new ArrayList<>() : nds[i].go;
}
es = new ArrayList<>(m);
}
public void addEdge(int u,int v,L l){
Edge<L> e = new Edge<>(es.size(),nds[u],nds[v],l);
es.add(e);
e.u.go.add(e);
e.v.back.add(new Edge<>(e.id,e.v,e.u,e.val));
}
}
class HLD<L> extends Graph<L>{
Node<L>[] hPar;
@SuppressWarnings("unchecked")
HLD(int N,int M,boolean dir){
super(N,M,dir);
hPar = new Node[n];
}
List<int[]> path(int ui,int vi,boolean incLca){
var u = nds[ui];
var v = nds[vi];
List<int[]> ret = new ArrayList<>();
while (true) {
if (u.l > v.l) {
var t = u;
u = v;
v = t;
}
var h = hPar[v.l];
if (h.l <= u.l) {
ret.add(new int[]{u.l +(incLca ? 0 : 1), v.l +1, u.id});
return ret;
}
ret.add(new int[]{h.l, v.l +1});
v = h.p;
}
}
Node<L> lca(int ui,int vi){
List<int[]> path = path(ui,vi,false);
return nds[path.get(path.size() -1)[2]];
}
public void makeTree(int s){
Stack<Integer> stk = new Stack<>();
nds[s].p = nds[s];
nds[s].dpt = 0;
stk.add(s);
stk.add(~s);
while (!stk.isEmpty()) {
var ui = stk.pop();
if (ui < 0) {
var u = nds[~ui];
u.r = 1;
for (var e:u.go) {
if (e.v == u.p)
continue;
es.set(e.id,e);
e.v.dpt = u.dpt +1;
e.v.p = u;
stk.add(e.v.id);
stk.add(~e.v.id);
}
} else if (ui != s)
nds[ui].p.r += nds[ui].r;
}
for (var u:nds)
for (int i = 1;i < u.go.size();i++)
if (u.r < u.go.get(0).v.r || u.go.get(0).v.r < u.go.get(i).v.r && u.go.get(i).v.r < u.r)
Collections.swap(u.go,0,i);
int hid = 0;
fill(hPar,null);
stk.add(s);
while (!stk.isEmpty()) {
var u = nds[stk.pop()];
u.r += u.l = hid;
if (hPar[u.l] == null)
hPar[u.l] = u;
hid++;
for (int i = u.go.size();i-- > 0;) {
var e = u.go.get(i);
if (e.v == u.p)
continue;
if (i == 0)
hPar[hid] = hPar[u.l];
stk.add(e.v.id);
}
}
for (var e:es) {
e.l = e.v.l;
e.r = e.v.r;
}
}
}
class Util{
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.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){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
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 Util.arr(new String[N],i -> str()); }
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o){
print(Util.arr(new Object[o.length],i -> o[i]));
ln();
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.PriorityBlockingQueue;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
final static int infI = (1 <<30) -1;
final static long infL = 1L <<60;
final static long mod = (int) 1e9 +7;
// final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out){
// @Override
// void println(Object obj){};
};
MyWriter log = new MyWriter(System.err){
@Override
void println(Object obj){ super.println(obj == null ? "null" : obj); };
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
int K = in.it();
int[] P = in.it(N);
Object solve(){
int cnt = 0;
for (int i = 1;i < N;i++) {
if (P[i -1] < P[i])
cnt++;
else
cnt = 0;
if (cnt == K -1)
return P;
}
int s = N -K;
while (0 < s && P[s -1] < P[s])
s--;
sort(P,s,s +K);
return P;
}
long gcd(long a,long b){ return b == 0 ? a : gcd(b,a %b); }
long lcm(long a,long b){ return b /gcd(a,b) *a; }
int[] divisors(int n){
Deque<Integer> q = new ArrayDeque<>();
for (int p = (int) Math.sqrt(n);p > 0;p--)
if (n %p == 0) {
q.addFirst(p);
if (p *p != n)
q.addLast(n /p);
}
return q.stream().mapToInt(i -> i).toArray();
}
void reverse(Object arr){
if (!arr.getClass().isArray())
throw new UnsupportedOperationException("reverse");
int l = 0;
int r = Array.getLength(arr) -1;
while (l < r) {
Object t = Array.get(arr,l);
Array.set(arr,l,Array.get(arr,r));
Array.set(arr,r,t);
l++;
r--;
}
}
long ceil(long a,long b){ return (a +b -1) /b; }
int bSearchI(int o,int n,Predicate<Integer> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (int c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
long bSearchL(long o,long n,Predicate<Long> judge){
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
// <T> void log(BIT seg){
// long[] a = new long[seg.n];
// for (int i = 0;i < a.length;i++)
// a[i] = seg.get(i);
// log.println(a);
// log.println("");
// }
// double inv(long x){ return 1.0 /x; }
long inv(long x){ return pow(x,mod -2); }
long pow(long x,long n){ return pow(x,n,mod); }
long pow(long x,long n,long mod){
x %= mod;
long ret = 1;
do {
if ((n &1) == 1)
ret = ret *x %mod;
x = x *x %mod;
} while (0 < (n >>= 1));
return ret;
}
}
class Prime{
BitSet primes;
int[] spf;
int[] P;
Prime(){ this(10_000_000,1_000_000); }
Prime(int n,int s){
primes = new BitSet(n +1);
primes.set(2,n +1);
spf = new int[min(s,n) +1];
for (int p = 2;p *p <= n || p < spf.length;p++)
if (primes.get(p))
for (int nn = p;nn <= n;primes.clear(nn += p))
if (nn < spf.length)
spf[nn] = p;
P = primes.stream().toArray();
}
long[][] factorize(long n){
List<long[]> ret = new ArrayList<>();
for (int pi = 0;pi < P.length && n >= spf.length;pi++)
n = extracted(n,ret,P[pi]);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
for (long p = P[P.length -1];p *p <= n && n >= spf.length;p += 2)
n = extracted(n,ret,p);
if (n < spf.length)
while (n > 1)
n = extracted(n,ret,spf[(int) n]);
if (1 < n)
ret.add(new long[]{n, 1});
return ret.toArray(new long[ret.size()][]);
}
long extracted(long n,List<long[]> ret,long p){
int cnt = 0;
while (n %p == 0) {
cnt++;
n /= p;
}
if (0 < cnt)
ret.add(new long[]{p, cnt});
return n;
}
long[] divisors(long n){
long[][] facts = factorize(n);
int l = 1;
for (var f:facts)
l *= f[1] +1;
long[] ret = new long[l];
int id = 1;
ret[0] = 1;
for (var f:facts) {
int sz = id;
long p = f[0];
for (int i = 0;i < f[1];i++,p *= f[0])
for (int j = 0;j < sz;j++)
ret[id++] = ret[j] *p;
}
return ret;
}
}
class UnionFind{
int num;
int[] dat;
int[] nxt;
public UnionFind(int n){
dat = new int[n];
nxt = new int[n];
setAll(nxt,i -> i);
fill(dat,-1);
num = n;
}
int root(int x){ return dat[x] < 0 ? x : (dat[x] = root(dat[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
if (dat[u] > dat[v]) {
u ^= v;
v ^= u;
u ^= v;
}
dat[u] += dat[v];
dat[v] = u;
num--;
nxt[u] ^= nxt[v];
nxt[v] ^= nxt[u];
nxt[u] ^= nxt[v];
return true;
}
int size(int x){ return -dat[root(x)]; }
int[] getGroup(int x){
int[] ret = new int[size(x)];
for (int i = 0,c = root(x);i < ret.length;i++)
ret[i] = c = nxt[c];
return ret;
}
}
class BIT{
int n;
long[] bit;
long agg(long v0,long v1){ return v0 +v1; }
long sub(long v0,long v1){ return v0 -v1; }
BIT(int n){
this.n = n;
bit = new long[n +1];
}
void upd(int x,long v){
for (x++;x <= n;x += x &-x)
bit[x] = agg(bit[x],v);
}
long sum(int x){
long ret = 0;
for (;x > 0;x -= x &-x)
ret = agg(ret,bit[x]);
return ret;
}
long get(int i){ return get(i,i +1); }
long get(int l,int r){ return sub(sum(r),sum(l)); }
}
class Edge<L> extends Nd<L>{
Node<L> u,v;
Edge(int id,Node<L> u,Node<L> v,L val){
super(id,val);
this.u = u;
this.v = v;
}
@Override
public String toString(){ return "(" +getClass().getSimpleName() +"," +(u.id +1) +"," +(v.id +1) +")"; }
}
class Node<L> extends Nd<L>{
Node<L> p;
List<Edge<L>> go,back;
int dpt;
Node(int id,L val){ super(id,val); }
@Override
public String toString(){ return "" +(id +1); }
}
class Nd<L> {
int id,l,r;
L val;
Nd(int id,L val){
this.id = id;
this.val = val;
}
}
class Graph<L> {
public int n;
List<Edge<L>> es;
Node<L>[] nds;
@SuppressWarnings("unchecked")
public Graph(int n,int m,boolean dir){
this.n = n;
nds = new Node[n];
for (int i = 0;i < n;i++) {
nds[i] = new Node<>(i,null);
nds[i].go = new ArrayList<>();
nds[i].back = dir ? new ArrayList<>() : nds[i].go;
}
es = new ArrayList<>(m);
}
public void addEdge(int u,int v,L l){
Edge<L> e = new Edge<>(es.size(),nds[u],nds[v],l);
es.add(e);
e.u.go.add(e);
e.v.back.add(new Edge<>(e.id,e.v,e.u,e.val));
}
}
class HLD<L> extends Graph<L>{
Node<L>[] hPar;
@SuppressWarnings("unchecked")
HLD(int N,int M,boolean dir){
super(N,M,dir);
hPar = new Node[n];
}
List<int[]> path(int ui,int vi,boolean incLca){
var u = nds[ui];
var v = nds[vi];
List<int[]> ret = new ArrayList<>();
while (true) {
if (u.l > v.l) {
var t = u;
u = v;
v = t;
}
var h = hPar[v.l];
if (h.l <= u.l) {
ret.add(new int[]{u.l +(incLca ? 0 : 1), v.l +1, u.id});
return ret;
}
ret.add(new int[]{h.l, v.l +1});
v = h.p;
}
}
Node<L> lca(int ui,int vi){
List<int[]> path = path(ui,vi,false);
return nds[path.get(path.size() -1)[2]];
}
public void makeTree(int s){
Stack<Integer> stk = new Stack<>();
nds[s].p = nds[s];
nds[s].dpt = 0;
stk.add(s);
stk.add(~s);
while (!stk.isEmpty()) {
var ui = stk.pop();
if (ui < 0) {
var u = nds[~ui];
u.r = 1;
for (var e:u.go) {
if (e.v == u.p)
continue;
es.set(e.id,e);
e.v.dpt = u.dpt +1;
e.v.p = u;
stk.add(e.v.id);
stk.add(~e.v.id);
}
} else if (ui != s)
nds[ui].p.r += nds[ui].r;
}
for (var u:nds)
for (int i = 1;i < u.go.size();i++)
if (u.r < u.go.get(0).v.r || u.go.get(0).v.r < u.go.get(i).v.r && u.go.get(i).v.r < u.r)
Collections.swap(u.go,0,i);
int hid = 0;
fill(hPar,null);
stk.add(s);
while (!stk.isEmpty()) {
var u = nds[stk.pop()];
u.r += u.l = hid;
if (hPar[u.l] == null)
hPar[u.l] = u;
hid++;
for (int i = u.go.size();i-- > 0;) {
var e = u.go.get(i);
if (e.v == u.p)
continue;
if (i == 0)
hPar[hid] = hPar[u.l];
stk.add(e.v.id);
}
}
for (var e:es) {
e.l = e.v.l;
e.r = e.v.r;
}
}
}
class Util{
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
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 toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.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){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
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 Util.arr(new String[N],i -> str()); }
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object... o){
print(Util.arr(new Object[o.length],i -> o[i]));
ln();
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (Object e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
}
}
| ConDefects/ConDefects/Code/arc165_b/Java/45690674 |
condefects-java_data_239 | import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int[] a = new int[n];
int[] max = new int[n];
Set<Integer> set = new TreeSet<>();
int ansInd = n - k;
for(int i = 0;i < n;i++) {
a[i] = Integer.parseInt(sc.next());
}for(int i = 0;i < k;i++) {
set.add(a[i]);
}int renzoku = 0;
for(int i = 1;i <= n - k;i++) {
if(a[i - 1] < a[i]) {
renzoku++;
}else {
renzoku = 0;
}if(renzoku == k - 1) {
ansInd = i;
break;
}if(i == n - k) {
//System.out.println(renzoku + " " + a[i]+ " " +i);
ansInd = i - renzoku;
}
}Set<Integer> nextA = new TreeSet<>();
for(int i = ansInd;i < ansInd + k;i++) {
nextA.add(a[i]);
}int plus = 0;
for(int s:nextA) {
a[ansInd + plus] = s;
plus++;
}StringBuilder sb = new StringBuilder();
for(int i = 0;i < n;i++) {
sb.append(a[i]);
sb.append(" ");
}System.out.print(sb);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int[] a = new int[n];
int[] max = new int[n];
Set<Integer> set = new TreeSet<>();
int ansInd = n - k;
for(int i = 0;i < n;i++) {
a[i] = Integer.parseInt(sc.next());
}for(int i = 0;i < k;i++) {
set.add(a[i]);
}int renzoku = 0;
for(int i = 1;i <= n - k;i++) {
if(a[i - 1] < a[i]) {
renzoku++;
}else {
renzoku = 0;
}if(renzoku == k - 1) {
ansInd = i - k + 1;
break;
}if(i == n - k) {
//System.out.println(renzoku + " " + a[i]+ " " +i);
ansInd = i - renzoku;
}
}Set<Integer> nextA = new TreeSet<>();
for(int i = ansInd;i < ansInd + k;i++) {
nextA.add(a[i]);
}int plus = 0;
for(int s:nextA) {
a[ansInd + plus] = s;
plus++;
}StringBuilder sb = new StringBuilder();
for(int i = 0;i < n;i++) {
sb.append(a[i]);
sb.append(" ");
}System.out.print(sb);
}
} | ConDefects/ConDefects/Code/arc165_b/Java/45685105 |
condefects-java_data_240 |
import java.util.*;
/**
* @author zjz
* 2023/8/23
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
long[] A = new long[n];
long[] B = new long[n];
long sum = 0;
Arrays.sort(A);
for (int i = 0; i < n; i++) {
A[i] = in.nextInt();
sum += A[i];
}
Arrays.fill(B, sum / n);
for (int i = 0; i < sum % n; i++) {
B[n - 1 - i]++;
}
long res = 0;
for (int i = 0; i < n; i++) {
res += Math.abs(A[i] - B[i]);
}
System.out.println(res / 2);
}
}
class Pair {
public int first;
public char second;
public Pair() {
}
public Pair(int first, char second) {
this.first = first;
this.second = second;
}
}
import java.util.*;
/**
* @author zjz
* 2023/8/23
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
long[] A = new long[n];
long[] B = new long[n];
long sum = 0;
for (int i = 0; i < n; i++) {
A[i] = in.nextInt();
sum += A[i];
}
Arrays.sort(A);
Arrays.fill(B, sum / n);
for (int i = 0; i < sum % n; i++) {
B[n - 1 - i]++;
}
long res = 0;
for (int i = 0; i < n; i++) {
res += Math.abs(A[i] - B[i]);
}
System.out.println(res / 2);
}
}
class Pair {
public int first;
public char second;
public Pair() {
}
public Pair(int first, char second) {
this.first = first;
this.second = second;
}
}
| ConDefects/ConDefects/Code/abc313_c/Java/44997270 |
condefects-java_data_241 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int[] array = Scanner.shuffle(sc.nextIntArray(n));
Arrays.sort(array);
long sum = 0;
for(int i : array)
sum += i;
long cnt = 0;
for(int i = 0; i < n; i++) {
if(i < sum % n) {
cnt += Math.abs(array[i] - sum / n);
} else {
cnt += Math.abs(array[i] - ((sum + n - 1) / n));
}
}
pw.println(cnt / 2);
pw.flush();
}
public static class Scanner {
StringTokenizer st;
BufferedReader br;
public Scanner(InputStream system) {
br = new BufferedReader(new InputStreamReader(system));
}
public Scanner(String file) throws Exception {
br = new BufferedReader(new FileReader(file));
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine());
return st.nextToken();
}
public String nextLine() throws IOException {
return br.readLine();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public char nextChar() throws IOException {
return next().charAt(0);
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public int[] nextIntArray(int n) throws IOException {
int[] array = new int[n];
for (int i = 0; i < n; i++)
array[i] = nextInt();
return array;
}
public Integer[] nextIntegerArray(int n) throws IOException {
Integer[] array = new Integer[n];
for (int i = 0; i < n; i++)
array[i] = new Integer(nextInt());
return array;
}
public long[] nextLongArray(int n) throws IOException {
long[] array = new long[n];
for (int i = 0; i < n; i++)
array[i] = nextLong();
return array;
}
public double[] nextDoubleArray(int n) throws IOException {
double[] array = new double[n];
for (int i = 0; i < n; i++)
array[i] = nextDouble();
return array;
}
public static int[] shuffle(int[] a) {
int n = a.length;
Random rand = new Random();
for (int i = 0; i < n; i++) {
int tmpIdx = rand.nextInt(n);
int tmp = a[i];
a[i] = a[tmpIdx];
a[tmpIdx] = tmp;
}
return a;
}
public boolean ready() throws IOException {
return br.ready();
}
public void waitForInput() throws InterruptedException {
Thread.sleep(3000);
}
}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
int[] array = Scanner.shuffle(sc.nextIntArray(n));
Arrays.sort(array);
long sum = 0;
for(int i : array)
sum += i;
long cnt = 0;
for(int i = 0; i < n; i++) {
if(i < n - (sum % n)) {
cnt += Math.abs(array[i] - sum / n);
} else {
cnt += Math.abs(array[i] - ((sum + n - 1) / n));
}
}
pw.println(cnt / 2);
pw.flush();
}
public static class Scanner {
StringTokenizer st;
BufferedReader br;
public Scanner(InputStream system) {
br = new BufferedReader(new InputStreamReader(system));
}
public Scanner(String file) throws Exception {
br = new BufferedReader(new FileReader(file));
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine());
return st.nextToken();
}
public String nextLine() throws IOException {
return br.readLine();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public char nextChar() throws IOException {
return next().charAt(0);
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public int[] nextIntArray(int n) throws IOException {
int[] array = new int[n];
for (int i = 0; i < n; i++)
array[i] = nextInt();
return array;
}
public Integer[] nextIntegerArray(int n) throws IOException {
Integer[] array = new Integer[n];
for (int i = 0; i < n; i++)
array[i] = new Integer(nextInt());
return array;
}
public long[] nextLongArray(int n) throws IOException {
long[] array = new long[n];
for (int i = 0; i < n; i++)
array[i] = nextLong();
return array;
}
public double[] nextDoubleArray(int n) throws IOException {
double[] array = new double[n];
for (int i = 0; i < n; i++)
array[i] = nextDouble();
return array;
}
public static int[] shuffle(int[] a) {
int n = a.length;
Random rand = new Random();
for (int i = 0; i < n; i++) {
int tmpIdx = rand.nextInt(n);
int tmp = a[i];
a[i] = a[tmpIdx];
a[tmpIdx] = tmp;
}
return a;
}
public boolean ready() throws IOException {
return br.ready();
}
public void waitForInput() throws InterruptedException {
Thread.sleep(3000);
}
}
}
| ConDefects/ConDefects/Code/abc313_c/Java/44598707 |
condefects-java_data_242 | import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
if(N ==1) {
System.out.print(0);
}else {
long[] A = new long[N];
long sum = 0;
for(int i = 0; i < N; i ++) {
A[i] = sc.nextInt();
sum += A[i];
}
Arrays.sort(A);
long x = sum / N;
long a =N - sum + N*x;
long count = 0;
// System.out.println(sum);
// System.out.println(x);
// System.out.println(a);
breakOut:
for(int i = 0; i < N; i ++) {
// System.out.print(A[i] + " ");
if(i <= a) {
if(x -A[i] <= 0) {
break breakOut;
}
count += x -A[i];
}else {
if(x + 1 -A[i] <= 0) {
break breakOut;
}
count += x + 1 -A[i];
}
}
System.out.print(count);
}
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
if(N ==1) {
System.out.print(0);
}else {
long[] A = new long[N];
long sum = 0;
for(int i = 0; i < N; i ++) {
A[i] = sc.nextInt();
sum += A[i];
}
Arrays.sort(A);
long x = sum / N;
long a =N - sum + N*x;
long count = 0;
// System.out.println(sum);
// System.out.println(x);
// System.out.println(a);
breakOut:
for(int i = 0; i < N; i ++) {
// System.out.print(A[i] + " ");
if(i <= a-1) {
if(x -A[i] <= 0) {
break breakOut;
}
count += x -A[i];
}else {
if(x + 1 -A[i] <= 0) {
break breakOut;
}
count += x + 1 -A[i];
}
}
System.out.print(count);
}
}
} | ConDefects/ConDefects/Code/abc313_c/Java/44553927 |
condefects-java_data_243 | 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()
{
int N = ni();
String[] S = new String[N];
for (int i = 0; i < N; i++) {
S[i] = ns();
}
int[] row = new int[N];
int[] column = new int[N];
int res = 0;
for (int i = 0; i<N; i++) {
for (int j = 0; j<N; j++) {
if (S[i].charAt(j) == 'o') {
row[i] += 1;
column[j] += 1;
}
}
}
for (int i = 0; i<N; i++) {
for (int j = 0; j<N; j++) {
if (S[i].charAt(j) == 'o') {
res += (row[i]-1) * (column[j]-1);
}
}
}
System.out.println(res);
}
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 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()
{
int N = ni();
String[] S = new String[N];
for (int i = 0; i < N; i++) {
S[i] = ns();
}
int[] row = new int[N];
int[] column = new int[N];
long res = 0L;
for (int i = 0; i<N; i++) {
for (int j = 0; j<N; j++) {
if (S[i].charAt(j) == 'o') {
row[i] += 1;
column[j] += 1;
}
}
}
for (int i = 0; i<N; i++) {
for (int j = 0; j<N; j++) {
if (S[i].charAt(j) == 'o') {
res += (row[i]-1) * (column[j]-1);
}
}
}
System.out.println(res);
}
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 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/abc330_d/Java/48063016 |
condefects-java_data_244 | import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] row = new int[N];
int[] col = new int[N];
ArrayList<ArrayList<Character>> map = new ArrayList<>();
for (int i = 0; i < N; i++) {
String str = sc.next();
ArrayList<Character> rowdata = new ArrayList<>();
for (int s = 0; s < N; s++) {
char c = str.charAt(s);
if (c == 'o') {
row[i] += 1;
col[s] += 1;
}
rowdata.add(c);
}
map.add(rowdata);
}
int ans = 0;
for (int r = 0; r < N; r++) {
for (int c = 0; c < N; c++) {
char ch = map.get(r).get(c);
if (ch == 'o') {
ans += (row[r] - 1) * (col[c] - 1);
}
}
}
System.out.println(ans);
}
}
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.stream.Collectors;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] row = new int[N];
int[] col = new int[N];
ArrayList<ArrayList<Character>> map = new ArrayList<>();
for (int i = 0; i < N; i++) {
String str = sc.next();
ArrayList<Character> rowdata = new ArrayList<>();
for (int s = 0; s < N; s++) {
char c = str.charAt(s);
if (c == 'o') {
row[i] += 1;
col[s] += 1;
}
rowdata.add(c);
}
map.add(rowdata);
}
long ans = 0;
for (int r = 0; r < N; r++) {
for (int c = 0; c < N; c++) {
char ch = map.get(r).get(c);
if (ch == 'o') {
ans += (row[r] - 1) * (col[c] - 1);
}
}
}
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc330_d/Java/47961571 |
condefects-java_data_245 | import java.util.ArrayList;
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 = Integer.parseInt(sc.next());
List<String> list = new ArrayList<>();
for (int i = 1; i <= n; i++) {
list.add(sc.next());
}
sc.close();
//盤面生成
String[][] S = new String[n][n];
for (int i = 0; i < n; i++) {
String[] s = list.get(i).split("");
for (int j = 0; j < n; j++) {
S[i][j] = s[j];
}
}
//行ごとの〇の数をカウント
List<Integer> column = new ArrayList<>();
for (int i = 0; i < n; i++) {
int c = 0;
for (int j = 0; j < n; j++) {
if ("o".equals(S[i][j])) {
c++;
}
}
column.add(c);
}
//列ごとの〇の数をカウント
List<Integer> row = new ArrayList<>();
for (int i = 0; i < n; i++) {
int r = 0;
for (int j = 0; j < n; j++) {
if ("o".equals(S[j][i])) {
r++;
}
}
row.add(r);
}
//Lのカウント
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ("o".equals(S[i][j])) {
sum += (column.get(i) - 1) * (row.get(j) - 1);
}
}
}
System.out.println(sum);
}
}
import java.util.ArrayList;
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 = Integer.parseInt(sc.next());
List<String> list = new ArrayList<>();
for (int i = 1; i <= n; i++) {
list.add(sc.next());
}
sc.close();
//盤面生成
String[][] S = new String[n][n];
for (int i = 0; i < n; i++) {
String[] s = list.get(i).split("");
for (int j = 0; j < n; j++) {
S[i][j] = s[j];
}
}
//行ごとの〇の数をカウント
List<Integer> column = new ArrayList<>();
for (int i = 0; i < n; i++) {
int c = 0;
for (int j = 0; j < n; j++) {
if ("o".equals(S[i][j])) {
c++;
}
}
column.add(c);
}
//列ごとの〇の数をカウント
List<Integer> row = new ArrayList<>();
for (int i = 0; i < n; i++) {
int r = 0;
for (int j = 0; j < n; j++) {
if ("o".equals(S[j][i])) {
r++;
}
}
row.add(r);
}
//Lのカウント
long sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ("o".equals(S[i][j])) {
sum += (column.get(i) - 1) * (row.get(j) - 1);
}
}
}
System.out.println(sum);
}
} | ConDefects/ConDefects/Code/abc330_d/Java/54309384 |
condefects-java_data_246 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = sc.next();
}
int[] rowCnt = new int[n];
int[] columnCnt = new int[n];
for (int i = 0; i < n; i++) {
int row = 0;
int column = 0;
for (int j = 0; j < n; j++) {
if (s[i].charAt(j) == 'o') {
row++;
}
if (s[j].charAt(i) == 'o') {
column++;
}
}
rowCnt[i] = row;
columnCnt[i] = column;
}
int ans = 0;
for (int i = 0; i < n; i++) {
int y = Math.max(0, rowCnt[i] - 1);
for (int j = 0; j < n; j++) {
int x = Math.max(0, columnCnt[j] - 1);
if (s[i].charAt(j) == 'o') {
ans += x * y;
}
}
}
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();
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = sc.next();
}
int[] rowCnt = new int[n];
int[] columnCnt = new int[n];
for (int i = 0; i < n; i++) {
int row = 0;
int column = 0;
for (int j = 0; j < n; j++) {
if (s[i].charAt(j) == 'o') {
row++;
}
if (s[j].charAt(i) == 'o') {
column++;
}
}
rowCnt[i] = row;
columnCnt[i] = column;
}
long ans = 0L;
for (int i = 0; i < n; i++) {
int y = Math.max(0, rowCnt[i] - 1);
for (int j = 0; j < n; j++) {
int x = Math.max(0, columnCnt[j] - 1);
if (s[i].charAt(j) == 'o') {
ans += x * y;
}
}
}
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc330_d/Java/47947702 |
condefects-java_data_247 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char[][] matrix = new char[n][n];
for(int i = 0; i < n; i++) {
matrix[i] = sc.next().toCharArray();
}
int count = 0;
int row[] = new int[n];
int col[] = new int[n];
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(matrix[i][j] == 'o') {
row[j]++;
col[i]++;
}
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(matrix[i][j] == 'o') {
count += (col[i] - 1) * (row[j] - 1);
}
}
}
System.out.println(count);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
char[][] matrix = new char[n][n];
for(int i = 0; i < n; i++) {
matrix[i] = sc.next().toCharArray();
}
long count = 0;
int row[] = new int[n];
int col[] = new int[n];
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(matrix[i][j] == 'o') {
row[j]++;
col[i]++;
}
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(matrix[i][j] == 'o') {
count += (col[i] - 1) * (row[j] - 1);
}
}
}
System.out.println(count);
}
}
| ConDefects/ConDefects/Code/abc330_d/Java/48000334 |
condefects-java_data_248 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[][] s = new int[n][n];
int[] x = new int[n];
int[] y = new int[n];
for(int i = 0; i < n; i++){
String tmp = scan.next();
for(int j = 0; j < n; j++){
if(tmp.charAt(j) == 'o'){
s[i][j] = 1;
x[i]++;
y[j]++;
}else{
s[i][j] = 0;
}
}
}
int cnt = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(s[i][j] == 1){
cnt += (x[i]-1)*(y[j]-1);
}
}
}
System.out.println(cnt);
// for(int[] i: s){
// System.out.println(Arrays.toString(i));
// }
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[][] s = new int[n][n];
int[] x = new int[n];
int[] y = new int[n];
for(int i = 0; i < n; i++){
String tmp = scan.next();
for(int j = 0; j < n; j++){
if(tmp.charAt(j) == 'o'){
s[i][j] = 1;
x[i]++;
y[j]++;
}else{
s[i][j] = 0;
}
}
}
long cnt = 0;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(s[i][j] == 1){
cnt += (x[i]-1)*(y[j]-1);
}
}
}
System.out.println(cnt);
// for(int[] i: s){
// System.out.println(Arrays.toString(i));
// }
}
} | ConDefects/ConDefects/Code/abc330_d/Java/47959354 |
condefects-java_data_249 | import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long k = sc.nextLong();
long[] a = new long[n];
long rem = 0;
for(int i = 0;i < n;i++) {
long ai = Long.parseLong(sc.next());
a[i] = ai;
rem += ai;
}long left = 0;
long right = k + 1;
while(left < right - 1) {
long mid = (left + right)/(long)2;
long tmp = k;
for(int i = 0;i < n;i++) {
tmp -= Math.min(mid, a[i]);
if(tmp < 0) {
break;
}
}if(tmp >= 0) {
left = mid;
rem = tmp;
}else {
right = mid;
}
}StringBuilder sb = new StringBuilder();
//System.out.println(right);
for(int i = 0;i < n;i++) {
a[i] = Math.max(0, a[i] - left);
if(a[i] > 0 && rem > 0) {
a[i] -= (long)1;
rem -= (long)1;
}sb.append(a[i]);
sb.append(" ");
}System.out.print(sb);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long k = sc.nextLong();
long[] a = new long[n];
long rem = 0;
for(int i = 0;i < n;i++) {
long ai = Long.parseLong(sc.next());
a[i] = ai;
rem += ai;
}long left = -1;
long right = k + 1;
while(left < right - 1) {
long mid = (left + right)/(long)2;
long tmp = k;
for(int i = 0;i < n;i++) {
tmp -= Math.min(mid, a[i]);
if(tmp < 0) {
break;
}
}if(tmp >= 0) {
left = mid;
rem = tmp;
}else {
right = mid;
}
}StringBuilder sb = new StringBuilder();
//System.out.println(right);
for(int i = 0;i < n;i++) {
a[i] = Math.max(0, a[i] - left);
if(a[i] > 0 && rem > 0) {
a[i] -= (long)1;
rem -= (long)1;
}sb.append(a[i]);
sb.append(" ");
}System.out.print(sb);
}
}
| ConDefects/ConDefects/Code/abc270_e/Java/45041887 |
condefects-java_data_250 |
import java.util.*;
import java.io.*;
public class Main {
void solve() {
int n = in.nextInt();
long k = in.nextLong();
long[] arr = new long[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = in.nextLong();
}
long l = 1, r = k;
long idx = 1;
while (l <= r) {
long mid = l + (r - l) / 2;
if (check(mid, arr, k)) {
l = mid + 1;
idx = mid;
} else {
r = mid - 1;
}
}
for (int i = 1; i <= n; i++) {
if (arr[i] <= idx) {
k -= arr[i];
arr[i] = 0;
} else {
k -= idx;
arr[i] -= idx;
}
}
for (int i = 1; i <= n; i++) {
if (k <= 0) {
break;
}
if (arr[i] > 0) {
arr[i]--;
k--;
}
}
for (int i = 1; i <= n; i++) {
out.print(arr[i] + " ");
}
}
public boolean check(long mid, long[] arr, long k) {
long te = 0;
for (long x : arr) {
te += Math.min(x, mid);
}
return te <= k;
}
FastScanner in;
PrintWriter out;
void run() {
in = new FastScanner();
out = new PrintWriter(System.out);
solve();
out.close();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastScanner(String s) {
try {
br = new BufferedReader(new FileReader(s));
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(nextToken());
}
public long nextLong() {
return Long.parseLong(nextToken());
}
public double nextDouble() {
return Double.parseDouble(nextToken());
}
}
public static void main(String[] args) {
new Main().run();
}
}
import java.util.*;
import java.io.*;
public class Main {
void solve() {
int n = in.nextInt();
long k = in.nextLong();
long[] arr = new long[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = in.nextLong();
}
long l = 1, r = k;
long idx = 0;
while (l <= r) {
long mid = l + (r - l) / 2;
if (check(mid, arr, k)) {
l = mid + 1;
idx = mid;
} else {
r = mid - 1;
}
}
for (int i = 1; i <= n; i++) {
if (arr[i] <= idx) {
k -= arr[i];
arr[i] = 0;
} else {
k -= idx;
arr[i] -= idx;
}
}
for (int i = 1; i <= n; i++) {
if (k <= 0) {
break;
}
if (arr[i] > 0) {
arr[i]--;
k--;
}
}
for (int i = 1; i <= n; i++) {
out.print(arr[i] + " ");
}
}
public boolean check(long mid, long[] arr, long k) {
long te = 0;
for (long x : arr) {
te += Math.min(x, mid);
}
return te <= k;
}
FastScanner in;
PrintWriter out;
void run() {
in = new FastScanner();
out = new PrintWriter(System.out);
solve();
out.close();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastScanner(String s) {
try {
br = new BufferedReader(new FileReader(s));
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(nextToken());
}
public long nextLong() {
return Long.parseLong(nextToken());
}
public double nextDouble() {
return Double.parseDouble(nextToken());
}
}
public static void main(String[] args) {
new Main().run();
}
}
| ConDefects/ConDefects/Code/abc270_e/Java/38475036 |
condefects-java_data_251 | import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.math.BigInteger;
import java.awt.Point;
import java.awt.Dimension;
import java.util.*;
import java.util.stream.*;
import java.util.function.Function;
final class Main {
private static final boolean autoFlush = false;
private static final SimpleScanner sc = new SimpleScanner( System.in );
private static final SimplePrinter out = new SimplePrinter( System.out, autoFlush );
public static void main ( String[] args ) {
int N = sc.nextInt();
int M = sc.nextInt();
int[] A = sc.nextInt(N);
int[] count = new int[M+1];
for(int num:A)
count[num]++;
PriorityQueue<Pair<Integer,Integer>> queue = new PriorityQueue<>();
int[] ans = new int[M];
int index = 0;
boolean[] isContain = new boolean[M+1];
int before = -1;
int p = 0;
while(index<M){
while(count[A[p]]>1){
queue.add(new Pair<>(A[p],p));
count[A[p++]]--;
}
queue.add(new Pair<>(A[p],p));
count[A[p++]]--;
while(queue.size()>0){
Pair<Integer,Integer> answer = queue.poll();
while(answer!=null&&(answer.getValue()<before||isContain[answer.getKey()]))
answer = queue.poll();
if(answer==null)
break;
ans[index++] = answer.getKey();
before = answer.getValue();
isContain[answer.getKey()] = true;
}
}
out.println(ans," ");
out.close();
}
}
/*
／￣＼
| |
＼＿／
|
／ ￣ ￣ ＼
／ ＼ ／ ＼
／ ⌒ ⌒ ＼ よくぞこの提出結果を開いてくれた
| （__人__） | 褒美としてオプーナを買う権利をやる
＼ ｀⌒´ ／ ☆
/ヽ､--ー､＿＿, -‐ ´ ＼─／
／ > ヽ▼●▼<＼ ||ｰ､.
/ヽ､ ＼ i |｡| |/ ヽ (ニ､`ヽ.
l ヽ l |｡| | r-､y ｀ﾆ ﾉ ＼
l | |ー─ | ￣ l ｀~ヽ＿ノ＿_
／￣￣￣￣ヽ-'ヽ--' ／ オープナ ／|
|￣￣￣￣￣￣|／| |￣￣￣￣￣￣|／| ＿＿＿＿＿＿
／￣オプーナ／|￣|__｣／_オープナ ／|￣|__,」＿_ ／|
|￣￣￣￣￣|／オープナ￣／￣￣￣￣|／オプーナ ／| ／ |
|￣￣￣￣￣|￣￣￣￣￣|／l￣￣￣￣|￣￣￣￣￣|／| ／
|￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|
*/
/*////////////////////////////////////////////////
* My Library *
@author viral
*/////////////////////////////////////////////////
final class Factorial {
//階乗とその逆元
private final long[] fact, inFact;
private final long mod;
/**
* 1～Nの階乗とその逆元をmodで割ったあまりを事前に計算します。
*
* @param N 計算範囲
* @param mod 法
*/
public Factorial ( int N, long mod ) {
fact = new long[N + 1];
fact[0] = fact[1] = 1;
for ( int i = 2; i <= N; i++ ) {
fact[i] = fact[i - 1] * i % mod;
}
inFact = new long[N + 1];
inFact[N] = MathFunction.modPow( fact[N], mod - 2, mod );
for ( int i = N; i > 0; i-- ) {
inFact[i - 1] = inFact[i] * i % mod;
}
inFact[0] = 1;
this.mod = mod;
}
/**
* num!をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getFact ( int num ) {
return fact[num];
}
/**
* aCbをmodで割ったあまりを返します。
*
* @param a
* @param b
*
* @return aCb
*/
public long getCombi ( int a, int b ) {
if ( a < b || a <= 0 || b <= 0 ) {
throw new IllegalArgumentException( "Factorial's index must be positive" );
}
return ( fact[a] * inFact[a - b] % mod ) * inFact[b] % mod;
}
}
final class ArrayFunction {
/**
* int型配列をソートします。
*
* @param array ソートする配列
*/
public static void sort ( int[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2] < array[j] ) {
int temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
int temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j] < array[2 * j + 1] ) || ( 2 * j + 2 < i - 1 && array[j] < array[2 * j + 2] ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1] > array[2 * j + 2] ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* int型配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static void sort ( int[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
int[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
int[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* long型配列をソートします。
*
* @param array ソートする配列
*/
public static void sort ( long[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2] < array[j] ) {
long temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
long temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j] < array[2 * j + 1] ) || ( 2 * j + 2 < i - 1 && array[j] < array[2 * j + 2] ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1] > array[2 * j + 2] ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* long型配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static void sort ( long[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
long[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
long[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* 比較可能なクラスの配列をソートします。
*
* @param array ソートする配列
*/
public static <E extends Comparable<E>> void sort ( E[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2].compareTo( array[j] ) < 0 ) {
E temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
E temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j].compareTo( array[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && array[j].compareTo( array[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1].compareTo( array[2 * j + 2] ) > 0 ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* 比較可能なクラスの配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static <E extends Comparable<E>> void sort ( E[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
E[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
E[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* int型配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static int compare ( int[] a, int[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
if ( a[i] > b[i] ) {
return 1;
}
if ( a[i] < b[i] ) {
return -1;
}
}
return Integer.compare( a.length, b.length );
}
/**
* long型配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static int compare ( long[] a, long[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
if ( a[i] > b[i] ) {
return 1;
}
if ( a[i] < b[i] ) {
return -1;
}
}
return Integer.compare( a.length, b.length );
}
/**
* 比較可能なクラスの配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static <E extends Comparable<E>> int compare ( E[] a, E[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
int result = a[i].compareTo( b[i] );
if ( result != 0 ) {
return result;
}
}
return Integer.compare( a.length, b.length );
}
/**
* カウントソートによるソートです。
* 各要素が0以上であり最大値が十分小さい時はこちらの使用を推奨します。
*
* @param array ソート対象のint型配列
* @param maximumLimit array内の最大要素
*/
public static void countSort ( int[] array, int maximumLimit ) {
int[] list = new int[maximumLimit + 1];
for ( int num: array ) {
list[num]++;
}
int temp = 0;
for ( int i = 0; i < list.length; i++ ) {
for ( int j = 0; j < list[i]; j++ ) {
array[temp++] = i;
}
}
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より小さい要素を探します。
* リスト内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より大きい要素を探します。
* リスト内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array, boolean include ) {
int[] list = new int[array.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int num: array ) {
int index = include ? overSearch( list, num ) : upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p, boolean include ) {
int[] list = new int[arrays.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int[] array: arrays ) {
int index = include ? overSearch( list, array[p] ) : upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array, boolean include ) {
long[] list = new long[array.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long num: array ) {
int index = include ? overSearch( list, num ) : upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p, boolean include ) {
long[] list = new long[arrays.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long[] array: arrays ) {
int index = include ? overSearch( list, array[p] ) : upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値はint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( ArrayList<ArrayList<Integer>> route ) {
int[] count = new int[route.size()];
int pathCount = 0;
for ( ArrayList<Integer> path: route ) {
for ( int point: path ) {
pathCount++;
count[point]++;
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; i++ ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( int nextP: route.get( nowP ) ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値はint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( int[][] route ) {
int[] count = new int[route.length];
int pathCount = 0;
for ( int[] path: route ) {
for ( int point: path ) {
pathCount++;
count[point]++;
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; i++ ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( int nextP: route[nowP] ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
}
final class MathFunction {
/**
* aとbの最大公約数を求めます。
*
* @param a
* @param b
*
* @return aとbの最大公約数
*/
public static long gcd ( long a, long b ) {
a = Math.abs( a );
b = Math.abs( b );
if ( b == 0 ) {
return a;
}
long temp;
while ( ( temp = a % b ) != 0 ) {
a = b;
b = temp;
}
return b;
}
/**
* aとbの最小公倍数を求めます。
* オーバーフロー検知は出来ません。
*
* @param a
* @param b
*
* @return aとbの最小公倍数
*/
public static long lcm ( long a, long b ) {
return a / gcd( a, b ) * b;
}
/**
* 引数が素数か判定します。
* 合成数を誤判定する確率は1/2^20以下です。
*
* @param num 検査対象
*
* @return numが素数である可能性があるならtrue、確実に合成数ならfalse
*/
public static boolean isPrime ( long num ) {
return BigInteger.valueOf( num ).isProbablePrime( 20 );
}
/**
* num以下の素数を列挙します。
*
* @param num 素数を探す上限値
*
* @return num以下の素数のint型配列
*/
public static int[] primes ( int num ) {
BitSet numbers = new BitSet( num + 1 );
numbers.set( 2, num + 1 );
for ( int i = 2; i <= Math.sqrt( num ); i++ ) {
if ( numbers.get( i ) ) {
for ( int j = i * i; j <= num; j += i ) {
numbers.clear( j );
}
}
}
int[] answer = new int[numbers.cardinality()];
int i = 2, index = 0;
do {
i = numbers.nextSetBit( i );
answer[index++] = i++;
} while ( index != answer.length );
return answer;
}
/**
* a**bを計算します。
*
* @param a
* @param b
*
* @return a**b
*/
public static long pow ( long a, long b ) {
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
a *= a;
b >>= 1;
}
return ans;
}
/**
* a**bをmodで割ったあまりを計算します。
*
* @param a
* @param b
* @param mod
*
* @return a**bをmodで割ったあまり
*/
public static long modPow ( long a, long b, long mod ) {
long ans = 1;
a %= mod;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
ans %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
/**
* nCrを計算します。
*
* @param n
* @param r
*
* @return nCr
*/
public static long combi ( long n, long r ) {
long ans = 1;
if ( r <= 0 || n < r ) {
throw new IllegalArgumentException( "index is illegal:(" + n + "," + r + ")" );
}
r = Math.min( n - r, r );
for ( int i = 0; i < r; i++ ) {
ans *= n - i;
ans /= i + 1;
}
return ans;
}
/**
* nCrをmodで割ったあまりを計算します。
*
* @param n
* @param r
* @param mod
*
* @return nCrをmodで割ったあまり
*/
public static long modCombi ( long n, long r, long mod ) {
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; i++ ) {
ans *= n - i;
ans %= mod;
ans *= modPow( i + 1, mod - 2, mod );
ans %= mod;
}
return ans;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param x1
* @param y1
* @param x2
* @param y2
* @param x3
* @param y3
* @param x4
* @param y4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4 ) {
double s1 = ( x1 - x2 ) * ( y3 - y1 ) - ( y1 - y2 ) * ( x3 - x1 );
double t1 = ( x1 - x2 ) * ( y4 - y1 ) - ( y1 - y2 ) * ( x4 - x1 );
double s2 = ( x3 - x4 ) * ( y1 - y3 ) - ( y3 - y4 ) * ( x1 - x3 );
double t2 = ( x3 - x4 ) * ( y2 - y3 ) - ( y3 - y4 ) * ( x2 - x3 );
double temp1 = s1 * t1;
double temp2 = s2 * t2;
if ( temp1 > 0 || temp2 > 0 ) {
return -1;
}
if ( temp1 == 0 && temp2 == 0 ) {
return 0;
}
return 1;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param p1
* @param p2
* @param p3
* @param p4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( Point p1, Point p2, Point p3, Point p4 ) {
return isCrossed( p1.x, p1.y, p2.x, p2.y, p3.x, p3.y, p4.x, p4.y );
}
/**
* 指定された頂点を順に結んで出来上がる多角形が凸多角形か判定します。
*
* @param points 多角形を構成する点
*
* @return 多角形が凸多角形ならtrue
*/
public static boolean isConvex ( Point... points ) {
int n = points.length;
if ( n < 3 ) {
return false;
}
if ( n == 3 ) {
return true;
}
boolean conv = true;
for ( int i = 0; i < n; i++ ) {
int result = isCrossed( points[i], points[( i + 2 ) % n], points[( i + 1 ) % n], points[( i + 1 + n / 2 ) % n] );
conv &= result >= 0;
}
return conv;
}
}
final class Converter {
/**
* Stringをintに変換します。
*
* @param str 変換対象
*
* @return 変換結果
*/
public static int parseInt ( String str ) {
char[] array = str.toCharArray();
int ans = 0;
boolean plus = true;
if ( array[0] == '-' ) {
plus = false;
array[0] = '0';
}
for ( char num: array ) {
ans = ans * 10 + num - '0';
}
return plus ? ans : -ans;
}
/**
* Stringをlongに変換します。
*
* @param str 変換対象
*
* @return 変換結果
*/
public static long parseLong ( String str ) {
char[] array = str.toCharArray();
long ans = 0;
boolean plus = true;
if ( array[0] == '-' ) {
plus = false;
array[0] = '0';
}
for ( char c: array ) {
ans = ans * 10 + c - '0';
}
return plus ? ans : -ans;
}
}
// Binary Indexed Tree
final class BIT {
final int size;
final long[] tree;
public BIT ( int n ) {
size = n;
tree = new long[n + 1];
}
public long sum ( int i ) {
long sum = 0;
while ( i > 0 ) {
sum += tree[i];
i -= i & ( -i );
}
return sum;
}
public void add ( int i, long x ) {
while ( i <= size ) {
tree[i] += x;
i += i & ( -i );
}
}
}
// Bit Set
final class Bitset implements Cloneable {
private final long[] bit;
private final int size, len;
private final long MASK;
public Bitset ( final int len ) {
this.len = len;
size = ( len + 63 ) >> 6;
bit = new long[size];
MASK = ( -1L ) >>> ( ( size << 6 ) - len );
}
public void set ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
bit[index >> 6] |= ( 1L << ( index & 0b111111 ) );
}
public void clear ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
long m = ~( 1L << ( index & 0b111111 ) );
bit[index >> 6] &= m;
}
public boolean get ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
return ( bit[index >> 6] & ( 1L << ( index & 0b111111 ) ) ) != 0;
}
public void shiftLeft ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = size - 1; i >= n; i-- ) {
bit[i] = ( bit[i - n] << num ) | ( i != n && num != 0 ? bit[i - n - 1] >>> ( 64 - num ) : 0L );
}
for ( int i = 0; i < n; i++ ) {
bit[i] = 0L;
}
bit[size - 1] &= MASK;
}
public void shiftRight ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = 0; i < size - n; i++ ) {
bit[i] = ( bit[i + n] >>> num ) | ( i + n + 1 != size && num != 0 ? bit[i + n + 1] << ( 64 - num ) : 0L );
}
for ( int i = size - 1; i >= size - n; i-- ) {
bit[i] = 0L;
}
}
public long[] longValues () {
return bit;
}
public long longValue () {
return bit[0];
}
public void and ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] &= bit2[i];
}
for ( int i = m; i < size; i++ ) {
bit[i] = 0;
}
bit[size - 1] &= MASK;
}
public void or ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] |= bit2[i];
}
bit[size - 1] &= MASK;
}
public void xor ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] ^= bit2[i];
}
bit[size - 1] &= MASK;
}
public Bitset clone () throws CloneNotSupportedException {
super.clone();
final Bitset b = new Bitset( len );
b.or( this );
return b;
}
}
// Segment Tree
abstract class SegmentTree<E> {
int N, size;
E def;
Object[] node;
public SegmentTree ( int n, E def, boolean include ) {
N = 2;
size = 1;
while ( N < n << 1 ) {
N <<= 1;
size <<= 1;
}
size -= include ? 1 : 0;
node = new Object[N];
this.def = def;
Arrays.fill( node, this.def );
}
public SegmentTree ( int n, E def ) {
this( n, def, false );
}
@SuppressWarnings( "unchecked" )
public void update ( int n, E value ) {
n += size;
node[n] = value;
n >>= 1;
while ( n > 0 ) {
node[n] = function( ( E )node[n << 1], ( E )node[( n << 1 ) + 1] );
n >>= 1;
}
}
@SuppressWarnings( "unchecked" )
public E get ( int a ) {
return ( E )node[a + size];
}
@SuppressWarnings( "unchecked" )
public E answer () {
return ( E )node[1];
}
@SuppressWarnings( "unchecked" )
public E query ( int l, int r ) {
l += size;
r += size;
E answer = def;
while ( l > 0 && r > 0 && l <= r ) {
if ( l % 2 == 1 ) {
answer = function( ( E )node[l++], answer );
}
l >>= 1;
if ( r % 2 == 0 ) {
answer = function( answer, ( E )node[r--] );
}
r >>= 1;
}
return answer;
}
abstract public E function ( E a, E b );
}
// Union Find
final class UnionFind {
private final int[] par, rank, size;
private int count;
public UnionFind ( int N ) {
count = N;
par = new int[N];
rank = new int[N];
size = new int[N];
Arrays.fill( par, -1 );
Arrays.fill( size, 1 );
}
public int root ( int x ) {
if ( par[x] == -1 ) {
return x;
}
else {
return par[x] = root( par[x] );
}
}
public boolean isSame ( int x, int y ) {
return root( x ) == root( y );
}
public boolean unite ( int x, int y ) {
int rx = root( x );
int ry = root( y );
if ( rx == ry ) {
return false;
}
if ( rank[rx] < rank[ry] ) {
int temp = rx;
rx = ry;
ry = temp;
}
par[ry] = rx;
if ( rank[rx] == rank[ry] ) {
++rank[rx];
}
size[rx] += size[ry];
--count;
return true;
}
public int groupCount () {
return count;
}
public int size ( int x ) {
return size[root( x )];
}
}
// Rolling Hash
final class RollingHash implements Comparable<RollingHash> {
private static final int base = 100;
private static final int mod1 = 1_000_000_007;
private static final int mod2 = Integer.MAX_VALUE - 1;
private long[] hash1, hash2;
private String string;
public RollingHash ( String str ) {
string = str;
hash1 = new long[str.length() + 1];
hash2 = new long[str.length() + 1];
roll();
}
private void roll () {
int len = string.length();
for ( int i = 1; i <= len; i++ ) {
hash1[i] = hash1[i - 1] * base + string.charAt( i - 1 ) - ' ' + 1;
hash2[i] = hash2[i - 1] * base + string.charAt( i - 1 ) - ' ' + 1;
hash1[i] %= mod1;
hash2[i] %= mod2;
}
}
public long getHash1 ( int l, int r ) {
return ( hash1[r] - hash1[l] * modPow( base, r - l, mod1 ) % mod1 + mod1 ) % mod1;
}
public long getHash2 ( int l, int r ) {
return ( hash2[r] - hash2[l] * modPow( base, r - l, mod2 ) % mod2 + mod2 ) % mod2;
}
private long modPow ( long a, long b, long mod ) {
a %= mod;
b %= mod - 1;
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
public boolean equals ( RollingHash rh, int l1, int r1, int l2, int r2 ) {
if ( r1 - l1 != r2 - l2 ) {
return false;
}
long hashValue1 = getHash1( l1, r1 );
long hashValue2 = getHash2( l1, r1 );
return hashValue1 == rh.getHash1( l2, r2 )
&& hashValue2 == rh.getHash2( l2, r2 )
&& check( rh, l1, l2, r1 - l1 );
}
private boolean check ( RollingHash rh, int l1, int l2, int len ) {
return check( rh.toString(), l1, l2, len );
}
private boolean check ( String str, int l1, int l2, int len ) {
for ( int i = 0; i < len; i++ ) {
if ( string.charAt( l1 + i ) != str.charAt( l2 + i ) ) {
return false;
}
}
return true;
}
public int length () {
return string.length();
}
@Override
public int hashCode () {
return string.hashCode();
}
@Override
public String toString () {
return string;
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof RollingHash ) {
RollingHash rh = ( RollingHash )o;
return equals( rh, 1, length(), 1, rh.length() );
}
return false;
}
@Override
public int compareTo ( RollingHash rh ) {
return string.compareTo( rh.toString() );
}
public int compareTo ( String str ) {
return string.compareTo( str );
}
public char charAt ( int i ) {
return string.charAt( i );
}
public int compareToIgnoreCase ( RollingHash rh ) {
return string.compareToIgnoreCase( rh.toString() );
}
public int compareToIgnoreCase ( String str ) {
return string.compareToIgnoreCase( str );
}
public void concat ( RollingHash rh ) {
concat( rh.toString() );
}
public void concat ( String str ) {
string = string.concat( str );
hash1 = new long[string.length() + 1];
hash2 = new long[string.length() + 1];
roll();
}
public boolean contains ( RollingHash rh ) {
long hash1 = rh.getHash1( 0, rh.length() );
long hash2 = rh.getHash2( 0, rh.length() );
boolean isContain = false;
int len = length() - rh.length();
for ( int i = 0; i <= len; i++ ) {
if ( hash1 == getHash1( i, rh.length() + i )
&& hash2 == getHash2( i, rh.length() + i ) ) {
isContain |= check( rh, i, 0, rh.length() );
}
}
return isContain;
}
public boolean contains ( String str ) {
return indexOf( str ) != -1;
}
public int indexOf ( int ch ) {
return indexOf( ch, 0 );
}
public int indexOf ( int ch, int fromIndex ) {
int len = length();
for ( int i = fromIndex; i < len; i++ ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int indexOf ( String str ) {
return indexOf( str, 0 );
}
public int indexOf ( String str, int fromIndex ) {
long hash1 = 0;
long hash2 = 0;
for ( char c: str.toCharArray() ) {
hash1 = hash1 * base + c - ' ' + 1;
hash2 = hash2 * base + c - ' ' + 1;
hash1 %= mod1;
hash2 %= mod2;
}
int len = length() - str.length();
for ( int i = fromIndex; i <= len; i++ ) {
if ( hash1 == getHash1( i, str.length() + i )
&& hash2 == getHash2( i, str.length() + i )
&& check( str, i, 0, str.length() ) ) {
return i;
}
}
return -1;
}
public boolean isEmpty () {
return length() == 0;
}
public int lastIndexOf ( int ch, int fromIndex ) {
for ( int i = fromIndex; i >= 0; i-- ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int lastIndexOf ( int ch ) {
return lastIndexOf( ch, length() - 1 );
}
public static RollingHash valueOf ( boolean b ) {
return new RollingHash( b ? "true" : "false" );
}
public static RollingHash valueOf ( char c ) {
return new RollingHash( "" + c );
}
public static RollingHash valueOf ( char[] c ) {
return new RollingHash( String.valueOf( c, 0, c.length ) );
}
public static RollingHash valueOf ( char[] c, int offset, int count ) {
return new RollingHash( String.valueOf( c, offset, count ) );
}
public static RollingHash valueOf ( double d ) {
return new RollingHash( String.valueOf( d ) );
}
public static RollingHash valueOf ( float f ) {
return new RollingHash( String.valueOf( f ) );
}
public static RollingHash valueOf ( int i ) {
return new RollingHash( String.valueOf( i ) );
}
public static RollingHash valueOf ( long l ) {
return new RollingHash( String.valueOf( l ) );
}
public static RollingHash valueOf ( Object obj ) {
return new RollingHash( String.valueOf( obj ) );
}
}
// Pair
class Pair<K extends Comparable<K>, V extends Comparable<V>>
implements Comparable<Pair<K, V>> {
private AbstractMap.SimpleEntry<K, V> map;
public Pair ( K key, V value ) {
map = new AbstractMap.SimpleEntry<>( key, value );
}
public K getKey () {
return map.getKey();
}
public V getValue () {
return map.getValue();
}
public K setKey ( K key ) {
K oldKey = map.getKey();
V value = map.getValue();
map = new AbstractMap.SimpleEntry<>( key, value );
return oldKey;
}
public V setValue ( V value ) {
return map.setValue( value );
}
@Override
public int compareTo ( Pair<K, V> pair ) {
int com = getKey().compareTo( pair.getKey() );
return com != 0 ? com : getValue().compareTo( pair.getValue() );
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof Pair<?, ?> ) {
Pair<?, ?> pair = ( Pair<?, ?> )o;
return getKey().equals( pair.getKey() ) && getValue().equals( pair.getValue() );
}
return false;
}
@Override
public String toString () {
return getKey() + "=" + getValue();
}
@Override
public int hashCode () {
return ( getKey().hashCode() << 2 ) ^ ( getValue().hashCode() );
}
}
//AVL Tree
final class AVLTree_Int {
private Node root;
private int size, hash;
public AVLTree_Int () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
int height,size;
Node left, right, parent;
public Node ( final Node p, final int v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final int x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public int get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public int getIndex ( int value ) {
if ( root == null ) {
return -1;
}
int ans = 0;
Node now = root;
while ( now != null ) {
if ( value < now.value ) {
now = now.left;
}
else if ( value > now.value ) {
ans += now.left != null ? now.left.size + 1 : 1;
now = now.right;
}
else {
ans += now.left != null ? now.left.size : 0;
return ans;
}
}
return ~ans;
}
public boolean remove ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public int ceiling ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] list = new int[size];
if ( root != null ) {
int index = 0;
java.util.ArrayDeque<Node> deq = new java.util.ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toArray();
return java.util.Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Int ) {
final AVLTree_Int tree = ( AVLTree_Int )o;
if ( size == tree.size() ) {
return false;
}
final int[] array1 = toArray();
final int[] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( Node node ) {
int lh = node.left != null ? node.left.height : 0;
int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
int ls = node.left != null ? node.left.size : 0;
int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class AVLTree_Long {
private Node root;
private int size, hash;
public AVLTree_Long () {
size = 0;
root = null;
hash = 0;
}
private static final class Node {
long value;
int height;
Node left, right, parent;
public Node ( final Node p, final long v ) {
value = v;
height = 1;
parent = p;
}
}
public boolean add ( final long x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public long ceiling ( final long x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long floor ( final long x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int size () {
return size;
}
public long[] toArray () {
final long[] list = new long[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Long ) {
final AVLTree_Long tree = ( AVLTree_Long )o;
if ( size == tree.size() ) {
return false;
}
final long[] array1 = toArray();
final long[] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
final int h = node.height;
setHeight( node );
if ( h == node.height ) {
break;
}
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setHeight( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setHeight( node );
}
private void setHeight ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
}
}
//Red-Black Tree
final class RedBlackTree {
private int size;
private Entry root;
public RedBlackTree () {
size = 0;
root = null;
}
public int size () {
return size;
}
public boolean contains ( final long key ) {
return getEntry( key ) != null;
}
private Entry getEntry ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
p = p.left;
}
else if ( key > p.getValue() ) {
p = p.right;
}
else {
return p;
}
}
return null;
}
public long ceiling ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
return p.getValue();
}
}
else if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.right ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key - 1;
}
}
else {
return key;
}
}
return key - 1;
}
public long floor ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
return p.getValue();
}
}
else if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.left ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key + 1;
}
}
else {
return p.getValue();
}
}
return key + 1;
}
public long higher ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
return p.getValue();
}
}
else {
if ( p.right != null ) {
p = p.right;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.right ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key - 1;
}
}
}
return key - 1;
}
public long lower ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
return p.getValue();
}
}
else {
if ( p.left != null ) {
p = p.left;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.left ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key + 1;
}
}
}
return key + 1;
}
private void addEntry ( final long key, final Entry parent, final boolean addToLeft ) {
final Entry e = new Entry( key, parent );
if ( addToLeft ) {
parent.left = e;
}
else {
parent.right = e;
}
fixAfterInsertion( e );
size++;
}
private void addEntryToEmptySet ( final long key ) {
root = new Entry( key, null );
size = 1;
}
public boolean add ( final long key ) {
Entry t = root;
if ( t == null ) {
addEntryToEmptySet( key );
return true;
}
Entry parent;
do {
parent = t;
if ( key < parent.getValue() ) {
t = t.left;
}
else if ( key > parent.getValue() ) {
t = t.right;
}
else {
return false;
}
} while ( t != null );
addEntry( key, parent, key < parent.getValue() );
return true;
}
public boolean remove ( final long key ) {
final Entry p = getEntry( key );
if ( p == null ) {
return false;
}
deleteEntry( p );
return true;
}
public void clear () {
size = 0;
root = null;
}
private static final boolean RED = false;
private static final boolean BLACK = true;
private static final class Entry {
private long value;
private Entry left;
private Entry right;
private Entry parent;
private boolean color = BLACK;
private Entry ( final long value, final Entry parent ) {
this.value = value;
this.parent = parent;
}
private long getValue () {
return value;
}
public boolean equals ( final Object o ) {
if ( !( o instanceof Entry ) ) {
return false;
}
final Entry e = ( Entry )o;
return value == e.getValue();
}
public int hashCode () {
return Long.hashCode( value );
}
public String toString () {
return String.valueOf( value );
}
}
public long first () {
Entry p = root;
if ( p != null ) {
while ( p.left != null ) {
p = p.left;
}
}
else {
throw new NullPointerException();
}
return p.getValue();
}
public long last () {
Entry p = root;
if ( p != null ) {
while ( p.right != null ) {
p = p.right;
}
}
else {
throw new NullPointerException();
}
return p.getValue();
}
private static Entry successor ( final Entry t ) {
if ( t == null ) {
return null;
}
else if ( t.right != null ) {
Entry p = t.right;
while ( p.left != null ) {
p = p.left;
}
return p;
}
else {
Entry p = t.parent;
Entry ch = t;
while ( p != null && ch == p.right ) {
ch = p;
p = p.parent;
}
return p;
}
}
private static boolean colorOf ( final Entry p ) {
return ( p == null ? BLACK : p.color );
}
private static Entry parentOf ( final Entry p ) {
return ( p == null ? null : p.parent );
}
private static void setColor ( final Entry p, final boolean c ) {
if ( p != null ) {
p.color = c;
}
}
private static Entry leftOf ( final Entry p ) {
return ( p == null ) ? null : p.left;
}
private static Entry rightOf ( final Entry p ) {
return ( p == null ) ? null : p.right;
}
private void rotateLeft ( final Entry p ) {
if ( p != null ) {
final Entry r = p.right;
p.right = r.left;
if ( r.left != null ) {
r.left.parent = p;
}
r.parent = p.parent;
if ( p.parent == null ) {
root = r;
}
else if ( p.parent.left == p ) {
p.parent.left = r;
}
else {
p.parent.right = r;
}
r.left = p;
p.parent = r;
}
}
private void rotateRight ( final Entry p ) {
if ( p != null ) {
final Entry l = p.left;
p.left = l.right;
if ( l.right != null ) {
l.right.parent = p;
}
l.parent = p.parent;
if ( p.parent == null ) {
root = l;
}
else if ( p.parent.right == p ) {
p.parent.right = l;
}
else {
p.parent.left = l;
}
l.right = p;
p.parent = l;
}
}
private void fixAfterInsertion ( Entry x ) {
x.color = RED;
while ( x != null && x != root && x.parent.color == RED ) {
if ( parentOf( x ) == leftOf( parentOf( parentOf( x ) ) ) ) {
final Entry y = rightOf( parentOf( parentOf( x ) ) );
if ( colorOf( y ) == RED ) {
setColor( parentOf( x ), BLACK );
setColor( y, BLACK );
setColor( parentOf( parentOf( x ) ), RED );
x = parentOf( parentOf( x ) );
}
else {
if ( x == rightOf( parentOf( x ) ) ) {
x = parentOf( x );
rotateLeft( x );
}
setColor( parentOf( x ), BLACK );
setColor( parentOf( parentOf( x ) ), RED );
rotateRight( parentOf( parentOf( x ) ) );
}
}
else {
final Entry y = leftOf( parentOf( parentOf( x ) ) );
if ( colorOf( y ) == RED ) {
setColor( parentOf( x ), BLACK );
setColor( y, BLACK );
setColor( parentOf( parentOf( x ) ), RED );
x = parentOf( parentOf( x ) );
}
else {
if ( x == leftOf( parentOf( x ) ) ) {
x = parentOf( x );
rotateRight( x );
}
setColor( parentOf( x ), BLACK );
setColor( parentOf( parentOf( x ) ), RED );
rotateLeft( parentOf( parentOf( x ) ) );
}
}
}
root.color = BLACK;
}
private void deleteEntry ( Entry p ) {
size--;
if ( p.left != null && p.right != null ) {
final Entry s = successor( p );
p.value = s.value;
p = s;
}
final Entry replacement = ( p.left != null ? p.left : p.right );
if ( replacement != null ) {
replacement.parent = p.parent;
if ( p.parent == null ) {
root = replacement;
}
else if ( p == p.parent.left ) {
p.parent.left = replacement;
}
else {
p.parent.right = replacement;
}
p.left = p.right = p.parent = null;
if ( p.color == BLACK ) {
fixAfterDeletion( replacement );
}
}
else if ( p.parent == null ) {
root = null;
}
else {
if ( p.color == BLACK ) {
fixAfterDeletion( p );
}
if ( p.parent != null ) {
if ( p == p.parent.left ) {
p.parent.left = null;
}
else if ( p == p.parent.right ) {
p.parent.right = null;
}
p.parent = null;
}
}
}
private void fixAfterDeletion ( Entry x ) {
while ( x != root && colorOf( x ) == BLACK ) {
if ( x == leftOf( parentOf( x ) ) ) {
Entry sib = rightOf( parentOf( x ) );
if ( colorOf( sib ) == RED ) {
setColor( sib, BLACK );
setColor( parentOf( x ), RED );
rotateLeft( parentOf( x ) );
sib = rightOf( parentOf( x ) );
}
if ( colorOf( leftOf( sib ) ) == BLACK &&
colorOf( rightOf( sib ) ) == BLACK ) {
setColor( sib, RED );
x = parentOf( x );
}
else {
if ( colorOf( rightOf( sib ) ) == BLACK ) {
setColor( leftOf( sib ), BLACK );
setColor( sib, RED );
rotateRight( sib );
sib = rightOf( parentOf( x ) );
}
setColor( sib, colorOf( parentOf( x ) ) );
setColor( parentOf( x ), BLACK );
setColor( rightOf( sib ), BLACK );
rotateLeft( parentOf( x ) );
x = root;
}
}
else {
Entry sib = leftOf( parentOf( x ) );
if ( colorOf( sib ) == RED ) {
setColor( sib, BLACK );
setColor( parentOf( x ), RED );
rotateRight( parentOf( x ) );
sib = leftOf( parentOf( x ) );
}
if ( colorOf( rightOf( sib ) ) == BLACK &&
colorOf( leftOf( sib ) ) == BLACK ) {
setColor( sib, RED );
x = parentOf( x );
}
else {
if ( colorOf( leftOf( sib ) ) == BLACK ) {
setColor( rightOf( sib ), BLACK );
setColor( sib, RED );
rotateLeft( sib );
sib = leftOf( parentOf( x ) );
}
setColor( sib, colorOf( parentOf( x ) ) );
setColor( parentOf( x ), BLACK );
setColor( leftOf( sib ), BLACK );
rotateRight( parentOf( x ) );
x = root;
}
}
}
setColor( x, BLACK );
}
public long[] toArray () {
index = 0;
return search( new long[size], root );
}
@Override
public String toString () {
return Arrays.toString( toArray() );
}
private int index;
private long[] search ( final long[] array, final Entry now ) {
if ( now == null ) {
return array;
}
search( array, now.left );
array[index++] = now.getValue();
search( array, now.right );
return array;
}
}
//AVL木(multi_set)
final class AVLTree_Multi_Int {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public AVLTree_Multi_Int () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final int v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final int x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
uniqueSize++;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count++;
break;
}
} while ( now != null );
if ( bool ) {
uniqueSize++;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= ( int )x;
}
public void add ( final int x , final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
uniqueSize++;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
uniqueSize++;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
++size;
hash ^= ( int )x;
}
public int get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
public long removeAll ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
long ans = n.count;
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
node.count--;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
uniqueSize--;
}
else {
if ( node.left != null && node.right != null ) {
Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final int x ) {
if ( root == null ) {
return 0;
}
Node node = getNode( x );
return node != null ? node.count : 0;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public int ceiling ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
java.util.ArrayDeque<Node> deq = new java.util.ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[][] list = toArray();
return java.util.Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Multi_Int ) {
final AVLTree_Multi_Int tree = ( AVLTree_Multi_Int )o;
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( Node node ) {
int lh = node.left != null ? node.left.height : 0;
int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
long ls = node.left != null ? node.left.size : 0;
long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
public Node getRoot () {
return root;
}
}
//Matrix
final class Matrix {
private final long[][] matrix;
public Matrix ( final int H, final int W, final long def ) {
matrix = new long[H][W];
if ( def != 0 ) {
for ( long[] mat: matrix ) {
Arrays.fill( mat, def );
}
}
}
public Matrix ( final int H, final int W ) {
this( H, W, 0 );
}
public Matrix ( final Dimension d, final long def ) {
this( d.height, d.width, def );
}
public Matrix ( final long[][] mat ) {
matrix = new long[mat.length][];
for ( int i = 0; i < mat.length; i++ ) {
matrix[i] = Arrays.copyOf( mat[i], mat[i].length );
}
}
public long get ( final int i, final int j ) {
return matrix[i][j];
}
public long set ( final int i, final int j, final long value ) {
return matrix[i][j] = value;
}
public Matrix copy () {
return new Matrix( matrix );
}
public Dimension size () {
return new Dimension( matrix[0].length, matrix.length );
}
public Matrix add ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, matrix[i][j] + m.get( i, j ) );
}
}
return ans;
}
public Matrix subtract ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, matrix[i][j] - m.get( i, j ) );
}
}
return ans;
}
public Matrix multiply ( final Matrix m ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; i++ ) {
for ( int j = 0; j < size.width; j++ ) {
long sum = 0;
for ( int k = 0; k < len; k++ ) {
sum += matrix[i][k] * m.get( k, j );
}
ans.set( i, j, sum );
}
}
return ans;
}
public Matrix modAdd ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, remainder( matrix[i][j] + m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modSubtract ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, remainder( matrix[i][j] - m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modMultiply ( final Matrix m, final long mod ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; i++ ) {
for ( int j = 0; j < size.width; j++ ) {
long sum = 0;
for ( int k = 0; k < len; k++ ) {
sum = remainder( sum + matrix[i][k] * m.get( k, j ), mod );
}
ans.set( i, j, sum );
}
}
return ans;
}
public static Matrix pow ( final Matrix original, final Matrix pw, long exp ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.multiply( a );
}
b = b.multiply( b );
exp >>= 1;
}
return a;
}
public static Matrix modPow ( final Matrix original, final Matrix pw, long exp, final long mod ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.modMultiply( a, mod );
}
b = b.modMultiply( b, mod );
exp >>= 1;
}
return a;
}
private static long remainder ( long num, final long mod ) {
num %= mod;
if ( num < 0 ) {
num += mod;
}
return num;
}
@Override
public String toString () {
final StringBuilder ans = new StringBuilder();
ans.append( Arrays.toString( matrix[0] ) );
for ( int i = 1; i < matrix.length; i++ ) {
ans.append( "\n" );
ans.append( Arrays.toString( matrix[i] ) );
}
return ans.toString();
}
}
// MyScanner
final class SimpleScanner {
final private int buff_size = 1 << 15;
private final InputStream is;
private final byte[] buff;
private int point, length;
public SimpleScanner ( InputStream is ) {
this.is = is;
buff = new byte[buff_size];
point = length = 0;
}
private void reload () {
do {
try {
length = is.read( buff, point = 0, buff_size );
} catch ( IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
} while ( length == -1 );
}
private byte read () {
if ( point == length ) {
reload();
}
return buff[point++];
}
public byte nextByte () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return c;
}
public int nextInt () {
int ans = 0;
byte c = read();
while ( c <= ' ' ) {
c = read();
}
boolean negate = c == '-';
if ( c == '-' ) {
c = read();
}
while ( '0' <= c && c <= '9' ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public long nextLong () {
long ans = 0;
byte c = read();
while ( c <= ' ' ) {
c = read();
}
boolean negate = c == '-';
if ( c == '-' ) {
c = read();
}
while ( '0' <= c && c <= '9' ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public char nextChar () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return ( char )c;
}
public String next () {
StringBuilder ans = new StringBuilder();
byte c = read();
while ( c <= ' ' ) {
c = read();
}
while ( c > ' ' ) {
ans.append( ( char )c );
c = read();
}
return ans.toString();
}
public byte[] nextByte ( int n ) {
byte[] ans = new byte[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextByte();
}
return ans;
}
public int[] nextInt ( int n ) {
int[] ans = new int[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextInt();
}
return ans;
}
public long[] nextLong ( int n ) {
long[] ans = new long[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextLong();
}
return ans;
}
public String[] next ( int n ) {
String[] ans = new String[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = next();
}
return ans;
}
public byte[][] nextByte ( int n, int m ) {
byte[][] ans = new byte[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextByte( m );
}
return ans;
}
public int[][] nextInt ( int n, int m ) {
int[][] ans = new int[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextInt( m );
}
return ans;
}
public long[][] nextLong ( int n, int m ) {
long[][] ans = new long[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextLong( m );
}
return ans;
}
public String[][] next ( int n, int m ) {
String[][] ans = new String[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = next( m );
}
return ans;
}
public char[] nextCharArray () {
return next().toCharArray();
}
public char[][] nextCharArray ( int n ) {
char[][] ans = new char[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextCharArray();
}
return ans;
}
public int[][] nextGraph ( int N, int M ) {
if ( M == 0 ) {
return new int[N + 1][0];
}
int[][] ans = new int[N + 1][];
int[] count = new int[N + 1];
int[][] path = nextInt( M, 2 );
for ( int[] temp: path ) {
count[temp[0]]++;
count[temp[1]]++;
}
for ( int i = 1; i <= N; i++ ) {
ans[i] = new int[count[i]];
}
for ( int[] temp: path ) {
ans[temp[0]][--count[temp[0]]] = temp[1];
ans[temp[1]][--count[temp[1]]] = temp[0];
}
ans[0] = new int[0];
return ans;
}
public Point nextPoint () {
return new Point( nextInt(), nextInt() );
}
public Point[] nextPoint ( int n ) {
Point[] ans = new Point[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextPoint();
}
return ans;
}
public void close () {
try {
is.close();
} catch ( IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
}
}
// MyPrinter
final class SimplePrinter extends PrintWriter {
public SimplePrinter ( PrintStream os ) {
super( os );
}
public SimplePrinter ( PrintStream os, boolean bool ) {
super( os, bool );
}
public void println ( int[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public void println ( int[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public void println ( int[][] arrays, String str ) {
for ( int[] array: arrays ) {
println( array, str );
}
}
public void println ( int[][] arrays, char c ) {
for ( int[] array: arrays ) {
println( array, c );
}
}
public void println ( long[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public void println ( long[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public void println ( long[][] arrays, String str ) {
for ( long[] array: arrays ) {
println( array, str );
}
}
public void println ( long[][] arrays, char c ) {
for ( long[] array: arrays ) {
println( array, c );
}
}
public void println ( char[] cs, String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( char[] cs, char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( c );
print( cs[i] );
}
println();
}
public void println ( char[][] cs ) {
for ( char[] c: cs ) {
println( c );
}
}
public void println ( char[][] cs, String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( char[][] cs, char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( c );
print( cs[i] );
}
println();
}
public <E> void println ( E[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public <E> void println ( E[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public <E> void println ( E[][] arrays, String str ) {
for ( E[] array: arrays ) {
println( array, str );
}
}
public <E> void println ( E[][] arrays, char c ) {
for ( E[] array: arrays ) {
println( array, c );
}
}
}
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.math.BigInteger;
import java.awt.Point;
import java.awt.Dimension;
import java.util.*;
import java.util.stream.*;
import java.util.function.Function;
final class Main {
private static final boolean autoFlush = false;
private static final SimpleScanner sc = new SimpleScanner( System.in );
private static final SimplePrinter out = new SimplePrinter( System.out, autoFlush );
public static void main ( String[] args ) {
int N = sc.nextInt();
int M = sc.nextInt();
int[] A = sc.nextInt(N);
int[] count = new int[M+1];
for(int num:A)
count[num]++;
PriorityQueue<Pair<Integer,Integer>> queue = new PriorityQueue<>();
int[] ans = new int[M];
int index = 0;
boolean[] isContain = new boolean[M+1];
int before = -1;
int p = 0;
while(index<M){
while(count[A[p]]>1){
queue.add(new Pair<>(A[p],p));
count[A[p++]]--;
}
queue.add(new Pair<>(A[p],p));
count[A[p++]]--;
while(!isContain[A[p-1]]){
Pair<Integer,Integer> answer = queue.poll();
while(answer!=null&&(answer.getValue()<before||isContain[answer.getKey()]))
answer = queue.poll();
if(answer==null)
break;
ans[index++] = answer.getKey();
before = answer.getValue();
isContain[answer.getKey()] = true;
}
}
out.println(ans," ");
out.close();
}
}
/*
／￣＼
| |
＼＿／
|
／ ￣ ￣ ＼
／ ＼ ／ ＼
／ ⌒ ⌒ ＼ よくぞこの提出結果を開いてくれた
| （__人__） | 褒美としてオプーナを買う権利をやる
＼ ｀⌒´ ／ ☆
/ヽ､--ー､＿＿, -‐ ´ ＼─／
／ > ヽ▼●▼<＼ ||ｰ､.
/ヽ､ ＼ i |｡| |/ ヽ (ニ､`ヽ.
l ヽ l |｡| | r-､y ｀ﾆ ﾉ ＼
l | |ー─ | ￣ l ｀~ヽ＿ノ＿_
／￣￣￣￣ヽ-'ヽ--' ／ オープナ ／|
|￣￣￣￣￣￣|／| |￣￣￣￣￣￣|／| ＿＿＿＿＿＿
／￣オプーナ／|￣|__｣／_オープナ ／|￣|__,」＿_ ／|
|￣￣￣￣￣|／オープナ￣／￣￣￣￣|／オプーナ ／| ／ |
|￣￣￣￣￣|￣￣￣￣￣|／l￣￣￣￣|￣￣￣￣￣|／| ／
|￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|
*/
/*////////////////////////////////////////////////
* My Library *
@author viral
*/////////////////////////////////////////////////
final class Factorial {
//階乗とその逆元
private final long[] fact, inFact;
private final long mod;
/**
* 1～Nの階乗とその逆元をmodで割ったあまりを事前に計算します。
*
* @param N 計算範囲
* @param mod 法
*/
public Factorial ( int N, long mod ) {
fact = new long[N + 1];
fact[0] = fact[1] = 1;
for ( int i = 2; i <= N; i++ ) {
fact[i] = fact[i - 1] * i % mod;
}
inFact = new long[N + 1];
inFact[N] = MathFunction.modPow( fact[N], mod - 2, mod );
for ( int i = N; i > 0; i-- ) {
inFact[i - 1] = inFact[i] * i % mod;
}
inFact[0] = 1;
this.mod = mod;
}
/**
* num!をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getFact ( int num ) {
return fact[num];
}
/**
* aCbをmodで割ったあまりを返します。
*
* @param a
* @param b
*
* @return aCb
*/
public long getCombi ( int a, int b ) {
if ( a < b || a <= 0 || b <= 0 ) {
throw new IllegalArgumentException( "Factorial's index must be positive" );
}
return ( fact[a] * inFact[a - b] % mod ) * inFact[b] % mod;
}
}
final class ArrayFunction {
/**
* int型配列をソートします。
*
* @param array ソートする配列
*/
public static void sort ( int[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2] < array[j] ) {
int temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
int temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j] < array[2 * j + 1] ) || ( 2 * j + 2 < i - 1 && array[j] < array[2 * j + 2] ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1] > array[2 * j + 2] ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* int型配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static void sort ( int[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
int[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
int[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* long型配列をソートします。
*
* @param array ソートする配列
*/
public static void sort ( long[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2] < array[j] ) {
long temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
long temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j] < array[2 * j + 1] ) || ( 2 * j + 2 < i - 1 && array[j] < array[2 * j + 2] ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1] > array[2 * j + 2] ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* long型配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static void sort ( long[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
long[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
long[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* 比較可能なクラスの配列をソートします。
*
* @param array ソートする配列
*/
public static <E extends Comparable<E>> void sort ( E[] array ) {
for ( int i = 0; i < array.length; i++ ) {
int j = i;
while ( j > 0 && array[( j - 1 ) / 2].compareTo( array[j] ) < 0 ) {
E temp = array[( j - 1 ) / 2];
array[( j - 1 ) / 2] = array[j];
array[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = array.length; i > 0; i-- ) {
E temp = array[i - 1];
array[i - 1] = array[0];
array[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && array[j].compareTo( array[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && array[j].compareTo( array[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || array[2 * j + 1].compareTo( array[2 * j + 2] ) > 0 ) {
temp = array[2 * j + 1];
array[2 * j + 1] = array[j];
array[j] = temp;
j <<= 1;
j++;
}
else {
temp = array[2 * j + 2];
array[2 * j + 2] = array[j];
array[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* 比較可能なクラスの配列をソートします。
* 序列は配列を一つの文字列として見たときの辞書順と等しいです。
*
* @param arrays ソートする配列
*/
public static <E extends Comparable<E>> void sort ( E[][] arrays ) {
for ( int i = 0; i < arrays.length; i++ ) {
int j = i;
while ( j > 0 && compare( arrays[( j - 1 ) / 2], arrays[j] ) < 0 ) {
E[] temp = arrays[( j - 1 ) / 2];
arrays[( j - 1 ) / 2] = arrays[j];
arrays[j] = temp;
j = ( j - 1 ) / 2;
}
}
for ( int i = arrays.length; i > 0; i-- ) {
E[] temp = arrays[i - 1];
arrays[i - 1] = arrays[0];
arrays[0] = temp;
int j = 0;
while ( ( 2 * j + 1 < i - 1 && compare( arrays[j], arrays[2 * j + 1] ) < 0 ) ||
( 2 * j + 2 < i - 1 && compare( arrays[j], arrays[2 * j + 2] ) < 0 ) ) {
if ( 2 * j + 2 == i - 1 || compare( arrays[2 * j + 1], arrays[2 * j + 2] ) > 0 ) {
temp = arrays[2 * j + 1];
arrays[2 * j + 1] = arrays[j];
arrays[j] = temp;
j <<= 1;
j++;
}
else {
temp = arrays[2 * j + 2];
arrays[2 * j + 2] = arrays[j];
arrays[j] = temp;
j <<= 1;
j += 2;
}
}
}
}
/**
* int型配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static int compare ( int[] a, int[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
if ( a[i] > b[i] ) {
return 1;
}
if ( a[i] < b[i] ) {
return -1;
}
}
return Integer.compare( a.length, b.length );
}
/**
* long型配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static int compare ( long[] a, long[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
if ( a[i] > b[i] ) {
return 1;
}
if ( a[i] < b[i] ) {
return -1;
}
}
return Integer.compare( a.length, b.length );
}
/**
* 比較可能なクラスの配列を比較します。
*
* @param a
* @param b
*
* @return a.compareTo(b)として想定されるint型戻り値
*/
private static <E extends Comparable<E>> int compare ( E[] a, E[] b ) {
int len = Math.min( a.length, b.length );
for ( int i = 0; i < len; i++ ) {
int result = a[i].compareTo( b[i] );
if ( result != 0 ) {
return result;
}
}
return Integer.compare( a.length, b.length );
}
/**
* カウントソートによるソートです。
* 各要素が0以上であり最大値が十分小さい時はこちらの使用を推奨します。
*
* @param array ソート対象のint型配列
* @param maximumLimit array内の最大要素
*/
public static void countSort ( int[] array, int maximumLimit ) {
int[] list = new int[maximumLimit + 1];
for ( int num: array ) {
list[num]++;
}
int temp = 0;
for ( int i = 0; i < list.length; i++ ) {
for ( int j = 0; j < list[i]; j++ ) {
array[temp++] = i;
}
}
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より小さい要素を探します。
* リスト内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( int[] array, int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( long[] array, long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( double[] array, double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( E[] array, E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より大きい要素を探します。
* リスト内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( List<E> list, E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array, boolean include ) {
int[] list = new int[array.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int num: array ) {
int index = include ? overSearch( list, num ) : upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p, boolean include ) {
int[] list = new int[arrays.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int[] array: arrays ) {
int index = include ? overSearch( list, array[p] ) : upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array, boolean include ) {
long[] list = new long[array.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long num: array ) {
int index = include ? overSearch( list, num ) : upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p, boolean include ) {
long[] list = new long[arrays.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long[] array: arrays ) {
int index = include ? overSearch( list, array[p] ) : upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値はint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( ArrayList<ArrayList<Integer>> route ) {
int[] count = new int[route.size()];
int pathCount = 0;
for ( ArrayList<Integer> path: route ) {
for ( int point: path ) {
pathCount++;
count[point]++;
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; i++ ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( int nextP: route.get( nowP ) ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値はint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( int[][] route ) {
int[] count = new int[route.length];
int pathCount = 0;
for ( int[] path: route ) {
for ( int point: path ) {
pathCount++;
count[point]++;
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; i++ ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( int nextP: route[nowP] ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
}
final class MathFunction {
/**
* aとbの最大公約数を求めます。
*
* @param a
* @param b
*
* @return aとbの最大公約数
*/
public static long gcd ( long a, long b ) {
a = Math.abs( a );
b = Math.abs( b );
if ( b == 0 ) {
return a;
}
long temp;
while ( ( temp = a % b ) != 0 ) {
a = b;
b = temp;
}
return b;
}
/**
* aとbの最小公倍数を求めます。
* オーバーフロー検知は出来ません。
*
* @param a
* @param b
*
* @return aとbの最小公倍数
*/
public static long lcm ( long a, long b ) {
return a / gcd( a, b ) * b;
}
/**
* 引数が素数か判定します。
* 合成数を誤判定する確率は1/2^20以下です。
*
* @param num 検査対象
*
* @return numが素数である可能性があるならtrue、確実に合成数ならfalse
*/
public static boolean isPrime ( long num ) {
return BigInteger.valueOf( num ).isProbablePrime( 20 );
}
/**
* num以下の素数を列挙します。
*
* @param num 素数を探す上限値
*
* @return num以下の素数のint型配列
*/
public static int[] primes ( int num ) {
BitSet numbers = new BitSet( num + 1 );
numbers.set( 2, num + 1 );
for ( int i = 2; i <= Math.sqrt( num ); i++ ) {
if ( numbers.get( i ) ) {
for ( int j = i * i; j <= num; j += i ) {
numbers.clear( j );
}
}
}
int[] answer = new int[numbers.cardinality()];
int i = 2, index = 0;
do {
i = numbers.nextSetBit( i );
answer[index++] = i++;
} while ( index != answer.length );
return answer;
}
/**
* a**bを計算します。
*
* @param a
* @param b
*
* @return a**b
*/
public static long pow ( long a, long b ) {
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
a *= a;
b >>= 1;
}
return ans;
}
/**
* a**bをmodで割ったあまりを計算します。
*
* @param a
* @param b
* @param mod
*
* @return a**bをmodで割ったあまり
*/
public static long modPow ( long a, long b, long mod ) {
long ans = 1;
a %= mod;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
ans %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
/**
* nCrを計算します。
*
* @param n
* @param r
*
* @return nCr
*/
public static long combi ( long n, long r ) {
long ans = 1;
if ( r <= 0 || n < r ) {
throw new IllegalArgumentException( "index is illegal:(" + n + "," + r + ")" );
}
r = Math.min( n - r, r );
for ( int i = 0; i < r; i++ ) {
ans *= n - i;
ans /= i + 1;
}
return ans;
}
/**
* nCrをmodで割ったあまりを計算します。
*
* @param n
* @param r
* @param mod
*
* @return nCrをmodで割ったあまり
*/
public static long modCombi ( long n, long r, long mod ) {
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; i++ ) {
ans *= n - i;
ans %= mod;
ans *= modPow( i + 1, mod - 2, mod );
ans %= mod;
}
return ans;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param x1
* @param y1
* @param x2
* @param y2
* @param x3
* @param y3
* @param x4
* @param y4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4 ) {
double s1 = ( x1 - x2 ) * ( y3 - y1 ) - ( y1 - y2 ) * ( x3 - x1 );
double t1 = ( x1 - x2 ) * ( y4 - y1 ) - ( y1 - y2 ) * ( x4 - x1 );
double s2 = ( x3 - x4 ) * ( y1 - y3 ) - ( y3 - y4 ) * ( x1 - x3 );
double t2 = ( x3 - x4 ) * ( y2 - y3 ) - ( y3 - y4 ) * ( x2 - x3 );
double temp1 = s1 * t1;
double temp2 = s2 * t2;
if ( temp1 > 0 || temp2 > 0 ) {
return -1;
}
if ( temp1 == 0 && temp2 == 0 ) {
return 0;
}
return 1;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param p1
* @param p2
* @param p3
* @param p4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( Point p1, Point p2, Point p3, Point p4 ) {
return isCrossed( p1.x, p1.y, p2.x, p2.y, p3.x, p3.y, p4.x, p4.y );
}
/**
* 指定された頂点を順に結んで出来上がる多角形が凸多角形か判定します。
*
* @param points 多角形を構成する点
*
* @return 多角形が凸多角形ならtrue
*/
public static boolean isConvex ( Point... points ) {
int n = points.length;
if ( n < 3 ) {
return false;
}
if ( n == 3 ) {
return true;
}
boolean conv = true;
for ( int i = 0; i < n; i++ ) {
int result = isCrossed( points[i], points[( i + 2 ) % n], points[( i + 1 ) % n], points[( i + 1 + n / 2 ) % n] );
conv &= result >= 0;
}
return conv;
}
}
final class Converter {
/**
* Stringをintに変換します。
*
* @param str 変換対象
*
* @return 変換結果
*/
public static int parseInt ( String str ) {
char[] array = str.toCharArray();
int ans = 0;
boolean plus = true;
if ( array[0] == '-' ) {
plus = false;
array[0] = '0';
}
for ( char num: array ) {
ans = ans * 10 + num - '0';
}
return plus ? ans : -ans;
}
/**
* Stringをlongに変換します。
*
* @param str 変換対象
*
* @return 変換結果
*/
public static long parseLong ( String str ) {
char[] array = str.toCharArray();
long ans = 0;
boolean plus = true;
if ( array[0] == '-' ) {
plus = false;
array[0] = '0';
}
for ( char c: array ) {
ans = ans * 10 + c - '0';
}
return plus ? ans : -ans;
}
}
// Binary Indexed Tree
final class BIT {
final int size;
final long[] tree;
public BIT ( int n ) {
size = n;
tree = new long[n + 1];
}
public long sum ( int i ) {
long sum = 0;
while ( i > 0 ) {
sum += tree[i];
i -= i & ( -i );
}
return sum;
}
public void add ( int i, long x ) {
while ( i <= size ) {
tree[i] += x;
i += i & ( -i );
}
}
}
// Bit Set
final class Bitset implements Cloneable {
private final long[] bit;
private final int size, len;
private final long MASK;
public Bitset ( final int len ) {
this.len = len;
size = ( len + 63 ) >> 6;
bit = new long[size];
MASK = ( -1L ) >>> ( ( size << 6 ) - len );
}
public void set ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
bit[index >> 6] |= ( 1L << ( index & 0b111111 ) );
}
public void clear ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
long m = ~( 1L << ( index & 0b111111 ) );
bit[index >> 6] &= m;
}
public boolean get ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
return ( bit[index >> 6] & ( 1L << ( index & 0b111111 ) ) ) != 0;
}
public void shiftLeft ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = size - 1; i >= n; i-- ) {
bit[i] = ( bit[i - n] << num ) | ( i != n && num != 0 ? bit[i - n - 1] >>> ( 64 - num ) : 0L );
}
for ( int i = 0; i < n; i++ ) {
bit[i] = 0L;
}
bit[size - 1] &= MASK;
}
public void shiftRight ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = 0; i < size - n; i++ ) {
bit[i] = ( bit[i + n] >>> num ) | ( i + n + 1 != size && num != 0 ? bit[i + n + 1] << ( 64 - num ) : 0L );
}
for ( int i = size - 1; i >= size - n; i-- ) {
bit[i] = 0L;
}
}
public long[] longValues () {
return bit;
}
public long longValue () {
return bit[0];
}
public void and ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] &= bit2[i];
}
for ( int i = m; i < size; i++ ) {
bit[i] = 0;
}
bit[size - 1] &= MASK;
}
public void or ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] |= bit2[i];
}
bit[size - 1] &= MASK;
}
public void xor ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; i++ ) {
bit[i] ^= bit2[i];
}
bit[size - 1] &= MASK;
}
public Bitset clone () throws CloneNotSupportedException {
super.clone();
final Bitset b = new Bitset( len );
b.or( this );
return b;
}
}
// Segment Tree
abstract class SegmentTree<E> {
int N, size;
E def;
Object[] node;
public SegmentTree ( int n, E def, boolean include ) {
N = 2;
size = 1;
while ( N < n << 1 ) {
N <<= 1;
size <<= 1;
}
size -= include ? 1 : 0;
node = new Object[N];
this.def = def;
Arrays.fill( node, this.def );
}
public SegmentTree ( int n, E def ) {
this( n, def, false );
}
@SuppressWarnings( "unchecked" )
public void update ( int n, E value ) {
n += size;
node[n] = value;
n >>= 1;
while ( n > 0 ) {
node[n] = function( ( E )node[n << 1], ( E )node[( n << 1 ) + 1] );
n >>= 1;
}
}
@SuppressWarnings( "unchecked" )
public E get ( int a ) {
return ( E )node[a + size];
}
@SuppressWarnings( "unchecked" )
public E answer () {
return ( E )node[1];
}
@SuppressWarnings( "unchecked" )
public E query ( int l, int r ) {
l += size;
r += size;
E answer = def;
while ( l > 0 && r > 0 && l <= r ) {
if ( l % 2 == 1 ) {
answer = function( ( E )node[l++], answer );
}
l >>= 1;
if ( r % 2 == 0 ) {
answer = function( answer, ( E )node[r--] );
}
r >>= 1;
}
return answer;
}
abstract public E function ( E a, E b );
}
// Union Find
final class UnionFind {
private final int[] par, rank, size;
private int count;
public UnionFind ( int N ) {
count = N;
par = new int[N];
rank = new int[N];
size = new int[N];
Arrays.fill( par, -1 );
Arrays.fill( size, 1 );
}
public int root ( int x ) {
if ( par[x] == -1 ) {
return x;
}
else {
return par[x] = root( par[x] );
}
}
public boolean isSame ( int x, int y ) {
return root( x ) == root( y );
}
public boolean unite ( int x, int y ) {
int rx = root( x );
int ry = root( y );
if ( rx == ry ) {
return false;
}
if ( rank[rx] < rank[ry] ) {
int temp = rx;
rx = ry;
ry = temp;
}
par[ry] = rx;
if ( rank[rx] == rank[ry] ) {
++rank[rx];
}
size[rx] += size[ry];
--count;
return true;
}
public int groupCount () {
return count;
}
public int size ( int x ) {
return size[root( x )];
}
}
// Rolling Hash
final class RollingHash implements Comparable<RollingHash> {
private static final int base = 100;
private static final int mod1 = 1_000_000_007;
private static final int mod2 = Integer.MAX_VALUE - 1;
private long[] hash1, hash2;
private String string;
public RollingHash ( String str ) {
string = str;
hash1 = new long[str.length() + 1];
hash2 = new long[str.length() + 1];
roll();
}
private void roll () {
int len = string.length();
for ( int i = 1; i <= len; i++ ) {
hash1[i] = hash1[i - 1] * base + string.charAt( i - 1 ) - ' ' + 1;
hash2[i] = hash2[i - 1] * base + string.charAt( i - 1 ) - ' ' + 1;
hash1[i] %= mod1;
hash2[i] %= mod2;
}
}
public long getHash1 ( int l, int r ) {
return ( hash1[r] - hash1[l] * modPow( base, r - l, mod1 ) % mod1 + mod1 ) % mod1;
}
public long getHash2 ( int l, int r ) {
return ( hash2[r] - hash2[l] * modPow( base, r - l, mod2 ) % mod2 + mod2 ) % mod2;
}
private long modPow ( long a, long b, long mod ) {
a %= mod;
b %= mod - 1;
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
ans %= mod;
}
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
public boolean equals ( RollingHash rh, int l1, int r1, int l2, int r2 ) {
if ( r1 - l1 != r2 - l2 ) {
return false;
}
long hashValue1 = getHash1( l1, r1 );
long hashValue2 = getHash2( l1, r1 );
return hashValue1 == rh.getHash1( l2, r2 )
&& hashValue2 == rh.getHash2( l2, r2 )
&& check( rh, l1, l2, r1 - l1 );
}
private boolean check ( RollingHash rh, int l1, int l2, int len ) {
return check( rh.toString(), l1, l2, len );
}
private boolean check ( String str, int l1, int l2, int len ) {
for ( int i = 0; i < len; i++ ) {
if ( string.charAt( l1 + i ) != str.charAt( l2 + i ) ) {
return false;
}
}
return true;
}
public int length () {
return string.length();
}
@Override
public int hashCode () {
return string.hashCode();
}
@Override
public String toString () {
return string;
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof RollingHash ) {
RollingHash rh = ( RollingHash )o;
return equals( rh, 1, length(), 1, rh.length() );
}
return false;
}
@Override
public int compareTo ( RollingHash rh ) {
return string.compareTo( rh.toString() );
}
public int compareTo ( String str ) {
return string.compareTo( str );
}
public char charAt ( int i ) {
return string.charAt( i );
}
public int compareToIgnoreCase ( RollingHash rh ) {
return string.compareToIgnoreCase( rh.toString() );
}
public int compareToIgnoreCase ( String str ) {
return string.compareToIgnoreCase( str );
}
public void concat ( RollingHash rh ) {
concat( rh.toString() );
}
public void concat ( String str ) {
string = string.concat( str );
hash1 = new long[string.length() + 1];
hash2 = new long[string.length() + 1];
roll();
}
public boolean contains ( RollingHash rh ) {
long hash1 = rh.getHash1( 0, rh.length() );
long hash2 = rh.getHash2( 0, rh.length() );
boolean isContain = false;
int len = length() - rh.length();
for ( int i = 0; i <= len; i++ ) {
if ( hash1 == getHash1( i, rh.length() + i )
&& hash2 == getHash2( i, rh.length() + i ) ) {
isContain |= check( rh, i, 0, rh.length() );
}
}
return isContain;
}
public boolean contains ( String str ) {
return indexOf( str ) != -1;
}
public int indexOf ( int ch ) {
return indexOf( ch, 0 );
}
public int indexOf ( int ch, int fromIndex ) {
int len = length();
for ( int i = fromIndex; i < len; i++ ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int indexOf ( String str ) {
return indexOf( str, 0 );
}
public int indexOf ( String str, int fromIndex ) {
long hash1 = 0;
long hash2 = 0;
for ( char c: str.toCharArray() ) {
hash1 = hash1 * base + c - ' ' + 1;
hash2 = hash2 * base + c - ' ' + 1;
hash1 %= mod1;
hash2 %= mod2;
}
int len = length() - str.length();
for ( int i = fromIndex; i <= len; i++ ) {
if ( hash1 == getHash1( i, str.length() + i )
&& hash2 == getHash2( i, str.length() + i )
&& check( str, i, 0, str.length() ) ) {
return i;
}
}
return -1;
}
public boolean isEmpty () {
return length() == 0;
}
public int lastIndexOf ( int ch, int fromIndex ) {
for ( int i = fromIndex; i >= 0; i-- ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int lastIndexOf ( int ch ) {
return lastIndexOf( ch, length() - 1 );
}
public static RollingHash valueOf ( boolean b ) {
return new RollingHash( b ? "true" : "false" );
}
public static RollingHash valueOf ( char c ) {
return new RollingHash( "" + c );
}
public static RollingHash valueOf ( char[] c ) {
return new RollingHash( String.valueOf( c, 0, c.length ) );
}
public static RollingHash valueOf ( char[] c, int offset, int count ) {
return new RollingHash( String.valueOf( c, offset, count ) );
}
public static RollingHash valueOf ( double d ) {
return new RollingHash( String.valueOf( d ) );
}
public static RollingHash valueOf ( float f ) {
return new RollingHash( String.valueOf( f ) );
}
public static RollingHash valueOf ( int i ) {
return new RollingHash( String.valueOf( i ) );
}
public static RollingHash valueOf ( long l ) {
return new RollingHash( String.valueOf( l ) );
}
public static RollingHash valueOf ( Object obj ) {
return new RollingHash( String.valueOf( obj ) );
}
}
// Pair
class Pair<K extends Comparable<K>, V extends Comparable<V>>
implements Comparable<Pair<K, V>> {
private AbstractMap.SimpleEntry<K, V> map;
public Pair ( K key, V value ) {
map = new AbstractMap.SimpleEntry<>( key, value );
}
public K getKey () {
return map.getKey();
}
public V getValue () {
return map.getValue();
}
public K setKey ( K key ) {
K oldKey = map.getKey();
V value = map.getValue();
map = new AbstractMap.SimpleEntry<>( key, value );
return oldKey;
}
public V setValue ( V value ) {
return map.setValue( value );
}
@Override
public int compareTo ( Pair<K, V> pair ) {
int com = getKey().compareTo( pair.getKey() );
return com != 0 ? com : getValue().compareTo( pair.getValue() );
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof Pair<?, ?> ) {
Pair<?, ?> pair = ( Pair<?, ?> )o;
return getKey().equals( pair.getKey() ) && getValue().equals( pair.getValue() );
}
return false;
}
@Override
public String toString () {
return getKey() + "=" + getValue();
}
@Override
public int hashCode () {
return ( getKey().hashCode() << 2 ) ^ ( getValue().hashCode() );
}
}
//AVL Tree
final class AVLTree_Int {
private Node root;
private int size, hash;
public AVLTree_Int () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
int height,size;
Node left, right, parent;
public Node ( final Node p, final int v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final int x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public int get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public int getIndex ( int value ) {
if ( root == null ) {
return -1;
}
int ans = 0;
Node now = root;
while ( now != null ) {
if ( value < now.value ) {
now = now.left;
}
else if ( value > now.value ) {
ans += now.left != null ? now.left.size + 1 : 1;
now = now.right;
}
else {
ans += now.left != null ? now.left.size : 0;
return ans;
}
}
return ~ans;
}
public boolean remove ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public int ceiling ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] list = new int[size];
if ( root != null ) {
int index = 0;
java.util.ArrayDeque<Node> deq = new java.util.ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toArray();
return java.util.Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Int ) {
final AVLTree_Int tree = ( AVLTree_Int )o;
if ( size == tree.size() ) {
return false;
}
final int[] array1 = toArray();
final int[] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( Node node ) {
int lh = node.left != null ? node.left.height : 0;
int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
int ls = node.left != null ? node.left.size : 0;
int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class AVLTree_Long {
private Node root;
private int size, hash;
public AVLTree_Long () {
size = 0;
root = null;
hash = 0;
}
private static final class Node {
long value;
int height;
Node left, right, parent;
public Node ( final Node p, final long v ) {
value = v;
height = 1;
parent = p;
}
}
public boolean add ( final long x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public long ceiling ( final long x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long floor ( final long x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int size () {
return size;
}
public long[] toArray () {
final long[] list = new long[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Long ) {
final AVLTree_Long tree = ( AVLTree_Long )o;
if ( size == tree.size() ) {
return false;
}
final long[] array1 = toArray();
final long[] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
final int h = node.height;
setHeight( node );
if ( h == node.height ) {
break;
}
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setHeight( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setHeight( node );
}
private void setHeight ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
}
}
//Red-Black Tree
final class RedBlackTree {
private int size;
private Entry root;
public RedBlackTree () {
size = 0;
root = null;
}
public int size () {
return size;
}
public boolean contains ( final long key ) {
return getEntry( key ) != null;
}
private Entry getEntry ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
p = p.left;
}
else if ( key > p.getValue() ) {
p = p.right;
}
else {
return p;
}
}
return null;
}
public long ceiling ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
return p.getValue();
}
}
else if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.right ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key - 1;
}
}
else {
return key;
}
}
return key - 1;
}
public long floor ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
return p.getValue();
}
}
else if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.left ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key + 1;
}
}
else {
return p.getValue();
}
}
return key + 1;
}
public long higher ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key < p.getValue() ) {
if ( p.left != null ) {
p = p.left;
}
else {
return p.getValue();
}
}
else {
if ( p.right != null ) {
p = p.right;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.right ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key - 1;
}
}
}
return key - 1;
}
public long lower ( final long key ) {
Entry p = root;
while ( p != null ) {
if ( key > p.getValue() ) {
if ( p.right != null ) {
p = p.right;
}
else {
return p.getValue();
}
}
else {
if ( p.left != null ) {
p = p.left;
}
else {
Entry parent = p.parent;
Entry ch = p;
while ( parent != null && ch == parent.left ) {
ch = parent;
parent = parent.parent;
}
return parent != null ? parent.getValue() : key + 1;
}
}
}
return key + 1;
}
private void addEntry ( final long key, final Entry parent, final boolean addToLeft ) {
final Entry e = new Entry( key, parent );
if ( addToLeft ) {
parent.left = e;
}
else {
parent.right = e;
}
fixAfterInsertion( e );
size++;
}
private void addEntryToEmptySet ( final long key ) {
root = new Entry( key, null );
size = 1;
}
public boolean add ( final long key ) {
Entry t = root;
if ( t == null ) {
addEntryToEmptySet( key );
return true;
}
Entry parent;
do {
parent = t;
if ( key < parent.getValue() ) {
t = t.left;
}
else if ( key > parent.getValue() ) {
t = t.right;
}
else {
return false;
}
} while ( t != null );
addEntry( key, parent, key < parent.getValue() );
return true;
}
public boolean remove ( final long key ) {
final Entry p = getEntry( key );
if ( p == null ) {
return false;
}
deleteEntry( p );
return true;
}
public void clear () {
size = 0;
root = null;
}
private static final boolean RED = false;
private static final boolean BLACK = true;
private static final class Entry {
private long value;
private Entry left;
private Entry right;
private Entry parent;
private boolean color = BLACK;
private Entry ( final long value, final Entry parent ) {
this.value = value;
this.parent = parent;
}
private long getValue () {
return value;
}
public boolean equals ( final Object o ) {
if ( !( o instanceof Entry ) ) {
return false;
}
final Entry e = ( Entry )o;
return value == e.getValue();
}
public int hashCode () {
return Long.hashCode( value );
}
public String toString () {
return String.valueOf( value );
}
}
public long first () {
Entry p = root;
if ( p != null ) {
while ( p.left != null ) {
p = p.left;
}
}
else {
throw new NullPointerException();
}
return p.getValue();
}
public long last () {
Entry p = root;
if ( p != null ) {
while ( p.right != null ) {
p = p.right;
}
}
else {
throw new NullPointerException();
}
return p.getValue();
}
private static Entry successor ( final Entry t ) {
if ( t == null ) {
return null;
}
else if ( t.right != null ) {
Entry p = t.right;
while ( p.left != null ) {
p = p.left;
}
return p;
}
else {
Entry p = t.parent;
Entry ch = t;
while ( p != null && ch == p.right ) {
ch = p;
p = p.parent;
}
return p;
}
}
private static boolean colorOf ( final Entry p ) {
return ( p == null ? BLACK : p.color );
}
private static Entry parentOf ( final Entry p ) {
return ( p == null ? null : p.parent );
}
private static void setColor ( final Entry p, final boolean c ) {
if ( p != null ) {
p.color = c;
}
}
private static Entry leftOf ( final Entry p ) {
return ( p == null ) ? null : p.left;
}
private static Entry rightOf ( final Entry p ) {
return ( p == null ) ? null : p.right;
}
private void rotateLeft ( final Entry p ) {
if ( p != null ) {
final Entry r = p.right;
p.right = r.left;
if ( r.left != null ) {
r.left.parent = p;
}
r.parent = p.parent;
if ( p.parent == null ) {
root = r;
}
else if ( p.parent.left == p ) {
p.parent.left = r;
}
else {
p.parent.right = r;
}
r.left = p;
p.parent = r;
}
}
private void rotateRight ( final Entry p ) {
if ( p != null ) {
final Entry l = p.left;
p.left = l.right;
if ( l.right != null ) {
l.right.parent = p;
}
l.parent = p.parent;
if ( p.parent == null ) {
root = l;
}
else if ( p.parent.right == p ) {
p.parent.right = l;
}
else {
p.parent.left = l;
}
l.right = p;
p.parent = l;
}
}
private void fixAfterInsertion ( Entry x ) {
x.color = RED;
while ( x != null && x != root && x.parent.color == RED ) {
if ( parentOf( x ) == leftOf( parentOf( parentOf( x ) ) ) ) {
final Entry y = rightOf( parentOf( parentOf( x ) ) );
if ( colorOf( y ) == RED ) {
setColor( parentOf( x ), BLACK );
setColor( y, BLACK );
setColor( parentOf( parentOf( x ) ), RED );
x = parentOf( parentOf( x ) );
}
else {
if ( x == rightOf( parentOf( x ) ) ) {
x = parentOf( x );
rotateLeft( x );
}
setColor( parentOf( x ), BLACK );
setColor( parentOf( parentOf( x ) ), RED );
rotateRight( parentOf( parentOf( x ) ) );
}
}
else {
final Entry y = leftOf( parentOf( parentOf( x ) ) );
if ( colorOf( y ) == RED ) {
setColor( parentOf( x ), BLACK );
setColor( y, BLACK );
setColor( parentOf( parentOf( x ) ), RED );
x = parentOf( parentOf( x ) );
}
else {
if ( x == leftOf( parentOf( x ) ) ) {
x = parentOf( x );
rotateRight( x );
}
setColor( parentOf( x ), BLACK );
setColor( parentOf( parentOf( x ) ), RED );
rotateLeft( parentOf( parentOf( x ) ) );
}
}
}
root.color = BLACK;
}
private void deleteEntry ( Entry p ) {
size--;
if ( p.left != null && p.right != null ) {
final Entry s = successor( p );
p.value = s.value;
p = s;
}
final Entry replacement = ( p.left != null ? p.left : p.right );
if ( replacement != null ) {
replacement.parent = p.parent;
if ( p.parent == null ) {
root = replacement;
}
else if ( p == p.parent.left ) {
p.parent.left = replacement;
}
else {
p.parent.right = replacement;
}
p.left = p.right = p.parent = null;
if ( p.color == BLACK ) {
fixAfterDeletion( replacement );
}
}
else if ( p.parent == null ) {
root = null;
}
else {
if ( p.color == BLACK ) {
fixAfterDeletion( p );
}
if ( p.parent != null ) {
if ( p == p.parent.left ) {
p.parent.left = null;
}
else if ( p == p.parent.right ) {
p.parent.right = null;
}
p.parent = null;
}
}
}
private void fixAfterDeletion ( Entry x ) {
while ( x != root && colorOf( x ) == BLACK ) {
if ( x == leftOf( parentOf( x ) ) ) {
Entry sib = rightOf( parentOf( x ) );
if ( colorOf( sib ) == RED ) {
setColor( sib, BLACK );
setColor( parentOf( x ), RED );
rotateLeft( parentOf( x ) );
sib = rightOf( parentOf( x ) );
}
if ( colorOf( leftOf( sib ) ) == BLACK &&
colorOf( rightOf( sib ) ) == BLACK ) {
setColor( sib, RED );
x = parentOf( x );
}
else {
if ( colorOf( rightOf( sib ) ) == BLACK ) {
setColor( leftOf( sib ), BLACK );
setColor( sib, RED );
rotateRight( sib );
sib = rightOf( parentOf( x ) );
}
setColor( sib, colorOf( parentOf( x ) ) );
setColor( parentOf( x ), BLACK );
setColor( rightOf( sib ), BLACK );
rotateLeft( parentOf( x ) );
x = root;
}
}
else {
Entry sib = leftOf( parentOf( x ) );
if ( colorOf( sib ) == RED ) {
setColor( sib, BLACK );
setColor( parentOf( x ), RED );
rotateRight( parentOf( x ) );
sib = leftOf( parentOf( x ) );
}
if ( colorOf( rightOf( sib ) ) == BLACK &&
colorOf( leftOf( sib ) ) == BLACK ) {
setColor( sib, RED );
x = parentOf( x );
}
else {
if ( colorOf( leftOf( sib ) ) == BLACK ) {
setColor( rightOf( sib ), BLACK );
setColor( sib, RED );
rotateLeft( sib );
sib = leftOf( parentOf( x ) );
}
setColor( sib, colorOf( parentOf( x ) ) );
setColor( parentOf( x ), BLACK );
setColor( leftOf( sib ), BLACK );
rotateRight( parentOf( x ) );
x = root;
}
}
}
setColor( x, BLACK );
}
public long[] toArray () {
index = 0;
return search( new long[size], root );
}
@Override
public String toString () {
return Arrays.toString( toArray() );
}
private int index;
private long[] search ( final long[] array, final Entry now ) {
if ( now == null ) {
return array;
}
search( array, now.left );
array[index++] = now.getValue();
search( array, now.right );
return array;
}
}
//AVL木(multi_set)
final class AVLTree_Multi_Int {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public AVLTree_Multi_Int () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final int v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final int x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
uniqueSize++;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count++;
break;
}
} while ( now != null );
if ( bool ) {
uniqueSize++;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= ( int )x;
}
public void add ( final int x , final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
uniqueSize++;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
uniqueSize++;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
++size;
hash ^= ( int )x;
}
public int get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
delete( n );
return true;
}
public long removeAll ( final int x ) {
Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
long ans = n.count;
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
node.count--;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
uniqueSize--;
}
else {
if ( node.left != null && node.right != null ) {
Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final int x ) {
if ( root == null ) {
return 0;
}
Node node = getNode( x );
return node != null ? node.count : 0;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
delete( min );
hash ^= ( int )min.value;
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
delete( max );
hash ^= ( int )max.value;
return max.value;
}
public int ceiling ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return ceiling( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
if ( root == null ) {
throw new NullPointerException();
}
return floor( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
java.util.ArrayDeque<Node> deq = new java.util.ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[][] list = toArray();
return java.util.Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof AVLTree_Multi_Int ) {
final AVLTree_Multi_Int tree = ( AVLTree_Multi_Int )o;
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; i++ ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( Node node ) {
int lh = node.left != null ? node.left.height : 0;
int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
long ls = node.left != null ? node.left.size : 0;
long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
public Node getRoot () {
return root;
}
}
//Matrix
final class Matrix {
private final long[][] matrix;
public Matrix ( final int H, final int W, final long def ) {
matrix = new long[H][W];
if ( def != 0 ) {
for ( long[] mat: matrix ) {
Arrays.fill( mat, def );
}
}
}
public Matrix ( final int H, final int W ) {
this( H, W, 0 );
}
public Matrix ( final Dimension d, final long def ) {
this( d.height, d.width, def );
}
public Matrix ( final long[][] mat ) {
matrix = new long[mat.length][];
for ( int i = 0; i < mat.length; i++ ) {
matrix[i] = Arrays.copyOf( mat[i], mat[i].length );
}
}
public long get ( final int i, final int j ) {
return matrix[i][j];
}
public long set ( final int i, final int j, final long value ) {
return matrix[i][j] = value;
}
public Matrix copy () {
return new Matrix( matrix );
}
public Dimension size () {
return new Dimension( matrix[0].length, matrix.length );
}
public Matrix add ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, matrix[i][j] + m.get( i, j ) );
}
}
return ans;
}
public Matrix subtract ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, matrix[i][j] - m.get( i, j ) );
}
}
return ans;
}
public Matrix multiply ( final Matrix m ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; i++ ) {
for ( int j = 0; j < size.width; j++ ) {
long sum = 0;
for ( int k = 0; k < len; k++ ) {
sum += matrix[i][k] * m.get( k, j );
}
ans.set( i, j, sum );
}
}
return ans;
}
public Matrix modAdd ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, remainder( matrix[i][j] + m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modSubtract ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; i++ ) {
for ( int j = 0; j < matrix[i].length; j++ ) {
ans.set( i, j, remainder( matrix[i][j] - m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modMultiply ( final Matrix m, final long mod ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; i++ ) {
for ( int j = 0; j < size.width; j++ ) {
long sum = 0;
for ( int k = 0; k < len; k++ ) {
sum = remainder( sum + matrix[i][k] * m.get( k, j ), mod );
}
ans.set( i, j, sum );
}
}
return ans;
}
public static Matrix pow ( final Matrix original, final Matrix pw, long exp ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.multiply( a );
}
b = b.multiply( b );
exp >>= 1;
}
return a;
}
public static Matrix modPow ( final Matrix original, final Matrix pw, long exp, final long mod ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.modMultiply( a, mod );
}
b = b.modMultiply( b, mod );
exp >>= 1;
}
return a;
}
private static long remainder ( long num, final long mod ) {
num %= mod;
if ( num < 0 ) {
num += mod;
}
return num;
}
@Override
public String toString () {
final StringBuilder ans = new StringBuilder();
ans.append( Arrays.toString( matrix[0] ) );
for ( int i = 1; i < matrix.length; i++ ) {
ans.append( "\n" );
ans.append( Arrays.toString( matrix[i] ) );
}
return ans.toString();
}
}
// MyScanner
final class SimpleScanner {
final private int buff_size = 1 << 15;
private final InputStream is;
private final byte[] buff;
private int point, length;
public SimpleScanner ( InputStream is ) {
this.is = is;
buff = new byte[buff_size];
point = length = 0;
}
private void reload () {
do {
try {
length = is.read( buff, point = 0, buff_size );
} catch ( IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
} while ( length == -1 );
}
private byte read () {
if ( point == length ) {
reload();
}
return buff[point++];
}
public byte nextByte () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return c;
}
public int nextInt () {
int ans = 0;
byte c = read();
while ( c <= ' ' ) {
c = read();
}
boolean negate = c == '-';
if ( c == '-' ) {
c = read();
}
while ( '0' <= c && c <= '9' ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public long nextLong () {
long ans = 0;
byte c = read();
while ( c <= ' ' ) {
c = read();
}
boolean negate = c == '-';
if ( c == '-' ) {
c = read();
}
while ( '0' <= c && c <= '9' ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public char nextChar () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return ( char )c;
}
public String next () {
StringBuilder ans = new StringBuilder();
byte c = read();
while ( c <= ' ' ) {
c = read();
}
while ( c > ' ' ) {
ans.append( ( char )c );
c = read();
}
return ans.toString();
}
public byte[] nextByte ( int n ) {
byte[] ans = new byte[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextByte();
}
return ans;
}
public int[] nextInt ( int n ) {
int[] ans = new int[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextInt();
}
return ans;
}
public long[] nextLong ( int n ) {
long[] ans = new long[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextLong();
}
return ans;
}
public String[] next ( int n ) {
String[] ans = new String[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = next();
}
return ans;
}
public byte[][] nextByte ( int n, int m ) {
byte[][] ans = new byte[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextByte( m );
}
return ans;
}
public int[][] nextInt ( int n, int m ) {
int[][] ans = new int[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextInt( m );
}
return ans;
}
public long[][] nextLong ( int n, int m ) {
long[][] ans = new long[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextLong( m );
}
return ans;
}
public String[][] next ( int n, int m ) {
String[][] ans = new String[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = next( m );
}
return ans;
}
public char[] nextCharArray () {
return next().toCharArray();
}
public char[][] nextCharArray ( int n ) {
char[][] ans = new char[n][];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextCharArray();
}
return ans;
}
public int[][] nextGraph ( int N, int M ) {
if ( M == 0 ) {
return new int[N + 1][0];
}
int[][] ans = new int[N + 1][];
int[] count = new int[N + 1];
int[][] path = nextInt( M, 2 );
for ( int[] temp: path ) {
count[temp[0]]++;
count[temp[1]]++;
}
for ( int i = 1; i <= N; i++ ) {
ans[i] = new int[count[i]];
}
for ( int[] temp: path ) {
ans[temp[0]][--count[temp[0]]] = temp[1];
ans[temp[1]][--count[temp[1]]] = temp[0];
}
ans[0] = new int[0];
return ans;
}
public Point nextPoint () {
return new Point( nextInt(), nextInt() );
}
public Point[] nextPoint ( int n ) {
Point[] ans = new Point[n];
for ( int i = 0; i < n; i++ ) {
ans[i] = nextPoint();
}
return ans;
}
public void close () {
try {
is.close();
} catch ( IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
}
}
// MyPrinter
final class SimplePrinter extends PrintWriter {
public SimplePrinter ( PrintStream os ) {
super( os );
}
public SimplePrinter ( PrintStream os, boolean bool ) {
super( os, bool );
}
public void println ( int[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public void println ( int[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public void println ( int[][] arrays, String str ) {
for ( int[] array: arrays ) {
println( array, str );
}
}
public void println ( int[][] arrays, char c ) {
for ( int[] array: arrays ) {
println( array, c );
}
}
public void println ( long[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public void println ( long[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public void println ( long[][] arrays, String str ) {
for ( long[] array: arrays ) {
println( array, str );
}
}
public void println ( long[][] arrays, char c ) {
for ( long[] array: arrays ) {
println( array, c );
}
}
public void println ( char[] cs, String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( char[] cs, char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( c );
print( cs[i] );
}
println();
}
public void println ( char[][] cs ) {
for ( char[] c: cs ) {
println( c );
}
}
public void println ( char[][] cs, String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( char[][] cs, char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; i++ ) {
print( c );
print( cs[i] );
}
println();
}
public <E> void println ( E[] array, String str ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( str );
print( array[i] );
}
println();
}
public <E> void println ( E[] array, char c ) {
print( array[0] );
for ( int i = 1; i < array.length; i++ ) {
print( c );
print( array[i] );
}
println();
}
public <E> void println ( E[][] arrays, String str ) {
for ( E[] array: arrays ) {
println( array, str );
}
}
public <E> void println ( E[][] arrays, char c ) {
for ( E[] array: arrays ) {
println( array, c );
}
}
}
| ConDefects/ConDefects/Code/abc299_g/Java/40890630 |
condefects-java_data_252 | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int HH = 21;
int MM = 0;
int addHH = 0;
int addMM = scan.nextInt();
if (addMM > 60) {
addHH = 1;
addMM = addMM - 60;
}
HH = HH + addHH;
MM = MM + addMM;
System.out.print(HH);
if (MM < 10) {
System.out.print(":0");
System.out.print(MM);
} else {
System.out.print(":");
System.out.print(MM);
}
scan.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int HH = 21;
int MM = 0;
int addHH = 0;
int addMM = scan.nextInt();
if (addMM >= 60) {
addHH = 1;
addMM = addMM - 60;
}
HH = HH + addHH;
MM = MM + addMM;
System.out.print(HH);
if (MM < 10) {
System.out.print(":0");
System.out.print(MM);
} else {
System.out.print(":");
System.out.print(MM);
}
scan.close();
}
}
| ConDefects/ConDefects/Code/abc258_a/Java/36490687 |
condefects-java_data_253 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int k = sc.nextInt();
int m = k;
int h = 21;
while(m > 60){
h += m/60;
m = m % 60;
}
System.out.println(String.format("%02d", h) + ":" + String.format("%02d", m));
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
int k = sc.nextInt();
int m = k;
int h = 21;
while(m >= 60){
h += m/60;
m = m % 60;
}
System.out.println(String.format("%02d", h) + ":" + String.format("%02d", m));
}
}
} | ConDefects/ConDefects/Code/abc258_a/Java/46027471 |
condefects-java_data_254 | import java.util.*;
public class Main {
public static void main(String[] args){
//入力の読み込み
Scanner sc = new Scanner(System.in);
int K = sc.nextInt();
int H = 22+(K/60);
String M = (new String(Integer.toString(100+K%60))).substring(1,3);
//計算
String ans = new String(Integer.toString(H)) + ":" + M;
//回答出力
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
//入力の読み込み
Scanner sc = new Scanner(System.in);
int K = sc.nextInt();
int H = 21+(K/60);
String M = (new String(Integer.toString(100+K%60))).substring(1,3);
//計算
String ans = new String(Integer.toString(H)) + ":" + M;
//回答出力
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc258_a/Java/37607320 |
condefects-java_data_255 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.printf("%2d:%2d",(21 + n/60),(n%60));
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
System.out.printf("%2d:%02d",(21 + n/60),(n%60));
}
} | ConDefects/ConDefects/Code/abc258_a/Java/36502222 |
condefects-java_data_256 | 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();
int y = sc.nextInt();
int z = sc.nextInt();
sc.close();
System.out.println((x - y) * (y - z) > 0 ? "Yes" : "No");
}
}
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();
int y = sc.nextInt();
int z = sc.nextInt();
sc.close();
System.out.println((x - z) * (z - y) > 0 ? "Yes" : "No");
}
} | ConDefects/ConDefects/Code/abc352_a/Java/53993578 |
condefects-java_data_257 | import java.util.*;
public class Main {
public static void main( String[] args ){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int x = scan.nextInt();
int y = scan.nextInt();
int z = scan.nextInt();
if((x <= z && z <= y) || (y <= z && z <= x)){
System.out.println("Yes");
}else{
System.out.println("NO");
}
}
}
import java.util.*;
public class Main {
public static void main( String[] args ){
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int x = scan.nextInt();
int y = scan.nextInt();
int z = scan.nextInt();
if((x <= z && z <= y) || (y <= z && z <= x)){
System.out.println("Yes");
}else{
System.out.println("No");
}
}
} | ConDefects/ConDefects/Code/abc352_a/Java/53695200 |
condefects-java_data_258 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int X = Integer.parseInt(sc.next());
int Y = Integer.parseInt(sc.next());
int Z = Integer.parseInt(sc.next());
if(X<=Z&&Z<=Y) {
System.out.print("Yes");
}else {
System.out.print("No");
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int X = Integer.parseInt(sc.next());
int Y = Integer.parseInt(sc.next());
int Z = Integer.parseInt(sc.next());
if(X<=Z&&Z<=Y||Y<=Z&&Z<=X) {
System.out.print("Yes");
}else {
System.out.print("No");
}
}
} | ConDefects/ConDefects/Code/abc352_a/Java/54018378 |
condefects-java_data_259 | import java.util.*;
import java.math.BigDecimal;
import java.math.RoundingMode;
public class Main {
public static void main(String[] args) {
// 入力
Scanner sc = new Scanner(System.in);
BigDecimal num = BigDecimal.valueOf(sc.nextInt());
int keta = Integer.toString(num.intValue()).length();
if(keta<=4){
System.out.println(num);
}else{
BigDecimal decimal = num.setScale(3-keta, RoundingMode.FLOOR);
System.out.println(decimal.intValue());
}
}
}
import java.util.*;
import java.math.BigDecimal;
import java.math.RoundingMode;
public class Main {
public static void main(String[] args) {
// 入力
Scanner sc = new Scanner(System.in);
BigDecimal num = BigDecimal.valueOf(sc.nextInt());
int keta = Integer.toString(num.intValue()).length();
if(keta<=3){
System.out.println(num);
}else{
BigDecimal decimal = num.setScale(3-keta, RoundingMode.FLOOR);
System.out.println(decimal.intValue());
}
}
}
| ConDefects/ConDefects/Code/abc304_b/Java/42880205 |
condefects-java_data_260 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int value = sc.nextInt();
System.out.println(truncate(value));
}
public static String truncate(int n) {
String myValue = String.valueOf(n);
if (n < Math.pow(10, 3)) {
return myValue;
} else if (n >= Math.pow(10, 3) && n < Math.pow(10, 4)) {
myValue = myValue.substring(0, 3) + "0";
} else if (n >= Math.pow(10, 4) && n < Math.pow(10, 5)) {
myValue = myValue.substring(0, 3) + "00";
} else if (n >= Math.pow(10, 5) && n < Math.pow(10, 6)) {
myValue = myValue.substring(0, 3) + "000";
} else if (n >= Math.pow(10, 6) && n < Math.pow(10, 7)) {
myValue = myValue.substring(0, 3) + "0000";
} else if (n >= Math.pow(10, 7) && n < Math.pow(10, 8)) {
myValue = myValue.substring(0, 3) + "00000";
} else if (n >= Math.pow(10, 8) && n < Math.pow(10, 9)) {
myValue = myValue.substring(0, 3) + "00000";
}
return myValue;
}
public static void firstPlayer(Scanner sc) {
int t = sc.nextInt();
int[] ageArr = new int[t];
String[] personArr = new String[t];
int smallest = Integer.MAX_VALUE;
for (int i = 0; i < t; i++) {
String person = sc.next();
int age = sc.nextInt();
ageArr[i] = age;
personArr[i] = person;
}
for (int i = 0; i <= ageArr.length - 1; i++) {
if (ageArr[i] < smallest) {
smallest = ageArr[i];
}
}
for (int i = 0; i <= ageArr.length - 1; i++) {
if (ageArr[i] == smallest) {
for (int j = i; j <= ageArr.length - 1; j++) {
System.out.println(personArr[j]);
}
for (int j = 0; j < i; j++) {
System.out.println(personArr[j]);
}
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int value = sc.nextInt();
System.out.println(truncate(value));
}
public static String truncate(int n) {
String myValue = String.valueOf(n);
if (n < Math.pow(10, 3)) {
return myValue;
} else if (n >= Math.pow(10, 3) && n < Math.pow(10, 4)) {
myValue = myValue.substring(0, 3) + "0";
} else if (n >= Math.pow(10, 4) && n < Math.pow(10, 5)) {
myValue = myValue.substring(0, 3) + "00";
} else if (n >= Math.pow(10, 5) && n < Math.pow(10, 6)) {
myValue = myValue.substring(0, 3) + "000";
} else if (n >= Math.pow(10, 6) && n < Math.pow(10, 7)) {
myValue = myValue.substring(0, 3) + "0000";
} else if (n >= Math.pow(10, 7) && n < Math.pow(10, 8)) {
myValue = myValue.substring(0, 3) + "00000";
} else if (n >= Math.pow(10, 8) && n < Math.pow(10, 9)) {
myValue = myValue.substring(0, 3) + "000000";
}
return myValue;
}
public static void firstPlayer(Scanner sc) {
int t = sc.nextInt();
int[] ageArr = new int[t];
String[] personArr = new String[t];
int smallest = Integer.MAX_VALUE;
for (int i = 0; i < t; i++) {
String person = sc.next();
int age = sc.nextInt();
ageArr[i] = age;
personArr[i] = person;
}
for (int i = 0; i <= ageArr.length - 1; i++) {
if (ageArr[i] < smallest) {
smallest = ageArr[i];
}
}
for (int i = 0; i <= ageArr.length - 1; i++) {
if (ageArr[i] == smallest) {
for (int j = i; j <= ageArr.length - 1; j++) {
System.out.println(personArr[j]);
}
for (int j = 0; j < i; j++) {
System.out.println(personArr[j]);
}
}
}
}
}
| ConDefects/ConDefects/Code/abc304_b/Java/43334649 |
condefects-java_data_261 | // 60 150 400 500
//700 250 160
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int state[] = new int[n];
String s = scanner.next();
int maxIndex=0;
for (int i = 0; i < n; i++) {
state[i] = s.charAt(i) == '0' ? 0 : 1;
if(state[i]==1) {
maxIndex = i;
}
}
System.out.println("maxIndex:"+maxIndex);
String result = "";
int[] ms = new int[n];
for(int i=0;i<=maxIndex ;i++) {
result+="A";
ms[i] = 1;
}
for(int i=maxIndex;i>=0 ;i--) {
if(state[i] == 0 && ms[i] == 1) {
for(int j=i;j>=0;j--) {
result+="B";
ms[j]=0;
}
} else if(state[i] == 1 && ms[i] == 0) {
for(int j=i;j>=0;j--) {
result+="A";
ms[j]=1;
}
}
}
System.out.println(result.length());
System.out.println(result);
}
}
// 60 150 400 500
//700 250 160
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int state[] = new int[n];
String s = scanner.next();
int maxIndex=0;
for (int i = 0; i < n; i++) {
state[i] = s.charAt(i) == '0' ? 0 : 1;
if(state[i]==1) {
maxIndex = i;
}
}
//System.out.println("maxIndex:"+maxIndex);
String result = "";
int[] ms = new int[n];
for(int i=0;i<=maxIndex ;i++) {
result+="A";
ms[i] = 1;
}
for(int i=maxIndex;i>=0 ;i--) {
if(state[i] == 0 && ms[i] == 1) {
for(int j=i;j>=0;j--) {
result+="B";
ms[j]=0;
}
} else if(state[i] == 1 && ms[i] == 0) {
for(int j=i;j>=0;j--) {
result+="A";
ms[j]=1;
}
}
}
System.out.println(result.length());
System.out.println(result);
}
} | ConDefects/ConDefects/Code/arc177_b/Java/53621839 |
condefects-java_data_262 | import java.util.Scanner;
public class Main {
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
int N = scn.nextInt();
int[] lumps = new int[N];
String[] S = scn.next().split( "");
for ( int i = 0; i < N; i++) {
lumps[i] = Integer.parseInt( S[i]);
}
StringBuilder sb = new StringBuilder();
int[] simulation = new int[N];
for ( int j = N - 2; j >= 0; j--) {
if ( lumps[j] == simulation[j]) {
continue;
}
else if ( lumps[j] == 1) {
for ( int k = 0; k <= j; k++) {
simulation[k] = 1;
sb.append( "A");
}
}
else {
for ( int k = 0; k <= j; k++) {
simulation[k] = 0;
sb.append( "B");
}
}
}
System.out.println( sb.length() + "\r" + sb);
}
}
import java.util.Scanner;
public class Main {
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
int N = scn.nextInt();
int[] lumps = new int[N];
String[] S = scn.next().split( "");
for ( int i = 0; i < N; i++) {
lumps[i] = Integer.parseInt( S[i]);
}
StringBuilder sb = new StringBuilder();
int[] simulation = new int[N];
for ( int j = N - 1; j >= 0; j--) {
if ( lumps[j] == simulation[j]) {
continue;
}
else if ( lumps[j] == 1) {
for ( int k = 0; k <= j; k++) {
simulation[k] = 1;
sb.append( "A");
}
}
else {
for ( int k = 0; k <= j; k++) {
simulation[k] = 0;
sb.append( "B");
}
}
}
System.out.println( sb.length() + "\r" + sb);
}
} | ConDefects/ConDefects/Code/arc177_b/Java/53418977 |
condefects-java_data_263 | //Har Har Mahadev
import java.io.*;
public class Main
{
public static void main(String[]args)throws IOException
{
BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(buf.readLine());
char[][]ch=new char[t][t];
for(int i=0;i<t;i++)
{
String s=buf.readLine();
for(int j=0;j<t;j++)
ch[i][j]=s.charAt(j);
}
for(int i=0;i<t;i++)
{
for(int j=0;j<t;j++)
{
if(i==j)continue;
else if((ch[i][j]=='W'&&ch[j][i]!='L')||(ch[i][j]=='L'&&ch[j][i]!='W')||(ch[i][j]!='D'&&ch[j][i]!='D'))
{
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
}
//Har Har Mahadev
import java.io.*;
public class Main
{
public static void main(String[]args)throws IOException
{
BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(buf.readLine());
char[][]ch=new char[t][t];
for(int i=0;i<t;i++)
{
String s=buf.readLine();
for(int j=0;j<t;j++)
ch[i][j]=s.charAt(j);
}
for(int i=0;i<t;i++)
{
for(int j=0;j<t;j++)
{
if(i==j)continue;
else if((ch[i][j]=='W'&&ch[j][i]!='L')||(ch[i][j]=='L'&&ch[j][i]!='W')||(ch[i][j]=='D'&&ch[j][i]!='D'))
{
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
} | ConDefects/ConDefects/Code/abc261_b/Java/36358075 |
condefects-java_data_264 | //Har Har Mahadev
import java.io.*;
public class Main
{
public static void main(String[]args)throws IOException
{
BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(buf.readLine());
char[][]ch=new char[t][t];
for(int i=0;i<t;i++)
{
String s=buf.readLine();
for(int j=0;j<t;j++)
ch[i][j]=s.charAt(j);
}
for(int i=0;i<t;i++)
{
for(int j=0;j<t;j++)
{
if(i==j)continue;
else if((ch[i][j]=='W'&&ch[j][i]!='L')||(ch[i][j]=='L'&&ch[j][i]!='W')||(ch[i][j]!='D'&&ch[j][i]!='D'))
{
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
}
//Har Har Mahadev
import java.io.*;
public class Main
{
public static void main(String[]args)throws IOException
{
BufferedReader buf=new BufferedReader(new InputStreamReader(System.in));
int t=Integer.parseInt(buf.readLine());
char[][]ch=new char[t][t];
for(int i=0;i<t;i++)
{
String s=buf.readLine();
for(int j=0;j<t;j++)
ch[i][j]=s.charAt(j);
}
for(int i=0;i<t;i++)
{
for(int j=0;j<t;j++)
{
if(i==j)continue;
else if((ch[i][j]=='W'&&ch[j][i]!='L')||(ch[i][j]=='L'&&ch[j][i]!='W')||(ch[i][j] == 'D' && ch[i][j] != ch[j][i]))
{
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
} | ConDefects/ConDefects/Code/abc261_b/Java/36357687 |
condefects-java_data_265 | import java.util.Scanner;
public class Main {
public static void main(String [] args) {
try(Scanner scan = new Scanner(System.in)){
int N = Integer.parseInt(scan.next());
String [][] fig = new String [N][N];
String line;
String[] marks;
for(int i = 0; i < N; i++){
line = scan.next();
marks = line.split("");
for(int l = 0; l < marks.length; l++){
fig[i][l] = marks[l];
}
}
for(int i = 0; i < N; i++){
for(int l = 0; l < N; l++){
if(i == l){
continue;
}
if("W".equals(fig[i][l]) && !("L".equals(fig[l][i]))){
System.out.println("incorrect");
return;
}
if("W".equals(fig[l][i]) && !("L".equals(fig[i][l]))){
System.out.println("incorrect");
return;
}
if("D".equals(fig[i][l]) && !("D".equals(fig[l][i]))){
System.out.println("incorrect");
return;
}
if("D".equals(fig[l][i]) && !("D".equals(fig[i][l]))){
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String [] args) {
try(Scanner scan = new Scanner(System.in)){
int N = Integer.parseInt(scan.next());
String [][] fig = new String [N][N];
String line;
String[] marks;
for(int i = 0; i < N; i++){
line = scan.next();
marks = line.split("");
for(int l = 0; l < marks.length; l++){
fig[i][l] = marks[l];
}
}
for(int i = 0; i < N; i++){
for(int l = 0; l < N; l++){
if(i == l){
continue;
}
if("W".equals(fig[i][l]) && !("L".equals(fig[l][i]))){
System.out.println("incorrect");
return;
}
if("L".equals(fig[i][l]) && !("W".equals(fig[l][i]))){
System.out.println("incorrect");
return;
}
if("D".equals(fig[i][l]) && !("D".equals(fig[l][i]))){
System.out.println("incorrect");
return;
}
if("D".equals(fig[l][i]) && !("D".equals(fig[i][l]))){
System.out.println("incorrect");
return;
}
}
}
System.out.println("correct");
}
}
} | ConDefects/ConDefects/Code/abc261_b/Java/36349852 |
condefects-java_data_266 | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.function.IntFunction;
public class Main{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
final MyReader in = new MyReader(System.in);
final MyWriter out = new MyWriter(System.out);
final MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
public static void main(final String[] args){ new Main().exe(); }
void exe(){
// solve();
out.println(solve());
out.flush();
log.println(elapsed());
}
// int N = in.it();
// int Q = in.it();
String solve() {
int N = in.it();
char[][] A = in.ch(N);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (A[i][j] == 'W' && A[j][i] != 'L')
return "incorrect";
return "correct";
// SegmentTree st = new SegmentTree(N);
//
// while(Q-->0) {
// int q = in.it() ;
// if(q == 0) {
// st.upd(in.it(), in.it()+1, in.it());
// }else
// out.println(st.get(in.it(), in.it()+1));
//
// }
}
static class SegmentTree{
long[] arr;
Long[] lazy;
int [] powK ;
int n;
long e = Integer.MAX_VALUE;
long upd(final long a,final long b){ return b; }
long opr(final long a,final long b){ return Long.min(a,b); }
SegmentTree(final int n){
this.n = n;
arr = new long[n<<1];
lazy = new Long[n<<1];
powK = new int[n<<1];
for (int i = n<<1 ; --i>0; ) {
powK[i] = i < n ? powK[i<<1]<<1 : 1;
}
Arrays.fill(arr,e);
}
void eval(int i) {
if (i == 0)
return;
if (lazy[i] != null) {
arr[i]= upd(arr[i],pow(lazy[i],i));
if (i < n) {
lazy[i << 1] = lazy[i];
lazy[i << 1|1] = lazy[i];
}
lazy[i] = null;
}
}
long pow (long v,int i ) {
return powK[i]==1? v:pow(opr(v,v), i<<1);
}
void upd(int l,int r,final long v){
l += n;
r += n;
down(l/(l&-l));
down(r/(r&-r));
setLazy(l, r, v);
recalc(l/(l&-l));
recalc(r/(r&-r));
}
void recalc(int i) {
if(i==0)
return;
arr[i >> 1] = opr(arr[i & -1], arr[i]);
recalc(i >> 1);
}
void down(int i) {
if(i==0)
return ;
down(i>>1);
eval(i);
}
void setLazy(int l, int r, long v) {
if (l == r)
return;
if ((l & 1) == 1) {
lazy[l] = v;
eval(l);
l++;
}
if ((r & 1) == 1) {
--r;
lazy[r] = v;
eval(r);
}
setLazy(l>>1, r>>1, v);
}
long get(int l,int r){
l+=n;
r+=n;
down(l/(l&-l));
down(r/(r&-r));
recalc(l/(l&-l));
recalc(r/(r&-r));
return agg(l,r);
}
long agg(int l, int r) {
if (l == r)
return e;
long vl = (l & 1) == 1 ? arr[l++] : e;
long vr = (r & 1) == 1 ? arr[--r] : e;
return opr(opr(vl, agg(l >> 1, r >> 1)), vr);
}
}
/* 定数 */
final static int infI = (int) 1e9;
final static long infL = (long) 1e18;
// final static long mod = (int) 1e9 +7;
final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
/* Util */
void swap(final int[] arr,final int i,final int j){
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
void swap(final long[] arr,final int i,final int j){
long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
long mod(final long n){ return (n %mod +mod) %mod; }
/* 入力 */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(final InputStream in){ this.in = in; }
byte read(){
if (head == tail) {
try {
tail = in.read(buf);
} catch (IOException e) {
e.printStackTrace();
}
head = 0;
}
return buf[head++];
}
boolean isPrintable(final byte c){ return 32 < c && c < 127; }
boolean isNum(final 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(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }
int[][] trans(final int[][] mat){
int[][] ret = new int[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
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(final int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }
long[][] trans(final long[][] mat){
long[][] ret = new long[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(final int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
public double[][] dbl(final int H,final int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }
char[][] trans(final char[][] mat){
char[][] ret = new char[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
String line(){
StringBuilder sb = new StringBuilder();
byte c;
while (isPrintable(c = read()) || c == ' ')
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
byte c;
while (isPrintable(c = read()))
sb.append((char) c);
return sb.toString();
}
String[] str(final int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(final T[] arr,final IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
List<List<Integer>> fwd(final int N,final int M){
List<List<Integer>> fwd = new ArrayList<>();
for (int i = 0;i < N;i++)
fwd.add(new LinkedList<>());
for (int i = 0;i < M;i++)
fwd.get(idx()).add(idx());
return fwd;
}
List<List<Integer>> g(final int N,final int M){
List<List<Integer>> fwd = fwd(N,M);
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < fwd.size();i++)
g.add(new LinkedList<>());
for (int u = 0;u < fwd.size();u++) {
g.get(u).addAll(fwd.get(u));
for (int v:fwd.get(u))
g.get(v).add(u);
}
return g;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(final 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(final byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(final byte[] b,final int off,final 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(final boolean b){ println(b ? yes : no); }
void println(final long n){
write(n);
ln();
}
public void println(final double d){ println(String.valueOf(d)); }
void println(final String s){
for (byte b:s.getBytes())
write(b);
ln();
}
public void println(final char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(final int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(final long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
import java.util.function.IntFunction;
public class Main{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
final MyReader in = new MyReader(System.in);
final MyWriter out = new MyWriter(System.out);
final MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
public static void main(final String[] args){ new Main().exe(); }
void exe(){
// solve();
out.println(solve());
out.flush();
log.println(elapsed());
}
// int N = in.it();
// int Q = in.it();
String solve() {
int N = in.it();
char[][] A = in.ch(N);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
if (A[i][j] == 'W' && A[j][i] != 'L')
return "incorrect";
else if (A[i][j] == 'L' && A[j][i] != 'W')
return "incorrect";
return "correct";
// SegmentTree st = new SegmentTree(N);
//
// while(Q-->0) {
// int q = in.it() ;
// if(q == 0) {
// st.upd(in.it(), in.it()+1, in.it());
// }else
// out.println(st.get(in.it(), in.it()+1));
//
// }
}
static class SegmentTree{
long[] arr;
Long[] lazy;
int [] powK ;
int n;
long e = Integer.MAX_VALUE;
long upd(final long a,final long b){ return b; }
long opr(final long a,final long b){ return Long.min(a,b); }
SegmentTree(final int n){
this.n = n;
arr = new long[n<<1];
lazy = new Long[n<<1];
powK = new int[n<<1];
for (int i = n<<1 ; --i>0; ) {
powK[i] = i < n ? powK[i<<1]<<1 : 1;
}
Arrays.fill(arr,e);
}
void eval(int i) {
if (i == 0)
return;
if (lazy[i] != null) {
arr[i]= upd(arr[i],pow(lazy[i],i));
if (i < n) {
lazy[i << 1] = lazy[i];
lazy[i << 1|1] = lazy[i];
}
lazy[i] = null;
}
}
long pow (long v,int i ) {
return powK[i]==1? v:pow(opr(v,v), i<<1);
}
void upd(int l,int r,final long v){
l += n;
r += n;
down(l/(l&-l));
down(r/(r&-r));
setLazy(l, r, v);
recalc(l/(l&-l));
recalc(r/(r&-r));
}
void recalc(int i) {
if(i==0)
return;
arr[i >> 1] = opr(arr[i & -1], arr[i]);
recalc(i >> 1);
}
void down(int i) {
if(i==0)
return ;
down(i>>1);
eval(i);
}
void setLazy(int l, int r, long v) {
if (l == r)
return;
if ((l & 1) == 1) {
lazy[l] = v;
eval(l);
l++;
}
if ((r & 1) == 1) {
--r;
lazy[r] = v;
eval(r);
}
setLazy(l>>1, r>>1, v);
}
long get(int l,int r){
l+=n;
r+=n;
down(l/(l&-l));
down(r/(r&-r));
recalc(l/(l&-l));
recalc(r/(r&-r));
return agg(l,r);
}
long agg(int l, int r) {
if (l == r)
return e;
long vl = (l & 1) == 1 ? arr[l++] : e;
long vr = (r & 1) == 1 ? arr[--r] : e;
return opr(opr(vl, agg(l >> 1, r >> 1)), vr);
}
}
/* 定数 */
final static int infI = (int) 1e9;
final static long infL = (long) 1e18;
// final static long mod = (int) 1e9 +7;
final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
/* Util */
void swap(final int[] arr,final int i,final int j){
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
void swap(final long[] arr,final int i,final int j){
long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
long mod(final long n){ return (n %mod +mod) %mod; }
/* 入力 */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(final InputStream in){ this.in = in; }
byte read(){
if (head == tail) {
try {
tail = in.read(buf);
} catch (IOException e) {
e.printStackTrace();
}
head = 0;
}
return buf[head++];
}
boolean isPrintable(final byte c){ return 32 < c && c < 127; }
boolean isNum(final 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(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }
int[][] trans(final int[][] mat){
int[][] ret = new int[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
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(final int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }
long[][] trans(final long[][] mat){
long[][] ret = new long[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(final int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
public double[][] dbl(final int H,final int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }
char[][] trans(final char[][] mat){
char[][] ret = new char[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
String line(){
StringBuilder sb = new StringBuilder();
byte c;
while (isPrintable(c = read()) || c == ' ')
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
byte c;
while (isPrintable(c = read()))
sb.append((char) c);
return sb.toString();
}
String[] str(final int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(final T[] arr,final IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
List<List<Integer>> fwd(final int N,final int M){
List<List<Integer>> fwd = new ArrayList<>();
for (int i = 0;i < N;i++)
fwd.add(new LinkedList<>());
for (int i = 0;i < M;i++)
fwd.get(idx()).add(idx());
return fwd;
}
List<List<Integer>> g(final int N,final int M){
List<List<Integer>> fwd = fwd(N,M);
List<List<Integer>> g = new ArrayList<>();
for (int i = 0;i < fwd.size();i++)
g.add(new LinkedList<>());
for (int u = 0;u < fwd.size();u++) {
g.get(u).addAll(fwd.get(u));
for (int v:fwd.get(u))
g.get(v).add(u);
}
return g;
}
}
/* 出力 */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(final 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(final byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(final byte[] b,final int off,final 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(final boolean b){ println(b ? yes : no); }
void println(final long n){
write(n);
ln();
}
public void println(final double d){ println(String.valueOf(d)); }
void println(final String s){
for (byte b:s.getBytes())
write(b);
ln();
}
public void println(final char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(final int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(final long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
}
} | ConDefects/ConDefects/Code/abc261_b/Java/37407562 |
condefects-java_data_267 | import java.util.*;
import java.io.*;
public class Main{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br=new BufferedReader(new InputStreamReader(System.in));
}
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());
}
long nextLong(){
return Long.parseLong(next());
}
double nextDouble(){
return Double.parseDouble(next());
}
String nextLine(){
String str="";
try {
str=br.readLine().trim();
} catch (Exception e) {
e.printStackTrace();
}
return str;
}
}
static class FastWriter {
private final BufferedWriter bw;
public FastWriter() {
this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
}
public void print(Object object) throws IOException {
bw.append("" + object);
}
public void println(Object object) throws IOException {
print(object);
bw.append("\n");
}
public void close() throws IOException {
bw.close();
}
}
public static void main(String[] args) {
try {
FastReader in = new FastReader();
FastWriter out = new FastWriter();
int n = in.nextInt();
int max = 0;
int p1 = in.nextInt();
for (int i = 1; i < n; i++) {
int p = in.nextInt();
if (p > max) max = p;
}
if (max - p1 < 0) out.println(p1);
else out.println(max - p1 + 1);
out.close();
} catch (Exception e) {
return;
}
}
}
import java.util.*;
import java.io.*;
public class Main{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader(){
br=new BufferedReader(new InputStreamReader(System.in));
}
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());
}
long nextLong(){
return Long.parseLong(next());
}
double nextDouble(){
return Double.parseDouble(next());
}
String nextLine(){
String str="";
try {
str=br.readLine().trim();
} catch (Exception e) {
e.printStackTrace();
}
return str;
}
}
static class FastWriter {
private final BufferedWriter bw;
public FastWriter() {
this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
}
public void print(Object object) throws IOException {
bw.append("" + object);
}
public void println(Object object) throws IOException {
print(object);
bw.append("\n");
}
public void close() throws IOException {
bw.close();
}
}
public static void main(String[] args) {
try {
FastReader in = new FastReader();
FastWriter out = new FastWriter();
int n = in.nextInt();
int max = 0;
int p1 = in.nextInt();
for (int i = 1; i < n; i++) {
int p = in.nextInt();
if (p > max) max = p;
}
if (max - p1 < 0) out.println(0);
else out.println(max - p1 + 1);
out.close();
} catch (Exception e) {
return;
}
}
} | ConDefects/ConDefects/Code/abc313_a/Java/44428667 |
condefects-java_data_268 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] p = new int[n];
for (int i = 0; i < n; i++) {
p[i] = sc.nextInt();
}
System.out.println(solve(n, p));
}
static int solve(int n, int[] p) {
int max = 0;
for(int i=2; i<n; i++) {
if(p[i] > max) {
max = p[i];
}
}
int result = max - p[0] + 1;
if(result < 0) {
return 0;
} else {
return result;
}
}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] p = new int[n];
for (int i = 0; i < n; i++) {
p[i] = sc.nextInt();
}
System.out.println(solve(n, p));
}
static int solve(int n, int[] p) {
int max = 0;
for(int i=1; i<n; i++) {
if(p[i] > max) {
max = p[i];
}
}
int result = max - p[0] + 1;
if(result < 0) {
return 0;
} else {
return result;
}
}
}
| ConDefects/ConDefects/Code/abc313_a/Java/44402239 |
condefects-java_data_269 |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Size: ");
int n = sc.nextInt();
int arr[] = new int[n];
int max= 0;
int b= 0;
System.out.println("Array: ");
for(int i=0 ; i< n ; i++)
{
arr[i] = sc.nextInt();
if(max <= arr[i])
{
max = arr[i];
b = i;
}
}
if(max == arr[0] && b == 0)
{
System.out.println("0");
}
else
{
int result = max-(arr[0]-1);
System.out.println(result);
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int arr[] = new int[n];
int max= 0;
int b= 0;
for(int i=0 ; i< n ; i++)
{
arr[i] = sc.nextInt();
if(max <= arr[i])
{
max = arr[i];
b = i;
}
}
if(max == arr[0] && b == 0)
{
System.out.println("0");
}
else
{
int result = max-(arr[0]-1);
System.out.println(result);
}
}
} | ConDefects/ConDefects/Code/abc313_a/Java/44619089 |
condefects-java_data_270 | import java.util.*;
class Main{
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int max=a[0];
boolean po=true;
for(int i=1;i<n;i++){
if(max<a[i]){
max=a[i];
po=false;
}
}
if(po)System.out.println(0);
else System.out.println(max+1-a[0]);
}
}
import java.util.*;
class Main{
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[n];
for(int i=0;i<n;i++){
a[i]=sc.nextInt();
}
int max=a[0];
boolean po=true;
for(int i=1;i<n;i++){
if(max<=a[i]){
max=a[i];
po=false;
}
}
if(po)System.out.println(0);
else System.out.println(max+1-a[0]);
}
} | ConDefects/ConDefects/Code/abc313_a/Java/44381045 |
condefects-java_data_271 | import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
// 人数
int n = sc.nextInt();
// 自分のプログラミング力
int me = sc.nextInt();
// 自分以外で最強のヤツのプログラミング力
int rival = 0;
// 他の人を一人ずつ見ていく
for (int i = 1; i < n; i++)
{
// ソイツのプログラミング力
int p = sc.nextInt();
// ソイツが今までで一番強かったら暫定１位
if (p > rival)
{
rival = p;
}
}
// 自分の方が強かったら0を出力
if (me >= rival)
{
System.out.println(0);
}
// そうじゃなければソイツを超すのに必要な力を出力
else
{
System.out.println(rival - me + 1);
}
}
}
import java.util.*;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
// 人数
int n = sc.nextInt();
// 自分のプログラミング力
int me = sc.nextInt();
// 自分以外で最強のヤツのプログラミング力
int rival = 0;
// 他の人を一人ずつ見ていく
for (int i = 1; i < n; i++)
{
// ソイツのプログラミング力
int p = sc.nextInt();
// ソイツが今までで一番強かったら暫定１位
if (p > rival)
{
rival = p;
}
}
// 自分の方が強かったら0を出力
if (me > rival)
{
System.out.println(0);
}
// そうじゃなければソイツを超すのに必要な力を出力
else
{
System.out.println(rival - me + 1);
}
}
} | ConDefects/ConDefects/Code/abc313_a/Java/44384029 |
condefects-java_data_272 | import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
try (Scanner sc = new Scanner(System.in)) {
final int N = sc.nextInt();
final int P = sc.nextInt();
int saikyo = 0;
for (int i = 1; i < N; i++) {
final int P2 = sc.nextInt();
if (P < P2 && saikyo < P2) {
saikyo = P2;
}
}
System.out.println(Math.max(saikyo - P + 1, 0));
}
}
}
import java.util.Scanner;
public class Main {
public static void main(final String[] args) {
try (Scanner sc = new Scanner(System.in)) {
final int N = sc.nextInt();
final int P = sc.nextInt();
int saikyo = 0;
for (int i = 1; i < N; i++) {
final int P2 = sc.nextInt();
if (saikyo < P2) {
saikyo = P2;
}
}
System.out.println(Math.max(saikyo - P + 1, 0));
}
}
}
| ConDefects/ConDefects/Code/abc313_a/Java/44379267 |
condefects-java_data_273 | import java.util.*;
class Pair {
private int x;
private int y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
void setX(int x) {
this.x = x;
}
void setY(int y) {
this.y = y;
}
int getX() {
return this.x;
}
int getY() {
return this.y;
}
}
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Pair> score = new ArrayList<>();
for (int i = 0; i < n; i++) {
int x = Integer.parseInt(sc.next());
int y = Integer.parseInt(sc.next());
score.add(new Pair(x, y));
}
int totalX = 0;
int totalY = 0;
for (int i = 0; i < n; i++) {
totalX += score.get(i).getX();
totalY += score.get(i).getY();
}
if (totalX < totalY) {
System.out.println("Aoki");
System.exit(0);
} else if (totalX > totalY) {
System.out.println("Takahashi");
System.exit(0);
} else if (totalX == totalY) {
System.out.println("Drow");
System.exit(0);
}
}
}
import java.util.*;
class Pair {
private int x;
private int y;
Pair(int x, int y) {
this.x = x;
this.y = y;
}
void setX(int x) {
this.x = x;
}
void setY(int y) {
this.y = y;
}
int getX() {
return this.x;
}
int getY() {
return this.y;
}
}
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
List<Pair> score = new ArrayList<>();
for (int i = 0; i < n; i++) {
int x = Integer.parseInt(sc.next());
int y = Integer.parseInt(sc.next());
score.add(new Pair(x, y));
}
int totalX = 0;
int totalY = 0;
for (int i = 0; i < n; i++) {
totalX += score.get(i).getX();
totalY += score.get(i).getY();
}
if (totalX < totalY) {
System.out.println("Aoki");
System.exit(0);
} else if (totalX > totalY) {
System.out.println("Takahashi");
System.exit(0);
} else if (totalX == totalY) {
System.out.println("Draw");
System.exit(0);
}
}
}
| ConDefects/ConDefects/Code/abc337_a/Java/54319900 |
condefects-java_data_274 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += sc.nextInt();
sum -= sc.nextInt();
}
sc.close();
String str = "draw";
if (sum > 0) {
str = "Takahashi";
} else if (sum < 0) {
str = "Aoki";
}
System.out.println(str);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += sc.nextInt();
sum -= sc.nextInt();
}
sc.close();
String str = "Draw";
if (sum > 0) {
str = "Takahashi";
} else if (sum < 0) {
str = "Aoki";
}
System.out.println(str);
}
} | ConDefects/ConDefects/Code/abc337_a/Java/54234667 |
condefects-java_data_275 | import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static int n, m, k, now = 0;
static List<int[]>[] G;
static boolean[] vis;
static int lamp[];
static List<Integer> res = new ArrayList<>();
static void solve(PrintWriter o) {
try {
n = nextInt();
m = nextInt();
k = nextInt();
G = new ArrayList[n];
Arrays.setAll(G, key->new ArrayList<>());
vis = new boolean[n];
lamp = new int[n];
for(int i=0;i<m;i++) {
int u = nextInt();
int v = nextInt();
u--;
v--;
G[u].add(new int[]{v, i});
G[v].add(new int[]{u, i});
}
for(int i=0;i<n;i++) if(!vis[i]) dfs(i);
if(now < k) o.println("No");
else {
o.println("Yes");
o.println(res.size());
for(int num: res) o.print(num + " ");
o.println();
}
} catch (Exception e) {
e.printStackTrace();
}
}
static void dfs(int u) {
vis[u] = true;
for(int[] it: G[u]) {
int v = it[0];
int id = it[1];
if(vis[v]) continue;
dfs(v);
if(lamp[v] == 0 && now < k) {
now -= lamp[u] + lamp[v];
lamp[u] ^= 1;
lamp[v] ^= 1;
now += lamp[u] + lamp[v];
res.add(id+1);
}
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static int n, m, k, now = 0;
static List<int[]>[] G;
static boolean[] vis;
static int lamp[];
static List<Integer> res = new ArrayList<>();
static void solve(PrintWriter o) {
try {
n = nextInt();
m = nextInt();
k = nextInt();
G = new ArrayList[n];
Arrays.setAll(G, key->new ArrayList<>());
vis = new boolean[n];
lamp = new int[n];
for(int i=0;i<m;i++) {
int u = nextInt();
int v = nextInt();
u--;
v--;
G[u].add(new int[]{v, i});
G[v].add(new int[]{u, i});
}
for(int i=0;i<n;i++) if(!vis[i]) dfs(i);
if(now != k) o.println("No");
else {
o.println("Yes");
o.println(res.size());
for(int num: res) o.print(num + " ");
o.println();
}
} catch (Exception e) {
e.printStackTrace();
}
}
static void dfs(int u) {
vis[u] = true;
for(int[] it: G[u]) {
int v = it[0];
int id = it[1];
if(vis[v]) continue;
dfs(v);
if(lamp[v] == 0 && now < k) {
now -= lamp[u] + lamp[v];
lamp[u] ^= 1;
lamp[v] ^= 1;
now += lamp[u] + lamp[v];
res.add(id+1);
}
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a%b);
}
public static long[] extgcd(long a, long b) {
if(b == 0) return new long[]{1, 0};
long[] it = extgcd(b, a%b);
long x = it[1], y = it[0];
y -= a/b*x;
return new long[]{x, y};
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
a %= md;
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class FenWick {
int n;
long[] a;
long[] tree;
public FenWick(int n){
this.n = n;
a = new long[n+1];
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private void addMx(int x, long val) {
a[x] += val;
tree[x] = a[x];
while(x <= n) {
for(int i=1;i<(x&-x);i<<=1) {
tree[x] = Math.max(tree[x], tree[x-i]);
}
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
private long queryMx(int l, int r) {
long res = 0l;
while(l <= r) {
if(r-(r&-r) >= l) {
res = Math.max(res, tree[r]);
r -= r&-r;
}
else {
res = Math.max(res, a[r]);
r--;
}
}
return res;
}
}
public static class Pair{
Integer u;
Integer v;
public Pair(Integer u, Integer v) {
this.u = u;
this.v = v;
}
@Override
public int hashCode() {
int prime = 31, ret = 1;
ret = ret*prime + u.hashCode();
ret = ret*prime + v.hashCode();
return ret;
}
@Override
public boolean equals(Object obj) {
if(obj instanceof Pair) {
return u.equals(((Pair) obj).u) && v.equals(((Pair) obj).v);
}
return false;
}
}
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
} | ConDefects/ConDefects/Code/abc345_f/Java/51417255 |
condefects-java_data_276 |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni(), m = ni(), K = ni();
if(K % 2 != 0){
out.println("No");
return;
}
out.println("Yes");
int[] from = new int[m];
int[] to = new int[m];
DJSet ds = new DJSet(n);
for(int i = 0;i < m;i++){
from[i] = ni()-1;
to[i] = ni()-1;
ds.unite(from[i], to[i]);
}
int[] f = new int[n];
int rem = K;
for(int i = 0;i < n;i++){
if(ds.upper[i] < 0){
f[i] = Math.min(rem, (-ds.upper[i])/2*2);
rem -= f[i];
}
}
if(rem > 0){
out.println("No");
return;
}
boolean[] hit = new boolean[n+1];
for(int i = 0;i < n;i++){
if(f[ds.root(i)] > 0){
hit[i] = true;
f[ds.root(i)]--;
}
}
int[][] g = packU(n, from, to);
int[] par = spanningTreeX(g);
g = parentToG(par);
// tr(g);
int[][] pars = parents(g, 0);
int[] ord = pars[1];
Set<Long> set = new HashSet<>();
boolean[] dp = new boolean[n+1];
for(int i = n;i >= 1;i--){
int cur = ord[i];
for(int e : g[cur]){
if(e != par[cur]){
dp[cur] ^= dp[e];
}
}
if(hit[cur]){
dp[cur] ^= true;
}
if(dp[cur]){
set.add((long)cur<<32|par[cur]);
set.add((long)par[cur]<<32|cur);
}
}
out.println(set.size() / 2);
for(int i = 0;i < m;i++){
long code = (long)from[i]<<32|to[i];
if(set.contains(code)) {
out.print(i + 1 + " ");
}
}
out.println();
}
public static class DJSet {
public int[] upper;
public DJSet(int n) {
upper = new int[n];
Arrays.fill(upper, -1);
}
public int root(int x) {
return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
}
public boolean equiv(int x, int y) {
return root(x) == root(y);
}
public boolean unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (upper[y] < upper[x]) {
int d = x;
x = y;
y = d;
}
upper[x] += upper[y];
upper[y] = x;
}
return x == y;
}
public int count() {
int ct = 0;
for (int u : upper) if (u < 0) ct++;
return ct;
}
public int[][] toBucket() {
int n = upper.length;
int[][] ret = new int[n][];
int[] rp = new int[n];
for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];
for (int i = 0; i < n; i++) {
int r = root(i);
ret[r][rp[r]++] = i;
}
return ret;
}
}
public static int[][] parents(int[][] g, int root)
{
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
int[] depth = new int[n];
depth[0] = 0;
int[] q = new int[n];
q[0] = root;
for(int p = 0, r = 1;p < r;p++) {
int cur = q[p];
for(int nex : g[cur]){
if(par[cur] != nex){
q[r++] = nex;
par[nex] = cur;
depth[nex] = depth[cur] + 1;
}
}
}
return new int[][] {par, q, depth};
}
public static int[][] parentToG(int[] par)
{
int n = par.length;
int[] ct = new int[n];
for(int i = 0;i < n;i++){
if(par[i] >= 0){
ct[i]++;
ct[par[i]]++;
}
}
int[][] g = new int[n][];
for(int i = 0;i < n;i++){
g[i] = new int[ct[i]];
}
for(int i = 0;i < n;i++){
if(par[i] >= 0){
g[par[i]][--ct[par[i]]] = i;
g[i][--ct[i]] = par[i];
}
}
return g;
}
public static int[] spanningForest(int[][] g)
{
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
boolean[] ved = new boolean[n];
int[] q = new int[n];
int p = 0;
for(int z = 0;z < n;z++) {
if(ved[z])continue;
q[p++] = z;
ved[z] = true;
for (int i = p-1; i < p; i++) {
for (int e : g[q[i]]) {
if (!ved[e]){
q[p++] = e;
ved[e] = true;
par[e] = q[i];
}
}
}
}
return par;
}
public static int[] spanningTreeX(int[][] g)
{
int[] par = spanningForest(g);
int n = g.length;
par = Arrays.copyOf(par, n+1);
par[n] = -1;
for(int i = 0;i < n;i++){
if(par[i] == -1)par[i] = n;
}
return par;
}
public static int[][] packU(int n, int[] from, int[] to) {
return packU(n, from, to, from.length);
}
public static int[][] packU(int n, int[] from, int[] to, int sup) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int i = 0; i < sup; i++) p[from[i]]++;
for (int i = 0; i < sup; i++) p[to[i]]++;
for (int i = 0; i < n; i++) g[i] = new int[p[i]];
for (int i = 0; i < sup; i++) {
g[from[i]][--p[from[i]]] = to[i];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
int n = ni(), m = ni(), K = ni();
if(K % 2 != 0){
out.println("No");
return;
}
int[] from = new int[m];
int[] to = new int[m];
DJSet ds = new DJSet(n);
for(int i = 0;i < m;i++){
from[i] = ni()-1;
to[i] = ni()-1;
ds.unite(from[i], to[i]);
}
int[] f = new int[n];
int rem = K;
for(int i = 0;i < n;i++){
if(ds.upper[i] < 0){
f[i] = Math.min(rem, (-ds.upper[i])/2*2);
rem -= f[i];
}
}
if(rem > 0){
out.println("No");
return;
}
out.println("Yes");
boolean[] hit = new boolean[n+1];
for(int i = 0;i < n;i++){
if(f[ds.root(i)] > 0){
hit[i] = true;
f[ds.root(i)]--;
}
}
int[][] g = packU(n, from, to);
int[] par = spanningTreeX(g);
g = parentToG(par);
// tr(g);
int[][] pars = parents(g, 0);
int[] ord = pars[1];
Set<Long> set = new HashSet<>();
boolean[] dp = new boolean[n+1];
for(int i = n;i >= 1;i--){
int cur = ord[i];
for(int e : g[cur]){
if(e != par[cur]){
dp[cur] ^= dp[e];
}
}
if(hit[cur]){
dp[cur] ^= true;
}
if(dp[cur]){
set.add((long)cur<<32|par[cur]);
set.add((long)par[cur]<<32|cur);
}
}
out.println(set.size() / 2);
for(int i = 0;i < m;i++){
long code = (long)from[i]<<32|to[i];
if(set.contains(code)) {
out.print(i + 1 + " ");
}
}
out.println();
}
public static class DJSet {
public int[] upper;
public DJSet(int n) {
upper = new int[n];
Arrays.fill(upper, -1);
}
public int root(int x) {
return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
}
public boolean equiv(int x, int y) {
return root(x) == root(y);
}
public boolean unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (upper[y] < upper[x]) {
int d = x;
x = y;
y = d;
}
upper[x] += upper[y];
upper[y] = x;
}
return x == y;
}
public int count() {
int ct = 0;
for (int u : upper) if (u < 0) ct++;
return ct;
}
public int[][] toBucket() {
int n = upper.length;
int[][] ret = new int[n][];
int[] rp = new int[n];
for (int i = 0; i < n; i++) if (upper[i] < 0) ret[i] = new int[-upper[i]];
for (int i = 0; i < n; i++) {
int r = root(i);
ret[r][rp[r]++] = i;
}
return ret;
}
}
public static int[][] parents(int[][] g, int root)
{
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
int[] depth = new int[n];
depth[0] = 0;
int[] q = new int[n];
q[0] = root;
for(int p = 0, r = 1;p < r;p++) {
int cur = q[p];
for(int nex : g[cur]){
if(par[cur] != nex){
q[r++] = nex;
par[nex] = cur;
depth[nex] = depth[cur] + 1;
}
}
}
return new int[][] {par, q, depth};
}
public static int[][] parentToG(int[] par)
{
int n = par.length;
int[] ct = new int[n];
for(int i = 0;i < n;i++){
if(par[i] >= 0){
ct[i]++;
ct[par[i]]++;
}
}
int[][] g = new int[n][];
for(int i = 0;i < n;i++){
g[i] = new int[ct[i]];
}
for(int i = 0;i < n;i++){
if(par[i] >= 0){
g[par[i]][--ct[par[i]]] = i;
g[i][--ct[i]] = par[i];
}
}
return g;
}
public static int[] spanningForest(int[][] g)
{
int n = g.length;
int[] par = new int[n];
Arrays.fill(par, -1);
boolean[] ved = new boolean[n];
int[] q = new int[n];
int p = 0;
for(int z = 0;z < n;z++) {
if(ved[z])continue;
q[p++] = z;
ved[z] = true;
for (int i = p-1; i < p; i++) {
for (int e : g[q[i]]) {
if (!ved[e]){
q[p++] = e;
ved[e] = true;
par[e] = q[i];
}
}
}
}
return par;
}
public static int[] spanningTreeX(int[][] g)
{
int[] par = spanningForest(g);
int n = g.length;
par = Arrays.copyOf(par, n+1);
par[n] = -1;
for(int i = 0;i < n;i++){
if(par[i] == -1)par[i] = n;
}
return par;
}
public static int[][] packU(int n, int[] from, int[] to) {
return packU(n, from, to, from.length);
}
public static int[][] packU(int n, int[] from, int[] to, int sup) {
int[][] g = new int[n][];
int[] p = new int[n];
for (int i = 0; i < sup; i++) p[from[i]]++;
for (int i = 0; i < sup; i++) p[to[i]]++;
for (int i = 0; i < n; i++) g[i] = new int[p[i]];
for (int i = 0; i < sup; i++) {
g[from[i]][--p[from[i]]] = to[i];
g[to[i]][--p[to[i]]] = from[i];
}
return g;
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
| ConDefects/ConDefects/Code/abc345_f/Java/51375780 |
condefects-java_data_277 | import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static long inf = (long) 2e18;
static int N;
static int[] vis;
static LinkedList<Integer> ans;
static Vector<Node>[] g;
static int[] lamp;
static int res = 0;
static int K;
public static void main(String[] args) throws IOException {
N = f.nextInt();
int M = f.nextInt();
K = f.nextInt();
g = new Vector[N+1];
lamp = new int[N+1];
vis = new int[N+1];
ans = new LinkedList<>();
for (int i = 0; i < N + 1; i++) {
g[i] = new Vector<>();
}
for (int i = 1; i <= M; i++) {
int x = f.nextInt();
int y = f.nextInt();
g[x].add(new Node(y, i));
g[y].add(new Node(x, i));
}
for (int i = 1; i <= N; i++) {
if (vis[i] == 0)
dfs(i);
}
if (K % 2 != 0){
w.println("No");
}else {
w.println("Yes");
w.println(ans.size());
for (Integer o : ans) {
w.print (o + " ");
}
}
w.flush();
w.close();
br.close();
}
public static void dfs(int x){
vis[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
Node cur = g[x].get(i);
int id = cur.id;
int y = cur.to;
if (res == K) return;
if (vis[y] == 1) continue;
dfs(y);
if(lamp[y] == 0 && res < K){
res -= lamp[x] + lamp[y];
lamp[x] ^= 1;
lamp[y] ^= 1;
res += lamp[x] + lamp[y];
ans.add(id);
}
}
}
public static class Node{
int to;
int id;
public Node(int to, int id){
this.to = to;
this.id = id;
}
}
static PrintWriter w = new PrintWriter(new OutputStreamWriter(System.out));
static Input f = new Input(System.in);
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static class Input {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Input(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
String str = null;
try {
str = reader.readLine();
} catch (IOException e) {
// TODO 自动生成的 catch 块
e.printStackTrace();
}
return str;
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public Double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static long inf = (long) 2e18;
static int N;
static int[] vis;
static LinkedList<Integer> ans;
static Vector<Node>[] g;
static int[] lamp;
static int res = 0;
static int K;
public static void main(String[] args) throws IOException {
N = f.nextInt();
int M = f.nextInt();
K = f.nextInt();
g = new Vector[N+1];
lamp = new int[N+1];
vis = new int[N+1];
ans = new LinkedList<>();
for (int i = 0; i < N + 1; i++) {
g[i] = new Vector<>();
}
for (int i = 1; i <= M; i++) {
int x = f.nextInt();
int y = f.nextInt();
g[x].add(new Node(y, i));
g[y].add(new Node(x, i));
}
for (int i = 1; i <= N; i++) {
if (vis[i] == 0)
dfs(i);
}
if (res != K){
w.println("No");
}else {
w.println("Yes");
w.println(ans.size());
for (Integer o : ans) {
w.print (o + " ");
}
}
w.flush();
w.close();
br.close();
}
public static void dfs(int x){
vis[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
Node cur = g[x].get(i);
int id = cur.id;
int y = cur.to;
if (res == K) return;
if (vis[y] == 1) continue;
dfs(y);
if(lamp[y] == 0 && res < K){
res -= lamp[x] + lamp[y];
lamp[x] ^= 1;
lamp[y] ^= 1;
res += lamp[x] + lamp[y];
ans.add(id);
}
}
}
public static class Node{
int to;
int id;
public Node(int to, int id){
this.to = to;
this.id = id;
}
}
static PrintWriter w = new PrintWriter(new OutputStreamWriter(System.out));
static Input f = new Input(System.in);
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static class Input {
public BufferedReader reader;
public StringTokenizer tokenizer;
public Input(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
String str = null;
try {
str = reader.readLine();
} catch (IOException e) {
// TODO 自动生成的 catch 块
e.printStackTrace();
}
return str;
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public Double nextDouble() {
return Double.parseDouble(next());
}
public BigInteger nextBigInteger() {
return new BigInteger(next());
}
}
} | ConDefects/ConDefects/Code/abc345_f/Java/51464270 |
condefects-java_data_278 | import java.util.Scanner;
public class Main {
static int[] nums = {1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99};
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int ct = 0;
for (int i=1;i<=n;i++) {
int val = scanner.nextInt();
if (containsNumber(i)) {
String s = i+"";
if (s.length()==2 && i<=val) {
ct += 2;
} else if (s.length()==1 && Integer.parseInt(i+""+i)<=val) {
ct += 2;
} else if (s.length()==1 && i<=val) {
ct++;
}
}
}
System.out.println(ct);
}
static boolean containsNumber(int num) {
for (int i: nums) {
if (i==num)
return true;
}
return false;
}
}
import java.util.Scanner;
public class Main {
static int[] nums = {1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99};
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int ct = 0;
for (int i=1;i<=n;i++) {
int val = scanner.nextInt();
if (containsNumber(i)) {
String s = i+"";
if (s.length()==2 && i<=val) {
ct += 2;
} else if (s.length()==2 && Integer.parseInt(s.substring(0,1))<=val) {
ct++;
} else if (s.length()==1 && Integer.parseInt(i+""+i)<=val) {
ct += 2;
} else if (s.length()==1 && i<=val) {
ct++;
}
}
}
System.out.println(ct);
}
static boolean containsNumber(int num) {
for (int i: nums) {
if (i==num)
return true;
}
return false;
}
} | ConDefects/ConDefects/Code/abc328_b/Java/47649080 |
condefects-java_data_279 | //import java.util.ArrayList;
//import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//double x = sc.nextDouble();
int n = sc.nextInt();
//int m = sc.nextInt();
//int X = sc.nextInt();
//int Y = sc.nextInt();
//long h = sc.nextLong();
//String s = sc.next();
//String t = sc.next();
//int L = s.length();
//String ans = "";
//String [] s = new String[10];
//int [] L = new int[n];
//Map<Integer, ArrayList<Integer>> map = new TreeMap<>();
//List<Integer> A = new ArrayList<>();
//Set<String> s = Set.of("H", "2B", "3B", "HR");
//Set<Integer> E = new HashSet<>();
//Set<Integer> L = new HashSet<>();
//String S = Long.toBinaryString(M);
//int N = (int)Math.ceil(x);
//double [] h = new double[n];
int ans = 0;
for (int i=1; i<n; i++) {
int d = sc.nextInt();
if (i<10 || i==11 || i==22 || i==33 || i==44 || i== 55 || i==66 || i==77 || i==88 || i==99) {
int r = i%10;
if (d >= r && d < r+r*10) {
ans++;
} else if (r+r*10 <= d) {
ans += 2;
}
}
}
System.out.println(ans);
sc.close();
//System.out.println("Yes");
//System.out.println("No");
//System.exit(0);
}
//Math.floor(1.1); //→1 切り捨て
//Math.ceil(1.1); //→2 切り上げ
//Math.round(1.5); //→2 四捨五入
public static int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
public static int mi(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
public static long tenjo(long a) {
return (long)Math.floor(a/2.0);
}
public static int dis(int [] a, int [] b) {
return Math.abs(a[0]-b[0])+Math.abs(a[1]-b[1]);
}
public static String sub(String S, int i, int j) {
return S.substring(i,j);
}
public static String rep(String S, int N) {//SをN個連結
return String.join("",
Stream
.generate(() -> S) //Sを無限生成
.limit(N) //上限を指定
.collect(Collectors.toList()) //Listに変換し, joinの第2引数に渡す
);
}
public static String abc(String S) {//辞書式で最も早いものに並べ替える
Map<String, Integer> map = new TreeMap<>();
for (int i=0; i<S.length(); i++) {
String s = S.substring(i,i+1);
if (map.containsKey(s)) {
map.put(s, map.get(s)+1);
} else {
map.put(s, 1);
}
}
String T = "";
for (String a : map.keySet()) {
T = T + rep(a, map.get(a));
}
return T;
}
public static String cba(String S) {//辞書式で最も後ろのものに並べ替える
Map<String, Integer> map = new TreeMap<>();
for (int i=0; i<S.length(); i++) {
String s = S.substring(i,i+1);
if (map.containsKey(s)) {
map.put(s, map.get(s)+1);
} else {
map.put(s, 1);
}
}
String T = "";
for (String a : map.keySet()) {
T = rep(a, map.get(a)) + T;
}
return T;
}
public static String rev(String S) {//文字列を逆に並べ替える
StringBuilder A = new StringBuilder(S);
return A.reverse().toString();
}
}
//import java.util.ArrayList;
//import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.stream.Collectors;
import java.util.stream.Stream;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//double x = sc.nextDouble();
int n = sc.nextInt();
//int m = sc.nextInt();
//int X = sc.nextInt();
//int Y = sc.nextInt();
//long h = sc.nextLong();
//String s = sc.next();
//String t = sc.next();
//int L = s.length();
//String ans = "";
//String [] s = new String[10];
//int [] L = new int[n];
//Map<Integer, ArrayList<Integer>> map = new TreeMap<>();
//List<Integer> A = new ArrayList<>();
//Set<String> s = Set.of("H", "2B", "3B", "HR");
//Set<Integer> E = new HashSet<>();
//Set<Integer> L = new HashSet<>();
//String S = Long.toBinaryString(M);
//int N = (int)Math.ceil(x);
//double [] h = new double[n];
int ans = 0;
for (int i=1; i<=n; i++) {
int d = sc.nextInt();
if (i<10 || i==11 || i==22 || i==33 || i==44 || i== 55 || i==66 || i==77 || i==88 || i==99) {
int r = i%10;
if (d >= r && d < r+r*10) {
ans++;
} else if (r+r*10 <= d) {
ans += 2;
}
}
}
System.out.println(ans);
sc.close();
//System.out.println("Yes");
//System.out.println("No");
//System.exit(0);
}
//Math.floor(1.1); //→1 切り捨て
//Math.ceil(1.1); //→2 切り上げ
//Math.round(1.5); //→2 四捨五入
public static int max(int a, int b) {
if (a > b) {
return a;
} else {
return b;
}
}
public static int mi(int a, int b) {
if (a < b) {
return a;
} else {
return b;
}
}
public static long tenjo(long a) {
return (long)Math.floor(a/2.0);
}
public static int dis(int [] a, int [] b) {
return Math.abs(a[0]-b[0])+Math.abs(a[1]-b[1]);
}
public static String sub(String S, int i, int j) {
return S.substring(i,j);
}
public static String rep(String S, int N) {//SをN個連結
return String.join("",
Stream
.generate(() -> S) //Sを無限生成
.limit(N) //上限を指定
.collect(Collectors.toList()) //Listに変換し, joinの第2引数に渡す
);
}
public static String abc(String S) {//辞書式で最も早いものに並べ替える
Map<String, Integer> map = new TreeMap<>();
for (int i=0; i<S.length(); i++) {
String s = S.substring(i,i+1);
if (map.containsKey(s)) {
map.put(s, map.get(s)+1);
} else {
map.put(s, 1);
}
}
String T = "";
for (String a : map.keySet()) {
T = T + rep(a, map.get(a));
}
return T;
}
public static String cba(String S) {//辞書式で最も後ろのものに並べ替える
Map<String, Integer> map = new TreeMap<>();
for (int i=0; i<S.length(); i++) {
String s = S.substring(i,i+1);
if (map.containsKey(s)) {
map.put(s, map.get(s)+1);
} else {
map.put(s, 1);
}
}
String T = "";
for (String a : map.keySet()) {
T = rep(a, map.get(a)) + T;
}
return T;
}
public static String rev(String S) {//文字列を逆に並べ替える
StringBuilder A = new StringBuilder(S);
return A.reverse().toString();
}
} | ConDefects/ConDefects/Code/abc328_b/Java/54781866 |
condefects-java_data_280 | import java.io.Writer;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.FilterOutputStream;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
import java.io.InterruptedIOException;
import java.nio.charset.Charset;
import java.nio.charset.IllegalCharsetNameException;
import java.nio.charset.UnsupportedCharsetException;
import java.math.BigInteger;
import java.awt.Point;
import java.awt.Dimension;
import java.util.*;
import java.util.stream.*;
import java.util.function.*;
final class Main {
private static final boolean autoFlush = false;
private static final SimpleScanner sc = new SimpleScanner( System.in );
private static final SimpleWriter out = new SimpleWriter( System.out, autoFlush );
public static void main ( String[] args ) {
int N = sc.nextInt();
int K = sc.nextInt();
int P = sc.nextInt();
int len = (int)MathFunction.pow(P+1,K);
long max = Long.MAX_VALUE>>1;
long[] dp = new long[len];
long[] next = new long[len];
Arrays.fill(dp,max);
dp[0] = 0;
IntegerSet set = new IntegerSet();
set.add(0);
while(N-->0){
int C = sc.nextInt();
int[] A = sc.nextInt(K);
Arrays.fill(next,max);
for(int num:set.toArray()){
int nextNum = 0;
int mult = 1;
int bef = num;
for(int i=K-1;i>=0;i--){
int m = num%(P+1);
num /= P+1;
nextNum += mult*Math.min(P,m+A[i]);
mult *= P+1;
}
set.add(nextNum);
next[nextNum] = Math.min(dp[nextNum],dp[bef]+C);
next[bef] = Math.min(next[bef],dp[bef]);
}
var temp = dp;
dp = next;
next = temp;
}
out.println(dp[len-1]==max?-1:dp[len-1]);
out.close();
}
}
/*
／￣＼
| |
＼＿／
|
／ ￣ ￣ ＼
／ ＼ ／ ＼
／ ⌒ ⌒ ＼ よくぞこの提出結果を開いてくれた
| （__人__） | 褒美としてオプーナを買う権利をやる
＼ ｀⌒´ ／ ☆
/ヽ､--ー､＿＿, -‐ ´ ＼─／
／ > ヽ▼●▼<＼ ||ｰ､.
/ヽ､ ＼ i |｡| |/ ヽ (ニ､`ヽ.
l ヽ l |｡| | r-､y ｀ﾆ ﾉ ＼
l | |ー─ | ￣ l ｀~ヽ＿ノ＿_
／￣￣￣￣ヽ-'ヽ--' ／ オープナ ／|
|￣￣￣￣￣￣|／| |￣￣￣￣￣￣|／| ＿＿＿＿＿＿
／￣オプーナ／|￣|__｣／_オープナ ／|￣|__,」＿_ ／|
|￣￣￣￣￣|／オープナ￣／￣￣￣￣|／オプーナ ／| ／ |
|￣￣￣￣￣|￣￣￣￣￣|／l￣￣￣￣|￣￣￣￣￣|／| ／
|￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|
*/
/*////////////////////////////////////////////////
* My Library *
@author viral
*/////////////////////////////////////////////////
final class Factorial {
//階乗とその逆元
private final long[] fact, inFact;
private final long mod;
/**
* 1～Nの階乗とその逆元をmodで割ったあまりを事前に計算します。
*
* @param N 計算範囲
* @param mod 法
*/
public Factorial ( final int N, final long mod ) {
fact = new long[N + 1];
fact[0] = fact[1] = 1;
for ( int i = 2; i <= N; ++i ) {
fact[i] = fact[i - 1] * i % mod;
}
inFact = new long[N + 1];
inFact[N] = MathFunction.modPow( fact[N], mod - 2, mod );
for ( int i = N; i > 0; --i ) {
inFact[i - 1] = inFact[i] * i % mod;
}
inFact[0] = 1;
this.mod = mod;
}
/**
* num!をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getFact ( final int num ) {
return fact[num];
}
/**
* num!^-1をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getInFact ( final int num ) {
return inFact[num];
}
/**
* aCbをmodで割ったあまりを返します。
*
* @param a
* @param b
*
* @return aCb
*/
public long getCombi ( final int a, final int b ) {
if ( a < b || a < 0 || b < 0 ) {
return 0;
}
return ( fact[a] * inFact[a - b] % mod ) * inFact[b] % mod;
}
}
final class ArrayFunction {
/**
* カウントソートによるソートです。
* 各要素が0以上であり最大値が十分小さい時はこちらの使用を推奨します。
*
* @param array ソート対象のint型配列
* @param maximumLimit array内の最大要素
*/
public static void countSort ( final int[] array, final int maximumLimit ) {
final int[] list = new int[maximumLimit + 1];
for ( final int num: array ) {
++list[num];
}
int temp = 0;
for ( int i = 0; i < list.length; ++i ) {
while ( list[i]-- > 0 ) {
array[temp++] = i;
}
}
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static int[][] rotateR ( final int[][] array ) {
final int[][] ans = new int[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static long[][] rotateR ( final long[][] array ) {
final long[][] ans = new long[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static char[][] rotateR ( final char[][] array ) {
final char[][] ans = new char[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static double[][] rotateR ( final double[][] array ) {
final double[][] ans = new double[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static boolean[][] rotateR ( final boolean[][] array ) {
final boolean[][] ans = new boolean[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static <E> E[][] rotateR ( final E[][] array, final E[][] ans ) {
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static int[][] rotateL ( final int[][] array ) {
final int[][] ans = new int[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
final int index = i;
Arrays.setAll( ans[i], k -> array[k][ans.length - index - 1] );
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static long[][] rotateL ( final long[][] array ) {
final long[][] ans = new long[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
final int index = i;
Arrays.setAll( ans[i], k -> array[k][ans.length - index - 1] );
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static char[][] rotateL ( final char[][] array ) {
final char[][] ans = new char[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static double[][] rotateL ( final double[][] array ) {
final double[][] ans = new double[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static boolean[][] rotateL ( final boolean[][] array ) {
final boolean[][] ans = new boolean[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static <E> E[][] rotateL ( final E[][] array, final E[][] ans ) {
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array, boolean include ) {
int[] list = new int[array.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int num: array ) {
int index = include ? Searcher.overSearch( list, num ) : Searcher.upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = Searcher.underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p, boolean include ) {
int[] list = new int[arrays.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int[] array: arrays ) {
int index = include ? Searcher.overSearch( list, array[p] ) : Searcher.upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = Searcher.underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array, boolean include ) {
long[] list = new long[array.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long num: array ) {
int index = include ? Searcher.overSearch( list, num ) : Searcher.upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = Searcher.underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p, boolean include ) {
long[] list = new long[arrays.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long[] array: arrays ) {
int index = include ? Searcher.overSearch( list, array[p] ) : Searcher.upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = Searcher.underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値は辺を表すint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( final ArrayList<ArrayList<Integer>> route ) {
final int[] count = new int[route.size()];
int pathCount = 0;
for ( final ArrayList<Integer> path: route ) {
for ( final int point: path ) {
++pathCount;
++count[point];
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; ++i ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( final int nextP: route.get( nowP ) ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値は辺を表すint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( final int[][] route ) {
final int[] count = new int[route.length];
int pathCount = 0;
for ( final int[] path: route ) {
for ( final int point: path ) {
++pathCount;
++count[point];
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; ++i ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( final int nextP: route[nowP] ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final int[] array, final int a, final int b ) {
final int temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final long[] array, final int a, final int b ) {
final long temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final double[] array, final int a, final int b ) {
final double temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final char[] array, final int a, final int b ) {
final char temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final boolean[] array, final int a, final int b ) {
final boolean temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static <E> void swap ( final E[] array, final int a, final int b ) {
final E temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final int[][] array, final int a, final int b, final int c, final int d ) {
final int temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final long[][] array, final int a, final int b, final int c, final int d ) {
final long temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final double[][] array, final int a, final int b, final int c, final int d ) {
final double temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final char[][] array, final int a, final int b, final int c, final int d ) {
final char temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final boolean[][] array, final int a, final int b, final int c, final int d ) {
final boolean temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static <E> void swap ( final E[][] array, final int a, final int b, final int c, final int d ) {
final E temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final int[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
int min = Integer.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final long[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
long min = Long.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final char[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
int min = Integer.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static <E extends Comparable<E>> boolean nextPermutation ( final E[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1].compareTo( array[i] ) < 0 ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = -1;
E min = MathFunction.max( array );
int subIndex = -1;
E max = array[index1];
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
if ( max.compareTo( array[i] ) < 0 ) {
subIndex = i;
max = array[i];
}
}
if ( index2 == -1 ) {
swap( array, index1, subIndex );
}
else {
swap( array, index1, index2 );
}
Arrays.sort( array, index1 + 1, array.length );
return true;
}
}
final class Converter {
/**
* 渡された文字列を逆順にした文字列を返します。
*
* @param str 元の文字列
*
* @return strを逆順にした文字列
*/
public static String reverse ( final String str ) {
final StringBuilder sb = new StringBuilder();
for ( int i = str.length() - 1; i >= 0; --i ) {
sb.append( str.charAt( i ) );
}
return sb.toString();
}
}
final class MathFunction {
private static final long[] numberForPrime = {2, 7, 61, 325, 9375, 28178, 450775, 9780504, 1795265022};
/**
* aとbの最大公約数を求めます。戻り値は0以上であることが保証されます。
*
* @param a 公約数を求める整数
* @param b 公約数を求める整数
*
* @return aとbの最大公約数
*/
public static long gcd ( long a, long b ) {
a = Math.abs( a );
b = Math.abs( b );
if ( b == 0 ) {
return a;
}
long temp;
while ( ( temp = a % b ) != 0 ) {
a = b;
b = temp;
}
return b;
}
/**
* aとbの最小公倍数を求めます。
* オーバーフロー検知は出来ません。
*
* @param a 公倍数を求める整数
* @param b 公倍数を求める整数
*
* @return aとbの最小公倍数
*/
public static long lcm ( final long a, final long b ) {
return a / gcd( a, b ) * b;
}
/**
* 引数が素数か判定します。
*
* @param n 検査対象
*
* @return nが素数であるならtrue、素数でないならfalse
*/
public static boolean isPrime ( long n ) {
n = Math.abs( n );
if ( n == 2 ) {
return true;
}
if ( n == 1 || ( n & 1 ) == 0 ) {
return false;
}
long d = n - 1;
while ( ( d & 1 ) == 0 ) {
d >>= 1;
}
final BigInteger bigN = BigInteger.valueOf(n);
for ( final long a: numberForPrime ) {
if ( a >= n ) {
return true;
}
long t = d;
long y = bigModPow( a, t, bigN );
while ( t < n - 1 && y != 1 && y != n - 1 ) {
y = bigModPow( y, 2, bigN );
t <<= 1;
}
if ( y != n - 1 && ( t & 1 ) == 0 ) {
return false;
}
}
return true;
}
private static long bigModPow ( final long a, final long b, final BigInteger m ) {
return BigInteger.valueOf( a ).modPow( BigInteger.valueOf( b ), m ).longValue();
}
/**
* num以下の素数を列挙します。
*
* @param num 素数を探す上限値
*
* @return num以下の素数のint型配列
*/
public static int[] primes ( final int num ) {
if ( num < 2 ) {
return new int[0];
}
final BitSet numbers = new BitSet( num + 1 );
numbers.set( 2, num + 1 );
final int limit = ( int )Math.sqrt( num );
for ( int i = 2; i <= limit; ++i ) {
if ( numbers.get( i ) ) {
for ( int j = i * i; j <= num; j += i ) {
if ( numbers.get(j) ) {
numbers.clear( j );
}
}
}
}
final int[] answer = new int[numbers.cardinality()];
int i = 2, index = 0;
do {
i = numbers.nextSetBit( i );
answer[index++] = i++;
} while ( index != answer.length );
return answer;
}
/**
* a**bを計算します。
*
* @param a 被累乗数
* @param b 指数
*
* @return a**b
*/
public static long pow ( long a, long b ) {
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
a *= a;
b >>= 1;
}
return ans;
}
/**
* a**bをmodで割ったあまりを計算します。
*
* @param a 被累乗数
* @param b 指数
* @param mod 法とする整数
*
* @return a**bをmodで割ったあまり
*/
public static long modPow ( long a, long b, final long mod ) {
long ans = 1;
a %= mod;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
ans %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
/**
* N!を計算します。
*
* @param N 階乗を求めるのに用いる値
*
* @return N!
*/
public static long fact ( final int N ) {
long ans = 1;
for ( int i = 2; i <= N; ++i ) {
ans *= i;
}
return ans;
}
/**
* N!をmodで割ったあまりを計算します。
*
* @param N 階乗を求めるのに用いる値
* @param mod 法とする整数
*
* @return N!をmodで割ったあまり
*/
public static long modFact ( final int N, final long mod ) {
long ans = 1;
for ( int i = 2; i <= N; ++i ) {
ans *= i;
ans %= mod;
}
return ans;
}
/**
* nCrを計算します。
*
* @param n 二項係数を求めるのに用いる値
* @param r 二項係数を求めるのに用いる値
*
* @return nCr
*/
public static long combi ( final long n, long r ) {
if ( r < 0 || n < r ) {
return 0;
}
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; ++i ) {
ans *= n - i;
ans /= i + 1;
}
return ans;
}
/**
* nCrをmodで割ったあまりを計算します。
*
* @param n 二項係数を求めるのに用いる値
* @param r 二項係数を求めるのに用いる値
* @param mod 法とする整数
*
* @return nCrをmodで割ったあまり
*/
public static long modCombi ( final long n, long r, final long mod ) {
if ( r < 0 || n < r ) {
return 0;
}
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; ++i ) {
ans *= ( n - i ) % mod;
ans %= mod;
ans *= modPow( i + 1, mod - 2, mod );
ans %= mod;
}
return ans;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param x1 点1のx座標
* @param y1 点1のy座標
* @param x2 点2のx座標
* @param y2 点2のy座標
* @param x3 点3のx座標
* @param y3 点3のy座標
* @param x4 点4のx座標
* @param y4 点4のy座標
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( final int x1, final int y1,
final int x2, final int y2,
final int x3, final int y3,
final int x4, final int y4 ) {
final long s1 = ( long )( x1 - x2 ) * ( y3 - y1 ) - ( long )( y1 - y2 ) * ( x3 - x1 );
final long t1 = ( long )( x1 - x2 ) * ( y4 - y1 ) - ( long )( y1 - y2 ) * ( x4 - x1 );
final long s2 = ( long )( x3 - x4 ) * ( y1 - y3 ) - ( long )( y3 - y4 ) * ( x1 - x3 );
final long t2 = ( long )( x3 - x4 ) * ( y2 - y3 ) - ( long )( y3 - y4 ) * ( x2 - x3 );
final long temp1 = s1 * t1;
final long temp2 = s2 * t2;
if ( temp1 > 0 || temp2 > 0 ) {
return -1;
}
if ( temp1 == 0 && temp2 == 0 ) {
return 0;
}
return 1;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param p1 点1
* @param p2 点2
* @param p3 点3
* @param p4 点4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( final Point p1, final Point p2, final Point p3, final Point p4 ) {
return isCrossed( p1.x, p1.y, p2.x, p2.y, p3.x, p3.y, p4.x, p4.y );
}
/**
* 指定された頂点を順に結んで出来上がる多角形が凸多角形か判定します。
*
* @param points 多角形を構成する点
*
* @return 多角形が凸多角形ならtrue
*/
public static boolean isConvex ( final Point... points ) {
final int n = points.length;
if ( n < 3 ) {
return false;
}
if ( n == 3 ) {
return true;
}
boolean conv = true;
for ( int i = 0; i < n; ++i ) {
int result = isCrossed( points[i], points[( i + 2 ) % n],
points[( i + 1 ) % n], points[( i + 1 + n / 2 ) % n] );
conv &= result >= 0;
}
return conv;
}
/**
* numをmodで割ったあまりを返します。
* 戻り値は0以上mod未満であることが保証されます。
*
* @param num 被除算数
* @param mod 法とする値
*
* @return numをmodで割ったあまり
*/
public static long remainder ( long num, final long mod ) {
num %= mod;
if ( num < 0 ) {
num += mod;
}
return num;
}
/**
* numが何桁かを返します。
* 0は1桁として捉えます。
*
* @param num 調べる整数
*
* @return numの桁数
*/
public static int digit ( final long num ) {
if ( num < 10L ) {
return 1;
}
if ( num < 100L ) {
return 2;
}
if ( num < 1000L ) {
return 3;
}
if ( num < 10000L ) {
return 4;
}
if ( num < 100000L ) {
return 5;
}
if ( num < 1000000L ) {
return 6;
}
if ( num < 10000000L ) {
return 7;
}
if ( num < 100000000L ) {
return 8;
}
if ( num < 1000000000L ) {
return 9;
}
if ( num < 10000000000L ) {
return 10;
}
if ( num < 100000000000L ) {
return 11;
}
if ( num < 1000000000000L ) {
return 12;
}
if ( num < 10000000000000L ) {
return 13;
}
if ( num < 100000000000000L ) {
return 14;
}
if ( num < 1000000000000000L ) {
return 15;
}
if ( num < 10000000000000000L ) {
return 16;
}
if ( num < 100000000000000000L ) {
return 17;
}
if ( num < 1000000000000000000L ) {
return 18;
}
return 19;
}
public static int max ( final int... nums ) {
int ans = Integer.MIN_VALUE;
for ( int num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static long max ( final long... nums ) {
long ans = Long.MIN_VALUE;
for ( long num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static double max ( final double... nums ) {
double ans = -Double.MIN_VALUE;
for ( double num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static <E extends Comparable<E>> E max ( final E[] nums ) {
E ans = nums[0];
for ( E value: nums ) {
if ( ans.compareTo( value ) > 0 ) {
ans = value;
}
}
return ans;
}
public static int min ( final int... nums ) {
int ans = Integer.MAX_VALUE;
for ( int num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static long min ( final long... nums ) {
long ans = Long.MAX_VALUE;
for ( long num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static double min ( final double... nums ) {
double ans = Double.MAX_VALUE;
for ( double num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static <E extends Comparable<E>> E min ( final E[] nums ) {
E ans = nums[0];
for ( E value: nums ) {
if ( ans.compareTo( value ) < 0 ) {
ans = value;
}
}
return ans;
}
public static long sum ( final int... nums ) {
long ans = 0;
for ( int num: nums ) {
ans += num;
}
return ans;
}
public static long sum ( final long... nums ) {
long ans = 0;
for ( long num: nums ) {
ans += num;
}
return ans;
}
public static long modSum ( final long mod, final int... nums ) {
long ans = 0;
for ( int num: nums ) {
ans += num;
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long modSum ( final long mod, final long... nums ) {
long ans = 0;
for ( long num: nums ) {
ans += num;
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long sum ( final int[] nums, int from, int to ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
}
return ans;
}
public static long sum ( final long[] nums, int from, int to ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
}
return ans;
}
public static long modSum ( final int[] nums, int from, int to, long mod ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long modSum ( final long[] nums, int from, int to, long mod ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final int num, final int l, final int r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final long num, final long l, final long r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final double num, final double l, final double r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheck ( final E num, final E l, final E r ) {
return 0 <= l.compareTo( num ) && 0 < num.compareTo( r );
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final int num, final int l, final int r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final long num, final long l, final long r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final double num, final double l, final double r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheckOpen ( final E num, final E l, final E r ) {
return 0 < l.compareTo( num ) && 0 < num.compareTo( r );
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final int num, final int l, final int r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final long num, final long l, final long r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final double num, final double l, final double r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheckClose ( final E num, final E l, final E r ) {
return 0 <= l.compareTo( num ) && 0 <= num.compareTo( r );
}
/**
* 引数の中でのmexを求めます。
*
* @param num
*/
public static int mex ( final int... nums ) {
final IntegerSet set = new IntegerSet( nums.length << 1 );
for ( final int num : nums ) {
set.add( num );
}
int ans = 0;
while ( set.contains( ans ) ) {
++ans;
}
return ans;
}
}
final class Searcher {
private static final int CYCLE_COUNT = Double.MAX_EXPONENT + 53;
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final char[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static int downSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static long downSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限より小さい値を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static double search ( double a, double b, final double value, final DoubleUnaryOperator func ) {
double ans = a - Math.abs( a ), c;
for ( int $ = 0; $ < CYCLE_COUNT; ++$ ) {
c = ( a + b ) / 2;
if ( func.applyAsDouble( c ) > value ) {
b = c;
}
else {
a = ( ans = c );
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> boolean contains ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = array[c].compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* リスト内の指定された要素を探します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return listにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> boolean contains ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = list.get( c ).compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がa以上b以下で探索値を取るかを表すboolean
*/
public static boolean contains ( int a, int b, final int value, final IntUnaryOperator func ) {
int c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int num = func.applyAsInt( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がa以上b以下で探索値を取るかを表すboolean
*/
public static boolean contains ( long a, long b, final long value, final LongUnaryOperator func ) {
long c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
long num = func.applyAsLong( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> int search ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = array[c].compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* リスト内の指定された要素を探します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return listのvalueのインデックス(無ければ - 1)
*/
public static <E extends Comparable<E>> int search ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = list.get( c ).compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がvalueを取る引数(無ければa - 1)
*/
public static int search ( int a, int b, final int value, final IntUnaryOperator func ) {
int c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int num = func.applyAsInt( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return c;
}
}
return a - 1;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がvalueを取る引数(無ければa - 1)
*/
public static long search ( long a, long b, final long value, final LongUnaryOperator func ) {
long c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
long num = func.applyAsLong( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return c;
}
}
return a - 1;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最小の引数を返します。
* 見つからなかった場合は指定された値以上で最大の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以上で最小の引数
*/
public static int upSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最小の引数を返します。
* 見つからなかった場合は指定された値以上で最大の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以上で最小の引数
*/
public static long upSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より小さい要素を探します。
* リスト内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より小さい値を探します。
* 関数内で見つかった場合は条件を満たす最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最大の引数
*/
public static int underSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より小さい値を探します。
* 関数内で見つかった場合は条件を満たす最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最大の引数
*/
public static long underSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より大きい要素を探します。
* リスト内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より大きい値を探します。
* 関数内で見つかった場合は条件を満たす最小の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最小の引数
*/
public static int overSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より大きい値を探します。
* 関数内で見つかった場合は条件を満たす最小の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最小の引数
*/
public static long overSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
}
// Binary Indexed Tree
final class BIT {
final int size;
final private long[] tree;
public BIT ( int n ) {
size = n;
tree = new long[n + 1];
}
public long sum ( int i ) {
long sum = 0;
while ( i > 0 ) {
sum += tree[i];
i ^= i & ( -i );
}
return sum;
}
public void add ( int i, long x ) {
while ( i <= size ) {
tree[i] += x;
i += i & ( -i );
}
}
public void clear () {
Arrays.fill( tree, 0L );
}
}
final class Bitset implements Cloneable {
private final long[] bit;
private final int size, len;
private final long MASK;
public Bitset ( final int len ) {
this.len = len;
size = ( len + 63 ) >> 6;
bit = new long[size];
MASK = ( -1L ) >>> ( ( size << 6 ) - len );
}
private Bitset ( final long[] arr ) {
this( arr.length );
System.arraycopy( arr, 0, bit, 0, size );
}
public void set ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
bit[index >> 6] |= ( 1L << ( index & 0b111111 ) );
}
public void clear ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
long m = ~( 1L << ( index & 0b111111 ) );
bit[index >> 6] &= m;
}
public boolean get ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
return ( bit[index >> 6] & ( 1L << ( index & 0b111111 ) ) ) != 0;
}
public void shiftLeft ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = size - 1; i >= n; --i ) {
bit[i] = ( bit[i - n] << num ) | ( i != n && num != 0 ? bit[i - n - 1] >>> ( 64 - num ) : 0L );
}
for ( int i = 0; i < n; ++i ) {
bit[i] = 0L;
}
bit[size - 1] &= MASK;
}
public void shiftRight ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = 0; i < size - n; ++i ) {
bit[i] = ( bit[i + n] >>> num ) | ( i + n + 1 != size && num != 0 ? bit[i + n + 1] << ( 64 - num ) : 0L );
}
for ( int i = size - 1; i >= size - n; --i ) {
bit[i] = 0L;
}
}
public long[] longValues () {
return bit;
}
public long longValue () {
return bit[0];
}
public void and ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] &= bit2[i];
}
for ( int i = m; i < size; ++i ) {
bit[i] = 0;
}
bit[size - 1] &= MASK;
}
public void or ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] |= bit2[i];
}
bit[size - 1] &= MASK;
}
public void xor ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] ^= bit2[i];
}
bit[size - 1] &= MASK;
}
public Bitset clone () throws CloneNotSupportedException {
super.clone();
final Bitset b = new Bitset( bit );
return b;
}
}
final class IntegerSet {
private class Node {
private final int value;
private Node next;
private Node ( final int val ) {
value = val;
}
private boolean add ( final int x ) {
if ( value == x ) {
return false;
}
if ( next != null ) {
return next.add( x );
}
++size;
next = new Node( x );
return true;
}
private void add ( final Node n ) {
if ( value != n.value ) {
if ( next != null ) {
next.add( n );
}
else {
next = n;
}
}
}
private boolean remove ( final int x ) {
if ( next == null ) {
return false;
}
if ( next.value != x ) {
return next.remove( x );
}
--size;
next = next.next;
return true;
}
private boolean contains ( final int x ) {
if ( value == x ) {
return true;
}
if ( next != null ) {
return next.contains( x );
}
return false;
}
}
private Node[] table;
private int size;
public IntegerSet () {
this( 16 );
}
public IntegerSet ( final int s ) {
if ( s < 1 ) {
throw new NegativeArraySizeException( "hash table's size must be positive" );
}
table = new Node[s];
size = 0;
}
public boolean add ( final int x ) {
sizeCheck();
final int index = hash( x );
if ( table[index] != null ) {
return table[index].add( x );
}
++size;
table[index] = new Node( x );
return true;
}
private void add ( final Node n ) {
final int index = hash( n.value );
if ( table[index] != null ) {
table[index].add( n );
}
else {
table[index] = n;
}
}
public boolean remove ( final int x ) {
final int index = hash( x );
if ( table[index] == null ) {
return false;
}
if ( table[index].value != x ) {
return table[index].remove( x );
}
--size;
table[index] = table[index].next;
return true;
}
public boolean contains ( final int x ) {
final int index = hash( x );
if ( table[index] == null ) {
return false;
}
return table[index].contains( x );
}
private void reHash () {
final Node[] oldTable = table;
table = new Node[table.length << 1];
for ( Node node: oldTable ) {
while ( node != null ) {
final Node next = node.next;
node.next = null;
add( node );
node = next;
}
}
}
private void sizeCheck () {
if ( table.length * 0.6 < size ) {
reHash();
}
}
private int hash ( final int val ) {
final int h = val % table.length;
return h < 0 ? h + table.length : h;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] array = new int[size];
int index = 0;
for ( Node node: table ) {
while ( node != null ) {
array[index++] = node.value;
node = node.next;
}
}
return array;
}
public String toString () {
return Arrays.toString( toArray() );
}
}
final class Matrix {
private final long[][] matrix;
public Matrix ( final int H, final int W, final long def ) {
matrix = new long[H][W];
if ( def != 0 ) {
for ( final long[] mat: matrix ) {
Arrays.fill( mat, def );
}
}
}
public Matrix ( final int H, final int W ) {
this( H, W, 0 );
}
public Matrix ( final Dimension d, final long def ) {
this( d.height, d.width, def );
}
public Matrix ( final long[][] mat ) {
matrix = new long[mat.length][];
for ( int i = 0; i < mat.length; ++i ) {
matrix[i] = Arrays.copyOf( mat[i], mat[i].length );
}
}
public long get ( final int i, final int j ) {
return matrix[i][j];
}
public long set ( final int i, final int j, final long value ) {
return matrix[i][j] = value;
}
public Matrix copy () {
return new Matrix( matrix );
}
public Dimension size () {
return new Dimension( matrix[0].length, matrix.length );
}
public Matrix add ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, matrix[i][j] + m.get( i, j ) );
}
}
return ans;
}
public Matrix subtract ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, matrix[i][j] - m.get( i, j ) );
}
}
return ans;
}
public Matrix multiply ( final Matrix m ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; ++i ) {
for ( int j = 0; j < size.width; ++j ) {
long sum = 0;
for ( int k = 0; k < len; ++k ) {
sum += matrix[i][k] * m.get( k, j );
}
ans.set( i, j, sum );
}
}
return ans;
}
public Matrix modAdd ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, MathFunction.remainder( matrix[i][j] + m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modSubtract ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, MathFunction.remainder( matrix[i][j] - m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modMultiply ( final Matrix m, final long mod ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; ++i ) {
for ( int j = 0; j < size.width; ++j ) {
long sum = 0;
for ( int k = 0; k < len; ++k ) {
sum = MathFunction.remainder( sum + matrix[i][k] * m.get( k, j ), mod );
}
ans.set( i, j, sum );
}
}
return ans;
}
public static Matrix pow ( final Matrix original, final Matrix pw, long exp ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.multiply( a );
}
b = b.multiply( b );
exp >>= 1;
}
return a;
}
public static Matrix modPow ( final Matrix original, final Matrix pw, long exp, final long mod ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.modMultiply( a, mod );
}
b = b.modMultiply( b, mod );
exp >>= 1;
}
return a;
}
public long determinant () {
return determinant( matrix );
}
private static long determinant ( final long[][] mat ) {
if ( mat.length == 1 ) {
return mat[0][0];
}
final long[][] miniMat = new long[mat.length - 1][mat.length - 1];
for ( int i = 1; i < mat.length; ++i ) {
System.arraycopy( mat[i], 1, miniMat[i - 1], 0, miniMat.length );
}
long ans = mat[0][0] * determinant( miniMat );
for ( int i = 1; i < mat.length; ++i ) {
for ( int j = 1; j < mat.length; ++j ) {
miniMat[j - 1][i - 1] = mat[j][i - 1];
}
final long num = mat[0][i] * determinant( miniMat );
ans += i % 2 == 0 ? num : -num;
}
return ans;
}
@Override
public String toString () {
final StringBuilder ans = new StringBuilder();
ans.append( Arrays.toString( matrix[0] ) );
for ( int i = 1; i < matrix.length; ++i ) {
ans.append( "\n" );
ans.append( Arrays.toString( matrix[i] ) );
}
return ans.toString();
}
}
class Pair<K extends Comparable<K>, V extends Comparable<V>>
implements Comparable<Pair<K, V>> {
private AbstractMap.SimpleEntry<K, V> map;
public Pair ( K key, V value ) {
map = new AbstractMap.SimpleEntry<>( key, value );
}
public K getKey () {
return map.getKey();
}
public V getValue () {
return map.getValue();
}
public K setKey ( K key ) {
K oldKey = map.getKey();
V value = map.getValue();
map = new AbstractMap.SimpleEntry<>( key, value );
return oldKey;
}
public V setValue ( V value ) {
return map.setValue( value );
}
@Override
public int compareTo ( Pair<K, V> pair ) {
int com = getKey().compareTo( pair.getKey() );
return com != 0 ? com : getValue().compareTo( pair.getValue() );
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof Pair<?, ?> pair ) {
return getKey().equals( pair.getKey() ) && getValue().equals( pair.getValue() );
}
return false;
}
@Override
public String toString () {
return getKey() + "=" + getValue();
}
@Override
public int hashCode () {
return ( getKey().hashCode() << 2 ) ^ ( getValue().hashCode() );
}
}
final class RollingHash implements Comparable<RollingHash> {
private static final long BASE = new Random().nextInt( 1000 ) + Character.MAX_VALUE + 1;
private static final long MASK30 = ( 1L << 30 ) - 1;
private static final long MASK31 = ( 1L << 31 ) - 1;
private static final long MOD = ( 1L << 61 ) - 1;
private static final long MASK61 = MOD;
private long[] hash;
private String string;
public RollingHash ( final String str ) {
string = str;
hash = new long[str.length() + 1];
roll();
}
private void roll () {
final int len = string.length();
for ( int i = 1; i <= len; ++i ) {
hash[i] = multiply( hash[i - 1], BASE ) + string.charAt( i - 1 ) - ' ' + 1;
if ( MOD <= hash[i] ) {
hash[i] -= MOD;
}
}
}
private static long multiply ( final long a, final long b ) {
final long au = a >> 31;
final long ad = a & MASK31;
final long bu = b >> 31;
final long bd = b & MASK31;
final long mid = ad * bu + au * bd;
final long midu = mid >> 30;
final long midd = mid & MASK30;
return mod( au * bu * 2 + midu + ( midd << 31 ) + ad * bd );
}
private static long mod ( final long x ) {
final long xu = x >> 61;
final long xd = x & MASK61;
long ans = xu + xd;
if ( MOD <= ans ) {
ans -= MOD;
}
return ans;
}
public long getHash ( final int l, final int r ) {
return ( hash[r] - multiply( hash[l], modBasePow( r - l ) ) + MOD ) % MOD;
}
private static long modBasePow ( long b ) {
long ans = 1;
long a = BASE;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans = multiply( ans, a );
}
a = multiply( a, a );
b >>= 1;
}
return ans;
}
public boolean equals ( final RollingHash rh, final int l1, final int r1, final int l2, final int r2 ) {
if ( r1 - l1 != r2 - l2 ) {
return false;
}
return getHash( l1, r1 ) == rh.getHash( l2, r2 );
}
public int length () {
return string.length();
}
@Override
public int hashCode () {
return string.hashCode();
}
@Override
public String toString () {
return string;
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof final RollingHash rh ) {
return equals( rh, 0, length(), 0, rh.length() );
}
return false;
}
@Override
public int compareTo ( RollingHash rh ) {
return string.compareTo( rh.toString() );
}
public int compareTo ( String str ) {
return string.compareTo( str );
}
public char charAt ( final int i ) {
return string.charAt( i );
}
public int compareToIgnoreCase ( final RollingHash rh ) {
return string.compareToIgnoreCase( rh.toString() );
}
public int compareToIgnoreCase ( final String str ) {
return string.compareToIgnoreCase( str );
}
public void concat ( final RollingHash rh ) {
concat( rh.toString() );
}
public void concat ( final String str ) {
string = string.concat( str );
hash = new long[string.length() + 1];
roll();
}
public boolean contains ( final RollingHash rh ) {
final long hash = rh.getHash( 0, rh.length() );
final int len = length() - rh.length();
for ( int i = 0; i <= len; ++i ) {
if ( hash == getHash( i, rh.length() + i ) ) {
return true;
}
}
return false;
}
public boolean contains ( final String str ) {
return indexOf( str ) != -1;
}
public int indexOf ( final int ch ) {
return indexOf( ch, 0 );
}
public int indexOf ( final int ch, final int fromIndex ) {
final int len = length();
for ( int i = fromIndex; i < len; ++i ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int indexOf ( final String str ) {
return indexOf( str, 0 );
}
public int indexOf ( final String str, final int fromIndex ) {
long hash = 0;
for ( final char c: str.toCharArray() ) {
hash = multiply( hash, BASE ) + c - ' ' + 1;
if ( MOD <= hash ) {
hash -= MOD;
}
}
final int len = length() - str.length();
for ( int i = fromIndex; i <= len; ++i ) {
if ( hash == getHash( i, str.length() + i ) ) {
return i;
}
}
return -1;
}
public boolean isEmpty () {
return length() == 0;
}
public int lastIndexOf ( final int ch, final int fromIndex ) {
for ( int i = fromIndex; i >= 0; --i ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int lastIndexOf ( final int ch ) {
return lastIndexOf( ch, length() - 1 );
}
public static RollingHash valueOf ( final boolean b ) {
return new RollingHash( b ? "true" : "false" );
}
public static RollingHash valueOf ( final char c ) {
return new RollingHash( "" + c );
}
public static RollingHash valueOf ( final char[] c ) {
return new RollingHash( String.valueOf( c, 0, c.length ) );
}
public static RollingHash valueOf ( final char[] c, final int offset, final int count ) {
return new RollingHash( String.valueOf( c, offset, count ) );
}
public static RollingHash valueOf ( final double d ) {
return new RollingHash( String.valueOf( d ) );
}
public static RollingHash valueOf ( final float f ) {
return new RollingHash( String.valueOf( f ) );
}
public static RollingHash valueOf ( final int i ) {
return new RollingHash( String.valueOf( i ) );
}
public static RollingHash valueOf ( final long l ) {
return new RollingHash( String.valueOf( l ) );
}
public static RollingHash valueOf ( final Object obj ) {
return new RollingHash( String.valueOf( obj ) );
}
}
abstract class SegmentTree<E> {
final int N, size;
final E def;
final Object[] node;
public SegmentTree ( final int n, final E def, final boolean include ) {
int num = 2;
while ( num < n << 1 ) {
num <<= 1;
}
N = num;
size = num >> 1 - ( include ? 1 : 0 );
node = new Object[N];
this.def = def;
Arrays.fill( node, this.def );
}
public SegmentTree ( final E[] arr, final E def, final boolean include ) {
int num = 2;
while ( num < arr.length << 1 ) {
num <<= 1;
}
N = num;
size = num >> 1 - ( include ? 1 : 0 );
node = new Object[N];
this.def = def;
System.arraycopy( arr, 0, node, N >> 1, arr.length );
for ( int i = arr.length + ( N >> 1 ); i < N; i++ ) {
node[i] = def;
}
updateAll();
}
public SegmentTree ( final int n, final E def ) {
this( n, def, false );
}
@SuppressWarnings( "unchecked" )
private void updateAll () {
for ( int i = ( N >> 1 ) - 1; i > 0; i-- ) {
node[i] = function( ( E )node[i << 1], ( E )node[( i << 1 ) + 1] );
}
}
@SuppressWarnings( "unchecked" )
public void update ( int n, final E value ) {
n += size;
node[n] = value;
n >>= 1;
while ( n > 0 ) {
node[n] = function( ( E )node[n << 1], ( E )node[( n << 1 ) + 1] );
n >>= 1;
}
}
@SuppressWarnings( "unchecked" )
public E get ( final int a ) {
return ( E )node[a + size];
}
@SuppressWarnings( "unchecked" )
public E answer () {
return ( E )node[1];
}
@SuppressWarnings( "unchecked" )
public E query ( int l, int r ) {
l += size;
r += size;
E answer = def;
while ( l > 0 && r > 0 && l <= r ) {
if ( l % 2 == 1 ) {
answer = function( ( E )node[l++], answer );
}
l >>= 1;
if ( r % 2 == 0 ) {
answer = function( answer, ( E )node[r--] );
}
r >>= 1;
}
return answer;
}
abstract public E function ( E a, E b );
}
final class UnionFind {
private final int[] par, rank, size, path;
private int count;
public UnionFind ( final int N ) {
count = N;
par = new int[N];
rank = new int[N];
size = new int[N];
path = new int[N];
Arrays.fill( par, -1 );
Arrays.fill( size, 1 );
}
public int root ( final int ind ) {
if ( par[ind] == -1 ) {
return ind;
}
else {
return par[ind] = root( par[ind] );
}
}
public boolean isSame ( final int x, final int y ) {
return root( x ) == root( y );
}
public boolean unite ( final int x, final int y ) {
int rx = root( x );
int ry = root( y );
++path[rx];
if ( rx == ry ) {
return false;
}
if ( rank[rx] < rank[ry] ) {
int temp = rx;
rx = ry;
ry = temp;
}
par[ry] = rx;
if ( rank[rx] == rank[ry] ) {
++rank[rx];
}
path[rx] += path[ry];
size[rx] += size[ry];
--count;
return true;
}
public int groupCount () {
return count;
}
public int pathCount ( final int x ) {
return path[root( x )];
}
public int size ( final int x ) {
return size[root( x )];
}
}
final class Tree<E extends Comparable<E>> {
private Node<E> root;
private int size, hash;
public Tree () {
size = 0;
root = null;
hash = 0;
}
static final private class Node<E> {
E value;
int height, size;
Node<E> left, right, parent;
public Node ( final Node<E> p, final E v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final E x ) {
boolean bool = true;
if ( root == null ) {
root = new Node<>( null, x );
}
else {
Node<E> par;
Node<E> now = root;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x );
}
else {
par.right = new Node<>( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= x.hashCode();
}
return bool;
}
public E get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node<E> now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.value.hashCode();
delete( n );
return true;
}
private void delete ( final Node<E> node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node<E> rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node<E> rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node<E> getNode ( final E x ) {
Node<E> now = root;
while ( now != null ) {
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public E first () {
if ( root == null ) {
return null;
}
return getFirstNode( root ).value;
}
private Node<E> getFirstNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public E last () {
if ( root == null ) {
return null;
}
return getLastNode( root ).value;
}
private Node<E> getLastNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final E x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public E pollFirst () {
if ( root == null ) {
return null;
}
--size;
final Node<E> min = getFirstNode( root );
hash ^= min.value.hashCode();
delete( min );
return min.value;
}
public E pollLast () {
if ( root == null ) {
return null;
}
--size;
final Node<E> max = getLastNode( root );
hash ^= max.value.hashCode();
delete( max );
return max.value;
}
public E ceiling ( final E x ) {
return ceiling( root, x );
}
private E ceiling ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result > 0 ) {
node = node.right;
}
else if ( result < 0 ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E higher ( final E x ) {
return higher( root, x );
}
private E higher ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result >= 0 ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans != null ? ans.value : null;
}
public E floor ( final E x ) {
return floor( root, x );
}
private E floor ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result < 0 ) {
node = node.left;
}
else if ( result > 0 ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E lower ( final E x ) {
return lower( root, x );
}
private E lower ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result <= 0 ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans != null ? ans.value : null;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public ArrayList<E> toList () {
final ArrayList<E> list = new ArrayList<>();
if ( root != null ) {
final ArrayDeque<Node<E>> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node<E> now = deq.pollLast();
if ( list.size() == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list.add( now.value );
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list.get( list.size() - 1 ).compareTo( now.left.value ) < 0 ) {
deq.add( now );
deq.add( now.left );
}
else {
list.add( now.value );
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final ArrayList<E> list = toList();
return list.toString();
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final Tree<?> tree ) {
if ( size == tree.size() ) {
return false;
}
final ArrayList<E> list1 = toList();
final ArrayList<?> list2 = tree.toList();
for ( int i = 0; i < size; ++i ) {
if ( !list1.get( i ).equals( list2.get( i ) ) ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node<E> node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node<E> node ) {
final Node<E> temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node<E> node ) {
final Node<E> temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node<E> node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeInt {
private Node root;
private int size, hash;
public TreeInt () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
int height, size;
Node left, right, parent;
public Node ( final Node p, final int v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final int x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= x;
}
return bool;
}
public int get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.value;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= min.value;
delete( min );
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= max.value;
delete( max );
return max.value;
}
public int ceiling ( final int x ) {
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
return higher( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
return lower( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] list = new int[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeInt tree ) {
if ( size == tree.size() ) {
return false;
}
final int[] array1 = toArray();
final int[] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeLong {
private Node root;
private int size, hash;
public TreeLong () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
long value;
int height, size;
Node left, right, parent;
public Node ( final Node p, final long v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final long x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public long get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= ( int )x;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= ( int )min.value;
delete( min );
return min.value;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= ( int )max.value;
delete( max );
return max.value;
}
public long ceiling ( final long x ) {
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long higher ( final long x ) {
return higher( root, x );
}
private long higher ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public long floor ( final long x ) {
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public long lower ( final long x ) {
return lower( root, x );
}
private long lower ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return size;
}
public long[] toArray () {
final long[] list = new long[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeLong tree ) {
if ( size == tree.size() ) {
return false;
}
final long[] array1 = toArray();
final long[] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeMulti<E extends Comparable<E>> {
private Node<E> root;
private long size;
private int uniqueSize;
private int hash;
public TreeMulti () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node<E> {
E value;
long count, size;
int height;
Node<E> left, right, parent;
public Node ( final Node<E> p, final E v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final E x ) {
if ( root == null ) {
root = new Node<>( null, x, 1 );
++uniqueSize;
}
else {
Node<E> par;
Node<E> now = root;
boolean bool = true;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x, 1 );
}
else {
par.right = new Node<>( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= x.hashCode();
}
public void add ( final E x, final long sum ) {
if ( root == null ) {
root = new Node<>( null, x, sum );
++uniqueSize;
}
else {
Node<E> par;
Node<E> now = root;
boolean bool = true;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x, sum );
}
else {
par.right = new Node<>( par, x, sum );
}
fix( par );
}
}
size += sum;
hash ^= sum % 2 == 1 ? x.hashCode() : 0;
}
public E get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node<E> now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.hashCode();
delete( n );
return true;
}
public long remove ( final E x, final long sum ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
hash ^= ans % 2 == 1 ? n.hashCode() : 0;
n.count -= ans - 1;
delete( n );
return ans;
}
public long removeAll ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
hash ^= ans % 2 == 1 ? n.hashCode() : 0;
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node<E> node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node<E> rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node<E> rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node<E> getNode ( final E x ) {
Node<E> now = root;
while ( now != null ) {
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public E first () {
if ( root == null ) {
return null;
}
return getFirstNode( root ).value;
}
private Node<E> getFirstNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public E last () {
if ( root == null ) {
return null;
}
return getLastNode( root ).value;
}
private Node<E> getLastNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final E x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final E x ) {
if ( root == null ) {
return 0;
}
Node<E> node = getNode( x );
return node != null ? node.count : 0;
}
public E pollFirst () {
if ( root == null ) {
return null;
}
--size;
final Node<E> min = getFirstNode( root );
hash ^= min.value.hashCode();
final E ans = min.value;
delete( min );
return ans;
}
public E pollLast () {
if ( root == null ) {
return null;
}
--size;
final Node<E> max = getLastNode( root );
hash ^= max.value.hashCode();
final E ans = max.value;
delete( max );
return ans;
}
public E ceiling ( final E x ) {
return ceiling( root, x );
}
private E ceiling ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result > 0 ) {
node = node.right;
}
else if ( result < 0 ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E higher ( final E x ) {
return higher( root, x );
}
private E higher ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result >= 0 ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans != null ? ans.value : null;
}
public E floor ( final E x ) {
return floor( root, x );
}
private E floor ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result < 0 ) {
node = node.left;
}
else if ( result > 0 ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E lower ( final E x ) {
return lower( root, x );
}
private E lower ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result <= 0 ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans != null ? ans.value : null;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public ArrayList<E> toList () {
final ArrayList<E> list = new ArrayList<>();
if ( root != null ) {
final ArrayDeque<Node<E>> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node<E> now = deq.pollLast();
if ( list.size() == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list.add( now.value );
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list.get( list.size() - 1 ).compareTo( now.left.value ) < 0 ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list.add( now.value );
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final ArrayList<E> list = toList();
return list.toString();
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMulti<?> tree ) {
if ( size == tree.size() ) {
return false;
}
final ArrayList<E> array1 = toList();
final ArrayList<?> array2 = tree.toList();
for ( int i = 0; i < size; ++i ) {
if ( !array1.get( i ).equals( array2.get( i ) ) ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node<E> node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node<E> node ) {
final Node<E> temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node<E> node ) {
final Node<E> temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node<E> node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class TreeMultiInt {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public TreeMultiInt () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final int v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final int x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= x;
}
public void add ( final int x, final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
size += sum;
if ( sum % 2 == 1 ) {
hash ^= x;
}
}
public int get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= x;
delete( n );
return true;
}
public long remove ( final int x, final long sum ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
n.count -= ans - 1;
if ( ans % 2 == 1 ) {
hash ^= x;
}
delete( n );
return ans;
}
public long removeAll ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
if ( n.count % 2 == 1 ) {
hash ^= x;
}
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final int x ) {
if ( root == null ) {
return 0;
}
Node node = getNode( x );
return node != null ? node.count : 0;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= min.value;
final int ans = min.value;
delete( min );
return ans;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= max.value;
final int ans = max.value;
delete( max );
return ans;
}
public int ceiling ( final int x ) {
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
return higher( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
return lower( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>( root.height << 1 );
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
public int[] toOneArray () {
final int[] list = new int[( int )size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toOneArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMultiInt tree ) {
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class TreeMultiLong {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public TreeMultiLong () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
long value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final long v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final long x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= ( int )x;
}
public void add ( final long x, final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
size += sum;
if ( sum % 2 == 1 ) {
hash ^= ( int )x;
}
}
public long get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= x;
delete( n );
return true;
}
public long remove ( final long x, final long sum ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
n.count -= ans - 1;
if ( ans % 2 == 1 ) {
hash ^= ( int )x;
}
delete( n );
return ans;
}
public long removeAll ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
if ( n.count % 2 == 1 ) {
hash ^= ( int )x;
}
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final long x ) {
if ( root == null ) {
return 0;
}
final Node node = getNode( x );
return node != null ? node.count : 0;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= ( int )min.value;
final long ans = min.value;
delete( min );
return ans;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= ( int )max.value;
final long ans = max.value;
delete( max );
return ans;
}
public long ceiling ( final long x ) {
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long higher ( final long x ) {
return higher( root, x );
}
private long higher ( Node node, final long x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public long floor ( final long x ) {
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public long lower ( final long x ) {
return lower( root, x );
}
private long lower ( Node node, final long x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
ArrayDeque<Node> deq = new ArrayDeque<>( root.height << 1 );
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
public long[] toOneArray () {
final long[] list = new long[( int )size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toOneArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMultiInt tree ) {
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class SimpleScanner {
private final int BUFF_SIZE = 1 << 17;
private final InputStream is;
private final byte[] buff;
private int point, length;
public SimpleScanner ( final InputStream is ) {
this.is = is;
buff = new byte[BUFF_SIZE];
point = length = 0;
}
private void reload () {
do {
try {
length = is.read( buff, point = 0, BUFF_SIZE );
} catch ( final IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
} while ( length == -1 );
}
private byte read () {
if ( point == length ) {
reload();
}
return buff[point++];
}
public byte nextByte () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return c;
}
public int nextInt () {
int ans = 0;
byte c = nextByte();
final boolean negate = c == '-';
if ( !MathFunction.rangeCheckClose( c, '0', '9' ) ) {
c = read();
}
while ( MathFunction.rangeCheckClose( c, '0', '9' ) ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public long nextLong () {
long ans = 0;
byte c = nextByte();
final boolean negate = c == '-';
if ( !MathFunction.rangeCheckClose( c, '0', '9' ) ) {
c = read();
}
while ( MathFunction.rangeCheckClose( c, '0', '9' ) ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public char nextChar () {
return ( char )nextByte();
}
public String next () {
final StringBuilder ans = new StringBuilder();
byte c = nextByte();
while ( c > ' ' ) {
ans.append( ( char )c );
c = read();
}
return ans.toString();
}
public byte[] nextByte ( final int n ) {
final byte[] ans = new byte[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextByte();
}
return ans;
}
public int[] nextInt ( final int n ) {
final int[] ans = new int[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextInt();
}
return ans;
}
public long[] nextLong ( final int n ) {
final long[] ans = new long[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextLong();
}
return ans;
}
public String[] next ( final int n ) {
final String[] ans = new String[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = next();
}
return ans;
}
public byte[][] nextByte ( final int n, final int m ) {
final byte[][] ans = new byte[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextByte( m );
}
return ans;
}
public int[][] nextInt ( final int n, final int m ) {
final int[][] ans = new int[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextInt( m );
}
return ans;
}
public long[][] nextLong ( final int n, final int m ) {
final long[][] ans = new long[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextLong( m );
}
return ans;
}
public String[][] next ( final int n, final int m ) {
final String[][] ans = new String[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = next( m );
}
return ans;
}
public char[] nextCharArray () {
return next().toCharArray();
}
public char[][] nextCharArray ( final int n ) {
final char[][] ans = new char[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextCharArray();
}
return ans;
}
public int[][] nextGraph ( final int N, final int M ) {
if ( M == 0 ) {
return new int[N + 1][0];
}
final int[][] ans = new int[N + 1][];
final int[] count = new int[N + 1];
final int[][] path = nextInt( M, 2 );
for ( final int[] temp: path ) {
++count[temp[0]];
++count[temp[1]];
}
for ( int i = 1; i <= N; ++i ) {
ans[i] = new int[count[i]];
}
for ( final int[] temp: path ) {
ans[temp[0]][--count[temp[0]]] = temp[1];
ans[temp[1]][--count[temp[1]]] = temp[0];
}
ans[0] = new int[0];
return ans;
}
public Point nextPoint () {
return new Point( nextInt(), nextInt() );
}
public Point[] nextPoint ( final int n ) {
final Point[] ans = new Point[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextPoint();
}
return ans;
}
public void close () {
try {
is.close();
} catch ( final IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
}
}
final class SimpleOutputStream extends FilterOutputStream {
private final byte buf[];
private int count;
public SimpleOutputStream(final OutputStream out) {
this(out, 1<<17);
}
public SimpleOutputStream(final OutputStream out, final int size) {
super(out);
if (size <= 0) {
throw new IllegalArgumentException("Buffer size <= 0");
}
buf = new byte[size];
}
private void flushBuffer() throws IOException {
if (count > 0) {
out.write(buf, 0, count);
count = 0;
}
}
public void write(final int b) throws IOException {
if (count >= buf.length) {
flushBuffer();
}
buf[count++] = (byte)b;
}
public void write(final byte b[], final int off, final int len) throws IOException {
if (len >= buf.length) {
flushBuffer();
out.write(b, off, len);
return;
}
if (len > buf.length - count) {
flushBuffer();
}
System.arraycopy(b, off, buf, count, len);
count += len;
}
public void flush() throws IOException {
flushBuffer();
out.flush();
}
}
final class SimpleWriter implements Appendable, Closeable, Flushable, AutoCloseable{
private Writer out;
private final boolean autoFlush;
private boolean trouble = false;
private Formatter formatter;
private PrintStream psOut = null;
private static Charset toCharset ( final String csn ) {
if ( csn == null ) {
throw new NullPointerException( "charsetName" );
}
try {
return Charset.forName( csn );
} catch ( IllegalCharsetNameException |
UnsupportedCharsetException e ) {
e.printStackTrace();
System.exit( 1 );
return null;
}
}
public SimpleWriter ( final Writer out ) {
this( out, false );
}
public SimpleWriter ( final Writer out, final boolean autoFlush ) {
this.out = out;
this.autoFlush = autoFlush;
}
public SimpleWriter ( final OutputStream out ) {
this( out, false );
}
public SimpleWriter ( final OutputStream out, final boolean autoFlush ) {
this(out, autoFlush, Charset.defaultCharset());
}
public SimpleWriter(final OutputStream out, final boolean autoFlush, final Charset charset) {
this(new BufferedWriter(new OutputStreamWriter(new SimpleOutputStream(out), charset)), autoFlush);
if (out instanceof PrintStream) {
psOut = (PrintStream) out;
}
}
private void ensureOpen () throws IOException {
if ( out == null ) {
throw new IOException( "Stream closed" );
}
}
public void flush () {
try {
ensureOpen();
out.flush();
} catch ( IOException x ) {
trouble = true;
}
}
public void close () {
try {
if ( out == null ) {
return;
}
out.close();
out = null;
} catch ( IOException x ) {
trouble = true;
}
}
public boolean checkError () {
if ( out != null ) {
flush();
}
else if ( psOut != null ) {
return psOut.checkError();
}
return trouble;
}
private void setError () {
trouble = true;
}
private void clearError () {
trouble = false;
}
public void write ( final int c ) {
try {
ensureOpen();
out.write( c );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final char[] buf, final int off, final int len ) {
try {
ensureOpen();
out.write( buf, off, len );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final char[] buf ) {
write( buf, 0, buf.length );
}
public void write ( final String s, final int off, final int len ) {
try {
ensureOpen();
out.write( s, off, len );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final String s ) {
write( s, 0, s.length() );
}
private void newLine () {
try {
ensureOpen();
out.write( System.lineSeparator() );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void print ( final boolean b ) {
write( b ? "true" : "false" );
}
public void print ( final char c ) {
write( c );
}
public void print ( final int i ) {
write( String.valueOf( i ) );
}
public void print ( final long l ) {
write( String.valueOf( l ) );
}
public void print ( final float f ) {
write( String.valueOf( f ) );
}
public void print ( final double d ) {
write( String.valueOf( d ) );
}
public void print ( final char[] s ) {
write( s );
}
public void print ( final String s ) {
write( s );
}
public void print ( final Object obj ) {
write( obj.toString() );
}
public void println () {
newLine();
}
public void println ( final boolean x ) {
print( x );
println();
}
public void println ( final char x ) {
print( x );
println();
}
public void println ( final int x ) {
print( x );
println();
}
public void println ( final long x ) {
print( x );
println();
}
public void println ( final float x ) {
print( x );
println();
}
public void println ( final double x ) {
print( x );
println();
}
public void println ( final char[] x ) {
print( x );
println();
}
public void println ( final String x ) {
print( x );
println();
}
public void println ( final Object x ) {
print( x.toString() );
println();
}
public SimpleWriter printf ( final String format, final Object... args ) {
return format( format, args );
}
public SimpleWriter printf ( final Locale l, final String format, final Object... args ) {
return format( l, format, args );
}
public SimpleWriter format ( final String format, final Object... args ) {
try {
ensureOpen();
if ( ( formatter == null )
|| ( formatter.locale() != Locale.getDefault() ) ) {
formatter = new Formatter( this );
}
formatter.format( Locale.getDefault(), format, args );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
return this;
}
public SimpleWriter format ( final Locale l, final String format, final Object... args ) {
try {
ensureOpen();
if ( ( formatter == null ) || ( formatter.locale() != l ) ) {
formatter = new Formatter( this, l );
}
formatter.format( l, format, args );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
return this;
}
public SimpleWriter append ( final CharSequence csq ) {
write( String.valueOf( csq ) );
return this;
}
public SimpleWriter append ( CharSequence csq, final int start, final int end ) {
if ( csq == null ) {
csq = "null";
}
return append( csq.subSequence( start, end ) );
}
public SimpleWriter append ( final char c ) {
write( c );
return this;
}
public void println ( final int[] array ) {
println( array, ' ' );
}
public void println ( final int[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final int[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final int[][] array ) {
println( array, ' ' );
}
public void println ( final int[][] arrays, final String str ) {
for ( final int[] array: arrays ) {
println( array, str );
}
}
public void println ( final int[][] arrays, final char c ) {
for ( final int[] array: arrays ) {
println( array, c );
}
}
public void println ( final long[] array ) {
println( array, ' ' );
}
public void println ( final long[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final long[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final long[][] array ) {
println( array, ' ' );
}
public void println ( final long[][] arrays, final String str ) {
for ( final long[] array: arrays ) {
println( array, str );
}
}
public void println ( final long[][] arrays, final char c ) {
for ( final long[] array: arrays ) {
println( array, c );
}
}
public void println ( final double[] array ) {
println( array, ' ' );
}
public void println ( final double[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final double[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final double[][] array ) {
println( array, ' ' );
}
public void println ( final double[][] arrays, final String str ) {
for ( final double[] array: arrays ) {
println( array, str );
}
}
public void println ( final double[][] arrays, final char c ) {
for ( final double[] array: arrays ) {
println( array, c );
}
}
public void println ( final char[] cs, final String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; ++i ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( final char[] cs, final char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; ++i ) {
print( c );
print( cs[i] );
}
println();
}
public void println ( final char[][] cs ) {
for ( final char[] c: cs ) {
println( c );
}
}
public void println ( final char[][] cs, final String str ) {
for ( final char[] c: cs ) {
println( c, str );
}
}
public void println ( final char[][] cs, final char c ) {
for ( final char[] cc: cs ) {
println( cc, c );
}
}
public <E> void println ( final E[] array ) {
println( array, ' ' );
}
public <E> void println ( final E[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public <E> void println ( final E[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public <E> void println ( final E[][] arrays ) {
println( arrays, ' ' );
}
public <E> void println ( final E[][] arrays, final String str ) {
for ( final E[] array: arrays ) {
println( array, str );
}
}
public <E> void println ( final E[][] arrays, final char c ) {
for ( final E[] array: arrays ) {
println( array, c );
}
}
}
import java.io.Writer;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.io.OutputStream;
import java.io.FilterOutputStream;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.Flushable;
import java.io.IOException;
import java.io.InterruptedIOException;
import java.nio.charset.Charset;
import java.nio.charset.IllegalCharsetNameException;
import java.nio.charset.UnsupportedCharsetException;
import java.math.BigInteger;
import java.awt.Point;
import java.awt.Dimension;
import java.util.*;
import java.util.stream.*;
import java.util.function.*;
final class Main {
private static final boolean autoFlush = false;
private static final SimpleScanner sc = new SimpleScanner( System.in );
private static final SimpleWriter out = new SimpleWriter( System.out, autoFlush );
public static void main ( String[] args ) {
int N = sc.nextInt();
int K = sc.nextInt();
int P = sc.nextInt();
int len = (int)MathFunction.pow(P+1,K);
long max = Long.MAX_VALUE>>1;
long[] dp = new long[len];
long[] next = new long[len];
Arrays.fill(dp,max);
dp[0] = 0;
IntegerSet set = new IntegerSet();
set.add(0);
while(N-->0){
int C = sc.nextInt();
int[] A = sc.nextInt(K);
Arrays.fill(next,max);
for(int num:set.toArray()){
int nextNum = 0;
int mult = 1;
int bef = num;
for(int i=K-1;i>=0;i--){
int m = num%(P+1);
num /= P+1;
nextNum += mult*Math.min(P,m+A[i]);
mult *= P+1;
}
set.add(nextNum);
next[nextNum] = MathFunction.min(next[nextNum],dp[nextNum],dp[bef]+C);
next[bef] = Math.min(next[bef],dp[bef]);
}
var temp = dp;
dp = next;
next = temp;
}
out.println(dp[len-1]==max?-1:dp[len-1]);
out.close();
}
}
/*
／￣＼
| |
＼＿／
|
／ ￣ ￣ ＼
／ ＼ ／ ＼
／ ⌒ ⌒ ＼ よくぞこの提出結果を開いてくれた
| （__人__） | 褒美としてオプーナを買う権利をやる
＼ ｀⌒´ ／ ☆
/ヽ､--ー､＿＿, -‐ ´ ＼─／
／ > ヽ▼●▼<＼ ||ｰ､.
/ヽ､ ＼ i |｡| |/ ヽ (ニ､`ヽ.
l ヽ l |｡| | r-､y ｀ﾆ ﾉ ＼
l | |ー─ | ￣ l ｀~ヽ＿ノ＿_
／￣￣￣￣ヽ-'ヽ--' ／ オープナ ／|
|￣￣￣￣￣￣|／| |￣￣￣￣￣￣|／| ＿＿＿＿＿＿
／￣オプーナ／|￣|__｣／_オープナ ／|￣|__,」＿_ ／|
|￣￣￣￣￣|／オープナ￣／￣￣￣￣|／オプーナ ／| ／ |
|￣￣￣￣￣|￣￣￣￣￣|／l￣￣￣￣|￣￣￣￣￣|／| ／
|￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣￣|
*/
/*////////////////////////////////////////////////
* My Library *
@author viral
*/////////////////////////////////////////////////
final class Factorial {
//階乗とその逆元
private final long[] fact, inFact;
private final long mod;
/**
* 1～Nの階乗とその逆元をmodで割ったあまりを事前に計算します。
*
* @param N 計算範囲
* @param mod 法
*/
public Factorial ( final int N, final long mod ) {
fact = new long[N + 1];
fact[0] = fact[1] = 1;
for ( int i = 2; i <= N; ++i ) {
fact[i] = fact[i - 1] * i % mod;
}
inFact = new long[N + 1];
inFact[N] = MathFunction.modPow( fact[N], mod - 2, mod );
for ( int i = N; i > 0; --i ) {
inFact[i - 1] = inFact[i] * i % mod;
}
inFact[0] = 1;
this.mod = mod;
}
/**
* num!をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getFact ( final int num ) {
return fact[num];
}
/**
* num!^-1をmodで割ったあまりを返します。
*
* @param num
*
* @return num!
*/
public long getInFact ( final int num ) {
return inFact[num];
}
/**
* aCbをmodで割ったあまりを返します。
*
* @param a
* @param b
*
* @return aCb
*/
public long getCombi ( final int a, final int b ) {
if ( a < b || a < 0 || b < 0 ) {
return 0;
}
return ( fact[a] * inFact[a - b] % mod ) * inFact[b] % mod;
}
}
final class ArrayFunction {
/**
* カウントソートによるソートです。
* 各要素が0以上であり最大値が十分小さい時はこちらの使用を推奨します。
*
* @param array ソート対象のint型配列
* @param maximumLimit array内の最大要素
*/
public static void countSort ( final int[] array, final int maximumLimit ) {
final int[] list = new int[maximumLimit + 1];
for ( final int num: array ) {
++list[num];
}
int temp = 0;
for ( int i = 0; i < list.length; ++i ) {
while ( list[i]-- > 0 ) {
array[temp++] = i;
}
}
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static int[][] rotateR ( final int[][] array ) {
final int[][] ans = new int[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static long[][] rotateR ( final long[][] array ) {
final long[][] ans = new long[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static char[][] rotateR ( final char[][] array ) {
final char[][] ans = new char[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static double[][] rotateR ( final double[][] array ) {
final double[][] ans = new double[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static boolean[][] rotateR ( final boolean[][] array ) {
final boolean[][] ans = new boolean[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を右周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static <E> E[][] rotateR ( final E[][] array, final E[][] ans ) {
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[ans[i].length - j - 1][i];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static int[][] rotateL ( final int[][] array ) {
final int[][] ans = new int[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
final int index = i;
Arrays.setAll( ans[i], k -> array[k][ans.length - index - 1] );
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static long[][] rotateL ( final long[][] array ) {
final long[][] ans = new long[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
final int index = i;
Arrays.setAll( ans[i], k -> array[k][ans.length - index - 1] );
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static char[][] rotateL ( final char[][] array ) {
final char[][] ans = new char[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static double[][] rotateL ( final double[][] array ) {
final double[][] ans = new double[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static boolean[][] rotateL ( final boolean[][] array ) {
final boolean[][] ans = new boolean[array[0].length][array.length];
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 配列を左周りに90度回転させたものを返します。
* 長方形でない配列に関しての動作は保証していません。
*
* @param array 回転させる行列
*
* @return 回転させた配列
*/
public static <E> E[][] rotateL ( final E[][] array, final E[][] ans ) {
for ( int i = 0; i < ans.length; ++i ) {
for ( int j = 0; j < ans[i].length; ++j ) {
ans[i][j] = array[j][ans.length - i - 1];
}
}
return ans;
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長狭義増加部分列の長さを返します。
*
* @param array 最長狭義増加部分列の長さを求める配列
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array ) {
return lis( array, false );
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p ) {
return lis( arrays, p, false );
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( int[] array, boolean include ) {
int[] list = new int[array.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int num: array ) {
int index = include ? Searcher.overSearch( list, num ) : Searcher.upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = Searcher.underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( int[][] arrays, int p, boolean include ) {
int[] list = new int[arrays.length];
Arrays.fill( list, Integer.MAX_VALUE );
for ( int[] array: arrays ) {
int index = include ? Searcher.overSearch( list, array[p] ) : Searcher.upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = Searcher.underSearch( list, Integer.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列の最長増加部分列の長さを返します。
*
* @param array 最長増加部分列の長さを求める配列
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return 最長狭義増加部分列の長さ
*/
public static int lis ( long[] array, boolean include ) {
long[] list = new long[array.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long num: array ) {
int index = include ? Searcher.overSearch( list, num ) : Searcher.upSearch( list, num );
list[index] = Math.min( list[index], num );
}
int answer = Searcher.underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の配列指定されたインデックスの最長狭義増加部分列の長さを返します。
*
* @param arrays 最長狭義増加部分列の長さを求める配列
* @param p 探索する配列のインデックス
* @param include 広義増加列ならtrue、狭義増加列ならfalse
*
* @return arrays[i][p](0 < = p < = arrays.length)の最長狭義増加部分列の長さ
*/
public static int lis ( long[][] arrays, int p, boolean include ) {
long[] list = new long[arrays.length];
Arrays.fill( list, Long.MAX_VALUE );
for ( long[] array: arrays ) {
int index = include ? Searcher.overSearch( list, array[p] ) : Searcher.upSearch( list, array[p] );
list[index] = Math.min( list[index], array[p] );
}
int answer = Searcher.underSearch( list, Long.MAX_VALUE );
return answer + 1;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値は辺を表すint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( final ArrayList<ArrayList<Integer>> route ) {
final int[] count = new int[route.size()];
int pathCount = 0;
for ( final ArrayList<Integer> path: route ) {
for ( final int point: path ) {
++pathCount;
++count[point];
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; ++i ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( final int nextP: route.get( nowP ) ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の情報から求められる有向辺に対してトポロジカルソートを行ないます。
* 戻り値は辺を表すint型二次元配列です。
*
* @param route 有向グラフの隣接リスト
*
* @return トポロジカルソート済み有向グラフ
*/
public static int[][] topologicalSort ( final int[][] route ) {
final int[] count = new int[route.length];
int pathCount = 0;
for ( final int[] path: route ) {
for ( final int point: path ) {
++pathCount;
++count[point];
}
}
final ArrayDeque<Integer> deq = new ArrayDeque<>();
for ( int i = 1; i < count.length; ++i ) {
if ( count[i] == 0 ) {
deq.add( i );
}
}
final int[][] ans = new int[pathCount][2];
int index = 0;
while ( deq.size() > 0 ) {
int nowP = deq.pollFirst();
for ( final int nextP: route[nowP] ) {
ans[index][0] = nowP;
ans[index++][1] = nextP;
if ( --count[nextP] == 0 ) {
deq.add( nextP );
}
}
}
return ans;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final int[] array, final int a, final int b ) {
final int temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final long[] array, final int a, final int b ) {
final long temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final double[] array, final int a, final int b ) {
final double temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final char[] array, final int a, final int b ) {
final char temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static void swap ( final boolean[] array, final int a, final int b ) {
final boolean temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元
* @param b 交換先
*/
public static <E> void swap ( final E[] array, final int a, final int b ) {
final E temp = array[a];
array[a] = array[b];
array[b] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final int[][] array, final int a, final int b, final int c, final int d ) {
final int temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final long[][] array, final int a, final int b, final int c, final int d ) {
final long temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final double[][] array, final int a, final int b, final int c, final int d ) {
final double temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final char[][] array, final int a, final int b, final int c, final int d ) {
final char temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static void swap ( final boolean[][] array, final int a, final int b, final int c, final int d ) {
final boolean temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の位置の要素を交換します。
*
* @param array 交換する要素の含まれる配列
* @param a 交換元の第1インデックス
* @param b 交換元の第2インデックス
* @param c 交換先の第1インデックス
* @param d 交換先の第2インデックス
*/
public static <E> void swap ( final E[][] array, final int a, final int b, final int c, final int d ) {
final E temp = array[a][b];
array[a][b] = array[c][d];
array[c][d] = temp;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final int[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
int min = Integer.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final long[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
long min = Long.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static boolean nextPermutation ( final char[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1] < array[i] ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = 0;
int min = Integer.MAX_VALUE;
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
}
swap( array, index1, index2 );
Arrays.sort( array, index1 + 1, array.length );
return true;
}
/**
* 引数の配列の要素を並び替えた時の、辞書順で引数の次に当たる順番に並び替えます。
* 原則として、要素に重複が無いものとして処理します。重複がある場合の戻り値は保証されていません。
*
* @param array 並び替え対象の配列
*
* @return 辞書順で次に当たる配列がある場合はtrue、arrayが降順に並んでいるならfalse
*/
public static <E extends Comparable<E>> boolean nextPermutation ( final E[] array ) {
int index1 = 0;
for ( int i = 1; i < array.length; ++i ) {
if ( array[i - 1].compareTo( array[i] ) < 0 ) {
index1 = i;
}
}
if ( --index1 < 0 ) {
return false;
}
int index2 = -1;
E min = MathFunction.max( array );
int subIndex = -1;
E max = array[index1];
for ( int i = index1 + 1; i < array.length; ++i ) {
if ( MathFunction.rangeCheckOpen( array[i], array[index1], min ) ) {
min = array[i];
index2 = i;
}
if ( max.compareTo( array[i] ) < 0 ) {
subIndex = i;
max = array[i];
}
}
if ( index2 == -1 ) {
swap( array, index1, subIndex );
}
else {
swap( array, index1, index2 );
}
Arrays.sort( array, index1 + 1, array.length );
return true;
}
}
final class Converter {
/**
* 渡された文字列を逆順にした文字列を返します。
*
* @param str 元の文字列
*
* @return strを逆順にした文字列
*/
public static String reverse ( final String str ) {
final StringBuilder sb = new StringBuilder();
for ( int i = str.length() - 1; i >= 0; --i ) {
sb.append( str.charAt( i ) );
}
return sb.toString();
}
}
final class MathFunction {
private static final long[] numberForPrime = {2, 7, 61, 325, 9375, 28178, 450775, 9780504, 1795265022};
/**
* aとbの最大公約数を求めます。戻り値は0以上であることが保証されます。
*
* @param a 公約数を求める整数
* @param b 公約数を求める整数
*
* @return aとbの最大公約数
*/
public static long gcd ( long a, long b ) {
a = Math.abs( a );
b = Math.abs( b );
if ( b == 0 ) {
return a;
}
long temp;
while ( ( temp = a % b ) != 0 ) {
a = b;
b = temp;
}
return b;
}
/**
* aとbの最小公倍数を求めます。
* オーバーフロー検知は出来ません。
*
* @param a 公倍数を求める整数
* @param b 公倍数を求める整数
*
* @return aとbの最小公倍数
*/
public static long lcm ( final long a, final long b ) {
return a / gcd( a, b ) * b;
}
/**
* 引数が素数か判定します。
*
* @param n 検査対象
*
* @return nが素数であるならtrue、素数でないならfalse
*/
public static boolean isPrime ( long n ) {
n = Math.abs( n );
if ( n == 2 ) {
return true;
}
if ( n == 1 || ( n & 1 ) == 0 ) {
return false;
}
long d = n - 1;
while ( ( d & 1 ) == 0 ) {
d >>= 1;
}
final BigInteger bigN = BigInteger.valueOf(n);
for ( final long a: numberForPrime ) {
if ( a >= n ) {
return true;
}
long t = d;
long y = bigModPow( a, t, bigN );
while ( t < n - 1 && y != 1 && y != n - 1 ) {
y = bigModPow( y, 2, bigN );
t <<= 1;
}
if ( y != n - 1 && ( t & 1 ) == 0 ) {
return false;
}
}
return true;
}
private static long bigModPow ( final long a, final long b, final BigInteger m ) {
return BigInteger.valueOf( a ).modPow( BigInteger.valueOf( b ), m ).longValue();
}
/**
* num以下の素数を列挙します。
*
* @param num 素数を探す上限値
*
* @return num以下の素数のint型配列
*/
public static int[] primes ( final int num ) {
if ( num < 2 ) {
return new int[0];
}
final BitSet numbers = new BitSet( num + 1 );
numbers.set( 2, num + 1 );
final int limit = ( int )Math.sqrt( num );
for ( int i = 2; i <= limit; ++i ) {
if ( numbers.get( i ) ) {
for ( int j = i * i; j <= num; j += i ) {
if ( numbers.get(j) ) {
numbers.clear( j );
}
}
}
}
final int[] answer = new int[numbers.cardinality()];
int i = 2, index = 0;
do {
i = numbers.nextSetBit( i );
answer[index++] = i++;
} while ( index != answer.length );
return answer;
}
/**
* a**bを計算します。
*
* @param a 被累乗数
* @param b 指数
*
* @return a**b
*/
public static long pow ( long a, long b ) {
long ans = 1;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
a *= a;
b >>= 1;
}
return ans;
}
/**
* a**bをmodで割ったあまりを計算します。
*
* @param a 被累乗数
* @param b 指数
* @param mod 法とする整数
*
* @return a**bをmodで割ったあまり
*/
public static long modPow ( long a, long b, final long mod ) {
long ans = 1;
a %= mod;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans *= a;
}
ans %= mod;
a *= a;
a %= mod;
b >>= 1;
}
return ans;
}
/**
* N!を計算します。
*
* @param N 階乗を求めるのに用いる値
*
* @return N!
*/
public static long fact ( final int N ) {
long ans = 1;
for ( int i = 2; i <= N; ++i ) {
ans *= i;
}
return ans;
}
/**
* N!をmodで割ったあまりを計算します。
*
* @param N 階乗を求めるのに用いる値
* @param mod 法とする整数
*
* @return N!をmodで割ったあまり
*/
public static long modFact ( final int N, final long mod ) {
long ans = 1;
for ( int i = 2; i <= N; ++i ) {
ans *= i;
ans %= mod;
}
return ans;
}
/**
* nCrを計算します。
*
* @param n 二項係数を求めるのに用いる値
* @param r 二項係数を求めるのに用いる値
*
* @return nCr
*/
public static long combi ( final long n, long r ) {
if ( r < 0 || n < r ) {
return 0;
}
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; ++i ) {
ans *= n - i;
ans /= i + 1;
}
return ans;
}
/**
* nCrをmodで割ったあまりを計算します。
*
* @param n 二項係数を求めるのに用いる値
* @param r 二項係数を求めるのに用いる値
* @param mod 法とする整数
*
* @return nCrをmodで割ったあまり
*/
public static long modCombi ( final long n, long r, final long mod ) {
if ( r < 0 || n < r ) {
return 0;
}
long ans = 1;
r = Math.min( n - r, r );
for ( int i = 0; i < r; ++i ) {
ans *= ( n - i ) % mod;
ans %= mod;
ans *= modPow( i + 1, mod - 2, mod );
ans %= mod;
}
return ans;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param x1 点1のx座標
* @param y1 点1のy座標
* @param x2 点2のx座標
* @param y2 点2のy座標
* @param x3 点3のx座標
* @param y3 点3のy座標
* @param x4 点4のx座標
* @param y4 点4のy座標
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( final int x1, final int y1,
final int x2, final int y2,
final int x3, final int y3,
final int x4, final int y4 ) {
final long s1 = ( long )( x1 - x2 ) * ( y3 - y1 ) - ( long )( y1 - y2 ) * ( x3 - x1 );
final long t1 = ( long )( x1 - x2 ) * ( y4 - y1 ) - ( long )( y1 - y2 ) * ( x4 - x1 );
final long s2 = ( long )( x3 - x4 ) * ( y1 - y3 ) - ( long )( y3 - y4 ) * ( x1 - x3 );
final long t2 = ( long )( x3 - x4 ) * ( y2 - y3 ) - ( long )( y3 - y4 ) * ( x2 - x3 );
final long temp1 = s1 * t1;
final long temp2 = s2 * t2;
if ( temp1 > 0 || temp2 > 0 ) {
return -1;
}
if ( temp1 == 0 && temp2 == 0 ) {
return 0;
}
return 1;
}
/**
* 引数の前半二点、後半二点で構成される二線分が交差しているか返します。
*
* @param p1 点1
* @param p2 点2
* @param p3 点3
* @param p4 点4
*
* @return 交差している(線分の端が他方の線分上に存在する場合も含む)場合は1、同一線分直線上なら0、それ以外は-1
*/
public static int isCrossed ( final Point p1, final Point p2, final Point p3, final Point p4 ) {
return isCrossed( p1.x, p1.y, p2.x, p2.y, p3.x, p3.y, p4.x, p4.y );
}
/**
* 指定された頂点を順に結んで出来上がる多角形が凸多角形か判定します。
*
* @param points 多角形を構成する点
*
* @return 多角形が凸多角形ならtrue
*/
public static boolean isConvex ( final Point... points ) {
final int n = points.length;
if ( n < 3 ) {
return false;
}
if ( n == 3 ) {
return true;
}
boolean conv = true;
for ( int i = 0; i < n; ++i ) {
int result = isCrossed( points[i], points[( i + 2 ) % n],
points[( i + 1 ) % n], points[( i + 1 + n / 2 ) % n] );
conv &= result >= 0;
}
return conv;
}
/**
* numをmodで割ったあまりを返します。
* 戻り値は0以上mod未満であることが保証されます。
*
* @param num 被除算数
* @param mod 法とする値
*
* @return numをmodで割ったあまり
*/
public static long remainder ( long num, final long mod ) {
num %= mod;
if ( num < 0 ) {
num += mod;
}
return num;
}
/**
* numが何桁かを返します。
* 0は1桁として捉えます。
*
* @param num 調べる整数
*
* @return numの桁数
*/
public static int digit ( final long num ) {
if ( num < 10L ) {
return 1;
}
if ( num < 100L ) {
return 2;
}
if ( num < 1000L ) {
return 3;
}
if ( num < 10000L ) {
return 4;
}
if ( num < 100000L ) {
return 5;
}
if ( num < 1000000L ) {
return 6;
}
if ( num < 10000000L ) {
return 7;
}
if ( num < 100000000L ) {
return 8;
}
if ( num < 1000000000L ) {
return 9;
}
if ( num < 10000000000L ) {
return 10;
}
if ( num < 100000000000L ) {
return 11;
}
if ( num < 1000000000000L ) {
return 12;
}
if ( num < 10000000000000L ) {
return 13;
}
if ( num < 100000000000000L ) {
return 14;
}
if ( num < 1000000000000000L ) {
return 15;
}
if ( num < 10000000000000000L ) {
return 16;
}
if ( num < 100000000000000000L ) {
return 17;
}
if ( num < 1000000000000000000L ) {
return 18;
}
return 19;
}
public static int max ( final int... nums ) {
int ans = Integer.MIN_VALUE;
for ( int num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static long max ( final long... nums ) {
long ans = Long.MIN_VALUE;
for ( long num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static double max ( final double... nums ) {
double ans = -Double.MIN_VALUE;
for ( double num: nums ) {
ans = Math.max( ans, num );
}
return ans;
}
public static <E extends Comparable<E>> E max ( final E[] nums ) {
E ans = nums[0];
for ( E value: nums ) {
if ( ans.compareTo( value ) > 0 ) {
ans = value;
}
}
return ans;
}
public static int min ( final int... nums ) {
int ans = Integer.MAX_VALUE;
for ( int num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static long min ( final long... nums ) {
long ans = Long.MAX_VALUE;
for ( long num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static double min ( final double... nums ) {
double ans = Double.MAX_VALUE;
for ( double num: nums ) {
ans = Math.min( ans, num );
}
return ans;
}
public static <E extends Comparable<E>> E min ( final E[] nums ) {
E ans = nums[0];
for ( E value: nums ) {
if ( ans.compareTo( value ) < 0 ) {
ans = value;
}
}
return ans;
}
public static long sum ( final int... nums ) {
long ans = 0;
for ( int num: nums ) {
ans += num;
}
return ans;
}
public static long sum ( final long... nums ) {
long ans = 0;
for ( long num: nums ) {
ans += num;
}
return ans;
}
public static long modSum ( final long mod, final int... nums ) {
long ans = 0;
for ( int num: nums ) {
ans += num;
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long modSum ( final long mod, final long... nums ) {
long ans = 0;
for ( long num: nums ) {
ans += num;
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long sum ( final int[] nums, int from, int to ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
}
return ans;
}
public static long sum ( final long[] nums, int from, int to ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
}
return ans;
}
public static long modSum ( final int[] nums, int from, int to, long mod ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
public static long modSum ( final long[] nums, int from, int to, long mod ) {
long ans = 0;
for ( int i = from; i < to; ++i ) {
ans += nums[i];
ans %= mod;
}
if ( ans < 0 ) {
ans += mod;
}
return ans;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final int num, final int l, final int r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final long num, final long l, final long r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheck ( final double num, final double l, final double r ) {
return l <= num && num < r;
}
/**
* 引数numがl以上r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含まない)
*
* @return l <= num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheck ( final E num, final E l, final E r ) {
return 0 <= l.compareTo( num ) && 0 < num.compareTo( r );
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final int num, final int l, final int r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final long num, final long l, final long r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckOpen ( final double num, final double l, final double r ) {
return l < num && num < r;
}
/**
* 引数numがlより大きく、r未満の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含まない)
* @param r 上限(rを含まない)
*
* @return l < num < rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheckOpen ( final E num, final E l, final E r ) {
return 0 < l.compareTo( num ) && 0 < num.compareTo( r );
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final int num, final int l, final int r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final long num, final long l, final long r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static boolean rangeCheckClose ( final double num, final double l, final double r ) {
return l <= num && num <= r;
}
/**
* 引数numがl以上r以下の範囲内か判定します。
*
* @param num 判定する値
* @param l 下限(lを含む)
* @param r 上限(rを含む)
*
* @return l <= num <= rを満たしていればtrue 、 満たしていなければfalse
*/
public static <E extends Comparable<E>> boolean rangeCheckClose ( final E num, final E l, final E r ) {
return 0 <= l.compareTo( num ) && 0 <= num.compareTo( r );
}
/**
* 引数の中でのmexを求めます。
*
* @param num
*/
public static int mex ( final int... nums ) {
final IntegerSet set = new IntegerSet( nums.length << 1 );
for ( final int num : nums ) {
set.add( num );
}
int ans = 0;
while ( set.contains( ans ) ) {
++ans;
}
return ans;
}
}
final class Searcher {
private static final int CYCLE_COUNT = Double.MAX_EXPONENT + 53;
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static int downSearch ( final char[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最大のインデックスを返します。
* 見つからなかった場合は指定された要素未満で最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以下で最大のインデックス
*/
public static <E extends Comparable<E>> int downSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static int downSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static long downSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) > value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最大の引数を返します。
* 見つからなかった場合は指定された値未満で最大の引数を返します。
* もしそのような要素が存在しない場合は下限より小さい値を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以下で最大の引数
*/
public static double search ( double a, double b, final double value, final DoubleUnaryOperator func ) {
double ans = a - Math.abs( a ), c;
for ( int $ = 0; $ < CYCLE_COUNT; ++$ ) {
c = ( a + b ) / 2;
if ( func.applyAsDouble( c ) > value ) {
b = c;
}
else {
a = ( ans = c );
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static boolean contains ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> boolean contains ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = array[c].compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* リスト内の指定された要素を探します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return listにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> boolean contains ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = list.get( c ).compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がa以上b以下で探索値を取るかを表すboolean
*/
public static boolean contains ( int a, int b, final int value, final IntUnaryOperator func ) {
int c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int num = func.applyAsInt( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がa以上b以下で探索値を取るかを表すboolean
*/
public static boolean contains ( long a, long b, final long value, final LongUnaryOperator func ) {
long c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
long num = func.applyAsLong( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return true;
}
}
return false;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayのvalueのインデックス(無ければ - 1)
*/
public static int search ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = c - 1;
}
else if ( array[c] < value ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 配列内の指定された要素を探します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return arrayにvalueが含まれているかを表すboolean
*/
public static <E extends Comparable<E>> int search ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = array[c].compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* リスト内の指定された要素を探します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return listのvalueのインデックス(無ければ - 1)
*/
public static <E extends Comparable<E>> int search ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int result = list.get( c ).compareTo( value );
if ( result > 0 ) {
b = c - 1;
}
else if ( result < 0 ) {
a = c + 1;
}
else {
return c;
}
}
return -1;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がvalueを取る引数(無ければa - 1)
*/
public static int search ( int a, int b, final int value, final IntUnaryOperator func ) {
int c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
int num = func.applyAsInt( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return c;
}
}
return a - 1;
}
/**
* 広義単調増加な関数内の指定された値を探します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return この関数がvalueを取る引数(無ければa - 1)
*/
public static long search ( long a, long b, final long value, final LongUnaryOperator func ) {
long c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
long num = func.applyAsLong( c );
if ( num > value ) {
b = c - 1;
}
else if ( num < value ) {
a = c + 1;
}
else {
return c;
}
}
return a - 1;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static int upSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素を探します。
* 配列内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素を探します。
* リスト内で見つかった場合はその要素と同一で最小のインデックスを返します。
* 見つからなかった場合は指定された要素以上で最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 指定された要素以上で最小のインデックス
*/
public static <E extends Comparable<E>> int upSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最小の引数を返します。
* 見つからなかった場合は指定された値以上で最大の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以上で最小の引数
*/
public static int upSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値を探します。
* 関数内で見つかった場合はその値と同一で最小の引数を返します。
* 見つからなかった場合は指定された値以上で最大の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 指定された値以上で最小の引数
*/
public static long upSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) >= value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static int underSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より小さい要素を探します。
* 配列内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より小さい要素を探します。
* リスト内で見つかった場合は条件を満たす最大のインデックスを返します。
* もしそのような要素が存在しない場合は-1を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最大のインデックス
*/
public static <E extends Comparable<E>> int underSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = -1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) >= 0 ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より小さい値を探します。
* 関数内で見つかった場合は条件を満たす最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最大の引数
*/
public static int underSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より小さい値を探します。
* 関数内で見つかった場合は条件を満たす最大の引数を返します。
* もしそのような要素が存在しない場合は下限-1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最大の引数
*/
public static long underSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = a - 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) >= value ) {
b = c - 1;
}
else {
a = ( ans = c ) + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final int[] array, final int value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final long[] array, final long value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static int overSearch ( final double[] array, final double value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c] > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 配列内の指定された要素より大きい要素を探します。
* 配列内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はarray.lengthを返します。
*
* @param array 探索対象の配列
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( final E[] array, final E value ) {
int a = 0, b = array.length - 1, ans = array.length, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( array[c].compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* リスト内の指定された要素より大きい要素を探します。
* リスト内で見つかった場合は条件を満たす最小のインデックスを返します。
* もしそのような要素が存在しない場合はlist.size()を返します。
*
* @param list 探索対象のリスト
* @param value 探索要素
*
* @return 条件を満たす最小のインデックス
*/
public static <E extends Comparable<E>> int overSearch ( final List<E> list, final E value ) {
int a = 0, b = list.size() - 1, ans = list.size(), c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( list.get( c ).compareTo( value ) > 0 ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より大きい値を探します。
* 関数内で見つかった場合は条件を満たす最小の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最小の引数
*/
public static int overSearch ( int a, int b, final int value, final IntUnaryOperator func ) {
int ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsInt( c ) > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
/**
* 広義単調増加な関数内の指定された値より大きい値を探します。
* 関数内で見つかった場合は条件を満たす最小の引数を返します。
* もしそのような要素が存在しない場合は上限+1を返します。
*
* @param a 探索範囲の下限
* @param b 探索範囲の上限
* @param value 探索値
*
* @return 条件を満たす最小の引数
*/
public static long overSearch ( long a, long b, final long value, final LongUnaryOperator func ) {
long ans = b + 1, c;
while ( a - b < 1 ) {
c = ( a + b ) / 2;
if ( func.applyAsLong( c ) > value ) {
b = ( ans = c ) - 1;
}
else {
a = c + 1;
}
}
return ans;
}
}
// Binary Indexed Tree
final class BIT {
final int size;
final private long[] tree;
public BIT ( int n ) {
size = n;
tree = new long[n + 1];
}
public long sum ( int i ) {
long sum = 0;
while ( i > 0 ) {
sum += tree[i];
i ^= i & ( -i );
}
return sum;
}
public void add ( int i, long x ) {
while ( i <= size ) {
tree[i] += x;
i += i & ( -i );
}
}
public void clear () {
Arrays.fill( tree, 0L );
}
}
final class Bitset implements Cloneable {
private final long[] bit;
private final int size, len;
private final long MASK;
public Bitset ( final int len ) {
this.len = len;
size = ( len + 63 ) >> 6;
bit = new long[size];
MASK = ( -1L ) >>> ( ( size << 6 ) - len );
}
private Bitset ( final long[] arr ) {
this( arr.length );
System.arraycopy( arr, 0, bit, 0, size );
}
public void set ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
bit[index >> 6] |= ( 1L << ( index & 0b111111 ) );
}
public void clear ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
long m = ~( 1L << ( index & 0b111111 ) );
bit[index >> 6] &= m;
}
public boolean get ( final int index ) {
if ( index >= size << 6 ) {
throw new ArrayIndexOutOfBoundsException( index + " is out of this bitset's size " + size );
}
return ( bit[index >> 6] & ( 1L << ( index & 0b111111 ) ) ) != 0;
}
public void shiftLeft ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = size - 1; i >= n; --i ) {
bit[i] = ( bit[i - n] << num ) | ( i != n && num != 0 ? bit[i - n - 1] >>> ( 64 - num ) : 0L );
}
for ( int i = 0; i < n; ++i ) {
bit[i] = 0L;
}
bit[size - 1] &= MASK;
}
public void shiftRight ( int num ) {
if ( num >= size << 6 ) {
Arrays.fill( bit, 0L );
return;
}
final int n = num >> 6;
num &= 0b111111;
for ( int i = 0; i < size - n; ++i ) {
bit[i] = ( bit[i + n] >>> num ) | ( i + n + 1 != size && num != 0 ? bit[i + n + 1] << ( 64 - num ) : 0L );
}
for ( int i = size - 1; i >= size - n; --i ) {
bit[i] = 0L;
}
}
public long[] longValues () {
return bit;
}
public long longValue () {
return bit[0];
}
public void and ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] &= bit2[i];
}
for ( int i = m; i < size; ++i ) {
bit[i] = 0;
}
bit[size - 1] &= MASK;
}
public void or ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] |= bit2[i];
}
bit[size - 1] &= MASK;
}
public void xor ( final Bitset b ) {
final long[] bit2 = b.longValues();
final int m = Math.min( bit2.length, size );
for ( int i = 0; i < m; ++i ) {
bit[i] ^= bit2[i];
}
bit[size - 1] &= MASK;
}
public Bitset clone () throws CloneNotSupportedException {
super.clone();
final Bitset b = new Bitset( bit );
return b;
}
}
final class IntegerSet {
private class Node {
private final int value;
private Node next;
private Node ( final int val ) {
value = val;
}
private boolean add ( final int x ) {
if ( value == x ) {
return false;
}
if ( next != null ) {
return next.add( x );
}
++size;
next = new Node( x );
return true;
}
private void add ( final Node n ) {
if ( value != n.value ) {
if ( next != null ) {
next.add( n );
}
else {
next = n;
}
}
}
private boolean remove ( final int x ) {
if ( next == null ) {
return false;
}
if ( next.value != x ) {
return next.remove( x );
}
--size;
next = next.next;
return true;
}
private boolean contains ( final int x ) {
if ( value == x ) {
return true;
}
if ( next != null ) {
return next.contains( x );
}
return false;
}
}
private Node[] table;
private int size;
public IntegerSet () {
this( 16 );
}
public IntegerSet ( final int s ) {
if ( s < 1 ) {
throw new NegativeArraySizeException( "hash table's size must be positive" );
}
table = new Node[s];
size = 0;
}
public boolean add ( final int x ) {
sizeCheck();
final int index = hash( x );
if ( table[index] != null ) {
return table[index].add( x );
}
++size;
table[index] = new Node( x );
return true;
}
private void add ( final Node n ) {
final int index = hash( n.value );
if ( table[index] != null ) {
table[index].add( n );
}
else {
table[index] = n;
}
}
public boolean remove ( final int x ) {
final int index = hash( x );
if ( table[index] == null ) {
return false;
}
if ( table[index].value != x ) {
return table[index].remove( x );
}
--size;
table[index] = table[index].next;
return true;
}
public boolean contains ( final int x ) {
final int index = hash( x );
if ( table[index] == null ) {
return false;
}
return table[index].contains( x );
}
private void reHash () {
final Node[] oldTable = table;
table = new Node[table.length << 1];
for ( Node node: oldTable ) {
while ( node != null ) {
final Node next = node.next;
node.next = null;
add( node );
node = next;
}
}
}
private void sizeCheck () {
if ( table.length * 0.6 < size ) {
reHash();
}
}
private int hash ( final int val ) {
final int h = val % table.length;
return h < 0 ? h + table.length : h;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] array = new int[size];
int index = 0;
for ( Node node: table ) {
while ( node != null ) {
array[index++] = node.value;
node = node.next;
}
}
return array;
}
public String toString () {
return Arrays.toString( toArray() );
}
}
final class Matrix {
private final long[][] matrix;
public Matrix ( final int H, final int W, final long def ) {
matrix = new long[H][W];
if ( def != 0 ) {
for ( final long[] mat: matrix ) {
Arrays.fill( mat, def );
}
}
}
public Matrix ( final int H, final int W ) {
this( H, W, 0 );
}
public Matrix ( final Dimension d, final long def ) {
this( d.height, d.width, def );
}
public Matrix ( final long[][] mat ) {
matrix = new long[mat.length][];
for ( int i = 0; i < mat.length; ++i ) {
matrix[i] = Arrays.copyOf( mat[i], mat[i].length );
}
}
public long get ( final int i, final int j ) {
return matrix[i][j];
}
public long set ( final int i, final int j, final long value ) {
return matrix[i][j] = value;
}
public Matrix copy () {
return new Matrix( matrix );
}
public Dimension size () {
return new Dimension( matrix[0].length, matrix.length );
}
public Matrix add ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, matrix[i][j] + m.get( i, j ) );
}
}
return ans;
}
public Matrix subtract ( final Matrix m ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, matrix[i][j] - m.get( i, j ) );
}
}
return ans;
}
public Matrix multiply ( final Matrix m ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; ++i ) {
for ( int j = 0; j < size.width; ++j ) {
long sum = 0;
for ( int k = 0; k < len; ++k ) {
sum += matrix[i][k] * m.get( k, j );
}
ans.set( i, j, sum );
}
}
return ans;
}
public Matrix modAdd ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, MathFunction.remainder( matrix[i][j] + m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modSubtract ( final Matrix m, final long mod ) {
if ( !size().equals( m.size() ) ) {
throw new IllegalArgumentException( "matrix size is not same" );
}
final Matrix ans = new Matrix( size(), 0 );
for ( int i = 0; i < matrix.length; ++i ) {
for ( int j = 0; j < matrix[i].length; ++j ) {
ans.set( i, j, MathFunction.remainder( matrix[i][j] - m.get( i, j ), mod ) );
}
}
return ans;
}
public Matrix modMultiply ( final Matrix m, final long mod ) {
if ( size().width != m.size().height ) {
throw new IllegalArgumentException( "matrix length is not same" );
}
final Matrix ans = new Matrix( size().height, m.size().width );
final Dimension size = ans.size();
final int len = size().width;
for ( int i = 0; i < size.height; ++i ) {
for ( int j = 0; j < size.width; ++j ) {
long sum = 0;
for ( int k = 0; k < len; ++k ) {
sum = MathFunction.remainder( sum + matrix[i][k] * m.get( k, j ), mod );
}
ans.set( i, j, sum );
}
}
return ans;
}
public static Matrix pow ( final Matrix original, final Matrix pw, long exp ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.multiply( a );
}
b = b.multiply( b );
exp >>= 1;
}
return a;
}
public static Matrix modPow ( final Matrix original, final Matrix pw, long exp, final long mod ) {
Matrix a = original.copy();
Matrix b = pw.copy();
while ( 0 < exp ) {
if ( ( exp & 1 ) == 1 ) {
a = b.modMultiply( a, mod );
}
b = b.modMultiply( b, mod );
exp >>= 1;
}
return a;
}
public long determinant () {
return determinant( matrix );
}
private static long determinant ( final long[][] mat ) {
if ( mat.length == 1 ) {
return mat[0][0];
}
final long[][] miniMat = new long[mat.length - 1][mat.length - 1];
for ( int i = 1; i < mat.length; ++i ) {
System.arraycopy( mat[i], 1, miniMat[i - 1], 0, miniMat.length );
}
long ans = mat[0][0] * determinant( miniMat );
for ( int i = 1; i < mat.length; ++i ) {
for ( int j = 1; j < mat.length; ++j ) {
miniMat[j - 1][i - 1] = mat[j][i - 1];
}
final long num = mat[0][i] * determinant( miniMat );
ans += i % 2 == 0 ? num : -num;
}
return ans;
}
@Override
public String toString () {
final StringBuilder ans = new StringBuilder();
ans.append( Arrays.toString( matrix[0] ) );
for ( int i = 1; i < matrix.length; ++i ) {
ans.append( "\n" );
ans.append( Arrays.toString( matrix[i] ) );
}
return ans.toString();
}
}
class Pair<K extends Comparable<K>, V extends Comparable<V>>
implements Comparable<Pair<K, V>> {
private AbstractMap.SimpleEntry<K, V> map;
public Pair ( K key, V value ) {
map = new AbstractMap.SimpleEntry<>( key, value );
}
public K getKey () {
return map.getKey();
}
public V getValue () {
return map.getValue();
}
public K setKey ( K key ) {
K oldKey = map.getKey();
V value = map.getValue();
map = new AbstractMap.SimpleEntry<>( key, value );
return oldKey;
}
public V setValue ( V value ) {
return map.setValue( value );
}
@Override
public int compareTo ( Pair<K, V> pair ) {
int com = getKey().compareTo( pair.getKey() );
return com != 0 ? com : getValue().compareTo( pair.getValue() );
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof Pair<?, ?> pair ) {
return getKey().equals( pair.getKey() ) && getValue().equals( pair.getValue() );
}
return false;
}
@Override
public String toString () {
return getKey() + "=" + getValue();
}
@Override
public int hashCode () {
return ( getKey().hashCode() << 2 ) ^ ( getValue().hashCode() );
}
}
final class RollingHash implements Comparable<RollingHash> {
private static final long BASE = new Random().nextInt( 1000 ) + Character.MAX_VALUE + 1;
private static final long MASK30 = ( 1L << 30 ) - 1;
private static final long MASK31 = ( 1L << 31 ) - 1;
private static final long MOD = ( 1L << 61 ) - 1;
private static final long MASK61 = MOD;
private long[] hash;
private String string;
public RollingHash ( final String str ) {
string = str;
hash = new long[str.length() + 1];
roll();
}
private void roll () {
final int len = string.length();
for ( int i = 1; i <= len; ++i ) {
hash[i] = multiply( hash[i - 1], BASE ) + string.charAt( i - 1 ) - ' ' + 1;
if ( MOD <= hash[i] ) {
hash[i] -= MOD;
}
}
}
private static long multiply ( final long a, final long b ) {
final long au = a >> 31;
final long ad = a & MASK31;
final long bu = b >> 31;
final long bd = b & MASK31;
final long mid = ad * bu + au * bd;
final long midu = mid >> 30;
final long midd = mid & MASK30;
return mod( au * bu * 2 + midu + ( midd << 31 ) + ad * bd );
}
private static long mod ( final long x ) {
final long xu = x >> 61;
final long xd = x & MASK61;
long ans = xu + xd;
if ( MOD <= ans ) {
ans -= MOD;
}
return ans;
}
public long getHash ( final int l, final int r ) {
return ( hash[r] - multiply( hash[l], modBasePow( r - l ) ) + MOD ) % MOD;
}
private static long modBasePow ( long b ) {
long ans = 1;
long a = BASE;
while ( b > 0 ) {
if ( ( b & 1 ) == 1 ) {
ans = multiply( ans, a );
}
a = multiply( a, a );
b >>= 1;
}
return ans;
}
public boolean equals ( final RollingHash rh, final int l1, final int r1, final int l2, final int r2 ) {
if ( r1 - l1 != r2 - l2 ) {
return false;
}
return getHash( l1, r1 ) == rh.getHash( l2, r2 );
}
public int length () {
return string.length();
}
@Override
public int hashCode () {
return string.hashCode();
}
@Override
public String toString () {
return string;
}
@Override
public boolean equals ( Object o ) {
if ( o instanceof final RollingHash rh ) {
return equals( rh, 0, length(), 0, rh.length() );
}
return false;
}
@Override
public int compareTo ( RollingHash rh ) {
return string.compareTo( rh.toString() );
}
public int compareTo ( String str ) {
return string.compareTo( str );
}
public char charAt ( final int i ) {
return string.charAt( i );
}
public int compareToIgnoreCase ( final RollingHash rh ) {
return string.compareToIgnoreCase( rh.toString() );
}
public int compareToIgnoreCase ( final String str ) {
return string.compareToIgnoreCase( str );
}
public void concat ( final RollingHash rh ) {
concat( rh.toString() );
}
public void concat ( final String str ) {
string = string.concat( str );
hash = new long[string.length() + 1];
roll();
}
public boolean contains ( final RollingHash rh ) {
final long hash = rh.getHash( 0, rh.length() );
final int len = length() - rh.length();
for ( int i = 0; i <= len; ++i ) {
if ( hash == getHash( i, rh.length() + i ) ) {
return true;
}
}
return false;
}
public boolean contains ( final String str ) {
return indexOf( str ) != -1;
}
public int indexOf ( final int ch ) {
return indexOf( ch, 0 );
}
public int indexOf ( final int ch, final int fromIndex ) {
final int len = length();
for ( int i = fromIndex; i < len; ++i ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int indexOf ( final String str ) {
return indexOf( str, 0 );
}
public int indexOf ( final String str, final int fromIndex ) {
long hash = 0;
for ( final char c: str.toCharArray() ) {
hash = multiply( hash, BASE ) + c - ' ' + 1;
if ( MOD <= hash ) {
hash -= MOD;
}
}
final int len = length() - str.length();
for ( int i = fromIndex; i <= len; ++i ) {
if ( hash == getHash( i, str.length() + i ) ) {
return i;
}
}
return -1;
}
public boolean isEmpty () {
return length() == 0;
}
public int lastIndexOf ( final int ch, final int fromIndex ) {
for ( int i = fromIndex; i >= 0; --i ) {
if ( string.charAt( i ) == ch ) {
return i;
}
}
return -1;
}
public int lastIndexOf ( final int ch ) {
return lastIndexOf( ch, length() - 1 );
}
public static RollingHash valueOf ( final boolean b ) {
return new RollingHash( b ? "true" : "false" );
}
public static RollingHash valueOf ( final char c ) {
return new RollingHash( "" + c );
}
public static RollingHash valueOf ( final char[] c ) {
return new RollingHash( String.valueOf( c, 0, c.length ) );
}
public static RollingHash valueOf ( final char[] c, final int offset, final int count ) {
return new RollingHash( String.valueOf( c, offset, count ) );
}
public static RollingHash valueOf ( final double d ) {
return new RollingHash( String.valueOf( d ) );
}
public static RollingHash valueOf ( final float f ) {
return new RollingHash( String.valueOf( f ) );
}
public static RollingHash valueOf ( final int i ) {
return new RollingHash( String.valueOf( i ) );
}
public static RollingHash valueOf ( final long l ) {
return new RollingHash( String.valueOf( l ) );
}
public static RollingHash valueOf ( final Object obj ) {
return new RollingHash( String.valueOf( obj ) );
}
}
abstract class SegmentTree<E> {
final int N, size;
final E def;
final Object[] node;
public SegmentTree ( final int n, final E def, final boolean include ) {
int num = 2;
while ( num < n << 1 ) {
num <<= 1;
}
N = num;
size = num >> 1 - ( include ? 1 : 0 );
node = new Object[N];
this.def = def;
Arrays.fill( node, this.def );
}
public SegmentTree ( final E[] arr, final E def, final boolean include ) {
int num = 2;
while ( num < arr.length << 1 ) {
num <<= 1;
}
N = num;
size = num >> 1 - ( include ? 1 : 0 );
node = new Object[N];
this.def = def;
System.arraycopy( arr, 0, node, N >> 1, arr.length );
for ( int i = arr.length + ( N >> 1 ); i < N; i++ ) {
node[i] = def;
}
updateAll();
}
public SegmentTree ( final int n, final E def ) {
this( n, def, false );
}
@SuppressWarnings( "unchecked" )
private void updateAll () {
for ( int i = ( N >> 1 ) - 1; i > 0; i-- ) {
node[i] = function( ( E )node[i << 1], ( E )node[( i << 1 ) + 1] );
}
}
@SuppressWarnings( "unchecked" )
public void update ( int n, final E value ) {
n += size;
node[n] = value;
n >>= 1;
while ( n > 0 ) {
node[n] = function( ( E )node[n << 1], ( E )node[( n << 1 ) + 1] );
n >>= 1;
}
}
@SuppressWarnings( "unchecked" )
public E get ( final int a ) {
return ( E )node[a + size];
}
@SuppressWarnings( "unchecked" )
public E answer () {
return ( E )node[1];
}
@SuppressWarnings( "unchecked" )
public E query ( int l, int r ) {
l += size;
r += size;
E answer = def;
while ( l > 0 && r > 0 && l <= r ) {
if ( l % 2 == 1 ) {
answer = function( ( E )node[l++], answer );
}
l >>= 1;
if ( r % 2 == 0 ) {
answer = function( answer, ( E )node[r--] );
}
r >>= 1;
}
return answer;
}
abstract public E function ( E a, E b );
}
final class UnionFind {
private final int[] par, rank, size, path;
private int count;
public UnionFind ( final int N ) {
count = N;
par = new int[N];
rank = new int[N];
size = new int[N];
path = new int[N];
Arrays.fill( par, -1 );
Arrays.fill( size, 1 );
}
public int root ( final int ind ) {
if ( par[ind] == -1 ) {
return ind;
}
else {
return par[ind] = root( par[ind] );
}
}
public boolean isSame ( final int x, final int y ) {
return root( x ) == root( y );
}
public boolean unite ( final int x, final int y ) {
int rx = root( x );
int ry = root( y );
++path[rx];
if ( rx == ry ) {
return false;
}
if ( rank[rx] < rank[ry] ) {
int temp = rx;
rx = ry;
ry = temp;
}
par[ry] = rx;
if ( rank[rx] == rank[ry] ) {
++rank[rx];
}
path[rx] += path[ry];
size[rx] += size[ry];
--count;
return true;
}
public int groupCount () {
return count;
}
public int pathCount ( final int x ) {
return path[root( x )];
}
public int size ( final int x ) {
return size[root( x )];
}
}
final class Tree<E extends Comparable<E>> {
private Node<E> root;
private int size, hash;
public Tree () {
size = 0;
root = null;
hash = 0;
}
static final private class Node<E> {
E value;
int height, size;
Node<E> left, right, parent;
public Node ( final Node<E> p, final E v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final E x ) {
boolean bool = true;
if ( root == null ) {
root = new Node<>( null, x );
}
else {
Node<E> par;
Node<E> now = root;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x );
}
else {
par.right = new Node<>( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= x.hashCode();
}
return bool;
}
public E get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node<E> now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.value.hashCode();
delete( n );
return true;
}
private void delete ( final Node<E> node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node<E> rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node<E> rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node<E> getNode ( final E x ) {
Node<E> now = root;
while ( now != null ) {
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public E first () {
if ( root == null ) {
return null;
}
return getFirstNode( root ).value;
}
private Node<E> getFirstNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public E last () {
if ( root == null ) {
return null;
}
return getLastNode( root ).value;
}
private Node<E> getLastNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final E x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public E pollFirst () {
if ( root == null ) {
return null;
}
--size;
final Node<E> min = getFirstNode( root );
hash ^= min.value.hashCode();
delete( min );
return min.value;
}
public E pollLast () {
if ( root == null ) {
return null;
}
--size;
final Node<E> max = getLastNode( root );
hash ^= max.value.hashCode();
delete( max );
return max.value;
}
public E ceiling ( final E x ) {
return ceiling( root, x );
}
private E ceiling ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result > 0 ) {
node = node.right;
}
else if ( result < 0 ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E higher ( final E x ) {
return higher( root, x );
}
private E higher ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result >= 0 ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans != null ? ans.value : null;
}
public E floor ( final E x ) {
return floor( root, x );
}
private E floor ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result < 0 ) {
node = node.left;
}
else if ( result > 0 ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E lower ( final E x ) {
return lower( root, x );
}
private E lower ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result <= 0 ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans != null ? ans.value : null;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public ArrayList<E> toList () {
final ArrayList<E> list = new ArrayList<>();
if ( root != null ) {
final ArrayDeque<Node<E>> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node<E> now = deq.pollLast();
if ( list.size() == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list.add( now.value );
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list.get( list.size() - 1 ).compareTo( now.left.value ) < 0 ) {
deq.add( now );
deq.add( now.left );
}
else {
list.add( now.value );
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final ArrayList<E> list = toList();
return list.toString();
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final Tree<?> tree ) {
if ( size == tree.size() ) {
return false;
}
final ArrayList<E> list1 = toList();
final ArrayList<?> list2 = tree.toList();
for ( int i = 0; i < size; ++i ) {
if ( !list1.get( i ).equals( list2.get( i ) ) ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node<E> node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node<E> node ) {
final Node<E> temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node<E> node ) {
final Node<E> temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node<E> node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeInt {
private Node root;
private int size, hash;
public TreeInt () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
int height, size;
Node left, right, parent;
public Node ( final Node p, final int v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final int x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= x;
}
return bool;
}
public int get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.value;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= min.value;
delete( min );
return min.value;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= max.value;
delete( max );
return max.value;
}
public int ceiling ( final int x ) {
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
return higher( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
return lower( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public void clear () {
root = null;
size = 0;
hash = 0;
}
public boolean isEmpty () {
return size == 0;
}
public int size () {
return size;
}
public int[] toArray () {
final int[] list = new int[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeInt tree ) {
if ( size == tree.size() ) {
return false;
}
final int[] array1 = toArray();
final int[] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeLong {
private Node root;
private int size, hash;
public TreeLong () {
size = 0;
root = null;
hash = 0;
}
static final private class Node {
long value;
int height, size;
Node left, right, parent;
public Node ( final Node p, final long v ) {
value = v;
parent = p;
height = 1;
size = 1;
}
}
public boolean add ( final long x ) {
boolean bool = true;
if ( root == null ) {
root = new Node( null, x );
}
else {
Node par;
Node now = root;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
break;
}
} while ( now != null );
if ( bool ) {
if ( x < par.value ) {
par.left = new Node( par, x );
}
else {
par.right = new Node( par, x );
}
fix( par );
}
}
if ( bool ) {
++size;
hash ^= ( int )x;
}
return bool;
}
public long get ( int index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final int ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls < index ) {
now = now.right;
index -= ls + 1;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= ( int )x;
delete( n );
return true;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= ( int )min.value;
delete( min );
return min.value;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= ( int )max.value;
delete( max );
return max.value;
}
public long ceiling ( final long x ) {
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long higher ( final long x ) {
return higher( root, x );
}
private long higher ( Node node, final long x ) {
Node ans = new Node( null, x - 1 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public long floor ( final long x ) {
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public long lower ( final long x ) {
return lower( root, x );
}
private long lower ( Node node, final long x ) {
Node ans = new Node( null, x + 1 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return size;
}
public long[] toArray () {
final long[] list = new long[size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index++] = now.value;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeLong tree ) {
if ( size == tree.size() ) {
return false;
}
final long[] array1 = toArray();
final long[] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i] != array2[i] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
}
rotateL( node );
}
else {
setStates( node );
}
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final int ls = node.left != null ? node.left.size : 0;
final int rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + 1;
}
}
final class TreeMulti<E extends Comparable<E>> {
private Node<E> root;
private long size;
private int uniqueSize;
private int hash;
public TreeMulti () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node<E> {
E value;
long count, size;
int height;
Node<E> left, right, parent;
public Node ( final Node<E> p, final E v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final E x ) {
if ( root == null ) {
root = new Node<>( null, x, 1 );
++uniqueSize;
}
else {
Node<E> par;
Node<E> now = root;
boolean bool = true;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x, 1 );
}
else {
par.right = new Node<>( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= x.hashCode();
}
public void add ( final E x, final long sum ) {
if ( root == null ) {
root = new Node<>( null, x, sum );
++uniqueSize;
}
else {
Node<E> par;
Node<E> now = root;
boolean bool = true;
do {
par = now;
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
final int result = x.compareTo( par.value );
if ( result < 0 ) {
par.left = new Node<>( par, x, sum );
}
else {
par.right = new Node<>( par, x, sum );
}
fix( par );
}
}
size += sum;
hash ^= sum % 2 == 1 ? x.hashCode() : 0;
}
public E get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node<E> now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= n.hashCode();
delete( n );
return true;
}
public long remove ( final E x, final long sum ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
hash ^= ans % 2 == 1 ? n.hashCode() : 0;
n.count -= ans - 1;
delete( n );
return ans;
}
public long removeAll ( final E x ) {
final Node<E> n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
hash ^= ans % 2 == 1 ? n.hashCode() : 0;
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node<E> node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node<E> rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node<E> rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node<E> getNode ( final E x ) {
Node<E> now = root;
while ( now != null ) {
final int result = x.compareTo( now.value );
if ( result < 0 ) {
now = now.left;
}
else if ( result > 0 ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public E first () {
if ( root == null ) {
return null;
}
return getFirstNode( root ).value;
}
private Node<E> getFirstNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public E last () {
if ( root == null ) {
return null;
}
return getLastNode( root ).value;
}
private Node<E> getLastNode ( Node<E> node ) {
assert node != null;
Node<E> par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final E x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final E x ) {
if ( root == null ) {
return 0;
}
Node<E> node = getNode( x );
return node != null ? node.count : 0;
}
public E pollFirst () {
if ( root == null ) {
return null;
}
--size;
final Node<E> min = getFirstNode( root );
hash ^= min.value.hashCode();
final E ans = min.value;
delete( min );
return ans;
}
public E pollLast () {
if ( root == null ) {
return null;
}
--size;
final Node<E> max = getLastNode( root );
hash ^= max.value.hashCode();
final E ans = max.value;
delete( max );
return ans;
}
public E ceiling ( final E x ) {
return ceiling( root, x );
}
private E ceiling ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result > 0 ) {
node = node.right;
}
else if ( result < 0 ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E higher ( final E x ) {
return higher( root, x );
}
private E higher ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result >= 0 ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans != null ? ans.value : null;
}
public E floor ( final E x ) {
return floor( root, x );
}
private E floor ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result < 0 ) {
node = node.left;
}
else if ( result > 0 ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans != null ? ans.value : null;
}
public E lower ( final E x ) {
return lower( root, x );
}
private E lower ( Node<E> node, final E x ) {
Node<E> ans = null;
while ( node != null ) {
final int result = x.compareTo( node.value );
if ( result <= 0 ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans != null ? ans.value : null;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public ArrayList<E> toList () {
final ArrayList<E> list = new ArrayList<>();
if ( root != null ) {
final ArrayDeque<Node<E>> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node<E> now = deq.pollLast();
if ( list.size() == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list.add( now.value );
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list.get( list.size() - 1 ).compareTo( now.left.value ) < 0 ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list.add( now.value );
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final ArrayList<E> list = toList();
return list.toString();
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMulti<?> tree ) {
if ( size == tree.size() ) {
return false;
}
final ArrayList<E> array1 = toList();
final ArrayList<?> array2 = tree.toList();
for ( int i = 0; i < size; ++i ) {
if ( !array1.get( i ).equals( array2.get( i ) ) ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node<E> node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node<E> node ) {
final Node<E> temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node<E> node ) {
final Node<E> temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node<E> node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class TreeMultiInt {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public TreeMultiInt () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
int value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final int v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final int x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= x;
}
public void add ( final int x, final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
size += sum;
if ( sum % 2 == 1 ) {
hash ^= x;
}
}
public int get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= x;
delete( n );
return true;
}
public long remove ( final int x, final long sum ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
n.count -= ans - 1;
if ( ans % 2 == 1 ) {
hash ^= x;
}
delete( n );
return ans;
}
public long removeAll ( final int x ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
if ( n.count % 2 == 1 ) {
hash ^= x;
}
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node getNode ( final int x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public int first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public int last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final int x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final int x ) {
if ( root == null ) {
return 0;
}
Node node = getNode( x );
return node != null ? node.count : 0;
}
public int pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= min.value;
final int ans = min.value;
delete( min );
return ans;
}
public int pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= max.value;
final int ans = max.value;
delete( max );
return ans;
}
public int ceiling ( final int x ) {
return ceiling( root, x );
}
private int ceiling ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public int higher ( final int x ) {
return higher( root, x );
}
private int higher ( Node node, final int x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public int floor ( final int x ) {
return floor( root, x );
}
private int floor ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public int lower ( final int x ) {
return lower( root, x );
}
private int lower ( Node node, final int x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>( root.height << 1 );
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
public int[] toOneArray () {
final int[] list = new int[( int )size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final int[] list = toOneArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMultiInt tree ) {
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class TreeMultiLong {
private Node root;
private long size;
private int uniqueSize;
private int hash;
public TreeMultiLong () {
size = 0;
uniqueSize = 0;
root = null;
hash = 0;
}
static final private class Node {
long value;
long count, size;
int height;
Node left, right, parent;
public Node ( final Node p, final long v, final long c ) {
value = v;
parent = p;
count = c;
height = 1;
size = c;
}
}
public void add ( final long x ) {
if ( root == null ) {
root = new Node( null, x, 1 );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
++now.count;
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, 1 );
}
else {
par.right = new Node( par, x, 1 );
}
}
fix( par );
}
++size;
hash ^= ( int )x;
}
public void add ( final long x, final long sum ) {
if ( root == null ) {
root = new Node( null, x, sum );
++uniqueSize;
}
else {
Node par;
Node now = root;
boolean bool = true;
do {
par = now;
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
bool = false;
now.count += sum;
fix( now );
break;
}
} while ( now != null );
if ( bool ) {
++uniqueSize;
if ( x < par.value ) {
par.left = new Node( par, x, sum );
}
else {
par.right = new Node( par, x, sum );
}
fix( par );
}
}
size += sum;
if ( sum % 2 == 1 ) {
hash ^= ( int )x;
}
}
public long get ( long index ) {
if ( root == null || size <= index ) {
throw new NullPointerException();
}
Node now = root;
while ( true ) {
assert now != null;
final long ls = now.left != null ? now.left.size : 0;
if ( index < ls ) {
now = now.left;
}
else if ( ls + now.count <= index ) {
index -= ls + now.count;
now = now.right;
}
else {
break;
}
}
return now.value;
}
public boolean remove ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return false;
}
--size;
hash ^= x;
delete( n );
return true;
}
public long remove ( final long x, final long sum ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
final long ans = Math.min( sum, n.count );
size -= ans;
n.count -= ans - 1;
if ( ans % 2 == 1 ) {
hash ^= ( int )x;
}
delete( n );
return ans;
}
public long removeAll ( final long x ) {
final Node n = getNode( x );
if ( n == null ) {
return 0;
}
size -= n.count;
final long ans = n.count;
if ( n.count % 2 == 1 ) {
hash ^= ( int )x;
}
n.count = 0;
delete( n );
return ans;
}
private void delete ( final Node node ) {
if ( node != null ) {
if ( node.count > 1 ) {
--node.count;
fix( node );
return;
}
if ( node.left == null && node.right == null ) {
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = null;
}
else {
node.parent.right = null;
}
fix( node.parent );
}
else {
root = null;
}
node.parent = null;
--uniqueSize;
}
else {
if ( node.left != null && node.right != null ) {
final Node rep = getFirstNode( node.right );
node.value = rep.value;
node.count = rep.count;
rep.count = 0;
delete( rep );
}
else {
final Node rep = node.left != null ? node.left : node.right;
rep.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = rep;
}
else {
node.parent.right = rep;
}
fix( node.parent );
}
else {
root = rep;
}
node.parent = null;
--uniqueSize;
}
}
}
}
private Node getNode ( final long x ) {
Node now = root;
while ( now != null ) {
if ( x < now.value ) {
now = now.left;
}
else if ( x > now.value ) {
now = now.right;
}
else {
break;
}
}
return now;
}
public long first () {
if ( root == null ) {
throw new NullPointerException();
}
return getFirstNode( root ).value;
}
private Node getFirstNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.left;
}
return par;
}
public long last () {
if ( root == null ) {
throw new NullPointerException();
}
return getLastNode( root ).value;
}
private Node getLastNode ( Node node ) {
assert node != null;
Node par = null;
while ( node != null ) {
par = node;
node = par.right;
}
return par;
}
public boolean contains ( final long x ) {
if ( root == null ) {
return false;
}
return getNode( x ) != null;
}
public long sum ( final long x ) {
if ( root == null ) {
return 0;
}
final Node node = getNode( x );
return node != null ? node.count : 0;
}
public long pollFirst () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node min = getFirstNode( root );
hash ^= ( int )min.value;
final long ans = min.value;
delete( min );
return ans;
}
public long pollLast () {
if ( root == null ) {
throw new NullPointerException();
}
--size;
final Node max = getLastNode( root );
hash ^= ( int )max.value;
final long ans = max.value;
delete( max );
return ans;
}
public long ceiling ( final long x ) {
return ceiling( root, x );
}
private long ceiling ( Node node, final long x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x > node.value ) {
node = node.right;
}
else if ( x < node.value ) {
ans = node;
node = node.left;
}
else {
return x;
}
}
return ans.value;
}
public long higher ( final long x ) {
return higher( root, x );
}
private long higher ( Node node, final long x ) {
Node ans = new Node( null, x - 1, 0 );
while ( node != null ) {
if ( x >= node.value ) {
node = node.right;
}
else {
ans = node;
node = node.left;
}
}
return ans.value;
}
public long floor ( final long x ) {
return floor( root, x );
}
private long floor ( Node node, final long x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x < node.value ) {
node = node.left;
}
else if ( x > node.value ) {
ans = node;
node = node.right;
}
else {
return x;
}
}
return ans.value;
}
public long lower ( final long x ) {
return lower( root, x );
}
private long lower ( Node node, final long x ) {
Node ans = new Node( null, x + 1, 0 );
while ( node != null ) {
if ( x <= node.value ) {
node = node.left;
}
else {
ans = node;
node = node.right;
}
}
return ans.value;
}
public int size () {
return uniqueSize;
}
public long sumSize () {
return size;
}
public long[][] toArray () {
final long[][] list = new long[uniqueSize][2];
if ( root != null ) {
int index = 0;
ArrayDeque<Node> deq = new ArrayDeque<>( root.height << 1 );
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1][0] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
list[index][0] = now.value;
list[index++][1] = now.count;
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
public long[] toOneArray () {
final long[] list = new long[( int )size];
if ( root != null ) {
int index = 0;
final ArrayDeque<Node> deq = new ArrayDeque<>();
deq.add( root );
while ( !deq.isEmpty() ) {
final Node now = deq.pollLast();
if ( index == 0 ) {
if ( now.left != null ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
else if ( now.left != null && list[index - 1] < now.left.value ) {
deq.add( now );
deq.add( now.left );
}
else {
for ( int i = 0; i < now.count; ++i ) {
list[index++] = now.value;
}
if ( now.right != null ) {
deq.add( now.right );
}
}
}
}
return list;
}
@Override
public String toString () {
final long[] list = toOneArray();
return Arrays.toString( list );
}
@Override
public boolean equals ( final Object o ) {
if ( o instanceof final TreeMultiInt tree ) {
if ( size == tree.size() ) {
return false;
}
final long[][] array1 = toArray();
final long[][] array2 = tree.toArray();
for ( int i = 0; i < size; ++i ) {
if ( array1[i][0] != array2[i][0] || array1[i][1] != array2[i][1] ) {
return false;
}
}
return true;
}
return false;
}
@Override
public int hashCode () {
return hash;
}
/*
* 以下、平衡用メソッド
*/
private void fix ( Node node ) {
while ( node != null ) {
final int lh = node.left == null ? 0 : node.left.height;
final int rh = node.right == null ? 0 : node.right.height;
if ( lh - rh > 1 ) {
assert node.left != null;
if ( node.left.right != null && node.left.right.height == lh - 1 ) {
rotateL( node.left );
setStates( node.left );
}
rotateR( node );
}
else if ( rh - lh > 1 ) {
assert node.right != null;
if ( node.right.left != null && node.right.left.height == rh - 1 ) {
rotateR( node.right );
setStates( node.right );
}
rotateL( node );
}
setStates( node );
node = node.parent;
}
}
private void rotateR ( final Node node ) {
final Node temp = node.left;
node.left = temp.right;
if ( node.left != null ) {
node.left.parent = node;
}
temp.right = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void rotateL ( final Node node ) {
final Node temp = node.right;
node.right = temp.left;
if ( node.right != null ) {
node.right.parent = node;
}
temp.left = node;
temp.parent = node.parent;
if ( node.parent != null ) {
if ( node.parent.left == node ) {
node.parent.left = temp;
}
else {
node.parent.right = temp;
}
}
else {
root = temp;
}
node.parent = temp;
setStates( node );
}
private void setStates ( final Node node ) {
final int lh = node.left != null ? node.left.height : 0;
final int rh = node.right != null ? node.right.height : 0;
node.height = Math.max( lh, rh ) + 1;
final long ls = node.left != null ? node.left.size : 0;
final long rs = node.right != null ? node.right.size : 0;
node.size = ls + rs + node.count;
}
}
final class SimpleScanner {
private final int BUFF_SIZE = 1 << 17;
private final InputStream is;
private final byte[] buff;
private int point, length;
public SimpleScanner ( final InputStream is ) {
this.is = is;
buff = new byte[BUFF_SIZE];
point = length = 0;
}
private void reload () {
do {
try {
length = is.read( buff, point = 0, BUFF_SIZE );
} catch ( final IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
} while ( length == -1 );
}
private byte read () {
if ( point == length ) {
reload();
}
return buff[point++];
}
public byte nextByte () {
byte c = read();
while ( c <= ' ' ) {
c = read();
}
return c;
}
public int nextInt () {
int ans = 0;
byte c = nextByte();
final boolean negate = c == '-';
if ( !MathFunction.rangeCheckClose( c, '0', '9' ) ) {
c = read();
}
while ( MathFunction.rangeCheckClose( c, '0', '9' ) ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public long nextLong () {
long ans = 0;
byte c = nextByte();
final boolean negate = c == '-';
if ( !MathFunction.rangeCheckClose( c, '0', '9' ) ) {
c = read();
}
while ( MathFunction.rangeCheckClose( c, '0', '9' ) ) {
ans = ans * 10 + c - '0';
c = read();
}
return negate ? -ans : ans;
}
public char nextChar () {
return ( char )nextByte();
}
public String next () {
final StringBuilder ans = new StringBuilder();
byte c = nextByte();
while ( c > ' ' ) {
ans.append( ( char )c );
c = read();
}
return ans.toString();
}
public byte[] nextByte ( final int n ) {
final byte[] ans = new byte[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextByte();
}
return ans;
}
public int[] nextInt ( final int n ) {
final int[] ans = new int[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextInt();
}
return ans;
}
public long[] nextLong ( final int n ) {
final long[] ans = new long[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextLong();
}
return ans;
}
public String[] next ( final int n ) {
final String[] ans = new String[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = next();
}
return ans;
}
public byte[][] nextByte ( final int n, final int m ) {
final byte[][] ans = new byte[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextByte( m );
}
return ans;
}
public int[][] nextInt ( final int n, final int m ) {
final int[][] ans = new int[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextInt( m );
}
return ans;
}
public long[][] nextLong ( final int n, final int m ) {
final long[][] ans = new long[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextLong( m );
}
return ans;
}
public String[][] next ( final int n, final int m ) {
final String[][] ans = new String[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = next( m );
}
return ans;
}
public char[] nextCharArray () {
return next().toCharArray();
}
public char[][] nextCharArray ( final int n ) {
final char[][] ans = new char[n][];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextCharArray();
}
return ans;
}
public int[][] nextGraph ( final int N, final int M ) {
if ( M == 0 ) {
return new int[N + 1][0];
}
final int[][] ans = new int[N + 1][];
final int[] count = new int[N + 1];
final int[][] path = nextInt( M, 2 );
for ( final int[] temp: path ) {
++count[temp[0]];
++count[temp[1]];
}
for ( int i = 1; i <= N; ++i ) {
ans[i] = new int[count[i]];
}
for ( final int[] temp: path ) {
ans[temp[0]][--count[temp[0]]] = temp[1];
ans[temp[1]][--count[temp[1]]] = temp[0];
}
ans[0] = new int[0];
return ans;
}
public Point nextPoint () {
return new Point( nextInt(), nextInt() );
}
public Point[] nextPoint ( final int n ) {
final Point[] ans = new Point[n];
for ( int i = 0; i < n; ++i ) {
ans[i] = nextPoint();
}
return ans;
}
public void close () {
try {
is.close();
} catch ( final IOException e ) {
e.printStackTrace();
System.exit( 1 );
}
}
}
final class SimpleOutputStream extends FilterOutputStream {
private final byte buf[];
private int count;
public SimpleOutputStream(final OutputStream out) {
this(out, 1<<17);
}
public SimpleOutputStream(final OutputStream out, final int size) {
super(out);
if (size <= 0) {
throw new IllegalArgumentException("Buffer size <= 0");
}
buf = new byte[size];
}
private void flushBuffer() throws IOException {
if (count > 0) {
out.write(buf, 0, count);
count = 0;
}
}
public void write(final int b) throws IOException {
if (count >= buf.length) {
flushBuffer();
}
buf[count++] = (byte)b;
}
public void write(final byte b[], final int off, final int len) throws IOException {
if (len >= buf.length) {
flushBuffer();
out.write(b, off, len);
return;
}
if (len > buf.length - count) {
flushBuffer();
}
System.arraycopy(b, off, buf, count, len);
count += len;
}
public void flush() throws IOException {
flushBuffer();
out.flush();
}
}
final class SimpleWriter implements Appendable, Closeable, Flushable, AutoCloseable{
private Writer out;
private final boolean autoFlush;
private boolean trouble = false;
private Formatter formatter;
private PrintStream psOut = null;
private static Charset toCharset ( final String csn ) {
if ( csn == null ) {
throw new NullPointerException( "charsetName" );
}
try {
return Charset.forName( csn );
} catch ( IllegalCharsetNameException |
UnsupportedCharsetException e ) {
e.printStackTrace();
System.exit( 1 );
return null;
}
}
public SimpleWriter ( final Writer out ) {
this( out, false );
}
public SimpleWriter ( final Writer out, final boolean autoFlush ) {
this.out = out;
this.autoFlush = autoFlush;
}
public SimpleWriter ( final OutputStream out ) {
this( out, false );
}
public SimpleWriter ( final OutputStream out, final boolean autoFlush ) {
this(out, autoFlush, Charset.defaultCharset());
}
public SimpleWriter(final OutputStream out, final boolean autoFlush, final Charset charset) {
this(new BufferedWriter(new OutputStreamWriter(new SimpleOutputStream(out), charset)), autoFlush);
if (out instanceof PrintStream) {
psOut = (PrintStream) out;
}
}
private void ensureOpen () throws IOException {
if ( out == null ) {
throw new IOException( "Stream closed" );
}
}
public void flush () {
try {
ensureOpen();
out.flush();
} catch ( IOException x ) {
trouble = true;
}
}
public void close () {
try {
if ( out == null ) {
return;
}
out.close();
out = null;
} catch ( IOException x ) {
trouble = true;
}
}
public boolean checkError () {
if ( out != null ) {
flush();
}
else if ( psOut != null ) {
return psOut.checkError();
}
return trouble;
}
private void setError () {
trouble = true;
}
private void clearError () {
trouble = false;
}
public void write ( final int c ) {
try {
ensureOpen();
out.write( c );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final char[] buf, final int off, final int len ) {
try {
ensureOpen();
out.write( buf, off, len );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final char[] buf ) {
write( buf, 0, buf.length );
}
public void write ( final String s, final int off, final int len ) {
try {
ensureOpen();
out.write( s, off, len );
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void write ( final String s ) {
write( s, 0, s.length() );
}
private void newLine () {
try {
ensureOpen();
out.write( System.lineSeparator() );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
}
public void print ( final boolean b ) {
write( b ? "true" : "false" );
}
public void print ( final char c ) {
write( c );
}
public void print ( final int i ) {
write( String.valueOf( i ) );
}
public void print ( final long l ) {
write( String.valueOf( l ) );
}
public void print ( final float f ) {
write( String.valueOf( f ) );
}
public void print ( final double d ) {
write( String.valueOf( d ) );
}
public void print ( final char[] s ) {
write( s );
}
public void print ( final String s ) {
write( s );
}
public void print ( final Object obj ) {
write( obj.toString() );
}
public void println () {
newLine();
}
public void println ( final boolean x ) {
print( x );
println();
}
public void println ( final char x ) {
print( x );
println();
}
public void println ( final int x ) {
print( x );
println();
}
public void println ( final long x ) {
print( x );
println();
}
public void println ( final float x ) {
print( x );
println();
}
public void println ( final double x ) {
print( x );
println();
}
public void println ( final char[] x ) {
print( x );
println();
}
public void println ( final String x ) {
print( x );
println();
}
public void println ( final Object x ) {
print( x.toString() );
println();
}
public SimpleWriter printf ( final String format, final Object... args ) {
return format( format, args );
}
public SimpleWriter printf ( final Locale l, final String format, final Object... args ) {
return format( l, format, args );
}
public SimpleWriter format ( final String format, final Object... args ) {
try {
ensureOpen();
if ( ( formatter == null )
|| ( formatter.locale() != Locale.getDefault() ) ) {
formatter = new Formatter( this );
}
formatter.format( Locale.getDefault(), format, args );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
return this;
}
public SimpleWriter format ( final Locale l, final String format, final Object... args ) {
try {
ensureOpen();
if ( ( formatter == null ) || ( formatter.locale() != l ) ) {
formatter = new Formatter( this, l );
}
formatter.format( l, format, args );
if ( autoFlush ) {
out.flush();
}
} catch ( InterruptedIOException x ) {
Thread.currentThread().interrupt();
} catch ( IOException x ) {
trouble = true;
}
return this;
}
public SimpleWriter append ( final CharSequence csq ) {
write( String.valueOf( csq ) );
return this;
}
public SimpleWriter append ( CharSequence csq, final int start, final int end ) {
if ( csq == null ) {
csq = "null";
}
return append( csq.subSequence( start, end ) );
}
public SimpleWriter append ( final char c ) {
write( c );
return this;
}
public void println ( final int[] array ) {
println( array, ' ' );
}
public void println ( final int[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final int[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final int[][] array ) {
println( array, ' ' );
}
public void println ( final int[][] arrays, final String str ) {
for ( final int[] array: arrays ) {
println( array, str );
}
}
public void println ( final int[][] arrays, final char c ) {
for ( final int[] array: arrays ) {
println( array, c );
}
}
public void println ( final long[] array ) {
println( array, ' ' );
}
public void println ( final long[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final long[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final long[][] array ) {
println( array, ' ' );
}
public void println ( final long[][] arrays, final String str ) {
for ( final long[] array: arrays ) {
println( array, str );
}
}
public void println ( final long[][] arrays, final char c ) {
for ( final long[] array: arrays ) {
println( array, c );
}
}
public void println ( final double[] array ) {
println( array, ' ' );
}
public void println ( final double[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public void println ( final double[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public void println ( final double[][] array ) {
println( array, ' ' );
}
public void println ( final double[][] arrays, final String str ) {
for ( final double[] array: arrays ) {
println( array, str );
}
}
public void println ( final double[][] arrays, final char c ) {
for ( final double[] array: arrays ) {
println( array, c );
}
}
public void println ( final char[] cs, final String str ) {
print( cs[0] );
for ( int i = 1; i < cs.length; ++i ) {
print( str );
print( cs[i] );
}
println();
}
public void println ( final char[] cs, final char c ) {
print( cs[0] );
for ( int i = 1; i < cs.length; ++i ) {
print( c );
print( cs[i] );
}
println();
}
public void println ( final char[][] cs ) {
for ( final char[] c: cs ) {
println( c );
}
}
public void println ( final char[][] cs, final String str ) {
for ( final char[] c: cs ) {
println( c, str );
}
}
public void println ( final char[][] cs, final char c ) {
for ( final char[] cc: cs ) {
println( cc, c );
}
}
public <E> void println ( final E[] array ) {
println( array, ' ' );
}
public <E> void println ( final E[] array, final String str ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( str );
print( array[i] );
}
println();
}
public <E> void println ( final E[] array, final char c ) {
print( array[0] );
for ( int i = 1; i < array.length; ++i ) {
print( c );
print( array[i] );
}
println();
}
public <E> void println ( final E[][] arrays ) {
println( arrays, ' ' );
}
public <E> void println ( final E[][] arrays, final String str ) {
for ( final E[] array: arrays ) {
println( array, str );
}
}
public <E> void println ( final E[][] arrays, final char c ) {
for ( final E[] array: arrays ) {
println( array, c );
}
}
}
| ConDefects/ConDefects/Code/abc322_e/Java/46124657 |
condefects-java_data_281 |
import java.io.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
static PrintWriter printWriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static Utils utils = new Utils();
public static void main(String[] args) throws IOException {
// int o = readInt();
// while (o-- > 0)
solve();
closeAndFlush();
}
static class Edge {
int to, pe, w;
public Edge(int to, int pe) {
this.to = to;
this.pe = pe;
}
public Edge(int to, int pe, int w) {
this.to = to;
this.pe = pe;
this.w = w;
}
}
static class Pair {
int first;
int second;
public Pair() {
}
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair pair = (Pair) o;
return first == pair.first && second == pair.second;
}
@Override
public int hashCode() {
return Objects.hash(first, second);
}
@Override
public String toString() {
return first + " " + second;
}
}
static int[] dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};//上右下左
static int n, m, idx = 1;
static int[] head;
static Edge[] edges;
// static int inf = 1 << 30;
static long inf = utils.forceLong(1e14);
public static void solve() throws IOException {
int n = readInt(), k = readInt(), p = readInt();
long[] dp = new long[100005], c = new long[105];
int[][] a = new int[105][15];
int m = 0;
/**
* 组成 k个 p
* 第 i个 p表示第 i个产品达到参数 p
*/
for (int i = 1; i <= k; i++) m = m * 10 + p;
for (int i = 1; i <= n; i++) {
c[i] = readInt();
for (int j = 1; j <= k; j++) {
a[i][j] = readInt();
}
}
// dp[x]数组定义：表示 k个背包状态为 x的最小花费,最终求dp[m]的表示每一个产品都为 p的最小代价
// Arrays.fill(dp, inf);
Arrays.fill(dp, 0x3f3f3f3f);
dp[0] = 0;
for (int i = 1; i <= n; i++) {// 物品
for (int j = m; j >= 0; j--) {// 价值
int[] w = new int[6];
for (int le = 1, ri = j; le <= k; le++, ri /= 10) {
w[le] = Math.max(0, ri % 10 - a[i][le]);
}
int x = 0;
for (int l = k; l >= 1; --l) x = x * 10 + w[l];
dp[j] = Math.min(dp[j], dp[x] + c[i]);// 01背包
}
}
printWriter.println(dp[m] > utils.forceLong(1e11) ? -1 : dp[m]);
}
public static void add(int a, int b) {
edges[idx] = new Edge(b, head[a]);
head[a] = idx++;
}
public static void add(int a, int b, int c) {
edges[idx] = new Edge(b, head[a], c);
head[a] = idx++;
}
public static int readInt() throws IOException {
return sc.nextInt();
}
public static long readLong() throws IOException {
return sc.nextLong();
}
public static String readString() throws IOException {
return sc.next();
// return sc.nextLine();
}
public static void closeAndFlush() throws IOException {
printWriter.flush();
printWriter.close();
sc.close();
}
public static void arrayToString(int[] arr) {
for (int i = 0; i < arr.length; i++) {
printWriter.print(arr[i] + " ");
}
printWriter.println();
}
public static void arrayToString(int[][] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
printWriter.print(arr[i][j] + " ");
}
printWriter.println();
}
}
}
class Utils {
public static int[] nextIntArray(int n) throws IOException {
int[] arr = new int[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = Main.readInt();
}
return arr;
}
public static int[][] nextIntArray(int n, int m) throws IOException {
int[][] arr = new int[n + 1][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
arr[i][j] = Main.readInt();
}
}
return arr;
}
public static long[] nextLongArray(int n) throws IOException {
long[] arr = new long[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = Main.readLong();
}
return arr;
}
public static long[][] nextLongArray(int n, int m) throws IOException {
long[][] arr = new long[n + 1][];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
arr[i][j] = Main.readLong();
}
}
return arr;
}
public static String[] nextStringArray(int n) throws IOException {
String[] strings = new String[n + 1];
for (int i = 1; i <= n; i++) {
strings[i] = " " + Main.readString();
}
return strings;
}
public static char[][] nextCharArray(int n, int m) throws IOException {
char[][] chars = new char[n + 5][m + 5];
for (int i = 1; i <= n; i++) {
chars[i] = (" " + Main.readString()).toCharArray();
}
return chars;
}
public static int forceInt(long n) {
return (int) n;
}
public static int forceInt(double n) {
return (int) n;
}
public static long forceLong(int n) {
return n;
}
public static long forceLong(double n) {
return (long) n;
}
public static int max(int a, int b, int c) {
return Math.max(a, Math.max(b, c));
}
public static int min(int a, int b, int c) {
return Math.min(a, Math.min(b, c));
}
}
import java.io.*;
import java.util.*;
public class Main {
static Scanner sc = new Scanner(System.in);
static PrintWriter printWriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static Utils utils = new Utils();
public static void main(String[] args) throws IOException {
// int o = readInt();
// while (o-- > 0)
solve();
closeAndFlush();
}
static class Edge {
int to, pe, w;
public Edge(int to, int pe) {
this.to = to;
this.pe = pe;
}
public Edge(int to, int pe, int w) {
this.to = to;
this.pe = pe;
this.w = w;
}
}
static class Pair {
int first;
int second;
public Pair() {
}
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair pair = (Pair) o;
return first == pair.first && second == pair.second;
}
@Override
public int hashCode() {
return Objects.hash(first, second);
}
@Override
public String toString() {
return first + " " + second;
}
}
static int[] dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};//上右下左
static int n, m, idx = 1;
static int[] head;
static Edge[] edges;
// static int inf = 1 << 30;
static long inf = utils.forceLong(1e14);
public static void solve() throws IOException {
int n = readInt(), k = readInt(), p = readInt();
long[] dp = new long[100005], c = new long[105];
int[][] a = new int[105][15];
int m = 0;
/**
* 组成 k个 p
* 第 i个 p表示第 i个产品达到参数 p
*/
for (int i = 1; i <= k; i++) m = m * 10 + p;
for (int i = 1; i <= n; i++) {
c[i] = readInt();
for (int j = 1; j <= k; j++) {
a[i][j] = readInt();
}
}
// dp[x]数组定义：表示 k个背包状态为 x的最小花费,最终求dp[m]的表示每一个产品都为 p的最小代价
// Arrays.fill(dp, inf);
Arrays.fill(dp, inf);
dp[0] = 0;
for (int i = 1; i <= n; i++) {// 物品
for (int j = m; j >= 0; j--) {// 价值
int[] w = new int[6];
for (int le = 1, ri = j; le <= k; le++, ri /= 10) {
w[le] = Math.max(0, ri % 10 - a[i][le]);
}
int x = 0;
for (int l = k; l >= 1; --l) x = x * 10 + w[l];
dp[j] = Math.min(dp[j], dp[x] + c[i]);// 01背包
}
}
printWriter.println(dp[m] > utils.forceLong(1e11) ? -1 : dp[m]);
}
public static void add(int a, int b) {
edges[idx] = new Edge(b, head[a]);
head[a] = idx++;
}
public static void add(int a, int b, int c) {
edges[idx] = new Edge(b, head[a], c);
head[a] = idx++;
}
public static int readInt() throws IOException {
return sc.nextInt();
}
public static long readLong() throws IOException {
return sc.nextLong();
}
public static String readString() throws IOException {
return sc.next();
// return sc.nextLine();
}
public static void closeAndFlush() throws IOException {
printWriter.flush();
printWriter.close();
sc.close();
}
public static void arrayToString(int[] arr) {
for (int i = 0; i < arr.length; i++) {
printWriter.print(arr[i] + " ");
}
printWriter.println();
}
public static void arrayToString(int[][] arr) {
for (int i = 0; i < arr.length; i++) {
for (int j = 0; j < arr[i].length; j++) {
printWriter.print(arr[i][j] + " ");
}
printWriter.println();
}
}
}
class Utils {
public static int[] nextIntArray(int n) throws IOException {
int[] arr = new int[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = Main.readInt();
}
return arr;
}
public static int[][] nextIntArray(int n, int m) throws IOException {
int[][] arr = new int[n + 1][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
arr[i][j] = Main.readInt();
}
}
return arr;
}
public static long[] nextLongArray(int n) throws IOException {
long[] arr = new long[n + 1];
for (int i = 1; i <= n; i++) {
arr[i] = Main.readLong();
}
return arr;
}
public static long[][] nextLongArray(int n, int m) throws IOException {
long[][] arr = new long[n + 1][];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
arr[i][j] = Main.readLong();
}
}
return arr;
}
public static String[] nextStringArray(int n) throws IOException {
String[] strings = new String[n + 1];
for (int i = 1; i <= n; i++) {
strings[i] = " " + Main.readString();
}
return strings;
}
public static char[][] nextCharArray(int n, int m) throws IOException {
char[][] chars = new char[n + 5][m + 5];
for (int i = 1; i <= n; i++) {
chars[i] = (" " + Main.readString()).toCharArray();
}
return chars;
}
public static int forceInt(long n) {
return (int) n;
}
public static int forceInt(double n) {
return (int) n;
}
public static long forceLong(int n) {
return n;
}
public static long forceLong(double n) {
return (long) n;
}
public static int max(int a, int b, int c) {
return Math.max(a, Math.max(b, c));
}
public static int min(int a, int b, int c) {
return Math.min(a, Math.min(b, c));
}
}
| ConDefects/ConDefects/Code/abc322_e/Java/46166315 |
condefects-java_data_282 | import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
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 k = Integer.parseInt(sc.next());
int p = Integer.parseInt(sc.next());
Map<List<Integer>, Long> dp = new HashMap<List<Integer>, Long>();
List<Integer> s = new ArrayList<Integer>();
for(int i = 0; i < k; i++) s.add(0);
dp.put(s, 0L);
for(int i = 0; i < n; i++) {
int c = Integer.parseInt(sc.next());
int[] a = new int[k];
for(int j = 0; j < k; j++) a[j] = Integer.parseInt(sc.next());
Map<List<Integer>, Long> old = new HashMap<List<Integer>, Long>(dp);
for(Entry<List<Integer>, Long> entry : old.entrySet()) {
List<Integer> d = new ArrayList<Integer>(entry.getKey());
long val = entry.getValue();
for(int j = 0; j < k; j++) d.set(j, Math.min(d.get(j) + a[j], p));
if(dp.containsKey(d)) dp.put(d, Math.min(dp.get(d), val + c));
else dp.put(d, val + c);
}
}
List<Integer> t = new ArrayList<Integer>();
for(int i = 0; i < k; i++) t.add(5);
if(dp.containsKey(t)) System.out.println(dp.get(t));
else System.out.println(-1);
}
}
}
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
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 k = Integer.parseInt(sc.next());
int p = Integer.parseInt(sc.next());
Map<List<Integer>, Long> dp = new HashMap<List<Integer>, Long>();
List<Integer> s = new ArrayList<Integer>();
for(int i = 0; i < k; i++) s.add(0);
dp.put(s, 0L);
for(int i = 0; i < n; i++) {
int c = Integer.parseInt(sc.next());
int[] a = new int[k];
for(int j = 0; j < k; j++) a[j] = Integer.parseInt(sc.next());
Map<List<Integer>, Long> old = new HashMap<List<Integer>, Long>(dp);
for(Entry<List<Integer>, Long> entry : old.entrySet()) {
List<Integer> d = new ArrayList<Integer>(entry.getKey());
long val = entry.getValue();
for(int j = 0; j < k; j++) d.set(j, Math.min(d.get(j) + a[j], p));
if(dp.containsKey(d)) dp.put(d, Math.min(dp.get(d), val + c));
else dp.put(d, val + c);
}
}
List<Integer> t = new ArrayList<Integer>();
for(int i = 0; i < k; i++) t.add(p);
if(dp.containsKey(t)) System.out.println(dp.get(t));
else System.out.println(-1);
}
}
}
| ConDefects/ConDefects/Code/abc322_e/Java/50020048 |
condefects-java_data_283 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
long number = sc.nextLong();
StringBuilder sb = new StringBuilder();
number -= 1;
while (number > 0) {
sb.append(number % 5 * 2);
number = number / 5;
}
sb.reverse();
System.out.println(sb.toString());
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
long number = sc.nextLong();
StringBuilder sb = new StringBuilder();
number -= 1;
while (number > 0) {
sb.append(number % 5 * 2);
number = number / 5;
}
sb.reverse();
if (sb.length() < 1)
sb.append(0);
System.out.println(sb.toString());
}
}
}
| ConDefects/ConDefects/Code/abc336_c/Java/51505019 |
condefects-java_data_284 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
char[][]table=new char[n][m];
for(int i=0;i<n;i++){
String s=sc.next();
for(int j=0;j<m;j++){
table[i][j]=s.charAt(j);
}
}
for(int i=0;i<n-8;i++){
for(int j=0;j<m-8;j++){
boolean ok=true;
for(int k=0;k<4;k++){
for(int l=0;l<4;l++){
if(k<3 && l<3){
if(!(table[i+k][j+l]=='#' && table[i+8-k][j+8-l]=='#')){
ok=false;
}
} else{
if(!(table[i+k][j+l]!='.' && table[i+8-k][j+8-l]=='.')){
ok=false;
}
}
}
}
if(ok){
System.out.println((i+1)+" "+(j+1));
}
}
}
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
char[][]table=new char[n][m];
for(int i=0;i<n;i++){
String s=sc.next();
for(int j=0;j<m;j++){
table[i][j]=s.charAt(j);
}
}
for(int i=0;i<n-8;i++){
for(int j=0;j<m-8;j++){
boolean ok=true;
for(int k=0;k<4;k++){
for(int l=0;l<4;l++){
if(k<3 && l<3){
if(!(table[i+k][j+l]=='#' && table[i+8-k][j+8-l]=='#')){
ok=false;
}
} else{
if(!(table[i+k][j+l]=='.' && table[i+8-k][j+8-l]=='.')){
ok=false;
}
}
}
}
if(ok){
System.out.println((i+1)+" "+(j+1));
}
}
}
}
} | ConDefects/ConDefects/Code/abc312_b/Java/45300171 |
condefects-java_data_285 | import java.util.Scanner;
import java.util.Arrays;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
Integer[] A = new Integer[N];
A[0] = sc.nextInt();
for(int i=1;i<N;i++){
A[i] = (sc.nextInt()+A[i-1])%360;
}
Arrays.sort(A);
int answer = 0;
for(int i=1;i<N;i++){
if(A[i]-A[i-1]>answer)
answer = A[i]-A[i-1];
}
if(360-A[N-1]>answer)
System.out.println(360-A[N-1]);
else
System.out.println(answer);
}
}
import java.util.Scanner;
import java.util.Arrays;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
Integer[] A = new Integer[N];
A[0] = sc.nextInt();
for(int i=1;i<N;i++){
A[i] = (sc.nextInt()+A[i-1])%360;
}
Arrays.sort(A);
int answer = A[0];
for(int i=1;i<N;i++){
if(A[i]-A[i-1]>answer)
answer = A[i]-A[i-1];
}
if(360-A[N-1]>answer)
System.out.println(360-A[N-1]);
else
System.out.println(answer);
}
}
| ConDefects/ConDefects/Code/abc238_b/Java/33002740 |
condefects-java_data_286 | import java.util.*;
class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
int[] a = new int[n+2];
a[n] = 0;
a[n+1] = 0;
int s = 0;
for(int i=0; i<n; i++) {
int nxt = sc.nextInt();
s += nxt;
a[i] = s%360;
}
Arrays.sort(a);
int ans = 0;
for(int i=0; i<n+1; i++) {
ans = Math.max(ans, a[i+1]-a[i]);
}
System.out.println(ans);
}
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in)) {
int n = sc.nextInt();
int[] a = new int[n+2];
a[n] = 0;
a[n+1] = 360;
int s = 0;
for(int i=0; i<n; i++) {
int nxt = sc.nextInt();
s += nxt;
a[i] = s%360;
}
Arrays.sort(a);
int ans = 0;
for(int i=0; i<n+1; i++) {
ans = Math.max(ans, a[i+1]-a[i]);
}
System.out.println(ans);
}
}
} | ConDefects/ConDefects/Code/abc238_b/Java/32809318 |
condefects-java_data_287 | import java.util.Arrays;
import java.util.Scanner;
public class Main {//B - Pizza s
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] pizza = new int[n];
int[] pizzaAngle = new int[n+2];
int angle = 0;
int angleSum = 0;
for(int i = 0; i < n; i++ ) {
angle = sc.nextInt();
angleSum += angle;
if(angleSum > 360) angleSum -= 360;
pizza[i] = angleSum;
}
Arrays.sort(pizza);
int j = 0;
pizzaAngle[0] = 0;
pizzaAngle[n+1] = 360;
for(int i = 1; i < n + 1; i++) {
pizzaAngle[i] = pizza[j];
j++;
}
int result = 0;
for(int i = 1; i < n+1; i++) {
int answer = pizzaAngle[i+1] - pizzaAngle[i];
if(result < answer) {
result = answer;
}
}
System.out.println(result);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {//B - Pizza s
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] pizza = new int[n];
int[] pizzaAngle = new int[n+2];
int angle = 0;
int angleSum = 0;
for(int i = 0; i < n; i++ ) {
angle = sc.nextInt();
angleSum += angle;
if(angleSum > 360) angleSum -= 360;
pizza[i] = angleSum;
}
Arrays.sort(pizza);
int j = 0;
pizzaAngle[0] = 0;
pizzaAngle[n+1] = 360;
for(int i = 1; i < n + 1; i++) {
pizzaAngle[i] = pizza[j];
j++;
}
int result = 0;
for(int i = 0; i < n+1; i++) {
int answer = pizzaAngle[i+1] - pizzaAngle[i];
if(result < answer) {
result = answer;
}
}
System.out.println(result);
}
}
| ConDefects/ConDefects/Code/abc238_b/Java/35979661 |
condefects-java_data_288 | 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();
boolean[] b = new boolean[361];
b[0] = true;
b[360] = true;
int pos = 0;
for (int i=0; i<n; i++) {
int temp = nextInt();
pos += temp;
pos %= 360;
b[pos] = true;
}
int max = -1;
int count = -1;
boolean flag = true;
for (int i=0; i<=360; i++) {
if (b[i] == true) {
// println(count);
max = Math.max(max, count);
count = 1;
}
else {
count++;
}
}
println(count);
}
public static String yesno(boolean b) {return b?"Yes":"No";}
public static int[] accumulateSum (int[] a) {
int[] b = new int[a.length+1];
for (int i=1; i<a.length+1; i++) {
b[i] = b[i-1] + a[i-1];
}
return b;
}
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();
boolean[] b = new boolean[361];
b[0] = true;
b[360] = true;
int pos = 0;
for (int i=0; i<n; i++) {
int temp = nextInt();
pos += temp;
pos %= 360;
b[pos] = true;
}
int max = -1;
int count = -1;
boolean flag = true;
for (int i=0; i<=360; i++) {
if (b[i] == true) {
// println(count);
max = Math.max(max, count);
count = 1;
}
else {
count++;
}
}
println(max);
}
public static String yesno(boolean b) {return b?"Yes":"No";}
public static int[] accumulateSum (int[] a) {
int[] b = new int[a.length+1];
for (int i=1; i<a.length+1; i++) {
b[i] = b[i-1] + a[i-1];
}
return b;
}
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/abc238_b/Java/38138350 |
condefects-java_data_289 | 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));
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
for(int i=0; i<arr.length; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
for(int i=1; i<arr.length; i++) {
arr[i] = arr[i] + arr[i-1];
if(arr[i] > 360) arr[i] = arr[i]-360;
}
Arrays.sort(arr);
int max = 0;
for(int i=0; i<arr.length-1; i++) {
if(max < arr[i+1]-arr[i]) max = arr[i+1]-arr[i];
}
int first = arr[0];
int last = 360 - arr[0];
System.out.println(Math.max(max, Math.max(first, last)));
}// 메인 끝
}
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));
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n];
StringTokenizer st = new StringTokenizer(br.readLine());
for(int i=0; i<arr.length; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
for(int i=1; i<arr.length; i++) {
arr[i] = arr[i] + arr[i-1];
if(arr[i] > 360) arr[i] = arr[i]-360;
}
Arrays.sort(arr);
int max = 0;
for(int i=0; i<arr.length-1; i++) {
if(max < arr[i+1]-arr[i]) max = arr[i+1]-arr[i];
}
int first = arr[0];
int last = 360 - arr[arr.length-1];
System.out.println(Math.max(max, Math.max(first, last)));
}// 메인 끝
} | ConDefects/ConDefects/Code/abc238_b/Java/35930594 |
condefects-java_data_290 | import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int A[] = new int[N];
Set<Integer> ans_set = new HashSet<>();
int tmp = 0;
ans_set.add(0);
for(int i=0;i<N;i++) {
A[i]=sc.nextInt();
tmp=tmp+A[i];
ans_set.add(tmp%360);
}
ArrayList<Integer> ans = new ArrayList<>(ans_set);
int maekaku = 0;
int max=0;
Collections.sort(ans);
for(int kaku:ans) {
max=Math.max(Math.abs(maekaku-kaku), max);
maekaku=kaku;
}
System.out.println(max);
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int A[] = new int[N];
Set<Integer> ans_set = new HashSet<>();
int tmp = 0;
ans_set.add(360);
for(int i=0;i<N;i++) {
A[i]=sc.nextInt();
tmp=tmp+A[i];
ans_set.add(tmp%360);
}
ArrayList<Integer> ans = new ArrayList<>(ans_set);
int maekaku = 0;
int max=0;
Collections.sort(ans);
for(int kaku:ans) {
max=Math.max(Math.abs(maekaku-kaku), max);
maekaku=kaku;
}
System.out.println(max);
}
}
| ConDefects/ConDefects/Code/abc238_b/Java/32458656 |
condefects-java_data_291 | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.concurrent.ThreadLocalRandom;
class Main {
public static void main(String[] args) {
var scanner = new Scanner(System.in);
var writer = new PrintWriter(System.out);
var N = readInt(scanner);
var ans = 0;
var squareNumbers = findSquareNumber(N);
var primes = findPrimeNumber(N);
for (var i = 1; i <= N; i++) {
var counter = calcCounterNumber(i, primes);
var low = 0;
var high = squareNumbers.size();
var mid = (low + high) / 2;
while (high - low > 1) {
if (counter * squareNumbers.get(mid) > N || counter * squareNumbers.get(mid) < counter) {
high = mid;
} else {
low = mid;
}
mid = (high + low) / 2;
}
ans += high;
}
writer.println(ans);
scanner.close();
writer.flush();
}
/**
* 入力をInt型で受け取ります
* @param scanner Scanner
* @return 入力値(int)
*/
static Integer readInt(final Scanner scanner) {
return Integer.parseInt(scanner.next());
}
/**
* N以下の平方数を取得します.
* @param N 上限
* @return 平方数のリスト
*/
static List<Integer> findSquareNumber(final Integer N) {
var squareNumbers = new ArrayList<Integer>();
for (var i = 1; i <= N; i++) {
if (i * i > N) {
break;
}
squareNumbers.add(i * i);
}
return squareNumbers;
}
static List<Integer> findPrimeNumber(final Integer N) {
var primes = new ArrayList<Integer>();
var isPrime = new boolean[N + 2];
Arrays.fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (var i = 2; i <= N; i++) {
if (isPrime[i]) {
primes.add(i);
var idx = i * 2;
while (idx <= N) {
isPrime[idx] = false;
idx += i;
}
}
}
return primes;
}
/**
* i にかけることで平方数となる最小の数値を計算します.
* @param i 対象の数
* @param primes 素数
* @return iを平方数にする最小の数
*/
static Integer calcCounterNumber(final Integer i, final List<Integer> primes) {
if (i == 1) {
return 1;
}
var P = i;
var counter = 1;
for (var div : primes) {
var count = 0;
while (P % div == 0) {
P /= div;
count += 1;
}
if (count % 2 == 1) {
counter *= div;
}
if (P <= 1) {
break;
}
}
return counter;
}
}
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.concurrent.ThreadLocalRandom;
class Main {
public static void main(String[] args) {
var scanner = new Scanner(System.in);
var writer = new PrintWriter(System.out);
var N = readInt(scanner);
var ans = 0;
var squareNumbers = findSquareNumber(N);
var primes = findPrimeNumber(N);
for (var i = 1; i <= N; i++) {
var counter = calcCounterNumber(i, primes);
var low = 0;
var high = squareNumbers.size();
var mid = (low + high) / 2;
while (high - low > 1) {
if ((long) counter * (long) squareNumbers.get(mid) > (long) N) {
high = mid;
} else {
low = mid;
}
mid = (high + low) / 2;
}
ans += high;
}
writer.println(ans);
scanner.close();
writer.flush();
}
/**
* 入力をInt型で受け取ります
* @param scanner Scanner
* @return 入力値(int)
*/
static Integer readInt(final Scanner scanner) {
return Integer.parseInt(scanner.next());
}
/**
* N以下の平方数を取得します.
* @param N 上限
* @return 平方数のリスト
*/
static List<Integer> findSquareNumber(final Integer N) {
var squareNumbers = new ArrayList<Integer>();
for (var i = 1; i <= N; i++) {
if (i * i > N) {
break;
}
squareNumbers.add(i * i);
}
return squareNumbers;
}
static List<Integer> findPrimeNumber(final Integer N) {
var primes = new ArrayList<Integer>();
var isPrime = new boolean[N + 2];
Arrays.fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (var i = 2; i <= N; i++) {
if (isPrime[i]) {
primes.add(i);
var idx = i * 2;
while (idx <= N) {
isPrime[idx] = false;
idx += i;
}
}
}
return primes;
}
/**
* i にかけることで平方数となる最小の数値を計算します.
* @param i 対象の数
* @param primes 素数
* @return iを平方数にする最小の数
*/
static Integer calcCounterNumber(final Integer i, final List<Integer> primes) {
if (i == 1) {
return 1;
}
var P = i;
var counter = 1;
for (var div : primes) {
var count = 0;
while (P % div == 0) {
P /= div;
count += 1;
}
if (count % 2 == 1) {
counter *= div;
}
if (P <= 1) {
break;
}
}
return counter;
}
}
| ConDefects/ConDefects/Code/abc254_d/Java/32322493 |
condefects-java_data_292 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static List<Integer>[] graph;
public static void main(String[] args) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int N, M;
st = new StringTokenizer(input.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
if (M == 0) {
System.out.println(0);
return;
}
// 1부터 시작
graph = new List[N+1];
for (int i = 1; i <= N; i++)
graph[i] = new ArrayList<>();
for (int i = 1; i <= M; i++) {
st = new StringTokenizer(input.readLine());
int from = Integer.parseInt(st.nextToken());
int to = Integer.parseInt(st.nextToken());
graph[from].add(to);
graph[to].add(from);
}
// 1부터 시작
boolean[] isVisit = new boolean[N+1];
Queue<Integer> queue = new LinkedList<>();
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (isVisit[i])
continue;
queue.add(i);
cnt++;
isVisit[i] = true;
while (!queue.isEmpty()) {
int v = queue.poll();
for (Integer nextV : graph[v]) {
if (isVisit[nextV])
continue;
queue.add(nextV);
isVisit[nextV] = true;
}
}
}
System.out.println(cnt);
}
}
class Edge {
int from, to;
public Edge(int from, int to) {
this.from = from;
this.to = to;
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
public static List<Integer>[] graph;
public static void main(String[] args) throws IOException {
BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
int N, M;
st = new StringTokenizer(input.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
if (M == 0) {
System.out.println(N);
return;
}
// 1부터 시작
graph = new List[N+1];
for (int i = 1; i <= N; i++)
graph[i] = new ArrayList<>();
for (int i = 1; i <= M; i++) {
st = new StringTokenizer(input.readLine());
int from = Integer.parseInt(st.nextToken());
int to = Integer.parseInt(st.nextToken());
graph[from].add(to);
graph[to].add(from);
}
// 1부터 시작
boolean[] isVisit = new boolean[N+1];
Queue<Integer> queue = new LinkedList<>();
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (isVisit[i])
continue;
queue.add(i);
cnt++;
isVisit[i] = true;
while (!queue.isEmpty()) {
int v = queue.poll();
for (Integer nextV : graph[v]) {
if (isVisit[nextV])
continue;
queue.add(nextV);
isVisit[nextV] = true;
}
}
}
System.out.println(cnt);
}
}
class Edge {
int from, to;
public Edge(int from, int to) {
this.from = from;
this.to = to;
}
}
| ConDefects/ConDefects/Code/abc284_c/Java/48921152 |
condefects-java_data_293 | 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 Y = in.nextInt();
for (int x = Y; x <=3000; x++)
{
if (x % 4 == 2)
{
System.out.println(x);
return;
}
}
}
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 Y = in.nextInt();
for (int x = Y; x <=3002; x++)
{
if (x % 4 == 2)
{
System.out.println(x);
return;
}
}
}
public static void main(String[] args) {
in = new Scanner(System.in);
solve();
in.close();
}
} | ConDefects/ConDefects/Code/abc262_a/Java/41766743 |
condefects-java_data_294 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner input = new Scanner(System.in);
int Y = input.nextInt();
for(int i = Y; i < 3001; i++) {
if(i%4 ==2) {
System.out.println(i);
break;
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner input = new Scanner(System.in);
int Y = input.nextInt();
for(int i = Y; i < 3004; i++) {
if(i%4 ==2) {
System.out.println(i);
break;
}
}
}
} | ConDefects/ConDefects/Code/abc262_a/Java/41122737 |
condefects-java_data_295 |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
class Comb {
long[] p;
long[] pi;
long mod;
public Comb(int n, long mod) {
this.mod=mod;
p=new long[n+1];
pi=new long[n+1];
p[0] = 1;
pi[0] = 1;
for (int i = 1; i <= n; i++) {
p[i] = p[i - 1] * i % mod;
}
pi[n] = modinv(p[n], (int) mod);
for (int i = n; i > 1; i--) {
pi[i-1] = pi[i] * (long) i % mod;
}
}
public long comb(int n, int r) {
if (n < r) return 0;
return p[n] * pi[r] % mod * pi[n - r] % mod;
}
public long perm(int n, int r) {
if (n < r) return 0;
return p[n] * pi[n - r] % mod;
}
long modinv(long a, long m) {
long b = m;
long u = 1;
long v = 0;
long tmp = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
tmp = a;
a = b;
b = tmp;
u -= t * v;
tmp = u;
u = v;
v = tmp;
}
u %= m;
if (u < 0) u += m;
return u;
}
}
public class Main {
static long M=998244353;
public void solve() throws Exception {
int h=nextInt(),w=nextInt(),k=nextInt();
long res=0;
int hw = h * w;
Comb c=new Comb(hw, M);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
res+=c.comb(h*w,k);
res-=c.comb(j*h,k);
res-=c.comb((w-j-1)*h,k);
res-=c.comb(i*w,k);
res-=c.comb((h-i-1)*w,k);
res+=c.comb(i*j,k);
res+=c.comb(i*(w-j-1),k);
res+=c.comb((h-i-1)*(w-j-1),k);
res+=c.comb((h-i-1)*j,k);
// res += M;
res%=M;
}
}
long modinv = c.modinv(c.comb(h*w,k), M);
out.println(((res*modinv+M)%M));
}
public static void main(String[] args) throws Exception {
new Main().solve();
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.util.stream.Collectors;
class Comb {
long[] p;
long[] pi;
long mod;
public Comb(int n, long mod) {
this.mod=mod;
p=new long[n+1];
pi=new long[n+1];
p[0] = 1;
pi[0] = 1;
for (int i = 1; i <= n; i++) {
p[i] = p[i - 1] * i % mod;
}
pi[n] = modinv(p[n], (int) mod);
for (int i = n; i > 1; i--) {
pi[i-1] = pi[i] * (long) i % mod;
}
}
public long comb(int n, int r) {
if (n < r) return 0;
return p[n] * pi[r] % mod * pi[n - r] % mod;
}
public long perm(int n, int r) {
if (n < r) return 0;
return p[n] * pi[n - r] % mod;
}
long modinv(long a, long m) {
long b = m;
long u = 1;
long v = 0;
long tmp = 0;
while (b > 0) {
long t = a / b;
a -= t * b;
tmp = a;
a = b;
b = tmp;
u -= t * v;
tmp = u;
u = v;
v = tmp;
}
u %= m;
if (u < 0) u += m;
return u;
}
}
public class Main {
static long M=998244353;
public void solve() throws Exception {
int h=nextInt(),w=nextInt(),k=nextInt();
long res=0;
int hw = h * w;
Comb c=new Comb(hw, M);
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
res+=c.comb(h*w,k);
res-=c.comb(j*h,k);
res-=c.comb((w-j-1)*h,k);
res-=c.comb(i*w,k);
res-=c.comb((h-i-1)*w,k);
res+=c.comb(i*j,k);
res+=c.comb(i*(w-j-1),k);
res+=c.comb((h-i-1)*(w-j-1),k);
res+=c.comb((h-i-1)*j,k);
// res += M;
res%=M;
}
}
long modinv = c.modinv(c.comb(h*w,k), M);
out.println((((res+M)*modinv)%M));
}
public static void main(String[] args) throws Exception {
new Main().solve();
}
static PrintWriter out = new PrintWriter(System.out, true);
static InputReader in = new InputReader(System.in);
static String next() { return in.next(); }
static int nextInt() { return Integer.parseInt(in.next()); }
static long nextLong() { return Long.parseLong(in.next()); }
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
}
}
| ConDefects/ConDefects/Code/abc297_f/Java/40605051 |
condefects-java_data_296 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static FastIO io = new FastIO();
static int n, m;
static int[] p;
static long[] cnt, group;
public static void main(String[] args) {
n = io.nextInt();
m = io.nextInt();
p = new int[n + 1];
group = new long[n + 1];
cnt = new long[n + 1];
Arrays.fill(group, 1);
Arrays.fill(p, -1);
for (int i = 0; i < m; i++) {
int s = io.nextInt();
int e = io.nextInt();
cnt[e]++;
union(s, e);
}
boolean ok = true;
for (int i = 1; i <= n; i++) {
if (p[i] == -1) {
if (findCnt(i) != findGroup(i)) {
ok = false;
break;
}
}
}
if (!ok) System.out.println("No");
else System.out.println("Yes");
}
static void union(int a, int b) {
a = find(a);
b = find(b);
if (a == b) return;
p[a] = b;
cnt[b] += cnt[a];
cnt[a] = 0;
group[b] += group[a];
group[a] = 0;
}
static long findGroup(int x) {
return group[find(x)];
}
static long findCnt(int x) {
return cnt[find(x)];
}
static int find(int x) {
if (p[x] < 0) return x;
return p[x] = find(p[x]);
}
}
class FastIO {
public BufferedReader br;
public StringTokenizer st;
FastIO() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static FastIO io = new FastIO();
static int n, m;
static int[] p;
static long[] cnt, group;
public static void main(String[] args) {
n = io.nextInt();
m = io.nextInt();
p = new int[n + 1];
group = new long[n + 1];
cnt = new long[n + 1];
Arrays.fill(group, 1);
Arrays.fill(p, -1);
for (int i = 0; i < m; i++) {
int s = io.nextInt();
int e = io.nextInt();
cnt[find(e)]++;
union(s, e);
}
boolean ok = true;
for (int i = 1; i <= n; i++) {
if (p[i] == -1) {
if (findCnt(i) != findGroup(i)) {
ok = false;
break;
}
}
}
if (!ok) System.out.println("No");
else System.out.println("Yes");
}
static void union(int a, int b) {
a = find(a);
b = find(b);
if (a == b) return;
p[a] = b;
cnt[b] += cnt[a];
cnt[a] = 0;
group[b] += group[a];
group[a] = 0;
}
static long findGroup(int x) {
return group[find(x)];
}
static long findCnt(int x) {
return cnt[find(x)];
}
static int find(int x) {
if (p[x] < 0) return x;
return p[x] = find(p[x]);
}
}
class FastIO {
public BufferedReader br;
public StringTokenizer st;
FastIO() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public String next() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
} | ConDefects/ConDefects/Code/abc292_d/Java/45705972 |
condefects-java_data_297 | import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends Functions{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
Object solve(){
int N = in.it();
int Q = in.it();
int[] A = in.it(N);
int[] B = in.it(N);
SegmentTree<Data, Integer> segA = new SegmentTree<>(N -1){
@Override
protected void agg(Data v,Data a,Data b){ v.v = gcd(a.v,b.v); }
@Override
protected Data e(){ return new Data(0); }
@Override
protected Data init(int i){ return new Data(abs(A[i] -A[i +1])); }
@Override
protected void map(Data v,Integer f){}
};
SegmentTree<Data, Integer> segB = new SegmentTree<>(N -1){
@Override
protected void agg(Data v,Data a,Data b){ v.v = gcd(a.v,b.v); }
@Override
protected Data e(){ return new Data(0); }
@Override
protected Data init(int i){ return new Data(abs(B[i] -B[i +1])); }
@Override
protected void map(Data v,Integer f){}
};
while (Q-- > 0) {
int h1 = in.idx();
int h2 = in.idx();
int w1 = in.idx();
int w2 = in.idx();
long a,b;
if (h2 -h1 == 0 && w2 -w1 == 0) {
out.println(A[h1] +B[w1]);
continue;
}
if (h2 -h1 == 0)
a = A[h1] +B[w1];
else
a = segA.get(h1,h2).v;
if (w2 -w1 == 0)
b = A[h1] +B[w1];
else
b = segB.get(w1,w2).v;
out.println(gcd(a,b));
}
return null;
}
long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
class PrefixSum{
private long[] sum;
private int i;
public PrefixSum(int n){ sum = new long[n +1]; }
public PrefixSum(long[] a){
this(a.length);
for (int i = 0;i < a.length;i++)
sum[i +1] = sum[i] +a[i];
}
public void add(long a){ sum[i +1] = sum[i++] +a; }
public long get(int l,int r){ return sum[r] -sum[l]; }
public long get(int i){ return get(i,i +1); }
}
class PersistentUnionFind{
int num;
protected PersistentArray dat,nxt;
public PersistentUnionFind(int n){
dat = new PersistentArray(n);
nxt = new PersistentArray(n);
for (int i = 0;i < n;i++) {
dat.set(i,-1,-1);
nxt.set(i,i,-1);
}
num = n;
}
public int root(int x,int t){
int d = dat.get(x,t);
return d < 0 ? x : dat.set(x,root(d,t),t);
}
public boolean same(int u,int v,int t){ return root(u,t) == root(v,t); }
public boolean unite(int u,int v,int t,int t2){
if ((u = root(u,t)) == (v = root(v,t)))
return false;
if (dat.get(u,t) > dat.get(v,t)) {
u ^= v;
v ^= u;
u ^= v;
}
dat.set(u,dat.get(u,t) +dat.get(v,t),t2);
dat.set(v,u,t2);
num--;
var nu = nxt.get(u,t);
var nv = nxt.get(v,t);
nxt.set(u,nv,t2);
nxt.set(v,nu,t2);
return true;
}
public int size(int x,int t){ return -dat.get(root(x,t),t); }
public int[] getGroup(int x,int t){
int[] ret = new int[size(x,t)];
for (int i = 0,c = root(x,t);i < ret.length;i++)
ret[i] = c = nxt.get(c,t);
return ret;
}
}
class PersistentArray{
private TreeMap<Integer, Integer>[] arr;
@SuppressWarnings("unchecked")
public PersistentArray(int n){
arr = new TreeMap[n];
setAll(arr,i -> new TreeMap<>());
}
public int get(int i,int t){ return arr[i].floorEntry(t).getValue(); }
public int set(int i,int v,int t){
arr[i].put(t,v);
return v;
}
}
abstract class AVLSegmentTree<V extends BaseV, F> {
private V e = e();
private Node root;
public AVLSegmentTree(int n){ root = new Node(e(),n); }
public AVLSegmentTree(){}
public void build(int n,IntFunction<V> init){ root = build(0,n,init); }
private Node build(int i,int n,IntFunction<V> init){
if (n < 2)
return n < 1 ? null : new Node(init.apply(i),1);
var ret = new Node(e(),n);
ret.cld(-1,build(i,n /2,init));
ret.cld(1,build(i +n /2,n -n /2,init));
return ret.merge();
}
public void add(V v){ add(v,1); }
public void add(V v,int k){ ins(size(),v,k); }
public void ins(int i,V v){ ins(i,v,1); }
public void ins(int i,V v,int k){ root = root == null ? new Node(v,k) : ins(root,i,v,k); }
private Node ins(Node nd,int i,V v,int k){
if (nd.leaf && (i == 0 || i == nd.sz)) {
split(nd,i == 0 ? 1 : -1,v,k,nd.sz +k);
return nd.merge();
}
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else
nd.push();
if (i < nd.lft.sz)
nd.cld(-1,ins(nd.lft,i,v,k));
else
nd.cld(1,ins(nd.rht,i -nd.lft.sz,v,k));
return balance(nd);
}
public V del(int i){
var ret = e();
root = del(ret,root,i);
return ret;
}
private Node del(V ret,Node nd,long i){
if (nd.leaf) {
nd.sz--;
ag(ret,e,nd.val);
return 0 < nd.sz ? nd : null;
}
nd.push();
int c = i < nd.lft.sz ? -1 : 1;
Node del = c < 0 ? del(ret,nd.lft,i) : del(ret,nd.rht,i -nd.lft.sz);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public void upd(int i,F f){ upd(i,i +1,f); }
public void upd(int l,int r,F f){
if (l == r)
return;
if (size() < r)
add(e(),r -size());
root = upd(root,l,r,f);
}
private Node upd(Node nd,int l,int r,F f){
if (l == 0 && r == nd.sz)
return nd.prop(f);
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),0 < l ? l : r,nd.sz);
else
nd.push();
if (l < nd.lft.sz)
nd.cld(-1,upd(nd.lft,l,min(nd.lft.sz,r),f));
if (nd.lft.sz < r)
nd.cld(1,upd(nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz,f));
return balance(nd);
}
public void toggle(int l,int r){ root = l < r ? toggle(root,l,r) : root; }
private Node toggle(Node nd,int l,int r){
nd.push();
if (l == 0 && r == nd.sz)
return nd.toggle();
else if (r < nd.sz) {
split(nd,r);
return merge(toggle(nd.lft,l,r),nd,nd.rht);
} else {
split(nd,l);
return merge(nd.lft,nd,toggle(nd.rht,0,r -l));
}
}
private void split(Node nd,int i){
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else {
nd.push();
if (i < nd.lft.sz) {
split(nd.lft,i);
var lft = nd.lft;
nd.cld(-1,lft.lft);
nd.cld(1,merge(lft.rht,lft,nd.rht));
} else if (nd.lft.sz < i) {
split(nd.rht,i -nd.lft.sz);
var rht = nd.rht;
nd.cld(1,rht.rht);
nd.cld(-1,merge(nd.lft,rht,rht.lft));
}
}
}
private Node merge(Node lft,Node nd,Node rht){
if (abs(lft.rnk -rht.rnk) < 2) {
nd.cld(-1,lft);
nd.cld(1,rht);
} else if (lft.rnk > rht.rnk) {
lft.push().cld(1,merge(lft.rht,nd,rht));
nd = lft;
} else if (lft.rnk < rht.rnk) {
rht.push().cld(-1,merge(lft,nd,rht.lft));
nd = rht;
}
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.leaf)
ag(ret,ret,pw(nd.val,r -l));
else {
nd.push();
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
V x = e();
for (ag(x,e,a);0 < n;n >>= 1,ag(x,x,x))
if (0 < (n &1))
ag(v,v,x);
}
private V pw(V a,int n){
var ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private void split(Node nd,int c,V vl,int i,int sz){
nd.cld(-c,new Node(vl,i));
nd.cld(c,new Node(nd.val,sz -i));
nd.val = e();
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis).push();
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int sz,rnk,bis,tog;
private V val;
private F laz;
private Node lft,rht;
private boolean leaf = true;
private Node(V val,int sz){
this.sz = sz;
this.val = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
sz = val.sz;
leaf = false;
return this;
}
private Node push(){
if (laz != null) {
lft.prop(laz);
rht.prop(laz);
laz = null;
}
if (0 < tog) {
lft.toggle();
rht.toggle();
tog = 0;
}
return this;
}
private Node prop(F f){
map(val,f);
if (!leaf)
laz = laz == null ? f : comp(laz,f);
return this;
}
private Node toggle(){
bis *= -1;
var tn = lft;
lft = rht;
rht = tn;
val.toggle();
if (!leaf)
tog ^= 1;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return leaf && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class Seg<V extends BaseV, F> {
private int n,log;
private V[] val;
private F[] lazy;
@SuppressWarnings("unchecked")
protected Seg(int n){
this.n = n;
while (1 <<log <= n)
log++;
val = (V[]) new BaseV[n <<1];
lazy = (F[]) new Object[n];
for (int i = -1;++i < n;)
(val[i +n] = init(i)).sz = 1;
for (int i = n;--i > 0;merge(i))
(val[i] = e()).sz = val[i <<1].sz +val[i <<1 |1].sz;
}
public void upd(int i,F f){ prop(i +n,f); }
public void upd(int l,int r,F f){
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
prop(l++,f);
if ((r &1) == 1)
prop(--r,f);
}
}
public V get(int i){ return val[i +n]; }
public V get(int l,int r){
V vl = e(),vr = e();
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
ag(vl,vl,val[l++]);
if ((r &1) == 1)
ag(vr,val[--r],vr);
}
ag(vl,vl,vr);
return vl;
}
public Deque<V> getList(int l,int r){
Deque<V> ql = new ArrayDeque<>();
Deque<V> qr = new ArrayDeque<>();
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
ql.addLast(val[l++]);
if ((r &1) == 1)
qr.addFirst(val[--r]);
}
ql.addAll(qr);
return ql;
}
protected abstract V e();
protected V init(int i){ return e(); }
protected void agg(V v,V a,V b){}
private void ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
}
protected abstract void map(V v,F f);
protected F comp(F f,F g){ return null; }
protected void up(int l,int r){
for (l = oddPart(l +n),r = oddPart(r +n);l != r;)
merge(l > r ? (l >>= 1) : (r >>= 1));
while (1 < l)
merge(l >>= 1);
}
protected void down(int l,int r){
int i = log;
for (l = oddPart(l +n),r = oddPart(r +n);i > 0;i--) {
push(l >>i);
push(r >>i);
}
}
private void merge(int i){ agg(val[i],val[i <<1],val[i <<1 |1]); }
private void push(int i){
if (lazy[i] != null) {
prop(i <<1,lazy[i]);
prop(i <<1 |1,lazy[i]);
lazy[i] = null;
}
}
private void prop(int i,F f){
map(val[i],f);
if (i < n) {
lazy[i] = lazy[i] == null ? f : comp(lazy[i],f);
if (val[i].fail) {
push(i);
merge(i);
}
}
}
private int oddPart(int i){ return i /(i &-i); }
}
abstract class SegmentTree<V extends BaseV, F> extends Seg<V, F>{
public SegmentTree(int n){ super(n); }
@Override
protected abstract void agg(V v,V a,V b);
@Override
public void upd(int i,F f){
super.upd(i,f);
up(i,i +1);
}
}
abstract class BaseV{
int sz;
boolean fail;
public void toggle(){}
}
class Functions extends Util{
public Functions(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
protected long inv(long x,long mod){ return pow(x,mod -2,mod); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1;
private long st = System.currentTimeMillis();
public static Random rd = ThreadLocalRandom.current();
public static long mod = 998244353;
public MyReader in;
public MyWriter out;
public MyWriter log;
public Util(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
import static java.lang.Math.*;
import static java.util.Arrays.*;
import java.io.*;
import java.lang.reflect.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
class Solver extends Functions{
public Solver(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
public static boolean multi = false;
Object solve(){
int N = in.it();
int Q = in.it();
int[] A = in.it(N);
int[] B = in.it(N);
SegmentTree<Data, Integer> segA = new SegmentTree<>(N -1){
@Override
protected void agg(Data v,Data a,Data b){ v.v = gcd(a.v,b.v); }
@Override
protected Data e(){ return new Data(0); }
@Override
protected Data init(int i){ return new Data(abs(A[i] -A[i +1])); }
@Override
protected void map(Data v,Integer f){}
};
SegmentTree<Data, Integer> segB = new SegmentTree<>(N -1){
@Override
protected void agg(Data v,Data a,Data b){ v.v = gcd(a.v,b.v); }
@Override
protected Data e(){ return new Data(0); }
@Override
protected Data init(int i){ return new Data(abs(B[i] -B[i +1])); }
@Override
protected void map(Data v,Integer f){}
};
while (Q-- > 0) {
int h1 = in.idx();
int h2 = in.idx();
int w1 = in.idx();
int w2 = in.idx();
long a,b;
if (h2 -h1 == 0 && w2 -w1 == 0) {
out.println(A[h1] +B[w1]);
continue;
}
if (h2 -h1 == 0)
a = A[h1] +B[w1];
else
a = segA.get(h1,h2).v;
if (w2 -w1 == 0)
b = A[h1] +B[w1];
else
b = segB.get(w1,w2).v;
out.println(gcd(A[h1] +B[w1],gcd(a,b)));
}
return null;
}
long gcd(long a,long b){
while (0 < b) {
long t = a;
a = b;
b = t %b;
}
return a;
}
}
class Data extends BaseV{
long v;
public Data(long v){ this.v = v; }
@Override
public String toString(){ return "" +v; }
}
class PrefixSum{
private long[] sum;
private int i;
public PrefixSum(int n){ sum = new long[n +1]; }
public PrefixSum(long[] a){
this(a.length);
for (int i = 0;i < a.length;i++)
sum[i +1] = sum[i] +a[i];
}
public void add(long a){ sum[i +1] = sum[i++] +a; }
public long get(int l,int r){ return sum[r] -sum[l]; }
public long get(int i){ return get(i,i +1); }
}
class PersistentUnionFind{
int num;
protected PersistentArray dat,nxt;
public PersistentUnionFind(int n){
dat = new PersistentArray(n);
nxt = new PersistentArray(n);
for (int i = 0;i < n;i++) {
dat.set(i,-1,-1);
nxt.set(i,i,-1);
}
num = n;
}
public int root(int x,int t){
int d = dat.get(x,t);
return d < 0 ? x : dat.set(x,root(d,t),t);
}
public boolean same(int u,int v,int t){ return root(u,t) == root(v,t); }
public boolean unite(int u,int v,int t,int t2){
if ((u = root(u,t)) == (v = root(v,t)))
return false;
if (dat.get(u,t) > dat.get(v,t)) {
u ^= v;
v ^= u;
u ^= v;
}
dat.set(u,dat.get(u,t) +dat.get(v,t),t2);
dat.set(v,u,t2);
num--;
var nu = nxt.get(u,t);
var nv = nxt.get(v,t);
nxt.set(u,nv,t2);
nxt.set(v,nu,t2);
return true;
}
public int size(int x,int t){ return -dat.get(root(x,t),t); }
public int[] getGroup(int x,int t){
int[] ret = new int[size(x,t)];
for (int i = 0,c = root(x,t);i < ret.length;i++)
ret[i] = c = nxt.get(c,t);
return ret;
}
}
class PersistentArray{
private TreeMap<Integer, Integer>[] arr;
@SuppressWarnings("unchecked")
public PersistentArray(int n){
arr = new TreeMap[n];
setAll(arr,i -> new TreeMap<>());
}
public int get(int i,int t){ return arr[i].floorEntry(t).getValue(); }
public int set(int i,int v,int t){
arr[i].put(t,v);
return v;
}
}
abstract class AVLSegmentTree<V extends BaseV, F> {
private V e = e();
private Node root;
public AVLSegmentTree(int n){ root = new Node(e(),n); }
public AVLSegmentTree(){}
public void build(int n,IntFunction<V> init){ root = build(0,n,init); }
private Node build(int i,int n,IntFunction<V> init){
if (n < 2)
return n < 1 ? null : new Node(init.apply(i),1);
var ret = new Node(e(),n);
ret.cld(-1,build(i,n /2,init));
ret.cld(1,build(i +n /2,n -n /2,init));
return ret.merge();
}
public void add(V v){ add(v,1); }
public void add(V v,int k){ ins(size(),v,k); }
public void ins(int i,V v){ ins(i,v,1); }
public void ins(int i,V v,int k){ root = root == null ? new Node(v,k) : ins(root,i,v,k); }
private Node ins(Node nd,int i,V v,int k){
if (nd.leaf && (i == 0 || i == nd.sz)) {
split(nd,i == 0 ? 1 : -1,v,k,nd.sz +k);
return nd.merge();
}
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else
nd.push();
if (i < nd.lft.sz)
nd.cld(-1,ins(nd.lft,i,v,k));
else
nd.cld(1,ins(nd.rht,i -nd.lft.sz,v,k));
return balance(nd);
}
public V del(int i){
var ret = e();
root = del(ret,root,i);
return ret;
}
private Node del(V ret,Node nd,long i){
if (nd.leaf) {
nd.sz--;
ag(ret,e,nd.val);
return 0 < nd.sz ? nd : null;
}
nd.push();
int c = i < nd.lft.sz ? -1 : 1;
Node del = c < 0 ? del(ret,nd.lft,i) : del(ret,nd.rht,i -nd.lft.sz);
if (del == null)
return nd.cld(-c);
nd.cld(c,del);
return balance(nd);
}
public void upd(int i,F f){ upd(i,i +1,f); }
public void upd(int l,int r,F f){
if (l == r)
return;
if (size() < r)
add(e(),r -size());
root = upd(root,l,r,f);
}
private Node upd(Node nd,int l,int r,F f){
if (l == 0 && r == nd.sz)
return nd.prop(f);
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),0 < l ? l : r,nd.sz);
else
nd.push();
if (l < nd.lft.sz)
nd.cld(-1,upd(nd.lft,l,min(nd.lft.sz,r),f));
if (nd.lft.sz < r)
nd.cld(1,upd(nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz,f));
return balance(nd);
}
public void toggle(int l,int r){ root = l < r ? toggle(root,l,r) : root; }
private Node toggle(Node nd,int l,int r){
nd.push();
if (l == 0 && r == nd.sz)
return nd.toggle();
else if (r < nd.sz) {
split(nd,r);
return merge(toggle(nd.lft,l,r),nd,nd.rht);
} else {
split(nd,l);
return merge(nd.lft,nd,toggle(nd.rht,0,r -l));
}
}
private void split(Node nd,int i){
if (nd.leaf)
split(nd,1,ag(e(),e,nd.val),i,nd.sz);
else {
nd.push();
if (i < nd.lft.sz) {
split(nd.lft,i);
var lft = nd.lft;
nd.cld(-1,lft.lft);
nd.cld(1,merge(lft.rht,lft,nd.rht));
} else if (nd.lft.sz < i) {
split(nd.rht,i -nd.lft.sz);
var rht = nd.rht;
nd.cld(1,rht.rht);
nd.cld(-1,merge(nd.lft,rht,rht.lft));
}
}
}
private Node merge(Node lft,Node nd,Node rht){
if (abs(lft.rnk -rht.rnk) < 2) {
nd.cld(-1,lft);
nd.cld(1,rht);
} else if (lft.rnk > rht.rnk) {
lft.push().cld(1,merge(lft.rht,nd,rht));
nd = lft;
} else if (lft.rnk < rht.rnk) {
rht.push().cld(-1,merge(lft,nd,rht.lft));
nd = rht;
}
return balance(nd);
}
public V get(int i){ return get(i,i +1); }
public V get(int l,int r){
V ret = e();
if (root != null)
get(ret,root,l,min(r,size()));
return ret;
}
private void get(V ret,Node nd,int l,int r){
if (l == 0 && r == nd.sz)
ag(ret,ret,nd.val());
else if (nd.leaf)
ag(ret,ret,pw(nd.val,r -l));
else {
nd.push();
if (l < nd.lft.sz)
get(ret,nd.lft,l,min(nd.lft.sz,r));
if (nd.lft.sz < r)
get(ret,nd.rht,max(0,l -nd.lft.sz),r -nd.lft.sz);
}
}
public V all(){ return root == null ? e : root.val(); }
public int size(){ return root == null ? 0 : root.sz; }
protected abstract V e();
protected abstract void agg(V v,V a,V b);
protected abstract void map(V v,F f);
protected abstract F comp(F f,F g);
private V ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
return v;
}
protected void pow(V v,V a,int n){
V x = e();
for (ag(x,e,a);0 < n;n >>= 1,ag(x,x,x))
if (0 < (n &1))
ag(v,v,x);
}
private V pw(V a,int n){
var ret = e();
pow(ret,a,n);
ret.sz = n;
return ret;
}
private void split(Node nd,int c,V vl,int i,int sz){
nd.cld(-c,new Node(vl,i));
nd.cld(c,new Node(nd.val,sz -i));
nd.val = e();
}
private Node balance(Node nd){ return (1 < abs(nd.bis = nd.rht.rnk -nd.lft.rnk) ? (nd = rotate(nd)) : nd).merge(); }
private Node rotate(Node u){
var v = u.cld(u.bis).push();
if (u.bis *v.bis < -1)
v = rotate(v);
u.cld(u.bis,v.cld(-u.bis));
v.cld(-u.bis,u);
u.merge();
return v;
}
private class Node{
private int sz,rnk,bis,tog;
private V val;
private F laz;
private Node lft,rht;
private boolean leaf = true;
private Node(V val,int sz){
this.sz = sz;
this.val = val;
val.sz = 1;
}
private Node merge(){
bis = rht.rnk -lft.rnk;
rnk = max(lft.rnk,rht.rnk) +1;
ag(val,lft.val(),rht.val());
sz = val.sz;
leaf = false;
return this;
}
private Node push(){
if (laz != null) {
lft.prop(laz);
rht.prop(laz);
laz = null;
}
if (0 < tog) {
lft.toggle();
rht.toggle();
tog = 0;
}
return this;
}
private Node prop(F f){
map(val,f);
if (!leaf)
laz = laz == null ? f : comp(laz,f);
return this;
}
private Node toggle(){
bis *= -1;
var tn = lft;
lft = rht;
rht = tn;
val.toggle();
if (!leaf)
tog ^= 1;
return this;
}
private Node cld(int c){ return c < 0 ? lft : rht; }
private void cld(int c,Node nd){ nd = c < 0 ? (lft = nd) : (rht = nd); }
private V val(){ return leaf && 1 < sz ? pw(val,sz) : val; }
}
}
abstract class Seg<V extends BaseV, F> {
private int n,log;
private V[] val;
private F[] lazy;
@SuppressWarnings("unchecked")
protected Seg(int n){
this.n = n;
while (1 <<log <= n)
log++;
val = (V[]) new BaseV[n <<1];
lazy = (F[]) new Object[n];
for (int i = -1;++i < n;)
(val[i +n] = init(i)).sz = 1;
for (int i = n;--i > 0;merge(i))
(val[i] = e()).sz = val[i <<1].sz +val[i <<1 |1].sz;
}
public void upd(int i,F f){ prop(i +n,f); }
public void upd(int l,int r,F f){
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
prop(l++,f);
if ((r &1) == 1)
prop(--r,f);
}
}
public V get(int i){ return val[i +n]; }
public V get(int l,int r){
V vl = e(),vr = e();
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
ag(vl,vl,val[l++]);
if ((r &1) == 1)
ag(vr,val[--r],vr);
}
ag(vl,vl,vr);
return vl;
}
public Deque<V> getList(int l,int r){
Deque<V> ql = new ArrayDeque<>();
Deque<V> qr = new ArrayDeque<>();
for (l += n,r += n;l < r;l >>= 1,r >>= 1) {
if ((l &1) == 1)
ql.addLast(val[l++]);
if ((r &1) == 1)
qr.addFirst(val[--r]);
}
ql.addAll(qr);
return ql;
}
protected abstract V e();
protected V init(int i){ return e(); }
protected void agg(V v,V a,V b){}
private void ag(V v,V a,V b){
agg(v,a,b);
v.sz = a.sz +b.sz;
}
protected abstract void map(V v,F f);
protected F comp(F f,F g){ return null; }
protected void up(int l,int r){
for (l = oddPart(l +n),r = oddPart(r +n);l != r;)
merge(l > r ? (l >>= 1) : (r >>= 1));
while (1 < l)
merge(l >>= 1);
}
protected void down(int l,int r){
int i = log;
for (l = oddPart(l +n),r = oddPart(r +n);i > 0;i--) {
push(l >>i);
push(r >>i);
}
}
private void merge(int i){ agg(val[i],val[i <<1],val[i <<1 |1]); }
private void push(int i){
if (lazy[i] != null) {
prop(i <<1,lazy[i]);
prop(i <<1 |1,lazy[i]);
lazy[i] = null;
}
}
private void prop(int i,F f){
map(val[i],f);
if (i < n) {
lazy[i] = lazy[i] == null ? f : comp(lazy[i],f);
if (val[i].fail) {
push(i);
merge(i);
}
}
}
private int oddPart(int i){ return i /(i &-i); }
}
abstract class SegmentTree<V extends BaseV, F> extends Seg<V, F>{
public SegmentTree(int n){ super(n); }
@Override
protected abstract void agg(V v,V a,V b);
@Override
public void upd(int i,F f){
super.upd(i,f);
up(i,i +1);
}
}
abstract class BaseV{
int sz;
boolean fail;
public void toggle(){}
}
class Functions extends Util{
public Functions(MyReader in,MyWriter out,MyWriter log){ super(in,out,log); }
protected long inv(long x,long mod){ return pow(x,mod -2,mod); }
protected long pow(long x,long n){ return pow(x,n,Util.mod); }
protected long pow(long x,long n,long mod){
long ret = 1;
for (x %= mod;0 < n;x = x *x %mod,n >>= 1)
if ((n &1) == 1)
ret = ret *x %mod;
return ret;
}
protected int bSearchI(int o,int n,IntPredicate judge){
if (!judge.test(o))
return o -Integer.signum(n -o);
for (int m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected long bSearchL(long o,long n,LongPredicate judge){
for (long m = 0;1 < abs(n -o);)
m = judge.test(m = o +n >>1) ? (o = m) : (n = m);
return o;
}
protected double bSearchD(double o,double n,DoublePredicate judge){
for (double m,c = 0;c < 100;c++)
m = judge.test(m = (o +n) /2) ? (o = m) : (n = m);
return o;
}
protected long ceil(long a,long b){ return (a +b -1) /b; }
}
class Util{
public static String yes = "Yes",no = "No";
public static int infI = (1 <<30) -1;
public static long infL = (1L <<60 |1 <<30) -1;
private long st = System.currentTimeMillis();
public static Random rd = ThreadLocalRandom.current();
public static long mod = 998244353;
public MyReader in;
public MyWriter out;
public MyWriter log;
public Util(MyReader in,MyWriter out,MyWriter log){
this.in = in;
this.out = out;
this.log = log;
}
protected long elapsed(){ return System.currentTimeMillis() -st; }
protected void reset(){ st = System.currentTimeMillis(); }
public static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
public static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
public static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
public static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
int[][] addId(int[][] T){
return Util.arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
}
class MyReader{
private byte[] buf = new byte[1 <<16];
private int ptr,tail;
private InputStream in;
public MyReader(InputStream in){ this.in = in; }
private byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
private boolean isPrintable(byte c){ return 32 < c && c < 127; }
private byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
public int it(){ return toIntExact(lg()); }
public int[] it(int N){ return Util.arrI(N,i -> it()); }
public int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
public int idx(){ return it() -1; }
public int[] idx(int N){ return Util.arrI(N,i -> idx()); }
public int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
public long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
public long[] lg(int N){ return Util.arrL(N,i -> lg()); }
public long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
public double dbl(){ return Double.parseDouble(str()); }
public double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
public double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
public char[] ch(){ return str().toCharArray(); }
public char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
public String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
public String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
public String[] str(int N){ return Util.arr(new String[N],i -> str()); }
}
class MyWriter{
private OutputStream out;
private byte[] buf = new byte[1 <<16],ibuf = new byte[20];
private int tail;
private boolean autoflush;
public MyWriter(OutputStream out,boolean autoflush){
this.out = out;
this.autoflush = autoflush;
}
public void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
private void ln(){
write((byte) '\n');
if (autoflush)
flush();
}
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
while (i < ibuf.length)
write(ibuf[i++]);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Util.yes : Util.no);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else
print(Objects.toString(obj).toCharArray());
}
public void println(Object obj){
if (obj == null)
obj = "null";
if (obj instanceof Iterable<?>)
for (Object e:(Iterable<?>) obj)
println(e);
else if (obj.getClass().isArray() && Array.getLength(obj) > 0 && Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
public void printlns(Object... o){
print(o);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
var in = new MyReader(System.in);
var out = new MyWriter(System.out,false);
var log = new MyWriter(System.err,true);
int T = Solver.multi ? in.it() : 1;
while (T-- > 0)
Optional.ofNullable(new Solver(in,out,log)
.solve()).ifPresent(out::println);
out.flush();
}
}
| ConDefects/ConDefects/Code/abc254_f/Java/50135667 |
condefects-java_data_298 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long h = 0;
long max = 0;
long hold1 = 0;
long hold2 = 0;
//int hold3 = 0;
long N = sc.nextInt();
for (int i = 1; i <= N; i++) {
hold1 = sc.nextInt();
hold2 = sc.nextInt();
h += hold1;
System.out.println(h);
if (max < hold2-hold1) {
max = hold2-hold1;
}
}
h+=max;
System.out.println(h);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long h = 0;
long max = 0;
long hold1 = 0;
long hold2 = 0;
//int hold3 = 0;
long N = sc.nextInt();
for (int i = 1; i <= N; i++) {
hold1 = sc.nextInt();
hold2 = sc.nextInt();
h += hold1;
//System.out.println(h);
if (max < hold2-hold1) {
max = hold2-hold1;
}
}
h+=max;
System.out.println(h);
}
}
| ConDefects/ConDefects/Code/abc352_c/Java/53734791 |
condefects-java_data_299 | //package atcoder.abc233;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static InputReader in;
static PrintWriter out;
public static void main(String[] args) {
//initReaderPrinter(true);
initReaderPrinter(false);
//solve(in.nextInt());
solve(1);
}
/*
General tips
1. It is ok to fail, but it is not ok to fail for the same mistakes over and over!
2. Train smarter, not harder!
3. If you find an answer and want to return immediately, don't forget to flush before return!
*/
/*
Read before practice
1. Set a timer based on a problem's difficulty level: 45 minutes at your current target practice level;
2. During a problem solving session, focus! Do not switch problems or even worse switch to do something else;
3. If fail to solve within timer limit, read editorials to get as little help as possible to get yourself unblocked;
4. If after reading the entire editorial and other people's code but still can not solve, move this problem to to-do list
and re-try in the future.
5. Keep a practice log about new thinking approaches, good tricks, bugs; Review regularly;
6. Also try this new approach suggested by um_nik: Solve with no intention to read editorial.
If getting stuck, skip it and solve other similar level problems.
Wait for 1 week then try to solve again. Only read editorial after you solved a problem.
7. Remember to also submit in the original problem link (if using gym) so that the 1 v 1 bot knows which problems I have solved already.
8. Form the habit of writing down an implementable solution idea before coding! You've taken enough hits during contests because you
rushed to coding!
*/
/*
Read before contests and lockout 1 v 1
Mistakes you've made in the past contests:
1. Tried to solve without going through given test examples -> wasting time on solving a different problem than asked;
2. Rushed to coding without getting a comprehensive sketch of your solution -> implementation bugs and WA; Write down your idea step
by step, no need to rush. It is always better to have all the steps considered before hand! Think about all the past contests that
you have failed because slow implementation and implementation bugs! This will be greatly reduced if you take your time to get a
thorough idea steps!
3. Forgot about possible integer overflow;
When stuck:
1. Understand problem statements? Walked through test examples?
2. Take a step back and think about other approaches?
3. Check rank board to see if you can skip to work on a possibly easier problem?
4. If none of the above works, take a guess?
*/
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
char[] x = in.next().toCharArray();
int[] ps = new int[x.length];
ps[0] = x[0] - '0';
for(int i = 1; i < ps.length; i++) {
ps[i] = ps[i - 1] + (x[i] - '0');
}
List<Integer> ans = new ArrayList<>();
int len = min(100, x.length), carry = 0;
for(int i = x.length - 1; i >= 0; i--) {
//if(len > 0) {
int sum = ps[i] - (i >= len ? ps[i - len] : 0) + carry;
carry = sum / 10;
ans.add(sum % 10);
//}
// else {
// int sum = x[i] - '0' + carry;
// carry = sum / 10;
// ans.add(sum % 10);
// }
}
if(carry > 0) {
ans.add(carry);
}
for(int i = ans.size() - 1; i >= 0; i--) {
out.print(ans.get(i));
}
out.println();
}
out.close();
}
static long addWithMod(long x, long y, long mod) {
return (x + y) % mod;
}
static long subtractWithMod(long x, long y, long mod) {
return ((x - y) % mod + mod) % mod;
}
static long multiplyWithMod(long x, long y, long mod) {
return x * y % mod;
}
static long modInv(long x, long mod) {
return fastPowMod(x, mod - 2, mod);
}
static long fastPowMod(long x, long n, long mod) {
if (n == 0) {
return 1;
}
long half = fastPowMod(x, n / 2, mod);
if (n % 2 == 0) {
return half * half % mod;
}
return half * half % mod * x % mod;
}
static void initReaderPrinter(boolean test) {
if (test) {
try {
in = new InputReader(new FileInputStream("src/input.in"));
out = new PrintWriter(new FileOutputStream("src/output.out"));
} catch (IOException e) {
e.printStackTrace();
}
} else {
in = new InputReader(System.in);
out = new PrintWriter(System.out);
}
}
static class InputReader {
BufferedReader br;
StringTokenizer st;
InputReader(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream), 32768);
} catch (Exception e) {
e.printStackTrace();
}
}
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());
}
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;
}
Integer[] nextIntArray(int n) {
Integer[] a = new Integer[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArrayPrimitive(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArrayPrimitiveOneIndexed(int n) {
int[] a = new int[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = nextInt();
}
return a;
}
Long[] nextLongArray(int n) {
Long[] a = new Long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArrayPrimitive(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArrayPrimitiveOneIndexed(int n) {
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = nextLong();
}
return a;
}
String[] nextStringArray(int n) {
String[] g = new String[n];
for (int i = 0; i < n; i++) {
g[i] = next();
}
return g;
}
List<Integer>[] readUnWeightedGraphOneIndexed(int n, int m) {
List<Integer>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphOneIndexed(int n, int m) {
List<int[]>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
List<Integer>[] readUnWeightedGraphZeroIndexed(int n, int m) {
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphZeroIndexed(int n, int m) {
List<int[]>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
/*
A more efficient way of building an undirected graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildUndirectedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building an undirected weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildUndirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]][0] = end2[i];
adj[end1[i]][idxForEachNode[end1[i]]][1] = weight[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]][0] = end1[i];
adj[end2[i]][idxForEachNode[end2[i]]][1] = weight[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildDirectedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]] = to[i];
idxForEachNode[from[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildDirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]][0] = to[i];
adj[from[i]][idxForEachNode[from[i]]][1] = weight[i];
idxForEachNode[from[i]]++;
}
return adj;
}
}
}
//package atcoder.abc233;
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static InputReader in;
static PrintWriter out;
public static void main(String[] args) {
//initReaderPrinter(true);
initReaderPrinter(false);
//solve(in.nextInt());
solve(1);
}
/*
General tips
1. It is ok to fail, but it is not ok to fail for the same mistakes over and over!
2. Train smarter, not harder!
3. If you find an answer and want to return immediately, don't forget to flush before return!
*/
/*
Read before practice
1. Set a timer based on a problem's difficulty level: 45 minutes at your current target practice level;
2. During a problem solving session, focus! Do not switch problems or even worse switch to do something else;
3. If fail to solve within timer limit, read editorials to get as little help as possible to get yourself unblocked;
4. If after reading the entire editorial and other people's code but still can not solve, move this problem to to-do list
and re-try in the future.
5. Keep a practice log about new thinking approaches, good tricks, bugs; Review regularly;
6. Also try this new approach suggested by um_nik: Solve with no intention to read editorial.
If getting stuck, skip it and solve other similar level problems.
Wait for 1 week then try to solve again. Only read editorial after you solved a problem.
7. Remember to also submit in the original problem link (if using gym) so that the 1 v 1 bot knows which problems I have solved already.
8. Form the habit of writing down an implementable solution idea before coding! You've taken enough hits during contests because you
rushed to coding!
*/
/*
Read before contests and lockout 1 v 1
Mistakes you've made in the past contests:
1. Tried to solve without going through given test examples -> wasting time on solving a different problem than asked;
2. Rushed to coding without getting a comprehensive sketch of your solution -> implementation bugs and WA; Write down your idea step
by step, no need to rush. It is always better to have all the steps considered before hand! Think about all the past contests that
you have failed because slow implementation and implementation bugs! This will be greatly reduced if you take your time to get a
thorough idea steps!
3. Forgot about possible integer overflow;
When stuck:
1. Understand problem statements? Walked through test examples?
2. Take a step back and think about other approaches?
3. Check rank board to see if you can skip to work on a possibly easier problem?
4. If none of the above works, take a guess?
*/
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
char[] x = in.next().toCharArray();
int[] ps = new int[x.length];
ps[0] = x[0] - '0';
for(int i = 1; i < ps.length; i++) {
ps[i] = ps[i - 1] + (x[i] - '0');
}
List<Integer> ans = new ArrayList<>();
int len = x.length, carry = 0;
for(int i = x.length - 1; i >= 0; i--) {
//if(len > 0) {
int sum = ps[i] - (i >= len ? ps[i - len] : 0) + carry;
carry = sum / 10;
ans.add(sum % 10);
//}
// else {
// int sum = x[i] - '0' + carry;
// carry = sum / 10;
// ans.add(sum % 10);
// }
}
if(carry > 0) {
ans.add(carry);
}
for(int i = ans.size() - 1; i >= 0; i--) {
out.print(ans.get(i));
}
out.println();
}
out.close();
}
static long addWithMod(long x, long y, long mod) {
return (x + y) % mod;
}
static long subtractWithMod(long x, long y, long mod) {
return ((x - y) % mod + mod) % mod;
}
static long multiplyWithMod(long x, long y, long mod) {
return x * y % mod;
}
static long modInv(long x, long mod) {
return fastPowMod(x, mod - 2, mod);
}
static long fastPowMod(long x, long n, long mod) {
if (n == 0) {
return 1;
}
long half = fastPowMod(x, n / 2, mod);
if (n % 2 == 0) {
return half * half % mod;
}
return half * half % mod * x % mod;
}
static void initReaderPrinter(boolean test) {
if (test) {
try {
in = new InputReader(new FileInputStream("src/input.in"));
out = new PrintWriter(new FileOutputStream("src/output.out"));
} catch (IOException e) {
e.printStackTrace();
}
} else {
in = new InputReader(System.in);
out = new PrintWriter(System.out);
}
}
static class InputReader {
BufferedReader br;
StringTokenizer st;
InputReader(InputStream stream) {
try {
br = new BufferedReader(new InputStreamReader(stream), 32768);
} catch (Exception e) {
e.printStackTrace();
}
}
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());
}
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;
}
Integer[] nextIntArray(int n) {
Integer[] a = new Integer[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArrayPrimitive(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArrayPrimitiveOneIndexed(int n) {
int[] a = new int[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = nextInt();
}
return a;
}
Long[] nextLongArray(int n) {
Long[] a = new Long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArrayPrimitive(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArrayPrimitiveOneIndexed(int n) {
long[] a = new long[n + 1];
for (int i = 1; i <= n; i++) {
a[i] = nextLong();
}
return a;
}
String[] nextStringArray(int n) {
String[] g = new String[n];
for (int i = 0; i < n; i++) {
g[i] = next();
}
return g;
}
List<Integer>[] readUnWeightedGraphOneIndexed(int n, int m) {
List<Integer>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphOneIndexed(int n, int m) {
List<int[]>[] adj = new List[n + 1];
for (int i = 0; i <= n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt();
int v = nextInt();
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
List<Integer>[] readUnWeightedGraphZeroIndexed(int n, int m) {
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
adj[u].add(v);
adj[v].add(u);
}
return adj;
}
List<int[]>[] readWeightedGraphZeroIndexed(int n, int m) {
List<int[]>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
int w = in.nextInt();
adj[u].add(new int[]{v, w});
adj[v].add(new int[]{u, w});
}
return adj;
}
/*
A more efficient way of building an undirected graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildUndirectedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]] = end2[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]] = end1[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building an undirected weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildUndirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] end1 = new int[edgeCnt], end2 = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
edgeCntForEachNode[v]++;
end1[i] = u;
end2[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[end1[i]][idxForEachNode[end1[i]]][0] = end2[i];
adj[end1[i]][idxForEachNode[end1[i]]][1] = weight[i];
idxForEachNode[end1[i]]++;
adj[end2[i]][idxForEachNode[end2[i]]][0] = end1[i];
adj[end2[i]][idxForEachNode[end2[i]]][1] = weight[i];
idxForEachNode[end2[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][] buildDirectedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
}
int[][] adj = new int[nodeCnt + 1][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]] = to[i];
idxForEachNode[from[i]]++;
}
return adj;
}
/*
A more efficient way of building a directed weighted graph using int[] instead of ArrayList to store each node's neighboring nodes.
1-indexed.
*/
int[][][] buildDirectedWeightedGraph(int nodeCnt, int edgeCnt) {
int[] from = new int[edgeCnt], to = new int[edgeCnt], weight = new int[edgeCnt];
int[] edgeCntForEachNode = new int[nodeCnt + 1], idxForEachNode = new int[nodeCnt + 1];
//from u to v: u -> v
for (int i = 0; i < edgeCnt; i++) {
int u = in.nextInt(), v = in.nextInt(), w = in.nextInt();
edgeCntForEachNode[u]++;
from[i] = u;
to[i] = v;
weight[i] = w;
}
int[][][] adj = new int[nodeCnt + 1][][];
for (int i = 1; i <= nodeCnt; i++) {
adj[i] = new int[edgeCntForEachNode[i]][2];
}
for (int i = 0; i < edgeCnt; i++) {
adj[from[i]][idxForEachNode[from[i]]][0] = to[i];
adj[from[i]][idxForEachNode[from[i]]][1] = weight[i];
idxForEachNode[from[i]]++;
}
return adj;
}
}
} | ConDefects/ConDefects/Code/abc233_e/Java/40171418 |
condefects-java_data_300 | import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Map;
import java.util.HashMap;
import java.util.Collections;
import java.util.Set;
import java.util.TreeSet;
class Main{
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
ArrayList<String> list = new ArrayList<>();
list = lib.inputProcess();
int N = Integer.parseInt(lib.arrayString(list.get(0), " ")[0]);
int X = Integer.parseInt(lib.arrayString(list.get(0), " ")[1]);
int Y = Integer.parseInt(lib.arrayString(list.get(0), " ")[2]);
int Z = Integer.parseInt(lib.arrayString(list.get(0), " ")[3]);
int[] a = lib.StringToIntArray(lib.arrayString(list.get(1), " "));
int[] b = lib.StringToIntArray(lib.arrayString(list.get(2), " "));
int cntx = 1, cnty = 1, cntz = 1;
Set<Integer> pass = new TreeSet<>();
//操作1
Map<Integer, Integer> math = new HashMap<>();
for( int i = 0 ; i < N ; i++){
math.put(i+1, a[i]);
}
List<Map.Entry<Integer,Integer>> mathValuesList = new ArrayList<Map.Entry<Integer, Integer>>(math.entrySet());
Collections.sort(mathValuesList, comparator);
for( Map.Entry<Integer,Integer> v : mathValuesList){
if( cntx > X) break;
pass.add(v.getKey());
cntx++;
}
//操作2
Map<Integer, Integer> english = new HashMap<>();
for( int i = 0 ; i < N ; i++){
if( !pass.contains(i+1)){
english.put(i+1, b[i]);
}
}
List<Map.Entry<Integer,Integer>> englishValuesList = new ArrayList<Map.Entry<Integer, Integer>>(english.entrySet());
Collections.sort(englishValuesList, comparator);
out.println(englishValuesList.toString());
out.flush();
for( Map.Entry<Integer,Integer> v : englishValuesList){
if( cnty > Y) break;
pass.add(v.getKey());
cnty++;
}
//操作3
Map<Integer, Integer> total = new HashMap<>();
for( int i = 0 ; i < N ; i++){
if( !pass.contains(i+1)){
total.put(i+1, a[i]+b[i]);
}
}
List<Map.Entry<Integer,Integer>> totalValuesList = new ArrayList<Map.Entry<Integer, Integer>>(total.entrySet());
Collections.sort(totalValuesList, comparator);
for( Map.Entry<Integer,Integer> v : totalValuesList){
if( cntz > Z) break;
pass.add(v.getKey());
cntz++;
}
//回答出力
for( int ans : pass){
out.println(ans);
out.flush();
}
}
static Comparator<Map.Entry<Integer,Integer>> comparator = new Comparator<Map.Entry<Integer,Integer>>(){
public int compare( Map.Entry<Integer,Integer> entry1, Map.Entry<Integer,Integer> entry2 ){
if( entry2.getValue().compareTo(entry1.getValue()) == 0){
return (entry1.getKey()).compareTo(entry2.getKey());
}else{
return (entry2.getValue().compareTo(entry1.getValue()));
}
}
};
}
class lib{
public static void outputData(List<String> list){
for( String str: list){
System.out.println(str);
}
}
public static ArrayList<String> inputProcess(){
InputStreamReader input = new InputStreamReader(System.in);
BufferedReader buff = new BufferedReader(input);
ArrayList<String> list = new ArrayList<>();
try {
while( true ){
String str = buff.readLine();
if( str == null) break;
list.add(str);
}
buff.close();
} catch (IOException e) {
System.out.println(e.getMessage());
}
return list;
}
public static int[] changeIntArray(ArrayList<String> list){
final int N = list.size();
int[] array = new int[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Integer.parseInt( list.get(i));
}
return array;
}
public static double[] changeDoubleArray(ArrayList<String> list){
final int N = list.size();
double[] array = new double[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Double.parseDouble( list.get(i));
}
return array;
}
public static String createString(ArrayList<String> list){
final int N = list.size();
StringBuilder stb = new StringBuilder();
for( int i = 0 ; i < N ; i++ ){
stb.append( list.get(i));
}
return stb.toString();
}
public static String[] arrayString(String str, String s){
String[] array = str.split(s);
return array;
}
public static int[] StringToIntArray(String[] str){
int N = str.length;
int[] array = new int[N];
for( int i = 0 ; i < N ; i++){
array[i] = Integer.parseInt(str[i]);
}
return array;
}
}
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Map;
import java.util.HashMap;
import java.util.Collections;
import java.util.Set;
import java.util.TreeSet;
class Main{
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
ArrayList<String> list = new ArrayList<>();
list = lib.inputProcess();
int N = Integer.parseInt(lib.arrayString(list.get(0), " ")[0]);
int X = Integer.parseInt(lib.arrayString(list.get(0), " ")[1]);
int Y = Integer.parseInt(lib.arrayString(list.get(0), " ")[2]);
int Z = Integer.parseInt(lib.arrayString(list.get(0), " ")[3]);
int[] a = lib.StringToIntArray(lib.arrayString(list.get(1), " "));
int[] b = lib.StringToIntArray(lib.arrayString(list.get(2), " "));
int cntx = 1, cnty = 1, cntz = 1;
Set<Integer> pass = new TreeSet<>();
//操作1
Map<Integer, Integer> math = new HashMap<>();
for( int i = 0 ; i < N ; i++){
math.put(i+1, a[i]);
}
List<Map.Entry<Integer,Integer>> mathValuesList = new ArrayList<Map.Entry<Integer, Integer>>(math.entrySet());
Collections.sort(mathValuesList, comparator);
for( Map.Entry<Integer,Integer> v : mathValuesList){
if( cntx > X) break;
pass.add(v.getKey());
cntx++;
}
//操作2
Map<Integer, Integer> english = new HashMap<>();
for( int i = 0 ; i < N ; i++){
if( !pass.contains(i+1)){
english.put(i+1, b[i]);
}
}
List<Map.Entry<Integer,Integer>> englishValuesList = new ArrayList<Map.Entry<Integer, Integer>>(english.entrySet());
Collections.sort(englishValuesList, comparator);
for( Map.Entry<Integer,Integer> v : englishValuesList){
if( cnty > Y) break;
pass.add(v.getKey());
cnty++;
}
//操作3
Map<Integer, Integer> total = new HashMap<>();
for( int i = 0 ; i < N ; i++){
if( !pass.contains(i+1)){
total.put(i+1, a[i]+b[i]);
}
}
List<Map.Entry<Integer,Integer>> totalValuesList = new ArrayList<Map.Entry<Integer, Integer>>(total.entrySet());
Collections.sort(totalValuesList, comparator);
for( Map.Entry<Integer,Integer> v : totalValuesList){
if( cntz > Z) break;
pass.add(v.getKey());
cntz++;
}
//回答出力
for( int ans : pass){
out.println(ans);
out.flush();
}
}
static Comparator<Map.Entry<Integer,Integer>> comparator = new Comparator<Map.Entry<Integer,Integer>>(){
public int compare( Map.Entry<Integer,Integer> entry1, Map.Entry<Integer,Integer> entry2 ){
if( entry2.getValue().compareTo(entry1.getValue()) == 0){
return (entry1.getKey()).compareTo(entry2.getKey());
}else{
return (entry2.getValue().compareTo(entry1.getValue()));
}
}
};
}
class lib{
public static void outputData(List<String> list){
for( String str: list){
System.out.println(str);
}
}
public static ArrayList<String> inputProcess(){
InputStreamReader input = new InputStreamReader(System.in);
BufferedReader buff = new BufferedReader(input);
ArrayList<String> list = new ArrayList<>();
try {
while( true ){
String str = buff.readLine();
if( str == null) break;
list.add(str);
}
buff.close();
} catch (IOException e) {
System.out.println(e.getMessage());
}
return list;
}
public static int[] changeIntArray(ArrayList<String> list){
final int N = list.size();
int[] array = new int[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Integer.parseInt( list.get(i));
}
return array;
}
public static double[] changeDoubleArray(ArrayList<String> list){
final int N = list.size();
double[] array = new double[N];
for( int i = 0 ; i < N ; i++ ){
array[i] = Double.parseDouble( list.get(i));
}
return array;
}
public static String createString(ArrayList<String> list){
final int N = list.size();
StringBuilder stb = new StringBuilder();
for( int i = 0 ; i < N ; i++ ){
stb.append( list.get(i));
}
return stb.toString();
}
public static String[] arrayString(String str, String s){
String[] array = str.split(s);
return array;
}
public static int[] StringToIntArray(String[] str){
int N = str.length;
int[] array = new int[N];
for( int i = 0 ; i < N ; i++){
array[i] = Integer.parseInt(str[i]);
}
return array;
}
}
| ConDefects/ConDefects/Code/abc260_b/Java/48056910 |