id
stringlengths 22
25
| content
stringlengths 327
628k
| max_stars_repo_path
stringlengths 49
49
|
|---|---|---|
condefects-java_data_1701
|
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();
long[] ret = new long[n + 1];
long time = 1;
PriorityQueue<Person> row = new PriorityQueue<>((a, b) -> {
return a.id - b.id;
});
PriorityQueue<Person> out = new PriorityQueue<>((a, b) -> {
if (a.time == b.time) {
return 0;
} else if (a.time < b.time) {
return -1;
}
return 1;
});
for (int i = 0; i < n; ++i) {
out.offer(new Person(i, 1));
}
int [][] q = new int [m][3];
for (int i = 0; i < m ; ++i) {
q[i][0] = sc.nextInt();
q[i][1] = sc.nextInt();
q[i][2] = sc.nextInt();
}
Arrays.sort(q, (a, b) -> {
return a[0] - b[0];
});
for (int i = 0; i < m; ++i) {
int t = q[i][0];
int w = q[i][1];
int s = q[i][2];
while (!out.isEmpty() && t >= out.peek().time) {
row.offer(out.poll());
}
if (!row.isEmpty()) {
Person p = row.poll();
int id = p.id;
ret[id] += w;
p.time += s;
out.offer(p);
}
}
for (int i = 0; i < n; ++i) {
System.out.println(ret[i]);
}
}
static class Person {
int id;
long time;
Person(int id, long time) {
this.id = id;
this.time = time;
}
}
}
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();
long[] ret = new long[n + 1];
long time = 1;
PriorityQueue<Person> row = new PriorityQueue<>((a, b) -> {
return a.id - b.id;
});
PriorityQueue<Person> out = new PriorityQueue<>((a, b) -> {
if (a.time == b.time) {
return 0;
} else if (a.time < b.time) {
return -1;
}
return 1;
});
for (int i = 0; i < n; ++i) {
out.offer(new Person(i, 1));
}
int [][] q = new int [m][3];
for (int i = 0; i < m ; ++i) {
q[i][0] = sc.nextInt();
q[i][1] = sc.nextInt();
q[i][2] = sc.nextInt();
}
Arrays.sort(q, (a, b) -> {
return a[0] - b[0];
});
for (int i = 0; i < m; ++i) {
int t = q[i][0];
int w = q[i][1];
int s = q[i][2];
while (!out.isEmpty() && t >= out.peek().time) {
row.offer(out.poll());
}
if (!row.isEmpty()) {
Person p = row.poll();
int id = p.id;
ret[id] += w;
p.time = t + s;
out.offer(p);
}
}
for (int i = 0; i < n; ++i) {
System.out.println(ret[i]);
}
}
static class Person {
int id;
long time;
Person(int id, long time) {
this.id = id;
this.time = time;
}
}
}
|
ConDefects/ConDefects/Code/abc320_e/Java/45740941
|
condefects-java_data_1702
|
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
PriorityQueue<Pair> events = new PriorityQueue<Pair>((l, r) -> Integer.compare(l.first, r.second));
PriorityQueue<Integer> que = new PriorityQueue<Integer>();
for(int i = 0; i < n; i++) que.add(i);
long[] ans = new long[n];
for(int i = 0; i < m; i++) {
int t = Integer.parseInt(sc.next());
int w = Integer.parseInt(sc.next());
int s = Integer.parseInt(sc.next());
while(!events.isEmpty() && events.peek().first <= t) {
que.add(events.poll().second);
}
if(que.isEmpty()) continue;
int index = que.poll();
ans[index] += w;
events.add(new Pair(t + s, index));
}
StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; i++) sb.append(ans[i] + "\n");
System.out.println(sb.toString());
}
}
}
class Pair{
int first;
int second;
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
}
import java.util.PriorityQueue;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
PriorityQueue<Pair> events = new PriorityQueue<Pair>((l, r) -> Integer.compare(l.first, r.first));
PriorityQueue<Integer> que = new PriorityQueue<Integer>();
for(int i = 0; i < n; i++) que.add(i);
long[] ans = new long[n];
for(int i = 0; i < m; i++) {
int t = Integer.parseInt(sc.next());
int w = Integer.parseInt(sc.next());
int s = Integer.parseInt(sc.next());
while(!events.isEmpty() && events.peek().first <= t) {
que.add(events.poll().second);
}
if(que.isEmpty()) continue;
int index = que.poll();
ans[index] += w;
events.add(new Pair(t + s, index));
}
StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; i++) sb.append(ans[i] + "\n");
System.out.println(sb.toString());
}
}
}
class Pair{
int first;
int second;
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
}
|
ConDefects/ConDefects/Code/abc320_e/Java/45780225
|
condefects-java_data_1703
|
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Hello
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String s = in.next();
List<Integer> list = new ArrayList<>();
for(int i = 1; i < n - 1; i++){
if(s.charAt(i) == 'R'){
int l = i;
while(l - 1 >= 0 && s.charAt(l - 1) == 'A'){
l --;
}
int r = i;
while(r + 1 < n && s.charAt(r + 1) == 'C'){
r --;
}
list.add(Math.min(i - l, r - i));
}
}
int sum = 0;
for(int e : list){
sum += e;
}
System.out.println(Math.min(2*list.size(), sum));
in.close();
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Hello
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
String s = in.next();
List<Integer> list = new ArrayList<>();
for(int i = 1; i < n - 1; i++){
if(s.charAt(i) == 'R'){
int l = i;
while(l - 1 >= 0 && s.charAt(l - 1) == 'A'){
l --;
}
int r = i;
while(r + 1 < n && s.charAt(r + 1) == 'C'){
r ++;
}
list.add(Math.min(i - l, r - i));
}
}
int sum = 0;
for(int e : list){
sum += e;
}
System.out.println(Math.min(2*list.size(), sum));
in.close();
}
}
|
ConDefects/ConDefects/Code/arc140_b/Java/31817723
|
condefects-java_data_1704
|
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main{
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
// static long MOD = (long) (1e9 + 7);
static long MOD = 998244353;
static long inv2 = 499122177;
static long MOD2 = MOD * MOD;
static FastReader sc = new FastReader();
static int pInf = Integer.MAX_VALUE;
static int nInf = Integer.MIN_VALUE;
static long ded = (long)(1e18)+9;
public static void main(String[] args) throws Exception {
int test = 1;
// test = sc.nextInt();
for (int i = 1; i <= test; i++){
// out.print("Case #"+i+": ");
solve();
}
out.flush();
out.close();
}
static void solve(){
int n = sc.nextInt();
String s = sc.next();
char[] c = s.toCharArray();
TreeMap<Integer,Integer> A = new TreeMap<>();
for(int i = 0; i < n; i ++){
int j = i;
int cnta = 0;
int cntc = 0;
int cntr = 0;
while (j<n&&c[j]=='A'){
cnta++;
j++;
}
while (j<n&&c[j]=='R'){
j++;
cntr++;
}
while (j<n&&c[j]=='C'){
j++;
cntc++;
}
i = j-1;
int k = Math.min(cnta,cntc);
if(k>0&&cntr!=1){
A.put(k,A.getOrDefault(k,0)+1);
}
}
int ans = 0;
int t = 0;
while (!A.isEmpty()){
if(t==0){
ans++;
int key = 1;
for(int k : A.keySet()){
if(k>1){
key = k;
break;
}
}
int p = key;
A.put(p,A.get(p)-1);
if(A.get(p)==0){
A.remove(p);
}
if(p>1){
A.put(p-1,A.getOrDefault(p-1,0)+1);
}
}else{
ans++;
int p = A.firstKey();
A.put(p,A.get(p)-1);
if(A.get(p)==0){
A.remove(p);
}
}
t = 1-t;
}
out.println(ans);
}
static class Pair implements Comparable<Pair> {
int pos;
int idx;
public Pair(int pos, int idx) {
this.pos = pos;
this.idx = idx;
}
@Override
public int compareTo(Pair o){
// if(this.y==o.y){
// return Integer.compare((int)this.x,(int)o.x);
// }
// return Integer.compare(this.y,o.y);
if(this.pos==o.pos){
// if(this.y==o.y){
// return Integer.compare((int)this.p,(int)o.p);
// }
return Integer.compare((int)this.idx,(int)o.idx);
}
return Integer.compare(this.pos,o.pos);
}
// @Override
// public String toString() {
// return "Pair{" + "x=" + x + ", y=" + y + '}';
//// return x+" "+y;
// }
// public boolean equals(Pair o){
// return this.x==o.x&&this.y==o.y;
// }
}
static long lcm(long a, long b){
return (a*b)/gcd(a,b);
}
public static long mul(long a, long b) {
return ((a % MOD) * (b % MOD)) % MOD;
}
public static long sub(long a, long b) {
return ((a%MOD)-(b%MOD)+MOD)%MOD;
}
public static long add(long a, long b) {
if((a+b)>MOD){
return a+b-MOD;
}else{
return a+b;
}
// return ((a % MOD) + (b % MOD)) % MOD;
}
public static long c2(long n) {
if ((n & 1) == 0) {
return mul(n / 2, n - 1);
} else {
return mul(n, (n - 1) / 2);
}
}
//Shuffle Sort
static final Random random = new Random();
static void ruffleSort(int[] a) {
int n = a.length;//shuffle, then sort
for (int i = 0; i < n; i++) {
int oi = random.nextInt(n); int temp= a[oi];
a[oi] = a[i];
a[i] = temp;
}
Arrays.sort(a);
}
//Brian Kernighans Algorithm
static long countSetBits(long n) {
if (n == 0) return 0;
return 1 + countSetBits(n & (n - 1));
}
//Euclidean Algorithm
static long gcd(long A, long B) {
if (B == 0) return A;
return gcd(B, A % B);
}
//Modular Exponentiation
static long fastExpo(long x, long n) {
if (n == 0) return 1;
if ((n & 1) == 0) return fastExpo((x * x) % MOD, n / 2) % MOD;
return ((x % MOD) * fastExpo((x * x) % MOD, (n - 1) / 2)) % MOD;
}
//AKS Algorithm
static boolean isPrime(long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i <= Math.sqrt(n); i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
public static long modinv(long x) {
return modpow(x, MOD - 2);
}
public static long modpow(long a, long b) {
if (b == 0) {
return 1;
}
long x = modpow(a, b / 2);
x = (x * x) % MOD;
if (b % 2 == 1) {
return (x * a) % MOD;
}
return x;
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.io.*;
import java.util.*;
import java.lang.*;
public class Main{
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
// static long MOD = (long) (1e9 + 7);
static long MOD = 998244353;
static long inv2 = 499122177;
static long MOD2 = MOD * MOD;
static FastReader sc = new FastReader();
static int pInf = Integer.MAX_VALUE;
static int nInf = Integer.MIN_VALUE;
static long ded = (long)(1e18)+9;
public static void main(String[] args) throws Exception {
int test = 1;
// test = sc.nextInt();
for (int i = 1; i <= test; i++){
// out.print("Case #"+i+": ");
solve();
}
out.flush();
out.close();
}
static void solve(){
int n = sc.nextInt();
String s = sc.next();
char[] c = s.toCharArray();
TreeMap<Integer,Integer> A = new TreeMap<>();
for(int i = 0; i < n; i ++){
int j = i;
int cnta = 0;
int cntc = 0;
int cntr = 0;
while (j<n&&c[j]=='A'){
cnta++;
j++;
}
while (j<n&&c[j]=='R'){
j++;
cntr++;
}
while (j<n&&c[j]=='C'){
j++;
cntc++;
}
i = j-1;
int k = Math.min(cnta,cntc);
if(k>0&&cntr==1){
A.put(k,A.getOrDefault(k,0)+1);
}
}
int ans = 0;
int t = 0;
while (!A.isEmpty()){
if(t==0){
ans++;
int key = 1;
for(int k : A.keySet()){
if(k>1){
key = k;
break;
}
}
int p = key;
A.put(p,A.get(p)-1);
if(A.get(p)==0){
A.remove(p);
}
if(p>1){
A.put(p-1,A.getOrDefault(p-1,0)+1);
}
}else{
ans++;
int p = A.firstKey();
A.put(p,A.get(p)-1);
if(A.get(p)==0){
A.remove(p);
}
}
t = 1-t;
}
out.println(ans);
}
static class Pair implements Comparable<Pair> {
int pos;
int idx;
public Pair(int pos, int idx) {
this.pos = pos;
this.idx = idx;
}
@Override
public int compareTo(Pair o){
// if(this.y==o.y){
// return Integer.compare((int)this.x,(int)o.x);
// }
// return Integer.compare(this.y,o.y);
if(this.pos==o.pos){
// if(this.y==o.y){
// return Integer.compare((int)this.p,(int)o.p);
// }
return Integer.compare((int)this.idx,(int)o.idx);
}
return Integer.compare(this.pos,o.pos);
}
// @Override
// public String toString() {
// return "Pair{" + "x=" + x + ", y=" + y + '}';
//// return x+" "+y;
// }
// public boolean equals(Pair o){
// return this.x==o.x&&this.y==o.y;
// }
}
static long lcm(long a, long b){
return (a*b)/gcd(a,b);
}
public static long mul(long a, long b) {
return ((a % MOD) * (b % MOD)) % MOD;
}
public static long sub(long a, long b) {
return ((a%MOD)-(b%MOD)+MOD)%MOD;
}
public static long add(long a, long b) {
if((a+b)>MOD){
return a+b-MOD;
}else{
return a+b;
}
// return ((a % MOD) + (b % MOD)) % MOD;
}
public static long c2(long n) {
if ((n & 1) == 0) {
return mul(n / 2, n - 1);
} else {
return mul(n, (n - 1) / 2);
}
}
//Shuffle Sort
static final Random random = new Random();
static void ruffleSort(int[] a) {
int n = a.length;//shuffle, then sort
for (int i = 0; i < n; i++) {
int oi = random.nextInt(n); int temp= a[oi];
a[oi] = a[i];
a[i] = temp;
}
Arrays.sort(a);
}
//Brian Kernighans Algorithm
static long countSetBits(long n) {
if (n == 0) return 0;
return 1 + countSetBits(n & (n - 1));
}
//Euclidean Algorithm
static long gcd(long A, long B) {
if (B == 0) return A;
return gcd(B, A % B);
}
//Modular Exponentiation
static long fastExpo(long x, long n) {
if (n == 0) return 1;
if ((n & 1) == 0) return fastExpo((x * x) % MOD, n / 2) % MOD;
return ((x % MOD) * fastExpo((x * x) % MOD, (n - 1) / 2)) % MOD;
}
//AKS Algorithm
static boolean isPrime(long n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
for (int i = 5; i <= Math.sqrt(n); i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
public static long modinv(long x) {
return modpow(x, MOD - 2);
}
public static long modpow(long a, long b) {
if (b == 0) {
return 1;
}
long x = modpow(a, b / 2);
x = (x * x) % MOD;
if (b % 2 == 1) {
return (x * a) % MOD;
}
return x;
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
|
ConDefects/ConDefects/Code/arc140_b/Java/32326509
|
condefects-java_data_1705
|
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
public class Main {
static ContestPrinter printer = new ContestPrinter(System.out);
static int[][] directions4 = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
static int[][] directions8 = {{-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}};
public static void solve() {
ContestScanner scan = new ContestScanner();
int N = scan.nextInt();
int[] A = scan.nextIntArray(N);
Arrays.sort(A);
int max = 2000000;
long[] freqs = new long[max];
long[] preFreqs = new long[max];
for (int i = 0; i < N; i++) {
freqs[A[i]]++;
}
long answer = -N;
for (int i = 1; i < max; i++) {
preFreqs[i] = preFreqs[i - 1] + freqs[i];
answer -= (freqs[i] * (freqs[i] - 1)) / 2;
}
for (int i = 1; i < max; i++) {
for (int j = i; j < max; j += i) {
long X = (preFreqs[j - 1] - preFreqs[Math.abs(j - i - 1)]);
answer += X * (long)(j / i - 1) * freqs[i];
}
}
print(answer);
}
public static void main(String[] args) {
solve();
printer.flush();
printer.close();
}
public static void write(Object... objs) {
try (PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("", true)))) {
for (Object o : objs) {
pw.println(o);
}
} catch (IOException e) {
e.printStackTrace();
}
}
public static long gcd(long l, long r) {
if (r == 0) return l;
return gcd(r, l % r);
}
public static long lcm(long l, long r) {
return lcm(new BigInteger(String.valueOf(l)), new BigInteger(String.valueOf(r))).longValue();
}
public static BigInteger gcd(BigInteger l, BigInteger r) {
return l.gcd(r);
}
public static BigInteger lcm(BigInteger l, BigInteger r) {
return l.multiply(r).divide(gcd(l, r));
}
@SafeVarargs
public static <T extends Comparable<T>> T max(T... values) {
return Collections.max(Arrays.asList(values));
}
public static <T extends Comparable<T>> T max(Collection<T> values) {
return Collections.max(values);
}
@SafeVarargs
public static <T extends Comparable<T>> T min(T... values) {
return Collections.min(Arrays.asList(values));
}
public static <T extends Comparable<T>> T min(Collection<T> values) {
return Collections.min(values);
}
public static <T extends Comparable<T>> int lowerBound(List<T> list, T key) {
return ~Collections.binarySearch(list, key, (x, y) -> x.compareTo(y) >= 0 ? 1 : -1);
}
public static <T extends Comparable<T>> int upperBound(List<T> list, T key) {
return ~Collections.binarySearch(list, key, (x, y) -> x.compareTo(y) > 0 ? -1 : 1);
}
public static <T1 extends Comparable<T1>, T2> LinkedHashMap<T1, T2> sortMapByKey(Map<T1, T2> map) {
return sortMapByKey(map, false);
}
public static <T1 extends Comparable<T1>, T2> LinkedHashMap<T1, T2> sortMapByKey(Map<T1, T2> map, boolean isReverse) {
List<Entry<T1, T2>> entries = new LinkedList<>(map.entrySet());
if (isReverse) entries.sort(Entry.comparingByKey(Collections.reverseOrder()));
else entries.sort(Entry.comparingByKey());
LinkedHashMap<T1, T2> result = new LinkedHashMap<>();
for (Entry<T1, T2> entry : entries) {
result.put(entry.getKey(), entry.getValue());
}
return result;
}
public static <T1, T2 extends Comparable<T2>> LinkedHashMap<T1, T2> sortMapByValue(Map<T1, T2> map) {
return sortMapByValue(map, false);
}
public static <T1, T2 extends Comparable<T2>> LinkedHashMap<T1, T2> sortMapByValue(Map<T1, T2> map, boolean isReverse) {
List<Entry<T1, T2>> entries = new LinkedList<>(map.entrySet());
if (isReverse) entries.sort(Entry.comparingByValue(Collections.reverseOrder()));
else entries.sort(Entry.comparingByValue());
LinkedHashMap<T1, T2> result = new LinkedHashMap<>();
for (Entry<T1, T2> entry : entries) {
result.put(entry.getKey(), entry.getValue());
}
return result;
}
public static <T extends Comparable<T>> int[] lis(List<T> array) {
int N = array.size();
int[] result = new int[N];
List<T> B = new ArrayList<>();
for (int i = 0; i < N; i++) {
int k = lowerBound(B, array.get(i));
if (k == B.size()) B.add(array.get(i));
else B.set(k, array.get(i));
result[i] = k + 1;
}
return result;
}
public static long lsqrt(long x) {
long b = (long) Math.sqrt(x);
if (b * b > x) b--;
if (b * b < x) b++;
return b;
}
public static void print() {
print("");
}
public static void print(Object o) {
printer.println(o);
}
public static void print(Object... objs) {
printer.printArray(objs);
}
public static void printYesOrNo(boolean f) {
print(f ? "Yes" : "No");
}
public static long[] dijkstra(int N, int start, Map<Integer, List<Edge>> edges) {
PriorityQueue<Pair<Long, Integer>> queue = new PriorityQueue<>();
long[] distance = new long[N];
Arrays.fill(distance, Long.MAX_VALUE);
distance[start] = 0;
queue.offer(new Pair<>(0L, start));
boolean[] isVisited = new boolean[N];
while(!queue.isEmpty()) {
Pair<Long, Integer> pair = queue.poll();
int p = pair.second;
if (isVisited[p]) continue;
isVisited[p] = true;
for (Edge e : edges.get(p)) {
int q = e.to;
long d = e.cost;
if (distance[q] > distance[p] + d) {
distance[q] = distance[p] + d;
queue.offer(new Pair<>(distance[q], q));
}
}
}
return distance;
}
public static long[] dijkstra(int N, Map<Integer, List<Edge>> edges) {
return dijkstra(N, 0, edges);
}
}
class IndexedObject<T extends Comparable<T>> implements Comparable<IndexedObject> {
int i;
T value;
public IndexedObject(int i, T value) {
this.i = i;
this.value = value;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof IndexedObject)) return false;
return this.i == ((IndexedObject<?>)o).i && this.value.equals(((IndexedObject<?>)o).value);
}
@Override
public int compareTo(IndexedObject o) {
if (o.value.getClass() != this.value.getClass()) throw new IllegalArgumentException();
return value.compareTo((T) o.value);
}
@Override
public int hashCode() {
return this.i + this.value.hashCode();
}
@Override
public String toString() {
return "IndexedObject{" +
"i=" + i +
", value=" + value +
'}';
}
}
class Point {
long x;
long y;
public Point(long x, long y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
return this.x == ((Point)o).x && this.y == ((Point)o).y;
}
@Override
public int hashCode() {
return Long.hashCode(x) * 524287 + Long.hashCode(y);
}
public Point add(Point q) {
return new Point(x + q.x, y + q.y);
}
public Point add(int[] d) {
return this.add(d[0], d[1]);
}
public Point add(int x, int y) {
return new Point(this.x + x, this.y + y);
}
public int getIntX() {
return (int) x;
}
public int getIntY() {
return (int) y;
}
@Override
public String toString() {
return this.x + " " + this.y;
}
}
class GraphBuilder {
private final Map<Integer, List<Edge>> edges = new HashMap<>();
private final int N;
private final boolean isDirected;
private final ContestScanner scan;
public GraphBuilder(int N, boolean isDirected, ContestScanner scan) {
this.isDirected = isDirected;
this.scan = scan;
this.N = N;
for (int i = 0; i < N; i++) {
edges.put(i, new ArrayList<>());
}
}
public GraphBuilder(int N, ContestScanner scanner) {
this(N, false, scanner);
}
public void addEdge(int u, int v, long cost, int i) {
edges.get(u).add(new Edge(u, v, cost, i));
if (!isDirected) edges.get(v).add(new Edge(v, u, cost, i));
}
public void addEdge(int u, int v, long cost) {
this.addEdge(u, v, cost, -1);
}
public void readGraph(int M, int d, boolean weighted) {
for (int i = 0; i < M; i++) {
if (weighted) this.addEdge(scan.nextInt() - d, scan.nextInt() - d, scan.nextInt());
else this.addEdge(scan.nextInt() - d, scan.nextInt() - d);
}
}
public void readGraph(int M) {
this.readGraph(M, 1, false);
}
public void readGraph(int M, boolean weighted) {
this.readGraph(M, 1, weighted);
}
public void addEdge(int u, int v) {
this.addEdge(u, v, 0, -1);
}
public Map<Integer, List<Edge>> getEdges() {
return edges;
}
public int getN() {
return N;
}
}
class Edge implements Comparable<Edge>{
int from;
int to;
long cost;
int i;
public Edge(int from, int to, long cost, int i) {
this.from = from;
this.to = to;
this.cost = cost;
this.i = i;
}
public Edge(int from, int to, long cost) {
this(from, to, cost, -1);
}
public Edge(int from, int to) {
this(from, to, 0, -1);
}
public Edge(int to, long cost) {
this(-1, to, cost, -1);
}
public Edge(int to) {
this(-1, to, 0, -1);
}
@Override
public int compareTo(Edge o) {
return Long.compare(this.cost, o.cost);
}
@Override
public String toString() {
return this.from + "-" + this.cost + "->" + this.to;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Edge edge = (Edge) o;
return from == edge.from && to == edge.to && cost == edge.cost && i == edge.i;
}
@Override
public int hashCode() {
return Objects.hash(from, to, cost, i);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public String[] nextStringArray(int length){
String[] array = new String[length];
for(int i=0; i<length; i++) array[i] = this.next();
return array;
}
public String[] nextStringArray(int length, java.util.function.UnaryOperator<String> map){
String[] array = new String[length];
for(int i=0; i<length; i++) array[i] = map.apply(this.next());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter{
public ContestPrinter(java.io.PrintStream stream){
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException{
super(new java.io.PrintStream(file));
}
public ContestPrinter(){
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if(x < 0){
sb.append('-');
x = -x;
}
x += Math.pow(10, -n)/2;
sb.append((long)x);
sb.append(".");
x -= (long)x;
for(int i = 0;i < n;i++){
x *= 10;
sb.append((int)x);
x -= (int)x;
}
return sb.toString();
}
@Override
public void print(float f){
super.print(dtos(f, 20));
}
@Override
public void println(float f){
super.println(dtos(f, 20));
}
@Override
public void print(double d){
super.print(dtos(d, 20));
}
@Override
public void println(double d){
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
class UnionFind {
private int n;
private int[] parentOrSize;
public UnionFind(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
int x = leader(a);
int y = leader(b);
if (x == y) return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("" + a);
return -parentOrSize[leader(a)];
}
java.util.ArrayList<java.util.ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
java.util.ArrayList<java.util.ArrayList<Integer>> result = new java.util.ArrayList<>(n);
for (int i = 0; i < n; i++) {
result.add(new java.util.ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(java.util.ArrayList::isEmpty);
return result;
}
}
class WeightedUnionFind {
private int[] parents;
private long[] diffWeights;
public WeightedUnionFind(int n) {
parents = new int[n];
Arrays.fill(parents, -1);
diffWeights = new long[n];
}
public int find(int i) {
if (parents[i] < 0) return i;
int root = find(parents[i]);
diffWeights[i] += diffWeights[parents[i]];
return (parents[i] = root);
}
public boolean merge(int a, int b, long w) {
if (same(a, b)) return weight(b) - weight(a) == w;
w += weight(a);
w -= weight(b);
a = find(a);
b = find(b);
if (-parents[a] < -parents[b]) {
int temp = a;
a = b;
b = temp;
w = -w;
}
parents[a] += parents[b];
parents[b] = a;
diffWeights[b] = w;
return true;
}
public long diff(int a, int b) {
return (weight(b) - weight(a));
}
public boolean same(int a, int b) {
return (find(a) == find(b));
}
public int size(int i) {
return -parents[find(i)];
}
private long weight(int i) {
find(i);
return diffWeights[i];
}
}
class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
private final boolean usesMontgomery;
private final ModArithmetic.ModArithmeticMontgomery maMontgomery;
private ArrayList<Integer> factorial;
public ModIntFactory(int mod) {
this.ma = ModArithmetic.of(mod);
this.usesMontgomery = ma instanceof ModArithmetic.ModArithmeticMontgomery;
this.maMontgomery = usesMontgomery ? (ModArithmetic.ModArithmeticMontgomery) ma : null;
this.mod = mod;
this.factorial = new ArrayList<>();
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (usesMontgomery) {
return new ModInt(maMontgomery.generate(value));
} else {
return new ModInt((int) value);
}
}
private void prepareFactorial(int max){
factorial.ensureCapacity(max+1);
if(factorial.size()==0) factorial.add(1);
if (usesMontgomery) {
for(int i=factorial.size(); i<=max; i++){
factorial.add(ma.mul(factorial.get(i-1), maMontgomery.generate(i)));
}
} else {
for(int i=factorial.size(); i<=max; i++){
factorial.add(ma.mul(factorial.get(i-1), i));
}
}
}
public ModInt factorial(int i){
prepareFactorial(i);
return create(factorial.get(i));
}
public ModInt permutation(int n, int r){
if(n < 0 || r < 0 || n < r) return create(0);
prepareFactorial(n);
return create(ma.div(factorial.get(n), factorial.get(r)));
}
public ModInt combination(int n, int r){
if(n < 0 || r < 0 || n < r) return create(0);
prepareFactorial(n);
return create(ma.div(factorial.get(n), ma.mul(factorial.get(r),factorial.get(n-r))));
}
public int getMod() {
return mod;
}
public class ModInt {
private int value;
private ModInt(int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (usesMontgomery) {
return maMontgomery.reduce(value);
}
return value;
}
public ModInt add(ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(ModInt mi1, ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(ModInt mi1, ModInt mi2, ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(ModInt mi1, ModInt... mis) {
ModInt mi = add(mi1);
for (ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(ModInt mi1, ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(ModInt mi1, ModInt mi2, ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(ModInt mi1, ModInt... mis) {
ModInt mi = mul(mi1);
for (ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(ModInt mi) {
this.value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(ModInt mi1, ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(ModInt mi1, ModInt mi2, ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(ModInt... mis) {
for (ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(long mi) {
this.value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(ModInt mi) {
this.value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(long mi) {
this.value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(ModInt mi) {
this.value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(ModInt mi1, ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(ModInt mi1, ModInt mi2, ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(ModInt... mis) {
for (ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(long mi) {
this.value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(ModInt mi) {
this.value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(long mi) {
this.value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(Object o) {
if (o instanceof ModInt) {
ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private static abstract class ModArithmetic {
abstract int mod();
abstract int remainder(long value);
abstract int add(int a, int b);
abstract int sub(int a, int b);
abstract int mul(int a, int b);
int div(int a, int b) {
return mul(a, inv(b));
}
int inv(int a) {
int b = mod();
if (b == 1) return 0;
long u = 1, v = 0;
while (b >= 1) {
int t = a / b;
a -= t * b;
int tmp1 = a; a = b; b = tmp1;
u -= t * v;
long tmp2 = u; u = v; v = tmp2;
}
if (a != 1) {
throw new ArithmeticException("divide by zero");
}
return remainder(u);
}
int pow(int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int r = 1;
int x = a;
while (b > 0) {
if ((b & 1) == 1) r = mul(r, x);
x = mul(x, x);
b >>= 1;
}
return r;
}
static ModArithmetic of(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);
}
}
private static final class ModArithmetic1 extends ModArithmetic {
int mod() {return 1;}
int remainder(long value) {return 0;}
int add(int a, int b) {return 0;}
int sub(int a, int b) {return 0;}
int mul(int a, int b) {return 0;}
int pow(int a, long b) {return 0;}
}
private static final class ModArithmetic2 extends ModArithmetic {
int mod() {return 2;}
int remainder(long value) {return (int) (value & 1);}
int add(int a, int b) {return a ^ b;}
int sub(int a, int b) {return a ^ b;}
int mul(int a, int b) {return a & b;}
}
private static final class ModArithmetic998244353 extends ModArithmetic {
private final int mod = 998244353;
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int res = a + b;
return res >= mod ? res - mod : res;
}
int sub(int a, int b) {
int res = a - b;
return res < 0 ? res + mod : res;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
private static final class ModArithmetic1000000007 extends ModArithmetic {
private final int mod = 1000000007;
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int res = a + b;
return res >= mod ? res - mod : res;
}
int sub(int a, int b) {
int res = a - b;
return res < 0 ? res + mod : res;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
private static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2;
private ModArithmeticMontgomery(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;
}
long r = (1l << 32) % mod;
this.negInv = inv;
this.r2 = (r * r) % mod;
}
private int generate(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
int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
int mul(int a, int b) {
return reduce((long) a * b);
}
@Override
int inv(int a) {
return super.inv(reduce(a));
}
@Override
int pow(int a, long b) {
return generate(super.pow(a, b));
}
}
private static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(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)
*/
long a = (1l << 32) / mod;
long b = (1l << 32) % mod;
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
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
int mul(int a, int b) {
return reduce((long) a * b);
}
}
private static class ModArithmeticDynamic extends ModArithmetic {
final int mod;
ModArithmeticDynamic(int mod) {
this.mod = mod;
}
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
int sub(int a, int b) {
int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
}
}
class SCC {
static class Edge {
int from, to;
public Edge(int from, 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(int n) {
this.n = n;
this.unorderedEdges = new java.util.ArrayList<>();
this.start = new int[n + 1];
this.ids = new int[n];
}
public void addEdge(int from, int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
this.m++;
}
public int id(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];
}
Edge[] orderedEdges = new Edge[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
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);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
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
long p = stack[--ptr];
// vertex
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
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) {
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
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];
}
int[] counts = new int[groupNum];
for (int x : ids) counts[x]++;
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++) {
int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, n)
);
}
}
}
class Permutation implements java.util.Iterator<int[]>, Iterable<int[]> {
private int[] next;
public Permutation(int n) {
next = java.util.stream.IntStream.range(0, n).toArray();
}
@Override
public boolean hasNext() {
return next != null;
}
@Override
public int[] next() {
int[] r = next.clone();
next = nextPermutation(next);
return r;
}
@Override
public java.util.Iterator<int[]> iterator() {
return this;
}
public static int[] nextPermutation(int[] a) {
if (a == null || a.length < 2)
return null;
int p = 0;
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] >= a[i + 1])
continue;
p = i;
break;
}
int q = 0;
for (int i = a.length - 1; i > p; i--) {
if (a[i] <= a[p])
continue;
q = i;
break;
}
if (p == 0 && q == 0)
return null;
int temp = a[p];
a[p] = a[q];
a[q] = temp;
int l = p, r = a.length;
while (++l < --r) {
temp = a[l];
a[l] = a[r];
a[r] = temp;
}
return a;
}
}
class Combination {
int n, r;
List<List<Integer>> index = null;
public Combination(int n, int r) {
this.n = n;
this.r = r;
}
public List<List<Integer>> getCombination() {
if (index != null) return index;
List<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(i);
}
index = make(list, r);
return index;
}
public long getSize() {
long result = 1;
for (int i = 1; i <= r; i++) {
result = result * (n - i + 1) / i;
}
return result;
}
private static List<List<Integer>> make (List<Integer> candidate, int r) {
if (candidate.size() < r || candidate.isEmpty() || r <= 0) {
List<List<Integer>> empty = new ArrayList<>();
empty.add(new ArrayList<>());
return empty;
}
List<List<Integer>> combination = new ArrayList<>();
for (int i = 0; i <= candidate.size() - r; i++) {
Integer picked = candidate.get(i);
List<Integer> rest = new ArrayList<>(candidate);
rest.subList(0, i + 1).clear();
combination.addAll(make(rest, r - 1).stream().peek(list -> list.add(0, picked)).toList());
}
return combination;
}
}
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)
);
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N) return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1) sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class FenwickTree{
private int _n;
private long[] data;
public FenwickTree(int n){
this._n = n;
data = new long[n];
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_b
* @submission https://atcoder.jp/contests/practice2/submissions/16580495
*/
public FenwickTree(long[] data) {
this(data.length);
build(data);
}
public void set(int p, long x){
add(p, x - get(p));
}
public void add(int p, long x){
assert(0<=p && p<_n);
p++;
while(p<=_n){
data[p-1] += x;
p += p&-p;
}
}
public long sum(int l, int r){
assert(0<=l && l<=r && r<=_n);
return sum(r)-sum(l);
}
public long get(int p){
return sum(p, p+1);
}
private long sum(int r){
long s = 0;
while(r>0){
s += data[r-1];
r -= r&-r;
}
return s;
}
private void build(long[] dat) {
System.arraycopy(dat, 0, data, 0, _n);
for (int i=1; i<=_n; i++) {
int p = i+(i&-i);
if(p<=_n){
data[p-1] += data[i-1];
}
}
}
}
class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(int n, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(int k) {
if (Laz[k] == Id) return;
int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(int lk, int rk) {
for (int i = Log; i > 0; i--) {
if (((lk >> i) << i) != lk) push(lk >> i);
if (((rk >> i) << i) != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(int lk, int rk) {
for (int i = 1; i <= Log; i++) {
if (((lk >> i) << i) != lk) {
int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (((rk >> i) << i) != rk) {
int rki = (rk - 1) >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r)
);
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N; r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1; r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, F f) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r)
);
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N; r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1; r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d).", p, 0, MAX)
);
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d].", p, 0, MAX)
);
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
private S[] simulatePushAll() {
S[] simDat = java.util.Arrays.copyOf(Dat, 2 * N);
F[] simLaz = java.util.Arrays.copyOf(Laz, 2 * N);
for (int k = 1; k < N; k++) {
if (simLaz[k] == Id) continue;
int lk = k << 1 | 0, rk = k << 1 | 1;
simDat[lk] = Mapping.apply(simLaz[k], simDat[lk]);
simDat[rk] = Mapping.apply(simLaz[k], simDat[rk]);
if (lk < N) simLaz[lk] = Composition.apply(simLaz[k], simLaz[lk]);
if (rk < N) simLaz[rk] = Composition.apply(simLaz[k], simLaz[rk]);
simLaz[k] = Id;
}
return simDat;
}
public String toDetailedString() {
return toDetailedString(1, 0, simulatePushAll());
}
private String toDetailedString(int k, int sp, S[] dat) {
if (k >= N) return indent(sp) + dat[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent, dat);
s += "\n";
s += indent(sp) + dat[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent, dat);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
S[] dat = simulatePushAll();
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(dat[i + N]);
if (i < N - 1) sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
import java.util.Map.Entry;
public class Main {
static ContestPrinter printer = new ContestPrinter(System.out);
static int[][] directions4 = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
static int[][] directions8 = {{-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}, {1, 0}, {1, -1}, {0, -1}};
public static void solve() {
ContestScanner scan = new ContestScanner();
int N = scan.nextInt();
int[] A = scan.nextIntArray(N);
Arrays.sort(A);
int max = 4000000;
long[] freqs = new long[max];
long[] preFreqs = new long[max];
for (int i = 0; i < N; i++) {
freqs[A[i]]++;
}
long answer = -N;
for (int i = 1; i < max; i++) {
preFreqs[i] = preFreqs[i - 1] + freqs[i];
answer -= (freqs[i] * (freqs[i] - 1)) / 2;
}
for (int i = 1; i < max; i++) {
for (int j = i; j < max; j += i) {
long X = (preFreqs[j - 1] - preFreqs[Math.abs(j - i - 1)]);
answer += X * (long)(j / i - 1) * freqs[i];
}
}
print(answer);
}
public static void main(String[] args) {
solve();
printer.flush();
printer.close();
}
public static void write(Object... objs) {
try (PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("", true)))) {
for (Object o : objs) {
pw.println(o);
}
} catch (IOException e) {
e.printStackTrace();
}
}
public static long gcd(long l, long r) {
if (r == 0) return l;
return gcd(r, l % r);
}
public static long lcm(long l, long r) {
return lcm(new BigInteger(String.valueOf(l)), new BigInteger(String.valueOf(r))).longValue();
}
public static BigInteger gcd(BigInteger l, BigInteger r) {
return l.gcd(r);
}
public static BigInteger lcm(BigInteger l, BigInteger r) {
return l.multiply(r).divide(gcd(l, r));
}
@SafeVarargs
public static <T extends Comparable<T>> T max(T... values) {
return Collections.max(Arrays.asList(values));
}
public static <T extends Comparable<T>> T max(Collection<T> values) {
return Collections.max(values);
}
@SafeVarargs
public static <T extends Comparable<T>> T min(T... values) {
return Collections.min(Arrays.asList(values));
}
public static <T extends Comparable<T>> T min(Collection<T> values) {
return Collections.min(values);
}
public static <T extends Comparable<T>> int lowerBound(List<T> list, T key) {
return ~Collections.binarySearch(list, key, (x, y) -> x.compareTo(y) >= 0 ? 1 : -1);
}
public static <T extends Comparable<T>> int upperBound(List<T> list, T key) {
return ~Collections.binarySearch(list, key, (x, y) -> x.compareTo(y) > 0 ? -1 : 1);
}
public static <T1 extends Comparable<T1>, T2> LinkedHashMap<T1, T2> sortMapByKey(Map<T1, T2> map) {
return sortMapByKey(map, false);
}
public static <T1 extends Comparable<T1>, T2> LinkedHashMap<T1, T2> sortMapByKey(Map<T1, T2> map, boolean isReverse) {
List<Entry<T1, T2>> entries = new LinkedList<>(map.entrySet());
if (isReverse) entries.sort(Entry.comparingByKey(Collections.reverseOrder()));
else entries.sort(Entry.comparingByKey());
LinkedHashMap<T1, T2> result = new LinkedHashMap<>();
for (Entry<T1, T2> entry : entries) {
result.put(entry.getKey(), entry.getValue());
}
return result;
}
public static <T1, T2 extends Comparable<T2>> LinkedHashMap<T1, T2> sortMapByValue(Map<T1, T2> map) {
return sortMapByValue(map, false);
}
public static <T1, T2 extends Comparable<T2>> LinkedHashMap<T1, T2> sortMapByValue(Map<T1, T2> map, boolean isReverse) {
List<Entry<T1, T2>> entries = new LinkedList<>(map.entrySet());
if (isReverse) entries.sort(Entry.comparingByValue(Collections.reverseOrder()));
else entries.sort(Entry.comparingByValue());
LinkedHashMap<T1, T2> result = new LinkedHashMap<>();
for (Entry<T1, T2> entry : entries) {
result.put(entry.getKey(), entry.getValue());
}
return result;
}
public static <T extends Comparable<T>> int[] lis(List<T> array) {
int N = array.size();
int[] result = new int[N];
List<T> B = new ArrayList<>();
for (int i = 0; i < N; i++) {
int k = lowerBound(B, array.get(i));
if (k == B.size()) B.add(array.get(i));
else B.set(k, array.get(i));
result[i] = k + 1;
}
return result;
}
public static long lsqrt(long x) {
long b = (long) Math.sqrt(x);
if (b * b > x) b--;
if (b * b < x) b++;
return b;
}
public static void print() {
print("");
}
public static void print(Object o) {
printer.println(o);
}
public static void print(Object... objs) {
printer.printArray(objs);
}
public static void printYesOrNo(boolean f) {
print(f ? "Yes" : "No");
}
public static long[] dijkstra(int N, int start, Map<Integer, List<Edge>> edges) {
PriorityQueue<Pair<Long, Integer>> queue = new PriorityQueue<>();
long[] distance = new long[N];
Arrays.fill(distance, Long.MAX_VALUE);
distance[start] = 0;
queue.offer(new Pair<>(0L, start));
boolean[] isVisited = new boolean[N];
while(!queue.isEmpty()) {
Pair<Long, Integer> pair = queue.poll();
int p = pair.second;
if (isVisited[p]) continue;
isVisited[p] = true;
for (Edge e : edges.get(p)) {
int q = e.to;
long d = e.cost;
if (distance[q] > distance[p] + d) {
distance[q] = distance[p] + d;
queue.offer(new Pair<>(distance[q], q));
}
}
}
return distance;
}
public static long[] dijkstra(int N, Map<Integer, List<Edge>> edges) {
return dijkstra(N, 0, edges);
}
}
class IndexedObject<T extends Comparable<T>> implements Comparable<IndexedObject> {
int i;
T value;
public IndexedObject(int i, T value) {
this.i = i;
this.value = value;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof IndexedObject)) return false;
return this.i == ((IndexedObject<?>)o).i && this.value.equals(((IndexedObject<?>)o).value);
}
@Override
public int compareTo(IndexedObject o) {
if (o.value.getClass() != this.value.getClass()) throw new IllegalArgumentException();
return value.compareTo((T) o.value);
}
@Override
public int hashCode() {
return this.i + this.value.hashCode();
}
@Override
public String toString() {
return "IndexedObject{" +
"i=" + i +
", value=" + value +
'}';
}
}
class Point {
long x;
long y;
public Point(long x, long y) {
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Point)) return false;
return this.x == ((Point)o).x && this.y == ((Point)o).y;
}
@Override
public int hashCode() {
return Long.hashCode(x) * 524287 + Long.hashCode(y);
}
public Point add(Point q) {
return new Point(x + q.x, y + q.y);
}
public Point add(int[] d) {
return this.add(d[0], d[1]);
}
public Point add(int x, int y) {
return new Point(this.x + x, this.y + y);
}
public int getIntX() {
return (int) x;
}
public int getIntY() {
return (int) y;
}
@Override
public String toString() {
return this.x + " " + this.y;
}
}
class GraphBuilder {
private final Map<Integer, List<Edge>> edges = new HashMap<>();
private final int N;
private final boolean isDirected;
private final ContestScanner scan;
public GraphBuilder(int N, boolean isDirected, ContestScanner scan) {
this.isDirected = isDirected;
this.scan = scan;
this.N = N;
for (int i = 0; i < N; i++) {
edges.put(i, new ArrayList<>());
}
}
public GraphBuilder(int N, ContestScanner scanner) {
this(N, false, scanner);
}
public void addEdge(int u, int v, long cost, int i) {
edges.get(u).add(new Edge(u, v, cost, i));
if (!isDirected) edges.get(v).add(new Edge(v, u, cost, i));
}
public void addEdge(int u, int v, long cost) {
this.addEdge(u, v, cost, -1);
}
public void readGraph(int M, int d, boolean weighted) {
for (int i = 0; i < M; i++) {
if (weighted) this.addEdge(scan.nextInt() - d, scan.nextInt() - d, scan.nextInt());
else this.addEdge(scan.nextInt() - d, scan.nextInt() - d);
}
}
public void readGraph(int M) {
this.readGraph(M, 1, false);
}
public void readGraph(int M, boolean weighted) {
this.readGraph(M, 1, weighted);
}
public void addEdge(int u, int v) {
this.addEdge(u, v, 0, -1);
}
public Map<Integer, List<Edge>> getEdges() {
return edges;
}
public int getN() {
return N;
}
}
class Edge implements Comparable<Edge>{
int from;
int to;
long cost;
int i;
public Edge(int from, int to, long cost, int i) {
this.from = from;
this.to = to;
this.cost = cost;
this.i = i;
}
public Edge(int from, int to, long cost) {
this(from, to, cost, -1);
}
public Edge(int from, int to) {
this(from, to, 0, -1);
}
public Edge(int to, long cost) {
this(-1, to, cost, -1);
}
public Edge(int to) {
this(-1, to, 0, -1);
}
@Override
public int compareTo(Edge o) {
return Long.compare(this.cost, o.cost);
}
@Override
public String toString() {
return this.from + "-" + this.cost + "->" + this.to;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Edge edge = (Edge) o;
return from == edge.from && to == edge.to && cost == edge.cost && i == edge.i;
}
@Override
public int hashCode() {
return Objects.hash(from, to, cost, i);
}
}
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public String[] nextStringArray(int length){
String[] array = new String[length];
for(int i=0; i<length; i++) array[i] = this.next();
return array;
}
public String[] nextStringArray(int length, java.util.function.UnaryOperator<String> map){
String[] array = new String[length];
for(int i=0; i<length; i++) array[i] = map.apply(this.next());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends java.io.PrintWriter{
public ContestPrinter(java.io.PrintStream stream){
super(stream);
}
public ContestPrinter(java.io.File file) throws java.io.FileNotFoundException{
super(new java.io.PrintStream(file));
}
public ContestPrinter(){
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if(x < 0){
sb.append('-');
x = -x;
}
x += Math.pow(10, -n)/2;
sb.append((long)x);
sb.append(".");
x -= (long)x;
for(int i = 0;i < n;i++){
x *= 10;
sb.append((int)x);
x -= (int)x;
}
return sb.toString();
}
@Override
public void print(float f){
super.print(dtos(f, 20));
}
@Override
public void println(float f){
super.println(dtos(f, 20));
}
@Override
public void print(double d){
super.print(dtos(d, 20));
}
@Override
public void println(double d){
super.println(dtos(d, 20));
}
public void printArray(int[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(int[] array){
this.printArray(array, " ");
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n-1]));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map){
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public void printArray(long[] array){
this.printArray(array, " ");
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n-1]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map){
this.printArray(array, " ", map);
}
public <T> void printArray(T[] array, String separator){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(array[i]);
super.print(separator);
}
super.println(array[n-1]);
}
public <T> void printArray(T[] array){
this.printArray(array, " ");
}
public <T> void printArray(T[] array, String separator, java.util.function.UnaryOperator<T> map){
int n = array.length;
if(n==0){
super.println();
return;
}
for(int i=0; i<n-1; i++){
super.print(map.apply(array[i]));
super.print(separator);
}
super.println(map.apply(array[n-1]));
}
public <T> void printArray(T[] array, java.util.function.UnaryOperator<T> map){
this.printArray(array, " ", map);
}
}
class UnionFind {
private int n;
private int[] parentOrSize;
public UnionFind(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
int x = leader(a);
int y = leader(b);
if (x == y) return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("" + a);
return -parentOrSize[leader(a)];
}
java.util.ArrayList<java.util.ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
java.util.ArrayList<java.util.ArrayList<Integer>> result = new java.util.ArrayList<>(n);
for (int i = 0; i < n; i++) {
result.add(new java.util.ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(java.util.ArrayList::isEmpty);
return result;
}
}
class WeightedUnionFind {
private int[] parents;
private long[] diffWeights;
public WeightedUnionFind(int n) {
parents = new int[n];
Arrays.fill(parents, -1);
diffWeights = new long[n];
}
public int find(int i) {
if (parents[i] < 0) return i;
int root = find(parents[i]);
diffWeights[i] += diffWeights[parents[i]];
return (parents[i] = root);
}
public boolean merge(int a, int b, long w) {
if (same(a, b)) return weight(b) - weight(a) == w;
w += weight(a);
w -= weight(b);
a = find(a);
b = find(b);
if (-parents[a] < -parents[b]) {
int temp = a;
a = b;
b = temp;
w = -w;
}
parents[a] += parents[b];
parents[b] = a;
diffWeights[b] = w;
return true;
}
public long diff(int a, int b) {
return (weight(b) - weight(a));
}
public boolean same(int a, int b) {
return (find(a) == find(b));
}
public int size(int i) {
return -parents[find(i)];
}
private long weight(int i) {
find(i);
return diffWeights[i];
}
}
class ModIntFactory {
private final ModArithmetic ma;
private final int mod;
private final boolean usesMontgomery;
private final ModArithmetic.ModArithmeticMontgomery maMontgomery;
private ArrayList<Integer> factorial;
public ModIntFactory(int mod) {
this.ma = ModArithmetic.of(mod);
this.usesMontgomery = ma instanceof ModArithmetic.ModArithmeticMontgomery;
this.maMontgomery = usesMontgomery ? (ModArithmetic.ModArithmeticMontgomery) ma : null;
this.mod = mod;
this.factorial = new ArrayList<>();
}
public ModInt create(long value) {
if ((value %= mod) < 0) value += mod;
if (usesMontgomery) {
return new ModInt(maMontgomery.generate(value));
} else {
return new ModInt((int) value);
}
}
private void prepareFactorial(int max){
factorial.ensureCapacity(max+1);
if(factorial.size()==0) factorial.add(1);
if (usesMontgomery) {
for(int i=factorial.size(); i<=max; i++){
factorial.add(ma.mul(factorial.get(i-1), maMontgomery.generate(i)));
}
} else {
for(int i=factorial.size(); i<=max; i++){
factorial.add(ma.mul(factorial.get(i-1), i));
}
}
}
public ModInt factorial(int i){
prepareFactorial(i);
return create(factorial.get(i));
}
public ModInt permutation(int n, int r){
if(n < 0 || r < 0 || n < r) return create(0);
prepareFactorial(n);
return create(ma.div(factorial.get(n), factorial.get(r)));
}
public ModInt combination(int n, int r){
if(n < 0 || r < 0 || n < r) return create(0);
prepareFactorial(n);
return create(ma.div(factorial.get(n), ma.mul(factorial.get(r),factorial.get(n-r))));
}
public int getMod() {
return mod;
}
public class ModInt {
private int value;
private ModInt(int value) {
this.value = value;
}
public int mod() {
return mod;
}
public int value() {
if (usesMontgomery) {
return maMontgomery.reduce(value);
}
return value;
}
public ModInt add(ModInt mi) {
return new ModInt(ma.add(value, mi.value));
}
public ModInt add(ModInt mi1, ModInt mi2) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2);
}
public ModInt add(ModInt mi1, ModInt mi2, ModInt mi3) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3);
}
public ModInt add(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return new ModInt(ma.add(value, mi1.value)).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt add(ModInt mi1, ModInt... mis) {
ModInt mi = add(mi1);
for (ModInt m : mis) mi.addAsg(m);
return mi;
}
public ModInt add(long mi) {
return new ModInt(ma.add(value, ma.remainder(mi)));
}
public ModInt sub(ModInt mi) {
return new ModInt(ma.sub(value, mi.value));
}
public ModInt sub(long mi) {
return new ModInt(ma.sub(value, ma.remainder(mi)));
}
public ModInt mul(ModInt mi) {
return new ModInt(ma.mul(value, mi.value));
}
public ModInt mul(ModInt mi1, ModInt mi2) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2);
}
public ModInt mul(ModInt mi1, ModInt mi2, ModInt mi3) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mul(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return new ModInt(ma.mul(value, mi1.value)).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mul(ModInt mi1, ModInt... mis) {
ModInt mi = mul(mi1);
for (ModInt m : mis) mi.mulAsg(m);
return mi;
}
public ModInt mul(long mi) {
return new ModInt(ma.mul(value, ma.remainder(mi)));
}
public ModInt div(ModInt mi) {
return new ModInt(ma.div(value, mi.value));
}
public ModInt div(long mi) {
return new ModInt(ma.div(value, ma.remainder(mi)));
}
public ModInt inv() {
return new ModInt(ma.inv(value));
}
public ModInt pow(long b) {
return new ModInt(ma.pow(value, b));
}
public ModInt addAsg(ModInt mi) {
this.value = ma.add(value, mi.value);
return this;
}
public ModInt addAsg(ModInt mi1, ModInt mi2) {
return addAsg(mi1).addAsg(mi2);
}
public ModInt addAsg(ModInt mi1, ModInt mi2, ModInt mi3) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3);
}
public ModInt addAsg(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return addAsg(mi1).addAsg(mi2).addAsg(mi3).addAsg(mi4);
}
public ModInt addAsg(ModInt... mis) {
for (ModInt m : mis) addAsg(m);
return this;
}
public ModInt addAsg(long mi) {
this.value = ma.add(value, ma.remainder(mi));
return this;
}
public ModInt subAsg(ModInt mi) {
this.value = ma.sub(value, mi.value);
return this;
}
public ModInt subAsg(long mi) {
this.value = ma.sub(value, ma.remainder(mi));
return this;
}
public ModInt mulAsg(ModInt mi) {
this.value = ma.mul(value, mi.value);
return this;
}
public ModInt mulAsg(ModInt mi1, ModInt mi2) {
return mulAsg(mi1).mulAsg(mi2);
}
public ModInt mulAsg(ModInt mi1, ModInt mi2, ModInt mi3) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3);
}
public ModInt mulAsg(ModInt mi1, ModInt mi2, ModInt mi3, ModInt mi4) {
return mulAsg(mi1).mulAsg(mi2).mulAsg(mi3).mulAsg(mi4);
}
public ModInt mulAsg(ModInt... mis) {
for (ModInt m : mis) mulAsg(m);
return this;
}
public ModInt mulAsg(long mi) {
this.value = ma.mul(value, ma.remainder(mi));
return this;
}
public ModInt divAsg(ModInt mi) {
this.value = ma.div(value, mi.value);
return this;
}
public ModInt divAsg(long mi) {
this.value = ma.div(value, ma.remainder(mi));
return this;
}
@Override
public String toString() {
return String.valueOf(value());
}
@Override
public boolean equals(Object o) {
if (o instanceof ModInt) {
ModInt mi = (ModInt) o;
return mod() == mi.mod() && value() == mi.value();
}
return false;
}
@Override
public int hashCode() {
return (1 * 37 + mod()) * 37 + value();
}
}
private static abstract class ModArithmetic {
abstract int mod();
abstract int remainder(long value);
abstract int add(int a, int b);
abstract int sub(int a, int b);
abstract int mul(int a, int b);
int div(int a, int b) {
return mul(a, inv(b));
}
int inv(int a) {
int b = mod();
if (b == 1) return 0;
long u = 1, v = 0;
while (b >= 1) {
int t = a / b;
a -= t * b;
int tmp1 = a; a = b; b = tmp1;
u -= t * v;
long tmp2 = u; u = v; v = tmp2;
}
if (a != 1) {
throw new ArithmeticException("divide by zero");
}
return remainder(u);
}
int pow(int a, long b) {
if (b < 0) throw new ArithmeticException("negative power");
int r = 1;
int x = a;
while (b > 0) {
if ((b & 1) == 1) r = mul(r, x);
x = mul(x, x);
b >>= 1;
}
return r;
}
static ModArithmetic of(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);
}
}
private static final class ModArithmetic1 extends ModArithmetic {
int mod() {return 1;}
int remainder(long value) {return 0;}
int add(int a, int b) {return 0;}
int sub(int a, int b) {return 0;}
int mul(int a, int b) {return 0;}
int pow(int a, long b) {return 0;}
}
private static final class ModArithmetic2 extends ModArithmetic {
int mod() {return 2;}
int remainder(long value) {return (int) (value & 1);}
int add(int a, int b) {return a ^ b;}
int sub(int a, int b) {return a ^ b;}
int mul(int a, int b) {return a & b;}
}
private static final class ModArithmetic998244353 extends ModArithmetic {
private final int mod = 998244353;
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int res = a + b;
return res >= mod ? res - mod : res;
}
int sub(int a, int b) {
int res = a - b;
return res < 0 ? res + mod : res;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
private static final class ModArithmetic1000000007 extends ModArithmetic {
private final int mod = 1000000007;
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int res = a + b;
return res >= mod ? res - mod : res;
}
int sub(int a, int b) {
int res = a - b;
return res < 0 ? res + mod : res;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
private static final class ModArithmeticMontgomery extends ModArithmeticDynamic {
private final long negInv;
private final long r2;
private ModArithmeticMontgomery(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;
}
long r = (1l << 32) % mod;
this.negInv = inv;
this.r2 = (r * r) % mod;
}
private int generate(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
int remainder(long value) {
return generate((value %= mod) < 0 ? value + mod : value);
}
@Override
int mul(int a, int b) {
return reduce((long) a * b);
}
@Override
int inv(int a) {
return super.inv(reduce(a));
}
@Override
int pow(int a, long b) {
return generate(super.pow(a, b));
}
}
private static final class ModArithmeticBarrett extends ModArithmeticDynamic {
private static final long mask = 0xffff_ffffl;
private final long mh;
private final long ml;
private ModArithmeticBarrett(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)
*/
long a = (1l << 32) / mod;
long b = (1l << 32) % mod;
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
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
@Override
int mul(int a, int b) {
return reduce((long) a * b);
}
}
private static class ModArithmeticDynamic extends ModArithmetic {
final int mod;
ModArithmeticDynamic(int mod) {
this.mod = mod;
}
int mod() {
return mod;
}
int remainder(long value) {
return (int) ((value %= mod) < 0 ? value + mod : value);
}
int add(int a, int b) {
int sum = a + b;
return sum >= mod ? sum - mod : sum;
}
int sub(int a, int b) {
int sum = a - b;
return sum < 0 ? sum + mod : sum;
}
int mul(int a, int b) {
return (int) (((long) a * b) % mod);
}
}
}
}
class SCC {
static class Edge {
int from, to;
public Edge(int from, 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(int n) {
this.n = n;
this.unorderedEdges = new java.util.ArrayList<>();
this.start = new int[n + 1];
this.ids = new int[n];
}
public void addEdge(int from, int to) {
rangeCheck(from);
rangeCheck(to);
unorderedEdges.add(new Edge(from, to));
start[from + 1]++;
this.m++;
}
public int id(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];
}
Edge[] orderedEdges = new Edge[m];
int[] count = new int[n + 1];
System.arraycopy(start, 0, count, 0, n + 1);
for (Edge e : unorderedEdges) {
orderedEdges[count[e.from]++] = e;
}
int nowOrd = 0;
int groupNum = 0;
int k = 0;
// parent
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);
// u = lower32(stack[i]) : visiting vertex
// j = upper32(stack[i]) : jth child
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
long p = stack[--ptr];
// vertex
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
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) {
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
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];
}
int[] counts = new int[groupNum];
for (int x : ids) counts[x]++;
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++) {
int cmp = ids[i];
groups[cmp][--counts[cmp]] = i;
}
hasBuilt = true;
return groups;
}
private void rangeCheck(int i) {
if (i < 0 || i >= n) {
throw new IndexOutOfBoundsException(
String.format("Index %d out of bounds for length %d", i, n)
);
}
}
}
class Permutation implements java.util.Iterator<int[]>, Iterable<int[]> {
private int[] next;
public Permutation(int n) {
next = java.util.stream.IntStream.range(0, n).toArray();
}
@Override
public boolean hasNext() {
return next != null;
}
@Override
public int[] next() {
int[] r = next.clone();
next = nextPermutation(next);
return r;
}
@Override
public java.util.Iterator<int[]> iterator() {
return this;
}
public static int[] nextPermutation(int[] a) {
if (a == null || a.length < 2)
return null;
int p = 0;
for (int i = a.length - 2; i >= 0; i--) {
if (a[i] >= a[i + 1])
continue;
p = i;
break;
}
int q = 0;
for (int i = a.length - 1; i > p; i--) {
if (a[i] <= a[p])
continue;
q = i;
break;
}
if (p == 0 && q == 0)
return null;
int temp = a[p];
a[p] = a[q];
a[q] = temp;
int l = p, r = a.length;
while (++l < --r) {
temp = a[l];
a[l] = a[r];
a[r] = temp;
}
return a;
}
}
class Combination {
int n, r;
List<List<Integer>> index = null;
public Combination(int n, int r) {
this.n = n;
this.r = r;
}
public List<List<Integer>> getCombination() {
if (index != null) return index;
List<Integer> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
list.add(i);
}
index = make(list, r);
return index;
}
public long getSize() {
long result = 1;
for (int i = 1; i <= r; i++) {
result = result * (n - i + 1) / i;
}
return result;
}
private static List<List<Integer>> make (List<Integer> candidate, int r) {
if (candidate.size() < r || candidate.isEmpty() || r <= 0) {
List<List<Integer>> empty = new ArrayList<>();
empty.add(new ArrayList<>());
return empty;
}
List<List<Integer>> combination = new ArrayList<>();
for (int i = 0; i <= candidate.size() - r; i++) {
Integer picked = candidate.get(i);
List<Integer> rest = new ArrayList<>(candidate);
rest.subList(0, i + 1).clear();
combination.addAll(make(rest, r - 1).stream().peek(list -> list.add(0, picked)).toList());
}
return combination;
}
}
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)
);
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
public String toDetailedString() {
return toDetailedString(1, 0);
}
private String toDetailedString(int k, int sp) {
if (k >= N) return indent(sp) + data[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent);
s += "\n";
s += indent(sp) + data[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(data[i + N]);
if (i < N - 1) sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
class Pair<S extends Comparable<S>, T extends Comparable<T>> implements Comparable<Pair<S,T>>{
S first;
T second;
public Pair(S s, T t){
first = s;
second = t;
}
public S getFirst(){return first;}
public T getSecond(){return second;}
public boolean equals(Object another){
if(this==another) return true;
if(!(another instanceof Pair)) return false;
Pair otherPair = (Pair)another;
return this.first.equals(otherPair.first) && this.second.equals(otherPair.second);
}
public int compareTo(Pair<S,T> another){
java.util.Comparator<Pair<S,T>> comp1 = java.util.Comparator.comparing(Pair::getFirst);
java.util.Comparator<Pair<S,T>> comp2 = comp1.thenComparing(Pair::getSecond);
return comp2.compare(this, another);
}
public int hashCode(){
return first.hashCode() * 10007 + second.hashCode();
}
public String toString(){
return String.format("(%s, %s)", first, second);
}
}
class FenwickTree{
private int _n;
private long[] data;
public FenwickTree(int n){
this._n = n;
data = new long[n];
}
/**
* @verified https://atcoder.jp/contests/practice2/tasks/practice2_b
* @submission https://atcoder.jp/contests/practice2/submissions/16580495
*/
public FenwickTree(long[] data) {
this(data.length);
build(data);
}
public void set(int p, long x){
add(p, x - get(p));
}
public void add(int p, long x){
assert(0<=p && p<_n);
p++;
while(p<=_n){
data[p-1] += x;
p += p&-p;
}
}
public long sum(int l, int r){
assert(0<=l && l<=r && r<=_n);
return sum(r)-sum(l);
}
public long get(int p){
return sum(p, p+1);
}
private long sum(int r){
long s = 0;
while(r>0){
s += data[r-1];
r -= r&-r;
}
return s;
}
private void build(long[] dat) {
System.arraycopy(dat, 0, data, 0, _n);
for (int i=1; i<=_n; i++) {
int p = i+(i&-i);
if(p<=_n){
data[p-1] += data[i-1];
}
}
}
}
class LazySegTree<S, F> {
final int MAX;
final int N;
final int Log;
final java.util.function.BinaryOperator<S> Op;
final S E;
final java.util.function.BiFunction<F, S, S> Mapping;
final java.util.function.BinaryOperator<F> Composition;
final F Id;
final S[] Dat;
final F[] Laz;
@SuppressWarnings("unchecked")
public LazySegTree(int n, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this.MAX = n;
int k = 1;
while (k < n) k <<= 1;
this.N = k;
this.Log = Integer.numberOfTrailingZeros(N);
this.Op = op;
this.E = e;
this.Mapping = mapping;
this.Composition = composition;
this.Id = id;
this.Dat = (S[]) new Object[N << 1];
this.Laz = (F[]) new Object[N];
java.util.Arrays.fill(Dat, E);
java.util.Arrays.fill(Laz, Id);
}
public LazySegTree(S[] dat, java.util.function.BinaryOperator<S> op, S e, java.util.function.BiFunction<F, S, S> mapping, java.util.function.BinaryOperator<F> composition, F id) {
this(dat.length, op, e, mapping, composition, id);
build(dat);
}
private void build(S[] dat) {
int l = dat.length;
System.arraycopy(dat, 0, Dat, N, l);
for (int i = N - 1; i > 0; i--) {
Dat[i] = Op.apply(Dat[i << 1 | 0], Dat[i << 1 | 1]);
}
}
private void push(int k) {
if (Laz[k] == Id) return;
int lk = k << 1 | 0, rk = k << 1 | 1;
Dat[lk] = Mapping.apply(Laz[k], Dat[lk]);
Dat[rk] = Mapping.apply(Laz[k], Dat[rk]);
if (lk < N) Laz[lk] = Composition.apply(Laz[k], Laz[lk]);
if (rk < N) Laz[rk] = Composition.apply(Laz[k], Laz[rk]);
Laz[k] = Id;
}
private void pushTo(int k) {
for (int i = Log; i > 0; i--) push(k >> i);
}
private void pushTo(int lk, int rk) {
for (int i = Log; i > 0; i--) {
if (((lk >> i) << i) != lk) push(lk >> i);
if (((rk >> i) << i) != rk) push(rk >> i);
}
}
private void updateFrom(int k) {
k >>= 1;
while (k > 0) {
Dat[k] = Op.apply(Dat[k << 1 | 0], Dat[k << 1 | 1]);
k >>= 1;
}
}
private void updateFrom(int lk, int rk) {
for (int i = 1; i <= Log; i++) {
if (((lk >> i) << i) != lk) {
int lki = lk >> i;
Dat[lki] = Op.apply(Dat[lki << 1 | 0], Dat[lki << 1 | 1]);
}
if (((rk >> i) << i) != rk) {
int rki = (rk - 1) >> i;
Dat[rki] = Op.apply(Dat[rki << 1 | 0], Dat[rki << 1 | 1]);
}
}
}
public void set(int p, S x) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = x;
updateFrom(p);
}
public S get(int p) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
return Dat[p];
}
public S prod(int l, int r) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r)
);
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return E;
l += N; r += N;
pushTo(l, r);
S sumLeft = E, sumRight = E;
while (l < r) {
if ((l & 1) == 1) sumLeft = Op.apply(sumLeft, Dat[l++]);
if ((r & 1) == 1) sumRight = Op.apply(Dat[--r], sumRight);
l >>= 1; r >>= 1;
}
return Op.apply(sumLeft, sumRight);
}
public S allProd() {
return Dat[1];
}
public void apply(int p, F f) {
exclusiveRangeCheck(p);
p += N;
pushTo(p);
Dat[p] = Mapping.apply(f, Dat[p]);
updateFrom(p);
}
public void apply(int l, int r, F f) {
if (l > r) {
throw new IllegalArgumentException(
String.format("Invalid range: [%d, %d)", l, r)
);
}
inclusiveRangeCheck(l);
inclusiveRangeCheck(r);
if (l == r) return;
l += N; r += N;
pushTo(l, r);
for (int l2 = l, r2 = r; l2 < r2;) {
if ((l2 & 1) == 1) {
Dat[l2] = Mapping.apply(f, Dat[l2]);
if (l2 < N) Laz[l2] = Composition.apply(f, Laz[l2]);
l2++;
}
if ((r2 & 1) == 1) {
r2--;
Dat[r2] = Mapping.apply(f, Dat[r2]);
if (r2 < N) Laz[r2] = Composition.apply(f, Laz[r2]);
}
l2 >>= 1; r2 >>= 1;
}
updateFrom(l, r);
}
public int maxRight(int l, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(l);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (l == MAX) return MAX;
l += N;
pushTo(l);
S sum = E;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!g.test(Op.apply(sum, Dat[l]))) {
while (l < N) {
push(l);
l = l << 1;
if (g.test(Op.apply(sum, Dat[l]))) {
sum = Op.apply(sum, Dat[l]);
l++;
}
}
return l - N;
}
sum = Op.apply(sum, Dat[l]);
l++;
} while ((l & -l) != l);
return MAX;
}
public int minLeft(int r, java.util.function.Predicate<S> g) {
inclusiveRangeCheck(r);
if (!g.test(E)) {
throw new IllegalArgumentException("Identity element must satisfy the condition.");
}
if (r == 0) return 0;
r += N;
pushTo(r - 1);
S sum = E;
do {
r--;
while (r > 1 && (r & 1) == 1) r >>= 1;
if (!g.test(Op.apply(Dat[r], sum))) {
while (r < N) {
push(r);
r = r << 1 | 1;
if (g.test(Op.apply(Dat[r], sum))) {
sum = Op.apply(Dat[r], sum);
r--;
}
}
return r + 1 - N;
}
sum = Op.apply(Dat[r], sum);
} while ((r & -r) != r);
return 0;
}
private void exclusiveRangeCheck(int p) {
if (p < 0 || p >= MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d).", p, 0, MAX)
);
}
}
private void inclusiveRangeCheck(int p) {
if (p < 0 || p > MAX) {
throw new IndexOutOfBoundsException(
String.format("Index %d is not in [%d, %d].", p, 0, MAX)
);
}
}
// **************** DEBUG **************** //
private int indent = 6;
public void setIndent(int newIndent) {
this.indent = newIndent;
}
@Override
public String toString() {
return toSimpleString();
}
private S[] simulatePushAll() {
S[] simDat = java.util.Arrays.copyOf(Dat, 2 * N);
F[] simLaz = java.util.Arrays.copyOf(Laz, 2 * N);
for (int k = 1; k < N; k++) {
if (simLaz[k] == Id) continue;
int lk = k << 1 | 0, rk = k << 1 | 1;
simDat[lk] = Mapping.apply(simLaz[k], simDat[lk]);
simDat[rk] = Mapping.apply(simLaz[k], simDat[rk]);
if (lk < N) simLaz[lk] = Composition.apply(simLaz[k], simLaz[lk]);
if (rk < N) simLaz[rk] = Composition.apply(simLaz[k], simLaz[rk]);
simLaz[k] = Id;
}
return simDat;
}
public String toDetailedString() {
return toDetailedString(1, 0, simulatePushAll());
}
private String toDetailedString(int k, int sp, S[] dat) {
if (k >= N) return indent(sp) + dat[k];
String s = "";
s += toDetailedString(k << 1 | 1, sp + indent, dat);
s += "\n";
s += indent(sp) + dat[k];
s += "\n";
s += toDetailedString(k << 1 | 0, sp + indent, dat);
return s;
}
private static String indent(int n) {
StringBuilder sb = new StringBuilder();
while (n --> 0) sb.append(' ');
return sb.toString();
}
public String toSimpleString() {
S[] dat = simulatePushAll();
StringBuilder sb = new StringBuilder();
sb.append('[');
for (int i = 0; i < N; i++) {
sb.append(dat[i + N]);
if (i < N - 1) sb.append(',').append(' ');
}
sb.append(']');
return sb.toString();
}
}
|
ConDefects/ConDefects/Code/abc356_e/Java/54129172
|
condefects-java_data_1706
|
//package atcoder.abc345;
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 int n, h, w;
static int[][] tiles;
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
n = in.nextInt();
h = in.nextInt();
w = in.nextInt();
tiles = new int[n][];
for(int i = 0; i < n; i++) {
tiles[i] = in.nextIntArrayPrimitive(2);
}
boolean ans = false;
for(int i = 1; i < (1 << n) && !ans; i++) {
List<Integer> p = new ArrayList<>();
for(int j = 0; j < n; j++) {
if((i & (1 << j)) != 0) {
p.add(j);
}
}
// if(p.size() == 3 && p.get(0) == 1 && p.get(1) == 3 && p.get(2) == 4) {
// out.println();
// }
boolean[][] g = new boolean[h][w];
ans = compute(g, p, 0);
//try the very first permutation
if(!ans) {
while(next_permutation(p)) {
g = new boolean[h][w];
ans |= compute(g, p, 0);
if(ans) {
break;
}
}
}
}
out.println(ans ? "Yes" : "No");
}
out.close();
}
static boolean compute(boolean[][] g, List<Integer> p, int idx) {
int r = -1, c = -1;
for(int i = 0; i < h; i++) {
for(int j = 0;j < w; j++) {
if(!g[i][j]) {
r = i;
c = j;
break;
}
}
if(r >= 0) {
break;
}
}
if(r < 0) {
return true;
}
else if(idx >= p.size()) {
return false;
}
boolean ans = false;
int x = tiles[p.get(idx)][0], y = tiles[p.get(idx)][1];
if(placeTile(g, r, c, x, y)) {
ans |= compute(g, p, idx + 1);
backtrack(g, r, c, x, y);
}
if(!ans && x != y && placeTile(g, r, c, y, x)) {
ans |= compute(g, p, idx + 1);
backtrack(g, r, c, y, x);
}
return ans;
}
static boolean placeTile(boolean[][] g, int r, int c, int x, int y) {
if(r + x > g.length || c + y > g[0].length) {
return false;
}
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
if(g[r][c]) {
return false;
}
}
}
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
g[i][j] = true;
}
}
return true;
}
static void backtrack(boolean[][] g, int r, int c, int x, int y) {
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
g[i][j] = false;
}
}
}
static boolean next_permutation(List<Integer> p) {
for (int a = p.size() - 2; a >= 0; --a)
if (p.get(a) < p.get(a + 1))
for (int b = p.size() - 1;; --b)
if (p.get(b) > p.get(a)) {
int t = p.get(a);
p.set(a, p.get(b));
p.set(b, t);
for (++a, b = p.size() - 1; a < b; ++a, --b) {
t = p.get(a);
p.set(a, p.get(b));
p.set(b, t);
}
return true;
}
return false;
}
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.abc345;
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 int n, h, w;
static int[][] tiles;
static void solve(int testCnt) {
for (int testNumber = 0; testNumber < testCnt; testNumber++) {
n = in.nextInt();
h = in.nextInt();
w = in.nextInt();
tiles = new int[n][];
for(int i = 0; i < n; i++) {
tiles[i] = in.nextIntArrayPrimitive(2);
}
boolean ans = false;
for(int i = 1; i < (1 << n) && !ans; i++) {
List<Integer> p = new ArrayList<>();
for(int j = 0; j < n; j++) {
if((i & (1 << j)) != 0) {
p.add(j);
}
}
// if(p.size() == 3 && p.get(0) == 1 && p.get(1) == 3 && p.get(2) == 4) {
// out.println();
// }
boolean[][] g = new boolean[h][w];
ans = compute(g, p, 0);
//try the very first permutation
if(!ans) {
while(next_permutation(p)) {
g = new boolean[h][w];
ans |= compute(g, p, 0);
if(ans) {
break;
}
}
}
}
out.println(ans ? "Yes" : "No");
}
out.close();
}
static boolean compute(boolean[][] g, List<Integer> p, int idx) {
int r = -1, c = -1;
for(int i = 0; i < h; i++) {
for(int j = 0;j < w; j++) {
if(!g[i][j]) {
r = i;
c = j;
break;
}
}
if(r >= 0) {
break;
}
}
if(r < 0) {
return true;
}
else if(idx >= p.size()) {
return false;
}
boolean ans = false;
int x = tiles[p.get(idx)][0], y = tiles[p.get(idx)][1];
if(placeTile(g, r, c, x, y)) {
ans |= compute(g, p, idx + 1);
backtrack(g, r, c, x, y);
}
if(!ans && x != y && placeTile(g, r, c, y, x)) {
ans |= compute(g, p, idx + 1);
backtrack(g, r, c, y, x);
}
return ans;
}
static boolean placeTile(boolean[][] g, int r, int c, int x, int y) {
if(r + x > g.length || c + y > g[0].length) {
return false;
}
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
if(g[i][j]) {
return false;
}
}
}
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
g[i][j] = true;
}
}
return true;
}
static void backtrack(boolean[][] g, int r, int c, int x, int y) {
for(int i = r; i < r + x; i++) {
for(int j = c; j < c + y; j++) {
g[i][j] = false;
}
}
}
static boolean next_permutation(List<Integer> p) {
for (int a = p.size() - 2; a >= 0; --a)
if (p.get(a) < p.get(a + 1))
for (int b = p.size() - 1;; --b)
if (p.get(b) > p.get(a)) {
int t = p.get(a);
p.set(a, p.get(b));
p.set(b, t);
for (++a, b = p.size() - 1; a < b; ++a, --b) {
t = p.get(a);
p.set(a, p.get(b));
p.set(b, t);
}
return true;
}
return false;
}
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/abc345_d/Java/51622126
|
condefects-java_data_1707
|
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
//
int[][] result = new int[n+1][n+1];
// R→D→L→Uの順番
char dir = 'R';
int max = n * n-1;
// X軸の進行方向
// R→D→L→Uの順番
int[] xDir = new int[4];
// Y軸の進行方向
// R→D→L→Uの順番
int[] yDir = new int[4];
// R方向
xDir[0] = 0;
yDir[0] = 1;
// D方向
xDir[1] = 1;
yDir[1] = 0;
// L方向
xDir[2] = 0;
yDir[2] = -1;
// U方向
xDir[3] = -1;
yDir[3] = 0;
// 今の方向 Rスタート
int tmpDir = 0;
// (1,2)スタートにする。
int x = 1;
int y = 1;
// 最初だけ入れておく
result[1][1] = 1;
// 今の大きさ
int tmp = 2;
while(tmp <= max){
// System.out.println(tmp);
// System.out.println(x + " " + y);
// 次の場所を見る
int nextX =x + xDir[tmpDir];
int nextY =y + yDir[tmpDir];
if(nextX > 0 && nextX <= n && nextY > 0 && nextY <= n && result[nextX][nextY] == 0){
// 次に進める時は方向を変えない
}else{
// 次に進めない時は方向を変える
tmpDir = (tmpDir + 1) % 4;
}
x += xDir[tmpDir];
y += yDir[tmpDir];
result[x][y] = tmp;
tmp++;
}
for(int i = 1;i <= n;i++){
for(int j = 1;j<= n;j++){
if(i == (n+1)/2 && j == (n+1)/2){
System.out.print("D" + " ");
}else{
System.out.print(result[i][j] + " ");
}
}
System.out.println("");
}
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
//
int[][] result = new int[n+1][n+1];
// R→D→L→Uの順番
char dir = 'R';
int max = n * n-1;
// X軸の進行方向
// R→D→L→Uの順番
int[] xDir = new int[4];
// Y軸の進行方向
// R→D→L→Uの順番
int[] yDir = new int[4];
// R方向
xDir[0] = 0;
yDir[0] = 1;
// D方向
xDir[1] = 1;
yDir[1] = 0;
// L方向
xDir[2] = 0;
yDir[2] = -1;
// U方向
xDir[3] = -1;
yDir[3] = 0;
// 今の方向 Rスタート
int tmpDir = 0;
// (1,2)スタートにする。
int x = 1;
int y = 1;
// 最初だけ入れておく
result[1][1] = 1;
// 今の大きさ
int tmp = 2;
while(tmp <= max){
// System.out.println(tmp);
// System.out.println(x + " " + y);
// 次の場所を見る
int nextX =x + xDir[tmpDir];
int nextY =y + yDir[tmpDir];
if(nextX > 0 && nextX <= n && nextY > 0 && nextY <= n && result[nextX][nextY] == 0){
// 次に進める時は方向を変えない
}else{
// 次に進めない時は方向を変える
tmpDir = (tmpDir + 1) % 4;
}
x += xDir[tmpDir];
y += yDir[tmpDir];
result[x][y] = tmp;
tmp++;
}
for(int i = 1;i <= n;i++){
for(int j = 1;j<= n;j++){
if(i == (n+1)/2 && j == (n+1)/2){
System.out.print("T" + " ");
}else{
System.out.print(result[i][j] + " ");
}
}
System.out.println("");
}
}
}
|
ConDefects/ConDefects/Code/abc335_d/Java/49150512
|
condefects-java_data_1708
|
import java.io.*;
import java.util.*;
class Main {
int N, M, L;
int[][] a, b;
Set<Long> cd;
static final long X = 1000000001L;
class Elem implements Comparable<Elem> {
static Comparator<Elem> c = Comparator.comparingInt((Elem e) -> e.getValue()).thenComparingInt(e -> e.a).thenComparingInt(e -> e.b);
int a, b;
Elem(int a0, int b0) { this.a = a0; this.b = b0; }
final int getValue() { return Main.this.a[a][0] + Main.this.b[b][0]; }
public int compareTo(Elem e) {
return c.compare(this, e);
}
public boolean equals(Object o) {
if (o instanceof Elem e) return a == e.a && b == e.b;
return false;
}
}
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1]; L = ns[2];
var A = nextInts();
a = new int[N][];
Arrays.setAll(a, i -> new int[] {A[i], i});
Arrays.sort(a, Comparator.comparingInt(a -> a[0]));
var B = nextInts();
b = new int[M][];
Arrays.setAll(b, i -> new int[] {B[i], i});
Arrays.sort(b, Comparator.comparingInt(b -> b[0]));
for (int i = 0; i < N; i++) A[a[i][1]] = i;
for (int i = 0; i < M; i++) B[b[i][1]] = i;
cd = new HashSet<>();
for (int i = 0; i < L; i++) {
int[] cd0 = nextInts();
cd.add(A[cd0[0] - 1] * X + B[cd0[1] - 1]);
}
System.out.println(solve());
}
int solve() {
TreeSet<Elem> ts = new TreeSet<>();
ts.add(new Elem(N-1, M-1));
for (int i = 0; i < 100000; i++) {
Elem e = ts.pollLast();
if (!cd.contains(e.a * X + e.b)) return e.getValue();
if (e.a > 0) ts.add(new Elem(e.a - 1, e.b));
if (e.b > 0) ts.add(new Elem(e.a, e.b - 1));
}
return -1;
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
import java.io.*;
import java.util.*;
class Main {
int N, M, L;
int[][] a, b;
Set<Long> cd;
static final long X = 1000000001L;
class Elem implements Comparable<Elem> {
static Comparator<Elem> c = Comparator.comparingInt((Elem e) -> e.getValue()).thenComparingInt(e -> e.a).thenComparingInt(e -> e.b);
int a, b;
Elem(int a0, int b0) { this.a = a0; this.b = b0; }
final int getValue() { return Main.this.a[a][0] + Main.this.b[b][0]; }
public int compareTo(Elem e) {
return c.compare(this, e);
}
public boolean equals(Object o) {
if (o instanceof Elem e) return a == e.a && b == e.b;
return false;
}
}
void calc() {
int[] ns = nextInts();
N = ns[0]; M = ns[1]; L = ns[2];
var A = nextInts();
a = new int[N][];
Arrays.setAll(a, i -> new int[] {A[i], i});
Arrays.sort(a, Comparator.comparingInt(a -> a[0]));
var B = nextInts();
b = new int[M][];
Arrays.setAll(b, i -> new int[] {B[i], i});
Arrays.sort(b, Comparator.comparingInt(b -> b[0]));
for (int i = 0; i < N; i++) A[a[i][1]] = i;
for (int i = 0; i < M; i++) B[b[i][1]] = i;
cd = new HashSet<>();
for (int i = 0; i < L; i++) {
int[] cd0 = nextInts();
cd.add(A[cd0[0] - 1] * X + B[cd0[1] - 1]);
}
System.out.println(solve());
}
int solve() {
TreeSet<Elem> ts = new TreeSet<>();
ts.add(new Elem(N-1, M-1));
for (int i = 0; i < 100001; i++) {
Elem e = ts.pollLast();
if (!cd.contains(e.a * X + e.b)) return e.getValue();
if (e.a > 0) ts.add(new Elem(e.a - 1, e.b));
if (e.b > 0) ts.add(new Elem(e.a, e.b - 1));
}
return -1;
}
// ---
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String next() { try { return br.readLine(); } catch (Exception e) { return null; } }
String[] nexts() { return next().split(" "); }
static int i(String s) { return Integer.parseInt(s); }
int nextInt() { return i(next()); }
int[] nextInts() { return Arrays.stream(nexts()).mapToInt(Main::i).toArray(); }
public static void main(String[] args) {
new Main().calc();
}
}
|
ConDefects/ConDefects/Code/abc331_e/Java/48647335
|
condefects-java_data_1709
|
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static StreamTokenizer stmInput = new StreamTokenizer(br);
static class Pair{
boolean flag;
int idx, e;
public Pair(boolean flag, int idx, int e){
this.flag = flag;
this.idx = idx;
this.e = e;
}
}
static int N = 100010, M = 200010;
static Pair a[] = new Pair[N], b[] = new Pair[N];
static Pair s[] = new Pair[M];
static long s1[] = new long[M], s2[] = new long[M];
static HashMap<Integer, HashSet<Integer>> map = new HashMap<>();
static int n, m, k;
public static int readInt() throws IOException{
stmInput.nextToken();
return (int) stmInput.nval;
}
public static void solve() throws IOException{
n = readInt();
m = readInt();
k = readInt();
int idx = 0;
for(int i = 1; i <= n; i++) {
a[i] = new Pair(true, i, readInt());
s[++idx] = a[i];
}
for(int i = 1; i <= m; i++) {
b[i] = new Pair(false, i, readInt());
s[++idx] = b[i];
}
for(int i = 0; i < k; i++) {
int c = readInt(), d = readInt();
if (map.get(c) == null) map.put(c, new HashSet<>());
map.get(c).add(d);
}
Arrays.sort(s, 1, n + m + 1, (x, y) -> { return y.e - x.e;});
for(int i = 1; i <= n + m; i++){
s1[i] = s1[i - 1] + (s[i].flag ? 1 : 0);
s2[i] = s2[i - 1] + (s[i].flag ? 0 : 1);
}
int l = 1, r = n + m;
while (l < r){
int mid = l + r >> 1;
if (s1[mid] * s2[mid] > k) r = mid;
else l = mid + 1;
}
int rmax = Math.min(r + 100, n + m);
int ans = 0;
List<Pair> la = new ArrayList<>(), lb = new ArrayList<>();
for (int i = 1; i <= rmax; i++){
if (s[i].flag) la.add(s[i]);
else lb.add(s[i]);
}
for (Pair ea : la){
for (Pair eb : lb){
if (map.get(ea.idx) == null || !map.get(ea.idx).contains(eb.idx)) ans = Math.max(ans, ea.e + eb.e);
}
}
pw.println(ans);
}
public static void main(String[] args) throws IOException {
int T = 1;
while(T-- != 0){
solve();
}
pw.flush();
pw.close();
br.close();
}
}
import java.io.*;
import java.util.*;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static StreamTokenizer stmInput = new StreamTokenizer(br);
static class Pair{
boolean flag;
int idx, e;
public Pair(boolean flag, int idx, int e){
this.flag = flag;
this.idx = idx;
this.e = e;
}
}
static int N = 100010, M = 200010;
static Pair a[] = new Pair[N], b[] = new Pair[N];
static Pair s[] = new Pair[M];
static long s1[] = new long[M], s2[] = new long[M];
static HashMap<Integer, HashSet<Integer>> map = new HashMap<>();
static int n, m, k;
public static int readInt() throws IOException{
stmInput.nextToken();
return (int) stmInput.nval;
}
public static void solve() throws IOException{
n = readInt();
m = readInt();
k = readInt();
int idx = 0;
for(int i = 1; i <= n; i++) {
a[i] = new Pair(true, i, readInt());
s[++idx] = a[i];
}
for(int i = 1; i <= m; i++) {
b[i] = new Pair(false, i, readInt());
s[++idx] = b[i];
}
for(int i = 0; i < k; i++) {
int c = readInt(), d = readInt();
if (map.get(c) == null) map.put(c, new HashSet<>());
map.get(c).add(d);
}
Arrays.sort(s, 1, n + m + 1, (x, y) -> { return y.e - x.e;});
for(int i = 1; i <= n + m; i++){
s1[i] = s1[i - 1] + (s[i].flag ? 1 : 0);
s2[i] = s2[i - 1] + (s[i].flag ? 0 : 1);
}
int l = 1, r = n + m;
while (l < r){
int mid = l + r >> 1;
if (s1[mid] * s2[mid] > k) r = mid;
else l = mid + 1;
}
int rmax = Math.min(r + 500, n + m);
int ans = 0;
List<Pair> la = new ArrayList<>(), lb = new ArrayList<>();
for (int i = 1; i <= rmax; i++){
if (s[i].flag) la.add(s[i]);
else lb.add(s[i]);
}
for (Pair ea : la){
for (Pair eb : lb){
if (map.get(ea.idx) == null || !map.get(ea.idx).contains(eb.idx)) ans = Math.max(ans, ea.e + eb.e);
}
}
pw.println(ans);
}
public static void main(String[] args) throws IOException {
int T = 1;
while(T-- != 0){
solve();
}
pw.flush();
pw.close();
br.close();
}
}
|
ConDefects/ConDefects/Code/abc331_e/Java/48167391
|
condefects-java_data_1710
|
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter printWriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer stn = new StreamTokenizer(bf);
static Scanner sc = new Scanner(System.in);
static Utils utils = new Utils();
public static void main(String[] args) throws IOException {
// int o = readInt();
// while (o-- > 0)
solve();
closeAndFlush();
}
static class Pair {
int first, second;
// long first, second;
public Pair() {
}
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
// public Pair(long first, long 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 class Edge {
int to, pe;
public Edge() {
}
public Edge(int to, int pe) {
this.to = to;
this.pe = pe;
}
}
static int[] dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};//上右下左
static int inf = 1 << 30;
static int[] head;
static Edge[] edges;
public static void solve() throws IOException {
int n = readInt(), m = readInt(), L = readInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = readInt();
Pair[] b = new Pair[m];
for (int i = 0; i < m; i++) b[i] = new Pair(i, readInt());
Arrays.sort(b, (p, q) -> p.second - q.second);
Map<Integer, Set<Integer>> map = new HashMap<>();
for (int i = 0; i < L; i++) {
int c = readInt() - 1, d = readInt() - 1;
Set<Integer> set = map.getOrDefault(c, new HashSet<>());
set.add(d);
map.put(c, set);
}
Set.of();
long res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map.getOrDefault(i, new HashSet<>()).contains(b[j].first)) continue;
res = Math.max(res, a[i] + b[j].second);
break;
}
}
printWriter.println(res);
}
public static String readString() throws IOException {
return sc.next();
// return sc.nextLine();
// return bf.readLine();
}
public static String readStringPlus() throws IOException {
return (" " + readString());
}
public static int readInt() throws IOException {
// stn.nextToken();
// return (int) stn.nval;
return sc.nextInt();
// return Integer.parseInt(bf.readLine());
}
public static double readDouble() throws IOException {
return sc.nextDouble();
}
public static long readLong() throws IOException {
// stn.nextToken();
// return (long) stn.nval;
return sc.nextLong();
}
public static void closeAndFlush() throws IOException {
printWriter.flush();
printWriter.close();
sc.close();
bf.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 + 5];
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 + 5][m + 5];
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 + 5];
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 + 5][m + 5];
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 + 5];
for (int i = 1; i <= n; i++) {
strings[i] = " " + Main.readString();
}
return strings;
}
public static char[] nextCharArray(int n) throws IOException {
return (" " + Main.readString()).toCharArray();
}
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... arr) {
return Arrays.stream(arr).max().getAsInt();
}
public static long max(long[] arr) {
return Arrays.stream(arr).max().getAsLong();
}
public static int min(int... arr) {
return Arrays.stream(arr).min().getAsInt();
}
public static long min(long... arr) {
return Arrays.stream(arr).min().getAsLong();
}
}
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter printWriter = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer stn = new StreamTokenizer(bf);
static Scanner sc = new Scanner(System.in);
static Utils utils = new Utils();
public static void main(String[] args) throws IOException {
// int o = readInt();
// while (o-- > 0)
solve();
closeAndFlush();
}
static class Pair {
int first, second;
// long first, second;
public Pair() {
}
public Pair(int first, int second) {
this.first = first;
this.second = second;
}
// public Pair(long first, long 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 class Edge {
int to, pe;
public Edge() {
}
public Edge(int to, int pe) {
this.to = to;
this.pe = pe;
}
}
static int[] dx = {-1, 0, 1, 0}, dy = {0, 1, 0, -1};//上右下左
static int inf = 1 << 30;
static int[] head;
static Edge[] edges;
public static void solve() throws IOException {
int n = readInt(), m = readInt(), L = readInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = readInt();
Pair[] b = new Pair[m];
for (int i = 0; i < m; i++) b[i] = new Pair(i, readInt());
Arrays.sort(b, (p, q) -> q.second - p.second);
Map<Integer, Set<Integer>> map = new HashMap<>();
for (int i = 0; i < L; i++) {
int c = readInt() - 1, d = readInt() - 1;
Set<Integer> set = map.getOrDefault(c, new HashSet<>());
set.add(d);
map.put(c, set);
}
Set.of();
long res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map.getOrDefault(i, new HashSet<>()).contains(b[j].first)) continue;
res = Math.max(res, a[i] + b[j].second);
break;
}
}
printWriter.println(res);
}
public static String readString() throws IOException {
return sc.next();
// return sc.nextLine();
// return bf.readLine();
}
public static String readStringPlus() throws IOException {
return (" " + readString());
}
public static int readInt() throws IOException {
// stn.nextToken();
// return (int) stn.nval;
return sc.nextInt();
// return Integer.parseInt(bf.readLine());
}
public static double readDouble() throws IOException {
return sc.nextDouble();
}
public static long readLong() throws IOException {
// stn.nextToken();
// return (long) stn.nval;
return sc.nextLong();
}
public static void closeAndFlush() throws IOException {
printWriter.flush();
printWriter.close();
sc.close();
bf.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 + 5];
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 + 5][m + 5];
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 + 5];
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 + 5][m + 5];
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 + 5];
for (int i = 1; i <= n; i++) {
strings[i] = " " + Main.readString();
}
return strings;
}
public static char[] nextCharArray(int n) throws IOException {
return (" " + Main.readString()).toCharArray();
}
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... arr) {
return Arrays.stream(arr).max().getAsInt();
}
public static long max(long[] arr) {
return Arrays.stream(arr).max().getAsLong();
}
public static int min(int... arr) {
return Arrays.stream(arr).min().getAsInt();
}
public static long min(long... arr) {
return Arrays.stream(arr).min().getAsLong();
}
}
|
ConDefects/ConDefects/Code/abc331_e/Java/48148604
|
condefects-java_data_1711
|
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 n = Integer.parseInt(sc.next());
int q = Integer.parseInt(sc.next());
long cnt = 0;
int[] push = new int[n];
Arrays.fill(push, -1);
long[] sum = new long[q + 1];
long[] ans = new long[n];
for(int i = 0; i < q; i++) {
int x = Integer.parseInt(sc.next());
x--;
if(push[x] < 0) {
push[x] = i;
cnt++;
} else {
long v = sum[i] - push[x];
ans[x] += v;
push[x] = -1;
cnt--;
}
sum[i + 1] = sum[i] + cnt;
}
for(int i = 0; i < n; i++) {
if(push[i] >= 0) ans[i] += sum[q] - sum[push[i]];
}
StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; i++) sb.append(ans[i]).append(" ");
System.out.println(sb.toString());
}
}
}
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 n = Integer.parseInt(sc.next());
int q = Integer.parseInt(sc.next());
long cnt = 0;
int[] push = new int[n];
Arrays.fill(push, -1);
long[] sum = new long[q + 1];
long[] ans = new long[n];
for(int i = 0; i < q; i++) {
int x = Integer.parseInt(sc.next());
x--;
if(push[x] < 0) {
push[x] = i;
cnt++;
} else {
long v = sum[i] - sum[push[x]];
ans[x] += v;
push[x] = -1;
cnt--;
}
sum[i + 1] = sum[i] + cnt;
}
for(int i = 0; i < n; i++) {
if(push[i] >= 0) ans[i] += sum[q] - sum[push[i]];
}
StringBuilder sb = new StringBuilder();
for(int i = 0; i < n; i++) sb.append(ans[i]).append(" ");
System.out.println(sb.toString());
}
}
}
|
ConDefects/ConDefects/Code/abc347_e/Java/51900394
|
condefects-java_data_1712
|
import java.util.Scanner;
public class Main {
private static long[] s;
private static long getsum(int l, int r) {
return s[r] - s[l - 1];
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int q = in.nextInt();
int[] last = new int[n + 1];
int[] a = new int[n + 1];
s = new long[q + 1];
int now = 0;
for (int i = 1; i <= q; i++) {
int x = in.nextInt();
if (last[x] > 0) {
a[x] += getsum(last[x], i - 1);
last[x] = 0;
now--;
} else {
last[x] = i;
now++;
}
s[i] = s[i - 1] + now;
}
for (int i = 1; i <= n; i++)
if (last[i] > 0)
a[i] += getsum(last[i], q);
for (int i = 1; i <= n; i++)
System.out.printf("%d ", a[i]);
in.close();
}
}
import java.util.Scanner;
public class Main {
private static long[] s;
private static long getsum(int l, int r) {
return s[r] - s[l - 1];
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int q = in.nextInt();
int[] last = new int[n + 1];
long[] a = new long[n + 1];
s = new long[q + 1];
int now = 0;
for (int i = 1; i <= q; i++) {
int x = in.nextInt();
if (last[x] > 0) {
a[x] += getsum(last[x], i - 1);
last[x] = 0;
now--;
} else {
last[x] = i;
now++;
}
s[i] = s[i - 1] + now;
}
for (int i = 1; i <= n; i++)
if (last[i] > 0)
a[i] += getsum(last[i], q);
for (int i = 1; i <= n; i++)
System.out.printf("%d ", a[i]);
in.close();
}
}
|
ConDefects/ConDefects/Code/abc347_e/Java/51956121
|
condefects-java_data_1713
|
import java.util.*;
public class Main{
public static void main(String[]args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] a = new int[n];
int count = 0;
for(int i = 0;i > n;i ++){
a[i] = sc.nextInt();
count = count + a[i];
}
if(count == 0){
System.out.println(count);
}else{
System.out.println(-count);
}
}
}
import java.util.*;
public class Main{
public static void main(String[]args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int [] a = new int[n];
int count = 0;
for(int i = 0;i < (n - 1);i ++){
a[i] = sc.nextInt();
count = count + a[i];
}
if(count == 0){
System.out.println(count);
}else{
System.out.println(-count);
}
}
}
|
ConDefects/ConDefects/Code/abc349_a/Java/53465014
|
condefects-java_data_1714
|
import java.util.*;
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 - 1; i++) {
int a = sc.nextInt();
sum += a;
}
System.out.println(0 - sum);
sc.close();
}
}
import java.util.*;
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 - 1; i++) {
int a = sc.nextInt();
sum += a;
}
System.out.println(0 - sum);
sc.close();
}
}
|
ConDefects/ConDefects/Code/abc349_a/Java/53194962
|
condefects-java_data_1715
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < n - 1; i++) {
ans += a[i];
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
int ans = 0;
for (int i = 0; i < n - 1; i++) {
a[i] = sc.nextInt();
}
for (int i = 0; i < n - 1; i++) {
ans += a[i];
}
System.out.println(-1 * ans);
}
}
|
ConDefects/ConDefects/Code/abc349_a/Java/52957489
|
condefects-java_data_1716
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// inputA
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int A[] = new int[N-1];
Arrays.setAll(A, e -> Integer.parseInt(sc.next()));
int sum = Arrays.stream(A).sum();
System.out.println(Math.abs((int)sum));
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// inputA
Scanner sc = new Scanner(System.in);
int N = Integer.parseInt(sc.next());
int A[] = new int[N-1];
Arrays.setAll(A, e -> Integer.parseInt(sc.next()));
int sum = Arrays.stream(A).sum();
System.out.println(sum * (-1));
}
}
|
ConDefects/ConDefects/Code/abc349_a/Java/54728903
|
condefects-java_data_1717
|
import java.util.*;
import java.io.*;
public class Main {
static ContestScanner sc = new ContestScanner(System.in);
static ContestPrinter pw = new ContestPrinter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
static long inf = (long)1e18;
public static void solve() {
int N = sc.nextInt();
int H = sc.nextInt();
int[] d = new int[N+1];
for(int i = 1; i <= N; i++){
d[i] = sc.nextInt();
}
int[] p = new int[N];
int[] f = new int[N];
for(int i = 1; i < N; i++){
p[i] = sc.nextInt();
f[i] = sc.nextInt();
}
//j:往路,使用後 k:復路,使用前
long[][][] dp = new long[N+1][H+1][H+1];
for(int i = 0; i <= N; i++){
for(int j = 0; j <= H; j++){
Arrays.fill(dp[i][j],inf);
}
}
for(int k = 0; k <= H; k++){
dp[0][H][k] = 0;
}
for(int i = 0; i < N; i++){
int diff = d[i+1]-d[i];
for(int j = 0; j <= H; j++){
for(int k = 0; k <= H; k++){
if(dp[i][j][k] == inf) continue;
if(Math.min(j+f[i],H)-diff >= 0 && k+diff <= H){
dp[i+1][Math.min(j+f[i],H)-diff][k+diff] = Math.min(dp[i+1][Math.min(j+f[i],H)-diff][k+diff],dp[i][j][k]+p[i]);
}
if(j-diff >= 0 && k-f[i] >= 0){
if(k != H && k-f[i]+diff <= H){
dp[i+1][j-diff][k-f[i]+diff] = Math.min(dp[i+1][j-diff][k-f[i]+diff],dp[i][j][k]+p[i]);
}
if(k == H){
for(int kk = 0; kk <= f[i]; kk++){
dp[i+1][j-diff][Math.min(H,k-kk+diff)] = Math.min(dp[i+1][j-diff][Math.min(H,k-kk+diff)],dp[i][j][k]+p[i]);
}
}
}
if(j-diff >= 0 && k+diff <= H){
dp[i+1][j-diff][k+diff] = Math.min(dp[i+1][j-diff][k+diff],dp[i][j][k]);
}
}
}
}
long ans = inf;
int minF = d[N]-d[N-1];
for(int j = minF; j <= H; j++){
ans = Math.min(ans,dp[N][j][j]);
}
pw.println(ans == inf ? -1 : ans);
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends PrintWriter {
public ContestPrinter(PrintStream stream) {
super(stream);
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printlnArray(String[] array) {
for (String i : array)
super.println(i);
}
public void printSpace(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++) {
super.print(o[i]);
super.print(" ");
}
super.println(o[n]);
}
public void println(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.println(o[n]);
}
public void printYN(boolean o) {
super.println(o ? "Yes" : "No");
}
public void print(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.print(o[n]);
}
public void printArray(Object[] array) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(" ");
}
super.println(array[n]);
}
public void printlnArray(Object[] array) {
for (Object i : array)
super.println(i);
}
public void printArray(int[] array, String separator) {
int n = array.length - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(int[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(int[] array) {
for (int i : array)
super.println(i);
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n]));
}
public void printlnArray(int[] array, java.util.function.IntUnaryOperator map) {
for (int i : array)
super.println(map.applyAsInt(i));
}
public void printlnArray(long[] array, java.util.function.LongUnaryOperator map) {
for (long i : array)
super.println(map.applyAsLong(i));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(long[] array) {
this.printArray(array, " ");
}
public void printlnArray(long[] array) {
for (long i : array)
super.println(i);
}
public void printArray(double[] array) {
printArray(array, " ");
}
public void printArray(double[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(double[] array) {
for (double i : array)
super.println(i);
}
public void printArray(boolean[] array, String a, String b) {
int n = array.length - 1;
for (int i = 0; i < n; i++)
super.print((array[i] ? a : b) + " ");
super.println(array[n] ? a : b);
}
public void printArray(boolean[] array) {
this.printArray(array, "Y", "N");
}
public void printArray(char[] array) {
for (char c : array)
this.print(c);
this.println();
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(ArrayList<?> array) {
this.printArray(array, " ");
}
public void printArray(ArrayList<?> array, String separator) {
int n = array.size() - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array.get(i).toString());
super.print(separator);
}
super.println(array.get(n).toString());
}
public void printlnArray(ArrayList<?> array) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(array.get(i).toString());
}
public void printlnArray(ArrayList<Integer> array, java.util.function.IntUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsInt(array.get(i)));
}
public void printlnArray(ArrayList<Long> array, java.util.function.LongUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsLong(array.get(i)));
}
public void printArray(int[][] array) {
for (int[] a : array)
this.printArray(a);
}
public void printArray(int[][] array, java.util.function.IntUnaryOperator map) {
for (int[] a : array)
this.printArray(a, map);
}
public void printArray(long[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] + " ");
super.println(array[i][m]);
}
}
public void printArray(long[][] array, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
super.print(map.applyAsLong(array[i][j]));
super.print(" ");
}
super.println(map.applyAsLong(array[i][m]));
}
}
public void printArray(boolean[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] ? "○ " : "× ");
super.println(array[i][m] ? "○" : "×");
}
}
public void printArray(char[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j]);
super.println();
}
}
}
import java.util.*;
import java.io.*;
public class Main {
static ContestScanner sc = new ContestScanner(System.in);
static ContestPrinter pw = new ContestPrinter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
static long inf = (long)1e18;
public static void solve() {
int N = sc.nextInt();
int H = sc.nextInt();
int[] d = new int[N+1];
for(int i = 1; i <= N; i++){
d[i] = sc.nextInt();
}
int[] p = new int[N];
int[] f = new int[N];
for(int i = 1; i < N; i++){
p[i] = sc.nextInt();
f[i] = sc.nextInt();
}
//j:往路,使用後 k:復路,使用前
long[][][] dp = new long[N+1][H+1][H+1];
for(int i = 0; i <= N; i++){
for(int j = 0; j <= H; j++){
Arrays.fill(dp[i][j],inf);
}
}
for(int k = 0; k <= H; k++){
dp[0][H][k] = 0;
}
for(int i = 0; i < N; i++){
int diff = d[i+1]-d[i];
for(int j = 0; j <= H; j++){
for(int k = 0; k <= H; k++){
if(dp[i][j][k] == inf) continue;
if(Math.min(j+f[i],H)-diff >= 0 && k+diff <= H){
dp[i+1][Math.min(j+f[i],H)-diff][k+diff] = Math.min(dp[i+1][Math.min(j+f[i],H)-diff][k+diff],dp[i][j][k]+p[i]);
}
if(j-diff >= 0 && k-f[i] >= 0){
if(k != H && k-f[i]+diff <= H){
dp[i+1][j-diff][k-f[i]+diff] = Math.min(dp[i+1][j-diff][k-f[i]+diff],dp[i][j][k]+p[i]);
}
if(k == H){
for(int kk = diff; kk <= f[i]; kk++){
dp[i+1][j-diff][Math.min(H,k-kk+diff)] = Math.min(dp[i+1][j-diff][Math.min(H,k-kk+diff)],dp[i][j][k]+p[i]);
}
}
}
if(j-diff >= 0 && k+diff <= H){
dp[i+1][j-diff][k+diff] = Math.min(dp[i+1][j-diff][k+diff],dp[i][j][k]);
}
}
}
}
long ans = inf;
int minF = d[N]-d[N-1];
for(int j = minF; j <= H; j++){
ans = Math.min(ans,dp[N][j][j]);
}
pw.println(ans == inf ? -1 : ans);
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends PrintWriter {
public ContestPrinter(PrintStream stream) {
super(stream);
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printlnArray(String[] array) {
for (String i : array)
super.println(i);
}
public void printSpace(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++) {
super.print(o[i]);
super.print(" ");
}
super.println(o[n]);
}
public void println(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.println(o[n]);
}
public void printYN(boolean o) {
super.println(o ? "Yes" : "No");
}
public void print(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.print(o[n]);
}
public void printArray(Object[] array) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(" ");
}
super.println(array[n]);
}
public void printlnArray(Object[] array) {
for (Object i : array)
super.println(i);
}
public void printArray(int[] array, String separator) {
int n = array.length - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(int[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(int[] array) {
for (int i : array)
super.println(i);
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n]));
}
public void printlnArray(int[] array, java.util.function.IntUnaryOperator map) {
for (int i : array)
super.println(map.applyAsInt(i));
}
public void printlnArray(long[] array, java.util.function.LongUnaryOperator map) {
for (long i : array)
super.println(map.applyAsLong(i));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(long[] array) {
this.printArray(array, " ");
}
public void printlnArray(long[] array) {
for (long i : array)
super.println(i);
}
public void printArray(double[] array) {
printArray(array, " ");
}
public void printArray(double[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(double[] array) {
for (double i : array)
super.println(i);
}
public void printArray(boolean[] array, String a, String b) {
int n = array.length - 1;
for (int i = 0; i < n; i++)
super.print((array[i] ? a : b) + " ");
super.println(array[n] ? a : b);
}
public void printArray(boolean[] array) {
this.printArray(array, "Y", "N");
}
public void printArray(char[] array) {
for (char c : array)
this.print(c);
this.println();
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(ArrayList<?> array) {
this.printArray(array, " ");
}
public void printArray(ArrayList<?> array, String separator) {
int n = array.size() - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array.get(i).toString());
super.print(separator);
}
super.println(array.get(n).toString());
}
public void printlnArray(ArrayList<?> array) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(array.get(i).toString());
}
public void printlnArray(ArrayList<Integer> array, java.util.function.IntUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsInt(array.get(i)));
}
public void printlnArray(ArrayList<Long> array, java.util.function.LongUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsLong(array.get(i)));
}
public void printArray(int[][] array) {
for (int[] a : array)
this.printArray(a);
}
public void printArray(int[][] array, java.util.function.IntUnaryOperator map) {
for (int[] a : array)
this.printArray(a, map);
}
public void printArray(long[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] + " ");
super.println(array[i][m]);
}
}
public void printArray(long[][] array, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
super.print(map.applyAsLong(array[i][j]));
super.print(" ");
}
super.println(map.applyAsLong(array[i][m]));
}
}
public void printArray(boolean[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] ? "○ " : "× ");
super.println(array[i][m] ? "○" : "×");
}
}
public void printArray(char[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j]);
super.println();
}
}
}
|
ConDefects/ConDefects/Code/abc320_f/Java/45660664
|
condefects-java_data_1718
|
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
int n = in.nextInt();
int h = in.nextInt();
int[] dis = new int[n+1];
for (int i = 1; i <= n; i++) {
dis[i] = in.nextInt();
}
int[] p = new int[n];
int[] f = new int[n];
for (int i = 1; i < n; i++) {
p[i] = in.nextInt();
f[i] = in.nextInt();
}
int[][][] dp = new int[n+1][h+1][h+1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= h; j++) {
Arrays.fill(dp[i][j], Integer.MAX_VALUE);
}
}
Arrays.fill(dp[0][h], 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j <= h; j++) {
for (int k = 0; k <= h; k++) {
if (dp[i][j][k] == Integer.MAX_VALUE) continue;
int d = dis[i+1] - dis[i];
//不加油
if (j - d >= 0 && k + d <= h) {
dp[i+1][j-d][k+d] = Math.min(dp[i+1][j-d][k+d], dp[i][j][k]);
}
//去时加油
if (Math.min(h, j+f[i]) - d >= 0 && k + d <= h) {
dp[i+1][Math.min(h, j+f[i])-d][k+d] = Math.min(dp[i+1][Math.min(h, j+f[i])-d][k+d], dp[i][j][k]+p[i]);
}
/*
回时加油
设i+1处为x油
math.min(x - d + f[i], h) = k
k != h x - d + f[i]唯一？？
k = h x可以为多
k - f[i] + d = x
*/
if (j - d < 0) continue;
if (k < h) {
if (k - f[i] + d <= h && k - f[i] + d >= 0) {
dp[i+1][j-d][k-f[i]+d] = Math.min(dp[i+1][j-d][k-f[i]+d], dp[i][j][k]+p[i]);
}
}else {
for (int l = k - f[i] + d; l <= k; l++) {
dp[i+1][j-d][l] = Math.min(dp[i+1][j-d][l], dp[i][j][k]+p[i]);
}
}
}
}
}
int ans = Integer.MAX_VALUE;
for (int i = 1; i <= h; i++) {
ans = Math.min(ans, dp[n][i][i]);
}
if (ans == Integer.MAX_VALUE) out.println(-1);
else out.println(ans);
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
}
}
/*
0 : 1
1 : 2 3
2 : 4 5
3 : 6
0 : 2
1 : 1 4 5
2 : 6 3
3 :
size[2][1] = 4 5
dp[2] += (dp[1] - dp[0])
0
1 2
*/
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
int n = in.nextInt();
int h = in.nextInt();
int[] dis = new int[n+1];
for (int i = 1; i <= n; i++) {
dis[i] = in.nextInt();
}
int[] p = new int[n];
int[] f = new int[n];
for (int i = 1; i < n; i++) {
p[i] = in.nextInt();
f[i] = in.nextInt();
}
int[][][] dp = new int[n+1][h+1][h+1];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= h; j++) {
Arrays.fill(dp[i][j], Integer.MAX_VALUE);
}
}
Arrays.fill(dp[0][h], 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j <= h; j++) {
for (int k = 0; k <= h; k++) {
if (dp[i][j][k] == Integer.MAX_VALUE) continue;
int d = dis[i+1] - dis[i];
//不加油
if (j - d >= 0 && k + d <= h) {
dp[i+1][j-d][k+d] = Math.min(dp[i+1][j-d][k+d], dp[i][j][k]);
}
//去时加油
if (Math.min(h, j+f[i]) - d >= 0 && k + d <= h) {
dp[i+1][Math.min(h, j+f[i])-d][k+d] = Math.min(dp[i+1][Math.min(h, j+f[i])-d][k+d], dp[i][j][k]+p[i]);
}
/*
回时加油
设i+1处为x油
math.min(x - d + f[i], h) = k
k != h x - d + f[i]唯一？？
k = h x可以为多
k - f[i] + d = x
*/
if (j - d < 0) continue;
if (k < h) {
if (k - f[i] + d <= h && k - f[i] >= 0) {
dp[i+1][j-d][k-f[i]+d] = Math.min(dp[i+1][j-d][k-f[i]+d], dp[i][j][k]+p[i]);
}
}else {
for (int l = k - f[i] + d; l <= k; l++) {
dp[i+1][j-d][l] = Math.min(dp[i+1][j-d][l], dp[i][j][k]+p[i]);
}
}
}
}
}
int ans = Integer.MAX_VALUE;
for (int i = 1; i <= h; i++) {
ans = Math.min(ans, dp[n][i][i]);
}
if (ans == Integer.MAX_VALUE) out.println(-1);
else out.println(ans);
out.close();
}
static InputReader in = new InputReader();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static class InputReader {
private StringTokenizer st;
private BufferedReader bf;
public InputReader() {
bf = new BufferedReader(new InputStreamReader(System.in));
st = null;
}
public String next() throws IOException {
while (st == null || !st.hasMoreTokens()) {
st = new StringTokenizer(bf.readLine());
}
return st.nextToken();
}
public String nextLine() throws IOException {
return bf.readLine();
}
public int nextInt() throws IOException {
return Integer.parseInt(next());
}
public long nextLong() throws IOException {
return Long.parseLong(next());
}
public double nextDouble() throws IOException {
return Double.parseDouble(next());
}
}
}
/*
0 : 1
1 : 2 3
2 : 4 5
3 : 6
0 : 2
1 : 1 4 5
2 : 6 3
3 :
size[2][1] = 4 5
dp[2] += (dp[1] - dp[0])
0
1 2
*/
|
ConDefects/ConDefects/Code/abc320_f/Java/45963363
|
condefects-java_data_1719
|
// temprate
import java.util.*;
import static java.lang.Math.*;
public class Main{
public static void main(String[] args){
var in = new Scanner(System.in);
// ~~~
int N = in.nextInt();
var point = new ArrayList<List<Integer>>();
for ( int i = 0 ; N > i ; i++ ){
point.add( Arrays.asList( in.nextInt() , in.nextInt() ) );
}
double ans = 0;
for ( int i = 0 ; N > i ; i++ ){
for ( int j = N - i - 1 ; i + 1 < j ; j-- ){
ans = max( ans , sqrt( pow( point.get( j ).get( 0 ) - point.get( i ).get( 0 ) , 2 ) + pow( point.get( j ).get( 1 ) - point.get( i ).get( 1 ) , 2 ) ) );
}
}
System.out.print(ans);
}
}
// temprate
import java.util.*;
import static java.lang.Math.*;
public class Main{
public static void main(String[] args){
var in = new Scanner(System.in);
// ~~~
int N = in.nextInt();
var point = new ArrayList<List<Integer>>();
for ( int i = 0 ; N > i ; i++ ){
point.add( Arrays.asList( in.nextInt() , in.nextInt() ) );
}
double ans = 0;
for ( int i = 0 ; N > i ; i++ ){
for ( int j = N - 1 ; i < j ; j-- ){
ans = max( ans , sqrt( pow( point.get( j ).get( 0 ) - point.get( i ).get( 0 ) , 2 ) + pow( point.get( j ).get( 1 ) - point.get( i ).get( 1 ) , 2 ) ) );
}
}
System.out.print(ans);
}
}
|
ConDefects/ConDefects/Code/abc234_b/Java/39556353
|
condefects-java_data_1720
|
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
static Scanner $ = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
// 234_
int N = $.nextInt();
int x[] = new int[N];
int y[] = new int[N];
for(int i=0; i<N; i++) {
x[i] = $.nextInt();
y[i] = $.nextInt();
}
double len = 0;
double max = 0;
for(int i=0; i<N; i++) {
for(int j=i+1; j<N; j++) {
int w = Math.abs(x[i] - x[j]);
int h = Math.abs(y[i] - y[j]);
len = Math.sqrt(w*w+h*h);
}
max = Math.max(len, max);
}
System.out.println(max);
}
}
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
static Scanner $ = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
// 234_
int N = $.nextInt();
int x[] = new int[N];
int y[] = new int[N];
for(int i=0; i<N; i++) {
x[i] = $.nextInt();
y[i] = $.nextInt();
}
double len = 0;
double max = 0;
for(int i=0; i<N; i++) {
for(int j=i+1; j<N; j++) {
int w = Math.abs(x[i] - x[j]);
int h = Math.abs(y[i] - y[j]);
len = Math.sqrt(w*w+h*h);
max = Math.max(len, max);
}
}
System.out.println(max);
}
}
|
ConDefects/ConDefects/Code/abc234_b/Java/34717128
|
condefects-java_data_1721
|
import java.io.ByteArrayInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.security.cert.X509CRL;
import java.util.*;
import java.lang.*;
import java.util.stream.Collector;
import java.util.stream.Collectors;
@SuppressWarnings("unused")
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static String OUTPUT = "";
//global
private final static long BASE = 998244353L;
private final static int INF_I = 1001001001;
private final static long INF_L = 1001001001001001001L;
static void solve() {
int N = readInt();
List<Point<Integer>> coord = new ArrayList<>();
for (int i=0;i<N;i++) {
int x=readInt(), y=readInt();
coord.add(new Point<Integer>(x, y));
}
int ans=0;
for (int i=0;i<N;i++)
for (int j=i+1;j<N;j++)
for (int k=j+1;k<N;k++) {
Point<Integer> p1 = coord.get(i);
Point<Integer> p2 = coord.get(j);
Point<Integer> p3 = coord.get(k);
long area = Math.abs(1L * (p2.getX() - p1.getX()) * (p3.getY() - p1.getY()) - 1L*(p3.getX()-p1.getX()) * (p2.getY() - p1.getY()));
if (area>1) ans++;
}
out.println(ans);
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
if (INPUT=="") {
is = System.in;
} else {
File file = new File(INPUT);
is = new FileInputStream(file);
}
if (OUTPUT == "") out = new PrintWriter(System.out);
else out = new PrintWriter(OUTPUT);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static class Point<T extends Number & Comparable<T>> implements Comparable<Point<T>> {
private T x;
private T y;
public Point(T x, T y) {
this.x = x;
this.y = y;
}
public T getX() {return x;}
public T getY() {return y;}
@Override
public int compareTo(Point<T> o) {
int cmp = x.compareTo(o.getX());
if (cmp==0) return y.compareTo(o.getY());
return cmp;
}
}
private static class ClassComparator<T extends Comparable<T>> implements Comparator<T> {
public ClassComparator() {}
@Override
public int compare(T a, T b) {
return a.compareTo(b);
}
}
private static class ListComparator<T extends Comparable<T>> implements Comparator<List<T>> {
public ListComparator() {}
@Override
public int compare(List<T> o1, List<T> o2) {
for (int i = 0; i < Math.min(o1.size(), o2.size()); i++) {
int c = o1.get(i).compareTo(o2.get(i));
if (c != 0) {
return c;
}
}
return Integer.compare(o1.size(), o2.size());
}
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double readDouble() { return Double.parseDouble(readString()); }
private static char readChar() { return (char)skip(); }
private static String readString()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] readChar(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] readTable(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = readChar(m);
return map;
}
private static int[] readIntArray(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = readInt();
return a;
}
private static long[] readLongArray(int n) {
long[] a = new long[n];
for (int i=0;i<n;i++) a[i] = readLong();
return a;
}
private static int readInt()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long readLong()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
import java.io.ByteArrayInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.security.cert.X509CRL;
import java.util.*;
import java.lang.*;
import java.util.stream.Collector;
import java.util.stream.Collectors;
@SuppressWarnings("unused")
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static String OUTPUT = "";
//global
private final static long BASE = 998244353L;
private final static int INF_I = 1001001001;
private final static long INF_L = 1001001001001001001L;
static void solve() {
int N = readInt();
List<Point<Integer>> coord = new ArrayList<>();
for (int i=0;i<N;i++) {
int x=readInt(), y=readInt();
coord.add(new Point<Integer>(x, y));
}
int ans=0;
for (int i=0;i<N;i++)
for (int j=i+1;j<N;j++)
for (int k=j+1;k<N;k++) {
Point<Integer> p1 = coord.get(i);
Point<Integer> p2 = coord.get(j);
Point<Integer> p3 = coord.get(k);
long area = Math.abs(1L * (p2.getX() - p1.getX()) * (p3.getY() - p1.getY()) - 1L*(p3.getX()-p1.getX()) * (p2.getY() - p1.getY()));
if (area!=0) ans++;
}
out.println(ans);
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
if (INPUT=="") {
is = System.in;
} else {
File file = new File(INPUT);
is = new FileInputStream(file);
}
if (OUTPUT == "") out = new PrintWriter(System.out);
else out = new PrintWriter(OUTPUT);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static class Point<T extends Number & Comparable<T>> implements Comparable<Point<T>> {
private T x;
private T y;
public Point(T x, T y) {
this.x = x;
this.y = y;
}
public T getX() {return x;}
public T getY() {return y;}
@Override
public int compareTo(Point<T> o) {
int cmp = x.compareTo(o.getX());
if (cmp==0) return y.compareTo(o.getY());
return cmp;
}
}
private static class ClassComparator<T extends Comparable<T>> implements Comparator<T> {
public ClassComparator() {}
@Override
public int compare(T a, T b) {
return a.compareTo(b);
}
}
private static class ListComparator<T extends Comparable<T>> implements Comparator<List<T>> {
public ListComparator() {}
@Override
public int compare(List<T> o1, List<T> o2) {
for (int i = 0; i < Math.min(o1.size(), o2.size()); i++) {
int c = o1.get(i).compareTo(o2.get(i));
if (c != 0) {
return c;
}
}
return Integer.compare(o1.size(), o2.size());
}
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double readDouble() { return Double.parseDouble(readString()); }
private static char readChar() { return (char)skip(); }
private static String readString()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] readChar(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] readTable(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = readChar(m);
return map;
}
private static int[] readIntArray(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = readInt();
return a;
}
private static long[] readLongArray(int n) {
long[] a = new long[n];
for (int i=0;i<n;i++) a[i] = readLong();
return a;
}
private static int readInt()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long readLong()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
|
ConDefects/ConDefects/Code/abc224_c/Java/31583621
|
condefects-java_data_1722
|
import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main {
public static void solve () {
int n = nextInt();
Point[] p = new Point[n];
for (int i=0; i<n; i++) {
int x = nextInt(), y = nextInt();
p[i] = new Point(y, x);
}
long ans = 0;
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
for (int k=j+1; k<n; k++) {
if (triangleArea(p[i], p[j], p[k]) != 0) ans++;
}
}
}
println(ans);
}
public static double triangleArea (Point a, Point b, Point c) {
return Math.abs((a.x-c.x)*(b.y-c.y) - (b.x-c.x)*(a.y-c.y)) / 2;
}
public static class Point {
int y, x;
Point (int y, int x) {
this.y = y;
this.x = x;
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) {
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
public static String yesno(boolean b) {return b ? "Yes" : "No";}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public static List<List<Integer>> nextDirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
g.get(b).add(a);
}
return g;
}
public static List<List<Integer>> nextUndirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
}
return g;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
solve();
out.close();
}
}
import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main {
public static void solve () {
int n = nextInt();
Point[] p = new Point[n];
for (int i=0; i<n; i++) {
int x = nextInt(), y = nextInt();
p[i] = new Point(y, x);
}
long ans = 0;
for (int i=0; i<n; i++) {
for (int j=i+1; j<n; j++) {
for (int k=j+1; k<n; k++) {
if (triangleArea(p[i], p[j], p[k]) != 0) ans++;
}
}
}
println(ans);
}
public static double triangleArea (Point a, Point b, Point c) {
return Math.abs((b.x-a.x)*(c.y-a.y) - (c.x-a.x)*(b.y-a.y)) / 2.0;
}
public static class Point {
int y, x;
Point (int y, int x) {
this.y = y;
this.x = x;
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) {
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
public static String yesno(boolean b) {return b ? "Yes" : "No";}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public static List<List<Integer>> nextDirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
g.get(b).add(a);
}
return g;
}
public static List<List<Integer>> nextUndirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
}
return g;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
solve();
out.close();
}
}
|
ConDefects/ConDefects/Code/abc224_c/Java/39201786
|
condefects-java_data_1723
|
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static 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 boolean ok = false;
static long ans = 0;
static final int[] dx = {1, -1, 0, 0};
static final int[] dy = {0, 0, 1, -1};
static final long[] MODS = {998244353, 1000000007};
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;
}
}
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
char[][] cs = new char[n][];
for (int i = 0; i < cs.length; i++) {
cs[i] = sc.next().toCharArray();
}
long[][] hash = new long[n][4];
HashMap<ArrayList<Long>, Long> map = new HashMap<>();
for (int i = 0; i < n; i++) {
ArrayList<Long> list = new ArrayList<>();
for (int j = 0; j < MODS.length; j++) {
for (int j2 = 0; j2 < cs[i].length; j2++) {
hash[i][j] = (10 * hash[i][j] + Character.getNumericValue(cs[i][j2])) % MODS[j];
}
list.add(hash[i][j]);
}
map.put(list, map.getOrDefault(list, 0l) + 1);
}
long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ArrayList<Long> list = new ArrayList<>();
for (int j2 = 0; j2 < MODS.length; j2++) {
list.add((hash[i][j2] * hash[j][j2]) % MODS[j2]);
}
ans += map.getOrDefault(list, 0l);
}
}
System.out.println(ans);
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.*;
public class Main {
static final long MOD1=1000000007;
static 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 boolean ok = false;
static long ans = 0;
static final int[] dx = {1, -1, 0, 0};
static final int[] dy = {0, 0, 1, -1};
static final long[] MODS = {998244353, 1000000007, 1000000009, 1000000021};
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;
}
}
public static void main(String[] args){
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int n = sc.nextInt();
char[][] cs = new char[n][];
for (int i = 0; i < cs.length; i++) {
cs[i] = sc.next().toCharArray();
}
long[][] hash = new long[n][4];
HashMap<ArrayList<Long>, Long> map = new HashMap<>();
for (int i = 0; i < n; i++) {
ArrayList<Long> list = new ArrayList<>();
for (int j = 0; j < MODS.length; j++) {
for (int j2 = 0; j2 < cs[i].length; j2++) {
hash[i][j] = (10 * hash[i][j] + Character.getNumericValue(cs[i][j2])) % MODS[j];
}
list.add(hash[i][j]);
}
map.put(list, map.getOrDefault(list, 0l) + 1);
}
long ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
ArrayList<Long> list = new ArrayList<>();
for (int j2 = 0; j2 < MODS.length; j2++) {
list.add((hash[i][j2] * hash[j][j2]) % MODS[j2]);
}
ans += map.getOrDefault(list, 0l);
}
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc339_f/Java/53247805
|
condefects-java_data_1724
|
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int a=scanner.nextInt();
int b=scanner.nextInt();
int k=scanner.nextInt();
int count=0;
if(a>=b){
System.out.println(0);
return;
}
while(true){
a*=k;
count++;
if(a>=b){
System.out.println(count);
break;
}
}
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
long a=scanner.nextLong();
int b=scanner.nextInt();
int k=scanner.nextInt();
int count=0;
if(a>=b){
System.out.println(0);
return;
}
while(true){
a*=k;
count++;
if(a>=b){
System.out.println(count);
break;
}
}
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/41616850
|
condefects-java_data_1725
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int k = sc.nextInt();
int count = 0;
while(a < b) {
a *= k;
count++;
};
System.out.println(count);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextInt();
int b = sc.nextInt();
int k = sc.nextInt();
int count = 0;
while(a < b) {
a *= k;
count++;
};
System.out.println(count);
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/36157284
|
condefects-java_data_1726
|
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
long a = Integer.parseInt(sc.next());
long b = Integer.parseInt(sc.next());
long x = Integer.parseInt(sc.next());
int count = 0;
while(b > a) {
b /= x;
count++;
}
System.out.println(count);
}
}
import java.io.PrintWriter;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
long a = Integer.parseInt(sc.next());
long b = Integer.parseInt(sc.next());
long x = Integer.parseInt(sc.next());
int count = 0;
while(b > a) {
a *= x;
count++;
}
System.out.println(count);
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/41112929
|
condefects-java_data_1727
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt(),b=sc.nextInt(),k=sc.nextInt();
int ans = 0;
while(a<b) {
a*=k;
ans++;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong(),b=sc.nextLong(),k=sc.nextLong();
int ans = 0;
while(a<b) {
a*=k;
ans++;
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/36943089
|
condefects-java_data_1728
|
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
double a = Double.parseDouble(st.nextToken());
double b = Double.parseDouble(st.nextToken());
double k = Double.parseDouble(st.nextToken());
System.out.println((int)(Math.ceil(Math.log(b / a) / Math.log(k))));
}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.StringTokenizer;
/*
* Solution: 1m
* Coding: 4m
* Time: 5m
*
*/
public class Main {
public static void main(String[] args) throws IOException {
//BufferedReader br = new BufferedReader(new FileReader("atcoder_abc/input.in"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
double a = Double.parseDouble(st.nextToken());
double b = Double.parseDouble(st.nextToken());
double k = Double.parseDouble(st.nextToken());
System.out.println((int)(Math.ceil(Math.log10(b / a) / Math.log10(k))));
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/41107490
|
condefects-java_data_1729
|
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int a = sc.nextInt(),b = sc.nextInt(), k = sc.nextInt(),ans=0;
while(a<b){
a*=k;
ans++;
}
System.out.println(ans);
}
}
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
long a = sc.nextLong(),b = sc.nextLong(), k = sc.nextLong(),ans=0;
while(a<b){
a*=k;
ans++;
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc248_b/Java/42060801
|
condefects-java_data_1730
|
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print(sc.next().replace("4", "3"));
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print(sc.next().replaceAll("3$", "4"));
}
}
|
ConDefects/ConDefects/Code/abc335_a/Java/54894910
|
condefects-java_data_1731
|
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
StringBuilder sb = new StringBuilder(s);
sb.replace(s.length(), s.length(), "4");
String answer = sb.toString();
System.out.println(answer);
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
StringBuilder sb = new StringBuilder(s);
sb.replace(s.length() - 1, s.length(), "4");
String answer = sb.toString();
System.out.println(answer);
}
}
|
ConDefects/ConDefects/Code/abc335_a/Java/54450807
|
condefects-java_data_1732
|
import java.util.Scanner;
public class Main{
public static void main(String []args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[5];
int n = a.length;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
}
int count = 0;
for (int i = 0;i < n;i++) {
for (int j = i + 1;j < n;j++) {
if (a[i] == a[j]){
count++;
break;
}
}
}System.out.println(count);
}
}
import java.util.Scanner;
public class Main{
public static void main(String []args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[5];
int n = a.length;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
}
int count = 0;
for (int i = 0;i < n;i++) {
for (int j = i + 1;j < n;j++) {
if (a[i] == a[j]){
count++;
break;
}
}
}System.out.println(5 - count);
}
}
|
ConDefects/ConDefects/Code/abc268_a/Java/39368298
|
condefects-java_data_1733
|
import static java.lang.System.*;
import java.util.*;
public class Main{
public static void solve(){
Scanner sc = new Scanner(in);
int A = sc.nextInt();
int B = sc.nextInt();
int C = sc.nextInt();
int D = sc.nextInt();
int E = sc.nextInt();
int []freq = new int[101];
++freq[A];
++freq[B];
++freq[C];
++freq[D];
++freq[E];
int cnt = 0;
for(int i = 0; i < 101; ++i){
if(freq[i] == 1)++cnt;
}
out.println(cnt);
}
public static void main(String[] args) {
solve();
}
}
import static java.lang.System.*;
import java.util.*;
public class Main{
public static void solve(){
Scanner sc = new Scanner(in);
int A = sc.nextInt();
int B = sc.nextInt();
int C = sc.nextInt();
int D = sc.nextInt();
int E = sc.nextInt();
int []freq = new int[101];
++freq[A];
++freq[B];
++freq[C];
++freq[D];
++freq[E];
int cnt = 0;
for(int i = 0; i < 101; ++i){
if(freq[i] >= 1)++cnt;
}
out.println(cnt);
}
public static void main(String[] args) {
solve();
}
}
|
ConDefects/ConDefects/Code/abc268_a/Java/39120071
|
condefects-java_data_1734
|
//package atcoder.abc240;
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++) {
int n = in.nextInt(), m = in.nextInt();
int[][] v = new int[n][];
for(int i = 0; i < n; i++) {
v[i] = in.nextIntArrayPrimitive(2);
}
List<Long> a = new ArrayList<>();
//int k = -1;
long prefixSum = 0;
for(int[] e : v) {
//long sum = prefixSum * e[1] + 1l * (e[1] + 1) * e[1] / 2 * e[0];
long prefixSum1 = prefixSum + 1l * e[0] * e[1];
if(prefixSum1 >= 0 && prefixSum >= 0 || prefixSum1 <= 0 && prefixSum <= 0) {
a.add(prefixSum * e[1] + 1l * (e[1] + 1) * e[1] / 2 * e[0]);
prefixSum += 1l * e[1] * e[0];
//k = -1;
}
else {
int k = bs(e, prefixSum);
a.add(prefixSum * k + 1l * (k + 1) * k / 2 * e[0]);
prefixSum += 1l * k * e[0];
a.add(prefixSum * (e[1] - k) + 1l * (e[1] - k + 1) * (e[1] - k) / 2 * e[0]);
prefixSum += 1l * (e[1] - k) * e[0];
}
}
// if(k >= 0 && k < v[n - 1][1]) {
// a.add(prefixSum);
// }
long ans = Long.MIN_VALUE, sum = 0;
for(long x : a) {
sum += x;
ans = max(ans, sum);
}
out.println(ans);
}
out.close();
}
//binary search to find the largest k s.t ps + k * e[0] does not result in a sign flip
static int bs(int[] e, long ps) {
int l = 0, r = e[1];
while(l < r - 1) {
int mid = l + (r - l) / 2;
long x = ps + 1l * e[0] * mid;
if(ps >= 0 && x >= 0 || ps <= 0 && x <= 0) {
l = mid;
}
else {
r = mid - 1;
}
}
long x = ps + 1l * e[0] * r;
if(ps >= 0 && x >= 0 || ps <= 0 && x <= 0) {
return r;
}
return l;
}
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.abc240;
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++) {
int n = in.nextInt(), m = in.nextInt();
int[][] v = new int[n][];
for(int i = 0; i < n; i++) {
v[i] = in.nextIntArrayPrimitive(2);
}
List<Long> a = new ArrayList<>();
//int k = -1;
long prefixSum = 0;
for(int[] e : v) {
//long sum = prefixSum * e[1] + 1l * (e[1] + 1) * e[1] / 2 * e[0];
long prefixSum1 = prefixSum + 1l * e[0] * e[1];
if(prefixSum1 >= 0 && prefixSum >= 0 || prefixSum1 <= 0 && prefixSum <= 0) {
a.add(prefixSum * e[1] + 1l * (e[1] + 1) * e[1] / 2 * e[0]);
prefixSum += 1l * e[1] * e[0];
//k = -1;
}
else {
int k = bs(e, prefixSum);
a.add(prefixSum * k + 1l * (k + 1) * k / 2 * e[0]);
prefixSum += 1l * k * e[0];
a.add(prefixSum * (e[1] - k) + 1l * (e[1] - k + 1) * (e[1] - k) / 2 * e[0]);
prefixSum += 1l * (e[1] - k) * e[0];
}
}
// if(k >= 0 && k < v[n - 1][1]) {
// a.add(prefixSum);
// }
long ans = v[0][0], sum = 0;
for(long x : a) {
sum += x;
ans = max(ans, sum);
}
out.println(ans);
}
out.close();
}
//binary search to find the largest k s.t ps + k * e[0] does not result in a sign flip
static int bs(int[] e, long ps) {
int l = 0, r = e[1];
while(l < r - 1) {
int mid = l + (r - l) / 2;
long x = ps + 1l * e[0] * mid;
if(ps >= 0 && x >= 0 || ps <= 0 && x <= 0) {
l = mid;
}
else {
r = mid - 1;
}
}
long x = ps + 1l * e[0] * r;
if(ps >= 0 && x >= 0 || ps <= 0 && x <= 0) {
return r;
}
return l;
}
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/abc240_f/Java/38951458
|
condefects-java_data_1735
|
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
while(T-->0){
int N = sc.nextInt();
int M = sc.nextInt();
long now = 0;
long B = 0;
long max = Long.MIN_VALUE;
while(N-->0){
int x = sc.nextInt();
int y = sc.nextInt();
long sum = (long)y*(y+1)/2;
long k = 0<B&&x<0?max(1,min(y,-(B+x)/x)):1;
max = max(max,now+B+x,now+B*k+k*(k+1)/2*x,now+y*B+sum*x);
now += y*B+sum*x;
B += (long)x*y;
}
System.out.println(max);
}
}
private static long max(long... num){
long ans = num[0];
for(int i=1;i<num.length;i++)
ans = Math.max(ans,num[i]);
return ans;
}
private static long min(long... num){
long ans = num[0];
for(int i=1;i<num.length;i++)
ans = Math.min(ans,num[i]);
return ans;
}
}
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int T = sc.nextInt();
while(T-->0){
int N = sc.nextInt();
int M = sc.nextInt();
long now = 0;
long B = 0;
long max = Long.MIN_VALUE;
while(N-->0){
int x = sc.nextInt();
int y = sc.nextInt();
long sum = (long)y*(y+1)/2;
long k = 0<B&&x<0?max(1,min(y,-(B+x)/x+1)):1;
max = max(max,now+B+x,now+B*k+k*(k+1)/2*x,now+y*B+sum*x);
now += y*B+sum*x;
B += (long)x*y;
}
System.out.println(max);
}
}
private static long max(long... num){
long ans = num[0];
for(int i=1;i<num.length;i++)
ans = Math.max(ans,num[i]);
return ans;
}
private static long min(long... num){
long ans = num[0];
for(int i=1;i<num.length;i++)
ans = Math.min(ans,num[i]);
return ans;
}
}
|
ConDefects/ConDefects/Code/abc240_f/Java/40175213
|
condefects-java_data_1736
|
import java.io.*;
import java.util.*;
public class Main {
static IOHandler sc = new IOHandler();
static PrintWriter out = new PrintWriter(System.out);
static List<Integer> [] graph;
static char [] targetArr;
static String [][][] dp;
static boolean [][][] vDp;
public static void main(String[] args) {
// TODO Auto-generated method stub
int testCases = sc.nextInt();
for (int i = 1; i <= testCases; ++i) {
solve(i);
}
out.flush();
}
private static void solve(int t) {
int n = sc.nextInt();
graph = new List[n + 1];
for (int i = 1; i <= n; ++i) {
graph[i] = new ArrayList<>();
}
int u, v;
for (int i = 1; i < n; ++i) {
u = sc.nextInt();
v = sc.nextInt();
graph[u].add(v);
graph[v].add(u);
}
String s = sc.next();
char [] arr = new char [n + 1];
targetArr = new char [n + 1];
for (int i = 1; i <= n; ++i) {
arr[i] = s.charAt(i - 1);
}
dp = new String [2][3][n + 1];
vDp = new boolean [2][3][n + 1];
dfs(1, 0, 2, arr, 0);
if (dp[0][2][1] != null) {
generateResult(1, 0, 2, arr, 0);
StringBuilder sb = new StringBuilder();
System.out.println(Arrays.toString(targetArr));
for (int i = 1; i <= n; ++i) {
sb.append(targetArr[i]);
}
out.println(sb);
return;
}
dfs(1, 0, 2, arr, 1);
if (dp[1][2][1] != null) {
generateResult(1, 0,2 ,arr, 1);
StringBuilder sb = new StringBuilder();
for (int i = 1; i <= n; ++i) {
sb.append(targetArr[i]);
}
out.println(sb);
return;
}
out.println(-1);
}
private static void generateResult(int node, int parent, int parentVal, char [] arr, int borw) {
targetArr[node] = borw == 0 ? 'B' : 'W';
//System.out.println(node + " " + Arrays.toString(targetArr));
char c;
String current = dp[borw][parentVal][node];
int idx = 0;
int bVal;
for (int child : graph[node]) {
if (child == parent)
continue;
c = current.charAt(idx++);
bVal = c == 'B' ? 0 : 1;
generateResult(child, node, borw, arr, bVal);
}
}
private static void dfs(int node, int parent, int parentVal, char [] arr, int borw) {
if (vDp[borw][parentVal][node])
return;
//System.out.println(node);
int childCount = 0;
for (int child : graph[node]) {
if (child == parent)
continue;
++childCount;
dfs(child, node, borw, arr, 0);
dfs(child, node, borw, arr, 1);
}
int b = 0;
int w = 0;
if (parentVal == 0)
++b;
else if (parentVal == 1)
++w;
StringBuilder sb = new StringBuilder();
boolean use = true;
for (int child : graph[node]) {
if (child == parent)
continue;
if (arr[node] == 'B') {
if (dp[0][borw][child] != null) {
sb.append('B');
++b;
}else if (dp[1][borw][child] != null){
sb.append('W');
++w;
}else {
use = false;
break;
}
} else {
if (dp[1][borw][child] != null){
sb.append('W');
++w;
} else if (dp[0][borw][child] != null) {
sb.append('B');
++b;
} else {
use = false;
break;
}
}
}
if (use && arr[node] == 'B' && b > w) {
dp[borw][parentVal][node] = sb.toString();
}else if (use && arr[node] == 'W' && w > b) {
dp[borw][parentVal][node] = sb.toString();
}
//System.out.println(b + " " + w + " " + arr[node]);
//System.out.println(borw + " " + parentVal + " " + node + " " + dp[borw][parentVal][node]);
vDp[borw][parentVal][node] = true;
}
private static class IOHandler {
BufferedReader br;
StringTokenizer st;
public IOHandler() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int [] readArray(int n) {
int [] res = new int [n];
for (int i = 0; i < n; ++i)
res[i] = nextInt();
return res;
}
int [] readArray2(int n) {
int [] res = new int [n + 1];
for (int i = 1; i <= n; ++i)
res[i] = nextInt();
return res;
}
int [][] readGraph(int n, int m, int c) {
int [][] graph = new int [n + 1][];
int [] count = new int [n + 1];
int [][] arr = new int [m][1 + c];
int a, b;
for (int i = 0; i < m; ++i) {
a = sc.nextInt();
b = sc.nextInt();
arr[i][0] = a;
arr[i][1] = b;
++count[a];
++count[b];
for (int j = 2; j <= c; ++j) {
arr[i][j] = sc.nextInt();
}
}
for (int i = 0; i <= n; ++i) {
graph[i] = new int [count[i] * c];
count[i] = 0;
}
int swap;
for (int [] tArr : arr) {
for (int j = 1; j < tArr.length; ++j) {
graph[tArr[0]][count[tArr[0]]++] = tArr[j];
}
swap = tArr[0];
tArr[0] = tArr[1];
tArr[1] = swap;
for (int j = 1; j < tArr.length; ++j) {
graph[tArr[0]][count[tArr[0]]++] = tArr[j];
}
}
return graph;
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.io.*;
import java.util.*;
public class Main {
static IOHandler sc = new IOHandler();
static PrintWriter out = new PrintWriter(System.out);
static List<Integer> [] graph;
static char [] targetArr;
static String [][][] dp;
static boolean [][][] vDp;
public static void main(String[] args) {
// TODO Auto-generated method stub
int testCases = sc.nextInt();
for (int i = 1; i <= testCases; ++i) {
solve(i);
}
out.flush();
}
private static void solve(int t) {
int n = sc.nextInt();
graph = new List[n + 1];
for (int i = 1; i <= n; ++i) {
graph[i] = new ArrayList<>();
}
int u, v;
for (int i = 1; i < n; ++i) {
u = sc.nextInt();
v = sc.nextInt();
graph[u].add(v);
graph[v].add(u);
}
String s = sc.next();
char [] arr = new char [n + 1];
targetArr = new char [n + 1];
for (int i = 1; i <= n; ++i) {
arr[i] = s.charAt(i - 1);
}
dp = new String [2][3][n + 1];
vDp = new boolean [2][3][n + 1];
dfs(1, 0, 2, arr, 0);
if (dp[0][2][1] != null) {
generateResult(1, 0, 2, arr, 0);
StringBuilder sb = new StringBuilder();
//System.out.println(Arrays.toString(targetArr));
for (int i = 1; i <= n; ++i) {
sb.append(targetArr[i]);
}
out.println(sb);
return;
}
dfs(1, 0, 2, arr, 1);
if (dp[1][2][1] != null) {
generateResult(1, 0,2 ,arr, 1);
StringBuilder sb = new StringBuilder();
for (int i = 1; i <= n; ++i) {
sb.append(targetArr[i]);
}
out.println(sb);
return;
}
out.println(-1);
}
private static void generateResult(int node, int parent, int parentVal, char [] arr, int borw) {
targetArr[node] = borw == 0 ? 'B' : 'W';
//System.out.println(node + " " + Arrays.toString(targetArr));
char c;
String current = dp[borw][parentVal][node];
int idx = 0;
int bVal;
for (int child : graph[node]) {
if (child == parent)
continue;
c = current.charAt(idx++);
bVal = c == 'B' ? 0 : 1;
generateResult(child, node, borw, arr, bVal);
}
}
private static void dfs(int node, int parent, int parentVal, char [] arr, int borw) {
if (vDp[borw][parentVal][node])
return;
//System.out.println(node);
int childCount = 0;
for (int child : graph[node]) {
if (child == parent)
continue;
++childCount;
dfs(child, node, borw, arr, 0);
dfs(child, node, borw, arr, 1);
}
int b = 0;
int w = 0;
if (parentVal == 0)
++b;
else if (parentVal == 1)
++w;
StringBuilder sb = new StringBuilder();
boolean use = true;
for (int child : graph[node]) {
if (child == parent)
continue;
if (arr[node] == 'B') {
if (dp[0][borw][child] != null) {
sb.append('B');
++b;
}else if (dp[1][borw][child] != null){
sb.append('W');
++w;
}else {
use = false;
break;
}
} else {
if (dp[1][borw][child] != null){
sb.append('W');
++w;
} else if (dp[0][borw][child] != null) {
sb.append('B');
++b;
} else {
use = false;
break;
}
}
}
if (use && arr[node] == 'B' && b > w) {
dp[borw][parentVal][node] = sb.toString();
}else if (use && arr[node] == 'W' && w > b) {
dp[borw][parentVal][node] = sb.toString();
}
//System.out.println(b + " " + w + " " + arr[node]);
//System.out.println(borw + " " + parentVal + " " + node + " " + dp[borw][parentVal][node]);
vDp[borw][parentVal][node] = true;
}
private static class IOHandler {
BufferedReader br;
StringTokenizer st;
public IOHandler() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
int [] readArray(int n) {
int [] res = new int [n];
for (int i = 0; i < n; ++i)
res[i] = nextInt();
return res;
}
int [] readArray2(int n) {
int [] res = new int [n + 1];
for (int i = 1; i <= n; ++i)
res[i] = nextInt();
return res;
}
int [][] readGraph(int n, int m, int c) {
int [][] graph = new int [n + 1][];
int [] count = new int [n + 1];
int [][] arr = new int [m][1 + c];
int a, b;
for (int i = 0; i < m; ++i) {
a = sc.nextInt();
b = sc.nextInt();
arr[i][0] = a;
arr[i][1] = b;
++count[a];
++count[b];
for (int j = 2; j <= c; ++j) {
arr[i][j] = sc.nextInt();
}
}
for (int i = 0; i <= n; ++i) {
graph[i] = new int [count[i] * c];
count[i] = 0;
}
int swap;
for (int [] tArr : arr) {
for (int j = 1; j < tArr.length; ++j) {
graph[tArr[0]][count[tArr[0]]++] = tArr[j];
}
swap = tArr[0];
tArr[0] = tArr[1];
tArr[1] = swap;
for (int j = 1; j < tArr.length; ++j) {
graph[tArr[0]][count[tArr[0]]++] = tArr[j];
}
}
return graph;
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
|
ConDefects/ConDefects/Code/arc161_c/Java/41810276
|
condefects-java_data_1737
|
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 mm = sc.nextInt();
ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
int[] values = new int[n];
for (int i = 0; i < n; i++) {
values[i] = sc.nextInt();
graph.add(new ArrayList<>());
}
long[] org = new long[n];
for (int i = 0; i < mm; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
graph.get(a).add(b);
graph.get(b).add(a);
org[a] += values[b];
org[b] += values[a];
}
long left = 0;
long right = Long.MAX_VALUE / 2;
while (right - left > 1) {
long[] costs = (long[])org.clone();
boolean[] selected = new boolean[n];
ArrayDeque<Integer> deq = new ArrayDeque<>();
long m = (left + right) / 2;
int count = n;
for (int i = 0; i < n; i++) {
if (costs[i] <= m) {
deq.add(i);
selected[i] = true;
count--;
}
}
while (deq.size() > 0 && count > 0) {
int x = deq.poll();
for (int y : graph.get(x)) {
if (!selected[y]) {
costs[y] -= values[x];
if (costs[y] <= m) {
deq.add(y);
selected[y] = true;
count--;
}
}
}
}
if (count == 0) {
right = m;
} else {
left = m;
}
}
System.out.println(right);
}
}
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 mm = sc.nextInt();
ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
int[] values = new int[n];
for (int i = 0; i < n; i++) {
values[i] = sc.nextInt();
graph.add(new ArrayList<>());
}
long[] org = new long[n];
for (int i = 0; i < mm; i++) {
int a = sc.nextInt() - 1;
int b = sc.nextInt() - 1;
graph.get(a).add(b);
graph.get(b).add(a);
org[a] += values[b];
org[b] += values[a];
}
long left = -1;
long right = Long.MAX_VALUE / 2;
while (right - left > 1) {
long[] costs = (long[])org.clone();
boolean[] selected = new boolean[n];
ArrayDeque<Integer> deq = new ArrayDeque<>();
long m = (left + right) / 2;
int count = n;
for (int i = 0; i < n; i++) {
if (costs[i] <= m) {
deq.add(i);
selected[i] = true;
count--;
}
}
while (deq.size() > 0 && count > 0) {
int x = deq.poll();
for (int y : graph.get(x)) {
if (!selected[y]) {
costs[y] -= values[x];
if (costs[y] <= m) {
deq.add(y);
selected[y] = true;
count--;
}
}
}
}
if (count == 0) {
right = m;
} else {
left = m;
}
}
System.out.println(right);
}
}
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/abc267_e/Java/45256839
|
condefects-java_data_1738
|
import java.io.PrintWriter;
import java.util.Scanner;
class Main {
static PrintWriter out;
public static void main(String[] args) {
out = new PrintWriter(System.out);
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[] X = new int[M+1];
for (int i = 1; i <= M; i++) {
X[i] = sc.nextInt();
}
long[] cost = new long[N+1];
//累積和準備
for (int i = 1; i < M; i++) {
int left;
int right;
if (X[i] >= X[i+1]){
left = X[i] - X[i+1];
right = N - X[i] + X[i+1];
}else {
left = X[i] + N - X[i+1];
right = X[i+1] - X[i];
}
cost[X[i]] += right - left;
cost[X[i+1]] -= right - left;
}
//imos
for (int i = 1; i < N; i++) {
cost[i+1] += cost[i];
}
cost[1] += cost[N];
int delete = 1;
long dc = cost[1];
for (int i = 2; i <= N; i++) {
if (dc < cost[i]){
delete = i;
dc = cost[i];
}
}
int answer = 0;
for (int i = 1; i < M; i++) {
if (X[i] >= X[i+1]){
if (X[i+1] <= delete && delete < X[i]){
answer += N - X[i] + X[i+1];
}else {
answer += X[i] - X[i+1];
}
}else {
if (X[i] <= delete && delete < X[i+1]){
answer += X[i] + N - X[i+1];
}else {
answer += X[i+1] - X[i];
}
}
}
System.out.println(answer);
}
}
import java.io.PrintWriter;
import java.util.Scanner;
class Main {
static PrintWriter out;
public static void main(String[] args) {
out = new PrintWriter(System.out);
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
int[] X = new int[M+1];
for (int i = 1; i <= M; i++) {
X[i] = sc.nextInt();
}
long[] cost = new long[N+1];
//累積和準備
for (int i = 1; i < M; i++) {
int left;
int right;
if (X[i] >= X[i+1]){
left = X[i] - X[i+1];
right = N - X[i] + X[i+1];
}else {
left = X[i] + N - X[i+1];
right = X[i+1] - X[i];
}
cost[X[i]] += right - left;
cost[X[i+1]] -= right - left;
}
//imos
for (int i = 1; i < N; i++) {
cost[i+1] += cost[i];
}
cost[1] += cost[N];
int delete = 1;
long dc = cost[1];
for (int i = 2; i <= N; i++) {
if (dc < cost[i]){
delete = i;
dc = cost[i];
}
}
long answer = 0;
for (int i = 1; i < M; i++) {
if (X[i] >= X[i+1]){
if (X[i+1] <= delete && delete < X[i]){
answer += N - X[i] + X[i+1];
}else {
answer += X[i] - X[i+1];
}
}else {
if (X[i] <= delete && delete < X[i+1]){
answer += X[i] + N - X[i+1];
}else {
answer += X[i+1] - X[i];
}
}
}
System.out.println(answer);
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49873588
|
condefects-java_data_1739
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
/* --- ABC338D --- */
public class Main {
public static void main(String[] args) throws Exception {
/* --- Input --- */
var br = new BufferedReader(new InputStreamReader(System.in));
var sa = br.readLine().split(" ");
var N = Integer.parseInt(sa[0]);
var M = Integer.parseInt(sa[1]);
sa = br.readLine().split(" ");
var X = new int[M];
for (var i = 0; i < M; i++) X[i] = Integer.parseInt(sa[i]) - 1; // 0-indexed
br.close();
/* --- Process --- */
// いもす法で封鎖によって遠回りさせる長さが最も短い橋を探す
var imos = new long[N+1];
var L = new int[M]; // 始点
var R = new int[M]; // 終点
var D1 = new int[M]; // 橋Nを通らない距離
var D2 = new int[M]; // 橋Nを通る距離
var P = new int[M]; // 橋Nを通るか
for (var i = 1; i < M; i++){
L[i] = X[i-1];
R[i] = X[i];
if(L[i] > R[i]){
var temp = L[i];
L[i] = R[i];
R[i] = temp;
}
P[i] = R[i] - L[i] > N / 2 ? 1 : 0; // 橋Nを通るか
D1[i] = Math.abs(L[i] - R[i]);
D2[i] = N - D1[i];
var D = Math.abs(D1[i] - D2[i]); // 遠回りさせる長さ
if(P[i] == 0){
// 橋Nを通るルートが遠回り
imos[R[i]] += D;
imos[N] -= D;
imos[0] += D;
imos[L[i]] -=D;
}else {
// 橋Nを通らないルートが遠回り
imos[L[i]] += D;
imos[R[i]] -= D;
}
}
for(var i=1; i<=N; i++) imos[i] += imos[i-1];
var max = 0L;
var block = -1;
for(var i=0; i<=N; i++){
if(imos[i] >= max){
max = imos[i];
block = i;
}
}
// 橋を封鎖してツアーの長さを求める
var ans = 0;
for(var i=1; i<M; i++){
if(P[i] == 0){
// 橋Nを通らないルートに封鎖された橋があるか
if(L[i] <= block && block < R[i]){
ans += D2[i]; // 橋Nを通らない
}else{
ans += D1[i]; // 橋Nを通る
}
} else {
// 橋Nを通るルートに封鎖された橋があるか
if((R[i] <= block && block < N) || (0 <= block && block < L[i])){
ans += D1[i]; // 橋Nを通らない
}else{
ans += D2[i]; // 橋Nを通る
}
}
}
/* --- Output --- */
System.out.println(ans);
System.out.flush();
}
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
/* --- ABC338D --- */
public class Main {
public static void main(String[] args) throws Exception {
/* --- Input --- */
var br = new BufferedReader(new InputStreamReader(System.in));
var sa = br.readLine().split(" ");
var N = Integer.parseInt(sa[0]);
var M = Integer.parseInt(sa[1]);
sa = br.readLine().split(" ");
var X = new int[M];
for (var i = 0; i < M; i++) X[i] = Integer.parseInt(sa[i]) - 1; // 0-indexed
br.close();
/* --- Process --- */
// いもす法で封鎖によって遠回りさせる長さが最も短い橋を探す
var imos = new long[N+1];
var L = new int[M]; // 始点
var R = new int[M]; // 終点
var D1 = new int[M]; // 橋Nを通らない距離
var D2 = new int[M]; // 橋Nを通る距離
var P = new int[M]; // 橋Nを通るか
for (var i = 1; i < M; i++){
L[i] = X[i-1];
R[i] = X[i];
if(L[i] > R[i]){
var temp = L[i];
L[i] = R[i];
R[i] = temp;
}
P[i] = R[i] - L[i] > N / 2 ? 1 : 0; // 橋Nを通るか
D1[i] = Math.abs(L[i] - R[i]);
D2[i] = N - D1[i];
var D = Math.abs(D1[i] - D2[i]); // 遠回りさせる長さ
if(P[i] == 0){
// 橋Nを通るルートが遠回り
imos[R[i]] += D;
imos[N] -= D;
imos[0] += D;
imos[L[i]] -=D;
}else {
// 橋Nを通らないルートが遠回り
imos[L[i]] += D;
imos[R[i]] -= D;
}
}
for(var i=1; i<=N; i++) imos[i] += imos[i-1];
var max = 0L;
var block = -1;
for(var i=0; i<=N; i++){
if(imos[i] >= max){
max = imos[i];
block = i;
}
}
// 橋を封鎖してツアーの長さを求める
var ans = 0L;
for(var i=1; i<M; i++){
if(P[i] == 0){
// 橋Nを通らないルートに封鎖された橋があるか
if(L[i] <= block && block < R[i]){
ans += D2[i]; // 橋Nを通らない
}else{
ans += D1[i]; // 橋Nを通る
}
} else {
// 橋Nを通るルートに封鎖された橋があるか
if((R[i] <= block && block < N) || (0 <= block && block < L[i])){
ans += D1[i]; // 橋Nを通らない
}else{
ans += D2[i]; // 橋Nを通る
}
}
}
/* --- Output --- */
System.out.println(ans);
System.out.flush();
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49750727
|
condefects-java_data_1740
|
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 m = Integer.parseInt(sc.next());
var x = new int[m];
for(int i = 0; i < m; i++){
x[i] = Integer.parseInt(sc.next());
}
var bit = new BinaryIndexedTree(3*n);
for(int i = 0; i < m-1; i++){
int a = Math.min(x[i], x[i+1]);
int b = Math.max(x[i], x[i+1]);
if(b-a < n+a-b){
bit.add(n+a, n+b, (n+a-b) - (b-a));
}else{
bit.add(b, n+a, (b-a) - (n+a-b));
bit.add(n+b, 2*n+a, (b-a) - (n+a-b));
}
}
int l = 0;
for(int i = 0; i < m-1; i++){
int a = Math.min(x[i], x[i+1]);
int b = Math.max(x[i], x[i+1]);
l += Math.min(b-a, n+a-b);
}
long ans = Long.MAX_VALUE;
for(int i = n; i < 2*n; i++){
ans = Math.min(l + bit.sum(i, i+1), ans);
}
System.out.println(ans);
}
static class BinaryIndexedTree {
int n;
long[] p, q;
public BinaryIndexedTree(int n){
this.n = n;
p = new long[n+1];
q = new long[n+1];
}
void add(int l, int r, long x){
add(p, l, -x*(l-1));
add(p, r, x*(r-1));
add(q, l, x);
add(q, r, -x);
}
void add(long[] bit, int i, long x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
long sum(int l, int r){
return sum(r-1) - sum(l-1);
}
long sum(int i){
return sum(p, i) + sum(q, i)*i;
}
long sum(long[] bit, int i){
long s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
}
}
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 m = Integer.parseInt(sc.next());
var x = new int[m];
for(int i = 0; i < m; i++){
x[i] = Integer.parseInt(sc.next());
}
var bit = new BinaryIndexedTree(3*n);
for(int i = 0; i < m-1; i++){
int a = Math.min(x[i], x[i+1]);
int b = Math.max(x[i], x[i+1]);
if(b-a < n+a-b){
bit.add(n+a, n+b, (n+a-b) - (b-a));
}else{
bit.add(b, n+a, (b-a) - (n+a-b));
bit.add(n+b, 2*n+a, (b-a) - (n+a-b));
}
}
long l = 0;
for(int i = 0; i < m-1; i++){
int a = Math.min(x[i], x[i+1]);
int b = Math.max(x[i], x[i+1]);
l += Math.min(b-a, n+a-b);
}
long ans = Long.MAX_VALUE;
for(int i = n; i < 2*n; i++){
ans = Math.min(l + bit.sum(i, i+1), ans);
}
System.out.println(ans);
}
static class BinaryIndexedTree {
int n;
long[] p, q;
public BinaryIndexedTree(int n){
this.n = n;
p = new long[n+1];
q = new long[n+1];
}
void add(int l, int r, long x){
add(p, l, -x*(l-1));
add(p, r, x*(r-1));
add(q, l, x);
add(q, r, -x);
}
void add(long[] bit, int i, long x){
while(i <= n){
bit[i] += x;
i += i & -i;
}
}
long sum(int l, int r){
return sum(r-1) - sum(l-1);
}
long sum(int i){
return sum(p, i) + sum(q, i)*i;
}
long sum(long[] bit, int i){
long s = 0;
while(i > 0){
s += bit[i];
i -= i & -i;
}
return s;
}
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49743301
|
condefects-java_data_1741
|
import java.util.Scanner;
public class Main
{
public static void main(String [] args)
{
class solve
{
long bridge,connection;
solve(Scanner in)
{
this.bridge=in.nextLong();
this.connection=in.nextLong();
long []diff =new long[(int)bridge+2];
long last=-1,ans=0;
for(long i=0;i<connection;i++)
{
long now=in.nextLong();
long mini=last,maxi=now;
if(last!=-1)
{
if(last>now)
{
mini=now;
maxi=last;
}
long cost1=maxi-mini;
long cost2=mini+bridge-maxi;
ans+=Math.min(cost1,cost2);
long seperate=Math.abs(cost1-cost2);
if(cost1>cost2)
{
diff[1]+=seperate;
diff[(int)mini]-=seperate;
diff[(int)maxi]+=seperate;
}
else
{
diff[(int)mini]+=seperate;
diff[(int)maxi]-=seperate;
}
}
last=now;
}
long total=1000000000;
for(long i=1;i<=bridge;i++)
{
diff[(int)i]+=diff[(int)i-1];
total=Math.min(total,diff[(int)i]);
}
System.out.println(ans+total);
}
}
Scanner in=new Scanner(System.in);
solve n=new solve(in);
// close(in);
}
}
import java.util.Scanner;
public class Main
{
public static void main(String [] args)
{
class solve
{
long bridge,connection;
solve(Scanner in)
{
this.bridge=in.nextLong();
this.connection=in.nextLong();
long []diff =new long[(int)bridge+2];
long last=-1,ans=0;
for(long i=0;i<connection;i++)
{
long now=in.nextLong();
long mini=last,maxi=now;
if(last!=-1)
{
if(last>now)
{
mini=now;
maxi=last;
}
long cost1=maxi-mini;
long cost2=mini+bridge-maxi;
ans+=Math.min(cost1,cost2);
long seperate=Math.abs(cost1-cost2);
if(cost1>cost2)
{
diff[1]+=seperate;
diff[(int)mini]-=seperate;
diff[(int)maxi]+=seperate;
}
else
{
diff[(int)mini]+=seperate;
diff[(int)maxi]-=seperate;
}
}
last=now;
}
long total=(long)1e18;
for(long i=1;i<=bridge;i++)
{
diff[(int)i]+=diff[(int)i-1];
total=Math.min(total,diff[(int)i]);
}
System.out.println(ans+total);
}
}
Scanner in=new Scanner(System.in);
solve n=new solve(in);
// close(in);
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49753638
|
condefects-java_data_1742
|
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static long[] d;
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt(), m = sc.nextInt();
int[] x = new int[m + 1];
d = new long[n + 2];
for (int i = 1; i <= m; i++) {
x[i] = sc.nextInt();
}
long ans = 0;
for (int i = 1; i <= m - 1; i++) {
int from = x[i], to = x[i + 1];
if (from > to) {
int temp = from;
from = to;
to = temp;
}
if (to - from <= n + from - to) {
int dis = n + from - to - to + from;
d[from] += dis;
d[to] -= dis;
ans += to - from;
} else {
int dis = to - from - n - from + to;
d[1] += dis;
d[from - 1] -= dis;
d[to] += dis;
d[n + 1] -= dis;
ans += n + from - to;
}
}
long mn = Long.MAX_VALUE;
for (int i = 1; i <= n; i++) {
d[i] += d[i - 1];
mn = Math.min(mn, d[i]);
}
pw.println(ans + mn);
pw.close();
}
static class AReader {
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return br.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());
}
}
}
import java.io.*;
import java.util.*;
public class Main {
static PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
static long[] d;
public static void main(String[] args) {
AReader sc = new AReader();
int n = sc.nextInt(), m = sc.nextInt();
int[] x = new int[m + 1];
d = new long[n + 2];
for (int i = 1; i <= m; i++) {
x[i] = sc.nextInt();
}
long ans = 0;
for (int i = 1; i <= m - 1; i++) {
int from = x[i], to = x[i + 1];
if (from > to) {
int temp = from;
from = to;
to = temp;
}
if (to - from <= n + from - to) {
int dis = n + from - to - to + from;
d[from] += dis;
d[to] -= dis;
ans += to - from;
} else {
int dis = to - from - n - from + to;
d[1] += dis;
d[from] -= dis;
d[to] += dis;
d[n + 1] -= dis;
ans += n + from - to;
}
}
long mn = Long.MAX_VALUE;
for (int i = 1; i <= n; i++) {
d[i] += d[i - 1];
mn = Math.min(mn, d[i]);
}
pw.println(ans + mn);
pw.close();
}
static class AReader {
private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
private StringTokenizer tokenizer = new StringTokenizer("");
private String innerNextLine() {
try {
return br.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());
}
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49782378
|
condefects-java_data_1743
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
int[] x = new int[m];
long[] v = new long[n + 1];
for(int i = 0; i < m; i++) x[i] = Integer.parseInt(sc.next()) - 1;
for(int i = 0; i < m - 1; i++) {
add(x[i], x[i + 1], dist(x[i + 1], x[i], n), v, n);
add(x[i + 1], x[i], dist(x[i], x[i + 1], n), v, n);
}
long ans = 1 << 61;
for(int i = 0; i < n; i++) {
v[i + 1] += v[i];
ans = Math.min(ans, v[i]);
}
System.out.println(ans);
}
}
static int dist(int from, int to, int n) {
if(from <= to) return to - from;
else return to + n - from;
}
static void add(int from ,int to, int num, long[] v, int n) {
if(from <= to) {
v[from] += num;
v[to] -= num;
} else {
v[from] += num;
v[n] -= num;
v[0] += num;
v[to] -= num;
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
int m = Integer.parseInt(sc.next());
int[] x = new int[m];
long[] v = new long[n + 1];
for(int i = 0; i < m; i++) x[i] = Integer.parseInt(sc.next()) - 1;
for(int i = 0; i < m - 1; i++) {
add(x[i], x[i + 1], dist(x[i + 1], x[i], n), v, n);
add(x[i + 1], x[i], dist(x[i], x[i + 1], n), v, n);
}
long ans = 1L << 60;
for(int i = 0; i < n; i++) {
v[i + 1] += v[i];
ans = Math.min(ans, v[i]);
}
System.out.println(ans);
}
}
static int dist(int from, int to, int n) {
if(from <= to) return to - from;
else return to + n - from;
}
static void add(int from ,int to, int num, long[] v, int n) {
if(from <= to) {
v[from] += num;
v[to] -= num;
} else {
v[from] += num;
v[n] -= num;
v[0] += num;
v[to] -= num;
}
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/49753676
|
condefects-java_data_1744
|
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static int INF = Integer.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
int N = scanner.nextInt();
int M = scanner.nextInt();
int[] a = new int[M];
long[] imos = new long[N+1];
Arrays.setAll(a, i -> scanner.nextInt()-1);
for (int i = 0; i < M - 1; i++) {
int min = Math.min(a[i],a[i+1]);
int max = Math.max(a[i],a[i+1]);
//if (Math.abs(a[i+1]-a[i]) < N-Math.abs(a[i+1]-a[i])) {
int len = Math.abs(a[i+1]-a[i]);
int lenRev = N-Math.abs(a[i+1]-a[i]);
imos[0] += len;
imos[min] -= len;
imos[min] += lenRev;
imos[max] -= lenRev;
imos[max] += len;
imos[N] -= len;
}
long ans = INF;
for (int i = 0; i < N; i++) {
imos[i+1]+=imos[i];
ans = Math.min(ans, imos[i]);
}
System.out.println(ans);
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
static int MOD = 1000000007;
static long INF = Long.MAX_VALUE/2;
static void run (final FastScanner scanner, final PrintWriter out) {
int N = scanner.nextInt();
int M = scanner.nextInt();
int[] a = new int[M];
long[] imos = new long[N+1];
Arrays.setAll(a, i -> scanner.nextInt()-1);
for (int i = 0; i < M - 1; i++) {
int min = Math.min(a[i],a[i+1]);
int max = Math.max(a[i],a[i+1]);
//if (Math.abs(a[i+1]-a[i]) < N-Math.abs(a[i+1]-a[i])) {
int len = Math.abs(a[i+1]-a[i]);
int lenRev = N-Math.abs(a[i+1]-a[i]);
imos[0] += len;
imos[min] -= len;
imos[min] += lenRev;
imos[max] -= lenRev;
imos[max] += len;
imos[N] -= len;
}
long ans = INF;
for (int i = 0; i < N; i++) {
imos[i+1]+=imos[i];
ans = Math.min(ans, imos[i]);
}
System.out.println(ans);
}
public static void main(final String[] args) {
PrintWriter out = new PrintWriter(System.out);
FastScanner scanner = new FastScanner();
try {
run(scanner, out);
} catch (Throwable e) {
throw e;
} finally {
out.flush();
}
}
static class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
}
|
ConDefects/ConDefects/Code/abc338_d/Java/53489779
|
condefects-java_data_1745
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int M = scanner.nextInt();
String S = scanner.next();
String T = scanner.next();
scanner.close();
if ( T.startsWith(S) && T.endsWith(S)) {
System.out.println(0);
} else if (T.startsWith(S) && !T.endsWith(S)) {
System.out.println(1);
} else if (!T.startsWith(S) && T.endsWith(S)) {
System.out.println(2);
} else if (!T.startsWith(S) && !T.endsWith(S)) {
System.out.println(4);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
int M = scanner.nextInt();
String S = scanner.next();
String T = scanner.next();
scanner.close();
if ( T.startsWith(S) && T.endsWith(S)) {
System.out.println(0);
} else if (T.startsWith(S) && !T.endsWith(S)) {
System.out.println(1);
} else if (!T.startsWith(S) && T.endsWith(S)) {
System.out.println(2);
} else if (!T.startsWith(S) && !T.endsWith(S)) {
System.out.println(3);
}
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/51495597
|
condefects-java_data_1746
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
String s = sc.next();
String t = sc.next();
System.out.println(solve(s, t));
}
private static int solve(String s, String t) {
boolean isPrefix = t.startsWith(s);
boolean isSuffix = t.endsWith(s);
if (isPrefix) {
return isSuffix ? 0 : 1;
} else {
return isPrefix ? 2 : 3;
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
String s = sc.next();
String t = sc.next();
System.out.println(solve(s, t));
}
private static int solve(String s, String t) {
boolean isPrefix = t.startsWith(s);
boolean isSuffix = t.endsWith(s);
if (isPrefix) {
return isSuffix ? 0 : 1;
} else {
return isSuffix ? 2 : 3;
}
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/46132712
|
condefects-java_data_1747
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
String sa=sc.next();
String sb=sc.next();
boolean pre=false;
boolean su=false;
sc.close();
if(sb.endsWith(sa)){
su=true;
}
if(sb.startsWith(sa)){
pre=true;
}
if(sa.equals(sb)){
System.out.println(0);
}else if(pre&&!su){
System.out.println(1);
}else if(su&&!pre){
System.out.println(2);
}else{
System.out.println(3);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int a=sc.nextInt();
int b=sc.nextInt();
String sa=sc.next();
String sb=sc.next();
boolean pre=false;
boolean su=false;
sc.close();
if(sb.endsWith(sa)){
su=true;
}
if(sb.startsWith(sa)){
pre=true;
}
if(su&&pre){
System.out.println(0);
}else if(pre&&!su){
System.out.println(1);
}else if(su&&!pre){
System.out.println(2);
}else{
System.out.println(3);
}
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/46199992
|
condefects-java_data_1748
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n=input.nextInt();
int m=input.nextInt();
String s=input.next();
String t=input.next();
boolean prefix = true;
for(int i=0;i<n;++i){
if(s.charAt(i)!=t.charAt(i)){
prefix=false;
break;
}
}
boolean suffix = true;
for(int i=0;i<n;++i){
if(s.charAt(i)!=t.charAt(m-n+i)){
suffix=false;
break;
}
}
System.out.println(prefix&&suffix?0:(prefix?1:2));
input.close();
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n=input.nextInt();
int m=input.nextInt();
String s=input.next();
String t=input.next();
boolean prefix = true;
for(int i=0;i<n;++i){
if(s.charAt(i)!=t.charAt(i)){
prefix=false;
break;
}
}
boolean suffix = true;
for(int i=0;i<n;++i){
if(s.charAt(i)!=t.charAt(m-n+i)){
suffix=false;
break;
}
}
System.out.println(prefix&&suffix?0:(prefix?1:(suffix?2:3)));
input.close();
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/54252023
|
condefects-java_data_1749
|
// Source: https://usaco.guide/general/io
import java.io.*;
import java.util.StringTokenizer;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner input = new Scanner(System.in);
int N = input.nextInt();
int M = input.nextInt();
input.nextLine();
String S = input.nextLine();
String T = input.nextLine();
if (N == M && S.equals(T))
{
System.out.println("0");
}else if (N == M && !(S.equals(T)))
{
System.out.println("3");
}else {
String front = "";
String back = "";
for(int i = 0; i < N; i++)
{
front += T.charAt(i);
}
for(int j = M - N; j < N + 1; j++)
{
back += T.charAt(j);
}
if (S.equals(front) && S.equals(back))
{
System.out.println("0");
} else if (S.equals(front)){
System.out.println("1");
}else if (S.equals(back))
{
System.out.println("2");
}else
{
System.out.println("3");
}
}
}
}
// Source: https://usaco.guide/general/io
import java.io.*;
import java.util.StringTokenizer;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
Scanner input = new Scanner(System.in);
int N = input.nextInt();
int M = input.nextInt();
input.nextLine();
String S = input.nextLine();
String T = input.nextLine();
if (N == M && S.equals(T))
{
System.out.println("0");
}else if (N == M && !(S.equals(T)))
{
System.out.println("3");
}else {
String front = "";
String back = "";
for(int i = 0; i < N; i++)
{
front += T.charAt(i);
}
for(int j = M - N; j < M; j++)
{
back += T.charAt(j);
}
if (S.equals(front) && S.equals(back))
{
System.out.println("0");
} else if (S.equals(front)){
System.out.println("1");
}else if (S.equals(back))
{
System.out.println("2");
}else
{
System.out.println("3");
}
}
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/47858425
|
condefects-java_data_1750
|
import java.util.*;
public class Main {
public static void main (String[] args)
{
new Main().run();
}
void run ()
{
Scanner cin = new Scanner(System.in);
int N = cin.nextInt();
int M = cin.nextInt();
String S = cin.next();
String T = cin.next();
cin.close();
int ans = 3;
if (T.substring(0, N).equals(S)) {
ans -= 2;
}
if (T.substring(M-3, M).equals(S)) {
ans -= 1;
}
System.out.println(ans);
}
}
import java.util.*;
public class Main {
public static void main (String[] args)
{
new Main().run();
}
void run ()
{
Scanner cin = new Scanner(System.in);
int N = cin.nextInt();
int M = cin.nextInt();
String S = cin.next();
String T = cin.next();
cin.close();
int ans = 3;
if (T.substring(0, N).equals(S)) {
ans -= 2;
}
if (T.substring(M-N, M).equals(S)) {
ans -= 1;
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc322_b/Java/46141348
|
condefects-java_data_1751
|
import java.util.*;
import java.io.*;
class Main {
private static final void solve() throws IOException {
final int n = ni(), nn = n * n, n2 = n << 1;
fac = new long[n2 + 1];
fin = new long[n2 + 1];
fac[0] = 1L;
for (int i = 1; i <= n2; i++)
fac[i] = i * fac[i - 1] % mod;
fin[n2] = p(fac[n2], mod - 2);
for (int i = n2; i > 0; i--)
fin[i - 1] = i * fin[i] % mod;
var g = new ArrayList<ArrayList<Point>>(nn);
for (int i = 0; i < nn; i++)
g.add(new ArrayList<>());
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g.get(ni() - 1).add(new Point(i, i + j));
g.removeIf(ArrayList::isEmpty);
long ans = 0L;
for (var gg : g) {
var d = new long[n];
Collections.sort(gg, Comparator.comparingInt(i -> i.y));
for (var p : gg) {
final int ai = p.x, bi = p.y;
for (int k = 0; k + ai < n; k++) {
long mul = com(bi - 1 + k, k);
if ((k & 1) == 1)
mul = mod - mul;
d[k + ai] += mul;
d[k + ai] %= mod;
}
for (int k = 0; k <= ai; k++)
ans += com(bi, k) * d[ai - k] % mod;
}
}
ou.println(ans);
}
private static final long com(int n, int k) {
if (k == 0)
return 1L;
if (n < 0 || k < 0 || n - k < 0)
return 0L;
return fin[k] * fin[n - k] % mod * fac[n] % mod;
}
private static final long p(long a, long b) {
if (b == 0)
return 1;
if ((b & 1) == 1)
return a * p(a, b - 1) % mod;
return p(a * a % mod, b >> 1);
}
private static long[] fac, fin;
private static final long mod = 998244353L;
private static final class Point {
final int x, y;
Point(int xx, int yy) {
x = xx;
y = yy;
}
}
public static void main(String[] args) throws IOException {
// for (int i = 0, t = ni(); i < t; i++)
solve();
ou.flush();
}
private static final int ni() throws IOException {
return sc.nextInt();
}
private static final int[] ni(int n) throws IOException {
return sc.nextIntArray(n);
}
private static final int[] ni1(int n) throws IOException {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni() - 1;
return a;
}
private static final long nl() throws IOException {
return sc.nextLong();
}
private static final long[] nl(int n) throws IOException {
return sc.nextLongArray(n);
}
private static final String ns() throws IOException {
return sc.next();
}
private static final char[] nc() throws IOException {
return sc.nextCharArray();
}
private static final int[] nc1() throws IOException {
char[] c = nc();
int n = c.length;
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = c[i] - '0';
return a;
}
private static final int[] nca() throws IOException {
char[] c = nc();
int n = c.length;
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = c[i] - 'a';
return a;
}
private static final double nd() throws IOException {
return sc.nextDouble();
}
private static final ContestInputStream sc = new ContestInputStream();
private static final ContestOutputStream ou = new ContestOutputStream();
}
final class ContestInputStream extends FilterInputStream {
protected final byte[] buf;
protected int pos = 0;
protected int lim = 0;
private final char[] cbuf;
public ContestInputStream() {
super(System.in);
this.buf = new byte[1 << 13];
this.cbuf = new char[1 << 20];
}
boolean hasRemaining() throws IOException {
if (pos < lim)
return true;
lim = in.read(buf);
pos = 0;
return lim > 0;
}
final int remaining() throws IOException {
if (pos >= lim) {
lim = in.read(buf);
pos = 0;
}
return lim - pos;
}
@Override
public final int available() throws IOException {
if (pos < lim)
return lim - pos + in.available();
return in.available();
}
@Override
public final long skip(long n) throws IOException {
if (pos < lim) {
int rem = lim - pos;
if (n < rem) {
pos += n;
return n;
}
pos = lim;
return rem;
}
return in.skip(n);
}
@Override
public final int read() throws IOException {
if (hasRemaining())
return buf[pos++];
return -1;
}
@Override
public final int read(byte[] b, int off, int len) throws IOException {
if (pos < lim) {
int rem = Math.min(lim - pos, len);
for (int i = 0; i < rem; i++)
b[off + i] = buf[pos + i];
pos += rem;
return rem;
}
return in.read(b, off, len);
}
public final char[] readToken() throws IOException {
int cpos = 0;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
char[] arr = new char[cpos];
for (int i = 0; i < cpos; i++)
arr[i] = cbuf[i];
return arr;
}
public final int readToken(char[] cbuf, int off) throws IOException {
int cpos = off;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
return cpos - off;
}
public final int readToken(char[] cbuf) throws IOException {
return readToken(cbuf, 0);
}
public final String next() throws IOException {
int cpos = 0;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
return String.valueOf(cbuf, 0, cpos);
}
public final char[] nextCharArray() throws IOException {
return readToken();
}
public final int nextInt() throws IOException {
if (!hasRemaining())
return 0;
int value = 0;
byte b = buf[pos++];
if (b == 0x2d) {
while (hasRemaining() && (b = buf[pos++]) > 0x20)
value = (value << 3) + (value << 1) - b + 0x30;
} else {
do {
value = (value << 3) + (value << 1) + b - 0x30;
} while (hasRemaining() && (b = buf[pos++]) > 0x20);
}
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return value;
}
public final long nextLong() throws IOException {
if (!hasRemaining())
return 0L;
long value = 0L;
byte b = buf[pos++];
if (b == 0x2d) {
while (hasRemaining() && (b = buf[pos++]) > 0x20)
value = (value << 3) + (value << 1) - b + 0x30;
} else {
do {
value = (value << 3) + (value << 1) + b - 0x30;
} while (hasRemaining() && (b = buf[pos++]) > 0x20);
}
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return value;
}
public final char nextChar() throws IOException {
if (!hasRemaining())
throw new EOFException();
final char c = (char) buf[pos++];
if (hasRemaining() && buf[pos++] == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return c;
}
public final float nextFloat() throws IOException {
return Float.parseFloat(next());
}
public final double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public final boolean[] nextBooleanArray(char ok) throws IOException {
char[] s = readToken();
int n = s.length;
boolean[] t = new boolean[n];
for (int i = 0; i < n; i++)
t[i] = s[i] == ok;
return t;
}
public final boolean[][] nextBooleanMatrix(int h, int w, char ok) throws IOException {
boolean[][] s = new boolean[h][];
for (int i = 0; i < h; i++) {
char[] t = readToken();
int n = t.length;
s[i] = new boolean[n];
for (int j = 0; j < n; j++)
s[i][j] = t[j] == ok;
}
return s;
}
public final String[] nextStringArray(int len) throws IOException {
String[] arr = new String[len];
for (int i = 0; i < len; i++)
arr[i] = next();
return arr;
}
public final int[] nextIntArray(int len) throws IOException {
int[] arr = new int[len];
for (int i = 0; i < len; i++)
arr[i] = nextInt();
return arr;
}
public final int[] nextIntArray(int len, java.util.function.IntUnaryOperator map) throws IOException {
int[] arr = new int[len];
for (int i = 0; i < len; i++)
arr[i] = map.applyAsInt(nextInt());
return arr;
}
public final long[] nextLongArray(int len, java.util.function.LongUnaryOperator map) throws IOException {
long[] arr = new long[len];
for (int i = 0; i < len; i++)
arr[i] = map.applyAsLong(nextLong());
return arr;
}
public final int[][] nextIntMatrix(int h, int w) throws IOException {
int[][] arr = new int[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = nextInt();
return arr;
}
public final int[][] nextIntMatrix(int h, int w, java.util.function.IntUnaryOperator map) throws IOException {
int[][] arr = new int[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = map.applyAsInt(nextInt());
return arr;
}
public final long[] nextLongArray(int len) throws IOException {
long[] arr = new long[len];
for (int i = 0; i < len; i++)
arr[i] = nextLong();
return arr;
}
public final long[][] nextLongMatrix(int h, int w) throws IOException {
long[][] arr = new long[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = nextLong();
return arr;
}
public final float[] nextFloatArray(int len) throws IOException {
float[] arr = new float[len];
for (int i = 0; i < len; i++)
arr[i] = nextFloat();
return arr;
}
public final double[] nextDoubleArray(int len) throws IOException {
double[] arr = new double[len];
for (int i = 0; i < len; i++)
arr[i] = nextDouble();
return arr;
}
public final char[][] nextCharMatrix(int h, int w) throws IOException {
char[][] arr = new char[h][];
for (int i = 0; i < h; i++)
arr[i] = readToken();
return arr;
}
public final void nextThrow() throws IOException {
next();
return;
}
public final void nextThrow(int n) throws IOException {
for (int i = 0; i < n; i++)
nextThrow();
return;
}
}
final class ContestOutputStream extends FilterOutputStream implements Appendable {
protected final byte[] buf;
protected int pos = 0;
public ContestOutputStream() {
super(System.out);
this.buf = new byte[1 << 13];
}
@Override
public void flush() throws IOException {
out.write(buf, 0, pos);
pos = 0;
out.flush();
}
void put(byte b) throws IOException {
if (pos >= buf.length)
flush();
buf[pos++] = b;
}
int remaining() throws IOException {
if (pos >= buf.length)
flush();
return buf.length - pos;
}
@Override
public void write(int b) throws IOException {
put((byte) b);
}
@Override
public void write(byte[] b, int off, int len) throws IOException {
int o = off;
int l = len;
while (l > 0) {
int rem = Math.min(remaining(), l);
for (int i = 0; i < rem; i++)
buf[pos + i] = b[o + i];
pos += rem;
o += rem;
l -= rem;
}
}
@Override
public ContestOutputStream append(char c) throws IOException {
put((byte) c);
return this;
}
@Override
public ContestOutputStream append(CharSequence csq, int start, int end) throws IOException {
int off = start;
int len = end - start;
while (len > 0) {
int rem = Math.min(remaining(), len);
for (int i = 0; i < rem; i++)
buf[pos + i] = (byte) csq.charAt(off + i);
pos += rem;
off += rem;
len -= rem;
}
return this;
}
@Override
public ContestOutputStream append(CharSequence csq) throws IOException {
return append(csq, 0, csq.length());
}
public ContestOutputStream append(char[] arr, int off, int len) throws IOException {
int o = off;
int l = len;
while (l > 0) {
int rem = Math.min(remaining(), l);
for (int i = 0; i < rem; i++)
buf[pos + i] = (byte) arr[o + i];
pos += rem;
o += rem;
l -= rem;
}
return this;
}
public ContestOutputStream print(char[] arr) throws IOException {
return append(arr, 0, arr.length).newLine();
}
public ContestOutputStream print(boolean value) throws IOException {
if (value)
return append("o");
return append(".");
}
public ContestOutputStream println(boolean value) throws IOException {
if (value)
return append("o\n");
return append(".\n");
}
public ContestOutputStream print(boolean[][] value) throws IOException {
final int n = value.length, m = value[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
print(value[i][j]);
newLine();
}
return this;
}
public ContestOutputStream print(int value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(int value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(long value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(long value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(float value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(float value) throws IOException {
return append(String.valueOf(value)).newLine();
}
private ContestOutputStream dtos(double x, int n) throws IOException {
if (x < 0) {
append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
long longx = (long) x;
print(longx);
append('.');
x -= longx;
for (int i = 0; i < n; i++) {
x *= 10;
int intx = (int) x;
print(intx);
x -= intx;
}
return this;
}
public ContestOutputStream print(double value) throws IOException {
return dtos(value, 20);
}
public ContestOutputStream println(double value) throws IOException {
return dtos(value, 20).newLine();
}
public ContestOutputStream print(char value) throws IOException {
return append(value);
}
public ContestOutputStream println(char value) throws IOException {
return append(value).newLine();
}
public ContestOutputStream print(String value) throws IOException {
return append(value);
}
public ContestOutputStream println(String value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(Object value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(Object value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream printYN(boolean yes) throws IOException {
if (yes)
return println("Yes");
return println("No");
}
public ContestOutputStream printAB(boolean yes) throws IOException {
if (yes)
return println("Alice");
return println("Bob");
}
public ContestOutputStream print(CharSequence[] arr) throws IOException {
if (arr.length > 0) {
append(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').append(arr[i]);
}
return this;
}
public ContestOutputStream print(int[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(int[] arr, int length) throws IOException {
if (length > 0)
print(arr[0]);
for (int i = 1; i < length; i++)
append('\u0020').print(arr[i]);
newLine();
return this;
}
public ContestOutputStream println(int[] arr) throws IOException {
for (int i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream println(int[] arr, int length) throws IOException {
for (int i = 0; i < length; i++)
println(arr[i]);
return this;
}
public ContestOutputStream print(boolean[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(long[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(long[] arr, int length) throws IOException {
if (length > 0)
print(arr[0]);
for (int i = 1; i < length; i++)
append('\u0020').print(arr[i]);
newLine();
return this;
}
public ContestOutputStream println(long[] arr, int length) throws IOException {
for (int i = 0; i < length; i++)
println(arr[i]);
return this;
}
public ContestOutputStream println(long[] arr) throws IOException {
for (long i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(float[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return this;
}
public ContestOutputStream println(float[] arr) throws IOException {
for (float i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(double[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return newLine();
}
public ContestOutputStream println(double[] arr) throws IOException {
for (double i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(Object[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return newLine();
}
public ContestOutputStream print(java.util.ArrayList<?> arr) throws IOException {
if (!arr.isEmpty()) {
final int n = arr.size();
print(arr.get(0));
for (int i = 1; i < n; i++)
print(" ").print(arr.get(i));
}
return newLine();
}
public ContestOutputStream println(java.util.ArrayList<?> arr) throws IOException {
final int n = arr.size();
for (int i = 0; i < n; i++)
println(arr.get(i));
return this;
}
public ContestOutputStream newLine() throws IOException {
return append(System.lineSeparator());
}
public ContestOutputStream endl() throws IOException {
newLine().flush();
return this;
}
public ContestOutputStream print(int[][] arr) throws IOException {
for (int[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(long[][] arr) throws IOException {
for (long[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(char[][] arr) throws IOException {
for (char[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(Object[][] arr) throws IOException {
for (Object[] i : arr)
print(i);
return this;
}
public ContestOutputStream println() throws IOException {
return newLine();
}
public ContestOutputStream println(Object... arr) throws IOException {
for (Object i : arr)
print(i);
return newLine();
}
public ContestOutputStream printToChar(int c) throws IOException {
return print((char) c);
}
}
import java.util.*;
import java.io.*;
class Main {
private static final void solve() throws IOException {
final int n = ni(), nn = n * n, n2 = n << 1;
fac = new long[n2 + 1];
fin = new long[n2 + 1];
fac[0] = 1L;
for (int i = 1; i <= n2; i++)
fac[i] = i * fac[i - 1] % mod;
fin[n2] = p(fac[n2], mod - 2);
for (int i = n2; i > 0; i--)
fin[i - 1] = i * fin[i] % mod;
var g = new ArrayList<ArrayList<Point>>(nn);
for (int i = 0; i < nn; i++)
g.add(new ArrayList<>());
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
g.get(ni() - 1).add(new Point(i, i + j));
g.removeIf(ArrayList::isEmpty);
long ans = 0L;
for (var gg : g) {
var d = new long[n];
Collections.sort(gg, Comparator.comparingInt(i -> i.y));
for (var p : gg) {
final int ai = p.x, bi = p.y;
for (int k = 0; k + ai < n; k++) {
long mul = com(bi - 1 + k, k);
if ((k & 1) == 1)
mul = mod - mul;
d[k + ai] += mul;
d[k + ai] %= mod;
}
for (int k = 0; k <= ai; k++)
ans += com(bi, k) * d[ai - k] % mod;
}
}
ou.println(ans % mod);
}
private static final long com(int n, int k) {
if (k == 0)
return 1L;
if (n < 0 || k < 0 || n - k < 0)
return 0L;
return fin[k] * fin[n - k] % mod * fac[n] % mod;
}
private static final long p(long a, long b) {
if (b == 0)
return 1;
if ((b & 1) == 1)
return a * p(a, b - 1) % mod;
return p(a * a % mod, b >> 1);
}
private static long[] fac, fin;
private static final long mod = 998244353L;
private static final class Point {
final int x, y;
Point(int xx, int yy) {
x = xx;
y = yy;
}
}
public static void main(String[] args) throws IOException {
// for (int i = 0, t = ni(); i < t; i++)
solve();
ou.flush();
}
private static final int ni() throws IOException {
return sc.nextInt();
}
private static final int[] ni(int n) throws IOException {
return sc.nextIntArray(n);
}
private static final int[] ni1(int n) throws IOException {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni() - 1;
return a;
}
private static final long nl() throws IOException {
return sc.nextLong();
}
private static final long[] nl(int n) throws IOException {
return sc.nextLongArray(n);
}
private static final String ns() throws IOException {
return sc.next();
}
private static final char[] nc() throws IOException {
return sc.nextCharArray();
}
private static final int[] nc1() throws IOException {
char[] c = nc();
int n = c.length;
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = c[i] - '0';
return a;
}
private static final int[] nca() throws IOException {
char[] c = nc();
int n = c.length;
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = c[i] - 'a';
return a;
}
private static final double nd() throws IOException {
return sc.nextDouble();
}
private static final ContestInputStream sc = new ContestInputStream();
private static final ContestOutputStream ou = new ContestOutputStream();
}
final class ContestInputStream extends FilterInputStream {
protected final byte[] buf;
protected int pos = 0;
protected int lim = 0;
private final char[] cbuf;
public ContestInputStream() {
super(System.in);
this.buf = new byte[1 << 13];
this.cbuf = new char[1 << 20];
}
boolean hasRemaining() throws IOException {
if (pos < lim)
return true;
lim = in.read(buf);
pos = 0;
return lim > 0;
}
final int remaining() throws IOException {
if (pos >= lim) {
lim = in.read(buf);
pos = 0;
}
return lim - pos;
}
@Override
public final int available() throws IOException {
if (pos < lim)
return lim - pos + in.available();
return in.available();
}
@Override
public final long skip(long n) throws IOException {
if (pos < lim) {
int rem = lim - pos;
if (n < rem) {
pos += n;
return n;
}
pos = lim;
return rem;
}
return in.skip(n);
}
@Override
public final int read() throws IOException {
if (hasRemaining())
return buf[pos++];
return -1;
}
@Override
public final int read(byte[] b, int off, int len) throws IOException {
if (pos < lim) {
int rem = Math.min(lim - pos, len);
for (int i = 0; i < rem; i++)
b[off + i] = buf[pos + i];
pos += rem;
return rem;
}
return in.read(b, off, len);
}
public final char[] readToken() throws IOException {
int cpos = 0;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
char[] arr = new char[cpos];
for (int i = 0; i < cpos; i++)
arr[i] = cbuf[i];
return arr;
}
public final int readToken(char[] cbuf, int off) throws IOException {
int cpos = off;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
return cpos - off;
}
public final int readToken(char[] cbuf) throws IOException {
return readToken(cbuf, 0);
}
public final String next() throws IOException {
int cpos = 0;
int rem;
byte b;
l: while ((rem = remaining()) > 0) {
for (int i = 0; i < rem; i++) {
b = buf[pos + i];
if (b <= 0x20) {
pos += i + 1;
cpos += i;
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
break l;
}
cbuf[cpos + i] = (char) b;
}
pos += rem;
cpos += rem;
}
return String.valueOf(cbuf, 0, cpos);
}
public final char[] nextCharArray() throws IOException {
return readToken();
}
public final int nextInt() throws IOException {
if (!hasRemaining())
return 0;
int value = 0;
byte b = buf[pos++];
if (b == 0x2d) {
while (hasRemaining() && (b = buf[pos++]) > 0x20)
value = (value << 3) + (value << 1) - b + 0x30;
} else {
do {
value = (value << 3) + (value << 1) + b - 0x30;
} while (hasRemaining() && (b = buf[pos++]) > 0x20);
}
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return value;
}
public final long nextLong() throws IOException {
if (!hasRemaining())
return 0L;
long value = 0L;
byte b = buf[pos++];
if (b == 0x2d) {
while (hasRemaining() && (b = buf[pos++]) > 0x20)
value = (value << 3) + (value << 1) - b + 0x30;
} else {
do {
value = (value << 3) + (value << 1) + b - 0x30;
} while (hasRemaining() && (b = buf[pos++]) > 0x20);
}
if (b == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return value;
}
public final char nextChar() throws IOException {
if (!hasRemaining())
throw new EOFException();
final char c = (char) buf[pos++];
if (hasRemaining() && buf[pos++] == 0x0d && hasRemaining() && buf[pos] == 0x0a)
pos++;
return c;
}
public final float nextFloat() throws IOException {
return Float.parseFloat(next());
}
public final double nextDouble() throws IOException {
return Double.parseDouble(next());
}
public final boolean[] nextBooleanArray(char ok) throws IOException {
char[] s = readToken();
int n = s.length;
boolean[] t = new boolean[n];
for (int i = 0; i < n; i++)
t[i] = s[i] == ok;
return t;
}
public final boolean[][] nextBooleanMatrix(int h, int w, char ok) throws IOException {
boolean[][] s = new boolean[h][];
for (int i = 0; i < h; i++) {
char[] t = readToken();
int n = t.length;
s[i] = new boolean[n];
for (int j = 0; j < n; j++)
s[i][j] = t[j] == ok;
}
return s;
}
public final String[] nextStringArray(int len) throws IOException {
String[] arr = new String[len];
for (int i = 0; i < len; i++)
arr[i] = next();
return arr;
}
public final int[] nextIntArray(int len) throws IOException {
int[] arr = new int[len];
for (int i = 0; i < len; i++)
arr[i] = nextInt();
return arr;
}
public final int[] nextIntArray(int len, java.util.function.IntUnaryOperator map) throws IOException {
int[] arr = new int[len];
for (int i = 0; i < len; i++)
arr[i] = map.applyAsInt(nextInt());
return arr;
}
public final long[] nextLongArray(int len, java.util.function.LongUnaryOperator map) throws IOException {
long[] arr = new long[len];
for (int i = 0; i < len; i++)
arr[i] = map.applyAsLong(nextLong());
return arr;
}
public final int[][] nextIntMatrix(int h, int w) throws IOException {
int[][] arr = new int[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = nextInt();
return arr;
}
public final int[][] nextIntMatrix(int h, int w, java.util.function.IntUnaryOperator map) throws IOException {
int[][] arr = new int[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = map.applyAsInt(nextInt());
return arr;
}
public final long[] nextLongArray(int len) throws IOException {
long[] arr = new long[len];
for (int i = 0; i < len; i++)
arr[i] = nextLong();
return arr;
}
public final long[][] nextLongMatrix(int h, int w) throws IOException {
long[][] arr = new long[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
arr[i][j] = nextLong();
return arr;
}
public final float[] nextFloatArray(int len) throws IOException {
float[] arr = new float[len];
for (int i = 0; i < len; i++)
arr[i] = nextFloat();
return arr;
}
public final double[] nextDoubleArray(int len) throws IOException {
double[] arr = new double[len];
for (int i = 0; i < len; i++)
arr[i] = nextDouble();
return arr;
}
public final char[][] nextCharMatrix(int h, int w) throws IOException {
char[][] arr = new char[h][];
for (int i = 0; i < h; i++)
arr[i] = readToken();
return arr;
}
public final void nextThrow() throws IOException {
next();
return;
}
public final void nextThrow(int n) throws IOException {
for (int i = 0; i < n; i++)
nextThrow();
return;
}
}
final class ContestOutputStream extends FilterOutputStream implements Appendable {
protected final byte[] buf;
protected int pos = 0;
public ContestOutputStream() {
super(System.out);
this.buf = new byte[1 << 13];
}
@Override
public void flush() throws IOException {
out.write(buf, 0, pos);
pos = 0;
out.flush();
}
void put(byte b) throws IOException {
if (pos >= buf.length)
flush();
buf[pos++] = b;
}
int remaining() throws IOException {
if (pos >= buf.length)
flush();
return buf.length - pos;
}
@Override
public void write(int b) throws IOException {
put((byte) b);
}
@Override
public void write(byte[] b, int off, int len) throws IOException {
int o = off;
int l = len;
while (l > 0) {
int rem = Math.min(remaining(), l);
for (int i = 0; i < rem; i++)
buf[pos + i] = b[o + i];
pos += rem;
o += rem;
l -= rem;
}
}
@Override
public ContestOutputStream append(char c) throws IOException {
put((byte) c);
return this;
}
@Override
public ContestOutputStream append(CharSequence csq, int start, int end) throws IOException {
int off = start;
int len = end - start;
while (len > 0) {
int rem = Math.min(remaining(), len);
for (int i = 0; i < rem; i++)
buf[pos + i] = (byte) csq.charAt(off + i);
pos += rem;
off += rem;
len -= rem;
}
return this;
}
@Override
public ContestOutputStream append(CharSequence csq) throws IOException {
return append(csq, 0, csq.length());
}
public ContestOutputStream append(char[] arr, int off, int len) throws IOException {
int o = off;
int l = len;
while (l > 0) {
int rem = Math.min(remaining(), l);
for (int i = 0; i < rem; i++)
buf[pos + i] = (byte) arr[o + i];
pos += rem;
o += rem;
l -= rem;
}
return this;
}
public ContestOutputStream print(char[] arr) throws IOException {
return append(arr, 0, arr.length).newLine();
}
public ContestOutputStream print(boolean value) throws IOException {
if (value)
return append("o");
return append(".");
}
public ContestOutputStream println(boolean value) throws IOException {
if (value)
return append("o\n");
return append(".\n");
}
public ContestOutputStream print(boolean[][] value) throws IOException {
final int n = value.length, m = value[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
print(value[i][j]);
newLine();
}
return this;
}
public ContestOutputStream print(int value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(int value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(long value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(long value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(float value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(float value) throws IOException {
return append(String.valueOf(value)).newLine();
}
private ContestOutputStream dtos(double x, int n) throws IOException {
if (x < 0) {
append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
long longx = (long) x;
print(longx);
append('.');
x -= longx;
for (int i = 0; i < n; i++) {
x *= 10;
int intx = (int) x;
print(intx);
x -= intx;
}
return this;
}
public ContestOutputStream print(double value) throws IOException {
return dtos(value, 20);
}
public ContestOutputStream println(double value) throws IOException {
return dtos(value, 20).newLine();
}
public ContestOutputStream print(char value) throws IOException {
return append(value);
}
public ContestOutputStream println(char value) throws IOException {
return append(value).newLine();
}
public ContestOutputStream print(String value) throws IOException {
return append(value);
}
public ContestOutputStream println(String value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream print(Object value) throws IOException {
return append(String.valueOf(value));
}
public ContestOutputStream println(Object value) throws IOException {
return append(String.valueOf(value)).newLine();
}
public ContestOutputStream printYN(boolean yes) throws IOException {
if (yes)
return println("Yes");
return println("No");
}
public ContestOutputStream printAB(boolean yes) throws IOException {
if (yes)
return println("Alice");
return println("Bob");
}
public ContestOutputStream print(CharSequence[] arr) throws IOException {
if (arr.length > 0) {
append(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').append(arr[i]);
}
return this;
}
public ContestOutputStream print(int[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(int[] arr, int length) throws IOException {
if (length > 0)
print(arr[0]);
for (int i = 1; i < length; i++)
append('\u0020').print(arr[i]);
newLine();
return this;
}
public ContestOutputStream println(int[] arr) throws IOException {
for (int i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream println(int[] arr, int length) throws IOException {
for (int i = 0; i < length; i++)
println(arr[i]);
return this;
}
public ContestOutputStream print(boolean[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(long[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
newLine();
return this;
}
public ContestOutputStream print(long[] arr, int length) throws IOException {
if (length > 0)
print(arr[0]);
for (int i = 1; i < length; i++)
append('\u0020').print(arr[i]);
newLine();
return this;
}
public ContestOutputStream println(long[] arr, int length) throws IOException {
for (int i = 0; i < length; i++)
println(arr[i]);
return this;
}
public ContestOutputStream println(long[] arr) throws IOException {
for (long i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(float[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return this;
}
public ContestOutputStream println(float[] arr) throws IOException {
for (float i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(double[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return newLine();
}
public ContestOutputStream println(double[] arr) throws IOException {
for (double i : arr)
print(i).newLine();
return this;
}
public ContestOutputStream print(Object[] arr) throws IOException {
if (arr.length > 0) {
print(arr[0]);
for (int i = 1; i < arr.length; i++)
append('\u0020').print(arr[i]);
}
return newLine();
}
public ContestOutputStream print(java.util.ArrayList<?> arr) throws IOException {
if (!arr.isEmpty()) {
final int n = arr.size();
print(arr.get(0));
for (int i = 1; i < n; i++)
print(" ").print(arr.get(i));
}
return newLine();
}
public ContestOutputStream println(java.util.ArrayList<?> arr) throws IOException {
final int n = arr.size();
for (int i = 0; i < n; i++)
println(arr.get(i));
return this;
}
public ContestOutputStream newLine() throws IOException {
return append(System.lineSeparator());
}
public ContestOutputStream endl() throws IOException {
newLine().flush();
return this;
}
public ContestOutputStream print(int[][] arr) throws IOException {
for (int[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(long[][] arr) throws IOException {
for (long[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(char[][] arr) throws IOException {
for (char[] i : arr)
print(i);
return this;
}
public ContestOutputStream print(Object[][] arr) throws IOException {
for (Object[] i : arr)
print(i);
return this;
}
public ContestOutputStream println() throws IOException {
return newLine();
}
public ContestOutputStream println(Object... arr) throws IOException {
for (Object i : arr)
print(i);
return newLine();
}
public ContestOutputStream printToChar(int c) throws IOException {
return print((char) c);
}
}
|
ConDefects/ConDefects/Code/abc259_h/Java/46015626
|
condefects-java_data_1752
|
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
FastScanner sc = new FastScanner();
int T = sc.nextInt();
List<Long> zi = new ArrayList<Long>();
List<Long> san = new ArrayList<Long>();
// long[] san = new long[100000];
for(long i = 1; i < 1000000000000000000l; i *= 2){
zi.add(i);
}
// int now = 0;
for(int a = 0; a < zi.size() - 2; a++){
for(int b = a + 1; b < zi.size() - 1; b++){
for(int c = a + 2; c < zi.size(); c++){
// san[now] = zi.get(a) + zi.get(b) + zi.get(c);
san.add(zi.get(a) + zi.get(b) + zi.get(c));
// now++;
}
}
}
// Arrays.parallelSort(san);
Collections.sort(san);
san.remove(san.size()-1);
// System.out.println(san[99998]);
// System.out.println(san.get(san.size()-1));
for(int i = 0; i < T; i++){
long N = sc.nextLong();
if(N < 7){
System.out.println(-1);
}else{
System.out.println(san.get(bisect_left(N,san) - 1));
}
// 線形探索
// for(int j = san.size()-1; j >= 0; j--){
// if(N >= san.get(j)){
// System.out.println(san.get(j));
// break;
// }
// }
}
}
public static int bisect_left(long a, List<Long> b){
int ng = -1;
int ok = b.size();
while (Math.abs(ok - ng) > 1){
int mid = (ok + ng) / 2;
if(a <= b.get(mid)){
ok = mid;
if(a == b.get(mid)){
return ok+1;
}
}else{
ng = mid;
}
}
// System.out.println(b.get(ok));
// System.out.println(a);
return ok;
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args){
FastScanner sc = new FastScanner();
int T = sc.nextInt();
List<Long> zi = new ArrayList<Long>();
List<Long> san = new ArrayList<Long>();
// long[] san = new long[100000];
for(long i = 1; i < 1000000000000000000l; i *= 2){
zi.add(i);
}
// int now = 0;
for(int a = 0; a < zi.size() - 2; a++){
for(int b = a + 1; b < zi.size() - 1; b++){
for(int c = b + 1; c < zi.size(); c++){
// san[now] = zi.get(a) + zi.get(b) + zi.get(c);
san.add(zi.get(a) + zi.get(b) + zi.get(c));
// now++;
}
}
}
// Arrays.parallelSort(san);
Collections.sort(san);
san.remove(san.size()-1);
// System.out.println(san[99998]);
// System.out.println(san.get(san.size()-1));
for(int i = 0; i < T; i++){
long N = sc.nextLong();
if(N < 7){
System.out.println(-1);
}else{
System.out.println(san.get(bisect_left(N,san) - 1));
}
// 線形探索
// for(int j = san.size()-1; j >= 0; j--){
// if(N >= san.get(j)){
// System.out.println(san.get(j));
// break;
// }
// }
}
}
public static int bisect_left(long a, List<Long> b){
int ng = -1;
int ok = b.size();
while (Math.abs(ok - ng) > 1){
int mid = (ok + ng) / 2;
if(a <= b.get(mid)){
ok = mid;
if(a == b.get(mid)){
return ok+1;
}
}else{
ng = mid;
}
}
// System.out.println(b.get(ok));
// System.out.println(a);
return ok;
}
}
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/arc161_b/Java/41814585
|
condefects-java_data_1753
|
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
Main o = new Main();
o.solve();
}
int K = 14;
public void solve() {
FastScanner sc = new FastScanner(System.in);
int N = sc.nextInt();
int[] X = new int[N];
int[] Y = new int[N];
for (int i = 0; i < N; i++) {
X[i] = sc.nextInt();
Y[i] = sc.nextInt();
}
double[][] dp = new double[N][K];
for (int i = 0; i < N; i++) {
Arrays.fill(dp[i], Long.MAX_VALUE);
}
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 0; k < K; k++) {
if ( dp[i][k] >= Long.MAX_VALUE ) continue;
for (int kn = 0; k + kn < K && i + kn + 1 < N ; kn++) {
int n = i + kn + 1;
dp[n][k + kn] = Math.min(dp[n][k + kn], dp[i][k] + dist(i, n, X, Y));
}
}
}
double ans = dp[N - 1][0];
for (int k = 1; k < K; k++) {
if ( dp[N - 1][k] >= Long.MAX_VALUE ) continue;
ans = Math.min(ans, dp[N - 1][k] + (1 << (k - 1)));
}
System.out.println(String.format("%.20f", ans));
}
double dist(int i, int j, int[] X, int[] Y) {
int dx = X[j] - X[i];
int dy = Y[j] - Y[i];
return Math.sqrt(dx * dx + dy * dy);
}
class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner( InputStream source ) { this.in = source; }
private boolean hasNextByte() {
if ( ptr < buflen ) return true;
else {
ptr = 0;
try { buflen = in.read(buf); } catch (IOException e) { e.printStackTrace(); }
if ( buflen <= 0 ) return false;
}
return true;
}
private int readByte() { if ( hasNextByte() ) return buf[ptr++]; else return -1; }
private boolean isPrintableChar( int c ) { return 33 <= c && c <= 126; }
private boolean isNumeric( int c ) { return '0' <= c && c <= '9'; }
private void skipToNextPrintableChar() { while ( hasNextByte() && !isPrintableChar(buf[ptr]) ) ptr++; }
public boolean hasNext() { skipToNextPrintableChar(); return hasNextByte(); }
public String next() {
if ( !hasNext() ) throw new NoSuchElementException();
StringBuilder ret = new StringBuilder();
int b = readByte();
while ( isPrintableChar(b) ) { ret.appendCodePoint(b); b = readByte(); }
return ret.toString();
}
public long nextLong() {
if ( !hasNext() ) throw new NoSuchElementException();
long ret = 0;
int b = readByte();
boolean negative = false;
if ( b == '-' ) { negative = true; if ( hasNextByte() ) b = readByte(); }
if ( !isNumeric(b) ) throw new NumberFormatException();
while ( true ) {
if ( isNumeric(b) ) ret = ret * 10 + b - '0';
else if ( b == -1 || !isPrintableChar(b) ) return negative ? -ret : ret;
else throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() { return (int)nextLong(); }
public double nextDouble() { return Double.parseDouble(next()); }
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
Main o = new Main();
o.solve();
}
int K = 18;
public void solve() {
FastScanner sc = new FastScanner(System.in);
int N = sc.nextInt();
int[] X = new int[N];
int[] Y = new int[N];
for (int i = 0; i < N; i++) {
X[i] = sc.nextInt();
Y[i] = sc.nextInt();
}
double[][] dp = new double[N][K];
for (int i = 0; i < N; i++) {
Arrays.fill(dp[i], Long.MAX_VALUE);
}
dp[0][0] = 0;
for (int i = 0; i < N; i++) {
for (int k = 0; k < K; k++) {
if ( dp[i][k] >= Long.MAX_VALUE ) continue;
for (int kn = 0; k + kn < K && i + kn + 1 < N ; kn++) {
int n = i + kn + 1;
dp[n][k + kn] = Math.min(dp[n][k + kn], dp[i][k] + dist(i, n, X, Y));
}
}
}
double ans = dp[N - 1][0];
for (int k = 1; k < K; k++) {
if ( dp[N - 1][k] >= Long.MAX_VALUE ) continue;
ans = Math.min(ans, dp[N - 1][k] + (1 << (k - 1)));
}
System.out.println(String.format("%.20f", ans));
}
double dist(int i, int j, int[] X, int[] Y) {
int dx = X[j] - X[i];
int dy = Y[j] - Y[i];
return Math.sqrt(dx * dx + dy * dy);
}
class FastScanner {
private final InputStream in;
private final byte[] buf = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FastScanner( InputStream source ) { this.in = source; }
private boolean hasNextByte() {
if ( ptr < buflen ) return true;
else {
ptr = 0;
try { buflen = in.read(buf); } catch (IOException e) { e.printStackTrace(); }
if ( buflen <= 0 ) return false;
}
return true;
}
private int readByte() { if ( hasNextByte() ) return buf[ptr++]; else return -1; }
private boolean isPrintableChar( int c ) { return 33 <= c && c <= 126; }
private boolean isNumeric( int c ) { return '0' <= c && c <= '9'; }
private void skipToNextPrintableChar() { while ( hasNextByte() && !isPrintableChar(buf[ptr]) ) ptr++; }
public boolean hasNext() { skipToNextPrintableChar(); return hasNextByte(); }
public String next() {
if ( !hasNext() ) throw new NoSuchElementException();
StringBuilder ret = new StringBuilder();
int b = readByte();
while ( isPrintableChar(b) ) { ret.appendCodePoint(b); b = readByte(); }
return ret.toString();
}
public long nextLong() {
if ( !hasNext() ) throw new NoSuchElementException();
long ret = 0;
int b = readByte();
boolean negative = false;
if ( b == '-' ) { negative = true; if ( hasNextByte() ) b = readByte(); }
if ( !isNumeric(b) ) throw new NumberFormatException();
while ( true ) {
if ( isNumeric(b) ) ret = ret * 10 + b - '0';
else if ( b == -1 || !isPrintableChar(b) ) return negative ? -ret : ret;
else throw new NumberFormatException();
b = readByte();
}
}
public int nextInt() { return (int)nextLong(); }
public double nextDouble() { return Double.parseDouble(next()); }
}
}
|
ConDefects/ConDefects/Code/abc315_f/Java/44916188
|
condefects-java_data_1754
|
import java.lang.reflect.Array;
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = sc.nextInt();
long k = sc.nextInt();
HashSet<Long> set = new HashSet<>();
for(int i = 0; i < n; i++)
{
long data = sc.nextLong();
set.add(data);
}
long sum1 = 0;
for(long i : set)
{
if(i < k)
sum1 += i;
}
long sum2 = (k * (k + 1)) / 2;
out.println(sum2 - sum1);
out.close();
}
public static int[] getPrime(long n)
{
int ans[]= new int[(int) n];
Arrays.fill(ans, 1);
for(int i = 2; i <=n; i++)
{
if(ans[i] == 0) continue;
for(int j = 2 * i; j <= n; j += i){
ans[j] = 0;
}
}
return ans;
}
public static long getGcd(long a,long b)
{
if(a == 0)
return b;
return getGcd(b % a, a);
}
public static PrintWriter out;
//-----------MyScanner class for faster input----------
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.lang.reflect.Array;
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = sc.nextInt();
long k = sc.nextInt();
HashSet<Long> set = new HashSet<>();
for(int i = 0; i < n; i++)
{
long data = sc.nextLong();
set.add(data);
}
long sum1 = 0;
for(long i : set)
{
if(i <= k)
sum1 += i;
}
long sum2 = (k * (k + 1)) / 2;
out.println(sum2 - sum1);
out.close();
}
public static int[] getPrime(long n)
{
int ans[]= new int[(int) n];
Arrays.fill(ans, 1);
for(int i = 2; i <=n; i++)
{
if(ans[i] == 0) continue;
for(int j = 2 * i; j <= n; j += i){
ans[j] = 0;
}
}
return ans;
}
public static long getGcd(long a,long b)
{
if(a == 0)
return b;
return getGcd(b % a, a);
}
public static PrintWriter out;
//-----------MyScanner class for faster input----------
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
|
ConDefects/ConDefects/Code/abc346_c/Java/52035439
|
condefects-java_data_1755
|
import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main {
public static void solve () {
long x1 = nextInt(), y1 = nextInt(), x2 = nextInt(), y2 = nextInt();
for (long i=y1-2; i<=y1+2; i++) {
for (long j=x1-2; j<=x1+2; j++) {
if (calc(j, i, x2, y2) == 5) {
println("Yes");
return;
}
}
}
println("No");
}
public static long calc (long x1, long y1, long x2, long y2) {
return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) {
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
public static String yesno(boolean b) {return b ? "Yes" : "No";}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public static List<List<Integer>> nextDirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
g.get(b).add(a);
}
return g;
}
public static List<List<Integer>> nextUndirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
}
return g;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
solve();
out.close();
}
}
import java.io.*;
import java.math.*;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.util.*;
import java.util.Map.Entry;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
class Main {
public static void solve () {
long x1 = nextInt(), y1 = nextInt(), x2 = nextInt(), y2 = nextInt();
for (long i=y1-2; i<=y1+2; i++) {
for (long j=x1-2; j<=x1+2; j++) {
if (calc(j, i, x2, y2) == 5 && calc(j, i, x1, y1) == 5) {
println("Yes");
return;
}
}
}
println("No");
}
public static long calc (long x1, long y1, long x2, long y2) {
return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2);
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// useful methods, useful fields, useful static inner class
/////////////////////////////////////////////////////////////////////////////////////////////////
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
public static int[] dy = {-1, 0, 1, 0};
public static int[] dx = {0, 1, 0, -1};
public static class Edge {
int id, from, to, cost;
Edge(int to, int cost) {
this.to = to;
this.cost = cost;
}
Edge(int from, int to, int cost) {
this.from = from;
this.to = to;
this.cost = cost;
}
Edge(int id, int from, int to, int cost) {
this.id = id;
this.from = from;
this.to = to;
this.cost = cost;
}
int getCost() {return this.cost;}
}
public static String yesno(boolean b) {return b ? "Yes" : "No";}
/////////////////////////////////////////////////////////////////////////////////////////////////
// input
/////////////////////////////////////////////////////////////////////////////////////////////////
public static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 32768);
public static StringTokenizer tokenizer = null;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
}
catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public static String[] nextArray(int n) {
String[] a = new String[n];
for (int i=0; i<n; i++) a[i] = next();
return a;
}
public static int nextInt() {return Integer.parseInt(next());};
public static int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
public static int[][] nextIntTable(int n, int m) {
int[][] a = new int[n][m];
for (int i=0; i<n; i++) {
for (int j=0; j<m; j++) a[i][j] = nextInt();
}
return a;
}
public static long nextLong() {return Long.parseLong(next());}
public static long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i=0; i<n; i++) a[i] = nextLong();
return a;
}
public static double nextDouble() {return Double.parseDouble(next());}
public static char nextChar() {return next().charAt(0);}
public static char[] nextCharArray() {return next().toCharArray();}
public static char[][] nextCharTable(int n, int m) {
char[][] a = new char[n][m];
for (int i=0; i<n; i++) {
a[i] = next().toCharArray();
}
return a;
}
public static List<List<Integer>> nextDirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
g.get(b).add(a);
}
return g;
}
public static List<List<Integer>> nextUndirectedGraph(int n, int m) {
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) {
g.add(new ArrayList<>());
}
for (int i=0; i<m; i++) {
int a = nextInt()-1, b = nextInt()-1;
g.get(a).add(b);
}
return g;
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// output
/////////////////////////////////////////////////////////////////////////////////////////////////
static PrintWriter out = new PrintWriter(System.out);
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void printStringArray(String[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printIntArray(int[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printLongArray(long[] a) {
for (int i=0; i<a.length; i++) {
if (i != 0) print(" ");
print(a[i]);
}
println("");
}
public static void printBooleanArray (boolean[] a) {
for (int i=0; i<a.length; i++) {
char c = a[i]==true? 'o' : 'x';
print(c);
}
println("");
}
public static void printCharTable(char[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]);
}
println("");
}
}
public static void printIntTable(int[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
public static void printBooleanTable(boolean[][] b) {
for (int i=0; i<b.length; i++) {
for (int j=0; j<b[0].length; j++) {
print(b[i][j]? "o" : "x");
}
println("");
}
}
public static void printLongTable(long[][] a) {
for (int i=0; i<a.length; i++) {
for (int j=0; j<a[0].length; j++) {
print(a[i][j]==-infl? "# " : a[i][j]+" ");
}
println("");
}
}
/////////////////////////////////////////////////////////////////////////////////////////////////
// main method
/////////////////////////////////////////////////////////////////////////////////////////////////
public static void main(String[] args) {
solve();
out.close();
}
}
|
ConDefects/ConDefects/Code/abc239_c/Java/39156759
|
condefects-java_data_1756
|
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());
long[] sum = new long[24];
for (int i = 0; i < n; i++) {
long w = Long.parseLong(sc.next());
int x = Integer.parseInt(sc.next());
int s = (33 - x) % 24;
int e = (41 - x) % 24;
if (s < e) {
for (int t = s; t < e; t++) {
sum[t] += w;
}
} else {
for (int t = s; t < 24; t++) {
sum[t] += w;
}
for (int t = 0; t < e; t++) {
sum[t] += w;
}
}
}
sc.close();
long max = sum[0];
for (int i = 1; i < 24; i++) {
if (max < sum[i]) {
max = sum[i];
}
}
System.out.println(max);
}
}
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());
long[] sum = new long[24];
for (int i = 0; i < n; i++) {
long w = Long.parseLong(sc.next());
int x = Integer.parseInt(sc.next());
int s = (33 - x) % 24;
int e = (42 - x) % 24;
if (s < e) {
for (int t = s; t < e; t++) {
sum[t] += w;
}
} else {
for (int t = s; t < 24; t++) {
sum[t] += w;
}
for (int t = 0; t < e; t++) {
sum[t] += w;
}
}
}
sc.close();
long max = sum[0];
for (int i = 1; i < 24; i++) {
if (max < sum[i]) {
max = sum[i];
}
}
System.out.println(max);
}
}
|
ConDefects/ConDefects/Code/abc325_b/Java/54462350
|
condefects-java_data_1757
|
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
// import inputAll.inputAll;
public class Main {
public static void main(String... args) {
// inputAll inputAll = new inputAll();
// int i = inputAll.inputnum();
Scanner sc = new Scanner(System.in);
Main ma = new Main();
int inputnum = ma.inputnum(sc);
int[][] inputArray = new int[inputnum][2];
for (int i = 0; i < inputnum; i++) {
for (int j = 0; j < 2; j++) {
inputArray[i][j] = sc.nextInt();
}
}
// 会議開始時刻 i
// 現地時間 (i+inputArray[i][1])%24
//
int max = 0;
for (int i = 0; i < 24; i++) {
int count = 0;
for (int j = 0; j < inputnum; j++) {
if (i + 8 > 24) {
if (i <= inputArray[j][1] || inputArray[j][1] <= (i + 8) % 24) {
count += inputArray[j][0];
}
} else {
if (i <= inputArray[j][1] && inputArray[j][1] <= i + 8) {
count += inputArray[j][0];
}
}
}
if (max < count) {
// System.out.println(i + "時から" + (i + 8) + "時の間で更新");
max = count;
}
}
System.out.println(max);
sc.close();
}
public int inputnum(Scanner sc) {
// 整数の入力
int a = sc.nextInt();
// sc.close();
return a;
}
public ArrayList<Integer> inputIntegerArray(Scanner sc, int n) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
ArrayList<Integer> a = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
a.add(sc.nextInt());
}
// sc.close();
return a;
}
public String inputString(Scanner sc) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
String a = sc.next();
// sc.close();
return a;
}
public ArrayList<String> inputStringArray(Scanner sc, int n) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
ArrayList<String> a = new ArrayList<String>();
for (int i = 0; i < n; i++) {
a.add(sc.next());
}
// sc.close();
return a;
}
}
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
// import inputAll.inputAll;
public class Main {
public static void main(String... args) {
// inputAll inputAll = new inputAll();
// int i = inputAll.inputnum();
Scanner sc = new Scanner(System.in);
Main ma = new Main();
int inputnum = ma.inputnum(sc);
int[][] inputArray = new int[inputnum][2];
for (int i = 0; i < inputnum; i++) {
for (int j = 0; j < 2; j++) {
inputArray[i][j] = sc.nextInt();
}
}
// 会議開始時刻 i
// 現地時間 (i+inputArray[i][1])%24
//
int max = 0;
for (int i = 0; i < 24; i++) {
int count = 0;
for (int j = 0; j < inputnum; j++) {
if (i + 8 >= 24) {
if (i <= inputArray[j][1] || inputArray[j][1] <= (i + 8) % 24) {
count += inputArray[j][0];
}
} else {
if (i <= inputArray[j][1] && inputArray[j][1] <= i + 8) {
count += inputArray[j][0];
}
}
}
if (max < count) {
// System.out.println(i + "時から" + (i + 8) + "時の間で更新");
max = count;
}
}
System.out.println(max);
sc.close();
}
public int inputnum(Scanner sc) {
// 整数の入力
int a = sc.nextInt();
// sc.close();
return a;
}
public ArrayList<Integer> inputIntegerArray(Scanner sc, int n) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
ArrayList<Integer> a = new ArrayList<Integer>();
for (int i = 0; i < n; i++) {
a.add(sc.nextInt());
}
// sc.close();
return a;
}
public String inputString(Scanner sc) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
String a = sc.next();
// sc.close();
return a;
}
public ArrayList<String> inputStringArray(Scanner sc, int n) {
// Scanner sc = new Scanner(System.in);
// 整数の入力
ArrayList<String> a = new ArrayList<String>();
for (int i = 0; i < n; i++) {
a.add(sc.next());
}
// sc.close();
return a;
}
}
|
ConDefects/ConDefects/Code/abc325_b/Java/47364971
|
condefects-java_data_1758
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t[] = new int [24];
for(int i = 0; i < 24;i++){
t[i] = 0;
}
int N =sc.nextInt();
for(int i = 0 ;i < N;i++){
int w = sc.nextInt();
int x = sc.nextInt();
int t9 = 9 - x;
int t17 = 17-x;
for(int j = t9; j < t17+1 ;j++){
if (j < 0){
t[j+24] = t[j+24] + w;
}else{
t[j] = t[j] + w ;
}
}
}
int max = 0;
for(int i = 0;i < 23;i++){
if(max < t[i]){
max = t[i];
}
}
System.out.println(max);
sc.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t[] = new int [24];
for(int i = 0; i < 24;i++){
t[i] = 0;
}
int N =sc.nextInt();
for(int i = 0 ;i < N;i++){
int w = sc.nextInt();
int x = sc.nextInt();
int t9 = 9 - x;
int t17 = 17-x;
for(int j = t9; j < t17+1 ;j++){
if (j < 0){
t[j+24] = t[j+24] + w;
}else{
t[j] = t[j] + w ;
}
}
}
int max = 0;
for(int i = 0;i < 24;i++){
if(max < t[i]){
max = t[i];
}
}
System.out.println(max);
sc.close();
}
}
|
ConDefects/ConDefects/Code/abc325_b/Java/53816379
|
condefects-java_data_1759
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] w = new long[n];
long[] x = new long[n];
for(int i = 0; i<n; i++){
w[i] = sc.nextLong();
x[i] = sc.nextLong();
}
long[] suffix = new long[25];
for(int i = 0; i<n; i++){
suffix[(int)(x[i] + 9)%24] += w[i];
suffix[(int)(x[i]+18)%24] -= w[i];
if(x[i] > 5 && x[i]<16)suffix[0] += w[i];
}
long[] arr = new long[25];
long ans = suffix[0];
arr[0] = suffix[0];
for(int i=1;i<25; i++){
arr[i] = arr[i-1] + suffix[i];
ans = Math.max(ans, arr[i]);
}
// for(int i = 0; i<25; i++)System.out.println(arr[i]);
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();
long[] w = new long[n];
long[] x = new long[n];
for(int i = 0; i<n; i++){
w[i] = sc.nextLong();
x[i] = sc.nextLong();
}
long[] suffix = new long[25];
for(int i = 0; i<n; i++){
suffix[(int)(x[i] + 9)%24] += w[i];
suffix[(int)(x[i]+18)%24] -= w[i];
if(x[i] > 5 && x[i]<15)suffix[0] += w[i];
}
long[] arr = new long[25];
long ans = suffix[0];
arr[0] = suffix[0];
for(int i=1;i<25; i++){
arr[i] = arr[i-1] + suffix[i];
ans = Math.max(ans, arr[i]);
}
// for(int i = 0; i<25; i++)System.out.println(arr[i]);
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc325_b/Java/47319999
|
condefects-java_data_1760
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final StringTokenizer st_a = new StringTokenizer(br.readLine());
final int[] array_a = new int[n];
for (int i = 0; i < n; i++) {
array_a[i] = Integer.parseInt(st_a.nextToken());
}
br.close();
final PriorityQueue<Integer> queue = new PriorityQueue<>(Collections.reverseOrder());
int min = Integer.MAX_VALUE;
for (int a : array_a) {
min = Math.min(min, a);
queue.add(a);
}
int ans = 0;
while (queue.size() > 1) {
int m = queue.poll() % min;
ans++;
if (m != 0) {
queue.add(min);
min = m;
}
}
System.out.println(ans);
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Collections;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
final int n = Integer.parseInt(br.readLine());
final StringTokenizer st_a = new StringTokenizer(br.readLine());
final int[] array_a = new int[n];
for (int i = 0; i < n; i++) {
array_a[i] = Integer.parseInt(st_a.nextToken());
}
br.close();
final PriorityQueue<Integer> queue = new PriorityQueue<>(Collections.reverseOrder());
int min = Integer.MAX_VALUE;
for (int a : array_a) {
min = Math.min(min, a);
queue.add(a);
}
int ans = 0;
while (queue.size() > 1) {
int m = queue.poll() % min;
ans++;
if (m != 0) {
queue.add(m);
min = m;
}
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/arc147_a/Java/39590951
|
condefects-java_data_1761
|
//make sure to make new file!
import java.io.*;
import java.util.*;
public class Main{
public static long MOD = 998244353L;
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
long n = Long.parseLong(f.readLine());
long n2 = n*n;
//fines
long p1 = 0L;
long p2 = 0L;
//probability p1 and p2 are the first player respectively
long pp1 = 0L;
long pp2 = 1L;
for(long k = 1; k < n; k++){
long k2 = (k*k + MOD)%MOD;
long nki = modInverse((n+k+MOD)%MOD,MOD);
long n2mk2 = n2 - k2;
if(n2mk2 < 0) n2mk2 += MOD;
long n2mk2i = modInverse(n2mk2,MOD);
long both = (n2 * n2mk2i + MOD)%MOD;
both--;
if(both < 0) both += MOD;
p1 = (p1 + both + MOD)%MOD;
p2 = (p2 + both + MOD)%MOD;
//k/(n+k) chance that player 1 is fined an extra time
long p1last = (k * nki + MOD)%MOD;
long p2last = (n * nki + MOD)%MOD;
p1 = (p1 + p1last * pp1 + MOD)%MOD;
p2 = (p2 + p1last * pp2 + MOD)%MOD;
//adjust pp1 and pp2
long npp11 = (pp1 * p1last + MOD)%MOD;
long pp1i = 1L-pp1;
if(pp1i < 0) pp1i += MOD;
long npp12 = (pp1i * p2last + MOD)%MOD;
pp1 = (npp11 + npp12 + MOD)%MOD;
long npp21 = (pp2 * p1last + MOD)%MOD;
long pp2i = 1L-pp2;
if(pp2i < 0) pp2i += MOD;
long npp22 = (pp2i * p2last + MOD)%MOD;
pp2 = (npp21 + npp22 + MOD)%MOD;
/*
out.println(k);
out.println("1: " + npp11 + " " + npp12);
out.println("2: " + npp21 + " " + npp22);
out.println(p1last + " " + p2last);
out.println(pp1 + " " + pp2);
*/
}
out.println(p1 + " " + p2);
out.close();
}
//from geeksforgeeks
public static long modInverse(long a, long m)
{
long m0 = m;
long y = 0;
long x = 1;
if (m == 1)
return 0;
while (a > 1)
{
// q is quotient
long q = a / m;
long t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m;
a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
}
//make sure to make new file!
import java.io.*;
import java.util.*;
public class Main{
public static long MOD = 998244353L;
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
long n = Long.parseLong(f.readLine());
long n2 = (n*n + MOD)%MOD;
//fines
long p1 = 0L;
long p2 = 0L;
//probability p1 and p2 are the first player respectively
long pp1 = 0L;
long pp2 = 1L;
for(long k = 1; k < n; k++){
long k2 = (k*k + MOD)%MOD;
long nki = modInverse((n+k+MOD)%MOD,MOD);
long n2mk2 = n2 - k2;
if(n2mk2 < 0) n2mk2 += MOD;
long n2mk2i = modInverse(n2mk2,MOD);
long both = (n2 * n2mk2i + MOD)%MOD;
both--;
if(both < 0) both += MOD;
p1 = (p1 + both + MOD)%MOD;
p2 = (p2 + both + MOD)%MOD;
//k/(n+k) chance that player 1 is fined an extra time
long p1last = (k * nki + MOD)%MOD;
long p2last = (n * nki + MOD)%MOD;
p1 = (p1 + p1last * pp1 + MOD)%MOD;
p2 = (p2 + p1last * pp2 + MOD)%MOD;
//adjust pp1 and pp2
long npp11 = (pp1 * p1last + MOD)%MOD;
long pp1i = 1L-pp1;
if(pp1i < 0) pp1i += MOD;
long npp12 = (pp1i * p2last + MOD)%MOD;
pp1 = (npp11 + npp12 + MOD)%MOD;
long npp21 = (pp2 * p1last + MOD)%MOD;
long pp2i = 1L-pp2;
if(pp2i < 0) pp2i += MOD;
long npp22 = (pp2i * p2last + MOD)%MOD;
pp2 = (npp21 + npp22 + MOD)%MOD;
/*
out.println(k);
out.println("1: " + npp11 + " " + npp12);
out.println("2: " + npp21 + " " + npp22);
out.println(p1last + " " + p2last);
out.println(pp1 + " " + pp2);
*/
}
out.println(p1 + " " + p2);
out.close();
}
//from geeksforgeeks
public static long modInverse(long a, long m)
{
long m0 = m;
long y = 0;
long x = 1;
if (m == 1)
return 0;
while (a > 1)
{
// q is quotient
long q = a / m;
long t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m;
a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
}
|
ConDefects/ConDefects/Code/arc174_c/Java/51395702
|
condefects-java_data_1762
|
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int h = in.nextInt();
int w = in.nextInt();
char[][] s = in.nextCharGrid(h, w);
int m = Math.min(h, w);
int[] ans = new int[m + 1];
for (int i = 1; i < h - 1; i++) {
for (int j = 1; j < w - 1; j++) {
String t = "" + s[i - 1][j - 1] + s[i - 1][j] + s[i - 1][j + 1] + s[i][j - 1] + s[i][j] + s[i][j + 1] + s[i + 1][j - 1] + s[i + 1][j] + s[i + 1][j + 1];
if (!t.equals("#.#.#.#.#")) {
continue;
}
int k = 0;
while (i + k < h && j + k < w && s[i + k][j + k] == '#') {
k++;
}
ans[k - 2]++;
}
}
out.println(ans);
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
}
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int h = in.nextInt();
int w = in.nextInt();
char[][] s = in.nextCharGrid(h, w);
int m = Math.min(h, w);
int[] ans = new int[m];
for (int i = 1; i < h - 1; i++) {
for (int j = 1; j < w - 1; j++) {
String t = "" + s[i - 1][j - 1] + s[i - 1][j] + s[i - 1][j + 1] + s[i][j - 1] + s[i][j] + s[i][j + 1] + s[i + 1][j - 1] + s[i + 1][j] + s[i + 1][j + 1];
if (!t.equals("#.#.#.#.#")) {
continue;
}
int k = 0;
while (i + k < h && j + k < w && s[i + k][j + k] == '#') {
k++;
}
ans[k - 2]++;
}
}
out.println(ans);
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(int a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(long a) {
out.println(a);
if (autoFlush) {
out.flush();
}
}
void println(double a) {
out.println(String.format("%.10f", a));
if (autoFlush) {
out.flush();
}
}
void println(String s) {
out.println(s);
if (autoFlush) {
out.flush();
}
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
}
|
ConDefects/ConDefects/Code/abc300_c/Java/41889152
|
condefects-java_data_1763
|
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static int H;
public static int W;
public static int[][] map;
public static int[] dic_h = {-1, -1, 1, 1};
public static int[] dic_w = {-1, 1, -1, 1};
public static int bfs(int h, int w) {
int size = 0;
boolean loop = true;
while(loop) {
for(int i = 0; i < 4; i++) {
int nh = h + dic_h[i] * (size + 1);
int nw = w + dic_w[i] * (size + 1);
if(nh < 0 || nh >= H || nw < 0 || nw >= W) {
loop = false;
break;
}
if(map[nh][nw] == 0) {
loop = false;
break;
}
}
if(loop) size++;
}
return size;
}
public static boolean checkCenter(int h, int w) {
if(map[h][w] != 1) return false;
for(int i = 0; i < 4; i++) {
int nh = h + dic_h[i];
int nw = w + dic_w[i];
if(nh < 0 || nh >= H || nw < 0 || nw >= W) {
return false;
}
if(map[nh][nw] == 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
H = sc.nextInt();
W = sc.nextInt();
map = new int[H][W];
ArrayList<Pair> center = new ArrayList<>();
for(int i = 0; i < H; i++) {
String str = sc.next();
for(int j = 0; j < W; j++) {
char ch = str.charAt(j);
if(ch == '#') {
map[i][j] = 1;
}else {
map[i][j] = 0;
}
}
}
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(checkCenter(i, j)) {
center.add(new Pair(i,j));
}
}
}
int[] result = new int[H];
for(var ele : center) {
int h = ele.h;
int w = ele.w;
int size = bfs(h,w);
result[size-1]++;
}
for(int x : result) {
System.out.print(x + " ");
}
}
}
class Pair{
int h;
int w;
public Pair(int h, int w) {
super();
this.h = h;
this.w = w;
}
}
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static int H;
public static int W;
public static int[][] map;
public static int[] dic_h = {-1, -1, 1, 1};
public static int[] dic_w = {-1, 1, -1, 1};
public static int bfs(int h, int w) {
int size = 0;
boolean loop = true;
while(loop) {
for(int i = 0; i < 4; i++) {
int nh = h + dic_h[i] * (size + 1);
int nw = w + dic_w[i] * (size + 1);
if(nh < 0 || nh >= H || nw < 0 || nw >= W) {
loop = false;
break;
}
if(map[nh][nw] == 0) {
loop = false;
break;
}
}
if(loop) size++;
}
return size;
}
public static boolean checkCenter(int h, int w) {
if(map[h][w] != 1) return false;
for(int i = 0; i < 4; i++) {
int nh = h + dic_h[i];
int nw = w + dic_w[i];
if(nh < 0 || nh >= H || nw < 0 || nw >= W) {
return false;
}
if(map[nh][nw] == 0) {
return false;
}
}
return true;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
H = sc.nextInt();
W = sc.nextInt();
map = new int[H][W];
ArrayList<Pair> center = new ArrayList<>();
for(int i = 0; i < H; i++) {
String str = sc.next();
for(int j = 0; j < W; j++) {
char ch = str.charAt(j);
if(ch == '#') {
map[i][j] = 1;
}else {
map[i][j] = 0;
}
}
}
for(int i = 0; i < H; i++) {
for(int j = 0; j < W; j++) {
if(checkCenter(i, j)) {
center.add(new Pair(i,j));
}
}
}
int[] result = new int[Math.min(W, H)];
for(var ele : center) {
int h = ele.h;
int w = ele.w;
int size = bfs(h,w);
result[size-1]++;
}
for(int x : result) {
System.out.print(x + " ");
}
}
}
class Pair{
int h;
int w;
public Pair(int h, int w) {
super();
this.h = h;
this.w = w;
}
}
|
ConDefects/ConDefects/Code/abc300_c/Java/45202151
|
condefects-java_data_1764
|
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String []args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
int count = 1;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
}
Arrays.sort(a);
int compare = a[0];
for (int i = 1;i < n;i++) {
if (compare == a[i]) {
count++;
}
compare = a[i];
}
System.out.println(count);
}
}
import java.util.Scanner;
import java.util.Arrays;
public class Main{
public static void main(String []args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
int count = 1;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
}
Arrays.sort(a);
int compare = a[0];
for (int i = 1;i < n;i++) {
if (compare != a[i]) {
count++;
}
compare = a[i];
}
System.out.println(count);
}
}
|
ConDefects/ConDefects/Code/abc240_b/Java/39838217
|
condefects-java_data_1765
|
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int maxInt = Integer.MAX_VALUE/3;
static long maxLong = Long.MAX_VALUE/3;
public static void main(String[] args) throws IOException {
new Thread(new Task()).start();
}
static class Task implements Runnable {
public void run() {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
PrintWriter out = new PrintWriter(outputStream);
InputReader in = new InputReader(inputStream);
// for(int i=4;i<=4;i++) {
// InputStream uinputStream = new FileInputStream("timeline.in");
// String f = i+".in";
// InputStream uinputStream = new FileInputStream(f);
// InputReader in = new InputReader(uinputStream);
// PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("timeline.out")));
// }
//PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("timeline.out")));
try {
solve(in, out);
} catch (IOException e) {
e.printStackTrace();
}
out.close();
}
public void solve(InputReader in, PrintWriter out) throws IOException {
int n = in.nextInt();
long[] arr = new long[n];
for(int i=0;i<n;i++) arr[i] = in.nextLong();
long dp[][] = new long[n][2];
for(int i=0;i<n;i++) dp[i][0] = dp[i][1] = maxLong;
dp[0][1] = arr[0];
for(int i=1;i<n;i++) {
dp[i][0] = dp[i-1][1];
dp[i][1] = Math.min(dp[i-1][0], dp[i-1][1])+arr[i];
}
long dp2[][] = new long[n][2];
for(int i=0;i<n;i++) dp2[i][0] = dp2[i][1] = maxLong;
dp2[0][0] = 0; dp[0][1] = arr[0];
for(int i=1;i<n;i++) {
dp2[i][0] = dp2[i-1][1];
dp2[i][1] = Math.min(dp2[i-1][0], dp2[i-1][1])+arr[i];
}
out.println(Math.min(dp[n-1][0], dp2[n-1][1]));
}
public long GCD(long a, long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
class pair{
int f,t; long len;
public pair(int a, int b, long c) {
f = a;t=b;len=c;
}
}
public ArrayList<edge>[] getG(int n){
ArrayList<edge>[] g = new ArrayList[n];
for(int i=0;i<n;i++) g[i] = new ArrayList<edge>();
return g;
}
public class edge implements Comparable<edge> {
int f, t;
int len;
int id;
public edge(int a, int b, int c, int d) {
f = a;
t = b;
len = c;
id = d;
}
@Override
public int compareTo(Main.Task.edge o) {
if (this.len - o.len < 0)
return -1;
else if (this.len == o.len)
return 0;
else
return 1;
}
}
List<List<Integer>> convert(int arr[][]) {
int n = arr.length;
List<List<Integer>> ret = new ArrayList<>();
for (int i = 0; i < n; i++) {
ArrayList<Integer> tmp = new ArrayList<Integer>();
for (int j = 0; j < arr[i].length; j++)
tmp.add(arr[i][j]);
ret.add(tmp);
}
return ret;
}
}
static class ArrayUtils {
static final long seed = System.nanoTime();
static final Random rand = new Random(seed);
public static void sort(int[] a) {
shuffle(a);
Arrays.sort(a);
}
public static void shuffle(int[] a) {
for (int i = 0; i < a.length; i++) {
int j = rand.nextInt(i + 1);
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
public static void sort(long[] a) {
shuffle(a);
Arrays.sort(a);
}
public static void shuffle(long[] a) {
for (int i = 0; i < a.length; i++) {
int j = rand.nextInt(i + 1);
long t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
static class BIT {
long arr[];
int n;
public BIT(int a) {
n = a;
arr = new long[n];
}
long sum(int p) {
long s = 0;
while (p > 0) {
s += arr[p];
p -= p & (-p);
}
return s;
}
void add(int p, long v) {
while (p < n) {
arr[p] += v;
p += p & (-p);
}
}
}
static class DSU {
int[] arr;
int[] sz;
public DSU(int n) {
arr = new int[n];
sz = new int[n];
for (int i = 0; i < n; i++)
arr[i] = i;
Arrays.fill(sz, 1);
}
public int find(int a) {
if (arr[a] != a)
arr[a] = find(arr[a]);
return arr[a];
}
public void union(int a, int b) {
int x = find(a);
int y = find(b);
if (x == y)
return;
arr[y] = x;
sz[x] += sz[y];
}
public int size(int x) {
return sz[find(x)];
}
}
private static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int zcurChar;
private int znumChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (znumChars == -1)
throw new InputMismatchException();
if (zcurChar >= znumChars) {
zcurChar = 0;
try {
znumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (znumChars <= 0)
return -1;
}
return buf[zcurChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public String nextString() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public double nextDouble() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.') {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.') {
c = read();
double m = 1;
while (!isSpaceChar(c)) {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next() {
return nextString();
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
public int[] readIntArray(int n) {
int[] ret = new int[n];
for (int i = 0; i < n; i++) {
ret[i] = nextInt();
}
return ret;
}
}
static class Dumper {
static void print_int_arr(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_char_arr(char[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_double_arr(double[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_2d_arr(int[][] arr, int x, int y) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
System.out.println();
System.out.println("---------------------");
}
static void print_2d_arr(boolean[][] arr, int x, int y) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
System.out.println();
System.out.println("---------------------");
}
static void print(Object o) {
System.out.println(o.toString());
}
static void getc() {
System.out.println("here");
}
}
}
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int maxInt = Integer.MAX_VALUE/3;
static long maxLong = Long.MAX_VALUE/3;
public static void main(String[] args) throws IOException {
new Thread(new Task()).start();
}
static class Task implements Runnable {
public void run() {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
PrintWriter out = new PrintWriter(outputStream);
InputReader in = new InputReader(inputStream);
// for(int i=4;i<=4;i++) {
// InputStream uinputStream = new FileInputStream("timeline.in");
// String f = i+".in";
// InputStream uinputStream = new FileInputStream(f);
// InputReader in = new InputReader(uinputStream);
// PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("timeline.out")));
// }
//PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("timeline.out")));
try {
solve(in, out);
} catch (IOException e) {
e.printStackTrace();
}
out.close();
}
public void solve(InputReader in, PrintWriter out) throws IOException {
int n = in.nextInt();
long[] arr = new long[n];
for(int i=0;i<n;i++) arr[i] = in.nextLong();
long dp[][] = new long[n][2];
for(int i=0;i<n;i++) dp[i][0] = dp[i][1] = maxLong;
dp[0][1] = arr[0];
for(int i=1;i<n;i++) {
dp[i][0] = dp[i-1][1];
dp[i][1] = Math.min(dp[i-1][0], dp[i-1][1])+arr[i];
}
long dp2[][] = new long[n][2];
for(int i=0;i<n;i++) dp2[i][0] = dp2[i][1] = maxLong;
dp2[0][0] = 0; dp[0][1] = arr[0];
for(int i=1;i<n;i++) {
dp2[i][0] = dp2[i-1][1];
dp2[i][1] = Math.min(dp2[i-1][0], dp2[i-1][1])+arr[i];
}
out.println(Math.min(Math.min(dp[n-1][0],dp[n-1][1]), dp2[n-1][1]));
}
public long GCD(long a, long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
class pair{
int f,t; long len;
public pair(int a, int b, long c) {
f = a;t=b;len=c;
}
}
public ArrayList<edge>[] getG(int n){
ArrayList<edge>[] g = new ArrayList[n];
for(int i=0;i<n;i++) g[i] = new ArrayList<edge>();
return g;
}
public class edge implements Comparable<edge> {
int f, t;
int len;
int id;
public edge(int a, int b, int c, int d) {
f = a;
t = b;
len = c;
id = d;
}
@Override
public int compareTo(Main.Task.edge o) {
if (this.len - o.len < 0)
return -1;
else if (this.len == o.len)
return 0;
else
return 1;
}
}
List<List<Integer>> convert(int arr[][]) {
int n = arr.length;
List<List<Integer>> ret = new ArrayList<>();
for (int i = 0; i < n; i++) {
ArrayList<Integer> tmp = new ArrayList<Integer>();
for (int j = 0; j < arr[i].length; j++)
tmp.add(arr[i][j]);
ret.add(tmp);
}
return ret;
}
}
static class ArrayUtils {
static final long seed = System.nanoTime();
static final Random rand = new Random(seed);
public static void sort(int[] a) {
shuffle(a);
Arrays.sort(a);
}
public static void shuffle(int[] a) {
for (int i = 0; i < a.length; i++) {
int j = rand.nextInt(i + 1);
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
public static void sort(long[] a) {
shuffle(a);
Arrays.sort(a);
}
public static void shuffle(long[] a) {
for (int i = 0; i < a.length; i++) {
int j = rand.nextInt(i + 1);
long t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
static class BIT {
long arr[];
int n;
public BIT(int a) {
n = a;
arr = new long[n];
}
long sum(int p) {
long s = 0;
while (p > 0) {
s += arr[p];
p -= p & (-p);
}
return s;
}
void add(int p, long v) {
while (p < n) {
arr[p] += v;
p += p & (-p);
}
}
}
static class DSU {
int[] arr;
int[] sz;
public DSU(int n) {
arr = new int[n];
sz = new int[n];
for (int i = 0; i < n; i++)
arr[i] = i;
Arrays.fill(sz, 1);
}
public int find(int a) {
if (arr[a] != a)
arr[a] = find(arr[a]);
return arr[a];
}
public void union(int a, int b) {
int x = find(a);
int y = find(b);
if (x == y)
return;
arr[y] = x;
sz[x] += sz[y];
}
public int size(int x) {
return sz[find(x)];
}
}
private static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int zcurChar;
private int znumChars;
private SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (znumChars == -1)
throw new InputMismatchException();
if (zcurChar >= znumChars) {
zcurChar = 0;
try {
znumChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (znumChars <= 0)
return -1;
}
return buf[zcurChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public String nextString() {
int c = read();
while (isSpaceChar(c))
c = read();
StringBuilder res = new StringBuilder();
do {
res.appendCodePoint(c);
c = read();
} while (!isSpaceChar(c));
return res.toString();
}
public double nextDouble() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
double res = 0;
while (!isSpaceChar(c) && c != '.') {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
}
if (c == '.') {
c = read();
double m = 1;
while (!isSpaceChar(c)) {
if (c == 'e' || c == 'E')
return res * Math.pow(10, nextInt());
if (c < '0' || c > '9')
throw new InputMismatchException();
m /= 10;
res += (c - '0') * m;
c = read();
}
}
return res * sgn;
}
public long nextLong() {
int c = read();
while (isSpaceChar(c))
c = read();
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
long res = 0;
do {
if (c < '0' || c > '9')
throw new InputMismatchException();
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null)
return filter.isSpaceChar(c);
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public String next() {
return nextString();
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
public int[] readIntArray(int n) {
int[] ret = new int[n];
for (int i = 0; i < n; i++) {
ret[i] = nextInt();
}
return ret;
}
}
static class Dumper {
static void print_int_arr(int[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_char_arr(char[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_double_arr(double[] arr) {
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
System.out.println();
System.out.println("---------------------");
}
static void print_2d_arr(int[][] arr, int x, int y) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
System.out.println();
System.out.println("---------------------");
}
static void print_2d_arr(boolean[][] arr, int x, int y) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < y; j++) {
System.out.print(arr[i][j] + " ");
}
System.out.println();
}
System.out.println();
System.out.println("---------------------");
}
static void print(Object o) {
System.out.println(o.toString());
}
static void getc() {
System.out.println("here");
}
}
}
|
ConDefects/ConDefects/Code/abc251_e/Java/38543569
|
condefects-java_data_1766
|
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static StringTokenizer st;
// static int MOD = (int) 1e9+7;
static int MOD = 998244353;
public static void main(String[] args) throws IOException {
int n = readInt();
int[] A = new int[n + 2];
long ans;
for (int i = 1; i <= n; i++) A[i] = readInt();
A[n + 1] = A[1];
long[] dp = new long[n + 1];
Arrays.fill(dp, Long.MAX_VALUE / 4);
dp[0] = 0; dp[1] = A[1];
for (int i = 2; i <= n; i++) {
// buy the previous one
dp[i] = Math.min(dp[i], dp[i - 2] + A[i - 1]);
// buy the current one
dp[i] = Math.min(dp[i], dp[i - 1] + A[i]);
}
ans = dp[n];
long[] dp2 = new long[n + 5];
Arrays.fill(dp2, Long.MAX_VALUE / 4);
dp2[1] = 0; dp2[2] = A[1];
for (int i = 3; i <= n + 1; i++) {
// buy the previous one
dp2[i] = Math.min(dp2[i], dp2[i - 2] + A[i - 1]);
// buy the current one
dp2[i] = Math.min(dp2[i], dp2[i - 1] + A[i]);
}
ans = Math.min(ans, dp2[n + 1]);
System.out.println(ans);
}
static String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static long readLong() throws IOException {
return Long.parseLong(next());
}
static int readInt() throws IOException {
return Integer.parseInt(next());
}
static double readDouble() throws IOException {
return Double.parseDouble(next());
}
static char readCharacter() throws IOException {
return next().charAt(0);
}
static String readLine() throws IOException {
return br.readLine().trim();
}
static int readLongLineInt() throws IOException{
int x = 0, c;
while((c = br.read()) != ' ' && c != '\n')
x = x * 10 + (c - '0');
return x;
}
static long pow (long x, long exp){
if (exp==0) return 1;
long t = pow(x, exp/2);
t = t*t % MOD;
if (exp%2 == 0) return t;
return t*x%MOD;
}
}
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pr = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
static StringTokenizer st;
// static int MOD = (int) 1e9+7;
static int MOD = 998244353;
public static void main(String[] args) throws IOException {
int n = readInt();
int[] A = new int[n + 2];
long ans;
for (int i = 1; i <= n; i++) A[i] = readInt();
A[n + 1] = A[1];
long[] dp = new long[n + 1];
Arrays.fill(dp, Long.MAX_VALUE / 4);
dp[0] = 0; dp[1] = A[1];
for (int i = 2; i <= n; i++) {
// buy the previous one
dp[i] = Math.min(dp[i], dp[i - 2] + A[i - 1]);
// buy the current one
dp[i] = Math.min(dp[i], dp[i - 1] + A[i]);
}
ans = dp[n];
long[] dp2 = new long[n + 5];
Arrays.fill(dp2, Long.MAX_VALUE / 4);
dp2[1] = 0; dp2[2] = A[2];
for (int i = 3; i <= n + 1; i++) {
// buy the previous one
dp2[i] = Math.min(dp2[i], dp2[i - 2] + A[i - 1]);
// buy the current one
dp2[i] = Math.min(dp2[i], dp2[i - 1] + A[i]);
}
ans = Math.min(ans, dp2[n + 1]);
System.out.println(ans);
}
static String next() throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static long readLong() throws IOException {
return Long.parseLong(next());
}
static int readInt() throws IOException {
return Integer.parseInt(next());
}
static double readDouble() throws IOException {
return Double.parseDouble(next());
}
static char readCharacter() throws IOException {
return next().charAt(0);
}
static String readLine() throws IOException {
return br.readLine().trim();
}
static int readLongLineInt() throws IOException{
int x = 0, c;
while((c = br.read()) != ' ' && c != '\n')
x = x * 10 + (c - '0');
return x;
}
static long pow (long x, long exp){
if (exp==0) return 1;
long t = pow(x, exp/2);
t = t*t % MOD;
if (exp%2 == 0) return t;
return t*x%MOD;
}
}
|
ConDefects/ConDefects/Code/abc251_e/Java/42792765
|
condefects-java_data_1767
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
// ABC360D
// https://atcoder.jp/contests/abc360/tasks/abc360_d
public class Main {
public static void main(String[] args) throws Exception {
/* --- Input --- */
var br = new BufferedReader(new InputStreamReader(System.in));
var sa = br.readLine().split(" ");
var N = Integer.parseInt(sa[0]);
var T = Long.parseLong(sa[1]);
var S = br.readLine().toCharArray();
sa = br.readLine().split(" ");
var X = new long[N];
for (var i = 0; i < N; i++) X[i] = Long.parseLong(sa[i]);
br.close();
/* --- Process --- */
// 負の方向を向いているアリの初期位置
var X0 = new ArrayList<Long>();
for(var i=0; i<N; i++) if (S[i] == '0') X0.add(X[i]);
Collections.sort(X0);
// 正の方向を向いているアリについて、負の方向を向いているアリのうち自分の位置〜2*Tの範囲にいるアリの数を数える
var ans = 0;
for (var i = 0; i < N; i++) {
if (S[i] == '0') continue;
// 正の方向で一番近いアリのインデックス
var l = ~Collections.binarySearch(X0, X[i], (a, b) -> (a.compareTo(b) > 0) ? 1 : -1);
// 正の方向で2*Tの範囲内で一番遠いアリのインデックス
var r = ~Collections.binarySearch(X0, X[i] + T * 2, (a, b) -> (a.compareTo(b) > 0) ? 1 : -1)-1;
ans += r - l + 1;
}
/* --- Output --- */
System.out.println(ans);
System.out.flush();
}
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
// ABC360D
// https://atcoder.jp/contests/abc360/tasks/abc360_d
public class Main {
public static void main(String[] args) throws Exception {
/* --- Input --- */
var br = new BufferedReader(new InputStreamReader(System.in));
var sa = br.readLine().split(" ");
var N = Integer.parseInt(sa[0]);
var T = Long.parseLong(sa[1]);
var S = br.readLine().toCharArray();
sa = br.readLine().split(" ");
var X = new long[N];
for (var i = 0; i < N; i++) X[i] = Long.parseLong(sa[i]);
br.close();
/* --- Process --- */
// 負の方向を向いているアリの初期位置
var X0 = new ArrayList<Long>();
for(var i=0; i<N; i++) if (S[i] == '0') X0.add(X[i]);
Collections.sort(X0);
// 正の方向を向いているアリについて、負の方向を向いているアリのうち自分の位置〜2*Tの範囲にいるアリの数を数える
var ans = 0L;
for (var i = 0; i < N; i++) {
if (S[i] == '0') continue;
// 正の方向で一番近いアリのインデックス
var l = ~Collections.binarySearch(X0, X[i], (a, b) -> (a.compareTo(b) > 0) ? 1 : -1);
// 正の方向で2*Tの範囲内で一番遠いアリのインデックス
var r = ~Collections.binarySearch(X0, X[i] + T * 2, (a, b) -> (a.compareTo(b) > 0) ? 1 : -1)-1;
ans += r - l + 1;
}
/* --- Output --- */
System.out.println(ans);
System.out.flush();
}
}
|
ConDefects/ConDefects/Code/abc360_d/Java/55102554
|
condefects-java_data_1768
|
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long t = sc.nextLong();
char[] s = sc.next().toCharArray();
long[] x = new long[n];
ArrayList<Long> a1 = new ArrayList<>();
ArrayList<Long> a2 = new ArrayList<>();
for (int i = 0; i < n; i++) {
x[i] = sc.nextLong();
if(s[i]=='1') {
a1.add(x[i]);
}else {
a2.add(x[i]);
}
}
Collections.sort(a2);
int ans = 0;
for(Long it : a1) {
int ok = a2.size();
int ng = -1;
while(ok-ng>1) {
int mid = (ok+ng)/2;
if(a2.get(mid)>=it) {
ok = mid;
}else {
ng = mid;
}
}
int tmp = ok;
ok = a2.size();
ng = -1;
while(ok-ng>1) {
int mid = (ok+ng)/2;
if(a2.get(mid)>it+2*t) {
ok = mid;
}else {
ng = mid;
}
}
ans += ok-tmp;
}
System.out.println(ans);
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long t = sc.nextLong();
char[] s = sc.next().toCharArray();
long[] x = new long[n];
ArrayList<Long> a1 = new ArrayList<>();
ArrayList<Long> a2 = new ArrayList<>();
for (int i = 0; i < n; i++) {
x[i] = sc.nextLong();
if(s[i]=='1') {
a1.add(x[i]);
}else {
a2.add(x[i]);
}
}
Collections.sort(a2);
long ans = 0;
for(Long it : a1) {
int ok = a2.size();
int ng = -1;
while(ok-ng>1) {
int mid = (ok+ng)/2;
if(a2.get(mid)>=it) {
ok = mid;
}else {
ng = mid;
}
}
int tmp = ok;
ok = a2.size();
ng = -1;
while(ok-ng>1) {
int mid = (ok+ng)/2;
if(a2.get(mid)>it+2*t) {
ok = mid;
}else {
ng = mid;
}
}
ans += ok-tmp;
}
System.out.println(ans);
}
}
|
ConDefects/ConDefects/Code/abc360_d/Java/55091735
|
condefects-java_data_1769
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
String s = sc.next();
if (!s.substring(0, 1).matches("[A-Z]")) {
System.out.println("No");
return;
}
for (int i = 1; i < s.length() - 1; i++) {
if (!s.substring(i, i + 1).matches("[a-z]")) {
System.out.println("No");
return;
}
}
System.out.println("Yes");
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
String s = sc.next();
if (!s.substring(0, 1).matches("[A-Z]")) {
System.out.println("No");
return;
}
for (int i = 1; i < s.length(); i++) {
if (!s.substring(i, i + 1).matches("[a-z]")) {
System.out.println("No");
return;
}
}
System.out.println("Yes");
}
}
}
|
ConDefects/ConDefects/Code/abc338_a/Java/53006013
|
condefects-java_data_1770
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
boolean ok = false;
if(s.charAt(0)>='A' && s.charAt(0)<='Z') {
for(int i=1;i<s.length();i++){
if(s.charAt(i)>='A' && s.charAt(i)<='Z'){
ok=true;
break;
}
}
}
else {
ok=true;
}
System.out.println(ok?"NO":"YES");
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
boolean ok = false;
if(s.charAt(0)>='A' && s.charAt(0)<='Z') {
for(int i=1;i<s.length();i++){
if(s.charAt(i)>='A' && s.charAt(i)<='Z'){
ok=true;
break;
}
}
}
else {
ok=true;
}
System.out.println(ok?"No":"Yes");
}
}
|
ConDefects/ConDefects/Code/abc338_a/Java/51178339
|
condefects-java_data_1771
|
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print(sc.next().equals("[A-Z]" + "[a-z]*") ? "Yes" : "No");
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print(sc.next().matches("[A-Z][a-z]*") ? "Yes" : "No");
}
}
|
ConDefects/ConDefects/Code/abc338_a/Java/54891343
|
condefects-java_data_1772
|
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
//StringBuilder sb = new StringBuilder();
char [] s = sc.next().toCharArray();
if(s[0] < 'A' || 'Z' < s[0]) {
System.out.println("No");
return;
}
for(int i = 1; i < s.length; i++) {
if(s[0] < 'a' || 'z' < s[0]) {
System.out.println("No");
return;
}
}
System.out.println("Yes");
//.append("\n");
//System.out.print(sb);
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
//StringBuilder sb = new StringBuilder();
char [] s = sc.next().toCharArray();
if(s[0] < 'A' || 'Z' < s[0]) {
System.out.println("No");
return;
}
for(int i = 1; i < s.length; i++) {
if(s[i] < 'a' || 'z' < s[i]) {
System.out.println("No");
return;
}
}
System.out.println("Yes");
//.append("\n");
//System.out.print(sb);
}
}
|
ConDefects/ConDefects/Code/abc338_a/Java/51482763
|
condefects-java_data_1773
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
System.out.println(s.replace("a", "").replace("b", "").replace("c", "").replace("d", "").replace("o", ""));
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.next();
System.out.println(s.replace("a", "").replace("e", "").replace("i", "").replace("o", "").replace("u", ""));
}
}
|
ConDefects/ConDefects/Code/abc315_a/Java/45068202
|
condefects-java_data_1774
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String text = scanner.next();
char[] work = new char[text.length()];
int j = 0;
for(int i = 0; i < text.length(); i++){
if((text.charAt(i) != 'a') && (text.charAt(i) != 'e') && (text.charAt(i) != 'i')
&& (text.charAt(i) != 'o') && (text.charAt(i) != 'u')) {
work[j] = text.charAt(i);
j = j + 1;
}
}
String newText = "";
for(int i = 0; i < work.length; i++) {
newText = newText + work[i];
}
if (newText.equals("")) {
System.out.println(text);
}
else {
System.out.println(newText);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
String text = scanner.next();
char[] work = new char[text.length()];
int j = 0;
for(int i = 0; i < text.length(); i++){
if((text.charAt(i) != 'a') && (text.charAt(i) != 'e') && (text.charAt(i) != 'i')
&& (text.charAt(i) != 'o') && (text.charAt(i) != 'u')) {
work[j] = text.charAt(i);
j = j + 1;
}
}
String newText = "";
for(int i = 0; i < work.length; i++) {
newText = newText + work[i];
}
if (newText.equals("")) {
System.out.println(text);
}
else {
System.out.println(newText.trim());
}
}
}
|
ConDefects/ConDefects/Code/abc315_a/Java/45770337
|
condefects-java_data_1775
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
str.replace("a", "").replace("e", "").replace("i", "").replace("u", "").replace("o", "");
System.out.println(str);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String str = sc.next();
str = str.replace("a", "").replace("e", "").replace("i", "").replace("u", "").replace("o", "");
System.out.println(str);
}
}
|
ConDefects/ConDefects/Code/abc315_a/Java/45793970
|
condefects-java_data_1776
|
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = br.readLine().split(" ");
int n = Integer.parseInt(str[0]);
int m = Integer.parseInt(str[1]);
long d = Long.parseLong(str[2]);
long[] a = new long[n];
long[] b = new long[m];
str = br.readLine().split(" ");
for (int i = 0; i < n; i++) {
a[i] = Long.parseLong(str[i]);
}
str = br.readLine().split(" ");
for (int i = 0; i < m; i++) {
b[i] = Long.parseLong(str[i]);
}
Arrays.sort(a);
long ans = 0l;
for (int i = 0; i < m; i++) {
int aindex = Arrays.binarySearch(a, b[i] + d);
if (aindex >= 0) {
ans = Math.max(ans, a[aindex] * 2);
} else if (aindex < -1) {
if (Math.abs(b[i] - a[aindex * (-1) - 2]) <= d) {
ans = Math.max(ans, a[aindex * (-1) - 2] + b[i]);
}
} else {
}
}
if (ans == 0) {
System.out.println(-1);
} else {
System.out.println(ans);
}
}
}
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = br.readLine().split(" ");
int n = Integer.parseInt(str[0]);
int m = Integer.parseInt(str[1]);
long d = Long.parseLong(str[2]);
long[] a = new long[n];
long[] b = new long[m];
str = br.readLine().split(" ");
for (int i = 0; i < n; i++) {
a[i] = Long.parseLong(str[i]);
}
str = br.readLine().split(" ");
for (int i = 0; i < m; i++) {
b[i] = Long.parseLong(str[i]);
}
Arrays.sort(a);
long ans = 0l;
for (int i = 0; i < m; i++) {
int aindex = Arrays.binarySearch(a, b[i] + d);
if (aindex >= 0) {
ans = Math.max(ans, a[aindex] + b[i]);
} else if (aindex < -1) {
if (Math.abs(b[i] - a[aindex * (-1) - 2]) <= d) {
ans = Math.max(ans, a[aindex * (-1) - 2] + b[i]);
}
} else {
}
}
if (ans == 0) {
System.out.println(-1);
} else {
System.out.println(ans);
}
}
}
|
ConDefects/ConDefects/Code/abc302_d/Java/41930304
|
condefects-java_data_1777
|
import java.util.Scanner;
public class Main {
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
int H = scn.nextInt();
int W = scn.nextInt();
char[][] grid = new char[H][W];
for ( int i = 0; i < H; i++) {
grid[i] = scn.next().toCharArray();
}
int[][] dp = new int[H][W];
int ans = 0;
for ( int j = 0; j < H; j++) {
if ( grid[j][0] == '.') {
dp[j][0] = j + 1;
ans = Math.max( ans, dp[j][0]);
}
else {
ans = Math.max( dp[j - 1][0], ans);
break;
}
}
for ( int k = 0; k < H; k++) {
if ( grid[0][k] == '.') {
dp[0][k] = k + 1;
ans = Math.max( ans, dp[0][k]);
}
else {
ans = Math.max( dp[0][k - 1], ans);
break;
}
}
for ( int l = 1; l < H; l++) {
for ( int m = 1; m < W; m++) {
if ( grid[l][m] == '.') {
dp[l][m] = Math.max( dp[l - 1][m], dp[l][m - 1]) + 1;
ans = Math.max( ans, dp[l][m]);
}
}
}
System.out.println( ans);
}
}
import java.util.Scanner;
public class Main {
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
int H = scn.nextInt();
int W = scn.nextInt();
char[][] grid = new char[H][W];
for ( int i = 0; i < H; i++) {
grid[i] = scn.next().toCharArray();
}
int[][] dp = new int[H][W];
int ans = 0;
for ( int j = 0; j < H; j++) {
if ( grid[j][0] == '.') {
dp[j][0] = j + 1;
ans = Math.max( ans, dp[j][0]);
}
else {
ans = Math.max( dp[j - 1][0], ans);
break;
}
}
for ( int k = 0; k < H; k++) {
if ( grid[0][k] == '.') {
dp[0][k] = k + 1;
ans = Math.max( ans, dp[0][k]);
}
else {
ans = Math.max( dp[0][k - 1], ans);
break;
}
}
for ( int l = 1; l < H; l++) {
for ( int m = 1; m < W; m++) {
if ( grid[l][m] == '.' && (dp[l - 1][m] != 0 || dp[l][m - 1] != 0)) {
dp[l][m] = Math.max( dp[l - 1][m], dp[l][m - 1]) + 1;
ans = Math.max( ans, dp[l][m]);
}
}
}
System.out.println( ans);
}
}
|
ConDefects/ConDefects/Code/abc232_d/Java/36904032
|
condefects-java_data_1778
|
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Manav
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
BBallsOfThreeColors solver = new BBallsOfThreeColors();
solver.solve(1, in, out);
out.close();
}
static class BBallsOfThreeColors {
public void solve(int testNumber, InputReader in, OutputWriter out) {
int t = in.nextInt();
for (int it = 0; it < t; it++) {
int[] a = in.nextIntArray(3);
Arrays.sort(a);
int temp = a[0];
a[0] = a[2];
a[2] = temp;
int ans = Integer.MAX_VALUE;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (j != i) {
int one = a[i] - a[j];
if (one >= 0 && one % 3 == 0) {
// out.println(i,j);
ans = Math.min(ans, a[0]);
}
}
}
}
out.println(ans != Integer.MAX_VALUE ? ans : -1);
}
}
}
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private InputReader.SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; ++i) array[i] = nextInt();
return array;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
static class OutputWriter {
private final PrintWriter writer;
public OutputWriter(OutputStream outputStream) {
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}
public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}
public void close() {
writer.close();
}
public void println(int i) {
writer.println(i);
}
}
}
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Manav
*/
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
OutputWriter out = new OutputWriter(outputStream);
BBallsOfThreeColors solver = new BBallsOfThreeColors();
solver.solve(1, in, out);
out.close();
}
static class BBallsOfThreeColors {
public void solve(int testNumber, InputReader in, OutputWriter out) {
int t = in.nextInt();
for (int it = 0; it < t; it++) {
int[] a = in.nextIntArray(3);
Arrays.sort(a);
int temp = a[0];
a[0] = a[2];
a[2] = temp;
int ans = Integer.MAX_VALUE;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (j != i) {
int one = a[i] - a[j];
if (one >= 0 && one % 3 == 0) {
// out.println(i,j);
ans = Math.min(ans, a[i]);
}
}
}
}
out.println(ans != Integer.MAX_VALUE ? ans : -1);
}
}
}
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private InputReader.SpaceCharFilter filter;
public InputReader(InputStream stream) {
this.stream = stream;
}
public int read() {
if (numChars == -1) {
throw new InputMismatchException();
}
if (curChar >= numChars) {
curChar = 0;
try {
numChars = stream.read(buf);
} catch (IOException e) {
throw new InputMismatchException();
}
if (numChars <= 0) {
return -1;
}
}
return buf[curChar++];
}
public int nextInt() {
int c = read();
while (isSpaceChar(c)) {
c = read();
}
int sgn = 1;
if (c == '-') {
sgn = -1;
c = read();
}
int res = 0;
do {
if (c < '0' || c > '9') {
throw new InputMismatchException();
}
res *= 10;
res += c - '0';
c = read();
} while (!isSpaceChar(c));
return res * sgn;
}
public boolean isSpaceChar(int c) {
if (filter != null) {
return filter.isSpaceChar(c);
}
return isWhitespace(c);
}
public static boolean isWhitespace(int c) {
return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
}
public int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; ++i) array[i] = nextInt();
return array;
}
public interface SpaceCharFilter {
public boolean isSpaceChar(int ch);
}
}
static class OutputWriter {
private final PrintWriter writer;
public OutputWriter(OutputStream outputStream) {
writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
}
public OutputWriter(Writer writer) {
this.writer = new PrintWriter(writer);
}
public void close() {
writer.close();
}
public void println(int i) {
writer.println(i);
}
}
}
|
ConDefects/ConDefects/Code/arc128_b/Java/26592583
|
condefects-java_data_1779
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringJoiner;
import java.util.StringTokenizer;
public class Main {
public static void main(final String[] args) {
final FastScanner scanner = new FastScanner(System.in);
final int n = scanner.nextInt();
final StringJoiner joiner = new StringJoiner("\n");
for (int i = 0; i < n; i++) {
final int a = scanner.nextInt();
final int b = scanner.nextInt();
final int c = scanner.nextInt();
int min = Integer.MAX_VALUE;
if (a == b) {
min = a;
}
if (b == c) {
min = b;
}
if (c == a) {
min = c;
}
if (a % 3 == b % 3) {
min = Math.min(min, calc(a, b, c));
}
if (b % 3 == c % 3) {
min = Math.min(min, calc(b, a, c));
}
if (c % 3 == a % 3) {
min = Math.min(min, calc(c, a, b));
}
if (min == Integer.MAX_VALUE) {
min = -1;
}
joiner.add(Integer.toString(min));
}
System.out.println(joiner);
}
private static int calc(final int a, final int b, final int c) { // a <= b
if (a > b) {
return calc(b, a, c);
}
return b;
}
private static class FastScanner {
private final BufferedReader reader;
private StringTokenizer tokenizer;
FastScanner(final InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
}
String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (final IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringJoiner;
import java.util.StringTokenizer;
public class Main {
public static void main(final String[] args) {
final FastScanner scanner = new FastScanner(System.in);
final int n = scanner.nextInt();
final StringJoiner joiner = new StringJoiner("\n");
for (int i = 0; i < n; i++) {
final int a = scanner.nextInt();
final int b = scanner.nextInt();
final int c = scanner.nextInt();
int min = Integer.MAX_VALUE;
if (a == b) {
min = a;
}
if (b == c) {
min = b;
}
if (c == a) {
min = c;
}
if (a % 3 == b % 3) {
min = Math.min(min, calc(a, b, c));
}
if (b % 3 == c % 3) {
min = Math.min(min, calc(b, c, a));
}
if (c % 3 == a % 3) {
min = Math.min(min, calc(c, a, b));
}
if (min == Integer.MAX_VALUE) {
min = -1;
}
joiner.add(Integer.toString(min));
}
System.out.println(joiner);
}
private static int calc(final int a, final int b, final int c) { // a <= b
if (a > b) {
return calc(b, a, c);
}
return b;
}
private static class FastScanner {
private final BufferedReader reader;
private StringTokenizer tokenizer;
FastScanner(final InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
}
String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (final IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
}
}
|
ConDefects/ConDefects/Code/arc128_b/Java/26620566
|
condefects-java_data_1780
|
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for(int i = 0; i < t; i++) {
int a[] = new int[3];
for(int j = 0; j < 3; j++) {
a[j] = sc.nextInt();
}
int result = Integer.MAX_VALUE;
Arrays.sort(a);
if((a[1] - a[0]) % 3 == 0) {
result = Math.min(a[1], result);
}
if((a[2] - a[0]) % 3 == 0) {
result = Math.min(a[2], result);
}
if((a[2] - a[1]) % 3 == 0) {
result = Math.min(a[1], result);
}
if(result < Integer.MAX_VALUE) {
System.out.println(result);
}
else {
System.out.println(-1);
}
}
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for(int i = 0; i < t; i++) {
int a[] = new int[3];
for(int j = 0; j < 3; j++) {
a[j] = sc.nextInt();
}
int result = Integer.MAX_VALUE;
Arrays.sort(a);
if((a[1] - a[0]) % 3 == 0) {
result = Math.min(a[1], result);
}
if((a[2] - a[0]) % 3 == 0) {
result = Math.min(a[2], result);
}
if((a[2] - a[1]) % 3 == 0) {
result = Math.min(a[2], result);
}
if(result < Integer.MAX_VALUE) {
System.out.println(result);
}
else {
System.out.println(-1);
}
}
}
}
|
ConDefects/ConDefects/Code/arc128_b/Java/26713377
|
condefects-java_data_1781
|
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String K = sc.next();
System.out.println(K.lastIndexOf(0));
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
String K = sc.next();
System.out.println(K.charAt(N-1));
}
}
|
ConDefects/ConDefects/Code/abc244_a/Java/37951030
|
condefects-java_data_1782
|
import java.util.*;
class Main {
static int x;
static int y;
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
x=scanner.nextInt();
y=scanner.nextInt();
long ans=cals(n,true);
System.out.println(ans);
}
public static int cals(int level,boolean isred){
if(level==1){
return isred ? 0 : 1;
}
if(isred){
return cals(level-1,true)+cals(level,false)*x;
} else{
return cals(level-1,true)+cals(level-1,false)*y;
}
}
}
import java.util.*;
class Main {
static int x;
static int y;
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int n=scanner.nextInt();
x=scanner.nextInt();
y=scanner.nextInt();
long ans=cals(n,true);
System.out.println(ans);
}
public static long cals(int level,boolean isred){
if(level==1){
return isred ? 0 : 1;
}
if(isred){
return cals(level-1,true)+cals(level,false)*x;
} else{
return cals(level-1,true)+cals(level-1,false)*y;
}
}
}
|
ConDefects/ConDefects/Code/abc260_c/Java/42091098
|
condefects-java_data_1783
|
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 T = in.it();
int N;
char[] S;
Object solve(){
while (T-- > 0) {
long ans = solve2();
if (ans == 1) {
log.println(S);
log.println(ans);
}
out.println(ans);
}
return null;
}
long solve2(){
N = in.it();
S = in.ch();
List<Integer> list = new ArrayList<>();
int cnt = 0;
for (int i = 0;i < N;i++) {
char c = S[i];
if (c == '1') {
cnt++;
list.add(i);
}
}
if (cnt == 0)
return 0;
if (cnt %2 == 1)
return -1;
if (N == 3) {
if (list.get(0) == 0 && list.get(1) == 1)
return 1;
return -1;
}
if (N == 4) {
if (cnt == 4)
return 2;
if (S[1] == '1' && S[2] == '1')
return 3;
if (S[0] == '1' && S[1] == '1' || S[2] == '1' && S[3] == '1')
return 2;
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 T = in.it();
int N;
char[] S;
Object solve(){
while (T-- > 0) {
long ans = solve2();
if (ans == 1) {
log.println(S);
log.println(ans);
}
out.println(ans);
}
return null;
}
long solve2(){
N = in.it();
S = in.ch();
List<Integer> list = new ArrayList<>();
int cnt = 0;
for (int i = 0;i < N;i++) {
char c = S[i];
if (c == '1') {
cnt++;
list.add(i);
}
}
if (cnt == 0)
return 0;
if (cnt %2 == 1)
return -1;
if (N == 3) {
if (S[0] == '1' && S[2] == '1')
return 1;
return -1;
}
if (N == 4) {
if (cnt == 4)
return 2;
if (S[1] == '1' && S[2] == '1')
return 3;
if (S[0] == '1' && S[1] == '1' || S[2] == '1' && S[3] == '1')
return 2;
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_a/Java/38984924
|
condefects-java_data_1784
|
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.function.*;
public class Main implements Runnable {
private static boolean DEBUG;
public static void main(final String[] args) {
DEBUG = args.length > 0 && args[0].equals("-DEBUG");
Thread.setDefaultUncaughtExceptionHandler((t, e) -> { e.printStackTrace(); System.exit(1); });
new Thread(null, new Main(), "", 1 << 31).start();
}
@Override
public void run() { Solver solver = new Solver(); solver.solve(); solver.exit(); }
public static final class FastInputStream {
private static final int BUF_SIZE = 1 << 14;
private final InputStream in;
private final byte buf[] = new byte[BUF_SIZE];
private int pos = 0;
private int count = 0;
private static final int TOKEN_SIZE = 1 << 20;
private final byte tokenBuf[] = new byte[TOKEN_SIZE];
public FastInputStream(final InputStream in) {
this.in = in;
}
private final void readBuf() {
pos = 0;
try { count = in.read(buf); }
catch(IOException e) { e.printStackTrace(); }
}
private final boolean hasNextByte() {
if(pos < count) return true;
readBuf();
return count > 0;
}
private final byte read() { if(hasNextByte()) return buf[pos ++]; else throw new NoSuchElementException(); }
private final boolean isPrintableChar(final byte c) { return 33 <= c && c <= 126; }
private final boolean isNumber(final byte c) { return 48 <= c && c <= 57; }
private final void skipUnprintable() {
while(true) {
for(int i = pos; i < count; i ++) {
if(isPrintableChar(buf[i])) { pos = i; return; }
}
readBuf();
if(count <= 0) throw new NoSuchElementException();
}
}
private final boolean readEOL() {
if(!hasNextByte()) return true;
if(buf[pos] == 13) {
pos ++;
if(hasNextByte() && buf[pos] == 10) pos ++;
return true;
}
if(buf[pos] == 10) {
pos ++;
return true;
}
return false;
}
public final char nextChar() {
skipUnprintable();
return (char)buf[pos ++];
}
public final String next() {
skipUnprintable();
int tokenCount = 0;
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
tokenBuf[tokenCount ++] = b;
}
readBuf();
}
return new String(tokenBuf, 0, tokenCount);
}
public final String nextLine() {
readEOL();
if(!hasNextByte()) throw new NoSuchElementException();
int tokenCount = 0;
while(!readEOL()) tokenBuf[tokenCount ++] = read();
return new String(tokenBuf, 0, tokenCount);
}
public final int nextInt() {
skipUnprintable();
int n = 0;
boolean minus = false;
if(buf[pos] == 45) {
minus = true;
pos ++;
if(!hasNextByte() || !isNumber(buf[pos])) throw new InputMismatchException();
}
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
if(!isNumber(b)) throw new InputMismatchException();
if(minus) {
if(n < - 214748364) throw new ArithmeticException("int overflow");
if(n == - 214748364 && b > 56) throw new ArithmeticException("int overflow");
n = (n << 3) + (n << 1) + 48 - b;
}else {
if(n > 214748364) throw new ArithmeticException("int overflow");
if(n == 214748364 && b >= 56) throw new ArithmeticException("int overflow");
n = (n << 3) + (n << 1) - 48 + b;
}
}
readBuf();
}
return n;
}
public final long nextLong() {
skipUnprintable();
long n = 0;
boolean minus = false;
if(buf[pos] == 45) {
minus = true;
pos ++;
if(!hasNextByte() || !isNumber(buf[pos])) throw new InputMismatchException();
}
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
if(!isNumber(b)) throw new InputMismatchException();
if(minus) {
if(n < - 922337203685477580l) throw new ArithmeticException("long overflow");
if(n == - 922337203685477580l && b > 56) throw new ArithmeticException("long overflow");
n = (n << 3) + (n << 1) + 48 - b;
}else {
if(n > 922337203685477580l) throw new ArithmeticException("long overflow");
if(n == 922337203685477580l && b >= 56) throw new ArithmeticException("long overflow");
n = (n << 3) + (n << 1) - 48 + b;
}
}
readBuf();
}
return n;
}
public final double nextDouble() { return Double.parseDouble(next()); }
public final void close() {
try { in.close(); }
catch(IOException e) { e.printStackTrace(); }
}
}
public static final class FastOutputStream {
private static final int BUF_SIZE = 1 << 13;
private final byte buf[] = new byte[BUF_SIZE];
private final OutputStream out;
private int count = 0;
private static final byte TRUE_BYTES[] = {116, 114, 117, 101};
private static final byte FALSE_BYTES[] = {102, 97, 108, 115, 101};
private static final byte INT_MIN_BYTES[] = {45, 50, 49, 52, 55, 52, 56, 51, 54, 52, 56};
private static final byte LONG_MIN_BYTES[] = {45, 57, 50, 50, 51, 51, 55, 50, 48, 51,
54, 56, 53, 52, 55, 55, 53, 56, 48, 56};
private static final int TOKEN_SIZE = 20;
private final byte tokenBuf[] = new byte[TOKEN_SIZE];
private static final int PRECISION = 10;
public FastOutputStream(OutputStream out) {
this.out = out;
}
public final void print() { }
public final void write(final byte b) {
if(count == BUF_SIZE) internalFlush();
buf[count ++] = b;
}
public final void print(final char c) { write((byte) c); }
public final void print(final boolean b) {
if(b) {
if(count + 4 > BUF_SIZE) internalFlush();
System.arraycopy(TRUE_BYTES, 0, buf, count, TRUE_BYTES.length);
count += TRUE_BYTES.length;
}else {
if(count + 5 > BUF_SIZE) internalFlush();
System.arraycopy(FALSE_BYTES, 0, buf, count, FALSE_BYTES.length);
count += FALSE_BYTES.length;
}
}
public final void print(int x) {
if(count + 11 > BUF_SIZE) internalFlush();
if(x == Integer.MIN_VALUE) {
System.arraycopy(INT_MIN_BYTES, 0, buf, count, INT_MIN_BYTES.length);
count += INT_MIN_BYTES.length;
return;
}
if(x == 0) {
buf[count ++] = 48;
return;
}
if(x < 0) {
buf[count ++] = 45;
x = - x;
}
int tokenCount = 11;
while(x > 0) {
final int y = x / 10;
tokenBuf[-- tokenCount] = (byte) (x - (y << 3) - (y << 1) + 48);
x = y;
}
System.arraycopy(tokenBuf, tokenCount, buf, count, 11 - tokenCount);
count += 11 - tokenCount;
}
public final void print(long x) {
if(count + 20 > BUF_SIZE) internalFlush();
if(x == Long.MIN_VALUE) {
System.arraycopy(LONG_MIN_BYTES, 0, buf, count, LONG_MIN_BYTES.length);
count += LONG_MIN_BYTES.length;
return;
}
if(x == 0) {
buf[count ++] = 48;
return;
}
if(x < 0) {
buf[count ++] = 45;
x = - x;
}
int tokenCount = 20;
while(x > 0) {
final long y = x / 10;
tokenBuf[-- tokenCount] = (byte) (x - (y << 3) - (y << 1) + 48);
x = y;
}
System.arraycopy(tokenBuf, tokenCount, buf, count, 20 - tokenCount);
count += 20 - tokenCount;
}
public final void print(final double d) { print(d, PRECISION); }
public final void print(double d, final int precision) {
if(count == BUF_SIZE) internalFlush();
if(d < 0) {
buf[count ++] = 45;
d = - d;
}
d += Math.pow(10, - precision) / 2;
print((long)d);
if(precision == 0) return;
if(count + precision + 1 > BUF_SIZE) internalFlush();
buf[count ++] = 46;
d -= (long)d;
for(int i = 0; i < precision; i ++) {
d *= 10;
buf[count ++] = (byte)((int)d + 48);
d -= (int) d;
}
}
public final void print(final String s) { print(s.getBytes()); }
public final void print(final Object o) { print(o.toString()); }
public final void print(final byte[] a) {
if(count + a.length > BUF_SIZE) internalFlush();
System.arraycopy(a, 0, buf, count, a.length);
count += a.length;
}
public final void print(final char[] a) {
if(count + a.length > BUF_SIZE) internalFlush();
for(int i = 0; i < a.length; i ++) buf[count + i] = (byte)a[i];
count += a.length;
}
public final void println() { print('\n'); }
public final void println(final char c) { print(c); println(); }
public final void println(final boolean b) { print(b); println(); }
public final void println(final int x) { print(x); println(); }
public final void println(final long x) { print(x); println(); }
public final void println(final double d) { print(d); println(); }
public final void println(final double d, final int precision) { print(d, precision); println(); }
public final void println(final String s) { print(s); println(); }
public final void println(final Object o) { print(o); println(); }
public final void println(final char[] a) { print(a); println(); }
public final void println(final int[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final long[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final double[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final double[] a, final int precision) {
for(int i = 0; i < a.length; i ++) {
print(a[i], precision);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final String[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final Object[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
private final void internalFlush() {
try {
out.write(buf, 0, count);
count = 0;
}
catch(IOException e) { e.printStackTrace(); }
}
public final void flush() {
try {
out.write(buf, 0, count);
out.flush();
count = 0;
}
catch(IOException e) { e.printStackTrace(); }
}
public final void close() {
try { out.close(); }
catch(IOException e) { e.printStackTrace(); }
}
}
public static final class Solver {
private static final FastInputStream in = new FastInputStream(System.in);
public Solver() { }
private static final String nline() { return in.nextLine(); }
private static final String[] nline(final int n) { final String a[] = new String[n]; for(int i = 0; i < n; i ++) a[i] = nline(); return a; }
private static final char nc() { return in.nextChar(); }
private static final char[] nc(int n) {
final String str = ns();
if(n < 0) n = str.length();
final char a[] = new char[n];
for(int i = 0; i < n; i ++) a[i] = str.charAt(i);
return a;
}
private static final char[][] nc(final int n, final int m) { final char a[][] = new char[n][m]; for(int i = 0; i < n; i ++) a[i] = nc(m); return a; }
private static final boolean[] nb(int n, final char t) {
final char c[] = nc(-1);
if(n < 0) n = c.length;
final boolean a[] = new boolean[n];
for(int i = 0; i < n; i ++) a[i] = c[i] == t;
return a;
}
private static final boolean[][] nb(final int n, final int m, final char t) { final boolean a[][] = new boolean[n][]; for(int i = 0; i < n; i ++) a[i] = nb(m, t); return a; }
private static final int ni() { return in.nextInt(); }
private static final int[] ni(final int n) { final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = ni(); return a; }
private static final int[][] ni(final int n, final int m) { final int a[][] = new int[n][]; for(int i = 0; i < n; i ++) a[i] = ni(m); return a; }
private static final long nl() { return in.nextLong(); }
private static final long[] nl(final int n) { final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = nl(); return a; }
private static final long[][] nl(final int n, final int m) { final long a[][] = new long[n][]; for(int i = 0; i < n; i ++) a[i] = nl(m); return a; }
private static final double nd() { return in.nextDouble(); }
private static final double[] nd(final int n) { final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = nd(); return a; }
private static final double[][] nd(final int n, final int m) { final double a[][] = new double[n][]; for(int i = 0; i < n; i ++) a[i] = nd(m); return a; }
private static final String ns() { return in.next(); }
private static final String[] ns(final int n) { final String a[] = new String[n]; for(int i = 0; i < n; i ++) a[i] = ns(); return a; }
private static final String[][] ns(final int n, final int m) { final String a[][] = new String[n][]; for(int i = 0; i < n; i ++) a[i] = ns(m); return a; }
private static final char booleanToChar(final boolean b) { return b ? '#' : '.'; }
private static final char[] booleanToChar(final boolean... a) {
final char c[] = new char[a.length];
for(int i = 0; i < a.length; i ++) c[i] = booleanToChar(a[i]);
return c;
}
private static final FastOutputStream out = new FastOutputStream(System.out);
private static final FastOutputStream err = new FastOutputStream(System.err);
private static final void prt() { out.print(); }
private static final void prt(final char c) { out.print(c); }
private static final void prt(final boolean b) { out.print(b); }
private static final void prt(final int x) { out.print(x); }
private static final void prt(final long x) { out.print(x); }
private static final void prt(final double d) { out.print(d); }
private static final void prt(final String s) { out.print(s); }
private static final void prt(final Object o) { out.print(o); }
private static final void prtln() { out.println(); }
private static final void prtln(final char c) { out.println(c); }
private static final void prtln(final boolean b) { out.println(b); }
private static final void prtln(final int x) { out.println(x); }
private static final void prtln(final long x) { out.println(x); }
private static final void prtln(final double d) { out.println(d); }
private static final void prtln(final String s) { out.println(s); }
private static final void prtln(final Object o) { out.println(o); }
private static final void prtln(final char... a) { out.println(a); }
private static final void prtln(final boolean... a) { out.println(booleanToChar(a)); }
private static final void prtln(final int... a) { out.println(a); }
private static final void prtln(final long... a) { out.println(a); }
private static final void prtln(final double... a) { out.println(a); }
private static final void prtln(final double[] a, int precision) { out.println(a, precision); }
private static final void prtln(final String... a) { out.println(a); }
private static final void prtln(final Object[] a) { out.println(a); }
private static final void prtlns(final char... a) { for(char ele : a) prtln(ele); }
private static final void prtlns(final boolean... a) { for(boolean ele : a) prtln(ele); }
private static final void prtlns(final int... a) { for(int ele : a) prtln(ele); }
private static final void prtlns(final long... a) { for(long ele : a) prtln(ele); }
private static final void prtlns(final double... a) { for(double ele : a) prtln(ele); }
private static final void prtlns(final Object[] a) { for(Object ele : a) prtln(ele); }
private static final void prtln(final char[][] a) { for(char[] ele : a) prtln(ele); }
private static final void prtln(final boolean[][] a) { for(boolean[] ele : a) prtln(ele); }
private static final void prtln(final int[][] a) { for(int[] ele : a) prtln(ele); }
private static final void prtln(final long[][] a) { for(long[] ele : a) prtln(ele); }
private static final void prtln(final double[][] a) { for(double[] ele : a) prtln(ele); }
private static final void prtln(final double[][] a, int precision) { for(double[] ele : a) prtln(ele, precision); }
private static final void prtln(final String[][] a) { for(String[] ele : a) prtln(ele); }
private static final void prtln(final Object[][] a) { for(Object[] ele : a) prtln(ele); }
private static final void errprt() { if(DEBUG) err.print(); }
private static final void errprt(final char c) { if(DEBUG) err.print(c); }
private static final void errprt(final boolean b) { if(DEBUG) err.print(booleanToChar(b)); }
private static final void errprt(final int x) { if(DEBUG) if(isINF(x)) err.print('_'); else err.print(x); }
private static final void errprt(final long x) { if(DEBUG) if(isINF(x)) err.print('_'); else err.print(x); }
private static final void errprt(final double d) { if(DEBUG) err.print(d); }
private static final void errprt(final String s) { if(DEBUG) err.print(s); }
private static final void errprt(final Object o) { if(DEBUG) err.print(o); }
private static final void errprtln() { if(DEBUG) err.println(); }
private static final void errprtln(final char c) { if(DEBUG) err.println(c); }
private static final void errprtln(final boolean b) { if(DEBUG) err.println(booleanToChar(b)); }
private static final void errprtln(final int x) { if(DEBUG) if(isINF(x)) err.println('_'); else err.println(x); }
private static final void errprtln(final long x) { if(DEBUG) if(isINF(x)) err.println('_'); else err.println(x); }
private static final void errprtln(final double d) { if(DEBUG) err.println(d); }
private static final void errprtln(final String s) { if(DEBUG) err.println(s); }
private static final void errprtln(final Object o) { if(DEBUG) err.println(o); }
private static final void errprtln(final char... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final boolean... a) { if(DEBUG) err.println(booleanToChar(a)); }
private static final void errprtln(final int... a) {
if(DEBUG) {
boolean start = false;
for(int ele : a) {
errprt(ele);
if(!start) errprt(' ');
start = false;
}
err.println();
}
}
private static final void errprtln(final long... a) {
if(DEBUG) {
boolean start = false;
for(long ele : a) {
errprt(ele);
if(!start) errprt(' ');
start = false;
}
err.println();
}
}
private static final void errprtln(final double... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final double[] a, final int precision) { if(DEBUG) err.println(a, precision); }
private static final void errprtln(final String... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final Object[] a) { if(DEBUG) err.println(a); }
private static final void errprtlns(final char... a) { if(DEBUG) for(char ele : a) errprtln(ele); }
private static final void errprtlns(final boolean... a) { if(DEBUG) for(boolean ele : a) errprtln(ele); }
private static final void errprtlns(final int... a) { if(DEBUG) for(int ele : a) errprtln(ele); }
private static final void errprtlns(final long... a) { if(DEBUG) for(long ele : a) errprtln(ele); }
private static final void errprtlns(final double... a) { if(DEBUG) for(double ele : a) errprtln(ele); }
private static final void errprtlns(final Object[] a) { if(DEBUG) for(Object ele : a) errprtln(ele); }
private static final void errprtln(final char[][] a) { if(DEBUG) for(char[] ele : a) errprtln(ele); }
private static final void errprtln(final boolean[][] a) { if(DEBUG) for(boolean[] ele : a) errprtln(ele); }
private static final void errprtln(final int[][] a) { if(DEBUG) for(int[] ele : a) errprtln(ele); }
private static final void errprtln(final long[][] a) { if(DEBUG) for(long[] ele : a) errprtln(ele); }
private static final void errprtln(final double[][] a) { if(DEBUG) for(double[] ele : a) errprtln(ele); }
private static final void errprtln(final double[][] a, int precision) { if(DEBUG) for(double[] ele : a) errprtln(ele, precision); }
private static final void errprtln(final String[][] a) { if(DEBUG) for(String[] ele : a) errprtln(ele); }
private static final void errprtln(final Object[][] a) { if(DEBUG) for(Object[] ele : a) errprtln(ele); }
private static final void errprtlns(final Object[][] a) { if(DEBUG) for(Object[] ele : a) { errprtlns(ele); errprtln(); } }
private static final void reply(final boolean b) { prtln(b ? "Yes" : "No"); }
private static final void REPLY(final boolean b) { prtln(b ? "YES" : "NO"); }
private static final void flush() { out.flush(); if(DEBUG) err.flush(); }
private static final void assertion(final boolean b) { if(!b) { flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char c) { if(!b) { errprtln(c); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean b2) { if(!b) { errprtln(b2); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int x) { if(!b) { errprtln(x); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long x) { if(!b) { errprtln(x); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double d) { if(!b) { errprtln(d); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String s) { if(!b) { errprtln(s); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object o) { if(!b) { errprtln(o); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object[] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void inclusiveRangeCheck(final int i, final int max) { inclusiveRangeCheck(i, 0, max); }
private static final void inclusiveRangeCheck(final int i, final int min, final int max) { rangeCheck(i, min, max + 1); }
private static final void inclusiveRangeCheck(final long i, final long max) { inclusiveRangeCheck(i, 0, max); }
private static final void inclusiveRangeCheck(final long i, final long min, final long max) { rangeCheck(i, min, max + 1); }
private static final void rangeCheck(final int i, final int max) { rangeCheck(i, 0, max); }
private static final void rangeCheck(final int i, final int min, final int max) { if(i < min || i >= max) throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, max)); }
private static final void rangeCheck(final long i, final long max) { rangeCheck(i, 0, max); }
private static final void rangeCheck(final long i, final long min, final long max) { if(i < min || i >= max) throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, max)); }
private static final void nonNegativeCheck(final long x) { nonNegativeCheck(x, "the argument"); }
private static final void nonNegativeCheck(final long x, final String attribute) { if(x < 0) throw new IllegalArgumentException(String.format("%s %d is negative", attribute, x)); }
private static final void positiveCheck(final long x) { positiveCheck(x, "the argument"); }
private static final void positiveCheck(final long x, final String attribute) { if(x <= 0) throw new IllegalArgumentException(String.format("%s %d is negative", attribute, x)); }
private static final void exit() { flush(); System.exit(0); }
private static final void exit(final char c) { prtln(c); exit(); }
private static final void exit(final boolean b) { prtln(b); exit(); }
private static final void exit(final int x) { prtln(x); exit(); }
private static final void exit(final long x) { prtln(x); exit(); }
private static final void exit(final double d) { prtln(d); exit(); }
private static final void exit(final String s) { prtln(s); exit(); }
private static final void exit(final Object o) { prtln(o); exit(); }
private static final void exit(final char... a) { prtln(a); exit(); }
private static final void exit(final boolean... a) { prtln(a); exit(); }
private static final void exit(final int... a) { prtln(a); exit(); }
private static final void exit(final long... a) { prtln(a); exit(); }
private static final void exit(final double... a) { prtln(a); exit(); }
private static final void exit(final String... a) { prtln(a); exit(); }
private static final void exit(final Object[] a) { prtln(a); exit(); }
private static final void exit(final char[][] a) { prtln(a); exit(); }
private static final void exit(final boolean[][] a) { prtln(a); exit(); }
private static final void exit(final int[][] a) { prtln(a); exit(); }
private static final void exit(final long[][] a) { prtln(a); exit(); }
private static final void exit(final double[][] a) { prtln(a); exit(); }
private static final void exit(final String[][] a) { prtln(a); exit(); }
private static final void exit(final Object[][] a) { prtln(a); exit(); }
private static final long INF = (long)4e18;
private static final boolean isPlusINF(final long x) { return x > INF / 10; }
private static final boolean isMinusINF(final long x) { return isPlusINF(- x); }
private static final boolean isINF(final long x) { return isPlusINF(x) || isMinusINF(x); }
private static final int I_INF = (int)1e9 + 1000;
private static final boolean isPlusINF(final int x) { return x > I_INF / 10; }
private static final boolean isMinusINF(final int x) { return isPlusINF(- x); }
private static final boolean isINF(final int x) { return isPlusINF(x) || isMinusINF(x); }
private static final int min(final int a, final int b) { return Math.min(a, b); }
private static final long min(final long a, final long b) { return Math.min(a, b); }
private static final double min(final double a, final double b) { return Math.min(a, b); }
private static final <T extends Comparable<T>> T min(final T a, final T b) { return a.compareTo(b) <= 0 ? a : b; }
private static final int min(final int... x) { int min = x[0]; for(int val : x) min = min(min, val); return min; }
private static final long min(final long... x) { long min = x[0]; for(long val : x) min = min(min, val); return min; }
private static final double min(final double... x) { double min = x[0]; for(double val : x) min = min(min, val); return min; }
private static final int max(final int a, final int b) { return Math.max(a, b); }
private static final long max(final long a, final long b) { return Math.max(a, b); }
private static final double max(final double a, final double b) { return Math.max(a, b); }
private static final <T extends Comparable<T>> T max(final T a, final T b) { return a.compareTo(b) >= 0 ? a : b; }
private static final int max(final int... x) { int max = x[0]; for(int val : x) max = max(max, val); return max; }
private static final long max(final long... x) { long max = x[0]; for(long val : x) max = max(max, val); return max; }
private static final double max(final double... x) { double max = x[0]; for(double val : x) max = max(max, val); return max; }
private static final <T extends Comparable<T>> T max(final T[] x) { T max = x[0]; for(T val : x) max = max(max, val); return max; }
private static final int max(final int[][] a) { int max = a[0][0]; for(int[] ele : a) max = max(max, max(ele)); return max; }
private static final long max(final long[][] a) { long max = a[0][0]; for(long[] ele : a) max = max(max, max(ele)); return max; }
private static final double max(final double[][] a) { double max = a[0][0]; for(double[] ele : a) max = max(max, max(ele)); return max; }
private static final <T extends Comparable<T>> T max(final T[][] a) { T max = a[0][0]; for(T[] ele : a) max = max(max, max(ele)); return max; }
private static final long sum(final int... a) { long sum = 0; for(int ele : a) sum += ele; return sum; }
private static final long sum(final long... a) { long sum = 0; for(long ele : a) sum += ele; return sum; }
private static final double sum(final double... a) { double sum = 0; for(double ele : a) sum += ele; return sum; }
private static final int sum(final boolean... a) { int sum = 0; for(boolean ele : a) sum += ele ? 1 : 0; return sum; }
private static final long[] sums(final int[] a) { long sum[] = new long[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final long[] sums(final long[] a) { long sum[] = new long[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final double[] sums(final double[] a) { double sum[] = new double[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final int[] sums(final boolean[] a) { int sum[] = new int[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + (a[i] ? 1 : 0); return sum; }
private static final long[][] sums(final int[][] a) {
final long sum[][] = new long[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final long[][] sums(final long[][] a) {
final long sum[][] = new long[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final double[][] sums(final double[][] a) {
final double sum[][] = new double[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final int[][] sums(final boolean[][] a) {
final int sum[][] = new int[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (a[i][j] ? 1 : 0);
}
return sum;
}
private static final int constrain(final int x, final int l, final int r) { return min(max(x, min(l, r)), max(l, r)); }
private static final long constrain(final long x, final long l, final long r) { return min(max(x, min(l, r)), max(l, r)); }
private static final double constrain(final double x, final double l, final double r) { return min(max(x, min(l, r)), max(l, r)); }
private static final int abs(final int x) { return x >= 0 ? x : - x; }
private static final long abs(final long x) { return x >= 0 ? x : - x; }
private static final double abs(final double x) { return x >= 0 ? x : - x; }
private static final int signum(final int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final int signum(final long x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final int signum(final double x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final long round(final double x) { return Math.round(x); }
private static final long floor(final double x) { return round(Math.floor(x)); }
private static final int divfloor(final int a, final int b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }
private static final long divfloor(final long a, final long b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }
private static final long ceil(final double x) { return round(Math.ceil(x)); }
private static final int divceil(final int a, final int b) { return a >= 0 && b > 0 ? (a + b - 1) / b : a < 0 && b < 0 ? divceil(abs(a), abs(b)) : - divfloor(abs(a), abs(b)); }
private static final long divceil(final long a, final long b) { return a >= 0 && b > 0 ? (a + b - 1) / b : a < 0 && b < 0 ? divceil(abs(a), abs(b)) : - divfloor(abs(a), abs(b)); }
private static final boolean mulGreater(final long a, final long b, long c) { return b == 0 ? c < 0 : b < 0 ? mulLess(a, - b, - c) : a > divfloor(c, b); } // a * b > c
private static final boolean mulGreaterEquals(final long a, final long b, final long c) { return b == 0 ? c <= 0 : b < 0 ? mulLessEquals(a, - b, - c) : a >= divceil(c, b); } // a * b >= c
private static final boolean mulLess(final long a, final long b, final long c) { return !mulGreaterEquals(a, b, c); } // a * b < c
private static final boolean mulLessEquals(final long a, final long b, final long c) { return !mulGreater(a, b, c); } // a * b <= c
private static final double sqrt(final int x) { return Math.sqrt((double)x); }
private static final double sqrt(final long x) { return Math.sqrt((double)x); }
private static final double sqrt(final double x) { return Math.sqrt(x); }
private static final int floorsqrt(final int x) { int s = (int)floor(sqrt(x)) + 1; while(s * s > x) s --; return s; }
private static final long floorsqrt(final long x) { long s = floor(sqrt(x)) + 1; while(s * s > x) s --; return s; }
private static final int ceilsqrt(final int x) { int s = (int)ceil(sqrt(x)); while(s * s >= x) s --; s ++; return s; }
private static final long ceilsqrt(final long x) { long s = ceil(sqrt(x)); while(s * s >= x) s --; s ++; return s; }
private static final long fact(final int n) { long ans = 1; for(int i = 1; i <= n; i ++) ans = Math.multiplyExact(ans, i); return ans; }
private static final long naiveP(final long n, final long r) { long ans = 1; for(int i = 0; i < r; i ++) ans = Math.multiplyExact(ans, n - i); return ans; }
private static final long naiveC(final long n, final long r) { long ans = 1; for(int i = 0; i < r; i ++) { ans = Math.multiplyExact(ans, n - i); ans /= (i + 1); } return ans; }
private static final double pow(final double x, final double y) { return Math.pow(x, y); }
private static final long pow(long x, long y) {
long ans = 1;
while(true) {
if((y & 1) != 0) ans = Math.multiplyExact(ans, x);
y >>= 1;
if(y <= 0) return ans;
x = Math.multiplyExact(x, x);
}
}
private static final double pow(double x, long y) {
double ans = 1;
while(true) {
if((y & 1) != 0) ans *= x;
y >>= 1;
if(y <= 0) return ans;
x *= x;
}
}
private static final int gcd(int a, int b) { while(true) { if(b == 0) return a; int tmp = a; a = b; b = tmp % b; } }
private static final long gcd(long a, long b) { while(true) { if(b == 0) return a; long tmp = a; a = b; b = tmp % b; } }
private static final long lcm(final long a, final long b) { return a / gcd(a, b) * b; }
private static final int gcd(final int... a) { int gcd = 0; for(int ele : a) gcd = gcd(ele, gcd); return gcd; }
private static final long gcd(final long... a) { long gcd = 0; for(long ele : a) gcd = gcd(ele, gcd); return gcd; }
private static final double random() { return Math.random(); }
private static final int random(final int max) { return (int)floor(random() * max); }
private static final long random(final long max) { return floor(random() * max); }
private static final double random(final double max) { return random() * max; }
private static final int random(final int min, final int max) { return random(max - min) + min; }
private static final long random(final long min, final long max) { return random(max - min) + min; }
private static final double random(final double min, final double max) { return random(max - min) + min; }
private static final boolean isUpper(final char c) { return c >= 'A' && c <= 'Z'; }
private static final boolean isLower(final char c) { return c >= 'a' && c <= 'z'; }
private static final int upperToInt(final char c) { return c - 'A'; }
private static final int lowerToInt(final char c) { return c - 'a'; }
private static final int numToInt(final char c) { return c - '0'; }
private static final int charToInt(final char c) { return isLower(c) ? lowerToInt(c) : isUpper(c) ? upperToInt(c) : numToInt(c); }
private static final int alphabetToInt(final char c) { return isLower(c) ? lowerToInt(c) : isUpper(c) ? upperToInt(c) + 26 : 52; }
private static final char intToUpper(final int x) { return (char)(x + 'A'); }
private static final char intToLower(final int x) { return (char)(x + 'a'); }
private static final char intToNum(final int x) { return (char)(x + '0'); }
private static final int[] charToInt(final char[] a) { final int toint[] = new int[a.length]; for(int i = 0; i < a.length; i ++) toint[i] = charToInt(a[i]); return toint; }
private static final int[][] charToInt(final char[][] a) { final int toint[][] = new int[a.length][]; for(int i = 0; i < a.length; i ++) toint[i] = charToInt(a[i]); return toint; }
private static final long[] div(final long x) {
nonNegativeCheck(x);
final List<Long> divList = new ArrayList<>();
for(long i = 1; i * i <= x; i ++) if(x % i == 0) { divList.add(i); if(i * i != x) divList.add(x / i); }
final long div[] = new long[divList.size()];
for(int i = 0; i < divList.size(); i ++) div[i] = divList.get(i);
Arrays.sort(div);
return div;
}
private static final PairLL[] factor(long x) {
nonNegativeCheck(x);
final List<PairLL> factorList = new ArrayList<>();
for(long i = 2; i * i <= x; i ++) {
if(x % i == 0) {
long cnt = 0;
while(x % i == 0) { x /= i; cnt ++; }
factorList.add(new PairLL(i, cnt));
}
}
if(x > 1) factorList.add(new PairLL(x, 1));
final PairLL factor[] = new PairLL[factorList.size()];
for(int i = 0; i < factorList.size(); i ++) factor[i] = factorList.get(i);
Arrays.sort(factor);
return factor;
}
private static final boolean isPrime(final long x) { if(x <= 1) return false; for(long i = 2; i * i <= x; i ++) if(x % i == 0) return false; return true; }
private static final boolean[] prime(final int n) {
nonNegativeCheck(n);
final boolean prime[] = new boolean[n];
fill(prime, true);
if(n > 0) prime[0] = false;
if(n > 1) prime[1] = false;
for(int i = 2; i < n; i ++) if(prime[i]) for(int j = 2; i * j < n; j ++) prime[i * j] = false;
return prime;
}
private static final PairIL[] countElements(final int[] a, final boolean sort) {
final int len = a.length;
final int array[] = new int[len];
for(int i = 0; i < len; i ++) array[i] = a[i];
if(sort) Arrays.sort(array);
final List<PairIL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairIL(array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairIL cnts[] = new PairIL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final PairLL[] countElements(final long[] a, final boolean sort) {
final int len = a.length;
final long array[] = new long[len];
for(int i = 0; i < len; i ++) array[i] = a[i];
if(sort) Arrays.sort(array);
final List<PairLL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairLL(array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairLL cnts[] = new PairLL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final PairIL[] countElements(final String s, final boolean sort) {
final int len = s.length();
final char array[] = s.toCharArray();
if(sort) Arrays.sort(array);
final List<PairIL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairIL((int)array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairIL cnts[] = new PairIL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final long triangular(final long n) { return n * (n + 1) / 2; }
private static final long arctriangularfloor(final long m) {
long n = (floor(sqrt(m * 8 + 1)) - 1) / 2 + 1;
while(triangular(n) > m) n --;
return n;
}
private static final long arctriangularceil(final long m) {
long n = max(0, (ceil(sqrt(m * 8 + 1)) + 1) / 2 - 1);
while(triangular(n) < m) n ++;
return n;
}
private static final int[] baseConvert(long x, final int n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final int digit[] = new int[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = (int)(x % n); x /= n; }
return digit;
}
private static final int[] baseConvert(final long x, final int n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
long tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final int[] baseConvert(int x, final int n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final int digit[] = new int[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = (int)(x % n); x /= n; }
return digit;
}
private static final int[] baseConvert(final int x, final int n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
int tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final long[] baseConvert(long x, final long n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final long digit[] = new long[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = x % n; x /= n; }
return digit;
}
private static final long[] baseConvert(final long x, final long n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
long tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final int numDigits(final long x) { nonNegativeCheck(x); return Long.toString(x).length(); }
private static final long bitFlag(final int i) { nonNegativeCheck(i); return 1L << i; }
private static final boolean isFlagged(final long x, final int i) { nonNegativeCheck(x); nonNegativeCheck(i); return (x >> i & 1) != 0; }
private static final long countString(final String s, final String t) { return (s.length() - s.replace(t, "").length()) / t.length(); }
private static final long countStringAll(final String s, final String t) { return s.length() - s.replaceAll(t, "").length(); }
private static final String reverse(final String s) { return (new StringBuilder(s)).reverse().toString(); }
private static final char[] reverse(final char[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final boolean[] reverse(final boolean[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final int[] reverse(final int[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final long[] reverse(final long[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final double[] reverse(final double[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final String[] reverse(final String[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final Object[] reverse(final Object[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final void fill(final char[] a, final char x) { Arrays.fill(a, x); }
private static final void fill(final boolean[] a, final boolean x) { Arrays.fill(a, x); }
private static final void fill(final int[] a, final int x) { Arrays.fill(a, x); }
private static final void fill(final long[] a, final long x) { Arrays.fill(a, x); }
private static final void fill(final double[] a, final double x) { Arrays.fill(a, x); }
private static final void fill(final char[][] a, final char x) { for(char[] ele : a) fill(ele, x); }
private static final void fill(final boolean[][] a, final boolean x) { for(boolean[] ele : a) fill(ele, x); }
private static final void fill(final int[][] a, final int x) { for(int[] ele : a) fill(ele, x); }
private static final void fill(final long[][] a, final long x) { for(long[] ele : a) fill(ele, x); }
private static final void fill(final double[][] a, final double x) { for(double[] ele : a) fill(ele, x); }
private static final void fill(final char[][][] a, final char x) { for(char[][] ele : a) fill(ele, x); }
private static final void fill(final boolean[][][] a, final boolean x) { for(boolean[][] ele : a) fill(ele, x); }
private static final void fill(final int[][][] a, final int x) { for(int[][] ele : a) fill(ele, x); }
private static final void fill(final long[][][] a, final long x) { for(long[][] ele : a) fill(ele, x); }
private static final void fill(final double[][][] a, final double x) { for(double[][] ele : a) fill(ele, x); }
private static final char[] resize(final char[] a, final int m, final int x) {
nonNegativeCheck(m);
final char resized[] = new char[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final boolean[] resize(final boolean[] a, final int m, final int x) {
nonNegativeCheck(m);
final boolean resized[] = new boolean[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final int[] resize(final int[] a, final int m, final int x) {
nonNegativeCheck(m);
final int resized[] = new int[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final long[] resize(final long[] a, final int m, final int x) {
nonNegativeCheck(m);
final long resized[] = new long[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final double[] resize(final double[] a, final int m, final int x) {
nonNegativeCheck(m);
final double resized[] = new double[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final String[] resize(final String[] a, final int m, final int x) {
nonNegativeCheck(m);
final String resized[] = new String[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final Object[] resize(final Object[] a, final int m, final int x) {
nonNegativeCheck(m);
final Object resized[] = new Object[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final int[] toIntArray(final List<Integer> list) { final int a[] = new int[list.size()]; int idx = 0; for(int ele : list) a[idx ++] = ele; return a; }
private static final long[] toLongArray(final List<Long> list) { final long a[] = new long[list.size()]; int idx = 0; for(long ele : list) a[idx ++] = ele; return a; }
private static final double[] toDoubleArray(final List<Double> list) { final double a[] = new double[list.size()]; int idx = 0; for(double ele : list) a[idx ++] = ele; return a; }
private static final char[] toCharArray(final List<Character> list) { final char a[] = new char[list.size()]; int idx = 0; for(char ele : list) a[idx ++] = ele; return a; }
private static final boolean[] toBooleanArray(final List<Boolean> list) { final boolean a[] = new boolean[list.size()]; int idx = 0; for(boolean ele : list) a[idx ++] = ele; return a; }
private static final String[] toStringArray(final List<String> list) { final String a[] = new String[list.size()]; int idx = 0; for(String ele : list) a[idx ++] = ele; return a; }
private static final <T> void toArray(final List<T> list, final T a[]) { int idx = 0; for(T ele : list) a[idx ++] = ele; }
private static final void shuffleArray(final int[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final void shuffleArray(final long[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final void shuffleArray(final double[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final int[] randomi(final int n, final int max) { nonNegativeCheck(n); final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final long[] randoml(final int n, final long max) { nonNegativeCheck(n); final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final double[] randomd(final int n, final double max) { nonNegativeCheck(n); final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final int[] randomi(final int n, final int min, final int max) { nonNegativeCheck(n); final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final long[] randoml(final int n, final long min, final long max) { nonNegativeCheck(n); final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final double[] randomd(final int n, final double min, final double max) { nonNegativeCheck(n); final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final void swap(final char[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); char tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final boolean[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); boolean tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final int[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); int tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final long[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); long tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final double[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); double tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final String[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); String tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final Object[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); Object tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final char[][] rotate(final char[][] a) {
final char[][] ans = new char[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final boolean[][] rotate(final boolean[][] a) {
final boolean[][] ans = new boolean[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final int[][] rotate(final int[][] a) {
final int[][] ans = new int[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final long[][] rotate(final long[][] a) {
final long[][] ans = new long[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final double[][] rotate(final double[][] a) {
final double[][] ans = new double[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final Object[][] rotate(final Object[][] a) {
final Object[][] ans = new Object[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final int[] compress(final int[] a) {
final int n = a.length;
final Set<Integer> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final int compressed[] = new int[ts.size()];
int j = 0;
for(int x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
private static final long[] compress(final long[] a) {
final int n = a.length;
final Set<Long> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final long compressed[] = new long[ts.size()];
int j = 0;
for(long x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
private static final double[] compress(final double[] a) {
final int n = a.length;
final Set<Double> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final double compressed[] = new double[ts.size()];
int j = 0;
for(double x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
// binary search
private static final int lowerBound(final int[] a, final int key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final int[] a, final int key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final int[] a, final int key) { return BS(a, key, true, true, false); }
private static final int upperBound(final int[] a, final int key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final int[] a, final int key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final int[] a, final int key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final int[] a, final int key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final int[] a, final int index, final int key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final int lowerBound(final long[] a, final long key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final long[] a, final long key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final long[] a, final long key) { return BS(a, key, true, true, false); }
private static final int upperBound(final long[] a, final long key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final long[] a, final long key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final long[] a, final long key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final long[] a, final long key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final long[] a, final int index, final long key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final int lowerBound(final double[] a, final double key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final double[] a, final double key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final double[] a, final double key) { return BS(a, key, true, true, false); }
private static final int upperBound(final double[] a, final double key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final double[] a, final double key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final double[] a, final double key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final double[] a, final double key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final double[] a, final int index, final double key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T key) { return BS(a, key, true, true, true); }
private static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T key) { return BS(a, key, true, true, false); }
private static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final <T extends Comparable<? super T>> int cntBS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final <T extends Comparable<? super T>> int cntBS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T extends Comparable<? super T>> int binarySearch(final T[] a, final T key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final <T extends Comparable<? super T>> boolean isOKforBS(final T[] a, final int index, final T key, final boolean gt, final boolean eq) {
int compare = a[index].compareTo(key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T> int lowerBound(final T[] a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, true, c); }
private static final <T> int lowerBound(final T[] a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, true, ng, ok, c); }
private static final <T> int upperBound(final T[] a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, false, c); }
private static final <T> int upperBound(final T[] a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, false, ng, ok, c); }
private static final <T> int cntBS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, c); }
private static final <T> int cntBS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, ng, ok, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, ng, ok, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length, c); }
private static final <T> int BS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok, final Comparator<? super T> c) {
int index = binarySearch(a, key, gt, eq, ng, ok, c);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T> int binarySearch(final T[] a, final T key, final boolean gt, final boolean eq, int ng, int ok, final Comparator<? super T> c) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq, c)) ok = mid; else ng = mid; }
return ok;
}
private static final <T> boolean isOKforBS(final T[] a, final int index, T key, final boolean gt, final boolean eq, final Comparator<? super T> c) {
int compare = c.compare(a[index], key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T key) { return BS(a, key, true, true, true); }
private static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T key) { return BS(a, key, true, true, false); }
private static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final <T extends Comparable<? super T>> int cntBS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final <T extends Comparable<? super T>> int cntBS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.size() : -1, asc ^ gt ? -1 : a.size()); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T extends Comparable<? super T>> int binarySearch(final List<T> a, final T key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final <T extends Comparable<? super T>> boolean isOKforBS(final List<T> a, final int index, T key, final boolean gt, final boolean eq) {
int compare = a.get(index).compareTo(key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T> int lowerBound(final List<T> a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, true, c); }
private static final <T> int lowerBound(final List<T> a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, true, ng, ok, c); }
private static final <T> int upperBound(final List<T> a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, false, c); }
private static final <T> int upperBound(final List<T> a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, false, ng, ok, c); }
private static final <T> int cntBS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, c); }
private static final <T> int cntBS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, ng, ok, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, ng, ok, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.size() : -1, asc ^ gt ? -1 : a.size(), c); }
private static final <T> int BS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok, final Comparator<? super T> c) {
int index = binarySearch(a, key, gt, eq, ng, ok, c);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T> int binarySearch(final List<T> a, final T key, final boolean gt, final boolean eq, int ng, int ok, final Comparator<? super T> c) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq, c)) ok = mid; else ng = mid; }
return ok;
}
private static final <T> boolean isOKforBS(final List<T> a, final int index, final T key, final boolean gt, final boolean eq, final Comparator<? super T> c) {
int compare = c.compare(a.get(index), key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final PairLL binaryRangeSearch(final long left, final long right, final UnaryOperator<Long> op, final boolean minimize) {
long ok1 = right, ng1 = left;
while(abs(ok1 - ng1) > 1) {
long mid = (ok1 + ng1) >> 1;
boolean isOK = (op.apply(mid + 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;
if(isOK) ok1 = mid; else ng1 = mid;
}
long ok2 = left, ng2 = right;
while(abs(ok2 - ng2) > 1) {
long mid = (ok2 + ng2) >> 1;
boolean isOK = (op.apply(mid - 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;
if(isOK) ok2 = mid; else ng2 = mid;
}
return new PairLL(ok1, ok2); //[l, r]
}
private static final double ternarySearch(double left, double right, final UnaryOperator<Double> op, final boolean minimize, final int loop) {
for(int cnt = 0; cnt < loop; cnt ++) {
double m1 = (left * 2 + right) / 3.0;
double m2 = (left + right * 2) / 3.0;
if(op.apply(m1) > op.apply(m2) ^ minimize) right = m2; else left = m1;
}
return (left + right) / 2.0;
}
// mods
private static final class Mod107 extends Mod {
public static final Mod107 md = new Mod107();
public static final long MOD = 1_000_000_007;
private Mod107() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod998 extends Mod {
public static final Mod998 md = new Mod998();
public static final long MOD = 998_244_353;
private Mod998() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod754974721 extends Mod {
public static final Mod754974721 md = new Mod754974721();
public static final long MOD = 754_974_721;
private Mod754974721() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod167772161 extends Mod {
public static final Mod167772161 md = new Mod167772161();
public static final long MOD = 167_772_161;
private Mod167772161() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod469762049 extends Mod {
public static final Mod469762049 md = new Mod469762049();
public static final long MOD = 469_762_049;
private Mod469762049() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class ArbitraryMod extends Mod {
private static final long MASK = 0xffff_ffffl;
private final long MH;
private final long ML;
public ArbitraryMod(long mod) { super(mod); long a = (1l << 32) / MOD; long b = (1l << 32) % MOD; long m = a * a * MOD + 2 * a * b + (b * b) / MOD; MH = m >>> 32; ML = m & MASK; }
private final long reduce(long x) {
if(MOD == 1) return 0;
if(x < 0) return (x = reduce(- x)) == 0 ? 0 : MOD - 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 x < MOD ? x : x - MOD;
}
@Override
public long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return reduce(x);
}
@Override
public long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return reduce(x * y);
x = mod(x);
y = mod(y);
return reduce(x * y);
}
}
private abstract static class Mod {
public final long MOD;
public Mod(long mod) { MOD = mod; }
public abstract long mod(long x);
public final long[] mod(final long[] a) { for(int i = 0; i < a.length; i ++) a[i] = mod(a[i]); return a; }
public final long[][] mod(final long[][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); return a; }
public final long[][][] mod(final long[][][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); return a; }
public long add(long x, final long y) { return (x += y) >= MOD * 2 || x < 0 ? mod(x) : x >= MOD ? x - MOD : x; }
public final long sum(final long... x) { long sum = 0; for(long ele : x) sum = add(sum, ele); return sum; }
public long sub(long x, final long y) { return (x -= y) < - MOD || x >= MOD ? mod(x) : x < 0 ? x + MOD : x; }
public final long pow(long x, long y) {
nonNegativeCheck(y);
x = mod(x);
long ans = 1;
for(; y > 0; y >>= 1) {
if((y & 1) != 0) ans = mul(ans, x);
x = mul(x, x);
}
return ans;
}
public abstract long mul(long x, long y);
public final long mul(final long... x) { long ans = 1; for(long ele : x) ans = mul(ans, ele); return ans; }
public final long div(final long x, final long y) { return mul(x, inv(y)); }
public final long[] pows(long x, final int n) {
x = mod(x);
long pow[] = new long[n + 1];
pow[0] = 1;
for(int i = 0; i < n; i ++) pow[i + 1] = mul(pow[i], x);
return pow;
}
public final long fact(final int n) {
nonNegativeCheck(n);
prepareFact();
if(n < MAX_FACT1) return fact[n];
else {
long ans = fact[MAX_FACT1 - 1];
for(int i = MAX_FACT1; i <= n; i ++) ans = mul(ans, i);
return ans;
}
}
public final long invFact(final int n) {
nonNegativeCheck(n);
prepareFact();
if(n < MAX_FACT1) return invFact[n];
else return inv(fact(n));
}
private static final int MAX_INV_SIZE = 100_100;
public final Map<Long, Long> invMap = new HashMap<>();
public final long inv(long x) {
x = mod(x);
if(invMap.containsKey(x)) return invMap.get(x);
if(invMap.size() >= MAX_INV_SIZE) return calInv(x);
invMap.put(x, calInv(x));
return invMap.get(x);
}
private final long calInv(final long x) { // O(logM)
PairLL s = new PairLL(MOD, 0);
PairLL t = new PairLL(mod(x), 1);
while(t.a > 0) {
long tmp = s.a / t.a;
PairLL u = new PairLL(s.a - t.a * tmp, s.b - t.b * tmp);
s = t;
t = u;
}
if(s.b < 0) s.b += MOD / s.a;
return s.b;
}
public final long[] invs(final int n) { // O(N)
positiveCheck(n);
long inv[] = new long[n + 1];
inv[1] = 1;
for(int i = 2; i <= n; i ++) inv[i] = mul(inv[(int)(MOD % i)], (MOD - MOD / i));
return inv;
}
private long g;
public final long primitiveRoot() { // O(1) or O(M^(1/2))
if(MOD == 2) return 1;
if(MOD == 167772161) return 3;
if(MOD == 469762049) return 3;
if(MOD == 754974721) return 11;
if(MOD == 998244353) return 3;
if(g != 0) return g;
PairLL factor[] = factor(MOD - 1);
outer: for(g = 2; ; g ++) {
for(PairLL p : factor) if(pow(g, (MOD - 1) / p.a) == 1) continue outer;
return g;
}
}
private static final int MAX_FACT1 = 5_000_100;
private static final int MAX_FACT2 = 500_100;
private static final int MAX_FACT_MAP_SIZE = 100;
private long fact[];
private long invFact[];
private boolean isFactPrepared = false;
private final Map<Long, long[]> factMap = new HashMap<>();
private final void prepareFact() {
if(isFactPrepared) return;
fact = new long[MAX_FACT1];
invFact = new long[MAX_FACT1];
fill(fact, 0);
fill(invFact, 0);
fact[0] = 1;
int maxIndex = min(MAX_FACT1, (int)MOD);
for(int i = 1; i < maxIndex; i ++) fact[i] = mul(fact[i - 1], i);
invFact[maxIndex - 1] = inv(fact[maxIndex - 1]);
for(int i = maxIndex - 1; i > 0; i --) invFact[i - 1] = mul(invFact[i], i);
isFactPrepared = true;
}
public final long P(final long n, final long r) {
if(!isFactPrepared) prepareFact();
if(n < 0 || r < 0 || n < r) return 0;
if(n < MAX_FACT1 && n < MOD) return mul(fact[(int)n], invFact[(int)(n - r)]);
if(!factMap.containsKey(n)) {
long largeFact[] = new long[MAX_FACT2];
factMap.put(n, largeFact);
fill(largeFact, -1);
largeFact[0] = 1;
}
long largeFact[] = factMap.get(n);
if(r >= MAX_FACT2) {
long ans = 1;
for(long i = n - r + 1; i <= n; i ++) ans = mul(ans, i);
return ans;
}else {
int i = (int)r;
while(largeFact[i] < 0) i --;
for(; i < r; i ++) largeFact[i + 1] = mul(largeFact[i], n - i);
if(factMap.size() > MAX_FACT_MAP_SIZE) factMap.remove(n);
return largeFact[(int)r];
}
}
public final long C(final long n, long r) {
if(!isFactPrepared) prepareFact();
if(n < 0) return mod(C(- n + r - 1, - n - 1) * ((r & 1) == 0 ? 1 : -1));
if(r < 0 || n < r) return 0;
r = min(r, n - r);
if(n < MOD) return mul(P(n, r), r < MAX_FACT1 ? invFact[(int)r] : inv(fact((int)r)));
long digitN[] = baseConvert(n, MOD);
long digitR[] = baseConvert(r, MOD);
final int len = digitN.length;
digitR = resize(digitR, len, 0);
long ans = 1;
for(int i = 0; i < len; i ++) ans = mul(ans, C(digitN[i], digitR[i]));
return ans;
}
public final long H(final long n, final long r) { return C(n - 1 + r, r); }
public final long sqrt(long x) {
x = mod(x);
long p = (MOD - 1) >> 1;
if(pow(x, p) != 1) return -1;
long q = MOD - 1;
int m = 1;
while(((q >>= 1) & 1) == 0) m ++;
long z = 1;
while(pow(z, p) == 1) z = random(1, MOD);
long c = pow(z, q);
long t = pow(x, q);
long r = pow(x, (q + 1) >> 1);
if(t == 0) return 0;
m -= 2;
while(t != 1) {
long pows[] = new long[m + 1];
pows[0] = t;
for(int i = 0; i < m; i ++) pows[i + 1] = mul(pows[i], pows[i]);
while(pows[m --] == 1) c = mul(c, c);
r = mul(r, c);
c = mul(c, c);
t = mul(t, c);
}
return r;
}
}
private static final long mod(long x, final long mod) {
if(0 <= x && x < mod) return x;
if(- mod <= x && x < 0) return x + mod;
return (x %= mod) < 0 ? x + mod : x;
}
private static final long pow(long x, long y, final long mod) {
nonNegativeCheck(y);
x = mod(x, mod);
long ans = 1;
for(; y > 0; y >>= 1) {
if((y & 1) != 0) ans = mod(ans * x, mod);
x = mod(x * x, mod);
}
return ans;
}
// grid
private static class Grids {
public final int h, w;
public final Grid[][] gs;
public final Grid[] gi;
public Grids(final int h, final int w) {
nonNegativeCheck(h);
nonNegativeCheck(w);
this.h = h;
this.w = w;
gs = new Grid[h][w];
gi = new Grid[h * w];
for(int i = 0; i < h; i ++) {
for(int j = 0; j < w; j ++) {
gs[i][j] = new Grid(i, j, h, w);
gi[gs[i][j].i] = gs[i][j];
}
}
}
public final void init(final boolean[][] b) { for(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].b = b[i][j]; }
public final void init(final long[][] val) { for(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].val = val[i][j]; }
public final Grid get(final int x, final int y) { return isValid(x, y, h, w) ? gs[x][y] : null; }
public final Grid get(final int i) { return get(i / w, i % w); }
public static final int dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};
public static final int dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};
public final Grid next(final int x, final int y, final int i) { return next(gs[x][y], i); }
public final Grid next(final Grid g, final int i) { return isValid(g.x + dx[i], g.y + dy[i], g.h, g.w) ? gs[g.x + dx[i]][g.y + dy[i]] : null; }
}
private static class Grid implements Comparable<Grid> {
public int x, y, h, w, i; public boolean b; public long val;
public Grid() { }
public Grid(final int x, final int y, final int h, final int w) { init(x, y, h, w, false, 0); }
public Grid(final int x, final int y, final int h, final int w, final boolean b) { init(x, y, h, w, b, 0); }
public Grid(final int x, final int y, final int h, final int w, final long val) { init(x, y, h, w, false, val); }
public Grid(final int x, final int y, final int h, final int w, final boolean b, final long val) { init(x, y, h, w, b, val); }
public final void init(final int x, final int y, final int h, final int w, final boolean b, final long val) { this.x = x; this.y = y; this.h = h; this.w = w; this.b = b; this.val = val; this.i = x * w + y; }
@Override public final String toString() { return "("+x+", "+y+")"+" "+booleanToChar(b)+" "+val; }
@Override public final int hashCode() { return Objects.hash(x, y, h, w, b, val); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Grid that = (Grid) obj;
if(this.x != that.x) return false;
if(this.y != that.y) return false;
if(this.h != that.h) return false;
if(this.w != that.w) return false;
if(this.b != that.b) return false;
if(this.val != that.val) return false;
return true;
}
@Override
public final int compareTo(final Grid that) {
int c = Long.compare(this.val, that.val);
if(c == 0) c = Integer.compare(this.x, that.x);
if(c == 0) c = Integer.compare(this.y, that.y);
return c;
}
}
private static final boolean isValid(final int x, final int y, final int h, final int w) { return x >= 0 && x < h && y >= 0 && y < w; }
private static final boolean isValid(final Grid g) { return isValid(g.x, g.y, g.h, g.w); }
// graph
private static class Graph {
public int numNode, numEdge;
public boolean directed;
public List<Edge> edges = new ArrayList<>();
public Node nodes[];
public Node reversedNodes[];
public Graph(final int numNode, final int numEdge, final boolean directed) {
nonNegativeCheck(numNode);
this.numNode = numNode;
this.numEdge = numEdge;
this.directed = directed;
nodes = new Node[numNode];
reversedNodes = new Node[numNode];
for(int i = 0; i < numNode; i ++) {
nodes[i] = new Node(i);
reversedNodes[i] = new Node(i);
}
}
public void init(final List<Edge> edges) {
this.edges = edges;
for(Edge e : edges) add(e);
}
public void add(final int source, final int target, final long cost) { add(new Edge(source, target, cost)); }
public void add(final Edge e) {
rangeCheck(e.source, numNode);
rangeCheck(e.target, numNode);
edges.add(e);
nodes[e.source].add(e.target, e.cost);
if(directed) reversedNodes[e.target].add(e.source, e.cost);
else nodes[e.target].add(e.source, e.cost);
numEdge = edges.size();
}
public void clearNodes() { edges.clear(); numEdge = 0; for(Node n : nodes) n.clear(); for(Node n : reversedNodes) n.clear(); }
}
private static class Node extends ArrayList<Edge> {
public final int id;
public Node(final int id) { this.id = id; }
public void add(final int target, final long cost) { add(new Edge(id, target, cost)); }
}
private static class Edge implements Comparable<Edge> {
public int source, target; public long cost;
public Edge(final int source, final int target, final long cost) { this.source = source; this.target = target; this.cost = cost; }
@Override public final String toString() { return source+" - "+cost+" -> "+target; }
@Override public final int hashCode() { return Objects.hash(source, target); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Edge that = (Edge) obj;
if(this.source != that.source) return false;
if(this.target != that.target) return false;
return true;
}
@Override
public final int compareTo(final Edge that) {
int c = Long.compare(this.cost, that.cost);
if(c == 0) c = Integer.compare(this.source, that.source);
if(c == 0) c = Integer.compare(this.target, that.target);
return c;
}
}
// Pair
private static class Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {
public T a; public U b;
public Pair() { }
public Pair(final T a, final U b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a.toString()+", "+b.toString()+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Pair that = (Pair) obj;
if(this.a.getClass() != that.a.getClass()) return false;
if(this.b.getClass() != that.b.getClass()) return false;
if(!this.a.equals(that.a)) return false;
if(!this.b.equals(that.b)) return false;
return true;
}
@Override public final int compareTo(final Pair<T, U> that) { int c = (this.a).compareTo(that.a); if(c == 0) c = (this.b).compareTo(that.b); return c; }
}
private static final PairII npii() { return new PairII(ni(), ni()); }
private static final PairII[] npii(final int n) { final PairII a[] = new PairII[n]; for(int i = 0; i < n; i ++) a[i] = npii(); return a; }
private static final PairII[][] npii(final int n, final int m) { final PairII a[][] = new PairII[n][m]; for(int i = 0; i < n; i ++) a[i] = npii(m); return a; }
private static class PairII implements Comparable<PairII> {
public int a; public int b;
public PairII() { }
public PairII(final int a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairII that = (PairII) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairII that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairIL npil() { return new PairIL(ni(), nl()); }
private static final PairIL[] npil(final int n) { final PairIL a[] = new PairIL[n]; for(int i = 0; i < n; i ++) a[i] = npil(); return a; }
private static final PairIL[][] npil(final int n, final int m) { final PairIL a[][] = new PairIL[n][m]; for(int i = 0; i < n; i ++) a[i] = npil(m); return a; }
private static class PairIL implements Comparable<PairIL> {
public int a; public long b;
public PairIL() { }
public PairIL(final int a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairIL that = (PairIL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairIL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairID npid() { return new PairID(ni(), nd()); }
private static final PairID[] npid(final int n) { final PairID a[] = new PairID[n]; for(int i = 0; i < n; i ++) a[i] = npid(); return a; }
private static final PairID[][] npid(final int n, final int m) { final PairID a[][] = new PairID[n][m]; for(int i = 0; i < n; i ++) a[i] = npid(m); return a; }
private static class PairID implements Comparable<PairID> {
public int a; public double b;
public PairID() { }
public PairID(final int a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairID that = (PairID) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairID that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
private static final PairLI npli() { return new PairLI(nl(), ni()); }
private static final PairLI[] npli(final int n) { final PairLI a[] = new PairLI[n]; for(int i = 0; i < n; i ++) a[i] = npli(); return a; }
private static final PairLI[][] npli(final int n, final int m) { final PairLI a[][] = new PairLI[n][m]; for(int i = 0; i < n; i ++) a[i] = npli(m); return a; }
private static class PairLI implements Comparable<PairLI> {
public long a; public int b;
public PairLI() { }
public PairLI(final long a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLI that = (PairLI) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairLL npll() { return new PairLL(nl(), nl()); }
private static final PairLL[] npll(final int n) { final PairLL a[] = new PairLL[n]; for(int i = 0; i < n; i ++) a[i] = npll(); return a; }
private static final PairLL[][] npll(final int n, final int m) { final PairLL a[][] = new PairLL[n][m]; for(int i = 0; i < n; i ++) a[i] = npll(m); return a; }
private static class PairLL implements Comparable<PairLL> {
public long a; public long b;
public PairLL() { }
public PairLL(final long a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLL that = (PairLL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairLD npld() { return new PairLD(nl(), nd()); }
private static final PairLD[] npld(final int n) { final PairLD a[] = new PairLD[n]; for(int i = 0; i < n; i ++) a[i] = npld(); return a; }
private static final PairLD[][] npld(final int n, final int m) { final PairLD a[][] = new PairLD[n][m]; for(int i = 0; i < n; i ++) a[i] = npld(m); return a; }
private static class PairLD implements Comparable<PairLD> {
public long a; public double b;
public PairLD() { }
public PairLD(final long a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLD that = (PairLD) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
private static final PairDI npdi() { return new PairDI(nd(), ni()); }
private static final PairDI[] npdi(final int n) { final PairDI a[] = new PairDI[n]; for(int i = 0; i < n; i ++) a[i] = npdi(); return a; }
private static final PairDI[][] npdi(final int n, final int m) { final PairDI a[][] = new PairDI[n][m]; for(int i = 0; i < n; i ++) a[i] = npdi(m); return a; }
private static class PairDI implements Comparable<PairDI> {
public double a; public int b;
public PairDI() { }
public PairDI(final double a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDI that = (PairDI) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairDL npdl() { return new PairDL(nd(), nl()); }
private static final PairDL[] npdl(final int n) { final PairDL a[] = new PairDL[n]; for(int i = 0; i < n; i ++) a[i] = npdl(); return a; }
private static final PairDL[][] npdl(final int n, final int m) { final PairDL a[][] = new PairDL[n][m]; for(int i = 0; i < n; i ++) a[i] = npdl(m); return a; }
private static class PairDL implements Comparable<PairDL> {
public double a; public long b;
public PairDL() { }
public PairDL(final double a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDL that = (PairDL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairDD npdd() { return new PairDD(nd(), nd()); }
private static final PairDD[] npdd(final int n) { final PairDD a[] = new PairDD[n]; for(int i = 0; i < n; i ++) a[i] = npdd(); return a; }
private static final PairDD[][] npdd(final int n, final int m) { final PairDD a[][] = new PairDD[n][m]; for(int i = 0; i < n; i ++) a[i] = npdd(m); return a; }
private static class PairDD implements Comparable<PairDD> {
public double a; public double b;
public PairDD() { }
public PairDD(final double a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDD that = (PairDD) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
// Tuple
private interface ITuple {
public StringBuilder toStringBuilder();
@Override public String toString();
@Override public int hashCode();
@Override public boolean equals(Object obj);
}
private static class BasicTuple<T extends ITuple & Comparable<? super T>, V extends Comparable<? super V>> implements Comparable<BasicTuple> {
public T t; public V a;
public BasicTuple() { }
private final StringBuilder sbTuple = new StringBuilder();
public final StringBuilder toStringBuilder() {
sbTuple.setLength(0);
return sbTuple.append(t.toStringBuilder()).append(", ").append(a);
}
@Override public final String toString() { return "("+toStringBuilder().toString()+")"; }
@Override public final int hashCode() { return Objects.hash(t, a); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
BasicTuple that = (BasicTuple) obj;
if(this.t.getClass() != that.t.getClass()) return false;
if(this.a.getClass() != that.a.getClass()) return false;
if(!this.t.equals(that.t)) return false;
if(!this.a.equals(that.a)) return false;
return true;
}
@Override @SuppressWarnings("unchecked") public final int compareTo(BasicTuple that) { int c = (this.t).compareTo((T) (Object) that.t); if(c == 0) c = (this.a).compareTo((V) (Object) that.a); return c; }
}
private static class UniqueTuple<V extends Comparable<? super V>> implements ITuple, Comparable<UniqueTuple> {
public V a;
public UniqueTuple() { }
private final StringBuilder sbTuple = new StringBuilder();
public final StringBuilder toStringBuilder() { sbTuple.setLength(0); return sbTuple.append(a); }
@Override public final String toString() { return "("+a.toString()+")"; }
@Override public final int hashCode() { return Objects.hash(a); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
UniqueTuple that = (UniqueTuple) obj;
if(this.a.getClass() != that.a.getClass()) return false;
if(!this.a.equals(that.a)) return false;
return true;
}
@Override @SuppressWarnings("unchecked") public final int compareTo(UniqueTuple that) { return (this.a).compareTo((V) (Object) that.a); }
}
private static class Tuple1<T0 extends Comparable<? super T0>> extends UniqueTuple<T0> implements ITuple {
public Tuple1() { super(); }
public Tuple1(final T0 a0) { super(); this.a = a0; }
final T0 get0() { return a; }
final void set0(final T0 x) { a = x; }
}
private static class Tuple2<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>>
extends BasicTuple<Tuple1<T0>, T1> implements ITuple {
public Tuple2() { super(); }
public Tuple2(final T0 a0, final T1 a1) { super(); this.t = new Tuple1<>(a0); this.a = a1; }
final T0 get0() { return t.get0(); }
final T1 get1() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { a = x; }
}
private static class Tuple3<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>>
extends BasicTuple<Tuple2<T0, T1>, T2> implements ITuple {
public Tuple3() { super(); }
public Tuple3(final T0 a0, final T1 a1, final T2 a2) { super(); this.t = new Tuple2<>(a0, a1); this.a = a2; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { a = x; }
}
private static class Tuple4<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>>
extends BasicTuple<Tuple3<T0, T1, T2>, T3> implements ITuple {
public Tuple4() { super(); }
public Tuple4(final T0 a0, final T1 a1, final T2 a2, final T3 a3) { super(); this.t = new Tuple3<>(a0, a1, a2); this.a = a3; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { a = x; }
}
private static class Tuple5<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>>
extends BasicTuple<Tuple4<T0, T1, T2, T3>, T4> implements ITuple {
public Tuple5() { super(); }
public Tuple5(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4) { super(); this.t = new Tuple4<>(a0, a1, a2, a3); this.a = a4; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { a = x; }
}
private static class Tuple6<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>>
extends BasicTuple<Tuple5<T0, T1, T2, T3, T4>, T5> implements ITuple {
public Tuple6() { super(); }
public Tuple6(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5) { super(); this.t = new Tuple5<>(a0, a1, a2, a3, a4); this.a = a5; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { a = x; }
}
private static class Tuple7<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>,
T6 extends Comparable<? super T6>>
extends BasicTuple<Tuple6<T0, T1, T2, T3, T4, T5>, T6> implements ITuple {
public Tuple7() { super(); }
public Tuple7(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5, final T6 a6) { super(); this.t = new Tuple6<>(a0, a1, a2, a3, a4, a5); this.a = a6; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return t.get5(); }
final T6 get6() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { t.set5(x); }
final void set6(final T6 x) { a = x; }
}
private static class Tuple8<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>,
T6 extends Comparable<? super T6>,
T7 extends Comparable<? super T7>>
extends BasicTuple<Tuple7<T0, T1, T2, T3, T4, T5, T6>, T7> implements ITuple {
public Tuple8() { super(); }
public Tuple8(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5, final T6 a6, final T7 a7) { super(); this.t = new Tuple7<>(a0, a1, a2, a3, a4, a5, a6); this.a = a7; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return t.get5(); }
final T6 get6() { return t.get6(); }
final T7 get7() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { t.set5(x); }
final void set6(final T6 x) { t.set6(x); }
final void set7(final T7 x) { a = x; }
}
// Tuple3
private static class TupleIII implements Comparable<TupleIII> {
public int a; public int b; public int c;
public TupleIII() { }
public TupleIII(final int a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIII that = (TupleIII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIII that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleIIL implements Comparable<TupleIIL> {
public int a; public int b; public long c;
public TupleIIL() { }
public TupleIIL(final int a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIIL that = (TupleIIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIIL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c;
}
}
private static class TupleIID implements Comparable<TupleIID> {
public int a; public int b; public double c;
public TupleIID() { }
public TupleIID(final int a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIID that = (TupleIID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIID that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleILI implements Comparable<TupleILI> {
public int a; public long b; public int c;
public TupleILI() { }
public TupleILI(final int a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILI that = (TupleILI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILI that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleILL implements Comparable<TupleILL> {
public int a; public long b; public long c;
public TupleILL() { }
public TupleILL(final int a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILL that = (TupleILL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleILD implements Comparable<TupleILD> {
public int a; public long b; public double c;
public TupleILD() { }
public TupleILD(final int a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILD that = (TupleILD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILD that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleIDI implements Comparable<TupleIDI> {
public int a; public double b; public int c;
public TupleIDI() { }
public TupleIDI(final int a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDI that = (TupleIDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDI that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleIDL implements Comparable<TupleIDL> {
public int a; public double b; public long c;
public TupleIDL() { }
public TupleIDL(final int a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDL that = (TupleIDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleIDD implements Comparable<TupleIDD> {
public int a; public double b; public double c;
public TupleIDD() { }
public TupleIDD(final int a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDD that = (TupleIDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDD that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLII implements Comparable<TupleLII> {
public long a; public int b; public int c;
public TupleLII() { }
public TupleLII(final long a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLII that = (TupleLII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLII that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLIL implements Comparable<TupleLIL> {
public long a; public int b; public long c;
public TupleLIL() { }
public TupleLIL(final long a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLIL that = (TupleLIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLIL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLID implements Comparable<TupleLID> {
public long a; public int b; public double c;
public TupleLID() { }
public TupleLID(final long a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLID that = (TupleLID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLID that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLLI implements Comparable<TupleLLI> {
public long a; public long b; public int c;
public TupleLLI() { }
public TupleLLI(final long a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLI that = (TupleLLI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLLL implements Comparable<TupleLLL> {
public long a; public long b; public long c;
public TupleLLL() { }
public TupleLLL(final long a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLL that = (TupleLLL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLLD implements Comparable<TupleLLD> {
public long a; public long b; public double c;
public TupleLLD() { }
public TupleLLD(final long a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLD that = (TupleLLD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLDI implements Comparable<TupleLDI> {
public long a; public double b; public int c;
public TupleLDI() { }
public TupleLDI(final long a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDI that = (TupleLDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLDL implements Comparable<TupleLDL> {
public long a; public double b; public long c;
public TupleLDL() { }
public TupleLDL(final long a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDL that = (TupleLDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLDD implements Comparable<TupleLDD> {
public long a; public double b; public double c;
public TupleLDD() { }
public TupleLDD(final long a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDD that = (TupleLDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDII implements Comparable<TupleDII> {
public double a; public int b; public int c;
public TupleDII() { }
public TupleDII(final double a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDII that = (TupleDII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDII that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDIL implements Comparable<TupleDIL> {
public double a; public int b; public long c;
public TupleDIL() { }
public TupleDIL(final double a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDIL that = (TupleDIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDIL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDID implements Comparable<TupleDID> {
public double a; public int b; public double c;
public TupleDID() { }
public TupleDID(final double a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDID that = (TupleDID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDID that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDLI implements Comparable<TupleDLI> {
public double a; public long b; public int c;
public TupleDLI() { }
public TupleDLI(final double a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLI that = (TupleDLI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDLL implements Comparable<TupleDLL> {
public double a; public long b; public long c;
public TupleDLL() { }
public TupleDLL(final double a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLL that = (TupleDLL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDLD implements Comparable<TupleDLD> {
public double a; public long b; public double c;
public TupleDLD() { }
public TupleDLD(final double a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLD that = (TupleDLD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDDI implements Comparable<TupleDDI> {
public double a; public double b; public int c;
public TupleDDI() { }
public TupleDDI(final double a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDI that = (TupleDDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDDL implements Comparable<TupleDDL> {
public double a; public double b; public long c;
public TupleDDL() { }
public TupleDDL(final double a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDL that = (TupleDDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDDD implements Comparable<TupleDDD> {
public double a; public double b; public double c;
public TupleDDD() { }
public TupleDDD(final double a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDD that = (TupleDDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
public void solve() {
int t = ni();
for(int query = 0; query < t; query ++) {
int n = ni();
boolean b[] = nb(n, '1');
int sum = sum(b);
if(sum % 2 != 0) {
prtln(-1); continue;
}
if(sum == 2) {
int i = 0;
for(; i < n; i ++) if(b[i]) break;
int j = n - 1;
for(; j >= 0; j --) if(b[j]) break;
if(i + 1 == j) {
if(n >= 5) {
prtln(2);
}else if(n == 4) {
prtln(b[1] ? 3 : 2);
}else {
prtln(-1);
}
}else {
prtln(1);
}
}else {
prtln(sum / 2);
}
}
}
}
}
import java.util.*;
import java.io.*;
import java.math.*;
import java.util.function.*;
public class Main implements Runnable {
private static boolean DEBUG;
public static void main(final String[] args) {
DEBUG = args.length > 0 && args[0].equals("-DEBUG");
Thread.setDefaultUncaughtExceptionHandler((t, e) -> { e.printStackTrace(); System.exit(1); });
new Thread(null, new Main(), "", 1 << 31).start();
}
@Override
public void run() { Solver solver = new Solver(); solver.solve(); solver.exit(); }
public static final class FastInputStream {
private static final int BUF_SIZE = 1 << 14;
private final InputStream in;
private final byte buf[] = new byte[BUF_SIZE];
private int pos = 0;
private int count = 0;
private static final int TOKEN_SIZE = 1 << 20;
private final byte tokenBuf[] = new byte[TOKEN_SIZE];
public FastInputStream(final InputStream in) {
this.in = in;
}
private final void readBuf() {
pos = 0;
try { count = in.read(buf); }
catch(IOException e) { e.printStackTrace(); }
}
private final boolean hasNextByte() {
if(pos < count) return true;
readBuf();
return count > 0;
}
private final byte read() { if(hasNextByte()) return buf[pos ++]; else throw new NoSuchElementException(); }
private final boolean isPrintableChar(final byte c) { return 33 <= c && c <= 126; }
private final boolean isNumber(final byte c) { return 48 <= c && c <= 57; }
private final void skipUnprintable() {
while(true) {
for(int i = pos; i < count; i ++) {
if(isPrintableChar(buf[i])) { pos = i; return; }
}
readBuf();
if(count <= 0) throw new NoSuchElementException();
}
}
private final boolean readEOL() {
if(!hasNextByte()) return true;
if(buf[pos] == 13) {
pos ++;
if(hasNextByte() && buf[pos] == 10) pos ++;
return true;
}
if(buf[pos] == 10) {
pos ++;
return true;
}
return false;
}
public final char nextChar() {
skipUnprintable();
return (char)buf[pos ++];
}
public final String next() {
skipUnprintable();
int tokenCount = 0;
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
tokenBuf[tokenCount ++] = b;
}
readBuf();
}
return new String(tokenBuf, 0, tokenCount);
}
public final String nextLine() {
readEOL();
if(!hasNextByte()) throw new NoSuchElementException();
int tokenCount = 0;
while(!readEOL()) tokenBuf[tokenCount ++] = read();
return new String(tokenBuf, 0, tokenCount);
}
public final int nextInt() {
skipUnprintable();
int n = 0;
boolean minus = false;
if(buf[pos] == 45) {
minus = true;
pos ++;
if(!hasNextByte() || !isNumber(buf[pos])) throw new InputMismatchException();
}
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
if(!isNumber(b)) throw new InputMismatchException();
if(minus) {
if(n < - 214748364) throw new ArithmeticException("int overflow");
if(n == - 214748364 && b > 56) throw new ArithmeticException("int overflow");
n = (n << 3) + (n << 1) + 48 - b;
}else {
if(n > 214748364) throw new ArithmeticException("int overflow");
if(n == 214748364 && b >= 56) throw new ArithmeticException("int overflow");
n = (n << 3) + (n << 1) - 48 + b;
}
}
readBuf();
}
return n;
}
public final long nextLong() {
skipUnprintable();
long n = 0;
boolean minus = false;
if(buf[pos] == 45) {
minus = true;
pos ++;
if(!hasNextByte() || !isNumber(buf[pos])) throw new InputMismatchException();
}
outer: while(count > 0) {
for(int i = pos; i < count; i ++) {
final byte b = buf[i];
if(!isPrintableChar(b)) { pos = i; break outer; }
if(!isNumber(b)) throw new InputMismatchException();
if(minus) {
if(n < - 922337203685477580l) throw new ArithmeticException("long overflow");
if(n == - 922337203685477580l && b > 56) throw new ArithmeticException("long overflow");
n = (n << 3) + (n << 1) + 48 - b;
}else {
if(n > 922337203685477580l) throw new ArithmeticException("long overflow");
if(n == 922337203685477580l && b >= 56) throw new ArithmeticException("long overflow");
n = (n << 3) + (n << 1) - 48 + b;
}
}
readBuf();
}
return n;
}
public final double nextDouble() { return Double.parseDouble(next()); }
public final void close() {
try { in.close(); }
catch(IOException e) { e.printStackTrace(); }
}
}
public static final class FastOutputStream {
private static final int BUF_SIZE = 1 << 13;
private final byte buf[] = new byte[BUF_SIZE];
private final OutputStream out;
private int count = 0;
private static final byte TRUE_BYTES[] = {116, 114, 117, 101};
private static final byte FALSE_BYTES[] = {102, 97, 108, 115, 101};
private static final byte INT_MIN_BYTES[] = {45, 50, 49, 52, 55, 52, 56, 51, 54, 52, 56};
private static final byte LONG_MIN_BYTES[] = {45, 57, 50, 50, 51, 51, 55, 50, 48, 51,
54, 56, 53, 52, 55, 55, 53, 56, 48, 56};
private static final int TOKEN_SIZE = 20;
private final byte tokenBuf[] = new byte[TOKEN_SIZE];
private static final int PRECISION = 10;
public FastOutputStream(OutputStream out) {
this.out = out;
}
public final void print() { }
public final void write(final byte b) {
if(count == BUF_SIZE) internalFlush();
buf[count ++] = b;
}
public final void print(final char c) { write((byte) c); }
public final void print(final boolean b) {
if(b) {
if(count + 4 > BUF_SIZE) internalFlush();
System.arraycopy(TRUE_BYTES, 0, buf, count, TRUE_BYTES.length);
count += TRUE_BYTES.length;
}else {
if(count + 5 > BUF_SIZE) internalFlush();
System.arraycopy(FALSE_BYTES, 0, buf, count, FALSE_BYTES.length);
count += FALSE_BYTES.length;
}
}
public final void print(int x) {
if(count + 11 > BUF_SIZE) internalFlush();
if(x == Integer.MIN_VALUE) {
System.arraycopy(INT_MIN_BYTES, 0, buf, count, INT_MIN_BYTES.length);
count += INT_MIN_BYTES.length;
return;
}
if(x == 0) {
buf[count ++] = 48;
return;
}
if(x < 0) {
buf[count ++] = 45;
x = - x;
}
int tokenCount = 11;
while(x > 0) {
final int y = x / 10;
tokenBuf[-- tokenCount] = (byte) (x - (y << 3) - (y << 1) + 48);
x = y;
}
System.arraycopy(tokenBuf, tokenCount, buf, count, 11 - tokenCount);
count += 11 - tokenCount;
}
public final void print(long x) {
if(count + 20 > BUF_SIZE) internalFlush();
if(x == Long.MIN_VALUE) {
System.arraycopy(LONG_MIN_BYTES, 0, buf, count, LONG_MIN_BYTES.length);
count += LONG_MIN_BYTES.length;
return;
}
if(x == 0) {
buf[count ++] = 48;
return;
}
if(x < 0) {
buf[count ++] = 45;
x = - x;
}
int tokenCount = 20;
while(x > 0) {
final long y = x / 10;
tokenBuf[-- tokenCount] = (byte) (x - (y << 3) - (y << 1) + 48);
x = y;
}
System.arraycopy(tokenBuf, tokenCount, buf, count, 20 - tokenCount);
count += 20 - tokenCount;
}
public final void print(final double d) { print(d, PRECISION); }
public final void print(double d, final int precision) {
if(count == BUF_SIZE) internalFlush();
if(d < 0) {
buf[count ++] = 45;
d = - d;
}
d += Math.pow(10, - precision) / 2;
print((long)d);
if(precision == 0) return;
if(count + precision + 1 > BUF_SIZE) internalFlush();
buf[count ++] = 46;
d -= (long)d;
for(int i = 0; i < precision; i ++) {
d *= 10;
buf[count ++] = (byte)((int)d + 48);
d -= (int) d;
}
}
public final void print(final String s) { print(s.getBytes()); }
public final void print(final Object o) { print(o.toString()); }
public final void print(final byte[] a) {
if(count + a.length > BUF_SIZE) internalFlush();
System.arraycopy(a, 0, buf, count, a.length);
count += a.length;
}
public final void print(final char[] a) {
if(count + a.length > BUF_SIZE) internalFlush();
for(int i = 0; i < a.length; i ++) buf[count + i] = (byte)a[i];
count += a.length;
}
public final void println() { print('\n'); }
public final void println(final char c) { print(c); println(); }
public final void println(final boolean b) { print(b); println(); }
public final void println(final int x) { print(x); println(); }
public final void println(final long x) { print(x); println(); }
public final void println(final double d) { print(d); println(); }
public final void println(final double d, final int precision) { print(d, precision); println(); }
public final void println(final String s) { print(s); println(); }
public final void println(final Object o) { print(o); println(); }
public final void println(final char[] a) { print(a); println(); }
public final void println(final int[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final long[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final double[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final double[] a, final int precision) {
for(int i = 0; i < a.length; i ++) {
print(a[i], precision);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final String[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
public final void println(final Object[] a) {
for(int i = 0; i < a.length; i ++) {
print(a[i]);
print(i == a.length - 1 ? '\n' : ' ');
}
}
private final void internalFlush() {
try {
out.write(buf, 0, count);
count = 0;
}
catch(IOException e) { e.printStackTrace(); }
}
public final void flush() {
try {
out.write(buf, 0, count);
out.flush();
count = 0;
}
catch(IOException e) { e.printStackTrace(); }
}
public final void close() {
try { out.close(); }
catch(IOException e) { e.printStackTrace(); }
}
}
public static final class Solver {
private static final FastInputStream in = new FastInputStream(System.in);
public Solver() { }
private static final String nline() { return in.nextLine(); }
private static final String[] nline(final int n) { final String a[] = new String[n]; for(int i = 0; i < n; i ++) a[i] = nline(); return a; }
private static final char nc() { return in.nextChar(); }
private static final char[] nc(int n) {
final String str = ns();
if(n < 0) n = str.length();
final char a[] = new char[n];
for(int i = 0; i < n; i ++) a[i] = str.charAt(i);
return a;
}
private static final char[][] nc(final int n, final int m) { final char a[][] = new char[n][m]; for(int i = 0; i < n; i ++) a[i] = nc(m); return a; }
private static final boolean[] nb(int n, final char t) {
final char c[] = nc(-1);
if(n < 0) n = c.length;
final boolean a[] = new boolean[n];
for(int i = 0; i < n; i ++) a[i] = c[i] == t;
return a;
}
private static final boolean[][] nb(final int n, final int m, final char t) { final boolean a[][] = new boolean[n][]; for(int i = 0; i < n; i ++) a[i] = nb(m, t); return a; }
private static final int ni() { return in.nextInt(); }
private static final int[] ni(final int n) { final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = ni(); return a; }
private static final int[][] ni(final int n, final int m) { final int a[][] = new int[n][]; for(int i = 0; i < n; i ++) a[i] = ni(m); return a; }
private static final long nl() { return in.nextLong(); }
private static final long[] nl(final int n) { final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = nl(); return a; }
private static final long[][] nl(final int n, final int m) { final long a[][] = new long[n][]; for(int i = 0; i < n; i ++) a[i] = nl(m); return a; }
private static final double nd() { return in.nextDouble(); }
private static final double[] nd(final int n) { final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = nd(); return a; }
private static final double[][] nd(final int n, final int m) { final double a[][] = new double[n][]; for(int i = 0; i < n; i ++) a[i] = nd(m); return a; }
private static final String ns() { return in.next(); }
private static final String[] ns(final int n) { final String a[] = new String[n]; for(int i = 0; i < n; i ++) a[i] = ns(); return a; }
private static final String[][] ns(final int n, final int m) { final String a[][] = new String[n][]; for(int i = 0; i < n; i ++) a[i] = ns(m); return a; }
private static final char booleanToChar(final boolean b) { return b ? '#' : '.'; }
private static final char[] booleanToChar(final boolean... a) {
final char c[] = new char[a.length];
for(int i = 0; i < a.length; i ++) c[i] = booleanToChar(a[i]);
return c;
}
private static final FastOutputStream out = new FastOutputStream(System.out);
private static final FastOutputStream err = new FastOutputStream(System.err);
private static final void prt() { out.print(); }
private static final void prt(final char c) { out.print(c); }
private static final void prt(final boolean b) { out.print(b); }
private static final void prt(final int x) { out.print(x); }
private static final void prt(final long x) { out.print(x); }
private static final void prt(final double d) { out.print(d); }
private static final void prt(final String s) { out.print(s); }
private static final void prt(final Object o) { out.print(o); }
private static final void prtln() { out.println(); }
private static final void prtln(final char c) { out.println(c); }
private static final void prtln(final boolean b) { out.println(b); }
private static final void prtln(final int x) { out.println(x); }
private static final void prtln(final long x) { out.println(x); }
private static final void prtln(final double d) { out.println(d); }
private static final void prtln(final String s) { out.println(s); }
private static final void prtln(final Object o) { out.println(o); }
private static final void prtln(final char... a) { out.println(a); }
private static final void prtln(final boolean... a) { out.println(booleanToChar(a)); }
private static final void prtln(final int... a) { out.println(a); }
private static final void prtln(final long... a) { out.println(a); }
private static final void prtln(final double... a) { out.println(a); }
private static final void prtln(final double[] a, int precision) { out.println(a, precision); }
private static final void prtln(final String... a) { out.println(a); }
private static final void prtln(final Object[] a) { out.println(a); }
private static final void prtlns(final char... a) { for(char ele : a) prtln(ele); }
private static final void prtlns(final boolean... a) { for(boolean ele : a) prtln(ele); }
private static final void prtlns(final int... a) { for(int ele : a) prtln(ele); }
private static final void prtlns(final long... a) { for(long ele : a) prtln(ele); }
private static final void prtlns(final double... a) { for(double ele : a) prtln(ele); }
private static final void prtlns(final Object[] a) { for(Object ele : a) prtln(ele); }
private static final void prtln(final char[][] a) { for(char[] ele : a) prtln(ele); }
private static final void prtln(final boolean[][] a) { for(boolean[] ele : a) prtln(ele); }
private static final void prtln(final int[][] a) { for(int[] ele : a) prtln(ele); }
private static final void prtln(final long[][] a) { for(long[] ele : a) prtln(ele); }
private static final void prtln(final double[][] a) { for(double[] ele : a) prtln(ele); }
private static final void prtln(final double[][] a, int precision) { for(double[] ele : a) prtln(ele, precision); }
private static final void prtln(final String[][] a) { for(String[] ele : a) prtln(ele); }
private static final void prtln(final Object[][] a) { for(Object[] ele : a) prtln(ele); }
private static final void errprt() { if(DEBUG) err.print(); }
private static final void errprt(final char c) { if(DEBUG) err.print(c); }
private static final void errprt(final boolean b) { if(DEBUG) err.print(booleanToChar(b)); }
private static final void errprt(final int x) { if(DEBUG) if(isINF(x)) err.print('_'); else err.print(x); }
private static final void errprt(final long x) { if(DEBUG) if(isINF(x)) err.print('_'); else err.print(x); }
private static final void errprt(final double d) { if(DEBUG) err.print(d); }
private static final void errprt(final String s) { if(DEBUG) err.print(s); }
private static final void errprt(final Object o) { if(DEBUG) err.print(o); }
private static final void errprtln() { if(DEBUG) err.println(); }
private static final void errprtln(final char c) { if(DEBUG) err.println(c); }
private static final void errprtln(final boolean b) { if(DEBUG) err.println(booleanToChar(b)); }
private static final void errprtln(final int x) { if(DEBUG) if(isINF(x)) err.println('_'); else err.println(x); }
private static final void errprtln(final long x) { if(DEBUG) if(isINF(x)) err.println('_'); else err.println(x); }
private static final void errprtln(final double d) { if(DEBUG) err.println(d); }
private static final void errprtln(final String s) { if(DEBUG) err.println(s); }
private static final void errprtln(final Object o) { if(DEBUG) err.println(o); }
private static final void errprtln(final char... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final boolean... a) { if(DEBUG) err.println(booleanToChar(a)); }
private static final void errprtln(final int... a) {
if(DEBUG) {
boolean start = false;
for(int ele : a) {
errprt(ele);
if(!start) errprt(' ');
start = false;
}
err.println();
}
}
private static final void errprtln(final long... a) {
if(DEBUG) {
boolean start = false;
for(long ele : a) {
errprt(ele);
if(!start) errprt(' ');
start = false;
}
err.println();
}
}
private static final void errprtln(final double... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final double[] a, final int precision) { if(DEBUG) err.println(a, precision); }
private static final void errprtln(final String... a) { if(DEBUG) err.println(a); }
private static final void errprtln(final Object[] a) { if(DEBUG) err.println(a); }
private static final void errprtlns(final char... a) { if(DEBUG) for(char ele : a) errprtln(ele); }
private static final void errprtlns(final boolean... a) { if(DEBUG) for(boolean ele : a) errprtln(ele); }
private static final void errprtlns(final int... a) { if(DEBUG) for(int ele : a) errprtln(ele); }
private static final void errprtlns(final long... a) { if(DEBUG) for(long ele : a) errprtln(ele); }
private static final void errprtlns(final double... a) { if(DEBUG) for(double ele : a) errprtln(ele); }
private static final void errprtlns(final Object[] a) { if(DEBUG) for(Object ele : a) errprtln(ele); }
private static final void errprtln(final char[][] a) { if(DEBUG) for(char[] ele : a) errprtln(ele); }
private static final void errprtln(final boolean[][] a) { if(DEBUG) for(boolean[] ele : a) errprtln(ele); }
private static final void errprtln(final int[][] a) { if(DEBUG) for(int[] ele : a) errprtln(ele); }
private static final void errprtln(final long[][] a) { if(DEBUG) for(long[] ele : a) errprtln(ele); }
private static final void errprtln(final double[][] a) { if(DEBUG) for(double[] ele : a) errprtln(ele); }
private static final void errprtln(final double[][] a, int precision) { if(DEBUG) for(double[] ele : a) errprtln(ele, precision); }
private static final void errprtln(final String[][] a) { if(DEBUG) for(String[] ele : a) errprtln(ele); }
private static final void errprtln(final Object[][] a) { if(DEBUG) for(Object[] ele : a) errprtln(ele); }
private static final void errprtlns(final Object[][] a) { if(DEBUG) for(Object[] ele : a) { errprtlns(ele); errprtln(); } }
private static final void reply(final boolean b) { prtln(b ? "Yes" : "No"); }
private static final void REPLY(final boolean b) { prtln(b ? "YES" : "NO"); }
private static final void flush() { out.flush(); if(DEBUG) err.flush(); }
private static final void assertion(final boolean b) { if(!b) { flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char c) { if(!b) { errprtln(c); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean b2) { if(!b) { errprtln(b2); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int x) { if(!b) { errprtln(x); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long x) { if(!b) { errprtln(x); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double d) { if(!b) { errprtln(d); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String s) { if(!b) { errprtln(s); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object o) { if(!b) { errprtln(o); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String... a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object[] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final char[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final boolean[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final int[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final long[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final double[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final String[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void assertion(final boolean b, final Object[][] a) { if(!b) { errprtln(a); flush(); throw new AssertionError(); } }
private static final void inclusiveRangeCheck(final int i, final int max) { inclusiveRangeCheck(i, 0, max); }
private static final void inclusiveRangeCheck(final int i, final int min, final int max) { rangeCheck(i, min, max + 1); }
private static final void inclusiveRangeCheck(final long i, final long max) { inclusiveRangeCheck(i, 0, max); }
private static final void inclusiveRangeCheck(final long i, final long min, final long max) { rangeCheck(i, min, max + 1); }
private static final void rangeCheck(final int i, final int max) { rangeCheck(i, 0, max); }
private static final void rangeCheck(final int i, final int min, final int max) { if(i < min || i >= max) throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, max)); }
private static final void rangeCheck(final long i, final long max) { rangeCheck(i, 0, max); }
private static final void rangeCheck(final long i, final long min, final long max) { if(i < min || i >= max) throw new IndexOutOfBoundsException(String.format("Index %d out of bounds for length %d", i, max)); }
private static final void nonNegativeCheck(final long x) { nonNegativeCheck(x, "the argument"); }
private static final void nonNegativeCheck(final long x, final String attribute) { if(x < 0) throw new IllegalArgumentException(String.format("%s %d is negative", attribute, x)); }
private static final void positiveCheck(final long x) { positiveCheck(x, "the argument"); }
private static final void positiveCheck(final long x, final String attribute) { if(x <= 0) throw new IllegalArgumentException(String.format("%s %d is negative", attribute, x)); }
private static final void exit() { flush(); System.exit(0); }
private static final void exit(final char c) { prtln(c); exit(); }
private static final void exit(final boolean b) { prtln(b); exit(); }
private static final void exit(final int x) { prtln(x); exit(); }
private static final void exit(final long x) { prtln(x); exit(); }
private static final void exit(final double d) { prtln(d); exit(); }
private static final void exit(final String s) { prtln(s); exit(); }
private static final void exit(final Object o) { prtln(o); exit(); }
private static final void exit(final char... a) { prtln(a); exit(); }
private static final void exit(final boolean... a) { prtln(a); exit(); }
private static final void exit(final int... a) { prtln(a); exit(); }
private static final void exit(final long... a) { prtln(a); exit(); }
private static final void exit(final double... a) { prtln(a); exit(); }
private static final void exit(final String... a) { prtln(a); exit(); }
private static final void exit(final Object[] a) { prtln(a); exit(); }
private static final void exit(final char[][] a) { prtln(a); exit(); }
private static final void exit(final boolean[][] a) { prtln(a); exit(); }
private static final void exit(final int[][] a) { prtln(a); exit(); }
private static final void exit(final long[][] a) { prtln(a); exit(); }
private static final void exit(final double[][] a) { prtln(a); exit(); }
private static final void exit(final String[][] a) { prtln(a); exit(); }
private static final void exit(final Object[][] a) { prtln(a); exit(); }
private static final long INF = (long)4e18;
private static final boolean isPlusINF(final long x) { return x > INF / 10; }
private static final boolean isMinusINF(final long x) { return isPlusINF(- x); }
private static final boolean isINF(final long x) { return isPlusINF(x) || isMinusINF(x); }
private static final int I_INF = (int)1e9 + 1000;
private static final boolean isPlusINF(final int x) { return x > I_INF / 10; }
private static final boolean isMinusINF(final int x) { return isPlusINF(- x); }
private static final boolean isINF(final int x) { return isPlusINF(x) || isMinusINF(x); }
private static final int min(final int a, final int b) { return Math.min(a, b); }
private static final long min(final long a, final long b) { return Math.min(a, b); }
private static final double min(final double a, final double b) { return Math.min(a, b); }
private static final <T extends Comparable<T>> T min(final T a, final T b) { return a.compareTo(b) <= 0 ? a : b; }
private static final int min(final int... x) { int min = x[0]; for(int val : x) min = min(min, val); return min; }
private static final long min(final long... x) { long min = x[0]; for(long val : x) min = min(min, val); return min; }
private static final double min(final double... x) { double min = x[0]; for(double val : x) min = min(min, val); return min; }
private static final int max(final int a, final int b) { return Math.max(a, b); }
private static final long max(final long a, final long b) { return Math.max(a, b); }
private static final double max(final double a, final double b) { return Math.max(a, b); }
private static final <T extends Comparable<T>> T max(final T a, final T b) { return a.compareTo(b) >= 0 ? a : b; }
private static final int max(final int... x) { int max = x[0]; for(int val : x) max = max(max, val); return max; }
private static final long max(final long... x) { long max = x[0]; for(long val : x) max = max(max, val); return max; }
private static final double max(final double... x) { double max = x[0]; for(double val : x) max = max(max, val); return max; }
private static final <T extends Comparable<T>> T max(final T[] x) { T max = x[0]; for(T val : x) max = max(max, val); return max; }
private static final int max(final int[][] a) { int max = a[0][0]; for(int[] ele : a) max = max(max, max(ele)); return max; }
private static final long max(final long[][] a) { long max = a[0][0]; for(long[] ele : a) max = max(max, max(ele)); return max; }
private static final double max(final double[][] a) { double max = a[0][0]; for(double[] ele : a) max = max(max, max(ele)); return max; }
private static final <T extends Comparable<T>> T max(final T[][] a) { T max = a[0][0]; for(T[] ele : a) max = max(max, max(ele)); return max; }
private static final long sum(final int... a) { long sum = 0; for(int ele : a) sum += ele; return sum; }
private static final long sum(final long... a) { long sum = 0; for(long ele : a) sum += ele; return sum; }
private static final double sum(final double... a) { double sum = 0; for(double ele : a) sum += ele; return sum; }
private static final int sum(final boolean... a) { int sum = 0; for(boolean ele : a) sum += ele ? 1 : 0; return sum; }
private static final long[] sums(final int[] a) { long sum[] = new long[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final long[] sums(final long[] a) { long sum[] = new long[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final double[] sums(final double[] a) { double sum[] = new double[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + a[i]; return sum; }
private static final int[] sums(final boolean[] a) { int sum[] = new int[a.length + 1]; sum[0] = 0; for(int i = 0; i < a.length; i ++) sum[i + 1] = sum[i] + (a[i] ? 1 : 0); return sum; }
private static final long[][] sums(final int[][] a) {
final long sum[][] = new long[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final long[][] sums(final long[][] a) {
final long sum[][] = new long[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final double[][] sums(final double[][] a) {
final double sum[][] = new double[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + a[i][j];
}
return sum;
}
private static final int[][] sums(final boolean[][] a) {
final int sum[][] = new int[a.length + 1][a[0].length + 1];
for(int i = 0; i < a.length; i ++) {
for(int j = 0; j < a[i].length; j ++) sum[i + 1][j + 1] = sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (a[i][j] ? 1 : 0);
}
return sum;
}
private static final int constrain(final int x, final int l, final int r) { return min(max(x, min(l, r)), max(l, r)); }
private static final long constrain(final long x, final long l, final long r) { return min(max(x, min(l, r)), max(l, r)); }
private static final double constrain(final double x, final double l, final double r) { return min(max(x, min(l, r)), max(l, r)); }
private static final int abs(final int x) { return x >= 0 ? x : - x; }
private static final long abs(final long x) { return x >= 0 ? x : - x; }
private static final double abs(final double x) { return x >= 0 ? x : - x; }
private static final int signum(final int x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final int signum(final long x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final int signum(final double x) { return x > 0 ? 1 : x < 0 ? -1 : 0; }
private static final long round(final double x) { return Math.round(x); }
private static final long floor(final double x) { return round(Math.floor(x)); }
private static final int divfloor(final int a, final int b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }
private static final long divfloor(final long a, final long b) { return signum(a) == signum(b) ? a / b : - divceil(abs(a), abs(b)); }
private static final long ceil(final double x) { return round(Math.ceil(x)); }
private static final int divceil(final int a, final int b) { return a >= 0 && b > 0 ? (a + b - 1) / b : a < 0 && b < 0 ? divceil(abs(a), abs(b)) : - divfloor(abs(a), abs(b)); }
private static final long divceil(final long a, final long b) { return a >= 0 && b > 0 ? (a + b - 1) / b : a < 0 && b < 0 ? divceil(abs(a), abs(b)) : - divfloor(abs(a), abs(b)); }
private static final boolean mulGreater(final long a, final long b, long c) { return b == 0 ? c < 0 : b < 0 ? mulLess(a, - b, - c) : a > divfloor(c, b); } // a * b > c
private static final boolean mulGreaterEquals(final long a, final long b, final long c) { return b == 0 ? c <= 0 : b < 0 ? mulLessEquals(a, - b, - c) : a >= divceil(c, b); } // a * b >= c
private static final boolean mulLess(final long a, final long b, final long c) { return !mulGreaterEquals(a, b, c); } // a * b < c
private static final boolean mulLessEquals(final long a, final long b, final long c) { return !mulGreater(a, b, c); } // a * b <= c
private static final double sqrt(final int x) { return Math.sqrt((double)x); }
private static final double sqrt(final long x) { return Math.sqrt((double)x); }
private static final double sqrt(final double x) { return Math.sqrt(x); }
private static final int floorsqrt(final int x) { int s = (int)floor(sqrt(x)) + 1; while(s * s > x) s --; return s; }
private static final long floorsqrt(final long x) { long s = floor(sqrt(x)) + 1; while(s * s > x) s --; return s; }
private static final int ceilsqrt(final int x) { int s = (int)ceil(sqrt(x)); while(s * s >= x) s --; s ++; return s; }
private static final long ceilsqrt(final long x) { long s = ceil(sqrt(x)); while(s * s >= x) s --; s ++; return s; }
private static final long fact(final int n) { long ans = 1; for(int i = 1; i <= n; i ++) ans = Math.multiplyExact(ans, i); return ans; }
private static final long naiveP(final long n, final long r) { long ans = 1; for(int i = 0; i < r; i ++) ans = Math.multiplyExact(ans, n - i); return ans; }
private static final long naiveC(final long n, final long r) { long ans = 1; for(int i = 0; i < r; i ++) { ans = Math.multiplyExact(ans, n - i); ans /= (i + 1); } return ans; }
private static final double pow(final double x, final double y) { return Math.pow(x, y); }
private static final long pow(long x, long y) {
long ans = 1;
while(true) {
if((y & 1) != 0) ans = Math.multiplyExact(ans, x);
y >>= 1;
if(y <= 0) return ans;
x = Math.multiplyExact(x, x);
}
}
private static final double pow(double x, long y) {
double ans = 1;
while(true) {
if((y & 1) != 0) ans *= x;
y >>= 1;
if(y <= 0) return ans;
x *= x;
}
}
private static final int gcd(int a, int b) { while(true) { if(b == 0) return a; int tmp = a; a = b; b = tmp % b; } }
private static final long gcd(long a, long b) { while(true) { if(b == 0) return a; long tmp = a; a = b; b = tmp % b; } }
private static final long lcm(final long a, final long b) { return a / gcd(a, b) * b; }
private static final int gcd(final int... a) { int gcd = 0; for(int ele : a) gcd = gcd(ele, gcd); return gcd; }
private static final long gcd(final long... a) { long gcd = 0; for(long ele : a) gcd = gcd(ele, gcd); return gcd; }
private static final double random() { return Math.random(); }
private static final int random(final int max) { return (int)floor(random() * max); }
private static final long random(final long max) { return floor(random() * max); }
private static final double random(final double max) { return random() * max; }
private static final int random(final int min, final int max) { return random(max - min) + min; }
private static final long random(final long min, final long max) { return random(max - min) + min; }
private static final double random(final double min, final double max) { return random(max - min) + min; }
private static final boolean isUpper(final char c) { return c >= 'A' && c <= 'Z'; }
private static final boolean isLower(final char c) { return c >= 'a' && c <= 'z'; }
private static final int upperToInt(final char c) { return c - 'A'; }
private static final int lowerToInt(final char c) { return c - 'a'; }
private static final int numToInt(final char c) { return c - '0'; }
private static final int charToInt(final char c) { return isLower(c) ? lowerToInt(c) : isUpper(c) ? upperToInt(c) : numToInt(c); }
private static final int alphabetToInt(final char c) { return isLower(c) ? lowerToInt(c) : isUpper(c) ? upperToInt(c) + 26 : 52; }
private static final char intToUpper(final int x) { return (char)(x + 'A'); }
private static final char intToLower(final int x) { return (char)(x + 'a'); }
private static final char intToNum(final int x) { return (char)(x + '0'); }
private static final int[] charToInt(final char[] a) { final int toint[] = new int[a.length]; for(int i = 0; i < a.length; i ++) toint[i] = charToInt(a[i]); return toint; }
private static final int[][] charToInt(final char[][] a) { final int toint[][] = new int[a.length][]; for(int i = 0; i < a.length; i ++) toint[i] = charToInt(a[i]); return toint; }
private static final long[] div(final long x) {
nonNegativeCheck(x);
final List<Long> divList = new ArrayList<>();
for(long i = 1; i * i <= x; i ++) if(x % i == 0) { divList.add(i); if(i * i != x) divList.add(x / i); }
final long div[] = new long[divList.size()];
for(int i = 0; i < divList.size(); i ++) div[i] = divList.get(i);
Arrays.sort(div);
return div;
}
private static final PairLL[] factor(long x) {
nonNegativeCheck(x);
final List<PairLL> factorList = new ArrayList<>();
for(long i = 2; i * i <= x; i ++) {
if(x % i == 0) {
long cnt = 0;
while(x % i == 0) { x /= i; cnt ++; }
factorList.add(new PairLL(i, cnt));
}
}
if(x > 1) factorList.add(new PairLL(x, 1));
final PairLL factor[] = new PairLL[factorList.size()];
for(int i = 0; i < factorList.size(); i ++) factor[i] = factorList.get(i);
Arrays.sort(factor);
return factor;
}
private static final boolean isPrime(final long x) { if(x <= 1) return false; for(long i = 2; i * i <= x; i ++) if(x % i == 0) return false; return true; }
private static final boolean[] prime(final int n) {
nonNegativeCheck(n);
final boolean prime[] = new boolean[n];
fill(prime, true);
if(n > 0) prime[0] = false;
if(n > 1) prime[1] = false;
for(int i = 2; i < n; i ++) if(prime[i]) for(int j = 2; i * j < n; j ++) prime[i * j] = false;
return prime;
}
private static final PairIL[] countElements(final int[] a, final boolean sort) {
final int len = a.length;
final int array[] = new int[len];
for(int i = 0; i < len; i ++) array[i] = a[i];
if(sort) Arrays.sort(array);
final List<PairIL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairIL(array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairIL cnts[] = new PairIL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final PairLL[] countElements(final long[] a, final boolean sort) {
final int len = a.length;
final long array[] = new long[len];
for(int i = 0; i < len; i ++) array[i] = a[i];
if(sort) Arrays.sort(array);
final List<PairLL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairLL(array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairLL cnts[] = new PairLL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final PairIL[] countElements(final String s, final boolean sort) {
final int len = s.length();
final char array[] = s.toCharArray();
if(sort) Arrays.sort(array);
final List<PairIL> cntsList = new ArrayList<>();
long tmp = 1;
for(int i = 1; i <= len; i ++) {
if(i == len || array[i] != array[i - 1]) {
cntsList.add(new PairIL((int)array[i - 1], tmp));
tmp = 1;
}else tmp ++;
}
final PairIL cnts[] = new PairIL[cntsList.size()];
for(int i = 0; i < cntsList.size(); i ++) cnts[i] = cntsList.get(i);
return cnts;
}
private static final long triangular(final long n) { return n * (n + 1) / 2; }
private static final long arctriangularfloor(final long m) {
long n = (floor(sqrt(m * 8 + 1)) - 1) / 2 + 1;
while(triangular(n) > m) n --;
return n;
}
private static final long arctriangularceil(final long m) {
long n = max(0, (ceil(sqrt(m * 8 + 1)) + 1) / 2 - 1);
while(triangular(n) < m) n ++;
return n;
}
private static final int[] baseConvert(long x, final int n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final int digit[] = new int[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = (int)(x % n); x /= n; }
return digit;
}
private static final int[] baseConvert(final long x, final int n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
long tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final int[] baseConvert(int x, final int n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final int digit[] = new int[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = (int)(x % n); x /= n; }
return digit;
}
private static final int[] baseConvert(final int x, final int n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
int tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final long[] baseConvert(long x, final long n, final int len) {
nonNegativeCheck(x);
nonNegativeCheck(n);
nonNegativeCheck(len);
final long digit[] = new long[len];
int i = 0;
while(x > 0 && i < len) { digit[i ++] = x % n; x /= n; }
return digit;
}
private static final long[] baseConvert(final long x, final long n) {
nonNegativeCheck(x);
nonNegativeCheck(n);
long tmp = x;
int len = 0;
while(tmp > 0) { tmp /= n; len ++; }
return baseConvert(x, n, len);
}
private static final int numDigits(final long x) { nonNegativeCheck(x); return Long.toString(x).length(); }
private static final long bitFlag(final int i) { nonNegativeCheck(i); return 1L << i; }
private static final boolean isFlagged(final long x, final int i) { nonNegativeCheck(x); nonNegativeCheck(i); return (x >> i & 1) != 0; }
private static final long countString(final String s, final String t) { return (s.length() - s.replace(t, "").length()) / t.length(); }
private static final long countStringAll(final String s, final String t) { return s.length() - s.replaceAll(t, "").length(); }
private static final String reverse(final String s) { return (new StringBuilder(s)).reverse().toString(); }
private static final char[] reverse(final char[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final boolean[] reverse(final boolean[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final int[] reverse(final int[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final long[] reverse(final long[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final double[] reverse(final double[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final String[] reverse(final String[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final Object[] reverse(final Object[] a) { for(int i = 0; i < a.length / 2; i ++) swap(a, i, a.length - i - 1); return a; }
private static final void fill(final char[] a, final char x) { Arrays.fill(a, x); }
private static final void fill(final boolean[] a, final boolean x) { Arrays.fill(a, x); }
private static final void fill(final int[] a, final int x) { Arrays.fill(a, x); }
private static final void fill(final long[] a, final long x) { Arrays.fill(a, x); }
private static final void fill(final double[] a, final double x) { Arrays.fill(a, x); }
private static final void fill(final char[][] a, final char x) { for(char[] ele : a) fill(ele, x); }
private static final void fill(final boolean[][] a, final boolean x) { for(boolean[] ele : a) fill(ele, x); }
private static final void fill(final int[][] a, final int x) { for(int[] ele : a) fill(ele, x); }
private static final void fill(final long[][] a, final long x) { for(long[] ele : a) fill(ele, x); }
private static final void fill(final double[][] a, final double x) { for(double[] ele : a) fill(ele, x); }
private static final void fill(final char[][][] a, final char x) { for(char[][] ele : a) fill(ele, x); }
private static final void fill(final boolean[][][] a, final boolean x) { for(boolean[][] ele : a) fill(ele, x); }
private static final void fill(final int[][][] a, final int x) { for(int[][] ele : a) fill(ele, x); }
private static final void fill(final long[][][] a, final long x) { for(long[][] ele : a) fill(ele, x); }
private static final void fill(final double[][][] a, final double x) { for(double[][] ele : a) fill(ele, x); }
private static final char[] resize(final char[] a, final int m, final int x) {
nonNegativeCheck(m);
final char resized[] = new char[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final boolean[] resize(final boolean[] a, final int m, final int x) {
nonNegativeCheck(m);
final boolean resized[] = new boolean[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final int[] resize(final int[] a, final int m, final int x) {
nonNegativeCheck(m);
final int resized[] = new int[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final long[] resize(final long[] a, final int m, final int x) {
nonNegativeCheck(m);
final long resized[] = new long[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final double[] resize(final double[] a, final int m, final int x) {
nonNegativeCheck(m);
final double resized[] = new double[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final String[] resize(final String[] a, final int m, final int x) {
nonNegativeCheck(m);
final String resized[] = new String[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final Object[] resize(final Object[] a, final int m, final int x) {
nonNegativeCheck(m);
final Object resized[] = new Object[m];
if(x <= - a.length || x >= m) return resized;
if(x >= 0) System.arraycopy(a, 0, resized, x, min(a.length, m - x));
else System.arraycopy(a, - x, resized, 0, min(a.length + x, m));
return resized;
}
private static final int[] toIntArray(final List<Integer> list) { final int a[] = new int[list.size()]; int idx = 0; for(int ele : list) a[idx ++] = ele; return a; }
private static final long[] toLongArray(final List<Long> list) { final long a[] = new long[list.size()]; int idx = 0; for(long ele : list) a[idx ++] = ele; return a; }
private static final double[] toDoubleArray(final List<Double> list) { final double a[] = new double[list.size()]; int idx = 0; for(double ele : list) a[idx ++] = ele; return a; }
private static final char[] toCharArray(final List<Character> list) { final char a[] = new char[list.size()]; int idx = 0; for(char ele : list) a[idx ++] = ele; return a; }
private static final boolean[] toBooleanArray(final List<Boolean> list) { final boolean a[] = new boolean[list.size()]; int idx = 0; for(boolean ele : list) a[idx ++] = ele; return a; }
private static final String[] toStringArray(final List<String> list) { final String a[] = new String[list.size()]; int idx = 0; for(String ele : list) a[idx ++] = ele; return a; }
private static final <T> void toArray(final List<T> list, final T a[]) { int idx = 0; for(T ele : list) a[idx ++] = ele; }
private static final void shuffleArray(final int[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final void shuffleArray(final long[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final void shuffleArray(final double[] a) { for(int i = 0; i < a.length; i ++) swap(a, i, random(i, a.length)); }
private static final int[] randomi(final int n, final int max) { nonNegativeCheck(n); final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final long[] randoml(final int n, final long max) { nonNegativeCheck(n); final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final double[] randomd(final int n, final double max) { nonNegativeCheck(n); final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = random(max); return a; }
private static final int[] randomi(final int n, final int min, final int max) { nonNegativeCheck(n); final int a[] = new int[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final long[] randoml(final int n, final long min, final long max) { nonNegativeCheck(n); final long a[] = new long[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final double[] randomd(final int n, final double min, final double max) { nonNegativeCheck(n); final double a[] = new double[n]; for(int i = 0; i < n; i ++) a[i] = random(min, max); return a; }
private static final void swap(final char[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); char tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final boolean[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); boolean tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final int[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); int tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final long[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); long tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final double[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); double tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final String[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); String tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final void swap(final Object[] a, final int i, final int j) { rangeCheck(i, a.length); rangeCheck(j, a.length); Object tmp = a[i]; a[i] = a[j]; a[j] = tmp; }
private static final char[][] rotate(final char[][] a) {
final char[][] ans = new char[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final boolean[][] rotate(final boolean[][] a) {
final boolean[][] ans = new boolean[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final int[][] rotate(final int[][] a) {
final int[][] ans = new int[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final long[][] rotate(final long[][] a) {
final long[][] ans = new long[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final double[][] rotate(final double[][] a) {
final double[][] ans = new double[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final Object[][] rotate(final Object[][] a) {
final Object[][] ans = new Object[a[0].length][a.length];
for(int i = 0; i < a.length; i ++) for(int j = 0; j < a[i].length; j ++) ans[j][a.length - i - 1] = a[i][j];
return ans;
}
private static final int[] compress(final int[] a) {
final int n = a.length;
final Set<Integer> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final int compressed[] = new int[ts.size()];
int j = 0;
for(int x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
private static final long[] compress(final long[] a) {
final int n = a.length;
final Set<Long> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final long compressed[] = new long[ts.size()];
int j = 0;
for(long x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
private static final double[] compress(final double[] a) {
final int n = a.length;
final Set<Double> ts = new TreeSet<>();
for(int i = 0; i < n; i ++) ts.add(a[i]);
final double compressed[] = new double[ts.size()];
int j = 0;
for(double x : ts) compressed[j ++] = x;
for(int i = 0; i < n; i ++) a[i] = lowerBound(compressed, a[i]);
return compressed;
}
// binary search
private static final int lowerBound(final int[] a, final int key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final int[] a, final int key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final int[] a, final int key) { return BS(a, key, true, true, false); }
private static final int upperBound(final int[] a, final int key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final int[] a, final int key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final int[] a, final int key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final int[] a, final int key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final int[] a, final int key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final int[] a, final int index, final int key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final int lowerBound(final long[] a, final long key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final long[] a, final long key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final long[] a, final long key) { return BS(a, key, true, true, false); }
private static final int upperBound(final long[] a, final long key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final long[] a, final long key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final long[] a, final long key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final long[] a, final long key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final long[] a, final long key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final long[] a, final int index, final long key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final int lowerBound(final double[] a, final double key) { return BS(a, key, true, true, true); }
private static final int lowerBound(final double[] a, final double key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final int upperBound(final double[] a, final double key) { return BS(a, key, true, true, false); }
private static final int upperBound(final double[] a, final double key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final int cntBS(final double[] a, final double key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final int cntBS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final int BS(final double[] a, final double key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final int BS(final double[] a, final double key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final int binarySearch(final double[] a, final double key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final boolean isOKforBS(final double[] a, final int index, final double key, final boolean gt, final boolean eq) {
return (a[index] > key && gt) || (a[index] < key && !gt) || (a[index] == key && eq);
}
private static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T key) { return BS(a, key, true, true, true); }
private static final <T extends Comparable<? super T>> int lowerBound(final T[] a, final T key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T key) { return BS(a, key, true, true, false); }
private static final <T extends Comparable<? super T>> int upperBound(final T[] a, final T key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final <T extends Comparable<? super T>> int cntBS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final <T extends Comparable<? super T>> int cntBS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length); }
private static final <T extends Comparable<? super T>> int BS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T extends Comparable<? super T>> int binarySearch(final T[] a, final T key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final <T extends Comparable<? super T>> boolean isOKforBS(final T[] a, final int index, final T key, final boolean gt, final boolean eq) {
int compare = a[index].compareTo(key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T> int lowerBound(final T[] a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, true, c); }
private static final <T> int lowerBound(final T[] a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, true, ng, ok, c); }
private static final <T> int upperBound(final T[] a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, false, c); }
private static final <T> int upperBound(final T[] a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, false, ng, ok, c); }
private static final <T> int cntBS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, c); }
private static final <T> int cntBS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, ng, ok, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, ng, ok, c); }
private static final <T> int BS(final T[] a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.length : -1, asc ^ gt ? -1 : a.length, c); }
private static final <T> int BS(final T[] a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok, final Comparator<? super T> c) {
int index = binarySearch(a, key, gt, eq, ng, ok, c);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T> int binarySearch(final T[] a, final T key, final boolean gt, final boolean eq, int ng, int ok, final Comparator<? super T> c) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq, c)) ok = mid; else ng = mid; }
return ok;
}
private static final <T> boolean isOKforBS(final T[] a, final int index, T key, final boolean gt, final boolean eq, final Comparator<? super T> c) {
int compare = c.compare(a[index], key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T key) { return BS(a, key, true, true, true); }
private static final <T extends Comparable<? super T>> int lowerBound(final List<T> a, final T key, final int ng, final int ok) { return BS(a, key, true, true, true, ng, ok); }
private static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T key) { return BS(a, key, true, true, false); }
private static final <T extends Comparable<? super T>> int upperBound(final List<T> a, final T key, final int ng, final int ok) { return BS(a, key, true, true, false, ng, ok); }
private static final <T extends Comparable<? super T>> int cntBS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, true); }
private static final <T extends Comparable<? super T>> int cntBS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, true, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq) { return BS(a, key, asc, gt, eq, false); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok) { return BS(a, key, asc, gt, eq, false, ng, ok); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.size() : -1, asc ^ gt ? -1 : a.size()); }
private static final <T extends Comparable<? super T>> int BS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok) {
int index = binarySearch(a, key, gt, eq, ng, ok);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T extends Comparable<? super T>> int binarySearch(final List<T> a, final T key, final boolean gt, final boolean eq, int ng, int ok) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq)) ok = mid; else ng = mid; }
return ok;
}
private static final <T extends Comparable<? super T>> boolean isOKforBS(final List<T> a, final int index, T key, final boolean gt, final boolean eq) {
int compare = a.get(index).compareTo(key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final <T> int lowerBound(final List<T> a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, true, c); }
private static final <T> int lowerBound(final List<T> a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, true, ng, ok, c); }
private static final <T> int upperBound(final List<T> a, final T key, final Comparator<? super T> c) { return BS(a, key, true, true, false, c); }
private static final <T> int upperBound(final List<T> a, final T key, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, true, true, false, ng, ok, c); }
private static final <T> int cntBS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, c); }
private static final <T> int cntBS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, true, ng, ok, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final int ng, final int ok, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, false, ng, ok, c); }
private static final <T> int BS(final List<T> a, final T key,
final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final Comparator<? super T> c) { return BS(a, key, asc, gt, eq, cnt, asc ^ gt ? a.size() : -1, asc ^ gt ? -1 : a.size(), c); }
private static final <T> int BS(final List<T> a, final T key, final boolean asc, final boolean gt, final boolean eq, final boolean cnt, final int ng, final int ok, final Comparator<? super T> c) {
int index = binarySearch(a, key, gt, eq, ng, ok, c);
return cnt ? (int)abs(ok - index) : index;
}
private static final <T> int binarySearch(final List<T> a, final T key, final boolean gt, final boolean eq, int ng, int ok, final Comparator<? super T> c) {
while(abs(ok - ng) > 1) { int mid = (ok + ng) >> 1; if(isOKforBS(a, mid, key, gt, eq, c)) ok = mid; else ng = mid; }
return ok;
}
private static final <T> boolean isOKforBS(final List<T> a, final int index, final T key, final boolean gt, final boolean eq, final Comparator<? super T> c) {
int compare = c.compare(a.get(index), key);
return (compare > 0 && gt) || (compare < 0 && !gt) || (compare == 0 && eq);
}
private static final PairLL binaryRangeSearch(final long left, final long right, final UnaryOperator<Long> op, final boolean minimize) {
long ok1 = right, ng1 = left;
while(abs(ok1 - ng1) > 1) {
long mid = (ok1 + ng1) >> 1;
boolean isOK = (op.apply(mid + 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;
if(isOK) ok1 = mid; else ng1 = mid;
}
long ok2 = left, ng2 = right;
while(abs(ok2 - ng2) > 1) {
long mid = (ok2 + ng2) >> 1;
boolean isOK = (op.apply(mid - 1) - op.apply(mid)) * (minimize ? 1 : -1) >= 0;
if(isOK) ok2 = mid; else ng2 = mid;
}
return new PairLL(ok1, ok2); //[l, r]
}
private static final double ternarySearch(double left, double right, final UnaryOperator<Double> op, final boolean minimize, final int loop) {
for(int cnt = 0; cnt < loop; cnt ++) {
double m1 = (left * 2 + right) / 3.0;
double m2 = (left + right * 2) / 3.0;
if(op.apply(m1) > op.apply(m2) ^ minimize) right = m2; else left = m1;
}
return (left + right) / 2.0;
}
// mods
private static final class Mod107 extends Mod {
public static final Mod107 md = new Mod107();
public static final long MOD = 1_000_000_007;
private Mod107() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod998 extends Mod {
public static final Mod998 md = new Mod998();
public static final long MOD = 998_244_353;
private Mod998() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod754974721 extends Mod {
public static final Mod754974721 md = new Mod754974721();
public static final long MOD = 754_974_721;
private Mod754974721() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod167772161 extends Mod {
public static final Mod167772161 md = new Mod167772161();
public static final long MOD = 167_772_161;
private Mod167772161() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class Mod469762049 extends Mod {
public static final Mod469762049 md = new Mod469762049();
public static final long MOD = 469_762_049;
private Mod469762049() { super(MOD); }
@Override
public final long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return (x %= MOD) < 0 ? x + MOD : x;
}
@Override
public final long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return (x * y) % MOD;
x = mod(x);
y = mod(y);
return (x * y) % MOD;
}
}
private static final class ArbitraryMod extends Mod {
private static final long MASK = 0xffff_ffffl;
private final long MH;
private final long ML;
public ArbitraryMod(long mod) { super(mod); long a = (1l << 32) / MOD; long b = (1l << 32) % MOD; long m = a * a * MOD + 2 * a * b + (b * b) / MOD; MH = m >>> 32; ML = m & MASK; }
private final long reduce(long x) {
if(MOD == 1) return 0;
if(x < 0) return (x = reduce(- x)) == 0 ? 0 : MOD - 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 x < MOD ? x : x - MOD;
}
@Override
public long mod(long x) {
if(0 <= x && x < MOD) return x;
if(- MOD <= x && x < 0) return x + MOD;
return reduce(x);
}
@Override
public long mul(long x, long y) {
if(x >= 0 && x < MOD && y >= 0 && y < MOD) return reduce(x * y);
x = mod(x);
y = mod(y);
return reduce(x * y);
}
}
private abstract static class Mod {
public final long MOD;
public Mod(long mod) { MOD = mod; }
public abstract long mod(long x);
public final long[] mod(final long[] a) { for(int i = 0; i < a.length; i ++) a[i] = mod(a[i]); return a; }
public final long[][] mod(final long[][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); return a; }
public final long[][][] mod(final long[][][] a) { for(int i = 0; i < a.length; i ++) mod(a[i]); return a; }
public long add(long x, final long y) { return (x += y) >= MOD * 2 || x < 0 ? mod(x) : x >= MOD ? x - MOD : x; }
public final long sum(final long... x) { long sum = 0; for(long ele : x) sum = add(sum, ele); return sum; }
public long sub(long x, final long y) { return (x -= y) < - MOD || x >= MOD ? mod(x) : x < 0 ? x + MOD : x; }
public final long pow(long x, long y) {
nonNegativeCheck(y);
x = mod(x);
long ans = 1;
for(; y > 0; y >>= 1) {
if((y & 1) != 0) ans = mul(ans, x);
x = mul(x, x);
}
return ans;
}
public abstract long mul(long x, long y);
public final long mul(final long... x) { long ans = 1; for(long ele : x) ans = mul(ans, ele); return ans; }
public final long div(final long x, final long y) { return mul(x, inv(y)); }
public final long[] pows(long x, final int n) {
x = mod(x);
long pow[] = new long[n + 1];
pow[0] = 1;
for(int i = 0; i < n; i ++) pow[i + 1] = mul(pow[i], x);
return pow;
}
public final long fact(final int n) {
nonNegativeCheck(n);
prepareFact();
if(n < MAX_FACT1) return fact[n];
else {
long ans = fact[MAX_FACT1 - 1];
for(int i = MAX_FACT1; i <= n; i ++) ans = mul(ans, i);
return ans;
}
}
public final long invFact(final int n) {
nonNegativeCheck(n);
prepareFact();
if(n < MAX_FACT1) return invFact[n];
else return inv(fact(n));
}
private static final int MAX_INV_SIZE = 100_100;
public final Map<Long, Long> invMap = new HashMap<>();
public final long inv(long x) {
x = mod(x);
if(invMap.containsKey(x)) return invMap.get(x);
if(invMap.size() >= MAX_INV_SIZE) return calInv(x);
invMap.put(x, calInv(x));
return invMap.get(x);
}
private final long calInv(final long x) { // O(logM)
PairLL s = new PairLL(MOD, 0);
PairLL t = new PairLL(mod(x), 1);
while(t.a > 0) {
long tmp = s.a / t.a;
PairLL u = new PairLL(s.a - t.a * tmp, s.b - t.b * tmp);
s = t;
t = u;
}
if(s.b < 0) s.b += MOD / s.a;
return s.b;
}
public final long[] invs(final int n) { // O(N)
positiveCheck(n);
long inv[] = new long[n + 1];
inv[1] = 1;
for(int i = 2; i <= n; i ++) inv[i] = mul(inv[(int)(MOD % i)], (MOD - MOD / i));
return inv;
}
private long g;
public final long primitiveRoot() { // O(1) or O(M^(1/2))
if(MOD == 2) return 1;
if(MOD == 167772161) return 3;
if(MOD == 469762049) return 3;
if(MOD == 754974721) return 11;
if(MOD == 998244353) return 3;
if(g != 0) return g;
PairLL factor[] = factor(MOD - 1);
outer: for(g = 2; ; g ++) {
for(PairLL p : factor) if(pow(g, (MOD - 1) / p.a) == 1) continue outer;
return g;
}
}
private static final int MAX_FACT1 = 5_000_100;
private static final int MAX_FACT2 = 500_100;
private static final int MAX_FACT_MAP_SIZE = 100;
private long fact[];
private long invFact[];
private boolean isFactPrepared = false;
private final Map<Long, long[]> factMap = new HashMap<>();
private final void prepareFact() {
if(isFactPrepared) return;
fact = new long[MAX_FACT1];
invFact = new long[MAX_FACT1];
fill(fact, 0);
fill(invFact, 0);
fact[0] = 1;
int maxIndex = min(MAX_FACT1, (int)MOD);
for(int i = 1; i < maxIndex; i ++) fact[i] = mul(fact[i - 1], i);
invFact[maxIndex - 1] = inv(fact[maxIndex - 1]);
for(int i = maxIndex - 1; i > 0; i --) invFact[i - 1] = mul(invFact[i], i);
isFactPrepared = true;
}
public final long P(final long n, final long r) {
if(!isFactPrepared) prepareFact();
if(n < 0 || r < 0 || n < r) return 0;
if(n < MAX_FACT1 && n < MOD) return mul(fact[(int)n], invFact[(int)(n - r)]);
if(!factMap.containsKey(n)) {
long largeFact[] = new long[MAX_FACT2];
factMap.put(n, largeFact);
fill(largeFact, -1);
largeFact[0] = 1;
}
long largeFact[] = factMap.get(n);
if(r >= MAX_FACT2) {
long ans = 1;
for(long i = n - r + 1; i <= n; i ++) ans = mul(ans, i);
return ans;
}else {
int i = (int)r;
while(largeFact[i] < 0) i --;
for(; i < r; i ++) largeFact[i + 1] = mul(largeFact[i], n - i);
if(factMap.size() > MAX_FACT_MAP_SIZE) factMap.remove(n);
return largeFact[(int)r];
}
}
public final long C(final long n, long r) {
if(!isFactPrepared) prepareFact();
if(n < 0) return mod(C(- n + r - 1, - n - 1) * ((r & 1) == 0 ? 1 : -1));
if(r < 0 || n < r) return 0;
r = min(r, n - r);
if(n < MOD) return mul(P(n, r), r < MAX_FACT1 ? invFact[(int)r] : inv(fact((int)r)));
long digitN[] = baseConvert(n, MOD);
long digitR[] = baseConvert(r, MOD);
final int len = digitN.length;
digitR = resize(digitR, len, 0);
long ans = 1;
for(int i = 0; i < len; i ++) ans = mul(ans, C(digitN[i], digitR[i]));
return ans;
}
public final long H(final long n, final long r) { return C(n - 1 + r, r); }
public final long sqrt(long x) {
x = mod(x);
long p = (MOD - 1) >> 1;
if(pow(x, p) != 1) return -1;
long q = MOD - 1;
int m = 1;
while(((q >>= 1) & 1) == 0) m ++;
long z = 1;
while(pow(z, p) == 1) z = random(1, MOD);
long c = pow(z, q);
long t = pow(x, q);
long r = pow(x, (q + 1) >> 1);
if(t == 0) return 0;
m -= 2;
while(t != 1) {
long pows[] = new long[m + 1];
pows[0] = t;
for(int i = 0; i < m; i ++) pows[i + 1] = mul(pows[i], pows[i]);
while(pows[m --] == 1) c = mul(c, c);
r = mul(r, c);
c = mul(c, c);
t = mul(t, c);
}
return r;
}
}
private static final long mod(long x, final long mod) {
if(0 <= x && x < mod) return x;
if(- mod <= x && x < 0) return x + mod;
return (x %= mod) < 0 ? x + mod : x;
}
private static final long pow(long x, long y, final long mod) {
nonNegativeCheck(y);
x = mod(x, mod);
long ans = 1;
for(; y > 0; y >>= 1) {
if((y & 1) != 0) ans = mod(ans * x, mod);
x = mod(x * x, mod);
}
return ans;
}
// grid
private static class Grids {
public final int h, w;
public final Grid[][] gs;
public final Grid[] gi;
public Grids(final int h, final int w) {
nonNegativeCheck(h);
nonNegativeCheck(w);
this.h = h;
this.w = w;
gs = new Grid[h][w];
gi = new Grid[h * w];
for(int i = 0; i < h; i ++) {
for(int j = 0; j < w; j ++) {
gs[i][j] = new Grid(i, j, h, w);
gi[gs[i][j].i] = gs[i][j];
}
}
}
public final void init(final boolean[][] b) { for(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].b = b[i][j]; }
public final void init(final long[][] val) { for(int i = 0; i < h; i ++) for(int j = 0; j < w; j ++) gs[i][j].val = val[i][j]; }
public final Grid get(final int x, final int y) { return isValid(x, y, h, w) ? gs[x][y] : null; }
public final Grid get(final int i) { return get(i / w, i % w); }
public static final int dx[] = {0, -1, 1, 0, 0, -1, 1, -1, 1};
public static final int dy[] = {0, 0, 0, -1, 1, -1, -1, 1, 1};
public final Grid next(final int x, final int y, final int i) { return next(gs[x][y], i); }
public final Grid next(final Grid g, final int i) { return isValid(g.x + dx[i], g.y + dy[i], g.h, g.w) ? gs[g.x + dx[i]][g.y + dy[i]] : null; }
}
private static class Grid implements Comparable<Grid> {
public int x, y, h, w, i; public boolean b; public long val;
public Grid() { }
public Grid(final int x, final int y, final int h, final int w) { init(x, y, h, w, false, 0); }
public Grid(final int x, final int y, final int h, final int w, final boolean b) { init(x, y, h, w, b, 0); }
public Grid(final int x, final int y, final int h, final int w, final long val) { init(x, y, h, w, false, val); }
public Grid(final int x, final int y, final int h, final int w, final boolean b, final long val) { init(x, y, h, w, b, val); }
public final void init(final int x, final int y, final int h, final int w, final boolean b, final long val) { this.x = x; this.y = y; this.h = h; this.w = w; this.b = b; this.val = val; this.i = x * w + y; }
@Override public final String toString() { return "("+x+", "+y+")"+" "+booleanToChar(b)+" "+val; }
@Override public final int hashCode() { return Objects.hash(x, y, h, w, b, val); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Grid that = (Grid) obj;
if(this.x != that.x) return false;
if(this.y != that.y) return false;
if(this.h != that.h) return false;
if(this.w != that.w) return false;
if(this.b != that.b) return false;
if(this.val != that.val) return false;
return true;
}
@Override
public final int compareTo(final Grid that) {
int c = Long.compare(this.val, that.val);
if(c == 0) c = Integer.compare(this.x, that.x);
if(c == 0) c = Integer.compare(this.y, that.y);
return c;
}
}
private static final boolean isValid(final int x, final int y, final int h, final int w) { return x >= 0 && x < h && y >= 0 && y < w; }
private static final boolean isValid(final Grid g) { return isValid(g.x, g.y, g.h, g.w); }
// graph
private static class Graph {
public int numNode, numEdge;
public boolean directed;
public List<Edge> edges = new ArrayList<>();
public Node nodes[];
public Node reversedNodes[];
public Graph(final int numNode, final int numEdge, final boolean directed) {
nonNegativeCheck(numNode);
this.numNode = numNode;
this.numEdge = numEdge;
this.directed = directed;
nodes = new Node[numNode];
reversedNodes = new Node[numNode];
for(int i = 0; i < numNode; i ++) {
nodes[i] = new Node(i);
reversedNodes[i] = new Node(i);
}
}
public void init(final List<Edge> edges) {
this.edges = edges;
for(Edge e : edges) add(e);
}
public void add(final int source, final int target, final long cost) { add(new Edge(source, target, cost)); }
public void add(final Edge e) {
rangeCheck(e.source, numNode);
rangeCheck(e.target, numNode);
edges.add(e);
nodes[e.source].add(e.target, e.cost);
if(directed) reversedNodes[e.target].add(e.source, e.cost);
else nodes[e.target].add(e.source, e.cost);
numEdge = edges.size();
}
public void clearNodes() { edges.clear(); numEdge = 0; for(Node n : nodes) n.clear(); for(Node n : reversedNodes) n.clear(); }
}
private static class Node extends ArrayList<Edge> {
public final int id;
public Node(final int id) { this.id = id; }
public void add(final int target, final long cost) { add(new Edge(id, target, cost)); }
}
private static class Edge implements Comparable<Edge> {
public int source, target; public long cost;
public Edge(final int source, final int target, final long cost) { this.source = source; this.target = target; this.cost = cost; }
@Override public final String toString() { return source+" - "+cost+" -> "+target; }
@Override public final int hashCode() { return Objects.hash(source, target); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Edge that = (Edge) obj;
if(this.source != that.source) return false;
if(this.target != that.target) return false;
return true;
}
@Override
public final int compareTo(final Edge that) {
int c = Long.compare(this.cost, that.cost);
if(c == 0) c = Integer.compare(this.source, that.source);
if(c == 0) c = Integer.compare(this.target, that.target);
return c;
}
}
// Pair
private static class Pair<T extends Comparable<? super T>, U extends Comparable<? super U>> implements Comparable<Pair<T, U>> {
public T a; public U b;
public Pair() { }
public Pair(final T a, final U b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a.toString()+", "+b.toString()+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
Pair that = (Pair) obj;
if(this.a.getClass() != that.a.getClass()) return false;
if(this.b.getClass() != that.b.getClass()) return false;
if(!this.a.equals(that.a)) return false;
if(!this.b.equals(that.b)) return false;
return true;
}
@Override public final int compareTo(final Pair<T, U> that) { int c = (this.a).compareTo(that.a); if(c == 0) c = (this.b).compareTo(that.b); return c; }
}
private static final PairII npii() { return new PairII(ni(), ni()); }
private static final PairII[] npii(final int n) { final PairII a[] = new PairII[n]; for(int i = 0; i < n; i ++) a[i] = npii(); return a; }
private static final PairII[][] npii(final int n, final int m) { final PairII a[][] = new PairII[n][m]; for(int i = 0; i < n; i ++) a[i] = npii(m); return a; }
private static class PairII implements Comparable<PairII> {
public int a; public int b;
public PairII() { }
public PairII(final int a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairII that = (PairII) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairII that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairIL npil() { return new PairIL(ni(), nl()); }
private static final PairIL[] npil(final int n) { final PairIL a[] = new PairIL[n]; for(int i = 0; i < n; i ++) a[i] = npil(); return a; }
private static final PairIL[][] npil(final int n, final int m) { final PairIL a[][] = new PairIL[n][m]; for(int i = 0; i < n; i ++) a[i] = npil(m); return a; }
private static class PairIL implements Comparable<PairIL> {
public int a; public long b;
public PairIL() { }
public PairIL(final int a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairIL that = (PairIL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairIL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairID npid() { return new PairID(ni(), nd()); }
private static final PairID[] npid(final int n) { final PairID a[] = new PairID[n]; for(int i = 0; i < n; i ++) a[i] = npid(); return a; }
private static final PairID[][] npid(final int n, final int m) { final PairID a[][] = new PairID[n][m]; for(int i = 0; i < n; i ++) a[i] = npid(m); return a; }
private static class PairID implements Comparable<PairID> {
public int a; public double b;
public PairID() { }
public PairID(final int a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairID that = (PairID) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairID that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
private static final PairLI npli() { return new PairLI(nl(), ni()); }
private static final PairLI[] npli(final int n) { final PairLI a[] = new PairLI[n]; for(int i = 0; i < n; i ++) a[i] = npli(); return a; }
private static final PairLI[][] npli(final int n, final int m) { final PairLI a[][] = new PairLI[n][m]; for(int i = 0; i < n; i ++) a[i] = npli(m); return a; }
private static class PairLI implements Comparable<PairLI> {
public long a; public int b;
public PairLI() { }
public PairLI(final long a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLI that = (PairLI) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairLL npll() { return new PairLL(nl(), nl()); }
private static final PairLL[] npll(final int n) { final PairLL a[] = new PairLL[n]; for(int i = 0; i < n; i ++) a[i] = npll(); return a; }
private static final PairLL[][] npll(final int n, final int m) { final PairLL a[][] = new PairLL[n][m]; for(int i = 0; i < n; i ++) a[i] = npll(m); return a; }
private static class PairLL implements Comparable<PairLL> {
public long a; public long b;
public PairLL() { }
public PairLL(final long a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLL that = (PairLL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairLD npld() { return new PairLD(nl(), nd()); }
private static final PairLD[] npld(final int n) { final PairLD a[] = new PairLD[n]; for(int i = 0; i < n; i ++) a[i] = npld(); return a; }
private static final PairLD[][] npld(final int n, final int m) { final PairLD a[][] = new PairLD[n][m]; for(int i = 0; i < n; i ++) a[i] = npld(m); return a; }
private static class PairLD implements Comparable<PairLD> {
public long a; public double b;
public PairLD() { }
public PairLD(final long a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairLD that = (PairLD) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairLD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
private static final PairDI npdi() { return new PairDI(nd(), ni()); }
private static final PairDI[] npdi(final int n) { final PairDI a[] = new PairDI[n]; for(int i = 0; i < n; i ++) a[i] = npdi(); return a; }
private static final PairDI[][] npdi(final int n, final int m) { final PairDI a[][] = new PairDI[n][m]; for(int i = 0; i < n; i ++) a[i] = npdi(m); return a; }
private static class PairDI implements Comparable<PairDI> {
public double a; public int b;
public PairDI() { }
public PairDI(final double a, final int b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDI that = (PairDI) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); return c; }
}
private static final PairDL npdl() { return new PairDL(nd(), nl()); }
private static final PairDL[] npdl(final int n) { final PairDL a[] = new PairDL[n]; for(int i = 0; i < n; i ++) a[i] = npdl(); return a; }
private static final PairDL[][] npdl(final int n, final int m) { final PairDL a[][] = new PairDL[n][m]; for(int i = 0; i < n; i ++) a[i] = npdl(m); return a; }
private static class PairDL implements Comparable<PairDL> {
public double a; public long b;
public PairDL() { }
public PairDL(final double a, final long b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDL that = (PairDL) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); return c; }
}
private static final PairDD npdd() { return new PairDD(nd(), nd()); }
private static final PairDD[] npdd(final int n) { final PairDD a[] = new PairDD[n]; for(int i = 0; i < n; i ++) a[i] = npdd(); return a; }
private static final PairDD[][] npdd(final int n, final int m) { final PairDD a[][] = new PairDD[n][m]; for(int i = 0; i < n; i ++) a[i] = npdd(m); return a; }
private static class PairDD implements Comparable<PairDD> {
public double a; public double b;
public PairDD() { }
public PairDD(final double a, final double b) { this.a = a; this.b = b; }
@Override public final String toString() { return "("+a+", "+b+")"; }
@Override public final int hashCode() { return Objects.hash(a, b); }
@Override
public boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
PairDD that = (PairDD) obj;
if(this.a != that.a || this.b != that.b) return false;
return true;
}
@Override public final int compareTo(final PairDD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); return c; }
}
// Tuple
private interface ITuple {
public StringBuilder toStringBuilder();
@Override public String toString();
@Override public int hashCode();
@Override public boolean equals(Object obj);
}
private static class BasicTuple<T extends ITuple & Comparable<? super T>, V extends Comparable<? super V>> implements Comparable<BasicTuple> {
public T t; public V a;
public BasicTuple() { }
private final StringBuilder sbTuple = new StringBuilder();
public final StringBuilder toStringBuilder() {
sbTuple.setLength(0);
return sbTuple.append(t.toStringBuilder()).append(", ").append(a);
}
@Override public final String toString() { return "("+toStringBuilder().toString()+")"; }
@Override public final int hashCode() { return Objects.hash(t, a); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
BasicTuple that = (BasicTuple) obj;
if(this.t.getClass() != that.t.getClass()) return false;
if(this.a.getClass() != that.a.getClass()) return false;
if(!this.t.equals(that.t)) return false;
if(!this.a.equals(that.a)) return false;
return true;
}
@Override @SuppressWarnings("unchecked") public final int compareTo(BasicTuple that) { int c = (this.t).compareTo((T) (Object) that.t); if(c == 0) c = (this.a).compareTo((V) (Object) that.a); return c; }
}
private static class UniqueTuple<V extends Comparable<? super V>> implements ITuple, Comparable<UniqueTuple> {
public V a;
public UniqueTuple() { }
private final StringBuilder sbTuple = new StringBuilder();
public final StringBuilder toStringBuilder() { sbTuple.setLength(0); return sbTuple.append(a); }
@Override public final String toString() { return "("+a.toString()+")"; }
@Override public final int hashCode() { return Objects.hash(a); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null) return false;
if(this.getClass() != obj.getClass()) return false;
UniqueTuple that = (UniqueTuple) obj;
if(this.a.getClass() != that.a.getClass()) return false;
if(!this.a.equals(that.a)) return false;
return true;
}
@Override @SuppressWarnings("unchecked") public final int compareTo(UniqueTuple that) { return (this.a).compareTo((V) (Object) that.a); }
}
private static class Tuple1<T0 extends Comparable<? super T0>> extends UniqueTuple<T0> implements ITuple {
public Tuple1() { super(); }
public Tuple1(final T0 a0) { super(); this.a = a0; }
final T0 get0() { return a; }
final void set0(final T0 x) { a = x; }
}
private static class Tuple2<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>>
extends BasicTuple<Tuple1<T0>, T1> implements ITuple {
public Tuple2() { super(); }
public Tuple2(final T0 a0, final T1 a1) { super(); this.t = new Tuple1<>(a0); this.a = a1; }
final T0 get0() { return t.get0(); }
final T1 get1() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { a = x; }
}
private static class Tuple3<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>>
extends BasicTuple<Tuple2<T0, T1>, T2> implements ITuple {
public Tuple3() { super(); }
public Tuple3(final T0 a0, final T1 a1, final T2 a2) { super(); this.t = new Tuple2<>(a0, a1); this.a = a2; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { a = x; }
}
private static class Tuple4<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>>
extends BasicTuple<Tuple3<T0, T1, T2>, T3> implements ITuple {
public Tuple4() { super(); }
public Tuple4(final T0 a0, final T1 a1, final T2 a2, final T3 a3) { super(); this.t = new Tuple3<>(a0, a1, a2); this.a = a3; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { a = x; }
}
private static class Tuple5<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>>
extends BasicTuple<Tuple4<T0, T1, T2, T3>, T4> implements ITuple {
public Tuple5() { super(); }
public Tuple5(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4) { super(); this.t = new Tuple4<>(a0, a1, a2, a3); this.a = a4; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { a = x; }
}
private static class Tuple6<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>>
extends BasicTuple<Tuple5<T0, T1, T2, T3, T4>, T5> implements ITuple {
public Tuple6() { super(); }
public Tuple6(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5) { super(); this.t = new Tuple5<>(a0, a1, a2, a3, a4); this.a = a5; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { a = x; }
}
private static class Tuple7<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>,
T6 extends Comparable<? super T6>>
extends BasicTuple<Tuple6<T0, T1, T2, T3, T4, T5>, T6> implements ITuple {
public Tuple7() { super(); }
public Tuple7(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5, final T6 a6) { super(); this.t = new Tuple6<>(a0, a1, a2, a3, a4, a5); this.a = a6; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return t.get5(); }
final T6 get6() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { t.set5(x); }
final void set6(final T6 x) { a = x; }
}
private static class Tuple8<
T0 extends Comparable<? super T0>,
T1 extends Comparable<? super T1>,
T2 extends Comparable<? super T2>,
T3 extends Comparable<? super T3>,
T4 extends Comparable<? super T4>,
T5 extends Comparable<? super T5>,
T6 extends Comparable<? super T6>,
T7 extends Comparable<? super T7>>
extends BasicTuple<Tuple7<T0, T1, T2, T3, T4, T5, T6>, T7> implements ITuple {
public Tuple8() { super(); }
public Tuple8(final T0 a0, final T1 a1, final T2 a2, final T3 a3, final T4 a4, final T5 a5, final T6 a6, final T7 a7) { super(); this.t = new Tuple7<>(a0, a1, a2, a3, a4, a5, a6); this.a = a7; }
final T0 get0() { return t.get0(); }
final T1 get1() { return t.get1(); }
final T2 get2() { return t.get2(); }
final T3 get3() { return t.get3(); }
final T4 get4() { return t.get4(); }
final T5 get5() { return t.get5(); }
final T6 get6() { return t.get6(); }
final T7 get7() { return a; }
final void set0(final T0 x) { t.set0(x); }
final void set1(final T1 x) { t.set1(x); }
final void set2(final T2 x) { t.set2(x); }
final void set3(final T3 x) { t.set3(x); }
final void set4(final T4 x) { t.set4(x); }
final void set5(final T5 x) { t.set5(x); }
final void set6(final T6 x) { t.set6(x); }
final void set7(final T7 x) { a = x; }
}
// Tuple3
private static class TupleIII implements Comparable<TupleIII> {
public int a; public int b; public int c;
public TupleIII() { }
public TupleIII(final int a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIII that = (TupleIII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIII that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleIIL implements Comparable<TupleIIL> {
public int a; public int b; public long c;
public TupleIIL() { }
public TupleIIL(final int a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIIL that = (TupleIIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIIL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c;
}
}
private static class TupleIID implements Comparable<TupleIID> {
public int a; public int b; public double c;
public TupleIID() { }
public TupleIID(final int a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIID that = (TupleIID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIID that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleILI implements Comparable<TupleILI> {
public int a; public long b; public int c;
public TupleILI() { }
public TupleILI(final int a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILI that = (TupleILI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILI that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleILL implements Comparable<TupleILL> {
public int a; public long b; public long c;
public TupleILL() { }
public TupleILL(final int a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILL that = (TupleILL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleILD implements Comparable<TupleILD> {
public int a; public long b; public double c;
public TupleILD() { }
public TupleILD(final int a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleILD that = (TupleILD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleILD that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleIDI implements Comparable<TupleIDI> {
public int a; public double b; public int c;
public TupleIDI() { }
public TupleIDI(final int a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDI that = (TupleIDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDI that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleIDL implements Comparable<TupleIDL> {
public int a; public double b; public long c;
public TupleIDL() { }
public TupleIDL(final int a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDL that = (TupleIDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDL that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleIDD implements Comparable<TupleIDD> {
public int a; public double b; public double c;
public TupleIDD() { }
public TupleIDD(final int a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleIDD that = (TupleIDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleIDD that) { int c = Integer.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLII implements Comparable<TupleLII> {
public long a; public int b; public int c;
public TupleLII() { }
public TupleLII(final long a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLII that = (TupleLII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLII that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLIL implements Comparable<TupleLIL> {
public long a; public int b; public long c;
public TupleLIL() { }
public TupleLIL(final long a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLIL that = (TupleLIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLIL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLID implements Comparable<TupleLID> {
public long a; public int b; public double c;
public TupleLID() { }
public TupleLID(final long a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLID that = (TupleLID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLID that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLLI implements Comparable<TupleLLI> {
public long a; public long b; public int c;
public TupleLLI() { }
public TupleLLI(final long a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLI that = (TupleLLI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLLL implements Comparable<TupleLLL> {
public long a; public long b; public long c;
public TupleLLL() { }
public TupleLLL(final long a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLL that = (TupleLLL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLLD implements Comparable<TupleLLD> {
public long a; public long b; public double c;
public TupleLLD() { }
public TupleLLD(final long a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLLD that = (TupleLLD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLLD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleLDI implements Comparable<TupleLDI> {
public long a; public double b; public int c;
public TupleLDI() { }
public TupleLDI(final long a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDI that = (TupleLDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDI that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleLDL implements Comparable<TupleLDL> {
public long a; public double b; public long c;
public TupleLDL() { }
public TupleLDL(final long a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDL that = (TupleLDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDL that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleLDD implements Comparable<TupleLDD> {
public long a; public double b; public double c;
public TupleLDD() { }
public TupleLDD(final long a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleLDD that = (TupleLDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleLDD that) { int c = Long.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDII implements Comparable<TupleDII> {
public double a; public int b; public int c;
public TupleDII() { }
public TupleDII(final double a, final int b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDII that = (TupleDII) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDII that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDIL implements Comparable<TupleDIL> {
public double a; public int b; public long c;
public TupleDIL() { }
public TupleDIL(final double a, final int b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDIL that = (TupleDIL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDIL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDID implements Comparable<TupleDID> {
public double a; public int b; public double c;
public TupleDID() { }
public TupleDID(final double a, final int b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDID that = (TupleDID) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDID that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Integer.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDLI implements Comparable<TupleDLI> {
public double a; public long b; public int c;
public TupleDLI() { }
public TupleDLI(final double a, final long b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLI that = (TupleDLI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDLL implements Comparable<TupleDLL> {
public double a; public long b; public long c;
public TupleDLL() { }
public TupleDLL(final double a, final long b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLL that = (TupleDLL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDLD implements Comparable<TupleDLD> {
public double a; public long b; public double c;
public TupleDLD() { }
public TupleDLD(final double a, final long b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDLD that = (TupleDLD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDLD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Long.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
private static class TupleDDI implements Comparable<TupleDDI> {
public double a; public double b; public int c;
public TupleDDI() { }
public TupleDDI(final double a, final double b, final int c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDI that = (TupleDDI) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDI that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Integer.compare(this.c, that.c); return c; }
}
private static class TupleDDL implements Comparable<TupleDDL> {
public double a; public double b; public long c;
public TupleDDL() { }
public TupleDDL(final double a, final double b, final long c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDL that = (TupleDDL) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDL that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Long.compare(this.c, that.c); return c; }
}
private static class TupleDDD implements Comparable<TupleDDD> {
public double a; public double b; public double c;
public TupleDDD() { }
public TupleDDD(final double a, final double b, final double c) { this.a = a; this.b = b; this.c = c; }
@Override public final String toString() { return "("+a+", "+b+", "+c+")"; }
@Override public final int hashCode() { return Objects.hash(a, b, c); }
@Override
public final boolean equals(final Object obj) {
if(this == obj) return true;
if(obj == null || this.getClass() != obj.getClass()) return false;
TupleDDD that = (TupleDDD) obj;
if(this.a != that.a || this.b != that.b || this.c != that.c) return false;
return true;
}
@Override public final int compareTo(final TupleDDD that) { int c = Double.compare(this.a, that.a); if(c == 0) c = Double.compare(this.b, that.b); if(c == 0) c = Double.compare(this.c, that.c); return c; }
}
public void solve() {
int t = ni();
for(int query = 0; query < t; query ++) {
int n = ni();
boolean b[] = nb(n, '1');
int sum = sum(b);
if(sum % 2 != 0) {
prtln(-1); continue;
}
if(sum == 2) {
int i = 0;
for(; i < n; i ++) if(b[i]) break;
int j = n - 1;
for(; j >= 0; j --) if(b[j]) break;
if(i + 1 == j) {
if(n >= 5) {
prtln(2);
}else if(n == 4) {
prtln((b[1] && b[2]) ? 3 : 2);
}else {
prtln(-1);
}
}else {
prtln(1);
}
}else {
prtln(sum / 2);
}
}
}
}
}
|
ConDefects/ConDefects/Code/arc156_a/Java/39178532
|
condefects-java_data_1785
|
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
for(int i =1;i<=a;i++){
int num = sc.nextInt();
if(num%b==0){
System.out.print(i+" ");
}
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
for(int i =1;i<=a;i++){
int num = sc.nextInt();
if(num%b==0){
System.out.print((num/b)+" ");
}
}
}
}
|
ConDefects/ConDefects/Code/abc347_a/Java/53243745
|
condefects-java_data_1786
|
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
for (int i = 0; i < n; i++){
int a = sc.nextInt();
if (a % k == 0){
System.out.print(a + " ");
}
}
}
}
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
for (int i = 0; i < n; i++){
int a = sc.nextInt();
if (a % k == 0){
System.out.print(a/k + " ");
}
}
}
}
|
ConDefects/ConDefects/Code/abc347_a/Java/52506944
|
condefects-java_data_1787
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.StringTokenizer;
public class Main
{
static long l,r;
static ArrayList<Long> rightie = new ArrayList<>();
public static void main(String[] args)
{
FastReader sc = new FastReader();
int n = sc.nextInt();
int num = n-2;
int m = sc.nextInt();
long[] a = new long[n-2];
l=sc.nextLong();
r=sc.nextLong();
OccurrenceCounter<Long> leftie = new OccurrenceCounter<>();
for(int i=0;i<num;i++)
{
a[i]=sc.nextLong();
}
if(l>r)
{
ArrayList<Long> descRight = new ArrayList<>();
ArrayList<Long> descLeft = new ArrayList<>();
//move L to left
//add more righties as we pass
for(int i=0;i<num;i++)
{
if(a[i] <= l)
{ //leftie
descLeft.add(a[i]);
}
else if(a[i] > l)
{
descRight.add(a[i]);
}
}
//descRight.sort(null);
Collections.sort(descRight, Collections.reverseOrder());
Collections.sort(descLeft, Collections.reverseOrder());
ArrayDeque<Long> req = new ArrayDeque<>();
long curAns = 999999999999l;
for(int i=-1;i<descLeft.size();i++)
{
long leftX = l;
if(i>=0)
{
leftX=descLeft.get(i);
if(leftX>=r)descRight.add(leftX);
//req.addLast(leftX);
}
if(leftX<=r)
{ //L moved past original R: this leftie is included even before moving R to the right.
m--;
}
//System.out.println("Try moving L to " + leftX + ". m: " + m + " " + (i>=0?"[*]":""));
//move L all the way to leftX
long curCost = l-leftX;
//move R to max(leftX, orineed)
//if(r<leftX)curCost+=leftX-r; //move R to current L, first.
//long tax = leftX-r;
long orineed = 0;
//move R further to the right as needed
if(m > descRight.size())
{
continue;
}
else if(m>0)
{
long tarR = descRight.get(descRight.size()-m);
//System.out.println("Move R to include " + tarR + ", as we need " + m + " from " + descRight.toString());
orineed = tarR-r;
}
//curCost += Math.min(tax, orineed);
curCost+=orineed;
curAns = Math.min(curAns, curCost);
//System.out.println(" " + curCost + " from " + (l-leftX) + " + " + orineed + " ->" + leftX + "," + (r+orineed));
//add
}
System.out.println(curAns);
}
else if(r>=l)
{
for(int i=0;i<num;i++)
{
if(a[i] < l)
{ //leftie
leftie.add(a[i]);
}
else if(a[i] > r)
{
rightie.add(a[i]);
}
else
{ //middie
m--;
}
}
rightie.sort(null);
ArrayList<Long> keyList = new ArrayList<>();
for(long l : leftie.map.keySet())
{
keyList.add(l);
}
Collections.sort(keyList, Collections.reverseOrder());
//Make a sorted list of the keys for lefties
//System.out.println(keyList.toString());
if(m<=0)
{
System.out.println(0);
return;
}
//long[] needFromRight = new long[keyList.size()];
long curans = 999999999999999l;
//zero left:
{
int needLeft = m;
if(needLeft <= rightie.size())
{
//System.out.println("Need " + needLeft + " from " + rightie.size());
long totalUsed = 0;
totalUsed+=(getXthRightie(needLeft)-r);
curans = Math.min(curans, totalUsed);
}
}
//System.out.println("lefter: " + keyList.toString());
//System.out.println("RIghtie " + rightie.toString());
int needLeft = m;
for(int left = 0; left < keyList.size(); left++)
{ //move left to include this
long lefter = keyList.get(left);
needLeft -= leftie.get(lefter);
//System.out.println("With " + lefter + "x" + leftie.get(lefter)+", we now need only " + needLeft + " more.");
if(needLeft > rightie.size())
{
// System.out.println("Move left until " + lefter + ": Not enough right... need " + needLeft + ".");
continue;
}
//get needLeft from the right... how many needs to be used then?
long totalUsed = l-lefter;
//System.out.println("Move left until " + lefter + ": " + totalUsed + ", then need " + needLeft);
if(needLeft>0)
{
totalUsed+=(getXthRightie(needLeft)-r);
//System.out.println("Get right up until " + getXthRightie(needLeft) + ", thus using " + totalUsed);
}
curans = Math.min(curans, totalUsed);
}
if(curans==999999999999999l)a[-1]=1;
System.out.println(curans);
}
}
static long getXthRightie(int k)
{
return rightie.get(k-1);
}
static class OccurrenceCounter<T>
{ //Stores and modifies occurrences. Only maintain keys whose # of occurrences is not exactly 0.
HashMap<T, Integer> map = new HashMap<>();
int add(T t, int amount)
{
if(map.containsKey(t))
map.put(t, map.get(t)+amount);
else
map.put(t, amount);
if(map.get(t) == 0)
{
map.remove(t);
return 0;
}
else return map.get(t);
}
int add(T t)
{
return add(t,1);
}
int get(T t)
{
if(map.containsKey(t))return map.get(t);
else return 0;
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(
new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try {
if(st.hasMoreTokens()){
str = st.nextToken("\n");
}
else{
str = br.readLine();
}
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
}}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.StringTokenizer;
public class Main
{
static long l,r;
static ArrayList<Long> rightie = new ArrayList<>();
public static void main(String[] args)
{
FastReader sc = new FastReader();
int n = sc.nextInt();
int num = n-2;
int m = sc.nextInt();
long[] a = new long[n-2];
l=sc.nextLong();
r=sc.nextLong();
OccurrenceCounter<Long> leftie = new OccurrenceCounter<>();
for(int i=0;i<num;i++)
{
a[i]=sc.nextLong();
}
if(l>r)
{
ArrayList<Long> descRight = new ArrayList<>();
ArrayList<Long> descLeft = new ArrayList<>();
//move L to left
//add more righties as we pass
for(int i=0;i<num;i++)
{
if(a[i] <= l)
{ //leftie
descLeft.add(a[i]);
}
else if(a[i] > l)
{
descRight.add(a[i]);
}
}
//descRight.sort(null);
Collections.sort(descRight, Collections.reverseOrder());
Collections.sort(descLeft, Collections.reverseOrder());
ArrayDeque<Long> req = new ArrayDeque<>();
long curAns = 999999999999l;
for(int i=-1;i<descLeft.size();i++)
{
long leftX = l;
if(i>=0)
{
leftX=descLeft.get(i);
if(leftX>=r)descRight.add(leftX);
//req.addLast(leftX);
}
if(leftX<r)
{ //L moved past original R: this leftie is included even before moving R to the right.
m--;
}
//System.out.println("Try moving L to " + leftX + ". m: " + m + " " + (i>=0?"[*]":""));
//move L all the way to leftX
long curCost = l-leftX;
//move R to max(leftX, orineed)
//if(r<leftX)curCost+=leftX-r; //move R to current L, first.
//long tax = leftX-r;
long orineed = 0;
//move R further to the right as needed
if(m > descRight.size())
{
continue;
}
else if(m>0)
{
long tarR = descRight.get(descRight.size()-m);
//System.out.println("Move R to include " + tarR + ", as we need " + m + " from " + descRight.toString());
orineed = tarR-r;
}
//curCost += Math.min(tax, orineed);
curCost+=orineed;
curAns = Math.min(curAns, curCost);
//System.out.println(" " + curCost + " from " + (l-leftX) + " + " + orineed + " ->" + leftX + "," + (r+orineed));
//add
}
System.out.println(curAns);
}
else if(r>=l)
{
for(int i=0;i<num;i++)
{
if(a[i] < l)
{ //leftie
leftie.add(a[i]);
}
else if(a[i] > r)
{
rightie.add(a[i]);
}
else
{ //middie
m--;
}
}
rightie.sort(null);
ArrayList<Long> keyList = new ArrayList<>();
for(long l : leftie.map.keySet())
{
keyList.add(l);
}
Collections.sort(keyList, Collections.reverseOrder());
//Make a sorted list of the keys for lefties
//System.out.println(keyList.toString());
if(m<=0)
{
System.out.println(0);
return;
}
//long[] needFromRight = new long[keyList.size()];
long curans = 999999999999999l;
//zero left:
{
int needLeft = m;
if(needLeft <= rightie.size())
{
//System.out.println("Need " + needLeft + " from " + rightie.size());
long totalUsed = 0;
totalUsed+=(getXthRightie(needLeft)-r);
curans = Math.min(curans, totalUsed);
}
}
//System.out.println("lefter: " + keyList.toString());
//System.out.println("RIghtie " + rightie.toString());
int needLeft = m;
for(int left = 0; left < keyList.size(); left++)
{ //move left to include this
long lefter = keyList.get(left);
needLeft -= leftie.get(lefter);
//System.out.println("With " + lefter + "x" + leftie.get(lefter)+", we now need only " + needLeft + " more.");
if(needLeft > rightie.size())
{
// System.out.println("Move left until " + lefter + ": Not enough right... need " + needLeft + ".");
continue;
}
//get needLeft from the right... how many needs to be used then?
long totalUsed = l-lefter;
//System.out.println("Move left until " + lefter + ": " + totalUsed + ", then need " + needLeft);
if(needLeft>0)
{
totalUsed+=(getXthRightie(needLeft)-r);
//System.out.println("Get right up until " + getXthRightie(needLeft) + ", thus using " + totalUsed);
}
curans = Math.min(curans, totalUsed);
}
if(curans==999999999999999l)a[-1]=1;
System.out.println(curans);
}
}
static long getXthRightie(int k)
{
return rightie.get(k-1);
}
static class OccurrenceCounter<T>
{ //Stores and modifies occurrences. Only maintain keys whose # of occurrences is not exactly 0.
HashMap<T, Integer> map = new HashMap<>();
int add(T t, int amount)
{
if(map.containsKey(t))
map.put(t, map.get(t)+amount);
else
map.put(t, amount);
if(map.get(t) == 0)
{
map.remove(t);
return 0;
}
else return map.get(t);
}
int add(T t)
{
return add(t,1);
}
int get(T t)
{
if(map.containsKey(t))return map.get(t);
else return 0;
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(
new InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
long nextLong() { return Long.parseLong(next()); }
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try {
if(st.hasMoreTokens()){
str = st.nextToken("\n");
}
else{
str = br.readLine();
}
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
}}
|
ConDefects/ConDefects/Code/arc163_b/Java/46010626
|
condefects-java_data_1788
|
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt(), m = fReader.nextInt();
int[] d = new int[n];
DSU dsu = new DSU(n);
for(int i=0;i<n;i++) d[i] = fReader.nextInt();
for(int i=0;i<m;i++) {
int u = fReader.nextInt(), v = fReader.nextInt();
d[u]--;
d[v]--;
dsu.merge(u, v);
}
List<Integer>[] li = new ArrayList[n];
for(int i=0;i<n;i++) li[i] = new ArrayList<>();
for(int i=0;i<n;i++){
if(d[i] < 0) {
o.println(-1);
return;
}
int top = dsu.top(i);
for(int j=0;j<d[i];j++) li[top].add(i);
}
Queue<Integer> com1 = new ArrayDeque<>();
List<List<Integer>> com2 = new ArrayList<>();
for(int i=0;i<n;i++){
if(li[i].size() == 1) com1.offer(li[i].get(0));
else if(li[i].size() > 1) com2.add(li[i]);
}
List<int[]> res = new ArrayList<>();
for(List<Integer> curLi: com2) {
for(int i=0;i<curLi.size()-1;i++) {
if(com1.isEmpty()) {
o.println(-1);
return;
}
int u = curLi.get(i), v = com1.poll();
dsu.merge(u, v);
res.add(new int[]{u, v});
}
com1.offer(curLi.get(curLi.size()-1));
}
if(com1.size() != 2) {
o.println(-1);
return;
}
int u = com1.poll(), v = com1.poll();
dsu.merge(u, v);
res.add(new int[]{u, v});
if(dsu.getComNum() != 1) {
o.println(-1);
return;
}
for(int[] item: res) {
o.println((item[0]+1) + " " + (item[1]+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 lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static boolean isPrime(long x){
boolean ok = true;
for(long i=2;i<=Math.sqrt(x);i++){
if(x % i == 0){
ok = false;
break;
}
}
return ok;
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % mod9;
}
n >>= 1;
a = a * a % mod9;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int top(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void merge(int p, int q){
int root_p = top(p);
int root_q = top(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getComNum(){
return n;
}
public int[] getSize(){
return size;
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
import java.io.*;
import java.util.*;
public class Main {
public static int INF = 0x3f3f3f3f;
public static int mod = 1000000007;
public static int mod9 = 998244353;
public static void main(String args[]){
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if(multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {loop++;solve(o);}
} else solve(o);
o.close();
} catch (Exception e) {e.printStackTrace();}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt(), m = fReader.nextInt();
int[] d = new int[n];
DSU dsu = new DSU(n);
for(int i=0;i<n;i++) d[i] = fReader.nextInt();
for(int i=0;i<m;i++) {
int u = fReader.nextInt()-1, v = fReader.nextInt()-1;
d[u]--;
d[v]--;
dsu.merge(u, v);
}
List<Integer>[] li = new ArrayList[n];
for(int i=0;i<n;i++) li[i] = new ArrayList<>();
for(int i=0;i<n;i++){
if(d[i] < 0) {
o.println(-1);
return;
}
int top = dsu.top(i);
for(int j=0;j<d[i];j++) li[top].add(i);
}
Queue<Integer> com1 = new ArrayDeque<>();
List<List<Integer>> com2 = new ArrayList<>();
for(int i=0;i<n;i++){
if(li[i].size() == 1) com1.offer(li[i].get(0));
else if(li[i].size() > 1) com2.add(li[i]);
}
List<int[]> res = new ArrayList<>();
for(List<Integer> curLi: com2) {
for(int i=0;i<curLi.size()-1;i++) {
if(com1.isEmpty()) {
o.println(-1);
return;
}
int u = curLi.get(i), v = com1.poll();
dsu.merge(u, v);
res.add(new int[]{u, v});
}
com1.offer(curLi.get(curLi.size()-1));
}
if(com1.size() != 2) {
o.println(-1);
return;
}
int u = com1.poll(), v = com1.poll();
dsu.merge(u, v);
res.add(new int[]{u, v});
if(dsu.getComNum() != 1) {
o.println(-1);
return;
}
for(int[] item: res) {
o.println((item[0]+1) + " " + (item[1]+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 lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static boolean isPrime(long x){
boolean ok = true;
for(long i=2;i<=Math.sqrt(x);i++){
if(x % i == 0){
ok = false;
break;
}
}
return ok;
}
public static void reverse(int[] array){
reverse(array, 0 , array.length-1);
}
public static void reverse(int[] array, int left, int right) {
if (array != null) {
int i = left;
for(int j = right; j > i; ++i) {
int tmp = array[j];
array[j] = array[i];
array[i] = tmp;
--j;
}
}
}
public static long qpow(long a, long n){
long ret = 1l;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % mod9;
}
n >>= 1;
a = a * a % mod9;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int top(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void merge(int p, int q){
int root_p = top(p);
int root_q = top(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getComNum(){
return n;
}
public int[] getSize(){
return size;
}
}
public static class FenWick {
int n;
long[] tree;
public FenWick(int n){
this.n = n;
tree = new long[n+1];
}
private void add(int x, long val){
while(x <= n){
tree[x] += val;
x += x&-x;
}
}
private long query(int x){
long ret = 0l;
while(x > 0){
ret += tree[x];
x -= x&-x;
}
return ret;
}
}
public static class fReader {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static StringTokenizer tokenizer = new StringTokenizer("");
private static String next() throws IOException{
while(!tokenizer.hasMoreTokens()){tokenizer = new StringTokenizer(reader.readLine());}
return tokenizer.nextToken();
}
public static int nextInt() throws IOException {return Integer.parseInt(next());}
public static Long nextLong() throws IOException {return Long.parseLong(next());}
public static double nextDouble() throws IOException {return Double.parseDouble(next());}
public static char nextChar() throws IOException {return next().toCharArray()[0];}
public static String nextString() throws IOException {return next();}
public static String nextLine() throws IOException {return reader.readLine();}
}
}
|
ConDefects/ConDefects/Code/abc239_f/Java/32352481
|
condefects-java_data_1789
|
import java.io.*;
import java.util.*;
public class Main {
void solve(){
int n = scanner.nextInt();
Map<Integer, List<Integer>> g = new HashMap<>();
for(int i = 0; i < n; i++){
int a = scanner.nextInt(), b = scanner.nextInt();
g.putIfAbsent(a, new ArrayList<>());
g.get(a).add(b);
}
Set<Integer> seen = new HashSet<>();
Queue<Integer> q = new LinkedList<>();
q.offer(1);
seen.add(1);
int res = 1;
while(!q.isEmpty()){
int curr = q.poll();
res = Math.max(res, curr);
if(g.containsKey(curr)){
for(int child: g.get(curr)){
if(!seen.contains(child)){
q.offer(child);
seen.add(child);
}
}
}
}
out.println(res);
}
private static final boolean memory = false;
private static final boolean singleTest = true;
// read inputs and call solvers
void run() {
int numOfTests = singleTest? 1: scanner.nextInt();
for(int testIdx = 1; testIdx <= numOfTests; testIdx++){
solve();
}
out.flush();
out.close();
}
// ----- runner templates ----- //
public static void main(String[] args) {
if(memory) {
new Thread(null, new Runnable() {
@Override
public void run() {
new Main().run();
}
}, "go", 1 << 26).start();
}
else{
new Main().run();
}
}
//------ input and output ------//
public static MyScanner scanner = new MyScanner();
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static class MyScanner {
private BufferedReader br;
private StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
return str;
}
int[] nextIntArray(int n, int base){
int[] arr = new int[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextInt();}
return arr;
}
long[] nextLongArray(int n, int base){
long[] arr = new long[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextLong();}
return arr;
}
int[][] nextIntGrid(int n, int m, int base){
int[][] grid = new int[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextInt();}}
return grid;
}
Map<Integer, List<Integer>> nextSimpleGraph(int numOfVertices, int numOfEdges, boolean directed){
Map<Integer, List<Integer>> g = new HashMap<>();
// 1-base indices
for(int i = 1; i <= numOfVertices; i++){g.put(i, new ArrayList<>());}
for(int i = 1; i <= numOfEdges; i++){
int u = scanner.nextInt();
int v = scanner.nextInt();
g.get(u).add(v);
if(!directed){g.get(v).add(u);}
}
return g;
}
}
//------ debug and print functions ------//
void debug(Object...o) {out.println(Arrays.deepToString(o));}
void debug(Object o){out.println(o);}
void debug(int[] arr){out.println(Arrays.toString(arr));}
void debug(long[] arr){out.println(Arrays.toString(arr));}
void debug(char[] arr){out.println(Arrays.toString(arr));}
void debug(boolean[] arr){out.println(Arrays.toString(arr));}
void debug(int[][] matrix){for(int[] row: matrix)out.println(Arrays.toString(row));}
void debug(long[][] matrix){for(long[] row: matrix)out.println(Arrays.toString(row));}
void debug(char[][] matrix){for(char[] row: matrix)out.println(Arrays.toString(row));}
void debug(boolean[][] matrix){for(boolean[] row: matrix)out.println(Arrays.toString(row));}
void debug(Object[][] matrix){for(Object[] row: matrix)out.println(Arrays.toString(row));}
//------ print functions ------//
void print(int[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(long[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(char[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(Object... o){
for(int i = 0; i < o.length; i++){
out.print(o[i]);
out.print(i==o.length-1?'\n':' ');
}
}
<T> void printArrayList(List<T> arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr.get(i));
out.print(i==end? '\n':' ');
}
}
//------ sort primitive type arrays ------//
static void sort(int[] arr){
List<Integer> temp = new ArrayList<>();
for(int val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(long[] arr){
List<Long> temp = new ArrayList<>();
for(long val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(char[] arr) {
List<Character> temp = new ArrayList<>();
for (char val : arr) {temp.add(val);}
Collections.sort(temp);
for (int i = 0; i < arr.length; i++) {arr[i] = temp.get(i);}
}
}
import java.io.*;
import java.util.*;
public class Main {
void solve(){
int n = scanner.nextInt();
Map<Integer, List<Integer>> g = new HashMap<>();
for(int i = 0; i < n; i++){
int a = scanner.nextInt(), b = scanner.nextInt();
g.putIfAbsent(a, new ArrayList<>());
g.get(a).add(b);
g.putIfAbsent(b, new ArrayList<>());
g.get(b).add(a);
}
Set<Integer> seen = new HashSet<>();
Queue<Integer> q = new LinkedList<>();
q.offer(1);
seen.add(1);
int res = 1;
while(!q.isEmpty()){
int curr = q.poll();
res = Math.max(res, curr);
if(g.containsKey(curr)){
for(int child: g.get(curr)){
if(!seen.contains(child)){
q.offer(child);
seen.add(child);
}
}
}
}
out.println(res);
}
private static final boolean memory = false;
private static final boolean singleTest = true;
// read inputs and call solvers
void run() {
int numOfTests = singleTest? 1: scanner.nextInt();
for(int testIdx = 1; testIdx <= numOfTests; testIdx++){
solve();
}
out.flush();
out.close();
}
// ----- runner templates ----- //
public static void main(String[] args) {
if(memory) {
new Thread(null, new Runnable() {
@Override
public void run() {
new Main().run();
}
}, "go", 1 << 26).start();
}
else{
new Main().run();
}
}
//------ input and output ------//
public static MyScanner scanner = new MyScanner();
public static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static class MyScanner {
private BufferedReader br;
private StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
return str;
}
int[] nextIntArray(int n, int base){
int[] arr = new int[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextInt();}
return arr;
}
long[] nextLongArray(int n, int base){
long[] arr = new long[n + base];
for(int i = base; i < n + base; i++){arr[i] = scanner.nextLong();}
return arr;
}
int[][] nextIntGrid(int n, int m, int base){
int[][] grid = new int[n + base][m + base];
for(int i = base; i < n + base; i++){for(int j = base; j < m + base; j++){grid[i][j] = scanner.nextInt();}}
return grid;
}
Map<Integer, List<Integer>> nextSimpleGraph(int numOfVertices, int numOfEdges, boolean directed){
Map<Integer, List<Integer>> g = new HashMap<>();
// 1-base indices
for(int i = 1; i <= numOfVertices; i++){g.put(i, new ArrayList<>());}
for(int i = 1; i <= numOfEdges; i++){
int u = scanner.nextInt();
int v = scanner.nextInt();
g.get(u).add(v);
if(!directed){g.get(v).add(u);}
}
return g;
}
}
//------ debug and print functions ------//
void debug(Object...o) {out.println(Arrays.deepToString(o));}
void debug(Object o){out.println(o);}
void debug(int[] arr){out.println(Arrays.toString(arr));}
void debug(long[] arr){out.println(Arrays.toString(arr));}
void debug(char[] arr){out.println(Arrays.toString(arr));}
void debug(boolean[] arr){out.println(Arrays.toString(arr));}
void debug(int[][] matrix){for(int[] row: matrix)out.println(Arrays.toString(row));}
void debug(long[][] matrix){for(long[] row: matrix)out.println(Arrays.toString(row));}
void debug(char[][] matrix){for(char[] row: matrix)out.println(Arrays.toString(row));}
void debug(boolean[][] matrix){for(boolean[] row: matrix)out.println(Arrays.toString(row));}
void debug(Object[][] matrix){for(Object[] row: matrix)out.println(Arrays.toString(row));}
//------ print functions ------//
void print(int[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(long[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(char[] arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr[i]);
out.print(i==end? '\n':' ');
}
}
void print(Object... o){
for(int i = 0; i < o.length; i++){
out.print(o[i]);
out.print(i==o.length-1?'\n':' ');
}
}
<T> void printArrayList(List<T> arr, int start, int end){
for(int i = start; i <= end; i++){
out.print(arr.get(i));
out.print(i==end? '\n':' ');
}
}
//------ sort primitive type arrays ------//
static void sort(int[] arr){
List<Integer> temp = new ArrayList<>();
for(int val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(long[] arr){
List<Long> temp = new ArrayList<>();
for(long val: arr){temp.add(val);}
Collections.sort(temp);
for(int i = 0; i < arr.length; i++){arr[i] = temp.get(i);}
}
static void sort(char[] arr) {
List<Character> temp = new ArrayList<>();
for (char val : arr) {temp.add(val);}
Collections.sort(temp);
for (int i = 0; i < arr.length; i++) {arr[i] = temp.get(i);}
}
}
|
ConDefects/ConDefects/Code/abc277_c/Java/39482210
|
condefects-java_data_1790
|
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 FastReader vt = new FastReader();
static PrintWriter out = new PrintWriter(System.out);
static boolean cycle = false;
static ArrayList<Integer> list = new ArrayList<>();
public static void main(String[] args) {
try {
// int testCases = vt.nextInt();
int testCases = 1;
while (testCases-- > 0) {
// write code here
solve();
}
out.flush();
} catch (Exception e) {
return;
}
}
static void solve() {
int n = vt.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = vt.nextInt() - 1;
}
int[] dp = new int[n];
int[] vis = new int[n];
int id = 0;
for (int i = 0; i < n; i++) {
if (vis[i] == 0) {
HashSet<Integer> set = new HashSet<>();
findcycle(i, arr, vis, id, set);
}
}
int ans = 0;
int[] newvis = new int[n];
for (Integer i : list) {
HashSet<Integer> set = new HashSet<>();
int len = findcyclelength(i, arr, id, set);
for (Integer j : set) {
dp[j] = len;
newvis[j] = 1;
}
}
for (int i = 0; i < n; i++) {
if (newvis[i] == 0) {
dp[i] = dfs(i, arr, dp, newvis);
}
}
for (int i = 0; i < n; i++) {
ans = ans + dp[i];
}
out.println(ans);
}
static int findcyclelength(int i, int[] arr, int id, HashSet<Integer> set) {
if (set.contains(i)) {
return 0;
}
set.add(i);
return 1 + findcyclelength(arr[i], arr, id, set);
}
static void findcycle(int i, int[] arr, int[] vis, int id, HashSet<Integer> set) {
if (vis[i] == 1) {
if (set.contains(i)) {
list.add(i);
}
return;
}
vis[i] = 1;
set.add(i);
findcycle(arr[i], arr, vis, id, set);
}
static int dfs(int i, int[] arr, int[] dp, int[] vis) {
if (vis[i] == 1) {
return dp[i];
}
vis[i] = 1;
int val = dfs(arr[i], arr, dp, vis) + 1;
return dp[i] = val;
}
}
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 FastReader vt = new FastReader();
static PrintWriter out = new PrintWriter(System.out);
static boolean cycle = false;
static ArrayList<Integer> list = new ArrayList<>();
public static void main(String[] args) {
try {
// int testCases = vt.nextInt();
int testCases = 1;
while (testCases-- > 0) {
// write code here
solve();
}
out.flush();
} catch (Exception e) {
return;
}
}
static void solve() {
int n = vt.nextInt();
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
arr[i] = vt.nextInt() - 1;
}
int[] dp = new int[n];
int[] vis = new int[n];
int id = 0;
for (int i = 0; i < n; i++) {
if (vis[i] == 0) {
HashSet<Integer> set = new HashSet<>();
findcycle(i, arr, vis, id, set);
}
}
long ans = 0;
int[] newvis = new int[n];
for (Integer i : list) {
HashSet<Integer> set = new HashSet<>();
int len = findcyclelength(i, arr, id, set);
for (Integer j : set) {
dp[j] = len;
newvis[j] = 1;
}
}
for (int i = 0; i < n; i++) {
if (newvis[i] == 0) {
dp[i] = dfs(i, arr, dp, newvis);
}
}
for (int i = 0; i < n; i++) {
ans = ans + dp[i];
}
out.println(ans);
}
static int findcyclelength(int i, int[] arr, int id, HashSet<Integer> set) {
if (set.contains(i)) {
return 0;
}
set.add(i);
return 1 + findcyclelength(arr[i], arr, id, set);
}
static void findcycle(int i, int[] arr, int[] vis, int id, HashSet<Integer> set) {
if (vis[i] == 1) {
if (set.contains(i)) {
list.add(i);
}
return;
}
vis[i] = 1;
set.add(i);
findcycle(arr[i], arr, vis, id, set);
}
static int dfs(int i, int[] arr, int[] dp, int[] vis) {
if (vis[i] == 1) {
return dp[i];
}
vis[i] = 1;
int val = dfs(arr[i], arr, dp, vis) + 1;
return dp[i] = val;
}
}
|
ConDefects/ConDefects/Code/abc357_e/Java/54374973
|
condefects-java_data_1791
|
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int n = sc.nextInt();
int[] a = new int[n];
long[] num = new long[33];//端から使って残るサイズ
boolean ans = true;
for(int i = 0;i < n;i++) {
a[i] = -sc.nextInt();
}Arrays.sort(a);
makeSQ(h,w,num,pow(2,32),32);
for(int i = 0;i < n;i++) {
if(num[-a[i]] > 0) {
num[-a[i]]--;
}else if(num[-a[i]] <= 0) {
long add = 4;
for(int j = -a[i] + 1;j <= 32;j++) {
num[-a[i]] += add * num[j];
add *= (long)4;
num[j] = 0;
}if(num[-a[i]] == 0) {
ans = false;
}else {
num[-a[i]]--;
}
}
}
//System.out.println(pow(2,-a[0]));
System.out.print(ans ? "Yes":"No");
}public static void makeSQ(long h,long w,long[] num,long now,int nowInd){
if(h == 0 || w == 0) {
return;
}
if(now > h || now > w) {
makeSQ(h,w,num,now/(long)2,nowInd - 1);
}else {
num[nowInd] += h/now * w/now;
makeSQ(h % now,w/now * now,num,now/(long)2,nowInd - 1);
makeSQ(h / now * now,w % now,num,now/(long)2,nowInd - 1);
makeSQ(h % now,w % now,num,now/(long)2,nowInd - 1);
}
}
public static long pow(int a,int b) {
String bs = Long.toBinaryString(b);
long[] pownum = new long[bs.length() + 1];
long ret = 1;
pownum[bs.length()] = a;
for(int i = bs.length() - 1;i >= 0;i--) {
if(bs.charAt(i) == '1') {
ret =ret * pownum[i + 1];
}pownum[i] = pownum[i + 1] * pownum[i + 1];
}
return ret;
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO 自動生成されたメソッド・スタブ
Scanner sc = new Scanner(System.in);
int h = sc.nextInt();
int w = sc.nextInt();
int n = sc.nextInt();
int[] a = new int[n];
long[] num = new long[33];//端から使って残るサイズ
boolean ans = true;
for(int i = 0;i < n;i++) {
a[i] = -sc.nextInt();
}Arrays.sort(a);
makeSQ(h,w,num,pow(2,32),32);
for(int i = 0;i < n;i++) {
if(num[-a[i]] > 0) {
num[-a[i]]--;
}else if(num[-a[i]] <= 0) {
long add = 4;
for(int j = -a[i] + 1;j <= 32;j++) {
num[-a[i]] += add * num[j];
add *= (long)4;
num[j] = 0;
}if(num[-a[i]] == 0) {
ans = false;
}else {
num[-a[i]]--;
}
}
}
//System.out.println(pow(2,-a[0]));
System.out.print(ans ? "Yes":"No");
}public static void makeSQ(long h,long w,long[] num,long now,int nowInd){
if(h == 0 || w == 0) {
return;
}
if(now > h || now > w) {
makeSQ(h,w,num,now/(long)2,nowInd - 1);
}else {
num[nowInd] += (h/now) * (w/now);
makeSQ(h % now,w/now * now,num,now/(long)2,nowInd - 1);
makeSQ(h / now * now,w % now,num,now/(long)2,nowInd - 1);
makeSQ(h % now,w % now,num,now/(long)2,nowInd - 1);
}
}
public static long pow(int a,int b) {
String bs = Long.toBinaryString(b);
long[] pownum = new long[bs.length() + 1];
long ret = 1;
pownum[bs.length()] = a;
for(int i = bs.length() - 1;i >= 0;i--) {
if(bs.charAt(i) == '1') {
ret =ret * pownum[i + 1];
}pownum[i] = pownum[i + 1] * pownum[i + 1];
}
return ret;
}
}
|
ConDefects/ConDefects/Code/arc172_a/Java/50430222
|
condefects-java_data_1792
|
import java.util.*;
import java.io.*;
public class Main {
static ContestScanner sc = new ContestScanner(System.in);
static ContestPrinter pw = new ContestPrinter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
public static void solve() {
long H = sc.nextLong();
long W = sc.nextLong();
if(H < W){
long tmp = W;
W = H;
H = tmp;
}
int N = sc.nextInt();
ArrayList<Integer> arr = new ArrayList<>();
for(int i = 0; i < N; i++){
arr.add(sc.nextInt());
}
Collections.sort(arr,Comparator.reverseOrder());
PriorityQueue<long[]> second = new PriorityQueue<>(new ArrayComparator());
Deque<long[]> keep = new ArrayDeque<long[]>();
second.add(new long[]{H,W});
for(int i = 0; i < N; i++){
int v = arr.get(i);
long w = 1L << v;
long remW = w;
while(second.size() > 0 && remW > 0){
long[] now = second.poll();
if(now[0] < w){
continue;
}else{
if(remW > now[1]){
remW -= now[1];
now[0] -= w;
keep.add(now);
}else{
long[] now1 = new long[]{now[0]-w,remW};
long[] now2 = new long[]{now[0],now[1]-remW};
remW = 0;
second.add(now1);
if(now2[1] != 0){
second.add(now2);
}
while(keep.size() > 0){
second.add(keep.pollLast());
}
}
}
}
if(remW != 0){
pw.println("No");
return;
}
}
pw.println("Yes");
}
static class ArrayComparator implements Comparator<long[]> {
@Override
public int compare(long[] a1, long[] a2) {
for (int i = 0; i < a1.length; i++) {
if (a1[i] < a2[i]) {
return -1;
} else if (a1[i] > a2[i]) {
return 1;
}
}
return 0;
}
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends PrintWriter {
public ContestPrinter(PrintStream stream) {
super(stream);
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printlnArray(String[] array) {
for (String i : array)
super.println(i);
}
public void printSpace(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++) {
super.print(o[i]);
super.print(" ");
}
super.println(o[n]);
}
public void println(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.println(o[n]);
}
public void printYN(boolean o) {
super.println(o ? "Yes" : "No");
}
public void print(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.print(o[n]);
}
public void printArray(Object[] array) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(" ");
}
super.println(array[n]);
}
public void printlnArray(Object[] array) {
for (Object i : array)
super.println(i);
}
public void printArray(int[] array, String separator) {
int n = array.length - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(int[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(int[] array) {
for (int i : array)
super.println(i);
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n]));
}
public void printlnArray(int[] array, java.util.function.IntUnaryOperator map) {
for (int i : array)
super.println(map.applyAsInt(i));
}
public void printlnArray(long[] array, java.util.function.LongUnaryOperator map) {
for (long i : array)
super.println(map.applyAsLong(i));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(long[] array) {
this.printArray(array, " ");
}
public void printlnArray(long[] array) {
for (long i : array)
super.println(i);
}
public void printArray(double[] array) {
printArray(array, " ");
}
public void printArray(double[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(double[] array) {
for (double i : array)
super.println(i);
}
public void printArray(boolean[] array, String a, String b) {
int n = array.length - 1;
for (int i = 0; i < n; i++)
super.print((array[i] ? a : b) + " ");
super.println(array[n] ? a : b);
}
public void printArray(boolean[] array) {
this.printArray(array, "Y", "N");
}
public void printArray(char[] array) {
for (char c : array)
this.print(c);
this.println();
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(ArrayList<?> array) {
this.printArray(array, " ");
}
public void printArray(ArrayList<?> array, String separator) {
int n = array.size() - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array.get(i).toString());
super.print(separator);
}
super.println(array.get(n).toString());
}
public void printlnArray(ArrayList<?> array) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(array.get(i).toString());
}
public void printlnArray(ArrayList<Integer> array, java.util.function.IntUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsInt(array.get(i)));
}
public void printlnArray(ArrayList<Long> array, java.util.function.LongUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsLong(array.get(i)));
}
public void printArray(int[][] array) {
for (int[] a : array)
this.printArray(a);
}
public void printArray(int[][] array, java.util.function.IntUnaryOperator map) {
for (int[] a : array)
this.printArray(a, map);
}
public void printArray(long[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] + " ");
super.println(array[i][m]);
}
}
public void printArray(long[][] array, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
super.print(map.applyAsLong(array[i][j]));
super.print(" ");
}
super.println(map.applyAsLong(array[i][m]));
}
}
public void printArray(boolean[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] ? "○ " : "× ");
super.println(array[i][m] ? "○" : "×");
}
}
public void printArray(char[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j]);
super.println();
}
}
}
import java.util.*;
import java.io.*;
public class Main {
static ContestScanner sc = new ContestScanner(System.in);
static ContestPrinter pw = new ContestPrinter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
public static void solve() {
long H = sc.nextLong();
long W = sc.nextLong();
if(H < W){
long tmp = W;
W = H;
H = tmp;
}
int N = sc.nextInt();
ArrayList<Integer> arr = new ArrayList<>();
for(int i = 0; i < N; i++){
arr.add(sc.nextInt());
}
Collections.sort(arr,Comparator.reverseOrder());
PriorityQueue<long[]> second = new PriorityQueue<>(new ArrayComparator());
Deque<long[]> keep = new ArrayDeque<long[]>();
second.add(new long[]{H,W});
for(int i = 0; i < N; i++){
int v = arr.get(i);
long w = 1L << v;
long remW = w;
while(second.size() > 0 && remW > 0){
long[] now = second.poll();
if(now[0] < w){
keep.add(now);
}else{
if(remW > now[1]){
remW -= now[1];
now[0] -= w;
keep.add(now);
}else{
long[] now1 = new long[]{now[0]-w,remW};
long[] now2 = new long[]{now[0],now[1]-remW};
remW = 0;
second.add(now1);
if(now2[1] != 0){
second.add(now2);
}
while(keep.size() > 0){
second.add(keep.pollLast());
}
}
}
}
if(remW != 0){
pw.println("No");
return;
}
}
pw.println("Yes");
}
static class ArrayComparator implements Comparator<long[]> {
@Override
public int compare(long[] a1, long[] a2) {
for (int i = 0; i < a1.length; i++) {
if (a1[i] < a2[i]) {
return -1;
} else if (a1[i] > a2[i]) {
return 1;
}
}
return 0;
}
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class ContestScanner {
private final java.io.InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private static final long LONG_MAX_TENTHS = 922337203685477580L;
private static final int LONG_MAX_LAST_DIGIT = 7;
private static final int LONG_MIN_LAST_DIGIT = 8;
public ContestScanner(java.io.InputStream in){
this.in = in;
}
public ContestScanner(java.io.File file) throws java.io.FileNotFoundException {
this(new java.io.BufferedInputStream(new java.io.FileInputStream(file)));
}
public ContestScanner(){
this(System.in);
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (java.io.IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new java.util.NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new java.util.NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
int digit = b - '0';
if (n >= LONG_MAX_TENTHS) {
if (n == LONG_MAX_TENTHS) {
if (minus) {
if (digit <= LONG_MIN_LAST_DIGIT) {
n = -n * 10 - digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
} else {
if (digit <= LONG_MAX_LAST_DIGIT) {
n = n * 10 + digit;
b = readByte();
if (!isPrintableChar(b)) {
return n;
} else if (b < '0' || '9' < b) {
throw new NumberFormatException(
String.format("%d%s... is not number", n, Character.toString(b))
);
}
}
}
}
throw new ArithmeticException(
String.format("%s%d%d... overflows long.", minus ? "-" : "", n, digit)
);
}
n = n * 10 + digit;
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public long[] nextLongArray(int length){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = this.nextLong();
return array;
}
public long[] nextLongArray(int length, java.util.function.LongUnaryOperator map){
long[] array = new long[length];
for(int i=0; i<length; i++) array[i] = map.applyAsLong(this.nextLong());
return array;
}
public int[] nextIntArray(int length){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = this.nextInt();
return array;
}
public int[] nextIntArray(int length, java.util.function.IntUnaryOperator map){
int[] array = new int[length];
for(int i=0; i<length; i++) array[i] = map.applyAsInt(this.nextInt());
return array;
}
public double[] nextDoubleArray(int length){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = this.nextDouble();
return array;
}
public double[] nextDoubleArray(int length, java.util.function.DoubleUnaryOperator map){
double[] array = new double[length];
for(int i=0; i<length; i++) array[i] = map.applyAsDouble(this.nextDouble());
return array;
}
public long[][] nextLongMatrix(int height, int width){
long[][] mat = new long[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextLong();
}
return mat;
}
public int[][] nextIntMatrix(int height, int width){
int[][] mat = new int[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextInt();
}
return mat;
}
public double[][] nextDoubleMatrix(int height, int width){
double[][] mat = new double[height][width];
for(int h=0; h<height; h++) for(int w=0; w<width; w++){
mat[h][w] = this.nextDouble();
}
return mat;
}
public char[][] nextCharMatrix(int height, int width){
char[][] mat = new char[height][width];
for(int h=0; h<height; h++){
String s = this.next();
for(int w=0; w<width; w++){
mat[h][w] = s.charAt(w);
}
}
return mat;
}
}
class ContestPrinter extends PrintWriter {
public ContestPrinter(PrintStream stream) {
super(stream);
}
public ContestPrinter() {
super(System.out);
}
private static String dtos(double x, int n) {
StringBuilder sb = new StringBuilder();
if (x < 0) {
sb.append('-');
x = -x;
}
x += Math.pow(10, -n) / 2;
sb.append((long) x);
sb.append(".");
x -= (long) x;
for (int i = 0; i < n; i++) {
x *= 10;
sb.append((int) x);
x -= (int) x;
}
return sb.toString();
}
@Override
public void print(float f) {
super.print(dtos(f, 20));
}
@Override
public void println(float f) {
super.println(dtos(f, 20));
}
@Override
public void print(double d) {
super.print(dtos(d, 20));
}
@Override
public void println(double d) {
super.println(dtos(d, 20));
}
public void printlnArray(String[] array) {
for (String i : array)
super.println(i);
}
public void printSpace(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++) {
super.print(o[i]);
super.print(" ");
}
super.println(o[n]);
}
public void println(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.println(o[n]);
}
public void printYN(boolean o) {
super.println(o ? "Yes" : "No");
}
public void print(Object... o) {
int n = o.length - 1;
for (int i = 0; i < n; i++)
super.print(o[i]);
super.print(o[n]);
}
public void printArray(Object[] array) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(" ");
}
super.println(array[n]);
}
public void printlnArray(Object[] array) {
for (Object i : array)
super.println(i);
}
public void printArray(int[] array, String separator) {
int n = array.length - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(int[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array) {
this.printArray(array, " ");
}
public void printArray(Integer[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(int[] array) {
for (int i : array)
super.println(i);
}
public void printArray(int[] array, String separator, java.util.function.IntUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsInt(array[i]));
super.print(separator);
}
super.println(map.applyAsInt(array[n]));
}
public void printlnArray(int[] array, java.util.function.IntUnaryOperator map) {
for (int i : array)
super.println(map.applyAsInt(i));
}
public void printlnArray(long[] array, java.util.function.LongUnaryOperator map) {
for (long i : array)
super.println(map.applyAsLong(i));
}
public void printArray(int[] array, java.util.function.IntUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(long[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printArray(long[] array) {
this.printArray(array, " ");
}
public void printlnArray(long[] array) {
for (long i : array)
super.println(i);
}
public void printArray(double[] array) {
printArray(array, " ");
}
public void printArray(double[] array, String separator) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(array[i]);
super.print(separator);
}
super.println(array[n]);
}
public void printlnArray(double[] array) {
for (double i : array)
super.println(i);
}
public void printArray(boolean[] array, String a, String b) {
int n = array.length - 1;
for (int i = 0; i < n; i++)
super.print((array[i] ? a : b) + " ");
super.println(array[n] ? a : b);
}
public void printArray(boolean[] array) {
this.printArray(array, "Y", "N");
}
public void printArray(char[] array) {
for (char c : array)
this.print(c);
this.println();
}
public void printArray(long[] array, String separator, java.util.function.LongUnaryOperator map) {
int n = array.length - 1;
for (int i = 0; i < n; i++) {
super.print(map.applyAsLong(array[i]));
super.print(separator);
}
super.println(map.applyAsLong(array[n]));
}
public void printArray(long[] array, java.util.function.LongUnaryOperator map) {
this.printArray(array, " ", map);
}
public void printArray(ArrayList<?> array) {
this.printArray(array, " ");
}
public void printArray(ArrayList<?> array, String separator) {
int n = array.size() - 1;
if (n == -1)
return;
for (int i = 0; i < n; i++) {
super.print(array.get(i).toString());
super.print(separator);
}
super.println(array.get(n).toString());
}
public void printlnArray(ArrayList<?> array) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(array.get(i).toString());
}
public void printlnArray(ArrayList<Integer> array, java.util.function.IntUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsInt(array.get(i)));
}
public void printlnArray(ArrayList<Long> array, java.util.function.LongUnaryOperator map) {
int n = array.size();
for (int i = 0; i < n; i++)
super.println(map.applyAsLong(array.get(i)));
}
public void printArray(int[][] array) {
for (int[] a : array)
this.printArray(a);
}
public void printArray(int[][] array, java.util.function.IntUnaryOperator map) {
for (int[] a : array)
this.printArray(a, map);
}
public void printArray(long[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] + " ");
super.println(array[i][m]);
}
}
public void printArray(long[][] array, java.util.function.LongUnaryOperator map) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
super.print(map.applyAsLong(array[i][j]));
super.print(" ");
}
super.println(map.applyAsLong(array[i][m]));
}
}
public void printArray(boolean[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length - 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j] ? "○ " : "× ");
super.println(array[i][m] ? "○" : "×");
}
}
public void printArray(char[][] array) {
int n = array.length;
if (n == 0)
return;
int m = array[0].length;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++)
super.print(array[i][j]);
super.println();
}
}
}
|
ConDefects/ConDefects/Code/arc172_a/Java/50422499
|
condefects-java_data_1793
|
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Arrays;
import java.util.Random;
public final class Main {
public static void main(String[] args) throws IOException {
final FastReader fs = new FastReader();
final int n = fs.nextInt();
final int[] arr = fs.nextIntArray(n);
int count = 0;
int prev = -1;
for (int i = 0; i < n; i++) {
count += arr[i] - prev - 1;
prev = arr[i];
}
System.out.println(count % 2 != 0 ? "Alice" : "Bob");
}
static final class Utils {
private static class Shuffler {
private static void shuffle(int[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
private static void shuffle(long[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
private static void swap(int[] x, int i, int j) {
final int t = x[i];
x[i] = x[j];
x[j] = t;
}
private static void swap(long[] x, int i, int j) {
final long t = x[i];
x[i] = x[j];
x[j] = t;
}
}
public static void shuffleSort(int[] arr) {
Shuffler.shuffle(arr);
Arrays.sort(arr);
}
public static void shuffleSort(long[] arr) {
Shuffler.shuffle(arr);
Arrays.sort(arr);
}
private Utils() {}
}
static class FastReader {
private static final int BUFFER_SIZE = 1 << 16;
private final DataInputStream din;
private final byte[] buffer;
private int bufferPointer, bytesRead;
FastReader() {
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
FastReader(String file_name) throws IOException {
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException {
final byte[] buf = new byte[1024]; // line length
int cnt = 0, c;
while ((c = read()) != -1) {
if (c == '\n') {
break;
}
buf[cnt++] = (byte) c;
}
return new String(buf, 0, cnt);
}
public int readSign() throws IOException {
byte c = read();
while ('+' != c && '-' != c) {
c = read();
}
return '+' == c ? 0 : 1;
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() throws IOException {
int b;
//noinspection StatementWithEmptyBody
while ((b = read()) != -1 && isSpaceChar(b)) {}
return b;
}
public char nc() throws IOException {
return (char) skip();
}
public String next() throws IOException {
int b = skip();
final StringBuilder sb = new StringBuilder();
while (!isSpaceChar(b)) { // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = read();
}
return sb.toString();
}
public int nextInt() throws IOException {
int ret = 0;
byte c = read();
while (c <= ' ') {
c = read();
}
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg) { return -ret; }
return ret;
}
public int[] nextIntArray(int n) throws IOException {
final int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public long nextLong() throws IOException {
long ret = 0;
byte c = read();
while (c <= ' ') { c = read(); }
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (neg) { return -ret; }
return ret;
}
public long[] nextLongArray(int n) throws IOException {
final long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public double nextDouble() throws IOException {
double ret = 0, div = 1;
byte c = read();
while (c <= ' ') { c = read(); }
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (c == '.') {
while ((c = read()) >= '0' && c <= '9') {
ret += (c - '0') / (div *= 10);
}
}
if (neg) { return -ret; }
return ret;
}
private void fillBuffer() throws IOException {
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1) { buffer[0] = -1; }
}
private byte read() throws IOException {
if (bufferPointer == bytesRead) { fillBuffer(); }
return buffer[bufferPointer++];
}
public void close() throws IOException {
din.close();
}
}
}
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Arrays;
import java.util.Random;
public final class Main {
public static void main(String[] args) throws IOException {
final FastReader fs = new FastReader();
final int n = fs.nextInt();
final int[] arr = fs.nextIntArray(n);
int count = 0;
int prev = -1;
for (int i = 0; i < n; i++) {
count += arr[i] - prev - 1;
prev = arr[i];
}
System.out.println(arr[n - 1] - arr[n - 2] > 1 || count % 2 != 0 ? "Alice" : "Bob");
}
static final class Utils {
private static class Shuffler {
private static void shuffle(int[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
private static void shuffle(long[] x) {
final Random r = new Random();
for (int i = 0; i <= x.length - 2; i++) {
final int j = i + r.nextInt(x.length - i);
swap(x, i, j);
}
}
private static void swap(int[] x, int i, int j) {
final int t = x[i];
x[i] = x[j];
x[j] = t;
}
private static void swap(long[] x, int i, int j) {
final long t = x[i];
x[i] = x[j];
x[j] = t;
}
}
public static void shuffleSort(int[] arr) {
Shuffler.shuffle(arr);
Arrays.sort(arr);
}
public static void shuffleSort(long[] arr) {
Shuffler.shuffle(arr);
Arrays.sort(arr);
}
private Utils() {}
}
static class FastReader {
private static final int BUFFER_SIZE = 1 << 16;
private final DataInputStream din;
private final byte[] buffer;
private int bufferPointer, bytesRead;
FastReader() {
din = new DataInputStream(System.in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
FastReader(String file_name) throws IOException {
din = new DataInputStream(new FileInputStream(file_name));
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public String readLine() throws IOException {
final byte[] buf = new byte[1024]; // line length
int cnt = 0, c;
while ((c = read()) != -1) {
if (c == '\n') {
break;
}
buf[cnt++] = (byte) c;
}
return new String(buf, 0, cnt);
}
public int readSign() throws IOException {
byte c = read();
while ('+' != c && '-' != c) {
c = read();
}
return '+' == c ? 0 : 1;
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() throws IOException {
int b;
//noinspection StatementWithEmptyBody
while ((b = read()) != -1 && isSpaceChar(b)) {}
return b;
}
public char nc() throws IOException {
return (char) skip();
}
public String next() throws IOException {
int b = skip();
final StringBuilder sb = new StringBuilder();
while (!isSpaceChar(b)) { // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = read();
}
return sb.toString();
}
public int nextInt() throws IOException {
int ret = 0;
byte c = read();
while (c <= ' ') {
c = read();
}
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
} while ((c = read()) >= '0' && c <= '9');
if (neg) { return -ret; }
return ret;
}
public int[] nextIntArray(int n) throws IOException {
final int[] res = new int[n];
for (int i = 0; i < n; i++) {
res[i] = nextInt();
}
return res;
}
public long nextLong() throws IOException {
long ret = 0;
byte c = read();
while (c <= ' ') { c = read(); }
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (neg) { return -ret; }
return ret;
}
public long[] nextLongArray(int n) throws IOException {
final long[] res = new long[n];
for (int i = 0; i < n; i++) {
res[i] = nextLong();
}
return res;
}
public double nextDouble() throws IOException {
double ret = 0, div = 1;
byte c = read();
while (c <= ' ') { c = read(); }
final boolean neg = c == '-';
if (neg) { c = read(); }
do {
ret = ret * 10 + c - '0';
}
while ((c = read()) >= '0' && c <= '9');
if (c == '.') {
while ((c = read()) >= '0' && c <= '9') {
ret += (c - '0') / (div *= 10);
}
}
if (neg) { return -ret; }
return ret;
}
private void fillBuffer() throws IOException {
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1) { buffer[0] = -1; }
}
private byte read() throws IOException {
if (bufferPointer == bytesRead) { fillBuffer(); }
return buffer[bufferPointer++];
}
public void close() throws IOException {
din.close();
}
}
}
|
ConDefects/ConDefects/Code/arc137_c/Java/30246002
|
condefects-java_data_1794
|
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int n = in.nextInt();
long[] a = in.nextLongArray(n);
if (Math.abs(a[n - 1] - a[n - 2]) >= 2) {
out.println("Bob");
} else {
if ((a[n - 1] - (n - 1)) % 2 == 0) {
out.println("Bob");
} else {
out.println("Alice");
}
}
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
}
import java.io.*;
import java.util.*;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
static In in = new FastIn();
static Out out = new Out(false);
static final long inf = 0x1fffffffffffffffL;
static final int iinf = 0x3fffffff;
static final double eps = 1e-9;
static long mod = 998244353;
void solve() {
int n = in.nextInt();
long[] a = in.nextLongArray(n);
if (Math.abs(a[n - 1] - a[n - 2]) >= 2) {
out.println("Alice");
} else {
if ((a[n - 1] - (n - 1)) % 2 == 0) {
out.println("Bob");
} else {
out.println("Alice");
}
}
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class FastIn extends In {
private final BufferedInputStream reader = new BufferedInputStream(System.in);
private final byte[] buffer = new byte[0x10000];
private int i = 0;
private int length = 0;
public int read() {
if (i == length) {
i = 0;
try {
length = reader.read(buffer);
} catch (IOException ignored) {
}
if (length == -1) {
return 0;
}
}
if (length <= i) {
throw new RuntimeException();
}
return buffer[i++];
}
String next() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
while ('!' <= b && b <= '~') {
builder.appendCodePoint(b);
b = read();
}
return builder.toString();
}
String nextLine() {
StringBuilder builder = new StringBuilder();
int b = read();
while (b != 0 && b != '\r' && b != '\n') {
builder.appendCodePoint(b);
b = read();
}
if (b == '\r') {
read();
}
return builder.toString();
}
int nextInt() {
long val = nextLong();
if ((int)val != val) {
throw new NumberFormatException();
}
return (int)val;
}
long nextLong() {
int b = read();
while (b < '!' || '~' < b) {
b = read();
}
boolean neg = false;
if (b == '-') {
neg = true;
b = read();
}
long n = 0;
int c = 0;
while ('0' <= b && b <= '9') {
n = n * 10 + b - '0';
b = read();
c++;
}
if (c == 0 || c >= 2 && n == 0) {
throw new NumberFormatException();
}
return neg ? -n : n;
}
}
class In {
private final BufferedReader reader = new BufferedReader(new InputStreamReader(System.in), 0x10000);
private StringTokenizer tokenizer;
String next() {
try {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
tokenizer = new StringTokenizer(reader.readLine());
}
} catch (IOException ignored) {
}
return tokenizer.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
char[] nextCharArray() {
return next().toCharArray();
}
String[] nextStringArray(int n) {
String[] s = new String[n];
for (int i = 0; i < n; i++) {
s[i] = next();
}
return s;
}
char[][] nextCharGrid(int n, int m) {
char[][] a = new char[n][m];
for (int i = 0; i < n; i++) {
a[i] = next().toCharArray();
}
return a;
}
int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
return a;
}
int[] nextIntArray(int n, IntUnaryOperator op) {
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsInt(nextInt());
}
return a;
}
int[][] nextIntMatrix(int h, int w) {
int[][] a = new int[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextIntArray(w);
}
return a;
}
long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = nextLong();
}
return a;
}
long[] nextLongArray(int n, LongUnaryOperator op) {
long[] a = new long[n];
for (int i = 0; i < n; i++) {
a[i] = op.applyAsLong(nextLong());
}
return a;
}
long[][] nextLongMatrix(int h, int w) {
long[][] a = new long[h][w];
for (int i = 0; i < h; i++) {
a[i] = nextLongArray(w);
}
return a;
}
List<List<Integer>> nextEdges(int n, int m, boolean directed) {
List<List<Integer>> res = new ArrayList<>();
for (int i = 0; i < n; i++) {
res.add(new ArrayList<>());
}
for (int i = 0; i < m; i++) {
int u = nextInt() - 1;
int v = nextInt() - 1;
res.get(u).add(v);
if (!directed) {
res.get(v).add(u);
}
}
return res;
}
}
class Out {
private final PrintWriter out = new PrintWriter(System.out);
private final PrintWriter err = new PrintWriter(System.err);
boolean autoFlush = false;
boolean enableDebug;
Out(boolean enableDebug) {
this.enableDebug = enableDebug;
}
void println(Object... args) {
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
out.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
if (autoFlush) {
out.flush();
}
}
void debug(Object... args) {
if (!enableDebug) {
return;
}
if (args == null || args.getClass() != Object[].class) {
args = new Object[] {args};
}
err.println(Arrays.stream(args).map(obj -> {
Class<?> clazz = obj == null ? null : obj.getClass();
return clazz == Double.class ? String.format("%.10f", obj) :
clazz == byte[].class ? Arrays.toString((byte[])obj) :
clazz == short[].class ? Arrays.toString((short[])obj) :
clazz == int[].class ? Arrays.toString((int[])obj) :
clazz == long[].class ? Arrays.toString((long[])obj) :
clazz == char[].class ? Arrays.toString((char[])obj) :
clazz == float[].class ? Arrays.toString((float[])obj) :
clazz == double[].class ? Arrays.toString((double[])obj) :
clazz == boolean[].class ? Arrays.toString((boolean[])obj) :
obj instanceof Object[] ? Arrays.deepToString((Object[])obj) :
String.valueOf(obj);
}).collect(Collectors.joining(" ")));
err.flush();
}
void println(char[] s) {
out.println(String.valueOf(s));
if (autoFlush) {
out.flush();
}
}
void println(int[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (int i : a) {
joiner.add(Integer.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void println(long[] a) {
StringJoiner joiner = new StringJoiner(" ");
for (long i : a) {
joiner.add(Long.toString(i));
}
out.println(joiner);
if (autoFlush) {
out.flush();
}
}
void flush() {
err.flush();
out.flush();
}
}
|
ConDefects/ConDefects/Code/arc137_c/Java/33751975
|
condefects-java_data_1795
|
import java.util.*;
@SuppressWarnings("unused")
public class Main {
private static void solve() {
int n = ni();
int[] a = na(n);
Arrays.sort(a);
if (a[n-1] - a[n-2] >= 2) {
System.out.println("Alice");
} else {
System.out.println(n % 2 == 0 ? "Alice" : "Bob");
}
}
public static void main(String[] args) {
new Thread(null, new Runnable() {
@Override
public void run() {
long start = System.currentTimeMillis();
String debug = args.length > 0 ? args[0] : null;
if (debug != null) {
try {
is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
} catch (Exception e) {
throw new RuntimeException(e);
}
}
reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
solve();
out.flush();
tr((System.currentTimeMillis() - start) + "ms");
}
}, "", 64000000).start();
}
private static java.io.InputStream is = System.in;
private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
private static java.util.StringTokenizer tokenizer = null;
private static java.io.BufferedReader reader;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new java.util.StringTokenizer(reader.readLine());
} catch (Exception e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private static double nd() {
return Double.parseDouble(next());
}
private static long nl() {
return Long.parseLong(next());
}
private static int[] na(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni();
return a;
}
private static char[] ns() {
return next().toCharArray();
}
private static long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nl();
return a;
}
private static int[][] ntable(int n, int m) {
int[][] table = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[i][j] = ni();
}
}
return table;
}
private static int[][] nlist(int n, int m) {
int[][] table = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[j][i] = ni();
}
}
return table;
}
private static int ni() {
return Integer.parseInt(next());
}
private static void tr(Object... o) {
if (is != System.in)
System.out.println(java.util.Arrays.deepToString(o));
}
}
import java.util.*;
@SuppressWarnings("unused")
public class Main {
private static void solve() {
int n = ni();
int[] a = na(n);
Arrays.sort(a);
if (a[n-1] - a[n-2] >= 2) {
System.out.println("Alice");
} else {
System.out.println((a[n-1] - n - 1) % 2 == 1 ? "Alice" : "Bob");
}
}
public static void main(String[] args) {
new Thread(null, new Runnable() {
@Override
public void run() {
long start = System.currentTimeMillis();
String debug = args.length > 0 ? args[0] : null;
if (debug != null) {
try {
is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
} catch (Exception e) {
throw new RuntimeException(e);
}
}
reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
solve();
out.flush();
tr((System.currentTimeMillis() - start) + "ms");
}
}, "", 64000000).start();
}
private static java.io.InputStream is = System.in;
private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
private static java.util.StringTokenizer tokenizer = null;
private static java.io.BufferedReader reader;
public static String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new java.util.StringTokenizer(reader.readLine());
} catch (Exception e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
private static double nd() {
return Double.parseDouble(next());
}
private static long nl() {
return Long.parseLong(next());
}
private static int[] na(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = ni();
return a;
}
private static char[] ns() {
return next().toCharArray();
}
private static long[] nal(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nl();
return a;
}
private static int[][] ntable(int n, int m) {
int[][] table = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[i][j] = ni();
}
}
return table;
}
private static int[][] nlist(int n, int m) {
int[][] table = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
table[j][i] = ni();
}
}
return table;
}
private static int ni() {
return Integer.parseInt(next());
}
private static void tr(Object... o) {
if (is != System.in)
System.out.println(java.util.Arrays.deepToString(o));
}
}
|
ConDefects/ConDefects/Code/arc137_c/Java/30247643
|
condefects-java_data_1796
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next(), T = sc.next();
sc.close();
for(int w = 1; w < S.length() - 1; w++) {
for(int c = 1; c <= w; c++) {
StringBuilder sb = new StringBuilder();
for(int i = 0; i < S.length(); i += w) {
String sub;
if(i + w >= S.length()) {
sub = S.substring(i);
}else {
sub = S.substring(i, i+w);
}
if(sub.length() >= c) {
sb.append(sub.charAt(c - 1));
System.out.println("sub : " + sb.toString());
}
}
if(sb.toString().equals(T)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String S = sc.next(), T = sc.next();
sc.close();
for(int w = 1; w < S.length() - 1; w++) {
for(int c = 1; c <= w; c++) {
StringBuilder sb = new StringBuilder();
for(int i = 0; i < S.length(); i += w) {
String sub;
if(i + w >= S.length()) {
sub = S.substring(i);
}else {
sub = S.substring(i, i+w);
}
if(sub.length() >= c) {
sb.append(sub.charAt(c - 1));
//System.out.println("sub : " + sb.toString());
}
}
if(sb.toString().equals(T)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
}
|
ConDefects/ConDefects/Code/abc360_b/Java/55109777
|
condefects-java_data_1797
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
static FastReader sc;
public static void main(String[] args) throws IOException {
sc = new FastReader();
String s = sc.next();
String t = sc.next();
for (int i = 1; i < s.length(); i++) {
for (int k = 0; k < i; k++) {
String tmp = "";
for (int j = 0+k; j-k+i < s.length(); j = j + i) {
tmp += s.substring(j, j + 1);
}
if (tmp.equals(t)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++)
res[i] = nextInt();
return res;
}
long[] readLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++)
res[i] = nextLong();
return res;
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
static FastReader sc;
public static void main(String[] args) throws IOException {
sc = new FastReader();
String s = sc.next();
String t = sc.next();
for (int i = 1; i < s.length(); i++) {
for (int k = 0; k < i; k++) {
String tmp = "";
for (int j = k; j+1 <= s.length(); j = j + i) {
tmp += s.substring(j, j + 1);
}
if (tmp.equals(t)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
int[] readIntArray(int n) {
int[] res = new int[n];
for (int i = 0; i < n; i++)
res[i] = nextInt();
return res;
}
long[] readLongArray(int n) {
long[] res = new long[n];
for (int i = 0; i < n; i++)
res[i] = nextLong();
return res;
}
}
}
|
ConDefects/ConDefects/Code/abc360_b/Java/55125386
|
condefects-java_data_1798
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String S = scan.next();
String T = scan.next();
// Divide the string into substrings of length w
for (int w = 1; w < S.length(); w++) {
for (int c = 0; c <= w; c++) {
String result = "";
// Concatenate the c-th character from each substring
for (int i = c; i < S.length(); i += w) {
result += S.substring(i,i+1);
}
if (result.equals(T)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String S = scan.next();
String T = scan.next();
// Divide the string into substrings of length w
for (int w = 1; w < S.length(); w++) {
for (int c = 0; c < w; c++) {
String result = "";
// Concatenate the c-th character from each substring
for (int i = c; i < S.length(); i += w) {
result += S.substring(i,i+1);
}
if (result.equals(T)) {
System.out.println("Yes");
return;
}
}
}
System.out.println("No");
}
}
|
ConDefects/ConDefects/Code/abc360_b/Java/55124201
|
condefects-java_data_1799
|
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int h = sc.nextInt();
int x = sc.nextInt();
int count = 0;
for (int i = 1; i <= n; i++) {
int p = sc.nextInt();
if (h+p >= x) count++;
}
System.out.println(count);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int h = sc.nextInt();
int x = sc.nextInt();
int count = 0;
for (int i = 1; i <= n; i++) {
int p = sc.nextInt();
if (h+p >= x) {count = i; break;}
}
System.out.println(count);
}
}
|
ConDefects/ConDefects/Code/abc317_a/Java/49171268
|
condefects-java_data_1800
|
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int h = sc.nextInt();
int x = sc.nextInt();
int[] p = new int[n];
for(int i=0; i<n; i++){
p[i] = sc.nextInt();
}
for(int i=0; i<n; i++){
if(h+p[i]>x){
System.out.println(i+1);
break;
}
}
}
}
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int h = sc.nextInt();
int x = sc.nextInt();
int[] p = new int[n];
for(int i=0; i<n; i++){
p[i] = sc.nextInt();
}
for(int i=0; i<n; i++){
if(h+p[i]>=x){
System.out.println(i+1);
break;
}
}
}
}
|
ConDefects/ConDefects/Code/abc317_a/Java/47200477
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.