id stringlengths 22 25 | content stringlengths 327 628k | max_stars_repo_path stringlengths 49 49 |
|---|---|---|
condefects-java_data_701 |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int matrix[][] = new int[9][9];
for(int i = 0; i < 9; i++) {
for(int j = 0; j < 9; j++) {
matrix[i][j] = sc.nextInt();
}
}
//col
for(int i = 0; i < 9; i++) {
Set<Integer> set = new HashSet<Integer>();
for(int j = 0; j < 9; j++) {
set.add(matrix[i][j]);
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
//row
for(int i = 0; i < 9; i++) {
Set<Integer> set = new HashSet<Integer>();
for(int j = 0; j < 9; j++) {
set.add(matrix[j][i]);
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
//square
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
Set<Integer> set = new HashSet<Integer>();
for(int k = 0; k < 3; k++) {
for(int l = 0; l < 3; l++) {
set.add(matrix[k][l]);
}
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
}
System.out.println("Yes");
}
}
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int matrix[][] = new int[9][9];
for(int i = 0; i < 9; i++) {
for(int j = 0; j < 9; j++) {
matrix[i][j] = sc.nextInt();
}
}
//col
for(int i = 0; i < 9; i++) {
Set<Integer> set = new HashSet<Integer>();
for(int j = 0; j < 9; j++) {
set.add(matrix[i][j]);
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
//row
for(int i = 0; i < 9; i++) {
Set<Integer> set = new HashSet<Integer>();
for(int j = 0; j < 9; j++) {
set.add(matrix[j][i]);
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
//square
for(int i = 0; i < 3; i++) {
for(int j = 0; j < 3; j++) {
Set<Integer> set = new HashSet<Integer>();
for(int k = 0; k < 3; k++) {
for(int l = 0; l < 3; l++) {
set.add(matrix[i *3 + k][j * 3 + l]);
}
}
if(set.size() != 9) {
System.out.println("No");
return;
}
}
}
System.out.println("Yes");
}
}
| ConDefects/ConDefects/Code/abc327_c/Java/47347559 |
condefects-java_data_702 | import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class Main {
public static void main(String[] args) {
Reader sc = new Reader();
int n = sc.nextInt();
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for(int i = 0; i < n - 1; ++i){
int x = sc.nextInt() - 1, y = sc.nextInt() - 1;
adj[x].add(y);
adj[y].add(x);
}
int root1 = bfs(adj, 0), root2 = bfs(adj, root1);
int[][] fa1 = new int[n][19], fa2 = new int[n][19];
for(int i = 0; i < n; ++i){
Arrays.fill(fa1[i], -1);
Arrays.fill(fa2[i], -1);
}
dfs(adj, fa1, root1, -1);
dfs(adj, fa2, root2, -1);
int q = sc.nextInt();
StringBuilder sb = new StringBuilder();
while (q-- > 0){
int u = sc.nextInt() - 1, k = sc.nextInt();
int ans = Math.max(getKthFather(fa1, u, k), getKthFather(fa2, u, k));
sb.append(ans >= 0? ans + 1: -1).append('\n');
}
System.out.print(sb);
}
static int bfs(List<Integer>[] adj, int root){
Queue<Integer> q = new LinkedList<>();
q.add(root);
boolean[] vis = new boolean[adj.length];
vis[root] = true;
int res = 0;
while (!q.isEmpty()){
int size = q.size();
while (size-- > 0){
res = q.poll();
for(int x: adj[res]){
if(!vis[x]){
vis[x] = true;
q.add(x);
}
}
}
}
return res;
}
static void dfs(List<Integer>[] adj, int[][] fa, int root, int f){
fa[root][0] = f;
for(int i = 1; i < 19 && fa[root][i - 1] > 0; ++i){
fa[root][i] = fa[fa[root][i - 1]][i - 1];
}
for(int x: adj[root]){
if(x == f) continue;
dfs(adj, fa, x, root);
}
}
static int getKthFather(int[][] fa, int cur, int k){
for(int i = 18; i >= 0 && cur >= 0; --i){
if((k & (1 << i)) > 0){
cur = fa[cur][i];
}
}
return cur;
}
}
class Reader{
InputStream stream = System.in;
byte[] buf = new byte[4096];
int cur = 0, len = 0;
int read(){
if(cur >= len){
try {
len = stream.read(buf);
cur = 0;
} catch (IOException e) {
return -1;
}
if(len <= 0){
return -1;
}
}
return buf[cur++];
}
int nextInt(){
int c = read();
while (c < '0' || c > '9') c = read();
int res = 0;
while (c >= '0' && c <= '9'){ res = res * 10 + c - '0'; c = read();}
return res;
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.*;
public class Main {
public static void main(String[] args) {
Reader sc = new Reader();
int n = sc.nextInt();
List<Integer>[] adj = new List[n];
for (int i = 0; i < n; i++) {
adj[i] = new ArrayList<>();
}
for(int i = 0; i < n - 1; ++i){
int x = sc.nextInt() - 1, y = sc.nextInt() - 1;
adj[x].add(y);
adj[y].add(x);
}
int root1 = bfs(adj, 0), root2 = bfs(adj, root1);
int[][] fa1 = new int[n][19], fa2 = new int[n][19];
for(int i = 0; i < n; ++i){
Arrays.fill(fa1[i], -1);
Arrays.fill(fa2[i], -1);
}
dfs(adj, fa1, root1, -1);
dfs(adj, fa2, root2, -1);
int q = sc.nextInt();
StringBuilder sb = new StringBuilder();
while (q-- > 0){
int u = sc.nextInt() - 1, k = sc.nextInt();
int ans = Math.max(getKthFather(fa1, u, k), getKthFather(fa2, u, k));
sb.append(ans >= 0? ans + 1: -1).append('\n');
}
System.out.print(sb);
}
static int bfs(List<Integer>[] adj, int root){
Queue<Integer> q = new LinkedList<>();
q.add(root);
boolean[] vis = new boolean[adj.length];
vis[root] = true;
int res = 0;
while (!q.isEmpty()){
int size = q.size();
while (size-- > 0){
res = q.poll();
for(int x: adj[res]){
if(!vis[x]){
vis[x] = true;
q.add(x);
}
}
}
}
return res;
}
static void dfs(List<Integer>[] adj, int[][] fa, int root, int f){
fa[root][0] = f;
for(int i = 1; i < 19 && fa[root][i - 1] >= 0; ++i){
fa[root][i] = fa[fa[root][i - 1]][i - 1];
}
for(int x: adj[root]){
if(x == f) continue;
dfs(adj, fa, x, root);
}
}
static int getKthFather(int[][] fa, int cur, int k){
for(int i = 18; i >= 0 && cur >= 0; --i){
if((k & (1 << i)) > 0){
cur = fa[cur][i];
}
}
return cur;
}
}
class Reader{
InputStream stream = System.in;
byte[] buf = new byte[4096];
int cur = 0, len = 0;
int read(){
if(cur >= len){
try {
len = stream.read(buf);
cur = 0;
} catch (IOException e) {
return -1;
}
if(len <= 0){
return -1;
}
}
return buf[cur++];
}
int nextInt(){
int c = read();
while (c < '0' || c > '9') c = read();
int res = 0;
while (c >= '0' && c <= '9'){ res = res * 10 + c - '0'; c = read();}
return res;
}
}
| ConDefects/ConDefects/Code/abc267_f/Java/37611551 |
condefects-java_data_703 |
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double b = sc.nextDouble();
double radi = Math.atan2(a, b);
double cos = Math.cos(radi);
double sin = Math.sin(radi);
System.out.printf("%.12f, %.12f",sin,cos);
sc.close();
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double b = sc.nextDouble();
double radi = Math.atan2(a, b);
double cos = Math.cos(radi);
double sin = Math.sin(radi);
System.out.printf("%.12f %.12f",sin,cos);
sc.close();
}
} | ConDefects/ConDefects/Code/abc246_b/Java/39835201 |
condefects-java_data_704 | 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 max = -1;//ใใใใชใๆฐๅญใ ใไปฃๅ
ฅ
int min = n + 1;
int[] strawX = new int[n];
int[] strawY = new int[n];
for(int i = 0;i < n;i++) {
int p = Integer.parseInt(sc.next());
int q = Integer.parseInt(sc.next());
strawX[i] = p;
strawY[i] = q;
}
int tate = sc.nextInt();//็ธฆใซ็ใๅๆฐ
int[] cutTate = new int[tate];
for(int i = 0;i < tate;i++) {
int a = sc.nextInt();
cutTate[i] = a;
}int yoko = sc.nextInt();//ๆจชใซ็ใๅๆฐ
int[] cutYoko = new int[yoko];
for(int i = 0;i < yoko;i++) {
int a = sc.nextInt();
cutYoko[i] = a;
}Map<Mass,Integer> map = new HashMap<>();
int count = 0;
for(int i = 0;i < n;i++) {
int a = Arrays.binarySearch(cutTate, strawX[i]);
int b = Arrays.binarySearch(cutYoko, strawY[i]);
Mass mass = new Mass(a,b);
//System.out.println("a,b" + a + " " + b);
if(!map.containsKey(mass)) {
map.put(mass, 1);
count++;
}else {
//System.out.println("mcheck");
map.put(mass, map.get(mass) + 1);
}
}if(count < n)min = 0;
for(Mass m:map.keySet()) {
if(map.get(m) > max) {
max = map.get(m);
}if(map.get(m) < min) {
min = map.get(m);
}
}System.out.print(min + " " + max);
}
public static class Mass implements Comparable<Mass>{
int x;
int y;
public Mass(int x,int y) {
this.x = x;
this.y = y;
}
@Override
public int compareTo(Mass a) {
// TODO ่ชๅ็ๆใใใใกใฝใใใปในใฟใ
if(this.x < a.x) {
return -1;
}if(this.x == a.x) {
return 0;
}return 1;
}@Override
public boolean equals(Object a) {
Mass m = (Mass)a;
if( this.x == m.x && this.y == m.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
int result = 53;
result = result * 37 + x;
result = result * 31 + y;
return result;
}
}
}
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 max = -1;//ใใใใชใๆฐๅญใ ใไปฃๅ
ฅ
int min = n + 1;
int[] strawX = new int[n];
int[] strawY = new int[n];
for(int i = 0;i < n;i++) {
int p = Integer.parseInt(sc.next());
int q = Integer.parseInt(sc.next());
strawX[i] = p;
strawY[i] = q;
}
int tate = sc.nextInt();//็ธฆใซ็ใๅๆฐ
int[] cutTate = new int[tate];
for(int i = 0;i < tate;i++) {
int a = sc.nextInt();
cutTate[i] = a;
}int yoko = sc.nextInt();//ๆจชใซ็ใๅๆฐ
int[] cutYoko = new int[yoko];
for(int i = 0;i < yoko;i++) {
int a = sc.nextInt();
cutYoko[i] = a;
}Map<Mass,Integer> map = new HashMap<>();
int count = 0;
for(int i = 0;i < n;i++) {
int a = Arrays.binarySearch(cutTate, strawX[i]);
int b = Arrays.binarySearch(cutYoko, strawY[i]);
Mass mass = new Mass(a,b);
//System.out.println("a,b" + a + " " + b);
if(!map.containsKey(mass)) {
map.put(mass, 1);
count++;
}else {
//System.out.println("mcheck");
map.put(mass, map.get(mass) + 1);
}
}if((long)count < (long)(tate + 1)* (long)(yoko + 1) )min = 0;
for(Mass m:map.keySet()) {
if(map.get(m) > max) {
max = map.get(m);
}if(map.get(m) < min) {
min = map.get(m);
}
}System.out.print(min + " " + max);
}
public static class Mass implements Comparable<Mass>{
int x;
int y;
public Mass(int x,int y) {
this.x = x;
this.y = y;
}
@Override
public int compareTo(Mass a) {
// TODO ่ชๅ็ๆใใใใกใฝใใใปในใฟใ
if(this.x < a.x) {
return -1;
}if(this.x == a.x) {
return 0;
}return 1;
}@Override
public boolean equals(Object a) {
Mass m = (Mass)a;
if( this.x == m.x && this.y == m.y) {
return true;
}
return false;
}
@Override
public int hashCode() {
int result = 53;
result = result * 37 + x;
result = result * 31 + y;
return result;
}
}
} | ConDefects/ConDefects/Code/abc304_d/Java/42179674 |
condefects-java_data_705 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
public final class Main {
private static final Scanner scanner;
private static final PrintWriter writer;
static {
scanner = new Scanner(System.in);
writer = new PrintWriter(System.out);
}
public static final void main(String[] args) {
final int W = getNextInt();
final int H = getNextInt();
final int N = getNextInt();
final int[][] PQ = get2dIntArray(N, 2);
final int NA = getNextInt();
final int[] A = new int[NA + 2];
for(int aIdx = 1; aIdx <= NA; aIdx++) {
A[aIdx] = getNextInt();
}
A[NA + 1] = W;
final int NB = getNextInt();
final int[] B = new int[NB + 2];
for(int bIdx = 1; bIdx <= NB; bIdx++) {
B[bIdx] = getNextInt();
}
B[NB + 1] = H;
int[][] berryPos = new int[N][2];
for(int i = 0; i < N; i++) {
int l = 0;
int r = NA + 1;
while(r - l > 1) {
int m = (r + l) / 2;
if(A[m] > PQ[i][0]) {
r = m;
} else {
l = m;
}
}
berryPos[i][0] = l;
l = 0;
r = NB + 1;
while(r - l > 1) {
int m = (r + l) / 2;
if(B[m] > PQ[i][1]) {
r = m;
} else {
l = m;
}
}
berryPos[i][1] = l;
}
Map<Integer, Map<Integer, Integer>> berryCount = new HashMap<>();
for(int i = 0; i < N; i++) {
berryCount.merge(berryPos[i][0], new HashMap<>(), (o, n) -> o).merge(berryPos[i][1], 1, (o, n) -> o + 1);
}
long entryCount = 0;
int berryMax = 0;
int berryMin = Integer.MAX_VALUE;
for(Map<Integer, Integer> e: berryCount.values()) {
for(int berry: e.values()) {
entryCount++;
berryMax = max(berryMax, berry);
berryMin = min(berryMin, berry);
}
}
if(entryCount < (NA + 1) * (NB + 1)) {
berryMin = 0;
}
println(berryMin + " " + berryMax);
flush();
}
private static final int max(int a, int b) {
return a < b ? b : a;
}
private static final int max(int... arg) {
return Arrays.stream(arg).max().orElse(0);
}
private static final int min(int a, int b) {
return a > b ? b : a;
}
private static final int min(int... arg) {
return Arrays.stream(arg).min().orElse(0);
}
private static final int abs(int x) {
return x < 0 ? -x : x;
}
private static final int pow(int x, int p) {
return p <= 0 ? 1 : x * pow(x, p - 1);
}
private static final long max(long a, long b) {
return a < b ? b : a;
}
private static final long max(long... arg) {
return Arrays.stream(arg).max().orElse(0);
}
private static final long min(long a, long b) {
return a > b ? b : a;
}
private static final long min(long... arg) {
return Arrays.stream(arg).min().orElse(0);
}
private static final long abs(long x) {
return x < 0L ? -x : x;
}
private static final long pow(long x, int p) {
return p <= 0 ? 1L : x * pow(x, p - 1);
}
private static final short max(short a, short b) {
return a < b ? b : a;
}
private static final short min(short a, short b) {
return a > b ? b : a;
}
private static final String getNext() {
return scanner.next();
}
private static final int getNextInt() {
return Integer.parseInt(scanner.next());
}
private static final long getNextLong() {
return Long.parseLong(scanner.next());
}
private static final double getNextDouble() {
return Double.parseDouble(scanner.next());
}
private static final int[] getIntArray(int length) {
int[] ret = new int[length];
for(int i = 0; i < length; i++) {
ret[i] = getNextInt();
}
return ret;
// return IntStream.generate(()->getNextInt()).limit(length).toArray();
}
private static final int[] getIntArray(int length, IntUnaryOperator mapper) {
int[] ret = new int[length];
for(int i = 0; i < length; i++) {
ret[i] = mapper.applyAsInt(getNextInt());
}
return ret;
// return IntStream.generate(()->getNextInt()).limit(length).map(mapper).toArray();
}
private static final int[][] get2dIntArray(int rows, int cols) {
int[][] ret = new int[rows][];
for(int i = 0; i < rows; i++) {
ret[i] = getIntArray(cols);
}
return ret;
// return Stream.generate(()->getIntArray(cols)).limit(rows).toArray(int[][]::new);
}
private static final int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
int[][] ret = new int[rows][];
for(int i = 0; i < rows; i++) {
ret[i] = getIntArray(cols, mapper);
}
return ret;
// return Stream.generate(()->getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static final void print(int[] argi) {
for(int i = 0, length = argi.length; i < length; i++) {
print(String.valueOf(argi[i]) + " ");
}
// Arrays.stream(argi).forEach(i->print(String.valueOf(i) + " "));
}
private static final void print(Object obj) {
writer.print(obj);
}
private static final void print(Object... arg) {
for(int i = 0, length = arg.length; i < length; i++) {
print(arg[i]);
}
// Arrays.stream(arg).forEach(obj->print(obj));
}
private static final void println(int[] argi) {
print(argi);
println();
}
private static final void println(Object obj) {
print(obj);
println();
}
private static final void println(Object... arg) {
print(arg);
println();
}
private static final void println() {
writer.println();
}
private static final void flush() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
public final class Main {
private static final Scanner scanner;
private static final PrintWriter writer;
static {
scanner = new Scanner(System.in);
writer = new PrintWriter(System.out);
}
public static final void main(String[] args) {
final int W = getNextInt();
final int H = getNextInt();
final int N = getNextInt();
final int[][] PQ = get2dIntArray(N, 2);
final int NA = getNextInt();
final int[] A = new int[NA + 2];
for(int aIdx = 1; aIdx <= NA; aIdx++) {
A[aIdx] = getNextInt();
}
A[NA + 1] = W;
final int NB = getNextInt();
final int[] B = new int[NB + 2];
for(int bIdx = 1; bIdx <= NB; bIdx++) {
B[bIdx] = getNextInt();
}
B[NB + 1] = H;
int[][] berryPos = new int[N][2];
for(int i = 0; i < N; i++) {
int l = 0;
int r = NA + 1;
while(r - l > 1) {
int m = (r + l) / 2;
if(A[m] > PQ[i][0]) {
r = m;
} else {
l = m;
}
}
berryPos[i][0] = l;
l = 0;
r = NB + 1;
while(r - l > 1) {
int m = (r + l) / 2;
if(B[m] > PQ[i][1]) {
r = m;
} else {
l = m;
}
}
berryPos[i][1] = l;
}
Map<Integer, Map<Integer, Integer>> berryCount = new HashMap<>();
for(int i = 0; i < N; i++) {
berryCount.merge(berryPos[i][0], new HashMap<>(), (o, n) -> o).merge(berryPos[i][1], 1, (o, n) -> o + 1);
}
long entryCount = 0;
int berryMax = 0;
int berryMin = Integer.MAX_VALUE;
for(Map<Integer, Integer> e: berryCount.values()) {
for(int berry: e.values()) {
entryCount++;
berryMax = max(berryMax, berry);
berryMin = min(berryMin, berry);
}
}
if(entryCount < (long)(NA + 1) * (NB + 1)) {
berryMin = 0;
}
println(berryMin + " " + berryMax);
flush();
}
private static final int max(int a, int b) {
return a < b ? b : a;
}
private static final int max(int... arg) {
return Arrays.stream(arg).max().orElse(0);
}
private static final int min(int a, int b) {
return a > b ? b : a;
}
private static final int min(int... arg) {
return Arrays.stream(arg).min().orElse(0);
}
private static final int abs(int x) {
return x < 0 ? -x : x;
}
private static final int pow(int x, int p) {
return p <= 0 ? 1 : x * pow(x, p - 1);
}
private static final long max(long a, long b) {
return a < b ? b : a;
}
private static final long max(long... arg) {
return Arrays.stream(arg).max().orElse(0);
}
private static final long min(long a, long b) {
return a > b ? b : a;
}
private static final long min(long... arg) {
return Arrays.stream(arg).min().orElse(0);
}
private static final long abs(long x) {
return x < 0L ? -x : x;
}
private static final long pow(long x, int p) {
return p <= 0 ? 1L : x * pow(x, p - 1);
}
private static final short max(short a, short b) {
return a < b ? b : a;
}
private static final short min(short a, short b) {
return a > b ? b : a;
}
private static final String getNext() {
return scanner.next();
}
private static final int getNextInt() {
return Integer.parseInt(scanner.next());
}
private static final long getNextLong() {
return Long.parseLong(scanner.next());
}
private static final double getNextDouble() {
return Double.parseDouble(scanner.next());
}
private static final int[] getIntArray(int length) {
int[] ret = new int[length];
for(int i = 0; i < length; i++) {
ret[i] = getNextInt();
}
return ret;
// return IntStream.generate(()->getNextInt()).limit(length).toArray();
}
private static final int[] getIntArray(int length, IntUnaryOperator mapper) {
int[] ret = new int[length];
for(int i = 0; i < length; i++) {
ret[i] = mapper.applyAsInt(getNextInt());
}
return ret;
// return IntStream.generate(()->getNextInt()).limit(length).map(mapper).toArray();
}
private static final int[][] get2dIntArray(int rows, int cols) {
int[][] ret = new int[rows][];
for(int i = 0; i < rows; i++) {
ret[i] = getIntArray(cols);
}
return ret;
// return Stream.generate(()->getIntArray(cols)).limit(rows).toArray(int[][]::new);
}
private static final int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
int[][] ret = new int[rows][];
for(int i = 0; i < rows; i++) {
ret[i] = getIntArray(cols, mapper);
}
return ret;
// return Stream.generate(()->getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static final void print(int[] argi) {
for(int i = 0, length = argi.length; i < length; i++) {
print(String.valueOf(argi[i]) + " ");
}
// Arrays.stream(argi).forEach(i->print(String.valueOf(i) + " "));
}
private static final void print(Object obj) {
writer.print(obj);
}
private static final void print(Object... arg) {
for(int i = 0, length = arg.length; i < length; i++) {
print(arg[i]);
}
// Arrays.stream(arg).forEach(obj->print(obj));
}
private static final void println(int[] argi) {
print(argi);
println();
}
private static final void println(Object obj) {
print(obj);
println();
}
private static final void println(Object... arg) {
print(arg);
println();
}
private static final void println() {
writer.println();
}
private static final void flush() {
writer.flush();
}
}
| ConDefects/ConDefects/Code/abc304_d/Java/42974089 |
condefects-java_data_706 | import java.awt.*;
import java.util.*;
public class Main{
public static void main(String...args) {
Scanner sc = new Scanner(System.in);
final int W = sc.nextInt(), H = sc.nextInt(), N = sc.nextInt();
ArrayList<Point> list = new ArrayList<>();
for (int i = 0; i < N; i++) {
list.add(new Point(sc.nextInt(),sc.nextInt()));
}
final int A=sc.nextInt();
ArrayList<Integer> xList=new ArrayList<>();
for(int i=0;i<A;i++){
xList.add(sc.nextInt());
}
xList.add(W);
final int B=sc.nextInt();
ArrayList<Integer> yList=new ArrayList<>();
for(int i=0;i<B;i++){
yList.add(sc.nextInt());
}
yList.add(H);
HashMap<Point,Integer> map=new HashMap<>();
HashSet<Point> set = new HashSet<>();
for(var p:list) {
int x = index(xList, p.x);
int y = index(yList, p.y);
Point point = new Point(x, y);
if (set.add(point)) {
map.put(point, 1);
} else {
map.put(point, map.get(point) + 1);
}
}
Iterator<Integer> ite = map.values().iterator();
int min=100100100,max=0;
while (ite.hasNext()){
int i=ite.next();
min=Math.min(min,i);
max=Math.max(max,i);
}
if((long)(A+1)*(B+1)>N)min=0;
System.out.println(min+" "+max);
}
private static int index(ArrayList<Integer> list,int i){
int[] range=new int[]{-1, list.size()};
while(range[1]-range[0]>1){
int index=(range[1]+range[0])/2;
if(list.get(index)<i){
range[0]=index;
}else if(i<list.get(index)){
range[1]=index;
}
}
return range[1];
}
}
import java.awt.*;
import java.util.*;
public class Main{
public static void main(String...args) {
Scanner sc = new Scanner(System.in);
final int W = sc.nextInt(), H = sc.nextInt(), N = sc.nextInt();
ArrayList<Point> list = new ArrayList<>();
for (int i = 0; i < N; i++) {
list.add(new Point(sc.nextInt(),sc.nextInt()));
}
final int A=sc.nextInt();
ArrayList<Integer> xList=new ArrayList<>();
for(int i=0;i<A;i++){
xList.add(sc.nextInt());
}
xList.add(W);
final int B=sc.nextInt();
ArrayList<Integer> yList=new ArrayList<>();
for(int i=0;i<B;i++){
yList.add(sc.nextInt());
}
yList.add(H);
HashMap<Point,Integer> map=new HashMap<>();
HashSet<Point> set = new HashSet<>();
for(var p:list) {
int x = index(xList, p.x);
int y = index(yList, p.y);
Point point = new Point(x, y);
if (set.add(point)) {
map.put(point, 1);
} else {
map.put(point, map.get(point) + 1);
}
}
Iterator<Integer> ite = map.values().iterator();
int min=100100100,max=0;
while (ite.hasNext()){
int i=ite.next();
min=Math.min(min,i);
max=Math.max(max,i);
}
if(((long)(A+1))*(B+1)>map.size())min=0;
System.out.println(min+" "+max);
}
private static int index(ArrayList<Integer> list,int i){
int[] range=new int[]{-1, list.size()};
while(range[1]-range[0]>1){
int index=(range[1]+range[0])/2;
if(list.get(index)<i){
range[0]=index;
}else if(i<list.get(index)){
range[1]=index;
}
}
return range[1];
}
}
| ConDefects/ConDefects/Code/abc304_d/Java/43781068 |
condefects-java_data_707 | import java.util.*;
import java.io.*;
// -------------------------Main class-------------------------
public class Main {
static long MOD = 1000000007;
// -------------------------Main function-------------------------
public static void main(String args[]) throws IOException {
FastReader sc = new FastReader();
PrintWriter pw = new PrintWriter(System.out);
int t = 1;
for (int i = 0; i < t; i++) {
int w = sc.nextInt();
int h = sc.nextInt();
int n = sc.nextInt();
int a[][] = new int[n][2];
for (int j = 0; j < n; j++) {
a[j][0] = sc.nextInt();
a[j][1] = sc.nextInt();
}
int xsize = sc.nextInt();
int x[] = new int[xsize + 1];
for (int j = 0; j < xsize; j++)
x[j] = sc.nextInt();
x[xsize] = w;
int ysize = sc.nextInt();
int y[] = new int[ysize + 1];
for (int j = 0; j < ysize; j++)
y[j] = sc.nextInt();
y[ysize] = h;
HashMap<Long, Integer> map = new HashMap<>();
for (int j = 0; j < n; j++) {
int currx = a[j][0];
int curry = a[j][1];
int l = 0;
int r = xsize;
int min_pos_x = 0;
while (l <= r) {
int mid = l + (r - l) / 2;
if (x[mid] > currx) {
min_pos_x = mid;
r = mid - 1;
} else
l = mid + 1;
}
l = 0;
r = ysize;
int min_pos_y = 0;
while (l <= r) {
int mid = l + (r - l) / 2;
if (y[mid] > curry) {
min_pos_y = mid;
r = mid - 1;
} else
l = mid + 1;
}
long value = 1l * (min_pos_x + 1) * (long) 1e6 + (min_pos_y + 1);
map.put(value, map.getOrDefault(value, 0) + 1);
}
int min = n;
int max = 0;
for (Map.Entry ele : map.entrySet()) {
min = Math.min(min, (int) ele.getValue());
max = Math.max(max, (int) ele.getValue());
}
if (map.size() < (xsize + 1) * (ysize + 1) * 1l)
min = 0;
pw.write(min + " " + max + "\n");
}
pw.flush();
pw.close();
}
// -------------------------Other functions-------------------------
// Time Complexity : log(n)
static long fast_power_mod(long n, long mod) {
long pow2 = 2;
long res = 1;
while (n > 0) {
if (n % 2 == 1)
res = (res % mod * pow2 % mod) % mod;
pow2 = (pow2 % mod * pow2 % mod) % mod;
n >>= 1;
}
return res;
}
// Time Complexity : n*r
static long nCrModpDP(long n, long r, long p) {
long c[] = new long[(int) r + 1];
c[0] = 1;
for (long j = 1; j <= n; j++) {
for (long k = Math.min(j, r); k > 0; k--)
c[(int) k] = (c[(int) k] % p + c[(int) k - 1] % p) % p;
}
return c[(int) r];
}
// Time Complexity : log(n)
static long nCrModpLucas(long n, long r, long p) {
if (r == 0)
return 1;
long ni = n % p;
long ri = r % p;
return (nCrModpLucas(n / p, r / p, p) % p * nCrModpDP(ni, ri, p) % p) % p;
}
// Time Complexity : log(mod)
static long inverseMOD(long x, long mod) {
if (mod == 0)
return 1;
if (mod % 2 == 1)
return (x * inverseMOD(x, mod - 1)) % MOD;
else
return inverseMOD((x * x) % MOD, mod / 2);
}
// Time Complexity : log(max(a,b))
static long bitwiseAND(long a, long b) {
long shiftcount = 0;
while (a != b && a > 0) {
shiftcount++;
a = a >> 1;
b = b >> 1;
}
return (long) (a << shiftcount);
}
// Time Complexity : n*m
static void dfs(int j, ArrayList<ArrayList<Integer>> al, boolean[] visited) {
visited[j] = true;
for (int x = 0; x < al.get(j).size(); x++) {
if (!visited[al.get(j).get(x)])
dfs(al.get(j).get(x), al, visited);
}
}
// Time Complexity : log(n) for composite numbers, n for prime numbers
static long getPrimeFactors(long n) {
int x = 2;
long count = 0;
// ArrayList<Integer> al=new ArrayList<>();
while (n > 1) {
if (n % x == 0) {
// if(!al.contains(x))
// al.add(x);
count++;
n /= x;
} else
x++;
}
return count;
}
// Time Complexity : log(n)
static ArrayList<Integer> primeFactorization(int x, int[] spf) {
HashMap<Integer, Integer> map = new HashMap<>();
ArrayList<Integer> al = new ArrayList<>();
while (x != 1) {
if (!al.contains(spf[x]))
al.add(spf[x]);
map.put(spf[x], map.getOrDefault(spf[x], 0) + 1);
x /= spf[x];
}
return al;
// return map;
}
// Time Complexity : n*10
static int[][] getBitMap(long[] a) {
int n = a.length;
int[][] bit_map = new int[n][32];
for (int j = 0; j < n; j++)
Arrays.fill(bit_map[j], 0);
for (int j = 0; j < n; j++) {
int counter = 0;
while (a[j] != 0) {
bit_map[j][counter] = (int) a[j] % 2;
a[j] /= 2;
counter++;
}
}
return bit_map;
}
// Time Complexity : n*log(log(n))
static ArrayList<Integer> sieveOfEratosthenes(int n) {
boolean prime[] = new boolean[n + 1];
for (int j = 0; j <= n; j++)
prime[j] = true;
for (long p = 2; p * p <= n; p++) {
if (prime[(int) p]) {
for (long j = p * p; j <= n; j += p)
prime[(int) j] = false;
}
}
ArrayList<Integer> hs = new ArrayList<>();
for (long j = 2; j <= n; j++) {
if (prime[(int) j])
hs.add((int) j);
}
return hs;
}
// Time Complexity : n
static boolean sortedIncreasing(long[] a) {
int f = 0;
for (int j = 1; j < a.length; j++) {
if (a[j] < a[j - 1])
f = 1;
}
return f == 0 ? true : false;
}
// Time Complexity : n
static boolean sortedDecreasing(int[] a) {
int f = 0;
for (int j = 1; j < a.length; j++) {
if (a[j] > a[j - 1])
f = 1;
}
return f == 0 ? true : false;
}
// Time Complexity : sqrt(n)
static ArrayList<Integer> getFactors(int n) {
ArrayList<Integer> al = new ArrayList<>();
// int count=0;
for (long i = 1; i * i <= n; i++) {
if (n % i == 0) {
al.add((int) i);
// count++;
if (n / i != i) {
al.add((int) (n / i));
// count++;
}
}
}
return al;
// return count;
}
// Time Complexity : n*log(n)
static void sort(int[] a) {
ArrayList<Integer> l = new ArrayList<>();
for (int i : a)
l.add(i);
Collections.sort(l);
for (int i = 0; i < a.length; i++)
a[i] = l.get(i);
}
// Time Complexity : n*log(n)
static void sort(long[] a) {
ArrayList<Long> l = new ArrayList<>();
for (long i : a)
l.add(i);
Collections.sort(l);
for (int i = 0; i < a.length; i++)
a[i] = l.get(i);
}
// Time Complexity : log(min(a,b))
static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
// Time Complexity : log(min(a,b))
static long gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
// Time Complexity : log(min(a,b))
static long lcm(long a, long b) {
return ((a / gcd(a, b)) * b);
}
// Time Complexity : log(min(a,b))
static long lcm(int a, int b) {
return ((a / gcd(a, b)) * b);
}
// Time Complexity : log(n)
static long floorSqrt(long x) {
if (x == 0 || x == 1)
return x;
long l = 1;
long r = (long) Math.sqrt(x) + 1;
long ans = 0;
while (l <= r) {
long mid = l + (r - l) / 2;
long curr = mid * mid;
if (curr == x)
return mid;
else if (curr > 0 && curr <= x) {
ans = mid;
l = mid + 1;
} else
r = mid - 1;
}
return ans;
}
// Time Complexity : log(n*logn)
static long getRemainderSum(long[] a, long totalsum, int x) {
long k = 0;
outer: for (int mul = x;; mul += x) {
int l = 0;
int r = a.length - 1;
int index = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (a[mid] >= mul) {
index = mid;
r = mid - 1;
} else
l = mid + 1;
}
if (index == -1)
break outer;
else
k += a.length - index;
}
return (totalsum - k * x);
}
// -------------------------Input class-------------------------
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;
}
}
}
// -------------------------Other classes-------------------------
class Pair {
int first = 0;
int second = 0;
// char first = 'a';
// int second = -1;
Pair(int x, int y) {
first = x;
second = y;
}
// Pair(char x, int y) {
// first = x;
// second = y;
// }
}
class NewComparatorPair implements Comparator<Pair> {
public int compare(Pair p1, Pair p2) {
if (p1.first != p2.first)
return Integer.compare(p1.first, p2.first);
else
return Integer.compare(p2.second, p1.second);
}
}
class NewComparatorArray implements Comparator<int[]> {
public int compare(int[] a, int[] b) {
if (a[0] != b[0])
return Integer.compare(a[0], b[0]);
else
return Integer.compare(b[1], a[1]);
}
}
import java.util.*;
import java.io.*;
// -------------------------Main class-------------------------
public class Main {
static long MOD = 1000000007;
// -------------------------Main function-------------------------
public static void main(String args[]) throws IOException {
FastReader sc = new FastReader();
PrintWriter pw = new PrintWriter(System.out);
int t = 1;
for (int i = 0; i < t; i++) {
int w = sc.nextInt();
int h = sc.nextInt();
int n = sc.nextInt();
int a[][] = new int[n][2];
for (int j = 0; j < n; j++) {
a[j][0] = sc.nextInt();
a[j][1] = sc.nextInt();
}
int xsize = sc.nextInt();
int x[] = new int[xsize + 1];
for (int j = 0; j < xsize; j++)
x[j] = sc.nextInt();
x[xsize] = w;
int ysize = sc.nextInt();
int y[] = new int[ysize + 1];
for (int j = 0; j < ysize; j++)
y[j] = sc.nextInt();
y[ysize] = h;
HashMap<Long, Integer> map = new HashMap<>();
for (int j = 0; j < n; j++) {
int currx = a[j][0];
int curry = a[j][1];
int l = 0;
int r = xsize;
int min_pos_x = 0;
while (l <= r) {
int mid = l + (r - l) / 2;
if (x[mid] > currx) {
min_pos_x = mid;
r = mid - 1;
} else
l = mid + 1;
}
l = 0;
r = ysize;
int min_pos_y = 0;
while (l <= r) {
int mid = l + (r - l) / 2;
if (y[mid] > curry) {
min_pos_y = mid;
r = mid - 1;
} else
l = mid + 1;
}
long value = 1l * (min_pos_x + 1) * (long) 1e6 + (min_pos_y + 1);
map.put(value, map.getOrDefault(value, 0) + 1);
}
int min = n;
int max = 0;
for (Map.Entry ele : map.entrySet()) {
min = Math.min(min, (int) ele.getValue());
max = Math.max(max, (int) ele.getValue());
}
if (map.size() < 1l * (xsize + 1) * (ysize + 1))
min = 0;
pw.write(min + " " + max + "\n");
}
pw.flush();
pw.close();
}
// -------------------------Other functions-------------------------
// Time Complexity : log(n)
static long fast_power_mod(long n, long mod) {
long pow2 = 2;
long res = 1;
while (n > 0) {
if (n % 2 == 1)
res = (res % mod * pow2 % mod) % mod;
pow2 = (pow2 % mod * pow2 % mod) % mod;
n >>= 1;
}
return res;
}
// Time Complexity : n*r
static long nCrModpDP(long n, long r, long p) {
long c[] = new long[(int) r + 1];
c[0] = 1;
for (long j = 1; j <= n; j++) {
for (long k = Math.min(j, r); k > 0; k--)
c[(int) k] = (c[(int) k] % p + c[(int) k - 1] % p) % p;
}
return c[(int) r];
}
// Time Complexity : log(n)
static long nCrModpLucas(long n, long r, long p) {
if (r == 0)
return 1;
long ni = n % p;
long ri = r % p;
return (nCrModpLucas(n / p, r / p, p) % p * nCrModpDP(ni, ri, p) % p) % p;
}
// Time Complexity : log(mod)
static long inverseMOD(long x, long mod) {
if (mod == 0)
return 1;
if (mod % 2 == 1)
return (x * inverseMOD(x, mod - 1)) % MOD;
else
return inverseMOD((x * x) % MOD, mod / 2);
}
// Time Complexity : log(max(a,b))
static long bitwiseAND(long a, long b) {
long shiftcount = 0;
while (a != b && a > 0) {
shiftcount++;
a = a >> 1;
b = b >> 1;
}
return (long) (a << shiftcount);
}
// Time Complexity : n*m
static void dfs(int j, ArrayList<ArrayList<Integer>> al, boolean[] visited) {
visited[j] = true;
for (int x = 0; x < al.get(j).size(); x++) {
if (!visited[al.get(j).get(x)])
dfs(al.get(j).get(x), al, visited);
}
}
// Time Complexity : log(n) for composite numbers, n for prime numbers
static long getPrimeFactors(long n) {
int x = 2;
long count = 0;
// ArrayList<Integer> al=new ArrayList<>();
while (n > 1) {
if (n % x == 0) {
// if(!al.contains(x))
// al.add(x);
count++;
n /= x;
} else
x++;
}
return count;
}
// Time Complexity : log(n)
static ArrayList<Integer> primeFactorization(int x, int[] spf) {
HashMap<Integer, Integer> map = new HashMap<>();
ArrayList<Integer> al = new ArrayList<>();
while (x != 1) {
if (!al.contains(spf[x]))
al.add(spf[x]);
map.put(spf[x], map.getOrDefault(spf[x], 0) + 1);
x /= spf[x];
}
return al;
// return map;
}
// Time Complexity : n*10
static int[][] getBitMap(long[] a) {
int n = a.length;
int[][] bit_map = new int[n][32];
for (int j = 0; j < n; j++)
Arrays.fill(bit_map[j], 0);
for (int j = 0; j < n; j++) {
int counter = 0;
while (a[j] != 0) {
bit_map[j][counter] = (int) a[j] % 2;
a[j] /= 2;
counter++;
}
}
return bit_map;
}
// Time Complexity : n*log(log(n))
static ArrayList<Integer> sieveOfEratosthenes(int n) {
boolean prime[] = new boolean[n + 1];
for (int j = 0; j <= n; j++)
prime[j] = true;
for (long p = 2; p * p <= n; p++) {
if (prime[(int) p]) {
for (long j = p * p; j <= n; j += p)
prime[(int) j] = false;
}
}
ArrayList<Integer> hs = new ArrayList<>();
for (long j = 2; j <= n; j++) {
if (prime[(int) j])
hs.add((int) j);
}
return hs;
}
// Time Complexity : n
static boolean sortedIncreasing(long[] a) {
int f = 0;
for (int j = 1; j < a.length; j++) {
if (a[j] < a[j - 1])
f = 1;
}
return f == 0 ? true : false;
}
// Time Complexity : n
static boolean sortedDecreasing(int[] a) {
int f = 0;
for (int j = 1; j < a.length; j++) {
if (a[j] > a[j - 1])
f = 1;
}
return f == 0 ? true : false;
}
// Time Complexity : sqrt(n)
static ArrayList<Integer> getFactors(int n) {
ArrayList<Integer> al = new ArrayList<>();
// int count=0;
for (long i = 1; i * i <= n; i++) {
if (n % i == 0) {
al.add((int) i);
// count++;
if (n / i != i) {
al.add((int) (n / i));
// count++;
}
}
}
return al;
// return count;
}
// Time Complexity : n*log(n)
static void sort(int[] a) {
ArrayList<Integer> l = new ArrayList<>();
for (int i : a)
l.add(i);
Collections.sort(l);
for (int i = 0; i < a.length; i++)
a[i] = l.get(i);
}
// Time Complexity : n*log(n)
static void sort(long[] a) {
ArrayList<Long> l = new ArrayList<>();
for (long i : a)
l.add(i);
Collections.sort(l);
for (int i = 0; i < a.length; i++)
a[i] = l.get(i);
}
// Time Complexity : log(min(a,b))
static long gcd(long a, long b) {
return b == 0 ? a : gcd(b, a % b);
}
// Time Complexity : log(min(a,b))
static long gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
// Time Complexity : log(min(a,b))
static long lcm(long a, long b) {
return ((a / gcd(a, b)) * b);
}
// Time Complexity : log(min(a,b))
static long lcm(int a, int b) {
return ((a / gcd(a, b)) * b);
}
// Time Complexity : log(n)
static long floorSqrt(long x) {
if (x == 0 || x == 1)
return x;
long l = 1;
long r = (long) Math.sqrt(x) + 1;
long ans = 0;
while (l <= r) {
long mid = l + (r - l) / 2;
long curr = mid * mid;
if (curr == x)
return mid;
else if (curr > 0 && curr <= x) {
ans = mid;
l = mid + 1;
} else
r = mid - 1;
}
return ans;
}
// Time Complexity : log(n*logn)
static long getRemainderSum(long[] a, long totalsum, int x) {
long k = 0;
outer: for (int mul = x;; mul += x) {
int l = 0;
int r = a.length - 1;
int index = -1;
while (l <= r) {
int mid = l + (r - l) / 2;
if (a[mid] >= mul) {
index = mid;
r = mid - 1;
} else
l = mid + 1;
}
if (index == -1)
break outer;
else
k += a.length - index;
}
return (totalsum - k * x);
}
// -------------------------Input class-------------------------
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;
}
}
}
// -------------------------Other classes-------------------------
class Pair {
int first = 0;
int second = 0;
// char first = 'a';
// int second = -1;
Pair(int x, int y) {
first = x;
second = y;
}
// Pair(char x, int y) {
// first = x;
// second = y;
// }
}
class NewComparatorPair implements Comparator<Pair> {
public int compare(Pair p1, Pair p2) {
if (p1.first != p2.first)
return Integer.compare(p1.first, p2.first);
else
return Integer.compare(p2.second, p1.second);
}
}
class NewComparatorArray implements Comparator<int[]> {
public int compare(int[] a, int[] b) {
if (a[0] != b[0])
return Integer.compare(a[0], b[0]);
else
return Integer.compare(b[1], a[1]);
}
} | ConDefects/ConDefects/Code/abc304_d/Java/42097133 |
condefects-java_data_708 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
long W = arr.get(0);
long H = arr.get(1);
long N = Integer.parseInt(bufferedReader.readLine());
List<ArrayList<Integer>> strawberries = new ArrayList<>((int) N);
for(int i = 0;i < N;i++){
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
ArrayList<Integer> item = new ArrayList<>(2);
item.add(arr.get(0));
item.add(arr.get(1));
strawberries.add(item);
}
long A = Integer.parseInt(bufferedReader.readLine());
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Integer[] xLines = new Integer[(int) A+2];
for(int i = 0;i < A;i++){
xLines[i] = arr.get(i);
}
xLines[(int) (A)] = 0;
xLines[(int) (A+1)] = Math.toIntExact(W);
long B = Integer.parseInt(bufferedReader.readLine());
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Integer[] yLines = new Integer[(int) B+2];
for(int i = 0;i < B;i++){
yLines[i] = arr.get(i);
}
yLines[(int) (B)] = 0;
yLines[(int) (B+1)] = Math.toIntExact(H);
Arrays.sort(xLines);
Arrays.sort(yLines);
Map<String,Long> map = new HashMap<>();
Map<Long,Long> countMap = new HashMap<>();
countMap.put((long)0,(A+1)*(B+1) );
long max = 0;
for(int i = 0; i < N;i++){
int x = strawberries.get(i).get(0);
int xInx = Arrays.binarySearch(xLines,x);
int y = strawberries.get(i).get(1);
int yInx = Arrays.binarySearch(yLines,y);
String key = Math.abs(xInx) + "#" + Math.abs(yInx);
map.put(key,map.getOrDefault(key,(long)0)+1);
max = Math.max(max,map.get(key));
long count = map.get(key);
countMap.put(count,countMap.getOrDefault(count,(long)0)+1);
countMap.put(count-1,countMap.get(count-1)-1);
}
long min = 0;
while (!countMap.containsKey(min)){
min ++;
}
System.out.println(min + " " + max);
bufferedReader.close();
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
import java.util.stream.Stream;
import static java.util.stream.Collectors.toList;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
List<Integer> arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
long W = arr.get(0);
long H = arr.get(1);
long N = Integer.parseInt(bufferedReader.readLine());
List<ArrayList<Integer>> strawberries = new ArrayList<>((int) N);
for(int i = 0;i < N;i++){
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
ArrayList<Integer> item = new ArrayList<>(2);
item.add(arr.get(0));
item.add(arr.get(1));
strawberries.add(item);
}
long A = Integer.parseInt(bufferedReader.readLine());
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Integer[] xLines = new Integer[(int) A+2];
for(int i = 0;i < A;i++){
xLines[i] = arr.get(i);
}
xLines[(int) (A)] = 0;
xLines[(int) (A+1)] = Math.toIntExact(W);
long B = Integer.parseInt(bufferedReader.readLine());
arr = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))
.map(Integer::parseInt)
.collect(toList());
Integer[] yLines = new Integer[(int) B+2];
for(int i = 0;i < B;i++){
yLines[i] = arr.get(i);
}
yLines[(int) (B)] = 0;
yLines[(int) (B+1)] = Math.toIntExact(H);
Arrays.sort(xLines);
Arrays.sort(yLines);
Map<String,Long> map = new HashMap<>();
Map<Long,Long> countMap = new HashMap<>();
countMap.put((long)0,(A+1)*(B+1) );
long max = 0;
for(int i = 0; i < N;i++){
int x = strawberries.get(i).get(0);
int xInx = Arrays.binarySearch(xLines,x);
int y = strawberries.get(i).get(1);
int yInx = Arrays.binarySearch(yLines,y);
String key = Math.abs(xInx) + "#" + Math.abs(yInx);
map.put(key,map.getOrDefault(key,(long)0)+1);
max = Math.max(max,map.get(key));
long count = map.get(key);
countMap.put(count,countMap.getOrDefault(count,(long)0)+1);
countMap.put(count-1,countMap.get(count-1)-1);
}
long min = 0;
while (countMap.getOrDefault(min,(long)0) == 0){
min ++;
}
System.out.println(min + " " + max);
bufferedReader.close();
}
}
| ConDefects/ConDefects/Code/abc304_d/Java/42237472 |
condefects-java_data_709 | import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n;
String strSi;
String strTi;
ArrayList<String> astrSi = new ArrayList<String>();
ArrayList<String> astrTi = new ArrayList<String>();
boolean[] ablnSiErr2;
boolean[] ablnTiErr2;
try (Scanner sc = new Scanner(System.in)) {
n = sc.nextInt();
ablnSiErr2 = new boolean[n];
ablnTiErr2 = new boolean[n];
for (int i = 0; i < n; i++) {
ablnSiErr2[i] = false;
ablnTiErr2[i] = false;
}
for (int i = 0; i < n; i++) {
strSi = sc.next();
strTi = sc.next();
for (int j = 0; j < astrSi.size(); j++) {
if (astrSi.get(j).equals(strSi)) {
ablnSiErr2[i] = true;
}
if (astrTi.get(j).equals(strSi)) {
ablnTiErr2[j] = true;
ablnSiErr2[i] = true;
}
if (astrSi.get(j).equals(strTi)) {
ablnSiErr2[j] = true;
ablnTiErr2[i] = true;
}
if (astrTi.get(j).equals(strTi)) {
ablnTiErr2[i] = true;
}
}
astrSi.add(strSi);
astrTi.add(strTi);
}
}
for (int i = 0; i < n; i++) {
if (ablnSiErr2[i] && ablnTiErr2[i]) {
System.out.print("No");
return;
}
}
System.out.print("Yes");
}
}
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
int n;
String strSi;
String strTi;
ArrayList<String> astrSi = new ArrayList<String>();
ArrayList<String> astrTi = new ArrayList<String>();
boolean[] ablnSiErr2;
boolean[] ablnTiErr2;
try (Scanner sc = new Scanner(System.in)) {
n = sc.nextInt();
ablnSiErr2 = new boolean[n];
ablnTiErr2 = new boolean[n];
for (int i = 0; i < n; i++) {
ablnSiErr2[i] = false;
ablnTiErr2[i] = false;
}
for (int i = 0; i < n; i++) {
strSi = sc.next();
strTi = sc.next();
for (int j = 0; j < astrSi.size(); j++) {
if (astrSi.get(j).equals(strSi)) {
ablnSiErr2[j] = true;
ablnSiErr2[i] = true;
}
if (astrTi.get(j).equals(strSi)) {
ablnTiErr2[j] = true;
ablnSiErr2[i] = true;
}
if (astrSi.get(j).equals(strTi)) {
ablnSiErr2[j] = true;
ablnTiErr2[i] = true;
}
if (astrTi.get(j).equals(strTi)) {
ablnTiErr2[j] = true;
ablnTiErr2[i] = true;
}
}
astrSi.add(strSi);
astrTi.add(strTi);
}
}
for (int i = 0; i < n; i++) {
if (ablnSiErr2[i] && ablnTiErr2[i]) {
System.out.print("No");
return;
}
}
System.out.print("Yes");
}
} | ConDefects/ConDefects/Code/abc247_b/Java/40764483 |
condefects-java_data_710 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String[] last = new String[n];
String[] first = new String[n];
Set<String> set = new HashSet<String>();
boolean judge =false,judge2=false;
for(int i=0;i<n;i++){
last[i] = scan.next();
first[i] = scan.next();
set.add((last[i]+" "+first[i]));
}
if(set.size()!=n){
System.out.println("No");
System.exit(0);
}
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(last[i].equals(last[j])||last[i].equals(first[j])) judge = true;
if(first[i].equals(first[j]) || first[i].equals(last[j])) judge =true;
}
}
if(!judge||!judge2) System.out.println("Yes");
else System.out.println("No");
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String[] last = new String[n];
String[] first = new String[n];
Set<String> set = new HashSet<String>();
boolean judge =false,judge2=false;
for(int i=0;i<n;i++){
last[i] = scan.next();
first[i] = scan.next();
set.add((last[i]+" "+first[i]));
}
if(set.size()!=n){
System.out.println("No");
System.exit(0);
}
for(int i=0;i<n-1;i++){
for(int j=i+1;j<n;j++){
if(last[i].equals(last[j])||last[i].equals(first[j])) judge = true;
if(first[i].equals(first[j]) || first[i].equals(last[j])) judge2 =true;
}
}
if(!judge||!judge2) System.out.println("Yes");
else System.out.println("No");
}
}
| ConDefects/ConDefects/Code/abc247_b/Java/38308882 |
condefects-java_data_711 | import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.HashMap;
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));
HashMap<String, Integer> map = new HashMap<>();
int n = Integer.parseInt(br.readLine());
String[][] names = new String[n][2];
for(int i = 0;i < n;i++){
StringTokenizer st = new StringTokenizer(br.readLine());
String first = st.nextToken();
String last = st.nextToken();
names[i][0] = first;
names[i][1] = last;
if(!map.containsKey(first)){
map.put(first, 0);
}
map.put(first, map.get(first) + 1);
if(!map.containsKey(last)){
map.put(last, 0);
}
map.put(last, map.get(last) + 1);
}
br.close();
for(String[] ns: names){
if(map.get(ns[0]) > 1 && map.get(ns[1]) > 1 ){
System.out.println("No");
return;
}
}
System.out.println("Yes");
}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.HashMap;
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));
HashMap<String, Integer> map = new HashMap<>();
int n = Integer.parseInt(br.readLine());
String[][] names = new String[n][2];
for(int i = 0;i < n;i++){
StringTokenizer st = new StringTokenizer(br.readLine());
String first = st.nextToken();
String last = st.nextToken();
names[i][0] = first;
names[i][1] = last;
if(!map.containsKey(first)){
map.put(first, 0);
}
map.put(first, map.get(first) + 1);
if(!map.containsKey(last)){
map.put(last, 0);
}
map.put(last, map.get(last) + 1);
}
br.close();
for(String[] ns: names){
if(map.get(ns[0]) > 1 && map.get(ns[1]) > 1 && !(ns[0].equals(ns[1]) && map.get(ns[0]) == 2)){
System.out.println("No");
return;
}
}
System.out.println("Yes");
}
}
| ConDefects/ConDefects/Code/abc247_b/Java/41127390 |
condefects-java_data_712 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
String[] sar = new String[t*2];
for(int i=0; i<sar.length; i+=2) {
sar[i] = sc.next();
sar[i+1] = sc.next();
}
for(int i=0; i<sar.length; i++) {
if(sar[i].equals("")) continue;
String temp = sar[i];
for(int j=i+2; j<sar.length; j++) {
if(temp.equals(sar[j])) {
sar[j] = "";
sar[i] = "";
}
}
}
String answer = "Yes";
for(int i=0; i<sar.length; i+=2) {
if(sar[i].equals("") && sar[i+1].equals("")) {
answer="no";
break;
}
}
System.out.println(answer);
}// ๋ฉ์ธ ๋
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
String[] sar = new String[t*2];
for(int i=0; i<sar.length; i+=2) {
sar[i] = sc.next();
sar[i+1] = sc.next();
}
for(int i=0; i<sar.length; i++) {
if(sar[i].equals("")) continue;
String temp = sar[i];
for(int j=i+2; j<sar.length; j++) {
if(temp.equals(sar[j])) {
sar[j] = "";
sar[i] = "";
}
}
}
String answer = "Yes";
for(int i=0; i<sar.length; i+=2) {
if(sar[i].equals("") && sar[i+1].equals("")) {
answer="No";
break;
}
}
System.out.println(answer);
}// ๋ฉ์ธ ๋
} | ConDefects/ConDefects/Code/abc247_b/Java/35810634 |
condefects-java_data_713 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
/**
* ่ฆๆฑ็ฌฌ x + 0.5 ็งๆญๆพ็ฌฌไธ้ฆๆญ็ๆฆ็
* ans = 1 / n * (p[x - t1 + 1] + ... + p[x - 1] + p[x])
* ไธๅผ่กจ็คบๅจ็ฌฌ x,x - 1 ,..., x - t1 + 1 ็งๅ็ๅๆญ
* ไน 1 / n ๆฏๅ ไธบๅๅฐ็ฌฌไธ้ฆๆญ็ๆฆ็ไธบ 1 / n
*
*
*/
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), x = sc.nextInt();
int[] t = new int[n];
for (int i = 0; i < n; i++) {
t[i] = sc.nextInt();
}
long v = pow(n, mod - 2);
long[] p = new long[x + 1];
//p[i] ่กจ็คบ็ฌฌ i ็งๅๆญ็ๅ ็
p[0] = 1;
for (int i = 1; i <= x; i++) {
for (int j = 0; j < n; j++) {
if (i >= t[j]) {
p[i] += p[i - t[j]];
}
}
p[i] = (p[i] * v) % mod;
}
long ans = 0;
for (int i = x; i >= 0 && i >= x - t[0] + 1; i--) {
ans += p[i] * v;
ans %= mod;
}
System.out.println(ans);
}
static int mod = 998244353;
static long pow(long a, long n) {
if (n == 0) return 1;
if (n % 2 == 0) return pow(a * a % mod, n / 2);
else return pow(a * a % mod, n / 2) * a % mod;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
/**
* ่ฆๆฑ็ฌฌ x + 0.5 ็งๆญๆพ็ฌฌไธ้ฆๆญ็ๆฆ็
* ans = 1 / n * (p[x - t1 + 1] + ... + p[x - 1] + p[x])
* ไธๅผ่กจ็คบๅจ็ฌฌ x,x - 1 ,..., x - t1 + 1 ็งๅ็ๅๆญ
* ไน 1 / n ๆฏๅ ไธบๅๅฐ็ฌฌไธ้ฆๆญ็ๆฆ็ไธบ 1 / n
*
*
*/
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), x = sc.nextInt();
int[] t = new int[n];
for (int i = 0; i < n; i++) {
t[i] = sc.nextInt();
}
long v = pow(n, mod - 2);
long[] p = new long[x + 1];
//p[i] ่กจ็คบ็ฌฌ i ็งๅๆญ็ๅ ็
p[0] = 1;
for (int i = 1; i <= x; i++) {
for (int j = 0; j < n; j++) {
if (i >= t[j]) {
p[i] += p[i - t[j]];
}
}
p[i] = (p[i] % mod * v) % mod;
}
long ans = 0;
for (int i = x; i >= 0 && i >= x - t[0] + 1; i--) {
ans += p[i] * v;
ans %= mod;
}
System.out.println(ans);
}
static int mod = 998244353;
static long pow(long a, long n) {
if (n == 0) return 1;
if (n % 2 == 0) return pow(a * a % mod, n / 2);
else return pow(a * a % mod, n / 2) * a % mod;
}
}
| ConDefects/ConDefects/Code/abc323_e/Java/46406282 |
condefects-java_data_714 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
/**
* ่ฆๆฑ็ฌฌ x + 0.5 ็งๆญๆพ็ฌฌไธ้ฆๆญ็ๆฆ็
* ans = 1 / n * (p[x - t1 + 1] + ... + p[x - 1] + p[x])
* ไธๅผ่กจ็คบๅจ็ฌฌ x,x - 1 ,..., x - t1 + 1 ็งๅ็ๅๆญ
* ไน 1 / n ๆฏๅ ไธบๅๅฐ็ฌฌไธ้ฆๆญ็ๆฆ็ไธบ 1 / n
*
*
*/
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), x = sc.nextInt();
int[] t = new int[n];
for (int i = 0; i < n; i++) {
t[i] = sc.nextInt();
}
long v = pow(n, mod - 2);
long[] p = new long[x + 1];
//p[i] ่กจ็คบ็ฌฌ i ็งๅๆญ็ๅ ็
p[0] = 1;
for (int i = 1; i <= x; i++) {
for (int j = 0; j < n; j++) {
if (i >= t[j]) {
p[i] += p[i - t[j]] * v;
}
}
p[i] %= mod;
}
long ans = 0;
for (int i = x; i >= 0 && i >= x - t[0] + 1; i--) {
ans += p[i] * v;
ans %= mod;
}
System.out.println(ans);
}
static int mod = 998244353;
static long pow(long a, long n) {
if (n == 0) return 1;
if (n % 2 == 0) return pow(a * a % mod, n / 2);
else return pow(a * a % mod, n / 2) * a % mod;
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
/**
* ่ฆๆฑ็ฌฌ x + 0.5 ็งๆญๆพ็ฌฌไธ้ฆๆญ็ๆฆ็
* ans = 1 / n * (p[x - t1 + 1] + ... + p[x - 1] + p[x])
* ไธๅผ่กจ็คบๅจ็ฌฌ x,x - 1 ,..., x - t1 + 1 ็งๅ็ๅๆญ
* ไน 1 / n ๆฏๅ ไธบๅๅฐ็ฌฌไธ้ฆๆญ็ๆฆ็ไธบ 1 / n
*
*
*/
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), x = sc.nextInt();
int[] t = new int[n];
for (int i = 0; i < n; i++) {
t[i] = sc.nextInt();
}
long v = pow(n, mod - 2);
long[] p = new long[x + 1];
//p[i] ่กจ็คบ็ฌฌ i ็งๅๆญ็ๅ ็
p[0] = 1;
for (int i = 1; i <= x; i++) {
for (int j = 0; j < n; j++) {
if (i >= t[j]) {
p[i] += p[i - t[j]] * v;
p[i] %= mod;
}
}
}
long ans = 0;
for (int i = x; i >= 0 && i >= x - t[0] + 1; i--) {
ans += p[i] * v;
ans %= mod;
}
System.out.println(ans);
}
static int mod = 998244353;
static long pow(long a, long n) {
if (n == 0) return 1;
if (n % 2 == 0) return pow(a * a % mod, n / 2);
else return pow(a * a % mod, n / 2) * a % mod;
}
}
| ConDefects/ConDefects/Code/abc323_e/Java/46406197 |
condefects-java_data_715 | 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();
System.out.println(a + " " + b);
sc.close();
long cnt = 0;
if( a < b) {
long tmp = b;
b = a;
a = tmp;
}
while(b > 0){
cnt += a / b;
a %= b;
System.out.println(a + " " + b);
long tmp = b;
b = a;
a = tmp;
}
System.out.println(cnt - 1);
}
}
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();
sc.close();
long cnt = 0;
if( a < b) {
long tmp = b;
b = a;
a = tmp;
}
while(b > 0){
cnt += a / b;
a %= b;
long tmp = b;
b = a;
a = tmp;
}
System.out.println(cnt - 1);
}
} | ConDefects/ConDefects/Code/abc297_d/Java/43164765 |
condefects-java_data_716 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ่ชๅ็ๆใใใใกใฝใใใปในใฟใ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
int maxRangeX = 0;
int maxRangeY = 0;
boolean[][] dpX = new boolean[20001][n + 1];
boolean[][] dpY = new boolean[20001][n + 1];
int a = sc.nextInt();
int whichXY = -1;
int lastX = 0;
int lastY = 0;
dpX[10000 + a][1] = true;
//dpX[10000 - a][1] = true;
dpY[10000][0] = true;
maxRangeX += a;
for(int i = 2;i < n + 1;i++) {
a = Integer.parseInt(sc.next());
switch(whichXY) {
case 1:
for(int j = 10000 - maxRangeX;j < 10001 + maxRangeX; j++) {
//System.out.println(dpX[j][i - 2]);
if(dpX[j][i - 2]) {
dpX[j + a][i] = true;
dpX[j - a][i] = true;
}
}maxRangeX += a;
whichXY *= (-1);
lastX = i;
break;
case -1:
for(int j = 10000 - maxRangeY;j < 10001 + maxRangeY; j++) {
if(dpY[j][i - 2]) {
//System.out.print("j" + j + "a" + a);
dpY[j + a][i] = true;
dpY[j - a][i] = true;
}
}
maxRangeY += a;
whichXY *= (-1);
lastY = i;
break;
}
}
System.out.print(dpX[10006][3]);
if(dpX[10000 + x][lastX] && dpY[10000 + y][lastY])System.out.print("Yes");
else System.out.print("No");
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO ่ชๅ็ๆใใใใกใฝใใใปในใฟใ
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int x = sc.nextInt();
int y = sc.nextInt();
int maxRangeX = 0;
int maxRangeY = 0;
boolean[][] dpX = new boolean[20001][n + 1];
boolean[][] dpY = new boolean[20001][n + 1];
int a = sc.nextInt();
int whichXY = -1;
int lastX = 0;
int lastY = 0;
dpX[10000 + a][1] = true;
//dpX[10000 - a][1] = true;
dpY[10000][0] = true;
maxRangeX += a;
for(int i = 2;i < n + 1;i++) {
a = Integer.parseInt(sc.next());
switch(whichXY) {
case 1:
for(int j = 10000 - maxRangeX;j < 10001 + maxRangeX; j++) {
//System.out.println(dpX[j][i - 2]);
if(dpX[j][i - 2]) {
dpX[j + a][i] = true;
dpX[j - a][i] = true;
}
}maxRangeX += a;
whichXY *= (-1);
lastX = i;
break;
case -1:
for(int j = 10000 - maxRangeY;j < 10001 + maxRangeY; j++) {
if(dpY[j][i - 2]) {
//System.out.print("j" + j + "a" + a);
dpY[j + a][i] = true;
dpY[j - a][i] = true;
}
}
maxRangeY += a;
whichXY *= (-1);
lastY = i;
break;
}
}
//System.out.print(dpX[10006][3]);
if(dpX[10000 + x][lastX] && dpY[10000 + y][lastY])System.out.print("Yes");
else System.out.print("No");
}
} | ConDefects/ConDefects/Code/abc274_d/Java/39786751 |
condefects-java_data_717 | import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.*;
import java.awt.Point;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.util.Comparator.*;
class Solver{
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";
Util util = new Util();
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long[][] T = in.lg(N,2);
Object solve(){
long ans = infL;
long sum = 0;
for (int i = 1;i +1 < N;i++)
sum += s(T[0],T[i],T[i +1]);
int b = 1;
long tmp = 0;
for (int a = 0;a < N;a++) {
while (tmp +s(T[a],T[b %N],T[(b +1) %N]) <= sum /4) {
tmp += s(T[a],T[b %N],T[(b +1) %N]);
b++;
}
ans = min(ans,abs(sum /4 -tmp));
ans = min(ans,abs(tmp +s(T[a],T[b %N],T[(b +1) %N]) -sum /4));
tmp -= s(T[a],T[(a +1) %N],T[b %N]);
}
// return sum;
return ans;
}
private long s(long[]... S){
long x1 = S[1][0] -S[0][0];
long y1 = S[1][1] -S[0][1];
long x2 = S[2][0] -S[0][0];
long y2 = S[2][1] -S[0][1];
return abs(x1 *y2 -x2 *y1) *4;
}
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
class Util{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
static int[][] trans(int[]... T){ return arr(new int[T[0].length][],i -> arrI(T.length,j -> T[j][i])); }
static int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
static long[][] trans(long[]... T){ return arr(new long[T[0].length][],i -> arrL(T.length,j -> T[j][i])); }
static double[][] trans(double[]... T){ return arr(new double[T[0].length][],i -> arrD(T.length,j -> T[j][i])); }
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
class MyReader{
byte[] buf = new byte[1 <<16];
int ptr = 0;
int tail = 0;
InputStream in;
MyReader(InputStream in){ this.in = in; }
byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
boolean isPrintable(byte c){ return 32 < c && c < 127; }
boolean isNum(byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
int it(){ return Math.toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return Util.arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return Util.arr(new String[N],i -> str()); }
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return Util.arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (Edge e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = Util.arr(new Edge[N][],i -> new Edge[c[i]]);
for (Edge e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
Edge rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj instanceof Collection<?>) {
Iterator<?> itr = ((Collection<?>) obj).iterator();
while (itr.hasNext()) {
print(itr.next());
if (itr.hasNext())
ln();
}
} else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
boolean ln = false;
if (0 < l) {
Object a = Array.get(obj,0);
ln = !(a instanceof char[]) && a.getClass().isArray();
}
for (int i = 0;i +1 < l;i++) {
print(Array.get(obj,i));
write((byte) (ln ? '\n' : ' '));
}
print(Array.get(obj,l -1));
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
print(obj);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(solver.util.elapsed());
}
}
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.*;
import java.awt.Point;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.util.Comparator.*;
class Solver{
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";
Util util = new Util();
Random rd = ThreadLocalRandom.current();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long[][] T = in.lg(N,2);
Object solve(){
long ans = infL <<1;
long sum = 0;
for (int i = 1;i +1 < N;i++)
sum += s(T[0],T[i],T[i +1]);
int b = 1;
long tmp = 0;
for (int a = 0;a < N;a++) {
while (tmp +s(T[a],T[b %N],T[(b +1) %N]) <= sum /4) {
tmp += s(T[a],T[b %N],T[(b +1) %N]);
b++;
}
ans = min(ans,abs(sum /4 -tmp));
ans = min(ans,abs(tmp +s(T[a],T[b %N],T[(b +1) %N]) -sum /4));
tmp -= s(T[a],T[(a +1) %N],T[b %N]);
}
// return sum;
return ans;
}
private long s(long[]... S){
long x1 = S[1][0] -S[0][0];
long y1 = S[1][1] -S[0][1];
long x2 = S[2][0] -S[0][0];
long y2 = S[2][1] -S[0][1];
return abs(x1 *y2 -x2 *y1) *4;
}
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
class Util{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
static int[][] trans(int[]... T){ return arr(new int[T[0].length][],i -> arrI(T.length,j -> T[j][i])); }
static int[][] addId(int[][] T){
return arr(new int[T.length][],i -> {
int[] t = copyOf(T[i],T[i].length +1);
t[t.length -1] = i;
return t;
});
}
static long[][] trans(long[]... T){ return arr(new long[T[0].length][],i -> arrL(T.length,j -> T[j][i])); }
static double[][] trans(double[]... T){ return arr(new double[T[0].length][],i -> arrD(T.length,j -> T[j][i])); }
static int[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
static long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
static double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
static <T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
}
class MyReader{
byte[] buf = new byte[1 <<16];
int ptr = 0;
int tail = 0;
InputStream in;
MyReader(InputStream in){ this.in = in; }
byte read(){
if (ptr == tail)
try {
tail = in.read(buf);
ptr = 0;
} catch (IOException e) {}
return buf[ptr++];
}
boolean isPrintable(byte c){ return 32 < c && c < 127; }
boolean isNum(byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
while (!isPrintable(ret))
ret = read();
return ret;
}
int it(){ return Math.toIntExact(lg()); }
int[] it(int N){ return Util.arrI(N,i -> it()); }
int[][] it(int H,int W){ return Util.arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return Util.arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return Util.arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return Util.arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return Util.arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return Util.arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return Util.arrD(N,i -> dbl()); }
double[][] dbl(int H,int W){ return Util.arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(int H){ return Util.arr(new char[H][],i -> ch()); }
String line(){
StringBuilder sb = new StringBuilder();
for (byte c;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return Util.arr(new String[N],i -> str()); }
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return Util.arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (Edge e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = Util.arr(new Edge[N][],i -> new Edge[c[i]]);
for (Edge e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
Edge rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj instanceof Collection<?>) {
Iterator<?> itr = ((Collection<?>) obj).iterator();
while (itr.hasNext()) {
print(itr.next());
if (itr.hasNext())
ln();
}
} else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
boolean ln = false;
if (0 < l) {
Object a = Array.get(obj,0);
ln = !(a instanceof char[]) && a.getClass().isArray();
}
for (int i = 0;i +1 < l;i++) {
print(Array.get(obj,i));
write((byte) (ln ? '\n' : ' '));
}
print(Array.get(obj,l -1));
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
print(obj);
ln();
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(solver.util.elapsed());
}
} | ConDefects/ConDefects/Code/abc250_f/Java/42006903 |
condefects-java_data_718 | import java.io.*;
import java.math.*;
import java.time.*;
import java.util.*;
import java.util.Map.Entry;
class Main implements Runnable {
public static void solve () {
int n = nextInt();
long[] x = new long[n], y = new long[n], p = new long[n];
for (int i=0; i<n; i++) {
x[i] = nextInt(); y[i] = nextInt(); p[i] = nextInt();
}
long ok = 2*infi+1, ng = 0;
while (Math.abs(ok - ng) > 1) {
long trainingNum = (ok+ng)/2;
//build graph
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) g.add(new ArrayList<>());
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if (i == j) continue;
//i->jใซ่พบใใฏใ
if (p[i]*trainingNum >= Math.abs(x[i]-x[j]) + Math.abs(y[i]-y[j])) {
g.get(i).add(j);
}
}
}
//ๅง็นใๅ
จๆข็ดข
boolean flag = false;
for (int i=0; i<n; i++) {
Set<Integer> seen = new HashSet<>();
seen.add(i);
Deque<Integer> q = new ArrayDeque<>();
q.add(i);
while (q.isEmpty() == false) {
int now = q.removeFirst();
for (int next : g.get(now)) {
if (seen.contains(next)) continue;
seen.add(next);
q.addLast(next);
}
}
if (seen.size() == n) {
flag = true;
break;
}
}
if (flag == true) ok = trainingNum;
else ng = trainingNum;
}
println(ok);
}
/*
* ############################################################################################
* # useful fields, useful methods, useful class
* ##############################################################################################
*/
// fields
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
// public static int[] dy = {-1, 0, 1, 0};
// public static int[] dx = {0, 1, 0, -1};
// public static int[] dy = {-1, 0, -1, 1, 0, 1};
// public static int[] dx = {-1, -1, 0, 0, 1, 1};
public static int[] dy = {-1, -1, -1, 0, 1, 1, 1, 0};
public static int[] dx = {-1, 0, 1, 1, 1, 0, -1, -1};
// methods
public static int min (int... a) {Arrays.sort(a); return a[0];}
public static int max (int... a) {Arrays.sort(a); return a[a.length-1];}
public static long min (long... a) {Arrays.sort(a); return a[0];}
public static long max (long... a) {Arrays.sort(a); return a[a.length-1];}
public static long pow (long c, long b) {
long res = 1;
for (int i=0; i<b; i++) {
res *= c;
}
return res;
}
// class
public static class Edge implements Comparable<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;
}
@Override public int compareTo (Edge e) {
return this.cost - e.cost;
}
}
public static class Point implements Comparable<Point> {
int x, y;
Point (int x, int y) {
this.x = x;
this.y = y;
}
@Override public int compareTo (Point p) {
return this.y - p.y;
}
@Override public boolean equals (Object o) {
Point p = (Point)o;
if (this.x == p.x && this.y == p.y) return true;
return false;
}
@Override public int hashCode () {
return y*(infi+1) + x;
}
}
/*
* ##############################################################################################
* # input
* ##############################################################################################
*/
// input - fields
public static final InputStream in = System.in;
public static final byte[] buffer = new byte[1024];
public static int ptr = 0;
public static int bufferLength = 0;
// input - basic methods
public static boolean hasNextByte() {
if (ptr < bufferLength) {
return true;
}
else {
ptr = 0;
try {
bufferLength = in.read(buffer);
}
catch (IOException e) {
e.printStackTrace();
}
if (bufferLength <= 0) {
return false;
}
}
return true;
}
public static int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
public static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public static void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
}
public static boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
// input - single
public static 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 static int nextInt() {
return (int) nextLong();
}
public static 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 static double nextDouble() {
return Double.parseDouble(next());
}
// input - array
public static String[] nextStringArray(int n) {
String[] array = new String[n];
for (int i = 0; i < n; i++) array[i] = next();
return array;
}
public static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) array[i] = nextInt();
return array;
}
public static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) array[i] = nextLong();
return array;
}
public static double[] nextDoubleArray(int n) {
double[] array = new double[n];
for (int i = 0; i < n; i++) {
array[i] = nextDouble();
}
return array;
}
// input - table
public static char[][] nextCharTable(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) array[i] = next().toCharArray();
return array;
}
public static int[][] nextIntTable(int h, int w) {
int[][] a = new int[h][];
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) a[i][j] = nextInt();
}
return a;
}
/*
* ##############################################################################################
* # output
* ##############################################################################################
*/
// output - fields
static PrintWriter out = new PrintWriter(System.out);
//output - single
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void debug(Object... o) {
for (int i=0; i<o.length; i++) {
System.out.print(o[i] + " ");
}
System.out.println("");
}
//output - array
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++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
/*
* ##############################################################################################
* # main
* ##############################################################################################
*/
public static void main(String[] args) {
new Thread(null, new Main(), "", 64 * 1024 * 1024).start();
}
public void run() {
solve();
out.close();
}
}
import java.io.*;
import java.math.*;
import java.time.*;
import java.util.*;
import java.util.Map.Entry;
class Main implements Runnable {
public static void solve () {
int n = nextInt();
long[] x = new long[n], y = new long[n], p = new long[n];
for (int i=0; i<n; i++) {
x[i] = nextInt(); y[i] = nextInt(); p[i] = nextInt();
}
long ok = 4L*infi+1, ng = 0;
while (Math.abs(ok - ng) > 1) {
long trainingNum = (ok+ng)/2;
//build graph
List<List<Integer>> g = new ArrayList<>();
for (int i=0; i<n; i++) g.add(new ArrayList<>());
for (int i=0; i<n; i++) {
for (int j=0; j<n; j++) {
if (i == j) continue;
//i->jใซ่พบใใฏใ
if (p[i]*trainingNum >= Math.abs(x[i]-x[j]) + Math.abs(y[i]-y[j])) {
g.get(i).add(j);
}
}
}
//ๅง็นใๅ
จๆข็ดข
boolean flag = false;
for (int i=0; i<n; i++) {
Set<Integer> seen = new HashSet<>();
seen.add(i);
Deque<Integer> q = new ArrayDeque<>();
q.add(i);
while (q.isEmpty() == false) {
int now = q.removeFirst();
for (int next : g.get(now)) {
if (seen.contains(next)) continue;
seen.add(next);
q.addLast(next);
}
}
if (seen.size() == n) {
flag = true;
break;
}
}
if (flag == true) ok = trainingNum;
else ng = trainingNum;
}
println(ok);
}
/*
* ############################################################################################
* # useful fields, useful methods, useful class
* ##############################################################################################
*/
// fields
public static final int infi = (int)1e9;
public static final long infl = (long)1e18;
public static final int modi = (int)1e9 + 7;
public static final long modl = (long)1e18 + 7;
// public static int[] dy = {-1, 0, 1, 0};
// public static int[] dx = {0, 1, 0, -1};
// public static int[] dy = {-1, 0, -1, 1, 0, 1};
// public static int[] dx = {-1, -1, 0, 0, 1, 1};
public static int[] dy = {-1, -1, -1, 0, 1, 1, 1, 0};
public static int[] dx = {-1, 0, 1, 1, 1, 0, -1, -1};
// methods
public static int min (int... a) {Arrays.sort(a); return a[0];}
public static int max (int... a) {Arrays.sort(a); return a[a.length-1];}
public static long min (long... a) {Arrays.sort(a); return a[0];}
public static long max (long... a) {Arrays.sort(a); return a[a.length-1];}
public static long pow (long c, long b) {
long res = 1;
for (int i=0; i<b; i++) {
res *= c;
}
return res;
}
// class
public static class Edge implements Comparable<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;
}
@Override public int compareTo (Edge e) {
return this.cost - e.cost;
}
}
public static class Point implements Comparable<Point> {
int x, y;
Point (int x, int y) {
this.x = x;
this.y = y;
}
@Override public int compareTo (Point p) {
return this.y - p.y;
}
@Override public boolean equals (Object o) {
Point p = (Point)o;
if (this.x == p.x && this.y == p.y) return true;
return false;
}
@Override public int hashCode () {
return y*(infi+1) + x;
}
}
/*
* ##############################################################################################
* # input
* ##############################################################################################
*/
// input - fields
public static final InputStream in = System.in;
public static final byte[] buffer = new byte[1024];
public static int ptr = 0;
public static int bufferLength = 0;
// input - basic methods
public static boolean hasNextByte() {
if (ptr < bufferLength) {
return true;
}
else {
ptr = 0;
try {
bufferLength = in.read(buffer);
}
catch (IOException e) {
e.printStackTrace();
}
if (bufferLength <= 0) {
return false;
}
}
return true;
}
public static int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
public static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public static void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
}
public static boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
// input - single
public static 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 static int nextInt() {
return (int) nextLong();
}
public static 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 static double nextDouble() {
return Double.parseDouble(next());
}
// input - array
public static String[] nextStringArray(int n) {
String[] array = new String[n];
for (int i = 0; i < n; i++) array[i] = next();
return array;
}
public static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) array[i] = nextInt();
return array;
}
public static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) array[i] = nextLong();
return array;
}
public static double[] nextDoubleArray(int n) {
double[] array = new double[n];
for (int i = 0; i < n; i++) {
array[i] = nextDouble();
}
return array;
}
// input - table
public static char[][] nextCharTable(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) array[i] = next().toCharArray();
return array;
}
public static int[][] nextIntTable(int h, int w) {
int[][] a = new int[h][];
for (int i=0; i<h; i++) {
for (int j=0; j<w; j++) a[i][j] = nextInt();
}
return a;
}
/*
* ##############################################################################################
* # output
* ##############################################################################################
*/
// output - fields
static PrintWriter out = new PrintWriter(System.out);
//output - single
public static void print(Object o) {out.print(o);}
public static void println(Object o) {out.println(o);}
public static void debug(Object... o) {
for (int i=0; i<o.length; i++) {
System.out.print(o[i] + " ");
}
System.out.println("");
}
//output - array
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++) {
if (j != 0) print(" ");
print(a[i][j]);
}
println("");
}
}
/*
* ##############################################################################################
* # main
* ##############################################################################################
*/
public static void main(String[] args) {
new Thread(null, new Main(), "", 64 * 1024 * 1024).start();
}
public void run() {
solve();
out.close();
}
} | ConDefects/ConDefects/Code/abc257_d/Java/40536118 |
condefects-java_data_719 | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.function.IntFunction;
import java.util.function.Predicate;
public class Main{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
final MyReader in = new MyReader(System.in);
final MyWriter out = new MyWriter(System.out);
final MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
public static void main(final String[] args){ new Main().exe(); }
private void exe(){
input();
preCalc();
// solve();
out.println(solve());
out.flush();
log.println(elapsed());
}
int N = in.it();
long[][] J = in.lg(N,3);
private void input(){
for (int i = 0;i < N;i++) {
J[i][0]--;
J[i][1]--;
}
}
private void preCalc(){}
long solve(){
return bSearch(infI *10,0,s -> {
int[][] len = new int[N][N];
for (var le:len)
Arrays.fill(le,infI);
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
if (J[i][2] *s >= Math.abs(J[i][0] -J[j][0]) +Math.abs(J[i][1] -J[j][1]))
len[i][j] = 0;
for (int k = 0;k < N;k++)
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
len[i][j] = Math.min(len[i][j],len[i][k] +len[k][j]);
for (int i = 0;i < N;i++) {
boolean clear = true;
for (int j = 0;j < N;j++)
if (0 < len[i][j]) {
clear = false;
break;
}
if (clear)
return true;
}
return false;
});
}
long bSearch(final long s,final long e,final Predicate<Long> judge){
if (Math.abs(s -e) < 2)
return s;
final long c = (s +e) /2;
return judge.test(c) ? bSearch(c,e,judge) : bSearch(s,c,judge);
}
static class UnionFind{
final int[] par;
final int[] size;
public UnionFind(final int n){
par = new int[n];
Arrays.setAll(par,i -> i);
size = new int[n];
Arrays.fill(size,1);
}
int root(final int x){ return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(final int u,final int v){ return root(u) == root(v); }
void merge(final int x,final int y){
int px = root(x);
int py = root(y);
if (px == py)
return;
if (size[px] < size[py]) {
final int t = px;
px = py;
py = t;
}
par[py] = px;
size[px] += size[py];
}
int size(final int x){ return size[root(x)]; }
}
/* ๅฎๆฐ */
final static int infI = (int) 1e9;
final static long infL = (long) 1e18;
// final static long mod = (int) 1e9 +7;
final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
/* Util */
void swap(final int[] arr,final int i,final int j){
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
void swap(final long[] arr,final int i,final int j){
long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
/* ๅ
ฅๅ */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(final InputStream in){ this.in = in; }
byte read(){
if (head == tail) {
try {
tail = in.read(buf);
} catch (IOException e) {
e.printStackTrace();
}
head = 0;
}
return buf[head++];
}
boolean isPrintable(final byte c){ return 32 < c && c < 127; }
boolean isNum(final byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
return isPrintable(ret) ? ret : nextPrintable();
}
int it(){ return (int) lg(); }
int[] it(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }
int[][] trans(final int[][] mat){
int[][] ret = new int[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(final int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }
long[][] trans(final long[][] mat){
long[][] ret = new long[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(final int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
public double[][] dbl(final int H,final int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }
char[][] trans(final char[][] mat){
char[][] ret = new char[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
String line(){
StringBuilder sb = new StringBuilder();
byte c;
while (isPrintable(c = read()) || c == ' ')
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
byte c;
while (isPrintable(c = read()))
sb.append((char) c);
return sb.toString();
}
String[] str(final int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(final T[] arr,final IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
}
/* ๅบๅ */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(final OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
void sp(){ write((byte) ' '); }
void ln(){ write((byte) '\n'); }
void write(final byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(final byte[] b,final int off,final int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
void println(final boolean b){ println(b ? yes : no); }
void println(final long n){
write(n);
ln();
}
public void println(final double d){ println(String.valueOf(d)); }
void println(final String s){
for (byte b:s.getBytes())
write(b);
ln();
}
public void println(final char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(final int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(final long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.function.IntFunction;
import java.util.function.Predicate;
public class Main{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
final MyReader in = new MyReader(System.in);
final MyWriter out = new MyWriter(System.out);
final MyWriter log = new MyWriter(System.err){
@Override
void ln(){
super.ln();
flush();
};
};
public static void main(final String[] args){ new Main().exe(); }
private void exe(){
input();
preCalc();
// solve();
out.println(solve());
out.flush();
log.println(elapsed());
}
int N = in.it();
long[][] J = in.lg(N,3);
private void input(){
for (int i = 0;i < N;i++) {
J[i][0]--;
J[i][1]--;
}
}
private void preCalc(){}
long solve(){
return bSearch(infI *10L,0,s -> {
int[][] len = new int[N][N];
for (var le:len)
Arrays.fill(le,infI);
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
if (J[i][2] *s >= Math.abs(J[i][0] -J[j][0]) +Math.abs(J[i][1] -J[j][1]))
len[i][j] = 0;
for (int k = 0;k < N;k++)
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
len[i][j] = Math.min(len[i][j],len[i][k] +len[k][j]);
for (int i = 0;i < N;i++) {
boolean clear = true;
for (int j = 0;j < N;j++)
if (0 < len[i][j]) {
clear = false;
break;
}
if (clear)
return true;
}
return false;
});
}
long bSearch(final long s,final long e,final Predicate<Long> judge){
if (Math.abs(s -e) < 2)
return s;
final long c = (s +e) /2;
return judge.test(c) ? bSearch(c,e,judge) : bSearch(s,c,judge);
}
static class UnionFind{
final int[] par;
final int[] size;
public UnionFind(final int n){
par = new int[n];
Arrays.setAll(par,i -> i);
size = new int[n];
Arrays.fill(size,1);
}
int root(final int x){ return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(final int u,final int v){ return root(u) == root(v); }
void merge(final int x,final int y){
int px = root(x);
int py = root(y);
if (px == py)
return;
if (size[px] < size[py]) {
final int t = px;
px = py;
py = t;
}
par[py] = px;
size[px] += size[py];
}
int size(final int x){ return size[root(x)]; }
}
/* ๅฎๆฐ */
final static int infI = (int) 1e9;
final static long infL = (long) 1e18;
// final static long mod = (int) 1e9 +7;
final static long mod = 998244353;
final static String yes = "Yes";
final static String no = "No";
/* Util */
void swap(final int[] arr,final int i,final int j){
int t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
void swap(final long[] arr,final int i,final int j){
long t = arr[i];
arr[i] = arr[j];
arr[j] = t;
}
/* ๅ
ฅๅ */
static class MyReader{
byte[] buf = new byte[1 <<16];
int head = 0;
int tail = 0;
InputStream in;
public MyReader(final InputStream in){ this.in = in; }
byte read(){
if (head == tail) {
try {
tail = in.read(buf);
} catch (IOException e) {
e.printStackTrace();
}
head = 0;
}
return buf[head++];
}
boolean isPrintable(final byte c){ return 32 < c && c < 127; }
boolean isNum(final byte c){ return 47 < c && c < 58; }
byte nextPrintable(){
byte ret = read();
return isPrintable(ret) ? ret : nextPrintable();
}
int it(){ return (int) lg(); }
int[] it(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> it());
return a;
}
int[][] it(final int H,final int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(final int N){
int[] a = new int[N];
Arrays.setAll(a,i -> idx());
return a;
}
int[][] idx(final int H,final int W){ return arr(new int[H][],i -> idx(W)); }
int[][] trans(final int[][] mat){
int[][] ret = new int[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(final int N){
long[] a = new long[N];
Arrays.setAll(a,i -> lg());
return a;
}
long[][] lg(final int H,final int W){ return arr(new long[H][],i -> lg(W)); }
long[][] trans(final long[][] mat){
long[][] ret = new long[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(final int N){
double[] a = new double[N];
Arrays.setAll(a,i -> dbl());
return a;
}
public double[][] dbl(final int H,final int W){ return arr(new double[H][],i -> dbl(W)); }
char[] ch(){ return str().toCharArray(); }
char[][] ch(final int H){ return arr(new char[H][],i -> ch()); }
char[][] trans(final char[][] mat){
char[][] ret = new char[mat[0].length][mat.length];
for (int i = 0;i < mat.length;i++)
for (int j = 0;j < mat[0].length;j++)
ret[j][i] = mat[i][j];
return ret;
}
String line(){
StringBuilder sb = new StringBuilder();
byte c;
while (isPrintable(c = read()) || c == ' ')
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
byte c;
while (isPrintable(c = read()))
sb.append((char) c);
return sb.toString();
}
String[] str(final int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(final T[] arr,final IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
}
/* ๅบๅ */
static class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
public MyWriter(final OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
void sp(){ write((byte) ' '); }
void ln(){ write((byte) '\n'); }
void write(final byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
void write(final byte[] b,final int off,final int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
void println(final boolean b){ println(b ? yes : no); }
void println(final long n){
write(n);
ln();
}
public void println(final double d){ println(String.valueOf(d)); }
void println(final String s){
for (byte b:s.getBytes())
write(b);
ln();
}
public void println(final char[] s){
for (char b:s)
write((byte) b);
ln();
}
void println(final int[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
void println(final long[] a){
for (int i = 0;i < a.length;i++) {
if (0 < i)
sp();
write(a[i]);
}
ln();
}
}
}
| ConDefects/ConDefects/Code/abc257_d/Java/37107573 |
condefects-java_data_720 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
MyPoint[] points = new MyPoint[n];
for(int i = 0; i < n; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int p = sc.nextInt();
points[i] = new MyPoint(x, y, p);
}
long dist[][] = warshallFloyd(points);
long minMaxDist = INF;
for(int i = 0; i < n; i++) {
long tmp = 0;
for(int j = 0; j < n; j++) {
tmp = Math.max(tmp, dist[i][j]);
}
minMaxDist = Math.min(minMaxDist, tmp);
}
System.out.println((long)Math.ceil(minMaxDist));
}
static long INF = 1_000_000_000_000L;
static long[][] warshallFloyd(MyPoint[] points){
int n = points.length;
long[][] dist = new long[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i == j){
dist[i][j] = 0;
}
else {
dist[i][j] = (long)Math.ceil((double)points[i].dist(points[j]) / points[i].power);
}
}
}
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(dist[i][k] == INF || dist[k][j] == INF){
continue;
}
dist[i][j] = Math.min(dist[i][j], Math.max(dist[i][k], dist[k][j]));
}
}
}
return dist;
}
}
class MyPoint {
int x;
int y;
int power;
MyPoint(int x, int y, int power){
this.x = x;
this.y = y;
this.power = power;
}
long dist(MyPoint p) {
return Math.abs(this.x - p.x) + Math.abs(this.y - p.y);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
MyPoint[] points = new MyPoint[n];
for(int i = 0; i < n; i++) {
int x = sc.nextInt();
int y = sc.nextInt();
int p = sc.nextInt();
points[i] = new MyPoint(x, y, p);
}
long dist[][] = warshallFloyd(points);
long minMaxDist = INF;
for(int i = 0; i < n; i++) {
long tmp = 0;
for(int j = 0; j < n; j++) {
tmp = Math.max(tmp, dist[i][j]);
}
minMaxDist = Math.min(minMaxDist, tmp);
}
System.out.println((long)Math.ceil(minMaxDist));
}
static long INF = 1_000_000_000_000L;
static long[][] warshallFloyd(MyPoint[] points){
int n = points.length;
long[][] dist = new long[n][n];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i == j){
dist[i][j] = 0;
}
else {
dist[i][j] = (long)Math.ceil((double)points[i].dist(points[j]) / points[i].power);
}
}
}
for(int k = 0; k < n; k++){
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(dist[i][k] == INF || dist[k][j] == INF){
continue;
}
dist[i][j] = Math.min(dist[i][j], Math.max(dist[i][k], dist[k][j]));
}
}
}
return dist;
}
}
class MyPoint {
int x;
int y;
int power;
MyPoint(int x, int y, int power){
this.x = x;
this.y = y;
this.power = power;
}
long dist(MyPoint p) {
return (long)Math.abs(this.x - p.x) + Math.abs(this.y - p.y);
}
} | ConDefects/ConDefects/Code/abc257_d/Java/38564719 |
condefects-java_data_721 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.*;
public class Main {
public static void main(String[] args) {
Solver.SOLVE();
}
}
class UnionFind {
private int[] roots;
public UnionFind(int n){
roots = new int[n];
for (int i = 0; i < n; i++) {
roots[i] = i;
}
}
public int root(int x){
if(roots[x] == x){
return x;
}
return roots[x] = root(roots[x]);
}
public void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
return;
}
roots[rx] = ry;
}
public boolean same(int x,int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
int x = leader(a);
int y = leader(b);
if (x == y) return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("" + a);
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(ArrayList::isEmpty);
return result;
}
}
class PairL implements Comparable<PairL>, Comparator<PairL> {
public long x,y;
public PairL(long x,long y) {
this.x = x;
this.y = y;
}
public void swap(){
long t = x;
x = y;
y = t;
}
@Override
public int compare(PairL o1, PairL o2) {
return o1.compareTo(o2);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairL pairl = (PairL) o;
return x == pairl.x && y == pairl.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
public PairL add(PairL p){
return new PairL(x+p.x,y+p.y);
}
@Override
public int compareTo(PairL o) {
return Long.compare(x,o.x);
}
}
class PairI implements Comparable<PairI>, Comparator<PairI> {
public int x,y;
public PairI(int x,int y) {
this.x = x;
this.y = y;
}
public void swap(){
int t = x;
x = y;
y = t;
}
@Override
public int compare(PairI o1, PairI o2) {
if(o1.x == o2.x){
return Integer.compare(o1.y,o2.y);
}
return Integer.compare(o1.x,o2.x);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return x == pairI.x && y == pairI.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public int compareTo(PairI o) {
if(x == o.x){
return Integer.compare(y,o.y);
}
return Integer.compare(x,o.x);
}
public PairI add(PairI p){
return new PairI(x+p.x,y+p.y);
}
public PairI sub(PairI p){
return new PairI(x-p.x,y-p.y);
}
public PairI addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new PairI(x,y);
}
return null;
}
}
class PairISet{
int x,y;
PairISet(int x,int y){
this.x = x;
this.y = y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return (x == pairI.x && y == pairI.y)||(x == pairI.y && y == pairI.x);
}
}
class Line{
//ax+bx+c=0
long a,b,c;
public Line(int x0, int y0, int x1, int y1) {
long dx = x1-x0;
long dy = y1-y0;
long gcd = Solver.gcd(dx,dy);
dx/=gcd;
dy/=gcd;
if(dx < 0){
dx=-dx;
dy=-dy;
}
if(dx == 0 && dy < 0){
dy=-dy;
}
a = dy;
b = -dx;
c = dx*y0-dy*x0;
}
public boolean onLine(int x,int y){
return a*x + b*y + c == 0;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Line line = (Line) o;
return a == line.a && b == line.b && c == line.c;
}
@Override
public int hashCode() {
return Objects.hash(a, b, c);
}
}
class Dist extends PairI{
int d;
public Dist(int x,int y,int d){
super(x,y);
this.d = d;
}
public Dist addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new Dist(x,y,d+1);
}
return null;
}
}
class Tuple implements Comparable<Tuple>{
public int x,y,z;
public Tuple(int x, int y, int z) {
this.x = x;
this.y = y;
this.z = z;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Tuple three = (Tuple) o;
return x == three.x && y == three.y && z == three.z;
}
@Override
public int hashCode() {
return Objects.hash(x, y, z);
}
@Override
public int compareTo(Tuple o) {
return Integer.compare(z,o.z);
}
}
class Edge implements Comparable<Edge>{
public int from;
public int to;
public int name;
public long d;
public Edge(int to){
this.to = to;
}
public Edge(int to, long d){
this.to = to;
this.d = d;
}
public Edge setName(int name){
this.name = name;
return this;
}
public Edge(int from, int to, long d){
this.to = to;
this.from = from;
this.d = d;
}
@Override
public int compareTo(Edge o) {
return Long.compare(d,o.d);
}
}
class PairC{
char a,b;
public PairC(char a, char b){
this.a = a;
this.b = b;
}
}
class IB{
int i;
boolean b;
IB(int i,boolean b){
this.i = i;
this.b = b;
}
}
class CI{
char c;
int i;
CI(char c,int i){
this.c = c;
this.i = i;
}
}
class SortedMultiSet extends TreeMap<Integer,Integer>{
public void add(int a){
put(a,getOrDefault(a,0)+1);
}
public void remove(int a){
if(get(a) == 1){
super.remove(a);
}else{
put(a,get(a)-1);
}
}
}
class Solver {
public static final int MOD1 = 1000000007;
public static final int MOD9 = 998244353;
public static Scanner sc = new Scanner(System.in);
public static final int inf = 2000000000;
public static final int ninf = -inf;
public static final char[] alpha = "abcdefghijklmnopqrstuvwxyz".toCharArray();
public static final char[] ALPHA = "abcdefghijklmnopqrstuvwxyz".toUpperCase().toCharArray();
public static FastScanner fs = new FastScanner();
public static PrintWriter out = new PrintWriter(System.out);
public static final PairI[] move = new PairI[]{new PairI(1,0),new PairI(0,1),new PairI(-1,0),new PairI(0,-1)};
public static void solve(){
int n = rI();
long[] x = new long[n];
long[] y = new long[n];
long[] p = new long[n];
for (int i = 0; i < n; i++) {
x[i] = rL();
y[i] = rL();
p[i] = rL();
}
long ng = 0;
long ok = Long.MAX_VALUE;
long[][] dist = new long[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dist[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]);
}
}
while (abs(ok-ng)>1){
long mid = (ok+ng)/2;
boolean isok = false;
ArrayList<ArrayList<Integer>> e = new ArrayList<>();
for (int i = 0; i < n; i++) {
e.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if(i == j) continue;
if(p[i]*mid >= dist[i][j]){
e.get(i).add(j);
}
}
}
out:for (int i = 0; i < n; i++) {
ArrayDeque<Integer> q = new ArrayDeque<>();
boolean[] went = new boolean[n];
went[i] = true;
q.add(i);
while (!q.isEmpty()){
int v = q.poll();
for(int next:e.get(v)){
if(went[next]) continue;
went[next] = true;
q.add(next);
}
}
for (int j = 0; j < n; j++) {
if(!went[j]) continue out;
}
isok = true;
break;
}
if(isok) ok = mid;
else ng = mid;
}
oL(ok);
}
static void dfs(int now,int before,ArrayList<ArrayList<Integer>> e,boolean[] went){
went[now] = true;
for(int next:e.get(now)){
if(went[next]) continue;
dfs(next,now,e,went);
}
}
static int standingBits(long n){
String bits = toBits(n);
int ans = 0;
for (int i = 0; i < bits.length(); i++) {
if(bits.charAt(i) == '1'){
ans++;
}
}
return ans;
}
static boolean contain(String s,char c){
for (int i = 0; i < s.length(); i++) {
if(s.charAt(i) == c){
return true;
}
}
return false;
}
static String toBits(long n){
StringBuilder ans = new StringBuilder();
while (n > 0){
ans.append(n%2);
n/=2;
}
return ans.reverse().toString();
}
static long toLong(String anss){
long ansi = 0;
for (int i = 0; i < anss.length(); i++) {
if(anss.charAt(i) == '1'){
ansi += (1L<<(anss.length()-1-i));
}
}
return ansi;
}
static int perfectPowNum(long n){
int res = 0;
double range = Math.log(n)/Math.log(2);
range++;
for (int i = 2; i < range; i++) {
long a = (long) Math.pow(n,1d/i);
if(pow(a,i) == n||pow(a+1,i)==n){
res++;
}
}
return res;
}
static boolean[] eratosthenes(int n){
boolean[] res = new boolean[n+1];
for (int i = 2; i <= n; i++) {
res[i] = true;
}
for (int i = 2; i <= n; i++) {
if(res[i]){
int k = i*2;
while (k <= n){
res[k] = false;
k+=i;
}
}
}
return res;
}
static BitSet and(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.and(set2);
return ans;
}
static BitSet or(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.or(set2);
return ans;
}
static BitSet xor(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.xor(set2);
return ans;
}
static BitSet toBitset(long n){
return BitSet.valueOf(new long[]{n});
}
static long toLong(BitSet set){
if(set.length() > 63) {
throw new IllegalArgumentException();
}
if(set.length() == 0){
return 0;
}
return set.toLongArray()[0];
}
static int deg(long x){
return String.valueOf(x).length();
}
static int nthdeg(long x,int d){
x/=pow(10,d);
return (int)(x%10);
}
static boolean isPalindrome(int a,int b,String s){
int dif = b-a;
boolean ok = true;
for (int i = 0; i < dif; i++) {
if (s.charAt(i + a) != s.charAt(b - i)) {
ok = false;
break;
}
}
return ok;
}
static int intValue(char c){
return Integer.parseInt(String.valueOf(c));
}
@SuppressWarnings("unchecked")
static class SegTree<T>{
T[] data;
int size;
BinaryOperator<T> op;
T e;
int inisize;
SegTree(T[] a,BinaryOperator<T> op,T e){
size = 1;
inisize = a.length;
while (size < a.length){
size <<= 1;
}
this.e = e;
this.op = op;
data = (T[])new Object[size*2];
Arrays.fill(data,e);
System.arraycopy(a,0,data,size,a.length);
for (int i = size-1; i > 0; i--) {
data[i] = op.apply(data[i*2],data[i*2+1]);
}
}
void update(int i,T x){
if(i < 0) throw new IllegalArgumentException();
i += size;
data[i] = x;
while (i > 1){
data[i >> 1] = op.apply(data[i],data[i^1]);
i >>= 1;
}
}
T query(int l,int r){
if(l < 0) throw new IllegalArgumentException();
if(r < 0) throw new IllegalArgumentException();
T res = e;
l += size;
r += size;
while (l < r){
if((l & 1) == 1) {
res = op.apply(res,data[l]);
l++;
}
if((r & 1) == 1){
res = op.apply(res,data[r-1]);
}
l >>= 1;
r >>= 1;
}
return res;
}
int maxRight(int l,Predicate<T> pr){
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if(l == inisize) return l;
l+=size;
T sum = e;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!pr.test(op.apply(sum, data[l]))) {
while (l < size) {
l = l << 1;
if (pr.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - size;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return inisize;
}
public int minLeft(int r,Predicate<T> pr) {
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if (r == 0) {
return 0;
}
r += size;
T sum = e;
do {
r--;
while (r > 1 && (r & 1) == 1) {
r >>= 1;
}
if (!pr.test(op.apply(data[r], sum))) {
while (r < size) {
r = r << 1 | 1;
if (pr.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - size;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
}
public static int toIntC(char c){
for (int i = 0; i < ALPHA.length; i++) {
if(c == ALPHA[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static int toInt(char c){
for (int i = 0; i < alpha.length; i++) {
if(c == alpha[i]){
return i;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static void reverse(int[] a){
int[] tmp = a.clone();
for (int i = 0; i < a.length; i++) {
a[i] = tmp[a.length - 1 - i];
}
}
public static int[] compress(int[] a){
int[] ans = new int[a.length];
int[] b = erase(a);
Arrays.sort(b);
for (int i = 0; i < a.length; i++) {
ans[i] = lower(b,a[i]);
}
return ans;
}
public static int lower(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int lower(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int upper(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int upper(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int[] erase(int[] a){
HashSet<Integer> used = new HashSet<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < a.length; i++) {
if(!used.contains(a[i])){
used.add(a[i]);
ans.add(a[i]);
}
}
return convI(ans);
}
public static int abs(int a){
return Math.abs(a);
}
public static long abs(long a){
return Math.abs(a);
}
public static int max(int a,int b){
return Math.max(a,b);
}
public static int max(int... a){
int max = Integer.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static long max(long a,long b){
return Math.max(a,b);
}
public static long max(long... a){
long max = Long.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static int min(int a,int b){
return Math.min(a,b);
}
public static int min(int... a){
int min = Integer.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static long min(long a,long b){
return Math.min(a, b);
}
public static long min(long... a){
long min = Long.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static final class MC {
private final int mod;
public MC(final int mod) {
this.mod = mod;
}
public long mod(long x) {
x %= mod;
if (x < 0) {
x += mod;
}
return x;
}
public long add(final long a, final long b) {
return mod(mod(a) + mod(b));
}
public long add(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = add(ans,a[i]);
}
return mod(ans);
}
public long mul(final long a, final long b) {
return mod(mod(a) * mod(b));
}
public long mul(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = mul(ans,a[i]);
}
return mod(ans);
}
public long div(final long numerator, final long denominator) {
return mod(numerator * inverse(denominator));
}
public long power(long base, long exp) {
long ret = 1;
base %= mod;
while (exp > 0) {
if ((exp & 1) == 1) {
ret = mul(ret, base);
}
base = mul(base, base);
exp >>= 1;
}
return ret;
}
public long inverse(final long x) {
return power(x, mod - 2);
}
public long fact(final int n) {
return product(1, n);
}
public long product(final int start, final int end) {
long result = 1;
for (int i = start; i <= end; i++) {
result *= i;
result %= mod;
}
return result;
}
public long combination(final int n, int r) {
if (r > n) {
return 0;
}
return div(product(n - r + 1, n), fact(r));
}
}
public static long pow(long x,long n){
long ans = 1L;
long tmp = x;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
}
tmp *=tmp;
n = n >> 1;
}
return ans;
}
public static long modPow(long x,long n,long m){
long ans = 1L;
long tmp = x%m;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
ans%=m;
}
tmp *=tmp;
tmp%=m;
n = n >> 1;
}
return ans;
}
public static int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static long gcd(long a,long b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static int gcd(int... a){
int ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long gcd(long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long lcm(int a,int b){
return (long) a / gcd(a, b) * b;
}
public static long lcm(long a,long b){
return a / gcd(a,b) * b;
}
public static boolean isPrime(long x){
if(x < 2) return false;
else if(x == 2) return true;
if(x%2 == 0) return false;
for(long i = 3; i*i <= x; i+= 2){
if(x%i == 0) return false;
}
return true;
}
public static int rI() {
return fs.nextInt();
}
public static int[] rIv(int length) {
int[] res = new int[length];
for (int i = 0; i < length; i++) {
res[i] = fs.nextInt();
}
return res;
}
public static String rS() {
return fs.next();
}
public static String[] rSv(int length) {
String[] res = new String[length];
for (int i = 0; i < length; i++) res[i] = fs.next();
return res;
}
public static long rL() {
return fs.nextLong();
}
public static long[] rLv(int length) {
long[] res = new long[length];
for (int i = 0; i < length; i++) res[i] = fs.nextLong();
return res;
}
public static double rD(){
return fs.nextDouble();
}
public static double[] rDv(int length){
double[] res = new double[length];
for (int i = 0; i < length; i++) res[i] = rD();
return res;
}
public static String aiS(int[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String alS(long[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String adS(double[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String acS(char[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String asS(String[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a, IntUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsInt(a.get(i)));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a, LongUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsLong(a.get(i)));
}
return ans.toString();
}
public static String ldS(ArrayList<Double> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lcS(ArrayList<Character> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lsS(ArrayList<String> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static void nL(){
out.println();
}
public static void oI(int a) {
out.println(a);
}
public static void onI(int a){
out.print(a);
}
public static void oIv(int... a) {
oS(aiS(a));
}
public static void oS(String s) {
out.println(s);
}
public static void onS(String s) {
out.print(s);
}
public static void oSv(String[] a) {
oS(asS(a));
}
public static void oL(long l) {
out.println(l);
}
public static void onL(long l) {
out.print(l);
}
public static void oLv(long... a) {
oS(alS(a));
}
public static void oD(double d){
out.println(d);
}
public static void onD(double d){
out.print(d);
}
public static void oDv(double... d){
oS(adS(d));
}
public static void oC(char c){
out.println(c);
}
public static void onC(char c){
out.print(c);
}
public static void oCv(char... c){
oS(acS(c));
}
public static void yes_no(boolean yes){
if(yes){
oS("Yes");
return;
}
oS("No");
}
public static int fact(int num) {
if (num == 0) {
return 1;
} else if (num == 1) {
return 1;
} else if (num < 0) {
throw new IllegalArgumentException("factorial should be bigger than 0");
}
return num * fact(num - 1);
}
public static int[] convI(ArrayList<Integer> list) {
int[] res = new int[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static long[] convL(ArrayList<Long> list) {
long[] res = new long[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static String[] convS(ArrayList<String> list) {
String[] res = new String[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static ArrayList<Integer> convI(int[] vec) {
ArrayList<Integer> list = new ArrayList<>();
for (int i : vec) list.add(i);
return list;
}
public static ArrayList<Long> convL(long[] vec) {
ArrayList<Long> list = new ArrayList<>();
for (long i : vec) list.add(i);
return list;
}
public static ArrayList<String> convS(String[] vec) {
return new ArrayList<>(Arrays.asList(vec));
}
public static ArrayList<ArrayList<Integer>> permutation(int a) {
int[] list = new int[a];
for (int i = 0; i < a; i++) {
list[i] = i;
}
return permutation(list);
}
public static ArrayList<ArrayList<Integer>> permutation(int[] seed) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
int[] perm = new int[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(int[] seed, int[] perm, boolean[] used, int index,ArrayList<ArrayList<Integer>> res) {
if (index == seed.length) {
res.add(convI(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static ArrayList<ArrayList<String>> permutation(String[] seed) {
ArrayList<ArrayList<String>> res = new ArrayList<>();
String[] perm = new String[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(String[] seed, String[] perm, boolean[] used, int index,ArrayList<ArrayList<String>> res) {
if (index == seed.length) {
res.add(convS(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static void swap(int[] a,int i1,int i2){
int t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void swap(char[] a,int i1,int i2){
char t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void SOLVE(){
solve();
out.flush();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.util.function.*;
public class Main {
public static void main(String[] args) {
Solver.SOLVE();
}
}
class UnionFind {
private int[] roots;
public UnionFind(int n){
roots = new int[n];
for (int i = 0; i < n; i++) {
roots[i] = i;
}
}
public int root(int x){
if(roots[x] == x){
return x;
}
return roots[x] = root(roots[x]);
}
public void unite(int x,int y){
int rx = root(x);
int ry = root(y);
if(rx == ry){
return;
}
roots[rx] = ry;
}
public boolean same(int x,int y){
int rx = root(x);
int ry = root(y);
return rx == ry;
}
}
class DSU {
private int n;
private int[] parentOrSize;
public DSU(int n) {
this.n = n;
this.parentOrSize = new int[n];
java.util.Arrays.fill(parentOrSize, -1);
}
int merge(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
int x = leader(a);
int y = leader(b);
if (x == y) return x;
if (-parentOrSize[x] < -parentOrSize[y]) {
int tmp = x;
x = y;
y = tmp;
}
parentOrSize[x] += parentOrSize[y];
parentOrSize[y] = x;
return x;
}
boolean same(int a, int b) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("a=" + a);
if (!(0 <= b && b < n))
throw new IndexOutOfBoundsException("b=" + b);
return leader(a) == leader(b);
}
int leader(int a) {
if (parentOrSize[a] < 0) {
return a;
} else {
parentOrSize[a] = leader(parentOrSize[a]);
return parentOrSize[a];
}
}
int size(int a) {
if (!(0 <= a && a < n))
throw new IndexOutOfBoundsException("" + a);
return -parentOrSize[leader(a)];
}
ArrayList<ArrayList<Integer>> groups() {
int[] leaderBuf = new int[n];
int[] groupSize = new int[n];
for (int i = 0; i < n; i++) {
leaderBuf[i] = leader(i);
groupSize[leaderBuf[i]]++;
}
ArrayList<ArrayList<Integer>> result = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
result.add(new ArrayList<>(groupSize[i]));
}
for (int i = 0; i < n; i++) {
result.get(leaderBuf[i]).add(i);
}
result.removeIf(ArrayList::isEmpty);
return result;
}
}
class PairL implements Comparable<PairL>, Comparator<PairL> {
public long x,y;
public PairL(long x,long y) {
this.x = x;
this.y = y;
}
public void swap(){
long t = x;
x = y;
y = t;
}
@Override
public int compare(PairL o1, PairL o2) {
return o1.compareTo(o2);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairL pairl = (PairL) o;
return x == pairl.x && y == pairl.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
public PairL add(PairL p){
return new PairL(x+p.x,y+p.y);
}
@Override
public int compareTo(PairL o) {
return Long.compare(x,o.x);
}
}
class PairI implements Comparable<PairI>, Comparator<PairI> {
public int x,y;
public PairI(int x,int y) {
this.x = x;
this.y = y;
}
public void swap(){
int t = x;
x = y;
y = t;
}
@Override
public int compare(PairI o1, PairI o2) {
if(o1.x == o2.x){
return Integer.compare(o1.y,o2.y);
}
return Integer.compare(o1.x,o2.x);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return x == pairI.x && y == pairI.y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public int compareTo(PairI o) {
if(x == o.x){
return Integer.compare(y,o.y);
}
return Integer.compare(x,o.x);
}
public PairI add(PairI p){
return new PairI(x+p.x,y+p.y);
}
public PairI sub(PairI p){
return new PairI(x-p.x,y-p.y);
}
public PairI addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new PairI(x,y);
}
return null;
}
}
class PairISet{
int x,y;
PairISet(int x,int y){
this.x = x;
this.y = y;
}
@Override
public int hashCode() {
return Objects.hash(x, y);
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
PairI pairI = (PairI) o;
return (x == pairI.x && y == pairI.y)||(x == pairI.y && y == pairI.x);
}
}
class Line{
//ax+bx+c=0
long a,b,c;
public Line(int x0, int y0, int x1, int y1) {
long dx = x1-x0;
long dy = y1-y0;
long gcd = Solver.gcd(dx,dy);
dx/=gcd;
dy/=gcd;
if(dx < 0){
dx=-dx;
dy=-dy;
}
if(dx == 0 && dy < 0){
dy=-dy;
}
a = dy;
b = -dx;
c = dx*y0-dy*x0;
}
public boolean onLine(int x,int y){
return a*x + b*y + c == 0;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Line line = (Line) o;
return a == line.a && b == line.b && c == line.c;
}
@Override
public int hashCode() {
return Objects.hash(a, b, c);
}
}
class Dist extends PairI{
int d;
public Dist(int x,int y,int d){
super(x,y);
this.d = d;
}
public Dist addG(PairI p,int h,int w) {
int x = this.x + p.x;
int y = this.y + p.y;
if(0 <= x&&x < w&&0 <= y&&y < h){
return new Dist(x,y,d+1);
}
return null;
}
}
class Tuple implements Comparable<Tuple>{
public int x,y,z;
public Tuple(int x, int y, int z) {
this.x = x;
this.y = y;
this.z = z;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Tuple three = (Tuple) o;
return x == three.x && y == three.y && z == three.z;
}
@Override
public int hashCode() {
return Objects.hash(x, y, z);
}
@Override
public int compareTo(Tuple o) {
return Integer.compare(z,o.z);
}
}
class Edge implements Comparable<Edge>{
public int from;
public int to;
public int name;
public long d;
public Edge(int to){
this.to = to;
}
public Edge(int to, long d){
this.to = to;
this.d = d;
}
public Edge setName(int name){
this.name = name;
return this;
}
public Edge(int from, int to, long d){
this.to = to;
this.from = from;
this.d = d;
}
@Override
public int compareTo(Edge o) {
return Long.compare(d,o.d);
}
}
class PairC{
char a,b;
public PairC(char a, char b){
this.a = a;
this.b = b;
}
}
class IB{
int i;
boolean b;
IB(int i,boolean b){
this.i = i;
this.b = b;
}
}
class CI{
char c;
int i;
CI(char c,int i){
this.c = c;
this.i = i;
}
}
class SortedMultiSet extends TreeMap<Integer,Integer>{
public void add(int a){
put(a,getOrDefault(a,0)+1);
}
public void remove(int a){
if(get(a) == 1){
super.remove(a);
}else{
put(a,get(a)-1);
}
}
}
class Solver {
public static final int MOD1 = 1000000007;
public static final int MOD9 = 998244353;
public static Scanner sc = new Scanner(System.in);
public static final int inf = 2000000000;
public static final int ninf = -inf;
public static final char[] alpha = "abcdefghijklmnopqrstuvwxyz".toCharArray();
public static final char[] ALPHA = "abcdefghijklmnopqrstuvwxyz".toUpperCase().toCharArray();
public static FastScanner fs = new FastScanner();
public static PrintWriter out = new PrintWriter(System.out);
public static final PairI[] move = new PairI[]{new PairI(1,0),new PairI(0,1),new PairI(-1,0),new PairI(0,-1)};
public static void solve(){
int n = rI();
long[] x = new long[n];
long[] y = new long[n];
long[] p = new long[n];
for (int i = 0; i < n; i++) {
x[i] = rL();
y[i] = rL();
p[i] = rL();
}
long ng = 0;
long ok = 10000000000L;
long[][] dist = new long[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
dist[i][j] = abs(x[i] - x[j]) + abs(y[i] - y[j]);
}
}
while (abs(ok-ng)>1){
long mid = (ok+ng)/2;
boolean isok = false;
ArrayList<ArrayList<Integer>> e = new ArrayList<>();
for (int i = 0; i < n; i++) {
e.add(new ArrayList<>());
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if(i == j) continue;
if(p[i]*mid >= dist[i][j]){
e.get(i).add(j);
}
}
}
out:for (int i = 0; i < n; i++) {
ArrayDeque<Integer> q = new ArrayDeque<>();
boolean[] went = new boolean[n];
went[i] = true;
q.add(i);
while (!q.isEmpty()){
int v = q.poll();
for(int next:e.get(v)){
if(went[next]) continue;
went[next] = true;
q.add(next);
}
}
for (int j = 0; j < n; j++) {
if(!went[j]) continue out;
}
isok = true;
break;
}
if(isok) ok = mid;
else ng = mid;
}
oL(ok);
}
static void dfs(int now,int before,ArrayList<ArrayList<Integer>> e,boolean[] went){
went[now] = true;
for(int next:e.get(now)){
if(went[next]) continue;
dfs(next,now,e,went);
}
}
static int standingBits(long n){
String bits = toBits(n);
int ans = 0;
for (int i = 0; i < bits.length(); i++) {
if(bits.charAt(i) == '1'){
ans++;
}
}
return ans;
}
static boolean contain(String s,char c){
for (int i = 0; i < s.length(); i++) {
if(s.charAt(i) == c){
return true;
}
}
return false;
}
static String toBits(long n){
StringBuilder ans = new StringBuilder();
while (n > 0){
ans.append(n%2);
n/=2;
}
return ans.reverse().toString();
}
static long toLong(String anss){
long ansi = 0;
for (int i = 0; i < anss.length(); i++) {
if(anss.charAt(i) == '1'){
ansi += (1L<<(anss.length()-1-i));
}
}
return ansi;
}
static int perfectPowNum(long n){
int res = 0;
double range = Math.log(n)/Math.log(2);
range++;
for (int i = 2; i < range; i++) {
long a = (long) Math.pow(n,1d/i);
if(pow(a,i) == n||pow(a+1,i)==n){
res++;
}
}
return res;
}
static boolean[] eratosthenes(int n){
boolean[] res = new boolean[n+1];
for (int i = 2; i <= n; i++) {
res[i] = true;
}
for (int i = 2; i <= n; i++) {
if(res[i]){
int k = i*2;
while (k <= n){
res[k] = false;
k+=i;
}
}
}
return res;
}
static BitSet and(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.and(set2);
return ans;
}
static BitSet or(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.or(set2);
return ans;
}
static BitSet xor(BitSet set1,BitSet set2){
BitSet ans = (BitSet) set1.clone();
ans.xor(set2);
return ans;
}
static BitSet toBitset(long n){
return BitSet.valueOf(new long[]{n});
}
static long toLong(BitSet set){
if(set.length() > 63) {
throw new IllegalArgumentException();
}
if(set.length() == 0){
return 0;
}
return set.toLongArray()[0];
}
static int deg(long x){
return String.valueOf(x).length();
}
static int nthdeg(long x,int d){
x/=pow(10,d);
return (int)(x%10);
}
static boolean isPalindrome(int a,int b,String s){
int dif = b-a;
boolean ok = true;
for (int i = 0; i < dif; i++) {
if (s.charAt(i + a) != s.charAt(b - i)) {
ok = false;
break;
}
}
return ok;
}
static int intValue(char c){
return Integer.parseInt(String.valueOf(c));
}
@SuppressWarnings("unchecked")
static class SegTree<T>{
T[] data;
int size;
BinaryOperator<T> op;
T e;
int inisize;
SegTree(T[] a,BinaryOperator<T> op,T e){
size = 1;
inisize = a.length;
while (size < a.length){
size <<= 1;
}
this.e = e;
this.op = op;
data = (T[])new Object[size*2];
Arrays.fill(data,e);
System.arraycopy(a,0,data,size,a.length);
for (int i = size-1; i > 0; i--) {
data[i] = op.apply(data[i*2],data[i*2+1]);
}
}
void update(int i,T x){
if(i < 0) throw new IllegalArgumentException();
i += size;
data[i] = x;
while (i > 1){
data[i >> 1] = op.apply(data[i],data[i^1]);
i >>= 1;
}
}
T query(int l,int r){
if(l < 0) throw new IllegalArgumentException();
if(r < 0) throw new IllegalArgumentException();
T res = e;
l += size;
r += size;
while (l < r){
if((l & 1) == 1) {
res = op.apply(res,data[l]);
l++;
}
if((r & 1) == 1){
res = op.apply(res,data[r-1]);
}
l >>= 1;
r >>= 1;
}
return res;
}
int maxRight(int l,Predicate<T> pr){
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if(l == inisize) return l;
l+=size;
T sum = e;
do {
l >>= Integer.numberOfTrailingZeros(l);
if (!pr.test(op.apply(sum, data[l]))) {
while (l < size) {
l = l << 1;
if (pr.test(op.apply(sum, data[l]))) {
sum = op.apply(sum, data[l]);
l++;
}
}
return l - size;
}
sum = op.apply(sum, data[l]);
l++;
} while ((l & -l) != l);
return inisize;
}
public int minLeft(int r,Predicate<T> pr) {
if (!pr.test(e)) {
throw new IllegalArgumentException();
}
if (r == 0) {
return 0;
}
r += size;
T sum = e;
do {
r--;
while (r > 1 && (r & 1) == 1) {
r >>= 1;
}
if (!pr.test(op.apply(data[r], sum))) {
while (r < size) {
r = r << 1 | 1;
if (pr.test(op.apply(data[r], sum))) {
sum = op.apply(data[r], sum);
r--;
}
}
return r + 1 - size;
}
sum = op.apply(data[r], sum);
} while ((r & -r) != r);
return 0;
}
}
public static int toIntC(char c){
for (int i = 0; i < ALPHA.length; i++) {
if(c == ALPHA[i]){
return i+1;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static int toInt(char c){
for (int i = 0; i < alpha.length; i++) {
if(c == alpha[i]){
return i;
}
}
throw new IllegalArgumentException("not an alphabet");
}
public static void reverse(int[] a){
int[] tmp = a.clone();
for (int i = 0; i < a.length; i++) {
a[i] = tmp[a.length - 1 - i];
}
}
public static int[] compress(int[] a){
int[] ans = new int[a.length];
int[] b = erase(a);
Arrays.sort(b);
for (int i = 0; i < a.length; i++) {
ans[i] = lower(b,a[i]);
}
return ans;
}
public static int lower(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int lower(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high) {
mid = low + (high - low) / 2;
if (x <= a[mid]) {
high = mid;
}
else {
low = mid + 1;
}
}
if (low < a.length && a[low] < x) {
low++;
}
return low;
}
public static int upper(int[] a,int x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int upper(long[] a,long x){
int low = 0, high = a.length;
int mid;
while (low < high && low != a.length) {
mid = low + (high - low) / 2;
if (x >= a[mid]) {
low = mid + 1;
} else {
high = mid;
}
}
return low;
}
public static int[] erase(int[] a){
HashSet<Integer> used = new HashSet<>();
ArrayList<Integer> ans = new ArrayList<>();
for (int i = 0; i < a.length; i++) {
if(!used.contains(a[i])){
used.add(a[i]);
ans.add(a[i]);
}
}
return convI(ans);
}
public static int abs(int a){
return Math.abs(a);
}
public static long abs(long a){
return Math.abs(a);
}
public static int max(int a,int b){
return Math.max(a,b);
}
public static int max(int... a){
int max = Integer.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static long max(long a,long b){
return Math.max(a,b);
}
public static long max(long... a){
long max = Long.MIN_VALUE;
for (int i = 0; i < a.length; i++) {
max = max(a[i],max);
}
return max;
}
public static int min(int a,int b){
return Math.min(a,b);
}
public static int min(int... a){
int min = Integer.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static long min(long a,long b){
return Math.min(a, b);
}
public static long min(long... a){
long min = Long.MAX_VALUE;
for (int i = 0; i < a.length; i++) {
min = min(a[i],min);
}
return min;
}
public static final class MC {
private final int mod;
public MC(final int mod) {
this.mod = mod;
}
public long mod(long x) {
x %= mod;
if (x < 0) {
x += mod;
}
return x;
}
public long add(final long a, final long b) {
return mod(mod(a) + mod(b));
}
public long add(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = add(ans,a[i]);
}
return mod(ans);
}
public long mul(final long a, final long b) {
return mod(mod(a) * mod(b));
}
public long mul(final long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = mul(ans,a[i]);
}
return mod(ans);
}
public long div(final long numerator, final long denominator) {
return mod(numerator * inverse(denominator));
}
public long power(long base, long exp) {
long ret = 1;
base %= mod;
while (exp > 0) {
if ((exp & 1) == 1) {
ret = mul(ret, base);
}
base = mul(base, base);
exp >>= 1;
}
return ret;
}
public long inverse(final long x) {
return power(x, mod - 2);
}
public long fact(final int n) {
return product(1, n);
}
public long product(final int start, final int end) {
long result = 1;
for (int i = start; i <= end; i++) {
result *= i;
result %= mod;
}
return result;
}
public long combination(final int n, int r) {
if (r > n) {
return 0;
}
return div(product(n - r + 1, n), fact(r));
}
}
public static long pow(long x,long n){
long ans = 1L;
long tmp = x;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
}
tmp *=tmp;
n = n >> 1;
}
return ans;
}
public static long modPow(long x,long n,long m){
long ans = 1L;
long tmp = x%m;
while (true){
if(n < 1L){
break;
}
if(n % 2L == 1L){
ans*=tmp;
ans%=m;
}
tmp *=tmp;
tmp%=m;
n = n >> 1;
}
return ans;
}
public static int gcd(int a,int b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static long gcd(long a,long b){
if(b == 0) return a;
else return gcd(b,a%b);
}
public static int gcd(int... a){
int ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long gcd(long... a){
long ans = a[0];
for (int i = 1; i < a.length; i++) {
ans = gcd(ans,a[i]);
}
return ans;
}
public static long lcm(int a,int b){
return (long) a / gcd(a, b) * b;
}
public static long lcm(long a,long b){
return a / gcd(a,b) * b;
}
public static boolean isPrime(long x){
if(x < 2) return false;
else if(x == 2) return true;
if(x%2 == 0) return false;
for(long i = 3; i*i <= x; i+= 2){
if(x%i == 0) return false;
}
return true;
}
public static int rI() {
return fs.nextInt();
}
public static int[] rIv(int length) {
int[] res = new int[length];
for (int i = 0; i < length; i++) {
res[i] = fs.nextInt();
}
return res;
}
public static String rS() {
return fs.next();
}
public static String[] rSv(int length) {
String[] res = new String[length];
for (int i = 0; i < length; i++) res[i] = fs.next();
return res;
}
public static long rL() {
return fs.nextLong();
}
public static long[] rLv(int length) {
long[] res = new long[length];
for (int i = 0; i < length; i++) res[i] = fs.nextLong();
return res;
}
public static double rD(){
return fs.nextDouble();
}
public static double[] rDv(int length){
double[] res = new double[length];
for (int i = 0; i < length; i++) res[i] = rD();
return res;
}
public static String aiS(int[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String alS(long[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String adS(double[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String acS(char[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String asS(String[] a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a[i]);
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String liS(ArrayList<Integer> a, IntUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsInt(a.get(i)));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String llS(ArrayList<Long> a, LongUnaryOperator o){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(o.applyAsLong(a.get(i)));
}
return ans.toString();
}
public static String ldS(ArrayList<Double> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lcS(ArrayList<Character> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static String lsS(ArrayList<String> a){
StringBuilder ans = new StringBuilder();
for (int i = 0; i < a.size(); i++) {
if(i != 0){
ans.append(' ');
}
ans.append(a.get(i));
}
return ans.toString();
}
public static void nL(){
out.println();
}
public static void oI(int a) {
out.println(a);
}
public static void onI(int a){
out.print(a);
}
public static void oIv(int... a) {
oS(aiS(a));
}
public static void oS(String s) {
out.println(s);
}
public static void onS(String s) {
out.print(s);
}
public static void oSv(String[] a) {
oS(asS(a));
}
public static void oL(long l) {
out.println(l);
}
public static void onL(long l) {
out.print(l);
}
public static void oLv(long... a) {
oS(alS(a));
}
public static void oD(double d){
out.println(d);
}
public static void onD(double d){
out.print(d);
}
public static void oDv(double... d){
oS(adS(d));
}
public static void oC(char c){
out.println(c);
}
public static void onC(char c){
out.print(c);
}
public static void oCv(char... c){
oS(acS(c));
}
public static void yes_no(boolean yes){
if(yes){
oS("Yes");
return;
}
oS("No");
}
public static int fact(int num) {
if (num == 0) {
return 1;
} else if (num == 1) {
return 1;
} else if (num < 0) {
throw new IllegalArgumentException("factorial should be bigger than 0");
}
return num * fact(num - 1);
}
public static int[] convI(ArrayList<Integer> list) {
int[] res = new int[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static long[] convL(ArrayList<Long> list) {
long[] res = new long[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static String[] convS(ArrayList<String> list) {
String[] res = new String[list.size()];
for (int i = 0; i < list.size(); i++) res[i] = list.get(i);
return res;
}
public static ArrayList<Integer> convI(int[] vec) {
ArrayList<Integer> list = new ArrayList<>();
for (int i : vec) list.add(i);
return list;
}
public static ArrayList<Long> convL(long[] vec) {
ArrayList<Long> list = new ArrayList<>();
for (long i : vec) list.add(i);
return list;
}
public static ArrayList<String> convS(String[] vec) {
return new ArrayList<>(Arrays.asList(vec));
}
public static ArrayList<ArrayList<Integer>> permutation(int a) {
int[] list = new int[a];
for (int i = 0; i < a; i++) {
list[i] = i;
}
return permutation(list);
}
public static ArrayList<ArrayList<Integer>> permutation(int[] seed) {
ArrayList<ArrayList<Integer>> res = new ArrayList<>();
int[] perm = new int[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(int[] seed, int[] perm, boolean[] used, int index,ArrayList<ArrayList<Integer>> res) {
if (index == seed.length) {
res.add(convI(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static ArrayList<ArrayList<String>> permutation(String[] seed) {
ArrayList<ArrayList<String>> res = new ArrayList<>();
String[] perm = new String[seed.length];
boolean[] used = new boolean[seed.length];
buildPerm(seed, perm, used, 0,res);
return res;
}
private static void buildPerm(String[] seed, String[] perm, boolean[] used, int index,ArrayList<ArrayList<String>> res) {
if (index == seed.length) {
res.add(convS(perm));
return;
}
for (int i = 0; i < seed.length; i++) {
if (used[i])
continue;
perm[index] = seed[i];
used[i] = true;
buildPerm(seed, perm, used, index + 1,res);
used[i] = false;
}
}
public static void swap(int[] a,int i1,int i2){
int t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void swap(char[] a,int i1,int i2){
char t = a[i1];
a[i1] = a[i2];
a[i2] = t;
}
public static void SOLVE(){
solve();
out.flush();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() { return Double.parseDouble(next());}
}
| ConDefects/ConDefects/Code/abc257_d/Java/43526680 |
condefects-java_data_722 | import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
long[][] P = in.nextLongMatrix(1, N, 0, 2);
void solve() {
long s = findLowestBound(0,2000000000L,(bottomS)-> {
var scc = new StronglyConnectedComponent( getPaths(bottomS), N);
boolean[] m = new boolean[N+1];
var start = scc.search().get(0).get(0);
mark( scc.graph, start, m);
for(int i=1; i<=N; i++) {
if(!m[i]) {
return false;
}
}
return true;
});
out.println(s);
}
void mark(Graph g, int v, boolean[] m) {
if(m[v]) {
return;
}
m[v] = true;
for(var n : g.getNext(v)) {
mark(g,n,m);
}
}
List<Path> getPaths(long bottomS) {
List<Path> result = new ArrayList<>();
for(int i=1; i<=N; i++) {
for(int j=1; j<=N; j++) {
if(i==j) {
continue;
}
long p = P[i][2];
long x1 = P[i][0];
long y1 = P[i][1];
long x2 = P[j][0];
long y2 = P[j][1];
if(p*bottomS >= (Math.abs( x1 - x2 ) + Math.abs( y1 - y2 ))) {
result.add(new Path(i,j));
}
}
}
return result;
}
long findLowestBound(long ng, long ok, Bounder f) {
while(ng != ok) {
long m = (ng+ok)/2;
if(f.check(m)) {
ok = m;
} else {
ng = m+1;
}
}
return ok;
}
interface Bounder {
boolean check(long i);
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
class Graph {
List<Integer>[] next;
Graph(List<Path> graph, int nodeSize) {
next = new List[nodeSize+1];
for(int i=1; i<=nodeSize; i++) {
next[i] = new ArrayList<Integer>();
}
for(Path p : graph) {
next[p.src].add(p.dest);
}
}
List<Integer> getNext(int n) {
return next[n];
}
}
class StronglyConnectedComponent {
List<Path> paths;
int nodeSize;
int[] level;
int[] levelToNode;
int currentLevel;
Graph graph;
Graph revGraph;
boolean closed[];
StronglyConnectedComponent(List<Path> paths, int nodeSize) {
this.paths = paths;
this.nodeSize = nodeSize;
}
// ๆปใๅค: ็ธไบใซ่กใๆฅๅฏ่ฝใช้ ็น้ๅใฎใชในใ
List<List<Integer>> search() {
level = new int[nodeSize+1];
levelToNode = new int[nodeSize+1];
graph = new Graph(paths,nodeSize);
closed = new boolean[nodeSize+1];
currentLevel = 1;
for(int i=1; i<=nodeSize; i++) {
setLevelDfs(i);
}
revGraph = new Graph(reversePaths(),nodeSize);
List<List<Integer>> scc = new ArrayList<>();
Arrays.fill(closed, false);
for(int i=currentLevel-1; i>=1; i--) {
List<Integer> path = new ArrayList<Integer>();
setSccDfs(path,levelToNode[i]);
if(path.size()>=1) {
scc.add(path);
}
}
return scc;
}
List<Path> reversePaths() {
List<Path> result = new ArrayList<>();
for(var p : paths) {
result.add(new Path(p.dest,p.src));
}
return result;
}
void setLevelDfs(int v) {
if(closed[v]) {
return;
}
closed[v] = true;
for(var next : graph.getNext(v)) {
setLevelDfs(next);
}
level[v] = currentLevel;
levelToNode[currentLevel] = v;
currentLevel ++;
}
void setSccDfs(List<Integer> path, int v) {
if(closed[v]) {
return;
}
closed[v] = true;
path.add(v);
for(var next : revGraph.getNext(v)) {
setSccDfs(path,next);
}
}
}
class Path {
int src;
int dest;
public Path(int src, int dest) {
this.src = src;
this.dest = dest;
}
}
class CostPath extends Path implements Comparable<CostPath> {
int cost;
public CostPath(int src, int dest, int cost) {
super(src,dest);
this.cost = cost;
}
@Override
public int compareTo(CostPath o) {
if(cost == o.cost) {
if(src == o.src) {
return dest - o.dest;
} else {
return src - o.src;
}
} else {
return cost - o.cost;
}
}
}
class FastScaner {
InputStream in;
FastScaner() {
this.in = System.in;
}
char nextChar() {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n');
return ch;
} catch(IOException e) {
throw new IllegalStateException(e);
}
}
int nextInt() {
return (int) nextLong();
}
long nextLong() {
try {
long result = 0;
int flag = 1;
int ch;
do {
ch = in.read();
if(ch=='-') {
flag = -1;
}
} while(!Character.isDigit(ch));
do {
result *= 10;
result += ch - '0';
ch = in.read();
} while(Character.isDigit(ch));
return result * flag;
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
char[] nextCharArray(int start, int end) {
char[] result = new char[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextChar();
}
return result;
}
int[] nextIntArray(int start, int end) {
int[] result = new int[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextInt();
}
return result;
}
long[] nextLongArray(int start, int end) {
long[] result = new long[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextLong();
}
return result;
}
char[][] nextCharMatrix(int s1, int e1, int s2, int e2) {
char[][] result = new char[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextChar();
}
}
return result;
}
int[][] nextIntMatrix(int s1, int e1, int s2, int e2) {
int[][] result = new int[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextInt();
}
}
return result;
}
long[][] nextLongMatrix(int s1, int e1, int s2, int e2) {
long[][] result = new long[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextLong();
}
}
return result;
}
String next() {
return next(' ');
}
String nextLine() {
return next((char)-1);
}
String next(char a) {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n' || ch==a);
StringBuilder buf = new StringBuilder();
do {
buf.append(ch);
ch = (char)in.read();
} while(ch != '\r' && ch != '\n' && ch != a);
return buf.toString();
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
}
class FastWriter {
public static final String LINE_SEPARATOR = System.getProperty("line.separator");
PrintStream out;
StringBuilder buf;
boolean newLine;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
this.newLine = true;
}
void print(char ch) {
newLine = false;
buf.append(ch);
}
void print(Object o) {
if(!newLine) {
buf.append(" ");
} else {
newLine = false;
}
buf.append(o);
}
void println(int o) {
buf.append(o);
println();
}
void println(long o) {
buf.append(o);
println();
}
void println(double o) {
buf.append(o);
println();
}
void println(String o) {
buf.append(o);
println();
}
void println(int[] o) {
println(Arrays.stream(o).mapToObj((n)->(Integer)n).collect(Collectors.toList()));
}
void println(long[] o) {
println(Arrays.stream(o).mapToObj((n)->(Long)n).collect(Collectors.toList()));
}
void println(double[] o) {
println(Arrays.stream(o).mapToObj((n)->(Double)n).collect(Collectors.toList()));
}
void println(Collection<?> o) {
for(var e : o) {
buf.append(e);
buf.append(" ");
}
if(o.size()>=1) {
buf.deleteCharAt(buf.length()-1);
}
println();
}
void println() {
buf.append(LINE_SEPARATOR);
newLine = true;
}
void flush() {
System.out.print(buf);
}
}
import java.io.*;
import java.util.*;
import java.util.stream.Collectors;
public class Main {
static FastScaner in = new FastScaner();
static FastWriter out = new FastWriter();
int N = in.nextInt();
long[][] P = in.nextLongMatrix(1, N, 0, 2);
void solve() {
long s = findLowestBound(0,4000000000L,(bottomS)-> {
var scc = new StronglyConnectedComponent( getPaths(bottomS), N);
boolean[] m = new boolean[N+1];
var start = scc.search().get(0).get(0);
mark( scc.graph, start, m);
for(int i=1; i<=N; i++) {
if(!m[i]) {
return false;
}
}
return true;
});
out.println(s);
}
void mark(Graph g, int v, boolean[] m) {
if(m[v]) {
return;
}
m[v] = true;
for(var n : g.getNext(v)) {
mark(g,n,m);
}
}
List<Path> getPaths(long bottomS) {
List<Path> result = new ArrayList<>();
for(int i=1; i<=N; i++) {
for(int j=1; j<=N; j++) {
if(i==j) {
continue;
}
long p = P[i][2];
long x1 = P[i][0];
long y1 = P[i][1];
long x2 = P[j][0];
long y2 = P[j][1];
if(p*bottomS >= (Math.abs( x1 - x2 ) + Math.abs( y1 - y2 ))) {
result.add(new Path(i,j));
}
}
}
return result;
}
long findLowestBound(long ng, long ok, Bounder f) {
while(ng != ok) {
long m = (ng+ok)/2;
if(f.check(m)) {
ok = m;
} else {
ng = m+1;
}
}
return ok;
}
interface Bounder {
boolean check(long i);
}
public static void main(String[] args) {
try {
new Main().solve();
} finally {
out.flush();
}
}
}
class Graph {
List<Integer>[] next;
Graph(List<Path> graph, int nodeSize) {
next = new List[nodeSize+1];
for(int i=1; i<=nodeSize; i++) {
next[i] = new ArrayList<Integer>();
}
for(Path p : graph) {
next[p.src].add(p.dest);
}
}
List<Integer> getNext(int n) {
return next[n];
}
}
class StronglyConnectedComponent {
List<Path> paths;
int nodeSize;
int[] level;
int[] levelToNode;
int currentLevel;
Graph graph;
Graph revGraph;
boolean closed[];
StronglyConnectedComponent(List<Path> paths, int nodeSize) {
this.paths = paths;
this.nodeSize = nodeSize;
}
// ๆปใๅค: ็ธไบใซ่กใๆฅๅฏ่ฝใช้ ็น้ๅใฎใชในใ
List<List<Integer>> search() {
level = new int[nodeSize+1];
levelToNode = new int[nodeSize+1];
graph = new Graph(paths,nodeSize);
closed = new boolean[nodeSize+1];
currentLevel = 1;
for(int i=1; i<=nodeSize; i++) {
setLevelDfs(i);
}
revGraph = new Graph(reversePaths(),nodeSize);
List<List<Integer>> scc = new ArrayList<>();
Arrays.fill(closed, false);
for(int i=currentLevel-1; i>=1; i--) {
List<Integer> path = new ArrayList<Integer>();
setSccDfs(path,levelToNode[i]);
if(path.size()>=1) {
scc.add(path);
}
}
return scc;
}
List<Path> reversePaths() {
List<Path> result = new ArrayList<>();
for(var p : paths) {
result.add(new Path(p.dest,p.src));
}
return result;
}
void setLevelDfs(int v) {
if(closed[v]) {
return;
}
closed[v] = true;
for(var next : graph.getNext(v)) {
setLevelDfs(next);
}
level[v] = currentLevel;
levelToNode[currentLevel] = v;
currentLevel ++;
}
void setSccDfs(List<Integer> path, int v) {
if(closed[v]) {
return;
}
closed[v] = true;
path.add(v);
for(var next : revGraph.getNext(v)) {
setSccDfs(path,next);
}
}
}
class Path {
int src;
int dest;
public Path(int src, int dest) {
this.src = src;
this.dest = dest;
}
}
class CostPath extends Path implements Comparable<CostPath> {
int cost;
public CostPath(int src, int dest, int cost) {
super(src,dest);
this.cost = cost;
}
@Override
public int compareTo(CostPath o) {
if(cost == o.cost) {
if(src == o.src) {
return dest - o.dest;
} else {
return src - o.src;
}
} else {
return cost - o.cost;
}
}
}
class FastScaner {
InputStream in;
FastScaner() {
this.in = System.in;
}
char nextChar() {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n');
return ch;
} catch(IOException e) {
throw new IllegalStateException(e);
}
}
int nextInt() {
return (int) nextLong();
}
long nextLong() {
try {
long result = 0;
int flag = 1;
int ch;
do {
ch = in.read();
if(ch=='-') {
flag = -1;
}
} while(!Character.isDigit(ch));
do {
result *= 10;
result += ch - '0';
ch = in.read();
} while(Character.isDigit(ch));
return result * flag;
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
char[] nextCharArray(int start, int end) {
char[] result = new char[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextChar();
}
return result;
}
int[] nextIntArray(int start, int end) {
int[] result = new int[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextInt();
}
return result;
}
long[] nextLongArray(int start, int end) {
long[] result = new long[end+1];
for(int i=start; i<=end; i++) {
result[i] = nextLong();
}
return result;
}
char[][] nextCharMatrix(int s1, int e1, int s2, int e2) {
char[][] result = new char[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextChar();
}
}
return result;
}
int[][] nextIntMatrix(int s1, int e1, int s2, int e2) {
int[][] result = new int[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextInt();
}
}
return result;
}
long[][] nextLongMatrix(int s1, int e1, int s2, int e2) {
long[][] result = new long[e1+1][e2+1];
for(int i=s1; i<=e1; i++) {
for(int j=s2; j<=e2; j++) {
result[i][j] = nextLong();
}
}
return result;
}
String next() {
return next(' ');
}
String nextLine() {
return next((char)-1);
}
String next(char a) {
try {
char ch;
do {
ch = (char)in.read();
} while(ch == '\r' || ch=='\n' || ch==a);
StringBuilder buf = new StringBuilder();
do {
buf.append(ch);
ch = (char)in.read();
} while(ch != '\r' && ch != '\n' && ch != a);
return buf.toString();
} catch (IOException e) {
throw new IllegalStateException(e);
}
}
}
class FastWriter {
public static final String LINE_SEPARATOR = System.getProperty("line.separator");
PrintStream out;
StringBuilder buf;
boolean newLine;
FastWriter() {
this.out = System.out;
this.buf = new StringBuilder();
this.newLine = true;
}
void print(char ch) {
newLine = false;
buf.append(ch);
}
void print(Object o) {
if(!newLine) {
buf.append(" ");
} else {
newLine = false;
}
buf.append(o);
}
void println(int o) {
buf.append(o);
println();
}
void println(long o) {
buf.append(o);
println();
}
void println(double o) {
buf.append(o);
println();
}
void println(String o) {
buf.append(o);
println();
}
void println(int[] o) {
println(Arrays.stream(o).mapToObj((n)->(Integer)n).collect(Collectors.toList()));
}
void println(long[] o) {
println(Arrays.stream(o).mapToObj((n)->(Long)n).collect(Collectors.toList()));
}
void println(double[] o) {
println(Arrays.stream(o).mapToObj((n)->(Double)n).collect(Collectors.toList()));
}
void println(Collection<?> o) {
for(var e : o) {
buf.append(e);
buf.append(" ");
}
if(o.size()>=1) {
buf.deleteCharAt(buf.length()-1);
}
println();
}
void println() {
buf.append(LINE_SEPARATOR);
newLine = true;
}
void flush() {
System.out.print(buf);
}
}
| ConDefects/ConDefects/Code/abc257_d/Java/41234565 |
condefects-java_data_723 | import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.*;
import java.awt.Point;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
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();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long[][] T = in.lg(N,3);
Object solve(){
long[][] dist = new long[N][N];
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
dist[i][j] = abs(T[i][0] -T[j][0]) +abs(T[i][1] -T[j][1]);
return bSearchL(infI,0,S -> {
for (int s = 0;s < N;s++) {
Set<Integer> seen = new HashSet<>(N);
seen.add(s);
Queue<Integer> que = new ArrayDeque<>(seen);
while (!que.isEmpty()) {
var u = que.poll();
for (int v = 0;v < N;v++)
if (T[u][2] *S >= dist[u][v] && seen.add(v))
que.add(v);
}
if (seen.size() == N)
return true;
}
return false;
});
}
long bSearchL(long o,long n,Predicate<Long> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
}
class UnionFind{
int num;
int[] par;
int[] size;
public UnionFind(int n){
par = new int[n];
Arrays.setAll(par,i -> i);
size = new int[n];
Arrays.fill(size,1);
num = n;
}
int root(int x){ return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
par[v] = u;
size[u] += size[v];
num--;
return true;
}
int size(int x){ return size[root(x)]; }
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
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[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
<T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
int it(){ return toIntExact(lg()); }
int[] it(int N){ return arrI(N,i -> it()); }
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return arrD(N,i -> dbl()); }
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;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (Edge e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = arr(new Edge[N][],i -> new Edge[c[i]]);
for (Edge e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
Edge rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (var e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray()
&& !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(solver.elapsed());
}
}
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.*;
import java.awt.Point;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
class Solver{
long st = System.currentTimeMillis();
long elapsed(){ return System.currentTimeMillis() -st; }
void reset(){ st = System.currentTimeMillis(); }
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();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long[][] T = in.lg(N,3);
Object solve(){
long[][] dist = new long[N][N];
for (int i = 0;i < N;i++)
for (int j = 0;j < N;j++)
dist[i][j] = abs(T[i][0] -T[j][0]) +abs(T[i][1] -T[j][1]);
return bSearchL(infI *4L,0,S -> {
for (int s = 0;s < N;s++) {
Set<Integer> seen = new HashSet<>(N);
seen.add(s);
Queue<Integer> que = new ArrayDeque<>(seen);
while (!que.isEmpty()) {
var u = que.poll();
for (int v = 0;v < N;v++)
if (T[u][2] *S >= dist[u][v] && seen.add(v))
que.add(v);
}
if (seen.size() == N)
return true;
}
return false;
});
}
long bSearchL(long o,long n,Predicate<Long> judge){
if (!judge.test(o))
return o -(n -o) /abs(n -o);
for (long c = 0;1 < abs(n -o);)
if (judge.test(c = o +n >>1))
o = c;
else
n = c;
return o;
}
}
class UnionFind{
int num;
int[] par;
int[] size;
public UnionFind(int n){
par = new int[n];
Arrays.setAll(par,i -> i);
size = new int[n];
Arrays.fill(size,1);
num = n;
}
int root(int x){ return x == par[x] ? x : (par[x] = root(par[x])); }
boolean same(int u,int v){ return root(u) == root(v); }
boolean unite(int u,int v){
if ((u = root(u)) == (v = root(v)))
return false;
par[v] = u;
size[u] += size[v];
num--;
return true;
}
int size(int x){ return size[root(x)]; }
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
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[] arrI(int N,IntUnaryOperator f){
int[] ret = new int[N];
setAll(ret,f);
return ret;
}
long[] arrL(int N,IntToLongFunction f){
long[] ret = new long[N];
setAll(ret,f);
return ret;
}
double[] arrD(int N,IntToDoubleFunction f){
double[] ret = new double[N];
setAll(ret,f);
return ret;
}
<T> T[] arr(T[] arr,IntFunction<T> f){
setAll(arr,f);
return arr;
}
int it(){ return toIntExact(lg()); }
int[] it(int N){ return arrI(N,i -> it()); }
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return arrI(N,i -> idx()); }
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return arrL(N,i -> lg()); }
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return arrD(N,i -> dbl()); }
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;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (Edge e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = arr(new Edge[N][],i -> new Edge[c[i]]);
for (Edge e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
Edge rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
class MyWriter{
OutputStream out;
byte[] buf = new byte[1 <<16];
byte[] ibuf = new byte[20];
int tail = 0;
MyWriter(OutputStream out){ this.out = out; }
void flush(){
try {
out.write(buf,0,tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void print(Object obj){
if (obj instanceof Boolean)
print((boolean) obj ? Solver.yes : Solver.no);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++) {
print(Array.get(obj,i));
if (i +1 < l)
write((byte) ' ');
}
} else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
if (obj instanceof Collection<?>)
for (var e:(Collection<?>) obj)
println(e);
else if (obj.getClass().isArray()
&& !(Array.get(obj,0) instanceof char[])
&& Array.get(obj,0).getClass().isArray()) {
int l = Array.getLength(obj);
for (int i = 0;i < l;i++)
println(Array.get(obj,i));
} else {
print(obj);
ln();
}
}
}
class Main{
public static void main(String[] args) throws Exception{
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(solver.elapsed());
}
} | ConDefects/ConDefects/Code/abc257_d/Java/42244227 |
condefects-java_data_724 | import java.io.*;
import java.util.*;
public class Main {
static int INF = 100000, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]) {
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if (multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {
loop++;
solve(o);
}
} else solve(o);
o.close();
} catch (Exception e) {
e.printStackTrace();
}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt();
String s = fReader.nextString();
int res = 0;
long cnt0 = 0, cnt1 = 0;
for(int i=0;i<n;i++) {
long ncnt0 = 0, ncnt1 = 0;
if(s.charAt(i) == '1') {
ncnt0 = cnt1;
ncnt1 = cnt0+1;
}
else {
ncnt1 = cnt0+cnt1;
ncnt0 = 1;
}
cnt0 = ncnt0;
cnt1 = ncnt1;
res += cnt1;
}
o.println(res);
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
long ret = 1l;
a %= md;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
}
public 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 Pair<A, B> {
public A fst;
public B snd;
public Pair(A a, B b) {
this.fst = a;
this.snd = b;
}
public boolean equals(Object other) {
if (this == other) {
return true;
} else if (!(other instanceof Pair)) {
return false;
} else {
Pair<?, ?> o = (Pair)other;
return this.fst.equals(o.fst) && this.snd.equals(o.snd);
}
}
public int hashCode() {
int hash = 1;
if (this.fst != null) {
hash = 31 * hash + this.fst.hashCode();
}
if (this.snd != null) {
hash = 31 * hash + this.snd.hashCode();
}
return hash;
}
public String toString() {
return "(" + this.fst + ", " + this.snd + ")";
}
public <A, B> Pair<A, B> make(A x, B y) {
return new Pair(x, y);
}
}
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 {
static int INF = 100000, mod = 1000000007, mod9 = 998244353;
public static void main(String args[]) {
try {
PrintWriter o = new PrintWriter(System.out);
boolean multiTest = false;
// init
if (multiTest) {
int t = fReader.nextInt(), loop = 0;
while (loop < t) {
loop++;
solve(o);
}
} else solve(o);
o.close();
} catch (Exception e) {
e.printStackTrace();
}
}
static void solve(PrintWriter o) {
try {
int n = fReader.nextInt();
String s = fReader.nextString();
long res = 0;
long cnt0 = 0, cnt1 = 0;
for(int i=0;i<n;i++) {
long ncnt0 = 0, ncnt1 = 0;
if(s.charAt(i) == '1') {
ncnt0 = cnt1;
ncnt1 = cnt0+1;
}
else {
ncnt1 = cnt0+cnt1;
ncnt0 = 1;
}
cnt0 = ncnt0;
cnt1 = ncnt1;
res += cnt1;
}
o.println(res);
} catch (Exception e) {
e.printStackTrace();
}
}
public static int upper_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) <= val) l = mid + 1;
else r = mid;
}
return l;
}
public static int lower_bound(List<Integer> a, int val){
int l = 0, r = a.size();
while(l < r){
int mid = l + (r - l) / 2;
if(a.get(mid) < val) l = mid + 1;
else r = mid;
}
return l;
}
public static long gcd(long a, long b){
return b == 0 ? a : gcd(b, a%b);
}
public static long lcm(long a, long b){
return a / gcd(a,b)*b;
}
public static long qpow(long a, long n, int md){
long ret = 1l;
a %= md;
while(n > 0){
if((n & 1) == 1){
ret = ret * a % md;
}
n >>= 1;
a = a * a % md;
}
return ret;
}
public static class DSU {
int[] parent;
int[] size;
int n;
public DSU(int n){
this.n = n;
parent = new int[n];
size = new int[n];
for(int i=0;i<n;i++){
parent[i] = i;
size[i] = 1;
}
}
public int find(int p){
while(parent[p] != p){
parent[p] = parent[parent[p]];
p = parent[p];
}
return p;
}
public void union(int p, int q){
int root_p = find(p);
int root_q = find(q);
if(root_p == root_q) return;
if(size[root_p] >= size[root_q]){
parent[root_q] = root_p;
size[root_p] += size[root_q];
size[root_q] = 0;
}
else{
parent[root_p] = root_q;
size[root_q] += size[root_p];
size[root_p] = 0;
}
n--;
}
public int getTotalComNum(){
return n;
}
}
public 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 Pair<A, B> {
public A fst;
public B snd;
public Pair(A a, B b) {
this.fst = a;
this.snd = b;
}
public boolean equals(Object other) {
if (this == other) {
return true;
} else if (!(other instanceof Pair)) {
return false;
} else {
Pair<?, ?> o = (Pair)other;
return this.fst.equals(o.fst) && this.snd.equals(o.snd);
}
}
public int hashCode() {
int hash = 1;
if (this.fst != null) {
hash = 31 * hash + this.fst.hashCode();
}
if (this.snd != null) {
hash = 31 * hash + this.snd.hashCode();
}
return hash;
}
public String toString() {
return "(" + this.fst + ", " + this.snd + ")";
}
public <A, B> Pair<A, B> make(A x, B y) {
return new Pair(x, y);
}
}
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/abc310_e/Java/43751001 |
condefects-java_data_725 | import java.io.StringWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
sc.nextInt();
String[] zeroOneArray = sc.next().split("");
// String[] zeroOneArray = new StringWriter(){{for(int i=0; i < 100000; i++) write("0"); }}.toString().split("");
List<String> zeroOneList = Arrays.asList(zeroOneArray);
zeroOneList.remove(""); // ๆๅใซๅ
ฅใฃใฆใใพใ็ฉบๆๅญใๅ้ค
long answer = 0;
String zeroOrOne = null;
long switchIndex = 0;
long lastSwitchIndex = 1;
long numberLength = 0;
long ceil = 0;
long floor = 0;
for (String n: zeroOneList){
switchIndex = add(switchIndex, 1);
// 1 ๆๅญ็ฎใฏ 1 or 0 ใ่จ้ฒใใฆๆฌกใธ
if (switchIndex == 1){
zeroOrOne = n;
continue;
}
// ๅใๆๅญใ็ถใๅ ดๅใฏๆฌกใธ
if (zeroOrOne.equals(n)){
continue;
}
// ๆๅญใๅใๆฟใใฃใๅ ดๅ
// ๅใๆฟใใๅใฎๆๅญใไฝๆๅญ็ถใใฆใใใใๅๅพ
numberLength = subtract(switchIndex, lastSwitchIndex);
// ๅใๆฟใใๅใซ 0 ใ็ถใใฆใใๅ ดๅ
if ("0".equals(zeroOrOne)){
answer = add(answer, multiply(numberLength, subtract(lastSwitchIndex, 1)));
answer = add(answer, divide(multiply(numberLength, subtract(numberLength, 1)), 2));
lastSwitchIndex = switchIndex;
zeroOrOne = n;
continue;
}
// ๅใๆฟใใๅใซ 1 ใ็ถใใฆใใๅ ดๅ
ceil = divide(add(numberLength, 1), 2);
floor = divide(numberLength, 2);
if (remainder(numberLength, 2) == 1){
answer = add(answer, add(ceil, multiply(floor, add(floor, 1))));
} else {
answer = add(answer, multiply(ceil, add(ceil, 1)));
}
// N ๅ็ฎใฎ้ฃ็ถๆๅญใ ใฃใๅ ดๅ (N > 1)
if (lastSwitchIndex > 1){
answer = add(answer, multiply(floor, subtract(lastSwitchIndex, 2)));
answer = add(answer, ceil);
}
lastSwitchIndex = switchIndex;
zeroOrOne = n;
}
// ใซใผใใๆใใๅพใๆๅพใฎ้ฃ็ถๆๅญใฎ่จ็ฎใๅฎ่ก
switchIndex = add(switchIndex, 1);
numberLength = subtract(switchIndex, lastSwitchIndex);
if ("0".equals(zeroOrOne)){
answer = add(answer, multiply(numberLength, subtract(lastSwitchIndex, 1)));
answer = add(answer, divide(multiply(numberLength, subtract(numberLength, 1)), 2));
System.out.println(answer);
return;
}
ceil = divide(add(numberLength, 1), 2);
floor = divide(numberLength, 2);
if (remainder(numberLength, 2) == 1){
answer = add(answer, add(ceil, multiply(floor, add(floor, 1))));
} else {
answer = add(answer, multiply(ceil, ceil + 1));
}
// N ๅ็ฎใฎ้ฃ็ถๆๅญใ ใฃใๅ ดๅ (N > 1)
if (lastSwitchIndex > 1){
answer = add(answer, multiply(floor, subtract(lastSwitchIndex, 2)));
answer = add(answer, ceil);
}
System.out.println(answer);
}
private static long add(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.add(bd2).longValue();
}
private static long subtract(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.subtract(bd2).longValue();
}
private static long multiply(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.multiply(bd2).longValue();
}
private static long divide(long value, long devisor){
BigDecimal bd = BigDecimal.valueOf(value, 1);
bd.setScale(0, RoundingMode.DOWN);
BigDecimal dbDivisor = BigDecimal.valueOf(devisor);
return bd.divide(dbDivisor).longValue();
}
private static long remainder(long value, long devisor){
BigDecimal bd = BigDecimal.valueOf(value);
BigDecimal dbDivisor = BigDecimal.valueOf(devisor);
return bd.remainder(dbDivisor).longValue();
}
}
import java.io.StringWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
private static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
sc.nextInt();
String[] zeroOneArray = sc.next().split("");
// String[] zeroOneArray = new StringWriter(){{for(int i=0; i < 100000; i++) write("0"); }}.toString().split("");
List<String> zeroOneList = Arrays.asList(zeroOneArray);
zeroOneList.remove(""); // ๆๅใซๅ
ฅใฃใฆใใพใ็ฉบๆๅญใๅ้ค
long answer = 0;
String zeroOrOne = null;
long switchIndex = 0;
long lastSwitchIndex = 1;
long numberLength = 0;
long ceil = 0;
long floor = 0;
for (String n: zeroOneList){
switchIndex = add(switchIndex, 1);
// 1 ๆๅญ็ฎใฏ 1 or 0 ใ่จ้ฒใใฆๆฌกใธ
if (switchIndex == 1){
zeroOrOne = n;
continue;
}
// ๅใๆๅญใ็ถใๅ ดๅใฏๆฌกใธ
if (zeroOrOne.equals(n)){
continue;
}
// ๆๅญใๅใๆฟใใฃใๅ ดๅ
// ๅใๆฟใใๅใฎๆๅญใไฝๆๅญ็ถใใฆใใใใๅๅพ
numberLength = subtract(switchIndex, lastSwitchIndex);
// ๅใๆฟใใๅใซ 0 ใ็ถใใฆใใๅ ดๅ
if ("0".equals(zeroOrOne)){
answer = add(answer, multiply(numberLength, subtract(lastSwitchIndex, 1)));
answer = add(answer, divide(multiply(numberLength, subtract(numberLength, 1)), 2));
lastSwitchIndex = switchIndex;
zeroOrOne = n;
continue;
}
// ๅใๆฟใใๅใซ 1 ใ็ถใใฆใใๅ ดๅ
ceil = divide(add(numberLength, 1), 2);
floor = divide(numberLength, 2);
if (remainder(numberLength, 2) == 1){
answer = add(answer, add(ceil, multiply(floor, add(floor, 1))));
} else {
answer = add(answer, multiply(ceil, add(ceil, 1)));
}
// N ๅ็ฎใฎ้ฃ็ถๆๅญใ ใฃใๅ ดๅ (N > 1)
if (lastSwitchIndex > 1){
answer = add(answer, multiply(floor, subtract(lastSwitchIndex, 2)));
answer = add(answer, ceil);
}
lastSwitchIndex = switchIndex;
zeroOrOne = n;
}
// ใซใผใใๆใใๅพใๆๅพใฎ้ฃ็ถๆๅญใฎ่จ็ฎใๅฎ่ก
switchIndex = add(switchIndex, 1);
numberLength = subtract(switchIndex, lastSwitchIndex);
if ("0".equals(zeroOrOne)){
answer = add(answer, multiply(numberLength, subtract(lastSwitchIndex, 1)));
answer = add(answer, divide(multiply(numberLength, subtract(numberLength, 1)), 2));
System.out.println(answer);
return;
}
ceil = divide(add(numberLength, 1), 2);
floor = divide(numberLength, 2);
if (remainder(numberLength, 2) == 1){
answer = add(answer, add(ceil, multiply(floor, add(floor, 1))));
} else {
answer = add(answer, multiply(ceil, ceil + 1));
}
// N ๅ็ฎใฎ้ฃ็ถๆๅญใ ใฃใๅ ดๅ (N > 1)
if (lastSwitchIndex > 1){
answer = add(answer, multiply(floor, subtract(lastSwitchIndex, 2)));
answer = add(answer, ceil);
}
System.out.println(answer);
}
private static long add(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.add(bd2).longValue();
}
private static long subtract(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.subtract(bd2).longValue();
}
private static long multiply(long value1, long value2){
BigDecimal bd1 = BigDecimal.valueOf(value1);
BigDecimal bd2 = BigDecimal.valueOf(value2);
return bd1.multiply(bd2).longValue();
}
private static long divide(long value, long devisor){
BigDecimal bd = BigDecimal.valueOf(value);
bd.setScale(0, RoundingMode.DOWN);
BigDecimal dbDivisor = BigDecimal.valueOf(devisor);
return bd.divide(dbDivisor).longValue();
}
private static long remainder(long value, long devisor){
BigDecimal bd = BigDecimal.valueOf(value);
BigDecimal dbDivisor = BigDecimal.valueOf(devisor);
return bd.remainder(dbDivisor).longValue();
}
}
| ConDefects/ConDefects/Code/abc310_e/Java/43904614 |
condefects-java_data_726 | import java.io.*;
import java.util.*;
import java.math.*;
class Main {
public static void main(String[] args)
{
FastReader sc = new FastReader();
PrintWriter out=new PrintWriter(System.out);
int n=sc.nextInt();
int[] arr=new int[2*n];
for(int i=0;i<n;++i) arr[i]=sc.nextInt();
int c=0;
for(int i=0;i<2*n-2;++i) {
if(arr[i]==arr[i+2]) ++c;
}
out.println(c);
out.flush();
}
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.math.*;
class Main {
public static void main(String[] args)
{
FastReader sc = new FastReader();
PrintWriter out=new PrintWriter(System.out);
int n=sc.nextInt();
int[] arr=new int[2*n];
for(int i=0;i<2*n;++i) arr[i]=sc.nextInt();
int c=0;
for(int i=0;i<2*n-2;++i) {
if(arr[i]==arr[i+2]) ++c;
}
out.println(c);
out.flush();
}
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/abc359_b/Java/54893626 |
condefects-java_data_727 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = Arrays.stream(new int[n*2]).map(e -> sc.nextInt()).toArray();
int count = 0;
for(int i = 0; i < n - 2; i++) {
if(a[i] == a[i + 2]) {
count++;
}
}
System.out.println(count);
}
}
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = Arrays.stream(new int[n*2]).map(e -> sc.nextInt()).toArray();
int count = 0;
for(int i = 0; i < 2*n - 2; i++) {
if(a[i] == a[i + 2]) {
count++;
}
}
System.out.println(count);
}
} | ConDefects/ConDefects/Code/abc359_b/Java/54959215 |
condefects-java_data_728 | import java.io.*;
import java.util.*;
public class Main{
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
public static void main(String[] args) throws IOException{
int N = readInt();
int count = 0;
Map<Integer, Integer> firstAppearanceIndex = new HashMap<>();
for(int i = 0; i < 2 * N; i++){
int input = readInt();
if(!firstAppearanceIndex.containsKey(input)){
firstAppearanceIndex.put(input, i);
}
else{
if(i - firstAppearanceIndex.get(input) == 2){
count++;
}
}
System.out.println(count);
}
}
static String next () throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static int readInt () throws IOException {
return Integer.parseInt(next());
}
}
import java.io.*;
import java.util.*;
public class Main{
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st;
public static void main(String[] args) throws IOException{
int N = readInt();
int count = 0;
Map<Integer, Integer> firstAppearanceIndex = new HashMap<>();
for(int i = 0; i < 2 * N; i++){
int input = readInt();
if(!firstAppearanceIndex.containsKey(input)){
firstAppearanceIndex.put(input, i);
}
else{
if(i - firstAppearanceIndex.get(input) == 2){
count++;
}
}
}
System.out.println(count);
}
static String next () throws IOException {
while (st == null || !st.hasMoreTokens())
st = new StringTokenizer(br.readLine().trim());
return st.nextToken();
}
static int readInt () throws IOException {
return Integer.parseInt(next());
}
} | ConDefects/ConDefects/Code/abc359_b/Java/54977681 |
condefects-java_data_729 | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), a1 = sc.nextInt(), a2 = sc.nextInt(), an, count = 0;
for(int i=3; i<2*n; i++) {
an = sc.nextInt();
if(a1 == an) ++count;
a1 = a2;
a2 = an;
}
System.out.print(count);
}
}
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), a1 = sc.nextInt(), a2 = sc.nextInt(), an, count = 0;
for(int i=2; i<2*n; i++) {
an = sc.nextInt();
if(a1 == an) ++count;
a1 = a2;
a2 = an;
}
System.out.print(count);
}
} | ConDefects/ConDefects/Code/abc359_b/Java/54971222 |
condefects-java_data_730 | import java.util.*;
public class Main {
static int N = 300010;
static int n, m,cnt;
static long k;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
k = sc.nextLong();
String s = sc.next();
s += s;
int [] pre = new int [2 * n + 1];
for (int i = 1; i <= 2 * n ; ++i) {
char c = s.charAt(i - 1);
pre[i] = pre[i - 1] + (c == 'x' ? 1 : 0);
}
long ret = k / pre[n] * n;
int tmp = 0;
m -= k / pre[n];
k %= pre[n];
for(int l = 0,r = 0; r <= n; ){
while(r <= 2 * n && pre[r] <= k + pre[l]) ++r;
l++;
if(m == 1) tmp = Math.max(tmp,Math.min(r,n) - l);
else if(m > 1) tmp = Math.max(tmp,r - l);
}
System.out.println(ret + tmp);
}
}
import java.util.*;
public class Main {
static int N = 300010;
static int n, m,cnt;
static long k;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
m = sc.nextInt();
k = sc.nextLong();
String s = sc.next();
s += s;
int [] pre = new int [2 * n + 1];
for (int i = 1; i <= 2 * n ; ++i) {
char c = s.charAt(i - 1);
pre[i] = pre[i - 1] + (c == 'x' ? 1 : 0);
}
long ret = k / pre[n] * n;
int tmp = 0;
m -= k / pre[n];
k %= pre[n];
for(int l = 0,r = 0; r <= 2 * n; ){
while(r <= 2 * n && pre[r] <= k + pre[l]) ++r;
l++;
if(m == 1) tmp = Math.max(tmp,Math.min(r,n) - l);
else if(m > 1) tmp = Math.max(tmp,r - l);
}
System.out.println(ret + tmp);
}
} | ConDefects/ConDefects/Code/abc300_f/Java/45085813 |
condefects-java_data_731 |
import java.util.Scanner;
/*
*/
public class Main {
static long n, m, k;
static long[] sum = new long[300005];
static String s;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextLong();
m = sc.nextLong();
k = sc.nextLong();
sc.nextLine();
s = sc.nextLine();
s = ' ' + s;
for (int i = 1; i <= n; ++i) {
sum[i] = sum[i - 1];
if (s.charAt(i) == 'x')
sum[i]++;
}
long l = k, r = n * m, ans = k;
while (l <= r) {
long mid = (l + r) >> 1;
if (check(mid)) {
ans = mid;
l = mid + 1;
}
else {
r = mid - 1;
}
}
System.out.println(ans);
}
public static boolean check(long val) {
boolean ok = false;
long x = sum[(int) n] * (val / n) + sum[(int) ((val - 1) % n)+ 1];
for (int i = 1; i <= n; ++i) {
if (x <= k) {
ok = true;
break;
}
if (val + i > n * m)
return ok;
if (s.charAt(i) == 'x')
x -= 1;
if (s.charAt((int) ((val + i - 1) % n) + 1) == 'x') {
x += 1;
}
}
if (x <= k)
ok = true;
return ok;
}
}
import java.util.Scanner;
/*
*/
public class Main {
static long n, m, k;
static long[] sum = new long[300005];
static String s;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextLong();
m = sc.nextLong();
k = sc.nextLong();
sc.nextLine();
s = sc.nextLine();
s = ' ' + s;
for (int i = 1; i <= n; ++i) {
sum[i] = sum[i - 1];
if (s.charAt(i) == 'x')
sum[i]++;
}
long l = k, r = n * m, ans = k;
while (l <= r) {
long mid = (l + r) >> 1;
if (check(mid)) {
ans = mid;
l = mid + 1;
}
else {
r = mid - 1;
}
}
System.out.println(ans);
}
public static boolean check(long val) {
boolean ok = false;
long x = sum[(int) n] * (val / n) + sum[(int) (val % n)];
for (int i = 1; i <= n; ++i) {
if (x <= k) {
ok = true;
break;
}
if (val + i > n * m)
return ok;
if (s.charAt(i) == 'x')
x -= 1;
if (s.charAt((int) ((val + i - 1) % n) + 1) == 'x') {
x += 1;
}
}
if (x <= k)
ok = true;
return ok;
}
} | ConDefects/ConDefects/Code/abc300_f/Java/41328594 |
condefects-java_data_732 | import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
static int MAX = (int)1e7;
static int ans = 0;
static boolean[] used;
static ArrayList<ArrayList<Integer>> map;
public static void solve() {
int N = sc.nextInt();
int M = sc.nextInt();
map = new ArrayList<>();
for(int i = 0; i < N; i++){
map.add(new ArrayList<>());
}
for(int i = 0; i < M; i++){
int s = sc.nextInt()-1;
int t = sc.nextInt()-1;
map.get(s).add(t);
map.get(t).add(s);
}
used = new boolean[N];
used[0] = true;
dfs(0);
pw.println(Math.min(MAX,ans));
}
public static void dfs(int v){
ans++;
if(ans >= MAX) return;
for(int next : map.get(v)){
if(!used[next]){
used[next] = true;
dfs(next);
used[next] = false;
}
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
public static void main(String[] args) throws Exception {
//int T = sc.nextInt();
//for(int i = 0; i < T; i++)solve();
solve();
pw.flush();
}
static int MAX = (int)1e6;
static int ans = 0;
static boolean[] used;
static ArrayList<ArrayList<Integer>> map;
public static void solve() {
int N = sc.nextInt();
int M = sc.nextInt();
map = new ArrayList<>();
for(int i = 0; i < N; i++){
map.add(new ArrayList<>());
}
for(int i = 0; i < M; i++){
int s = sc.nextInt()-1;
int t = sc.nextInt()-1;
map.get(s).add(t);
map.get(t).add(s);
}
used = new boolean[N];
used[0] = true;
dfs(0);
pw.println(Math.min(MAX,ans));
}
public static void dfs(int v){
ans++;
if(ans >= MAX) return;
for(int next : map.get(v)){
if(!used[next]){
used[next] = true;
dfs(next);
used[next] = false;
}
}
}
}
/**
* refercence : https://github.com/NASU41/AtCoderLibraryForJava/blob/master/ContestIO/ContestScanner.java
*/
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
| ConDefects/ConDefects/Code/abc284_e/Java/43231157 |
condefects-java_data_733 | import java.util.*;
import java.io.*;
public class Main {
static long mod = (long)(1e9+7);
static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static void main(String[] args) throws IOException {
FastReader sc = new FastReader();
int n = sc.nextInt();
int dp[] = new int[1<<n];
int arr[][]= new int[n][n];
for( int i =0 ; i< n;i++) {
for( int j =i+1 ;j< n; j++) {
arr[i][j] = sc.nextInt(); arr[j][i] = arr[i][j];
}
}
for( int j =0 ; j< (1<< n) ;j++) {
for( int i = 0 ;i < n;i++) {
if( ((j>>i)&1) == 1) continue;
for( int k =0 ;k < n ;k++) {
if( ((j>>k)&1) == 1) continue;
dp[j|(1<<i)|(1<<k)] = Math.max( dp[j|(1<<i)|(1<<k)], dp[j] + arr[i][k]);
}
}
}
out.println(dp[(1<<n)-1]);
out.flush();
}
/*
* Accept that you maybe thinking wrong
* have patience
* Read the question carefully
* Look at the bigger picture
* Do mathetical calculations
* use the hints
* Read the question again
* think of binary search
* look at test cases
* do significant case work
*/
static class DSU {
int[] p, rank, setSize;
int numSets;
public DSU(int N) {
p = new int[numSets = N];
rank = new int[N];
setSize = new int[N];
for (int i = 0; i < N; i++) {
p[i] = i;
setSize[i] = 1;
}
}
public int findSet(int i) {
return p[i] == i ? i : (p[i] = findSet(p[i]));
}
public boolean isSameSet(int i, int j) {
return findSet(i) == findSet(j);
}
public void unionSet(int i, int j) {
if (isSameSet(i, j))
return;
numSets--;
int x = findSet(i), y = findSet(j);
if (rank[x] > rank[y]) {
p[y] = x;
setSize[x] += setSize[y];
} else {
p[x] = y;
setSize[y] += setSize[x];
if (rank[x] == rank[y])
rank[y]++;
}
}
public int numDisjointSets() {
return numSets;
}
public int sizeOfSet(int i) {
return setSize[findSet(i)];
}
public ArrayList<Integer> getParents()
{
ArrayList<Integer>pr = new ArrayList<>();
for(int i=0;i<p.length;i++)
{
if(p[i]==i && setSize[i]>2)
pr.add(i);
}
return pr;
}
}
static long modInverse(long A, long M)
{
int g = (int)gcd(A, M);
if (g != 1)
return -1;
else {
return power(A, M - 2, M);
}
}
static long power(long x, long y, long p)
{
long res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0)
{
if ((y & 1) != 0)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res%p;
}
public static boolean ifpowof2(long n ) {
return ((n&(n-1)) == 0);
}
static boolean isprime(long x ) {
if( x== 2) {
return true;
}
if( x%2 == 0) {
return false;
}
for( long i = 3 ;i*i <= x ;i+=2) {
if( x%i == 0) {
return false;
}
}
return true;
}
static boolean[] sieveOfEratosthenes(long n) {
boolean prime[] = new boolean[(int)n + 1];
for (int i = 0; i <= n; i++) {
prime[i] = true;
}
for (long p = 2; p * p <= n; p++) {
if (prime[(int)p] == true) {
for (long i = p * p; i <= n; i += p)
prime[(int)i] = false;
}
}
prime[0] = prime[1] = false;
return prime;
}
static int[] SieveOfEratosthenes(long n) {
boolean prime[] = new boolean[(int)n + 1];
int arr[] = new int[(int)n+1];
for (int i = 0; i <= n; i++) {
prime[i] = true;
arr[i] = i;
}
for (long p = 2; p * p <= n; p++) {
if (prime[(int)p] == true) {
arr[(int)p] = (int)p;
for (long i = p * p; i <= n; i += p){
arr[(int)i] = Math.min(arr[(int)i] , (int)p);
prime[(int)i] = false;
}
}
}
prime[0] = prime[1] = false;
arr[0] = arr[1] = 0;
return arr;
}
public List<Integer> goodIndices(int[] nums, int k) {
int n = nums.length;
int fst[] = nextLargerElement(nums, n);
int scnd[] = nextlargerElement(nums, n);
List<Integer> ans = new ArrayList<>();
for( int i = 0 ;i < n; i++) {
if( fst[i] == -1 || scnd[i] == -1) {
continue;
}
if( fst[i]-i >= k && i - scnd[i] >= k) {
ans.add(i);
}
}
return ans;
}
public static int[] nextLargerElement(int[] arr, int n) {
Stack<Integer> stack = new Stack<>();
int rtrn[] = new int[n];
rtrn[n-1] = -1;
stack.push( n-1);
for( int i = n-2 ;i >= 0 ; i--){
int temp = arr[i];
int lol = -1;
while( !stack.isEmpty() && arr[stack.peek()] <= temp){
if(arr[stack.peek()] == temp ) {
lol = stack.peek();
}
stack.pop();
}
if( stack.isEmpty()){
if( lol != -1) {
rtrn[i] = lol;
}
else {
rtrn[i] = -1;
}
}
else{
rtrn[i] = stack.peek();
}
stack.push( i);
}
return rtrn;
}
public static int[] nextlargerElement(int[] arr, int n) {
Stack<Integer> stack = new Stack<>();
int rtrn[] = new int[n];
rtrn[0] = -1;
stack.add( 0);
for( int i = 1 ;i < n ; i++){
int temp = arr[i];
int lol = -1;
while( !stack.isEmpty() && arr[stack.peek()] <= temp){
if(arr[stack.peek()] == temp ) {
lol = stack.peek();
}
stack.pop();
}
if( stack.isEmpty()){
if( lol != -1) {
rtrn[i] = lol;
}
else {
rtrn[i] = -1;
}
}
else{
rtrn[i] = stack.peek();
}
stack.add( i);
}
return rtrn;
}
static void mysort(int[] arr) {
for(int i=0;i<arr.length;i++) {
int rand = (int) (Math.random() * arr.length);
int loc = arr[rand];
arr[rand] = arr[i];
arr[i] = loc;
}
Arrays.sort(arr);
}
static void mySort(long[] arr) {
for(int i=0;i<arr.length;i++) {
int rand = (int) (Math.random() * arr.length);
long loc = arr[rand];
arr[rand] = arr[i];
arr[i] = loc;
}
Arrays.sort(arr);
}
static long gcd(long a, long b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
static long lcm(long a, long b)
{
return (a / gcd(a, b)) * b;
}
static long rightmostsetbit(long n) {
return n&-n;
}
static long leftmostsetbit(long n)
{
long k = (long)(Math.log(n) / Math.log(2));
return k;
}
static HashMap<Long,Long> primefactor( long n){
HashMap<Long ,Long> hm = new HashMap<>();
long temp = 0;
while( n%2 == 0) {
temp++;
n/=2;
}
if( temp!= 0) {
hm.put( 2L, temp);
}
long c = (long)Math.sqrt(n);
for( long i = 3 ; i <= c ; i+=2) {
temp = 0;
while( n% i == 0) {
temp++;
n/=i;
}
if( temp!= 0) {
hm.put( i, temp);
}
}
if( n!= 1) {
hm.put( n , 1L);
}
return hm;
}
static TreeSet<Long> allfactors(long abs) {
HashMap<Long,Integer> hm = new HashMap<>();
TreeSet<Long> rtrn = new TreeSet<>();
rtrn.add(1L);
for( long i = 2 ;i*i <= abs; i++) {
if( abs% i == 0) {
hm.put( i , 0);
hm.put(abs/i, 0);
}
}
for( long x : hm.keySet()) {
rtrn.add(x);
}
if( abs != 0) {
rtrn.add(abs);
}
return rtrn;
}
public static int[][] prefixsum( int n , int m , int arr[][] ){
int prefixsum[][] = new int[n+1][m+1];
for( int i = 1 ;i <= n ;i++) {
for( int j = 1 ; j<= m ; j++) {
int toadd = 0;
if( arr[i-1][j-1] == 1) {
toadd = 1;
}
prefixsum[i][j] = toadd + prefixsum[i][j-1] + prefixsum[i-1][j] - prefixsum[i-1][j-1];
}
}
return prefixsum;
}
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.util.*;
import java.io.*;
public class Main {
static long mod = (long)(1e9+7);
static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
public static void main(String[] args) throws IOException {
FastReader sc = new FastReader();
int n = sc.nextInt();
long dp[] = new long[1<<n];
int arr[][]= new int[n][n];
for( int i =0 ; i< n;i++) {
for( int j =i+1 ;j< n; j++) {
arr[i][j] = sc.nextInt(); arr[j][i] = arr[i][j];
}
}
for( int j =0 ; j< (1<< n) ;j++) {
for( int i = 0 ;i < n;i++) {
if( ((j>>i)&1) == 1) continue;
for( int k =0 ;k < n ;k++) {
if( ((j>>k)&1) == 1) continue;
dp[j|(1<<i)|(1<<k)] = Math.max( dp[j|(1<<i)|(1<<k)], dp[j] + arr[i][k]);
}
}
}
out.println(dp[(1<<n)-1]);
out.flush();
}
/*
* Accept that you maybe thinking wrong
* have patience
* Read the question carefully
* Look at the bigger picture
* Do mathetical calculations
* use the hints
* Read the question again
* think of binary search
* look at test cases
* do significant case work
*/
static class DSU {
int[] p, rank, setSize;
int numSets;
public DSU(int N) {
p = new int[numSets = N];
rank = new int[N];
setSize = new int[N];
for (int i = 0; i < N; i++) {
p[i] = i;
setSize[i] = 1;
}
}
public int findSet(int i) {
return p[i] == i ? i : (p[i] = findSet(p[i]));
}
public boolean isSameSet(int i, int j) {
return findSet(i) == findSet(j);
}
public void unionSet(int i, int j) {
if (isSameSet(i, j))
return;
numSets--;
int x = findSet(i), y = findSet(j);
if (rank[x] > rank[y]) {
p[y] = x;
setSize[x] += setSize[y];
} else {
p[x] = y;
setSize[y] += setSize[x];
if (rank[x] == rank[y])
rank[y]++;
}
}
public int numDisjointSets() {
return numSets;
}
public int sizeOfSet(int i) {
return setSize[findSet(i)];
}
public ArrayList<Integer> getParents()
{
ArrayList<Integer>pr = new ArrayList<>();
for(int i=0;i<p.length;i++)
{
if(p[i]==i && setSize[i]>2)
pr.add(i);
}
return pr;
}
}
static long modInverse(long A, long M)
{
int g = (int)gcd(A, M);
if (g != 1)
return -1;
else {
return power(A, M - 2, M);
}
}
static long power(long x, long y, long p)
{
long res = 1;
x = x % p;
if (x == 0)
return 0;
while (y > 0)
{
if ((y & 1) != 0)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res%p;
}
public static boolean ifpowof2(long n ) {
return ((n&(n-1)) == 0);
}
static boolean isprime(long x ) {
if( x== 2) {
return true;
}
if( x%2 == 0) {
return false;
}
for( long i = 3 ;i*i <= x ;i+=2) {
if( x%i == 0) {
return false;
}
}
return true;
}
static boolean[] sieveOfEratosthenes(long n) {
boolean prime[] = new boolean[(int)n + 1];
for (int i = 0; i <= n; i++) {
prime[i] = true;
}
for (long p = 2; p * p <= n; p++) {
if (prime[(int)p] == true) {
for (long i = p * p; i <= n; i += p)
prime[(int)i] = false;
}
}
prime[0] = prime[1] = false;
return prime;
}
static int[] SieveOfEratosthenes(long n) {
boolean prime[] = new boolean[(int)n + 1];
int arr[] = new int[(int)n+1];
for (int i = 0; i <= n; i++) {
prime[i] = true;
arr[i] = i;
}
for (long p = 2; p * p <= n; p++) {
if (prime[(int)p] == true) {
arr[(int)p] = (int)p;
for (long i = p * p; i <= n; i += p){
arr[(int)i] = Math.min(arr[(int)i] , (int)p);
prime[(int)i] = false;
}
}
}
prime[0] = prime[1] = false;
arr[0] = arr[1] = 0;
return arr;
}
public List<Integer> goodIndices(int[] nums, int k) {
int n = nums.length;
int fst[] = nextLargerElement(nums, n);
int scnd[] = nextlargerElement(nums, n);
List<Integer> ans = new ArrayList<>();
for( int i = 0 ;i < n; i++) {
if( fst[i] == -1 || scnd[i] == -1) {
continue;
}
if( fst[i]-i >= k && i - scnd[i] >= k) {
ans.add(i);
}
}
return ans;
}
public static int[] nextLargerElement(int[] arr, int n) {
Stack<Integer> stack = new Stack<>();
int rtrn[] = new int[n];
rtrn[n-1] = -1;
stack.push( n-1);
for( int i = n-2 ;i >= 0 ; i--){
int temp = arr[i];
int lol = -1;
while( !stack.isEmpty() && arr[stack.peek()] <= temp){
if(arr[stack.peek()] == temp ) {
lol = stack.peek();
}
stack.pop();
}
if( stack.isEmpty()){
if( lol != -1) {
rtrn[i] = lol;
}
else {
rtrn[i] = -1;
}
}
else{
rtrn[i] = stack.peek();
}
stack.push( i);
}
return rtrn;
}
public static int[] nextlargerElement(int[] arr, int n) {
Stack<Integer> stack = new Stack<>();
int rtrn[] = new int[n];
rtrn[0] = -1;
stack.add( 0);
for( int i = 1 ;i < n ; i++){
int temp = arr[i];
int lol = -1;
while( !stack.isEmpty() && arr[stack.peek()] <= temp){
if(arr[stack.peek()] == temp ) {
lol = stack.peek();
}
stack.pop();
}
if( stack.isEmpty()){
if( lol != -1) {
rtrn[i] = lol;
}
else {
rtrn[i] = -1;
}
}
else{
rtrn[i] = stack.peek();
}
stack.add( i);
}
return rtrn;
}
static void mysort(int[] arr) {
for(int i=0;i<arr.length;i++) {
int rand = (int) (Math.random() * arr.length);
int loc = arr[rand];
arr[rand] = arr[i];
arr[i] = loc;
}
Arrays.sort(arr);
}
static void mySort(long[] arr) {
for(int i=0;i<arr.length;i++) {
int rand = (int) (Math.random() * arr.length);
long loc = arr[rand];
arr[rand] = arr[i];
arr[i] = loc;
}
Arrays.sort(arr);
}
static long gcd(long a, long b)
{
if (a == 0)
return b;
return gcd(b % a, a);
}
static long lcm(long a, long b)
{
return (a / gcd(a, b)) * b;
}
static long rightmostsetbit(long n) {
return n&-n;
}
static long leftmostsetbit(long n)
{
long k = (long)(Math.log(n) / Math.log(2));
return k;
}
static HashMap<Long,Long> primefactor( long n){
HashMap<Long ,Long> hm = new HashMap<>();
long temp = 0;
while( n%2 == 0) {
temp++;
n/=2;
}
if( temp!= 0) {
hm.put( 2L, temp);
}
long c = (long)Math.sqrt(n);
for( long i = 3 ; i <= c ; i+=2) {
temp = 0;
while( n% i == 0) {
temp++;
n/=i;
}
if( temp!= 0) {
hm.put( i, temp);
}
}
if( n!= 1) {
hm.put( n , 1L);
}
return hm;
}
static TreeSet<Long> allfactors(long abs) {
HashMap<Long,Integer> hm = new HashMap<>();
TreeSet<Long> rtrn = new TreeSet<>();
rtrn.add(1L);
for( long i = 2 ;i*i <= abs; i++) {
if( abs% i == 0) {
hm.put( i , 0);
hm.put(abs/i, 0);
}
}
for( long x : hm.keySet()) {
rtrn.add(x);
}
if( abs != 0) {
rtrn.add(abs);
}
return rtrn;
}
public static int[][] prefixsum( int n , int m , int arr[][] ){
int prefixsum[][] = new int[n+1][m+1];
for( int i = 1 ;i <= n ;i++) {
for( int j = 1 ; j<= m ; j++) {
int toadd = 0;
if( arr[i-1][j-1] == 1) {
toadd = 1;
}
prefixsum[i][j] = toadd + prefixsum[i][j-1] + prefixsum[i-1][j] - prefixsum[i-1][j-1];
}
}
return prefixsum;
}
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/abc318_d/Java/45289463 |
condefects-java_data_734 | import java.util.Scanner;
public class Main {
public static int n;
public static long[][] d;
public static boolean[] isUsed;
public static long ans = 0;
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
n = sc.nextInt();
d = new long[n][n];
isUsed = new boolean[n];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
d[i][j] = sc.nextLong();
}
}
if (n % 2 == 0) {
for (int i = 1; i < n; i++) {
dfs(0, i, d[0][i]);
}
} else {
// ๅฅๆฐใฎๅ ดๅใฒใจใคไฝฟใใชใ้ ็นใใใ
for (int i = 1; i < n; i++) {
isUsed[i] = true;
for (int j = 1; j < n; j++) {
if (j == i) {
continue;
}
dfs(0, j, d[0][j]);
}
isUsed[i] = false;
}
isUsed[0]=true;
for (int i = 2; i < args.length; i++) {
dfs(1,i,d[1][i]);
}
}
System.out.println(ans);
}
}
// ้ธใฐใใฆใใชใใใกใใฃใจใๅฐใใ้ ็นใๆฌกใซ้ธใถใจใใฆๆทฑใๅชๅ
ๆข็ดข
public static void dfs(int smallerVertice, int largerVertice, long totalWeight) {
isUsed[smallerVertice] = true;
isUsed[largerVertice] = true;
int nextSmaller = -1;
for (int i = smallerVertice + 1; i < n; i++) {
if (!isUsed[i]) {
nextSmaller = i;
break;
}
}
if (nextSmaller == -1) {
ans = Math.max(totalWeight, ans);
isUsed[smallerVertice] = false;
isUsed[largerVertice] = false;
return;
}
for (int j = nextSmaller + 1; j < n; j++) {
if (isUsed[j]) {
continue;
}
dfs(nextSmaller, j, totalWeight + d[nextSmaller][j]);
}
ans = Math.max(totalWeight, ans);
isUsed[smallerVertice] = false;
isUsed[largerVertice] = false;
}
}
import java.util.Scanner;
public class Main {
public static int n;
public static long[][] d;
public static boolean[] isUsed;
public static long ans = 0;
public static void main(String[] args) {
try (Scanner sc = new Scanner(System.in)) {
n = sc.nextInt();
d = new long[n][n];
isUsed = new boolean[n];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
d[i][j] = sc.nextLong();
}
}
if (n % 2 == 0) {
for (int i = 1; i < n; i++) {
dfs(0, i, d[0][i]);
}
} else {
// ๅฅๆฐใฎๅ ดๅใฒใจใคไฝฟใใชใ้ ็นใใใ
for (int i = 1; i < n; i++) {
isUsed[i] = true;
for (int j = 1; j < n; j++) {
if (j == i) {
continue;
}
dfs(0, j, d[0][j]);
}
isUsed[i] = false;
}
isUsed[0]=true;
for (int i = 2; i < n; i++) {
dfs(1,i,d[1][i]);
}
}
System.out.println(ans);
}
}
// ้ธใฐใใฆใใชใใใกใใฃใจใๅฐใใ้ ็นใๆฌกใซ้ธใถใจใใฆๆทฑใๅชๅ
ๆข็ดข
public static void dfs(int smallerVertice, int largerVertice, long totalWeight) {
isUsed[smallerVertice] = true;
isUsed[largerVertice] = true;
int nextSmaller = -1;
for (int i = smallerVertice + 1; i < n; i++) {
if (!isUsed[i]) {
nextSmaller = i;
break;
}
}
if (nextSmaller == -1) {
ans = Math.max(totalWeight, ans);
isUsed[smallerVertice] = false;
isUsed[largerVertice] = false;
return;
}
for (int j = nextSmaller + 1; j < n; j++) {
if (isUsed[j]) {
continue;
}
dfs(nextSmaller, j, totalWeight + d[nextSmaller][j]);
}
ans = Math.max(totalWeight, ans);
isUsed[smallerVertice] = false;
isUsed[largerVertice] = false;
}
} | ConDefects/ConDefects/Code/abc318_d/Java/45234369 |
condefects-java_data_735 | import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
static Map<Integer, Map<Integer, Boolean>> grid = new HashMap<>();
static int N;
static int usedCount = 0;
static int connect = 0;
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
N = scn.nextInt();
int ans = 0;
for ( int i = 0; i < N; i++) {
int x = scn.nextInt();
int y = scn.nextInt();
if ( grid.containsKey( x)) {
grid.get( x).put( y, false);
}
else {
Map<Integer, Boolean> subGrid = new HashMap<>();
subGrid.put( y, false);
grid.put( x, subGrid);
}
}
for ( int x : grid.keySet()) {
for ( int y : grid.get( x).keySet()) {
ans += recursion( x, y);
}
}
System.out.println( ans);
}
public static int recursion( int x, int y) {
if ( usedCount < N && !grid.get( x).get( y)) {
if ( grid.get( x) != null) {
if ( grid.get( x).get( y - 1) != null && grid.get( x).get( y - 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x, y - 1);
grid.get( x).put( y - 1, true);
}
if ( grid.get( x).get( y + 1) != null && !grid.get( x).get( y + 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x, y + 1);
grid.get( x).put( y + 1, true);
}
}
if ( grid.get( x - 1) != null) {
if ( grid.keySet().contains( x - 1)) {
if ( grid.get( x - 1).get( y) != null && !grid.get( x - 1).get( y)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x - 1, y);
grid.get( x - 1).put( y, true);
}
if ( grid.get( x - 1).get( y - 1) != null && !grid.get( x - 1).get( y - 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x - 1, y - 1);
grid.get( x - 1).put( y - 1, true);
}
}
}
if ( grid.get( x + 1) != null) {
if ( grid.keySet().contains( x + 1)) {
if ( grid.get( x + 1).get( y + 1) != null && !grid.get( x + 1).get( y + 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x + 1, y + 1);
grid.get( x + 1).put( y + 1, true);
}
if ( grid.get( x + 1).get( y) != null && !grid.get( x + 1).get( y)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x + 1, y);
grid.get( x + 1).put( y, true);
}
}
}
return 1;
}
else {
return 0;
}
}
}
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
static Map<Integer, Map<Integer, Boolean>> grid = new HashMap<>();
static int N;
static int usedCount = 0;
static int connect = 0;
public static void main( String[] args) {
Scanner scn = new Scanner( System.in);
N = scn.nextInt();
int ans = 0;
for ( int i = 0; i < N; i++) {
int x = scn.nextInt();
int y = scn.nextInt();
if ( grid.containsKey( x)) {
grid.get( x).put( y, false);
}
else {
Map<Integer, Boolean> subGrid = new HashMap<>();
subGrid.put( y, false);
grid.put( x, subGrid);
}
}
for ( int x : grid.keySet()) {
for ( int y : grid.get( x).keySet()) {
ans += recursion( x, y);
}
}
System.out.println( ans);
}
public static int recursion( int x, int y) {
if ( usedCount < N && !grid.get( x).get( y)) {
if ( grid.get( x) != null) {
if ( grid.get( x).get( y - 1) != null && !grid.get( x).get( y - 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x, y - 1);
grid.get( x).put( y - 1, true);
}
if ( grid.get( x).get( y + 1) != null && !grid.get( x).get( y + 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x, y + 1);
grid.get( x).put( y + 1, true);
}
}
if ( grid.get( x - 1) != null) {
if ( grid.keySet().contains( x - 1)) {
if ( grid.get( x - 1).get( y) != null && !grid.get( x - 1).get( y)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x - 1, y);
grid.get( x - 1).put( y, true);
}
if ( grid.get( x - 1).get( y - 1) != null && !grid.get( x - 1).get( y - 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x - 1, y - 1);
grid.get( x - 1).put( y - 1, true);
}
}
}
if ( grid.get( x + 1) != null) {
if ( grid.keySet().contains( x + 1)) {
if ( grid.get( x + 1).get( y + 1) != null && !grid.get( x + 1).get( y + 1)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x + 1, y + 1);
grid.get( x + 1).put( y + 1, true);
}
if ( grid.get( x + 1).get( y) != null && !grid.get( x + 1).get( y)) {
usedCount++;
connect++;
grid.get( x).put( y, true);
recursion( x + 1, y);
grid.get( x + 1).put( y, true);
}
}
}
return 1;
}
else {
return 0;
}
}
}
| ConDefects/ConDefects/Code/abc269_d/Java/35178532 |
condefects-java_data_736 | import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
int N = 2001;
boolean[][] occ = new boolean[N][N];
boolean[][] vis = new boolean[N][N];
public class Tuple<X, Y> {
public final X x;
public final Y y;
public Tuple(X x, Y y) {
this.x = x;
this.y = y;
}
}
private void solve() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
List<Tuple<Integer, Integer>> pos = new ArrayList<>();
for (int i = 0; i < N; i++) {
int x = sc.nextInt() + 1000;
int y = sc.nextInt() + 1000;
occ[x][y] = true;
pos.add(new Tuple<Integer, Integer>(x, y));
}
int count = 0;
for (Tuple t : pos) {
if (!vis[(int) t.x][(int) t.y]) {
dfs((Integer) t.x, (Integer) t.y);
count++;
}
}
System.out.println(count);
}
private void dfs(int x, int y) {
if (x < 0 || x >= N || y < 0 || y >= N) {
return;
}
if(!occ[x][y] || !vis[x][y]){
return;
}
vis[x][y] = true;
int[] dirX = new int[]{-1, -1, 0, 0, 1, 1};
int[] dirY = new int[]{-1, 0, -1, 1, 0, 1};
for (int i = 0; i < dirX.length; i++) {
dfs(x + dirX[i], y + dirY[i]);
}
}
public static void main(String[] args) {
(new Main()).solve();
}
}
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main {
int N = 2001;
boolean[][] occ = new boolean[N][N];
boolean[][] vis = new boolean[N][N];
public class Tuple<X, Y> {
public final X x;
public final Y y;
public Tuple(X x, Y y) {
this.x = x;
this.y = y;
}
}
private void solve() {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
List<Tuple<Integer, Integer>> pos = new ArrayList<>();
for (int i = 0; i < N; i++) {
int x = sc.nextInt() + 1000;
int y = sc.nextInt() + 1000;
occ[x][y] = true;
pos.add(new Tuple<Integer, Integer>(x, y));
}
int count = 0;
for (Tuple t : pos) {
if (!vis[(int) t.x][(int) t.y]) {
dfs((Integer) t.x, (Integer) t.y);
count++;
}
}
System.out.println(count);
}
private void dfs(int x, int y) {
if (x < 0 || x >= N || y < 0 || y >= N) {
return;
}
if(!occ[x][y] || vis[x][y]){
return;
}
vis[x][y] = true;
int[] dirX = new int[]{-1, -1, 0, 0, 1, 1};
int[] dirY = new int[]{-1, 0, -1, 1, 0, 1};
for (int i = 0; i < dirX.length; i++) {
dfs(x + dirX[i], y + dirY[i]);
}
}
public static void main(String[] args) {
(new Main()).solve();
}
}
| ConDefects/ConDefects/Code/abc269_d/Java/35088674 |
condefects-java_data_737 | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
if(sc.nextInt() + sc.nextInt() == 0) System.out.print(1);
else System.out.print(1);
}
}
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
if(sc.nextInt() + sc.nextInt() == 0) System.out.print(1);
else System.out.print(0);
}
} | ConDefects/ConDefects/Code/abc343_a/Java/54878290 |
condefects-java_data_738 | import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
public static final long MOD = ((long) 1e9 + 7L);
public static void solve() {
var a = sc.nextInt();
var b = sc.nextInt();
var ac = a + b;
for (var i = 0; i <= 9; i++) {
if (a != ac) {
pw.println(i);
return;
}
}
}
/**
* 10้ฒๆฐใใX้ฒๆฐใฎๆๅญๅใซๅคๆใใใ
*
* @MEMO ้ๅใใฎๅคๆใฏLong.parseUnsignedLong(String s, int radix)ใๅฉ็จใใ๏ผ
*
* @param n ๅคๆๅ
๏ผ๏ผ๏ผ้ฒๆฐ๏ผ
* @param newBase ๅคๆๅพใฎๅบๆฐ
* @return newBaseๅคๆๅพใฎString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
public static int[] dpArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] dpArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE ใชใผใใผใใญใผใซๆณจๆใใใใจใ
// ใชใผใใผใใญใผใฎใใใใใใๅ ดๅใฏไปฅไธใฎใใใชๅฏพๅฟใใจใ
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* ่ฒ ใฎๆฐใซใๅฏพๅฟใใ%ๆผ็ฎ
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* ในใไนใฎ่จ็ฎ
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* ในใไนใฎ่จ็ฎ
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* ในใไน MOD ่จ็ฎ้ O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchใงใฏ้่คใใๅ ดๅใฎ่ฟๅดๅคใๅฎๅฎใใชใใฎใงใLowerBound็ใไฝๆ
*
* ๅคใ้่คใใชใใใจใไฟ่จผใใใฆใใๅ ดๅใฏ้ๅบฆ็ใซArrays#binarySearchใไฝฟใใใจใ
*
* )* @param array
*
* @param key
* @return ๅญๅจใใๅ ดๅใฏใคใณใใใฏใน ๅญๅจใใชใๅ ดๅใฏ-(ๆฟๅ
ฅใใใใคใณใ)-1(ใใใๅ่ปข[~]ใใใฐใใฉใ)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// ๆข็ดขๅ
ใงๅคงใใใใฎใ่ฆใคใใใชใใฃใใจใ
if (array[ng] == key) return ng;// ๆๅพใฎๅคใkeyใจๅใๅคใฎๅ ดๅใฏๆๅพใฎๅคใๅฉ็จใใ
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// ๆข็ดขๅ
ใงๅคงใใใใฎใ่ฆใคใใใชใใฃใใจใ
if (array[ng] == key) return ng;// ๆๅพใฎๅคใkeyใจๅใๅคใฎๅ ดๅใฏๆๅพใฎๅคใๅฉ็จใใ
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int้
ๅใ้้ ใซใฝใผใใใ
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long้
ๅใ้้ ใซใฝใผใใใ
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
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));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(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 print(int[] array) {
this.print(array, " ");
}
public void print(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 print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(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 print(long[] array) {
this.print(array, " ");
}
public void print(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 print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(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 print(T[] array) {
this.print(array, " ");
}
public <T> void print(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 print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15ไปฅไธใฎ็ฐๅขใ ใจisEmptyใใณใณใใคใซใใชใ
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i != 0) sb.append(" ");
sb.append(a[i]);
}
System.out.println(sb);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
var temp = a.stream().map(i -> i + 1).collect(Collectors.toList());
print(temp);
}
public void printlnZeroToOneIndex(List<Integer> a) {
var temp = a.stream().map(i -> i + 1).collect(Collectors.toList());
println(temp);
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* ๅ
้ ญๅใณๆซๅฐพใธใฎๆฟๅ
ฅใO๏ผ1๏ผใใคใใฉใณใใ ใขใฏใปในใO(1)ใงๅฏ่ฝใชใใผใฟๆง้ ใฎ่ชไฝใฏใฉใน
*
* @author ritoAtCoder
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
class Point {
int x;
int y;
Point(int x, int y) {
this.x = x;
this.y = y;
}
/**
* ่ท้ขใๆฑใใใใใ ใๅนณๆนๆ นใไปใใๅ
*
* @param Point
* @return ๅนณๆนๆ นใไปใใๅใฎ่ท้ข
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public String toString() {
return x + " " + y;
}
}
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import java.util.NoSuchElementException;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
import java.util.stream.Collectors;
public class Main {
public static final long MOD = ((long) 1e9 + 7L);
public static void solve() {
var a = sc.nextInt();
var b = sc.nextInt();
var ac = a + b;
for (var i = 0; i <= 9; i++) {
if (i != ac) {
pw.println(i);
return;
}
}
}
/**
* 10้ฒๆฐใใX้ฒๆฐใฎๆๅญๅใซๅคๆใใใ
*
* @MEMO ้ๅใใฎๅคๆใฏLong.parseUnsignedLong(String s, int radix)ใๅฉ็จใใ๏ผ
*
* @param n ๅคๆๅ
๏ผ๏ผ๏ผ้ฒๆฐ๏ผ
* @param newBase ๅคๆๅพใฎๅบๆฐ
* @return newBaseๅคๆๅพใฎString
*/
public static String convertBase10ToX(long n, int radix) {
if (n == 0L) return "0";
var sb = new StringBuilder();
while (n > 0) {
long r = n % (long) radix;
sb.insert(0, r);
n /= (long) radix;
}
return sb.toString();
}
public static int[] array(int size, int init) {
var array = new int[size];
fill(array, init);
return array;
}
public static char[] array(int size, char init) {
var array = new char[size];
fill(array, init);
return array;
}
public static char[][] array(int h, int w, char init) {
var array = new char[h][w];
for (char[] c : array) fill(c, init);
return array;
}
public static boolean[] array(int size, boolean init) {
var array = new boolean[size];
fill(array, init);
return array;
}
public static long[] array(int size, long init) {
var array = new long[size];
fill(array, init);
return array;
}
public static int[] dpArray(int size, int init) {
int[] array = new int[size];
fill(array, init);
array[0] = 0;
return array;
}
public static long[] dpArray(int size, long init) {
var array = new long[size];
fill(array, init);
array[0] = 0L;
return array;
}
public static long gcd(long a, long b) {
if (b > a) {
long temp = a;
a = b;
b = temp;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
public static long lcm(long a, long b) {
// NOTE ใชใผใใผใใญใผใซๆณจๆใใใใจใ
// ใชใผใใผใใญใผใฎใใใใใใๅ ดๅใฏไปฅไธใฎใใใชๅฏพๅฟใใจใ
// if (a / g > INF / b) return INF;
// @see https://drken1215.hatenablog.com/entry/2023/11/21/020301
if (b > a) {
return b / gcd(a, b) * a;
} else {
return a / gcd(a, b) * b;
}
}
/**
* ่ฒ ใฎๆฐใซใๅฏพๅฟใใ%ๆผ็ฎ
*
* @param val
* @param mod
* @return
*/
public static long mod(long val, long mod) {
long res = val % mod;
if (res < 0) res += mod;
return res;
}
/**
* ในใไนใฎ่จ็ฎ
*/
public static final long pow(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 1) return a * pow(a, (b - 1));
var half = pow(a, b / 2);
return half * half;
}
/**
* ในใไนใฎ่จ็ฎ
*/
public static final long pow(long a, long b) {
if (b == 0L) return 1L;
if (b % 2L == 1L) return a * pow(a, (b - 1L));
var half = pow(a, b / 2L);
return half * half;
}
/**
* ในใไน MOD ่จ็ฎ้ O(logN)
*
* @param val
* @param mod
* @return
*/
public static long modpow(long a, long b, long mod) {
if (b == 0L) return 1L;
if (b == 1L) return a % mod;
if (b % 2 == 1) return (a * modpow(a, b - 1L, mod)) % mod;
long temp = modpow(a, b / 2L, mod);
return (temp * temp) % mod;
}
public static int getKeata(int x) {
return String.valueOf(x).length();
}
public static int getKeata(long x) {
return String.valueOf(x).length();
}
/**
* Arras#binarySearchใงใฏ้่คใใๅ ดๅใฎ่ฟๅดๅคใๅฎๅฎใใชใใฎใงใLowerBound็ใไฝๆ
*
* ๅคใ้่คใใชใใใจใไฟ่จผใใใฆใใๅ ดๅใฏ้ๅบฆ็ใซArrays#binarySearchใไฝฟใใใจใ
*
* )* @param array
*
* @param key
* @return ๅญๅจใใๅ ดๅใฏใคใณใใใฏใน ๅญๅจใใชใๅ ดๅใฏ-(ๆฟๅ
ฅใใใใคใณใ)-1(ใใใๅ่ปข[~]ใใใฐใใฉใ)
*/
public static int binarySearchLowerBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchLowerBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while (ok - ng > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] >= key) {
ok = mid;
} else {
ng = mid;
}
}
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(int[] array, int key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// ๆข็ดขๅ
ใงๅคงใใใใฎใ่ฆใคใใใชใใฃใใจใ
if (array[ng] == key) return ng;// ๆๅพใฎๅคใkeyใจๅใๅคใฎๅ ดๅใฏๆๅพใฎๅคใๅฉ็จใใ
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
public static int binarySearchUpperBound(long[] array, long key) {
var ng = -1;
var ok = array.length;
var lastIndex = array.length - 1;
while ((ok - ng) > 1) {
var mid = (ok + ng) >>> 1;
if (mid <= lastIndex && array[mid] > key) {
ok = mid;
} else {
ng = mid;
}
}
if (ng == -1) return -1;// ๆข็ดขๅ
ใงๅคงใใใใฎใ่ฆใคใใใชใใฃใใจใ
if (array[ng] == key) return ng;// ๆๅพใฎๅคใkeyใจๅใๅคใฎๅ ดๅใฏๆๅพใฎๅคใๅฉ็จใใ
if (ok <= lastIndex && ok >= 0 && array[ok] == key)
return ok;
else
return ~ok;
}
/*--- ---*/
/*--- Util ---*/
/*--- ---*/
public static List<Integer> toList(int[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static List<Long> toList(long[] a) {
return Arrays.stream(a).boxed().collect(Collectors.toList());
}
public static String reverse(String str) {
return new StringBuilder().append(str).reverse().toString();
}
public static boolean isKaibun(String str) {
return str.equals(reverse(str));
}
public static String toString(int a) {
return String.valueOf(a);
}
public static String toString(long a) {
return String.valueOf(a);
}
public static int toInt(String a) {
return Integer.valueOf(a);
}
public static long toLong(String a) {
return Long.valueOf(a);
}
public static char[] toCharArray(int a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(long a) {
return String.valueOf(a).toCharArray();
}
public static char[] toCharArray(String a) {
return a.toCharArray();
}
public static boolean isAllTrue(boolean[] boo) {
for (boolean b : boo) {
if (!b) return false;
}
return true;
}
public static void sort(int[] a) {
Arrays.sort(a);
}
public static void sort(long[] a) {
Arrays.sort(a);
}
public static int abs(int a, int b) {
return Math.abs(a - b);
}
public static long abs(long a, long b) {
return Math.abs(a - b);
}
/**
* int้
ๅใ้้ ใซใฝใผใใใ
*/
public static void sortDes(int[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
/**
* long้
ๅใ้้ ใซใฝใผใใใ
*/
public static void sortDes(long[] a) {
Arrays.sort(a);
var temp = Arrays.copyOf(a, a.length);
for (int i = 0; i < temp.length; i++) {
a[i] = temp[temp.length - i - 1];
}
}
public static void fill(int[] array, int val) {
Arrays.fill(array, val);
}
public static void fill(char[] array, char val) {
Arrays.fill(array, val);
}
public static void fill(boolean[] array, boolean val) {
Arrays.fill(array, val);
}
public static void fill(int[][] array, int val) {
for (var a : array) Arrays.fill(a, val);
}
public static void fill(long[] array, long val) {
Arrays.fill(array, val);
}
public static void fill(long[][] array, long val) {
for (var a : array) Arrays.fill(a, val);
}
public static void initalizeDp(int[][] dp, int val) {
fill(dp, val);
dp[0][0] = 0;
}
public static void initalizeDp(long[][] dp, long val) {
fill(dp, val);
dp[0][0] = 0L;
}
public static int max(int... array) {
return Arrays.stream(array).max().getAsInt();
}
public static int sum(int... array) {
return Arrays.stream(array).sum();
}
public static int max(int a, int b) {
return Math.max(a, b);
}
public static int min(int... array) {
return Arrays.stream(array).min().getAsInt();
}
public static int min(int a, int b) {
return Math.min(a, b);
}
public static long max(long... array) {
return Arrays.stream(array).max().getAsLong();
}
public static long max(long a, long b) {
return Math.max(a, b);
}
public static long sum(long... array) {
return Arrays.stream(array).sum();
}
public static long min(long a, long b) {
return Math.min(a, b);
}
public static long min(long... array) {
return Arrays.stream(array).min().getAsLong();
}
/*--- ---*/
/*--- debug ---*/
/*--- ---*/
public static void debug(Object o, Object... args) {
var format = "%s";
var temp = new Object[args.length + 1];
temp[0] = o;
System.arraycopy(args, 0, temp, 1, args.length);
for (int i = 0; i < temp.length - 1; i++) {
format += " %s";
}
System.out.printf(format, temp);
System.out.println("");
}
public static void debug(int[] x) {
out(Arrays.toString(x));
}
public static void debug(boolean[] x) {
out(Arrays.toString(x));
}
public static void debug(long[] x) {
out(Arrays.toString(x));
}
public static void debug(int[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(int[][] x) {
for (int[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(long[][] x) {
out(Arrays.deepToString(x));
}
public static void debugln(long[][] x) {
for (long[] w : x) {
for (var i : w) {
System.err.print(i + " ");
}
out("");
}
out("///////////////////");
}
public static void debug(boolean[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(char[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object[] x) {
out(Arrays.toString(x));
}
public static void debug(Object[][] x) {
out(Arrays.deepToString(x));
}
public static void debug(Object a) {
System.err.println(a);
}
public static void out(String x) {
System.err.println(x);
}
final static ContestPrinter pw = new ContestPrinter();
final static FastScanner sc = new FastScanner();
public static void main(String[] args) {
solve();
pw.close();
}
}
class FastScanner {
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (true) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else if (b == -1 || !isPrintableChar(b)) {
return minus ? -n : n;
} else {
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public Point nextPoint() {
return new Point(nextInt(), nextInt());
}
public Point[] nextPointArray(int size) {
Point[] array = new Point[size];
Arrays.setAll(array, i -> new Point(nextInt(), nextInt()));
return array;
}
public List<Point> nextPointList(int size) {
List<Point> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(new Point(nextInt(), nextInt()));
return list;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public int[] nextIntArray(int size) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> nextInt());
return intArray;
}
public int[] nextIntArray(int size, IntUnaryOperator map) {
int[] intArray = new int[size];
Arrays.setAll(intArray, i -> map.applyAsInt(nextInt()));
return intArray;
}
public int[] nextIntArrayOneToZeroIndex(int size) {
return nextIntArray(size, i -> i - 1);
}
public long[] nextLongArray(int size) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> nextLong());
return longArray;
}
public long[] nextLongArray(int size, LongUnaryOperator map) {
long[] longArray = new long[size];
Arrays.setAll(longArray, i -> map.applyAsLong(nextLong()));
return longArray;
}
public String[] nextStringArray(int size) {
String[] stringArray = new String[size];
Arrays.setAll(stringArray, i -> next());
return stringArray;
}
public List<String> nextStringList(int size) {
List<String> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(next());
return list;
}
public Integer[] nextIntegerArray(int size) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = nextInt();
return ret;
}
public Integer[] nextIntegerArray(int size, IntUnaryOperator map) {
Integer[] ret = new Integer[size];
for (int i = 0; i < size; i++) ret[i] = map.applyAsInt(nextInt());
return ret;
}
public char[][] nextDimensionalCharArray(int h, int w) {
char[][] array = new char[h][w];
for (int i = 0; i < h; i++) {
array[i] = next().toCharArray();
}
return array;
}
public int[][] nextDimensionalIntArray(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextInt();
}
}
return array;
}
public long[][] nextDimensionaLongArray(int h, int w) {
long[][] array = new long[h][w];
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
array[i][j] = nextLong();
}
}
return array;
}
public int[][] nextIntArrayFromStr(int h, int w) {
int[][] array = new int[h][w];
for (int i = 0; i < h; i++) {
String temp = next();
for (int j = 0; j < w; j++) {
array[i][j] = temp.charAt(j) - '0';
}
}
return array;
}
public List<Integer> nextIntgerList(int size) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(nextInt());
return list;
}
public List<Integer> nextIntgerList(int size, IntUnaryOperator map) {
List<Integer> list = new ArrayList<>();
for (int i = 0; i < size; i++) list.add(map.applyAsInt(nextInt()));
return list;
}
}
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));
}
@Override
public void print(boolean boo) {
super.print(boo ? "Yes" : "No");
}
public void print(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 print(int[] array) {
this.print(array, " ");
}
public void print(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 print(int[] array, java.util.function.IntUnaryOperator map) {
this.print(array, " ", map);
}
public void print(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 print(long[] array) {
this.print(array, " ");
}
public void print(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 print(long[] array, java.util.function.LongUnaryOperator map) {
this.print(array, " ", map);
}
public <T> void print(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 print(T[] array) {
this.print(array, " ");
}
public <T> void print(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 print(T[] array, java.util.function.UnaryOperator<T> map) {
this.print(array, " ", map);
}
public String getOutputCollection(Collection<?> c) {
return String.join(" ", c.stream().map(String::valueOf).collect(Collectors.toList()));
}
public void print(Collection<?> c) {
super.print(getOutputCollection(c));
}
public void println(Collection<?> c) {
StringBuilder sb = new StringBuilder();
for (Object object : c) {
// java 15ไปฅไธใฎ็ฐๅขใ ใจisEmptyใใณใณใใคใซใใชใ
// if (!sb.isEmpty()) sb.append("\r\n");
if (sb.length() != 0) sb.append("\r\n");
sb.append(object);
}
System.out.println(sb);
}
public void println(int[] array) {
print(array, "\r\n");
}
public void println(long[] array) {
print(array, "\r\n");
}
public void print(String[] a) {
StringBuilder sb = new StringBuilder();
for (int i = 0; i < a.length; i++) {
if (i != 0) sb.append(" ");
sb.append(a[i]);
}
System.out.println(sb);
}
public void print(Object obj) {
System.out.print(obj);
}
public void println(Object obj) {
System.out.println(obj);
}
public void printlnDeep(ArrayList<ArrayList<Integer>> c) {
StringBuilder sb = new StringBuilder();
for (var ci : c) sb.append(getOutputCollection(ci)).append("\r\n");
System.out.println(sb);
}
public void printZeroToOneIndex(int[] a) {
print(a, i -> i + 1);
}
public void printZeroToOneIndex(List<Integer> a) {
var temp = a.stream().map(i -> i + 1).collect(Collectors.toList());
print(temp);
}
public void printlnZeroToOneIndex(List<Integer> a) {
var temp = a.stream().map(i -> i + 1).collect(Collectors.toList());
println(temp);
}
public void print(boolean[] a) {
for (int i = 0; i < a.length; i++) {
System.out.println(a[i] + " ");
}
System.out.println("");
}
public void print(boolean[][] b) {
for (int i = 0; i < b.length; i++) {
for (int j = 0; j < b[0].length; j++) {
System.out.print(b[i][j] ? "o" : "x");
}
System.out.println("");
}
}
public void print(int[][] array) {
for (var i : array) print(i);
}
public void print(long[][] array) {
for (var i : array) print(i);
}
public void print(char[][] array) {
for (char[] cs : array) {
for (char c : cs) {
print(c);
}
println();
}
}
}
class Graph {
List<ArrayList<Integer>> g;
int v;
int e;
boolean[] visited;
public Graph(int v) {
this.v = v;
for (var i = 0; i < v; i++) g.add(new ArrayList<Integer>());
visited = new boolean[v];
}
public void addEdge(int a, int b) {
g.get(a).add(b);
g.get(b).add(a);
e++;
}
public void dfs(int now) {
visited[now] = true;
for (var next : g.get(now)) {
if (visited[next]) continue;
dfs(next);
}
}
public boolean marked(int now) {
return visited[now];
}
public boolean isAllConected() {
for (var bo : visited) {
if (!bo) return false;
}
return true;
}
}
/**
* ๅ
้ ญๅใณๆซๅฐพใธใฎๆฟๅ
ฅใO๏ผ1๏ผใใคใใฉใณใใ ใขใฏใปในใO(1)ใงๅฏ่ฝใชใใผใฟๆง้ ใฎ่ชไฝใฏใฉใน
*
* @author ritoAtCoder
*/
class ContestDeque<E> implements Iterable<E> {
private List<E> stack;
private List<E> que;
public ContestDeque() {
stack = new ArrayList<E>();
que = new ArrayList<E>();
}
public E get(int i) {
if (i < stack.size()) {
return stack.get(stack.size() - i - 1);
} else {
return que.get(i - stack.size());
}
}
public E remove(int i) {
E e;
if (i < stack.size()) {
e = stack.remove(stack.size() - i - 1);
} else {
e = que.remove(i - stack.size());
}
return e;
}
public void addFirst(E e) {
stack.add(e);
}
public void addLast(E e) {
que.add(e);
}
public void set(int i, E e) {
if (i < stack.size()) {
e = stack.set(stack.size() - i - 1, e);
} else {
e = que.set(i - stack.size(), e);
}
}
public int size() {
return stack.size() + que.size();
}
public boolean isEmpty() {
return size() == 0;
}
@Override
public String toString() {
var temp = new ArrayList<E>();
for (int i = stack.size() - 1; i >= 0; i--) {
temp.add(stack.get(i));
}
temp.addAll(que);
return String.join(" ", temp.stream().map(String::valueOf).collect(Collectors.toList()));
}
public Iterator<E> iterator() {
return new ContestDequeIterator();
}
private class ContestDequeIterator implements Iterator<E> {
private int i = 0;
public boolean hasNext() {
return i < size();
}
public E next() {
i++;
return get(i);
}
}
}
class Point {
int x;
int y;
Point(int x, int y) {
this.x = x;
this.y = y;
}
/**
* ่ท้ขใๆฑใใใใใ ใๅนณๆนๆ นใไปใใๅ
*
* @param Point
* @return ๅนณๆนๆ นใไปใใๅใฎ่ท้ข
*/
public long dist(Point target) {
return (long) (x - target.x) * (x - target.x) + (y - target.y) * (y - target.y);
}
@Override
public String toString() {
return x + " " + y;
}
}
| ConDefects/ConDefects/Code/abc343_a/Java/52420499 |
condefects-java_data_739 | import java.io.*;
import java.util.*;
public class Main {
static IOHandler sc = new IOHandler();
static PrintWriter out = new PrintWriter(System.out);
static Long [][] memo;
static List<Integer> [] graph;
public static void main(String[] args) throws IOException {
new Thread(null, new Solution(), "solution", 1 << 26 ).start();
}
private static class Solution implements Runnable {
public void run() {
// TODO Auto-generated method stub
int testCases = 1;
for (int i = 1; i <= testCases; ++i) {
solve(i);
}
out.flush();
}
private void solve(int t) {
// Read question and Test cases thoroughly
// Check for overflow
// Think before solving
// Search for concepts
// expected alg like seg tree, trie, binSearch, sqrt decom ...
int n = sc.nextInt();
int m = sc.nextInt();
graph = new List[n + 1];
for (int i = 1; i <= n; ++i) {
graph[i] = new ArrayList<>();
}
int u, v;
for (int i = 0; i < m; ++i) {
u = sc.nextInt();
v = sc.nextInt();
graph[u].add(v);
graph[v].add(u);
}
int [][] wp = new int [n + 1][3];
int [] weights = new int [n + 1];
int [] piece = new int [n + 1];
for (int i = 1; i <= n; ++i) {
wp[i][0] = i;
wp[i][1] = sc.nextInt();
weights[i] = wp[i][1];
}
for (int i = 1; i <= n; ++i) {
wp[i][2] = sc.nextInt();
piece[i] = wp[i][2];
}
Set<Integer> set;
for (int i = 1; i <= n; ++i) {
set = new HashSet<>(graph[i]);
graph[i].clear();
for (int num : set) {
if (weights[num] < weights[i])
graph[i].add(num);
}
//Collections.sort(graph[i], (a, b) -> wp[a][1] - wp[b][1]);
}
Arrays.sort(wp, (a, b) -> a[1] - b[1]);
int node, weight;
long [] dp = new long [n + 1];
for (int [] mArr : wp) {
node = mArr[0];
weight = mArr[1];
if (node == 0)
continue;
memo = new Long [graph[node].size()][weight];
//System.out.println(node + " " + weight);
dp[node] = 1 + getScore(graph[node], 0, weight - 1, 0, dp, weights);
}
// System.out.println(Arrays.toString(dp));
// System.out.println(Arrays.deepToString(wp));
long result = 0;
for (int i = 1; i <= n; ++i) {
result += dp[i] * piece[i];
}
out.println(result);
}
private long getScore(List<Integer> list, int idx, int left, int max, long [] dp , int [] w) {
if (idx >= list.size() || w[list.get(idx)] > left || left == 0)
return 0;
else if (memo[idx][left] != null)
return memo[idx][left];
long result = getScore(list, idx + 1, left, max, dp, w);
result = Math.max(result, dp[list.get(idx)] +
getScore(list, idx + 1, left - w[list.get(idx)], max, dp, w) );
memo[idx][left] = result;
return result;
}
}
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 Long [][] memo;
static List<Integer> [] graph;
public static void main(String[] args) throws IOException {
new Thread(null, new Solution(), "solution", 1 << 26 ).start();
}
private static class Solution implements Runnable {
public void run() {
// TODO Auto-generated method stub
int testCases = 1;
for (int i = 1; i <= testCases; ++i) {
solve(i);
}
out.flush();
}
private void solve(int t) {
// Read question and Test cases thoroughly
// Check for overflow
// Think before solving
// Search for concepts
// expected alg like seg tree, trie, binSearch, sqrt decom ...
int n = sc.nextInt();
int m = sc.nextInt();
graph = new List[n + 1];
for (int i = 1; i <= n; ++i) {
graph[i] = new ArrayList<>();
}
int u, v;
for (int i = 0; i < m; ++i) {
u = sc.nextInt();
v = sc.nextInt();
graph[u].add(v);
graph[v].add(u);
}
int [][] wp = new int [n + 1][3];
int [] weights = new int [n + 1];
int [] piece = new int [n + 1];
for (int i = 1; i <= n; ++i) {
wp[i][0] = i;
wp[i][1] = sc.nextInt();
weights[i] = wp[i][1];
}
for (int i = 1; i <= n; ++i) {
wp[i][2] = sc.nextInt();
piece[i] = wp[i][2];
}
Set<Integer> set;
for (int i = 1; i <= n; ++i) {
set = new HashSet<>(graph[i]);
graph[i].clear();
for (int num : set) {
if (weights[num] < weights[i])
graph[i].add(num);
}
Collections.sort(graph[i], (a, b) -> wp[a][1] - wp[b][1]);
}
Arrays.sort(wp, (a, b) -> a[1] - b[1]);
int node, weight;
long [] dp = new long [n + 1];
for (int [] mArr : wp) {
node = mArr[0];
weight = mArr[1];
if (node == 0)
continue;
memo = new Long [graph[node].size()][weight];
//System.out.println(node + " " + weight);
dp[node] = 1 + getScore(graph[node], 0, weight - 1, 0, dp, weights);
}
// System.out.println(Arrays.toString(dp));
// System.out.println(Arrays.deepToString(wp));
long result = 0;
for (int i = 1; i <= n; ++i) {
result += dp[i] * piece[i];
}
out.println(result);
}
private long getScore(List<Integer> list, int idx, int left, int max, long [] dp , int [] w) {
if (idx >= list.size() || w[list.get(idx)] > left || left == 0)
return 0;
else if (memo[idx][left] != null)
return memo[idx][left];
long result = getScore(list, idx + 1, left, max, dp, w);
result = Math.max(result, dp[list.get(idx)] +
getScore(list, idx + 1, left - w[list.get(idx)], max, dp, w) );
memo[idx][left] = result;
return result;
}
}
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/abc341_f/Java/50390500 |
condefects-java_data_740 | import java.util.Scanner;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.HashMap;
public class Main{
public static void main(String[] args){
Scanner sc_i = new Scanner(System.in);
int n = Integer.parseInt(sc_i.next());
int m = Integer.parseInt(sc_i.next());
int[][] uv = new int[m][2];
for(int i_i = 0; i_i < m; i_i++){for(int j_i = 0; j_i < 2; j_i++){uv[i_i][j_i] = Integer.parseInt(sc_i.next());};};
int[] w = new int[n]; for(int i_i = 0; i_i < n; i_i++){w[i_i] = Integer.parseInt(sc_i.next());};
int[] a = new int[n]; for(int i_i = 0; i_i < n; i_i++){a[i_i] = Integer.parseInt(sc_i.next());};
var edge = new ArrayList<ArrayList<Integer>>(n+10);
for(int i = 0; i < n; i++){
edge.add(new ArrayList<>());
};
for(int i = 0; i < m; i++){
edge.get(uv[i][0]-1).add(uv[i][1]-1);
edge.get(uv[i][1]-1).add(uv[i][0]-1);
};
var pq = new PriorityQueue<Integer>();
var costMap = new HashMap<Integer, ArrayList<Integer>>();
for(int i = 0; i < n; i++){
if(! costMap.containsKey(w[i])){costMap.put(w[i], new ArrayList<>()); pq.add(w[i]);};
costMap.get(w[i]).add(i);
};
int[] price = new int[n];
while(! pq.isEmpty()){
for(var vertex : costMap.get(pq.poll())){
var map = new HashMap<Integer, Integer>();
map.put(- w[vertex], 1);
for(var trg : edge.get(vertex)){if(w[trg] <= w[vertex]){
var newmap = new HashMap<Integer, Integer>();
for(var en : map.entrySet()){
int key = en.getKey(), value = en.getValue();
newmap.put(key, newmap.containsKey(key) ? Math.max(value, newmap.get(key)) : value);
if(key + w[trg] < 0){
key += w[trg]; value += price[trg];
newmap.put(key, newmap.containsKey(key) ? Math.max(value, newmap.get(key)) : value);
};
};
map = newmap;
};};
int max = 0;
for(var en : map.entrySet()){max = Math.max(max, en.getValue());}
price[vertex] = max;
};
};
long ans = 0;
for(int i = 0; i < n; i++){
ans += a[i] * price[i];
};
System.out.println(ans);
}
}
import java.util.Scanner;
import java.util.ArrayList;
import java.util.PriorityQueue;
import java.util.HashMap;
public class Main{
public static void main(String[] args){
Scanner sc_i = new Scanner(System.in);
int n = Integer.parseInt(sc_i.next());
int m = Integer.parseInt(sc_i.next());
int[][] uv = new int[m][2];
for(int i_i = 0; i_i < m; i_i++){for(int j_i = 0; j_i < 2; j_i++){uv[i_i][j_i] = Integer.parseInt(sc_i.next());};};
int[] w = new int[n]; for(int i_i = 0; i_i < n; i_i++){w[i_i] = Integer.parseInt(sc_i.next());};
int[] a = new int[n]; for(int i_i = 0; i_i < n; i_i++){a[i_i] = Integer.parseInt(sc_i.next());};
var edge = new ArrayList<ArrayList<Integer>>(n+10);
for(int i = 0; i < n; i++){
edge.add(new ArrayList<>());
};
for(int i = 0; i < m; i++){
edge.get(uv[i][0]-1).add(uv[i][1]-1);
edge.get(uv[i][1]-1).add(uv[i][0]-1);
};
var pq = new PriorityQueue<Integer>();
var costMap = new HashMap<Integer, ArrayList<Integer>>();
for(int i = 0; i < n; i++){
if(! costMap.containsKey(w[i])){costMap.put(w[i], new ArrayList<>()); pq.add(w[i]);};
costMap.get(w[i]).add(i);
};
int[] price = new int[n];
while(! pq.isEmpty()){
for(var vertex : costMap.get(pq.poll())){
var map = new HashMap<Integer, Integer>();
map.put(- w[vertex], 1);
for(var trg : edge.get(vertex)){if(w[trg] <= w[vertex]){
var newmap = new HashMap<Integer, Integer>();
for(var en : map.entrySet()){
int key = en.getKey(), value = en.getValue();
newmap.put(key, newmap.containsKey(key) ? Math.max(value, newmap.get(key)) : value);
if(key + w[trg] < 0){
key += w[trg]; value += price[trg];
newmap.put(key, newmap.containsKey(key) ? Math.max(value, newmap.get(key)) : value);
};
};
map = newmap;
};};
int max = 0;
for(var en : map.entrySet()){max = Math.max(max, en.getValue());}
price[vertex] = max;
};
};
long ans = 0;
for(int i = 0; i < n; i++){
ans += a[i] * (long)price[i];
};
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc341_f/Java/50383842 |
condefects-java_data_741 | import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public Node[] nodes = null;
public class Node implements Comparable<Node> {
public int W;
public int count;
public long cost = -1;
public LinkedList<Node> nexts = new LinkedList<Node>();
public Node(int count) {
this.count = count;
}
@Override
public int compareTo(Main.Node o) {
return this.W - o.W;
}
}
public Main() {
}
/**
* ใใใใตใใฏๅ้ก๏ผๅๅๅ1ๅ้ๅฎ๏ผ
* ๆๅคงๅฎน้ไปฅไธใงใๅ่จใฎไพกๅคใๆๅคงใซใชใใใใซๅๅใ้ธใใ ๆใฎไพกๅคใฎๆๅคงๅค
* @param N ๅๅๆฐ
* @param MAX ๆๅคงๅฎน้
* @param weight ๅๅใฎ้ใ
* @param worth ๅๅใฎไพกๅค
* @return ไพกๅคใฎๆๅคงๅค
*/
public static long knapsack(int N, int MAX, int[] weight, long[] worth) {
if (N == 0) {
return 0;
}
long dp[][] = new long[N][MAX+1];
for (int i=0; i<=MAX; i++) {
dp[0][i] = -1;
}
dp[0][0] = 0;
if (weight[0] <= MAX) {
dp[0][weight[0]] = worth[0];
}
for (int i=1; i<N; i++) {
int wei = weight[i];
long wor = worth[i];
for (int s=0; s<=MAX; s++) {
dp[i][s] = dp[i-1][s];
}
for (int s=0; s<=MAX; s++) {
if (dp[i-1][s] != -1) {
if (s + wei <= MAX) {
dp[i][s+wei] = dp[i-1][s] + wor;
}
}
}
}
long max_worth = 0;
for (int i=0; i<=MAX; i++) {
if (max_worth < dp[N-1][i]) {
max_worth = dp[N-1][i];
}
}
return max_worth;
}
public void solve() {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int M = in.nextInt();
nodes = new Node[N];
for (int i=0; i<N; i++){
nodes[i] = new Node(0);
}
for (int i=0; i<M; i++) {
int u = in.nextInt()-1;
int v = in.nextInt()-1;
nodes[u].nexts.add(nodes[v]);
nodes[v].nexts.add(nodes[u]);
}
for (int i=0; i<N; i++) {
int W = in.nextInt();
nodes[i].W = W;
}
for (int i=0; i<N; i++) {
int A = in.nextInt();
nodes[i].count = A;
}
in.close();
Node[] sorted = new Node[N];
for (int i=0; i<N; i++) {
sorted[i] = nodes[i];
}
Arrays.sort(sorted);
for (Node node : sorted) {
int n = 0;
int[] wei = new int[node.nexts.size()];
long[] wor = new long[node.nexts.size()];
for (Node next : node.nexts) {
if (next.cost == -1) {
continue;
}
if (next.W < node.W) {
wei[n] = next.W;
wor[n] = next.cost;
n++;
}
}
long max = knapsack(n, node.W-1, wei, wor);
node.cost = max+1;
}
for (Node node : nodes) {
System.err.print(node.cost + " ");
}
System.err.println();
long sum = 0;
for (Node node : nodes) {
sum += node.count * node.cost;
}
System.out.println(sum);
}
public static void main(String[] args) {
Main main = new Main();
main.solve();
}
}
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;
public class Main {
public Node[] nodes = null;
public class Node implements Comparable<Node> {
public int W;
public int count;
public long cost = -1;
public LinkedList<Node> nexts = new LinkedList<Node>();
public Node(int count) {
this.count = count;
}
@Override
public int compareTo(Main.Node o) {
return this.W - o.W;
}
}
public Main() {
}
/**
* ใใใใตใใฏๅ้ก๏ผๅๅๅ1ๅ้ๅฎ๏ผ
* ๆๅคงๅฎน้ไปฅไธใงใๅ่จใฎไพกๅคใๆๅคงใซใชใใใใซๅๅใ้ธใใ ๆใฎไพกๅคใฎๆๅคงๅค
* @param N ๅๅๆฐ
* @param MAX ๆๅคงๅฎน้
* @param weight ๅๅใฎ้ใ
* @param worth ๅๅใฎไพกๅค
* @return ไพกๅคใฎๆๅคงๅค
*/
public static long knapsack(int N, int MAX, int[] weight, long[] worth) {
if (N == 0) {
return 0;
}
long dp[][] = new long[N][MAX+1];
for (int i=0; i<=MAX; i++) {
dp[0][i] = -1;
}
dp[0][0] = 0;
if (weight[0] <= MAX) {
dp[0][weight[0]] = worth[0];
}
for (int i=1; i<N; i++) {
int wei = weight[i];
long wor = worth[i];
for (int s=0; s<=MAX; s++) {
dp[i][s] = dp[i-1][s];
}
for (int s=0; s<=MAX; s++) {
if (dp[i-1][s] != -1) {
if (s + wei <= MAX) {
dp[i][s+wei] = Math.max(dp[i-1][s] + wor, dp[i][s+wei]);
}
}
}
}
long max_worth = 0;
for (int i=0; i<=MAX; i++) {
if (max_worth < dp[N-1][i]) {
max_worth = dp[N-1][i];
}
}
return max_worth;
}
public void solve() {
Scanner in = new Scanner(System.in);
int N = in.nextInt();
int M = in.nextInt();
nodes = new Node[N];
for (int i=0; i<N; i++){
nodes[i] = new Node(0);
}
for (int i=0; i<M; i++) {
int u = in.nextInt()-1;
int v = in.nextInt()-1;
nodes[u].nexts.add(nodes[v]);
nodes[v].nexts.add(nodes[u]);
}
for (int i=0; i<N; i++) {
int W = in.nextInt();
nodes[i].W = W;
}
for (int i=0; i<N; i++) {
int A = in.nextInt();
nodes[i].count = A;
}
in.close();
Node[] sorted = new Node[N];
for (int i=0; i<N; i++) {
sorted[i] = nodes[i];
}
Arrays.sort(sorted);
for (Node node : sorted) {
int n = 0;
int[] wei = new int[node.nexts.size()];
long[] wor = new long[node.nexts.size()];
for (Node next : node.nexts) {
if (next.cost == -1) {
continue;
}
if (next.W < node.W) {
wei[n] = next.W;
wor[n] = next.cost;
n++;
}
}
long max = knapsack(n, node.W-1, wei, wor);
node.cost = max+1;
}
for (Node node : nodes) {
System.err.print(node.cost + " ");
}
System.err.println();
long sum = 0;
for (Node node : nodes) {
sum += node.count * node.cost;
}
System.out.println(sum);
}
public static void main(String[] args) {
Main main = new Main();
main.solve();
}
} | ConDefects/ConDefects/Code/abc341_f/Java/50394807 |
condefects-java_data_742 | import java.io.*;
import java.util.*;
public class Main {
static FastIn in = new FastIn();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static final double eps = 1e-8;
static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
//----------------------------------TEMPLATE-----------------------------------------------------------------------------------------------------------------------------------
//----------------------------------------------------------------------------------------------------------------------------------------------------------------------
//TODO ่ฎฐๅพๅฟ
่ฆๆถๅผlongๆBigInteger
//int T = in.nextInt();
void solve() {
int n = in.nextInt();
List<Double> list = new ArrayList<>();
double mx = -1e18;
double mi = 1e18;
List<Double> list1 = new ArrayList<>(), list2 = new ArrayList<>();
for (int i = 0; i < n; i++) {
double v = in.nextInt();
if (v > 0) list1.add(v);
else list2.add(v);
}
if (list1.size() > 6) {
for (int i = 0; i < 3; i++) {
list.add(list1.get(i));
}
for (int i = list1.size() - 1; i >= list1.size() - 3; i--) {
list.add(list1.get(i));
}
}else {
list.addAll(list1);
}
if (list2.size() > 6) {
for (int i = 0; i < 3; i++) {
list.add(list2.get(i));
}
for (int i = list2.size() - 1; i >= list2.size() - 3; i--) {
list.add(list2.get(i));
}
}else {
list.addAll(list2);
}
for (int i = 0; i < list.size(); i++) {
for (int j = i + 1; j < list.size(); j++) {
for (int k = j + 1; k < list.size(); k++) {
mi = Math.min(mi, (list.get(i) + list.get(j) + list.get(k)) / (list.get(i) * list.get(j) * list.get(k)));
mx = Math.max(mx, (list.get(i) + list.get(j) + list.get(k)) / (list.get(i) * list.get(j) * list.get(k)));
}
}
}
out.printf("%.15f\n", mi);
out.printf("%.15f\n", mx);
}
double calc(double x, double y, double z) {
return (x + y + z) / (x * y * z);
}
//---------------------------------------------------------------------------------------------------------------------------------------------------------------------------
public static void main(String... args) {
new Main().solve();
out.close();
}
}
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;
}
@Override
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());
}
}
import java.io.*;
import java.util.*;
public class Main {
static FastIn in = new FastIn();
static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
static final double eps = 1e-8;
static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
//----------------------------------TEMPLATE-----------------------------------------------------------------------------------------------------------------------------------
//----------------------------------------------------------------------------------------------------------------------------------------------------------------------
//TODO ่ฎฐๅพๅฟ
่ฆๆถๅผlongๆBigInteger
//int T = in.nextInt();
void solve() {
int n = in.nextInt();
List<Double> list = new ArrayList<>();
double mx = -1e18;
double mi = 1e18;
List<Double> list1 = new ArrayList<>(), list2 = new ArrayList<>();
for (int i = 0; i < n; i++) {
double v = in.nextInt();
if (v > 0) list1.add(v);
else list2.add(v);
}
list1.sort(Comparator.comparing(e -> e));
list2.sort(Comparator.comparing(e -> e));
if (list1.size() > 6) {
for (int i = 0; i < 3; i++) {
list.add(list1.get(i));
}
for (int i = list1.size() - 1; i >= list1.size() - 3; i--) {
list.add(list1.get(i));
}
}else {
list.addAll(list1);
}
if (list2.size() > 6) {
for (int i = 0; i < 3; i++) {
list.add(list2.get(i));
}
for (int i = list2.size() - 1; i >= list2.size() - 3; i--) {
list.add(list2.get(i));
}
}else {
list.addAll(list2);
}
for (int i = 0; i < list.size(); i++) {
for (int j = i + 1; j < list.size(); j++) {
for (int k = j + 1; k < list.size(); k++) {
mi = Math.min(mi, (list.get(i) + list.get(j) + list.get(k)) / (list.get(i) * list.get(j) * list.get(k)));
mx = Math.max(mx, (list.get(i) + list.get(j) + list.get(k)) / (list.get(i) * list.get(j) * list.get(k)));
}
}
}
out.printf("%.15f\n", mi);
out.printf("%.15f\n", mx);
}
double calc(double x, double y, double z) {
return (x + y + z) / (x * y * z);
}
//---------------------------------------------------------------------------------------------------------------------------------------------------------------------------
public static void main(String... args) {
new Main().solve();
out.close();
}
}
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;
}
@Override
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());
}
}
| ConDefects/ConDefects/Code/arc158_b/Java/45746273 |
condefects-java_data_743 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = n;i >= 1;i--) {
System.out.println(i);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = n;i >= 0;i--) {
System.out.println(i);
}
}
}
| ConDefects/ConDefects/Code/abc281_a/Java/39559049 |
condefects-java_data_744 | import static java.lang.System.*;
import java.util.*;
public class Main{
public static void solve(){
Scanner sc = new Scanner(in);
int N = sc.nextInt();
for(int i = N; i >= 1; --i){
out.println(i);
}
}
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 N = sc.nextInt();
for(int i = N; i >= 0; --i){
out.println(i);
}
}
public static void main(String[] args) {
solve();
}
} | ConDefects/ConDefects/Code/abc281_a/Java/39275653 |
condefects-java_data_745 | import java.util.*;
import java.lang.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int k = sc.nextInt();
for (int i = k; 0 < i; i--) System.out.println(i);
}
}
import java.util.*;
import java.lang.*;
class Main{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int k = sc.nextInt();
for (int i = k; 0 <= i; i--) System.out.println(i);
}
}
| ConDefects/ConDefects/Code/abc281_a/Java/40130548 |
condefects-java_data_746 |
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
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 m = fs.nextInt();
final int[] s = fs.nextIntArray(n - 1);
final int[] x = fs.nextIntArray(m);
final int[] b = new int[n];
for (int i = 1; i < n; i++) {
b[i] = s[i - 1] - b[i - 1];
}
final Map<Long, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
long c = x[j] - b[i];
if (i % 2 == 0) {
c = -c;
}
map.merge(c, 1, Integer::sum);
}
}
int res = 0;
for (int v : map.values()) {
res = Math.max(res, v);
}
System.out.println(res);
}
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.HashMap;
import java.util.Map;
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 m = fs.nextInt();
final int[] s = fs.nextIntArray(n - 1);
final int[] x = fs.nextIntArray(m);
final long[] b = new long[n];
for (int i = 1; i < n; i++) {
b[i] = s[i - 1] - b[i - 1];
}
final Map<Long, Integer> map = new HashMap<>();
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
long c = x[j] - b[i];
if (i % 2 == 0) {
c = -c;
}
map.merge(c, 1, Integer::sum);
}
}
int res = 0;
for (int v : map.values()) {
res = Math.max(res, v);
}
System.out.println(res);
}
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/abc255_e/Java/34030162 |
condefects-java_data_747 | import java.io.*;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
/**
* https://atcoder.jp/contests/abc255/tasks/abc255_e
*/
public class Main {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
// write here
int n=sc.nextInt();
int m=sc.nextInt();
int[]dict=new int[n];
int[]luck=new int[m];
for(int i=0;i<n-1;i++){
dict[i]=sc.nextInt();
}
Map<Long,Integer> result=new HashMap<>();
for (int i = 0; i < m; i++) {
luck[i] = sc.nextInt();
result.put((long) luck[i], 1);
}
//a0=a0;a0=s0-a1;a0=s0-s1+a2;a0=s0-s1+s2-a3....
long cur=0,sign=1;
for (int value : dict) {
cur += (sign * value);
sign = -sign;
for (int j = 0; j < m; j++) {
result.compute(cur + sign * luck[j], (key, oldValue) -> oldValue == null ? 1 : oldValue + 1);
}
}
out.println(result.values().stream().max(Comparator.comparingInt(a->a)).get());
out.close();
}
public static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() {
return Integer.parseInt(next());
}
long nextLong() {
return Long.parseLong(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine(){
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.io.*;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
/**
* https://atcoder.jp/contests/abc255/tasks/abc255_e
*/
public class Main {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
// write here
int n=sc.nextInt();
int m=sc.nextInt();
int[]dict=new int[n-1];
int[]luck=new int[m];
for(int i=0;i<n-1;i++){
dict[i]=sc.nextInt();
}
Map<Long,Integer> result=new HashMap<>();
for (int i = 0; i < m; i++) {
luck[i] = sc.nextInt();
result.put((long) luck[i], 1);
}
//a0=a0;a0=s0-a1;a0=s0-s1+a2;a0=s0-s1+s2-a3....
long cur=0,sign=1;
for (int value : dict) {
cur += (sign * value);
sign = -sign;
for (int j = 0; j < m; j++) {
result.compute(cur + sign * luck[j], (key, oldValue) -> oldValue == null ? 1 : oldValue + 1);
}
}
out.println(result.values().stream().max(Comparator.comparingInt(a->a)).get());
out.close();
}
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/abc255_e/Java/35990523 |
condefects-java_data_748 | import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
public class Main {
public static void main(String[] args) throws Exception {
final NextScanner sc = new NextScanner(System.in);
final int n = Integer.parseInt(sc.next());
final List<List<Integer>> skill_graph = new ArrayList<>();
for (int i = 0; i < n; i++) {
skill_graph.add(new ArrayList<>());
}
final long[] times_to_learn = new long[n];
for (int i = 0; i < n; i++) {
times_to_learn[i] = Long.parseLong(sc.next());
int k = Integer.parseInt(sc.next());
for (int j = 0; j < k; j++) {
int a = Integer.parseInt(sc.next()) - 1;
skill_graph.get(i).add(a);
}
}
sc.close();
boolean[] learned = new boolean[n];
long ans = 0;
//่ฆๆฑใใใในใญใซใใญใฅใผใง็ฎก็ใใ
Queue<Integer> skill_to_learn = new ArrayDeque<>();
skill_to_learn.add(n - 1);
while (!skill_to_learn.isEmpty()) {
int skill = skill_to_learn.poll();
if (learned[skill]) {
// do nothing
} else {
ans += times_to_learn[skill];
learned[skill] = true;
}
for (int next_skill : skill_graph.get(skill)) {
if (!learned[skill]) {
skill_to_learn.add(next_skill);
}
}
}
System.out.println(ans);
}
//NextScannerใฉใคใใฉใช
static class NextScanner implements AutoCloseable {
private final java.io.BufferedReader br;
private java.util.StringTokenizer st;
private static final int BUF_SIZE = 1 << 16;
private static final char[] c_buf = new char[BUF_SIZE];
public NextScanner(java.io.InputStream input) {
this.br = new java.io.BufferedReader(new java.io.InputStreamReader(input));
}
private java.util.StringTokenizer readInput() {
java.util.StringTokenizer st;
try {
int b = br.read(c_buf);
if (b == BUF_SIZE) {
StringBuilder sb = new StringBuilder();
sb.append(c_buf);
sb.append(br.readLine());
st = new java.util.StringTokenizer(sb.toString());
} else if (b < 0) {
throw new java.util.NoSuchElementException();
} else {
st = new java.util.StringTokenizer(new String(c_buf, 0, b));
}
} catch (java.io.IOException e) {
throw new java.util.InputMismatchException(e.getMessage());
}
return st;
}
public String next() throws java.io.IOException {
if (st == null || !st.hasMoreElements()) {
st = readInput();
}
return st.nextToken();
}
@Override
public void close() throws Exception {
br.close();
}
}
}
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Queue;
public class Main {
public static void main(String[] args) throws Exception {
final NextScanner sc = new NextScanner(System.in);
final int n = Integer.parseInt(sc.next());
final List<List<Integer>> skill_graph = new ArrayList<>();
for (int i = 0; i < n; i++) {
skill_graph.add(new ArrayList<>());
}
final long[] times_to_learn = new long[n];
for (int i = 0; i < n; i++) {
times_to_learn[i] = Long.parseLong(sc.next());
int k = Integer.parseInt(sc.next());
for (int j = 0; j < k; j++) {
int a = Integer.parseInt(sc.next()) - 1;
skill_graph.get(i).add(a);
}
}
sc.close();
boolean[] learned = new boolean[n];
long ans = 0;
//่ฆๆฑใใใในใญใซใใญใฅใผใง็ฎก็ใใ
Queue<Integer> skill_to_learn = new ArrayDeque<>();
skill_to_learn.add(n - 1);
while (!skill_to_learn.isEmpty()) {
int skill = skill_to_learn.poll();
if (learned[skill]) {
// do nothing
} else {
ans += times_to_learn[skill];
learned[skill] = true;
}
for (int next_skill : skill_graph.get(skill)) {
if (!learned[next_skill]) {
skill_to_learn.add(next_skill);
}
}
}
System.out.println(ans);
}
//NextScannerใฉใคใใฉใช
static class NextScanner implements AutoCloseable {
private final java.io.BufferedReader br;
private java.util.StringTokenizer st;
private static final int BUF_SIZE = 1 << 16;
private static final char[] c_buf = new char[BUF_SIZE];
public NextScanner(java.io.InputStream input) {
this.br = new java.io.BufferedReader(new java.io.InputStreamReader(input));
}
private java.util.StringTokenizer readInput() {
java.util.StringTokenizer st;
try {
int b = br.read(c_buf);
if (b == BUF_SIZE) {
StringBuilder sb = new StringBuilder();
sb.append(c_buf);
sb.append(br.readLine());
st = new java.util.StringTokenizer(sb.toString());
} else if (b < 0) {
throw new java.util.NoSuchElementException();
} else {
st = new java.util.StringTokenizer(new String(c_buf, 0, b));
}
} catch (java.io.IOException e) {
throw new java.util.InputMismatchException(e.getMessage());
}
return st;
}
public String next() throws java.io.IOException {
if (st == null || !st.hasMoreElements()) {
st = readInput();
}
return st.nextToken();
}
@Override
public void close() throws Exception {
br.close();
}
}
}
| ConDefects/ConDefects/Code/abc226_c/Java/33751949 |
condefects-java_data_749 | import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
// Your code here!
Scanner in = new Scanner(System.in);
char[] arr = in.next().toCharArray();
int a = in.nextInt();
int b = in.nextInt();
char tmp = arr[a - 1];
arr[a - 1] = arr[b - 1];
arr[b - a] = tmp;
System.out.println(new String(arr));
}
}
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
// Your code here!
Scanner in = new Scanner(System.in);
char[] arr = in.next().toCharArray();
int a = in.nextInt();
int b = in.nextInt();
char tmp = arr[a - 1];
arr[a - 1] = arr[b - 1];
arr[b - 1] = tmp;
System.out.println(new String(arr));
}
}
| ConDefects/ConDefects/Code/abc236_a/Java/31486704 |
condefects-java_data_750 | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception{
BufferedReader bu = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
String[] s;
int tt = 1;
for(int t=0; t<tt; ++t) {
s = bu.readLine().split(" ");
int n = Integer.parseInt(s[0]);
s = bu.readLine().split(" ");
char[] c = s[0].toCharArray();
int[] a = new int[n];
for(int i=0; i<n; ++i) {
a[i] = c[i] - 'a';
update(1,0,n-1,i,a[i]);
}
int l = 0, r = n-1;
while(l<=r){
while(l<=r && a[l]==min(1,0,n-1,l+1,r)) ++l;
int smallest = min(1,0,n-1,l,r);
while(l<=r && a[r]!=smallest) --r;
if(l<=r) a[l] = a[l]^a[r]^(a[r]=a[l]);
++l; --r;
}
for(int i=0; i<n; ++i)
sb.append((char)(a[i]+'a'));
sb.append("\n");
}
System.out.println(sb);
}
static int[] t = new int[(int)(1e6)];
static void update(int v, int tl, int tr, int pos, int newVal){
if(tl==tr) t[v] = newVal;
else{
int tm = (tl+tr)/2;
if(pos<=tm) update(v*2, tl, tm, pos, newVal);
else update(v*2+1, tm+1, tr, pos, newVal);
t[v] = Integer.min(t[v*2],t[v*2+1]);
}
}
static int min(int v, int tl ,int tr, int l, int r){
if(l>r) return Integer.MAX_VALUE/2;
if(tl==l && tr==r) return t[v];
int tm = (tl+tr)/2;
return Integer.min(min(v*2, tl, tm, l, Integer.min(r,tm)), min(v*2+1, tm+1, tr, Integer.max(l,tm+1), r));
}
}
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws Exception{
BufferedReader bu = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
String[] s;
int tt = 1;
for(int t=0; t<tt; ++t) {
s = bu.readLine().split(" ");
int n = Integer.parseInt(s[0]);
s = bu.readLine().split(" ");
char[] c = s[0].toCharArray();
int[] a = new int[n];
for(int i=0; i<n; ++i) {
a[i] = c[i] - 'a';
update(1,0,n-1,i,a[i]);
}
int l = 0, r = n-1;
while(l<=r){
while(l<=r && a[l]==min(1,0,n-1,l,r)) ++l;
int smallest = min(1,0,n-1,l,r);
while(l<=r && a[r]!=smallest) --r;
if(l<=r) a[l] = a[l]^a[r]^(a[r]=a[l]);
++l; --r;
}
for(int i=0; i<n; ++i)
sb.append((char)(a[i]+'a'));
sb.append("\n");
}
System.out.println(sb);
}
static int[] t = new int[(int)(1e6)];
static void update(int v, int tl, int tr, int pos, int newVal){
if(tl==tr) t[v] = newVal;
else{
int tm = (tl+tr)/2;
if(pos<=tm) update(v*2, tl, tm, pos, newVal);
else update(v*2+1, tm+1, tr, pos, newVal);
t[v] = Integer.min(t[v*2],t[v*2+1]);
}
}
static int min(int v, int tl ,int tr, int l, int r){
if(l>r) return Integer.MAX_VALUE/2;
if(tl==l && tr==r) return t[v];
int tm = (tl+tr)/2;
return Integer.min(min(v*2, tl, tm, l, Integer.min(r,tm)), min(v*2+1, tm+1, tr, Integer.max(l,tm+1), r));
}
}
| ConDefects/ConDefects/Code/arc134_b/Java/28878613 |
condefects-java_data_751 | import java.io.*;
import java.util.*;
import java.lang.*;
// import java.math.BigInteger;
public class Main {
public static void swap(int firstIndex, int secondIndex,char[] a,boolean[] vis){
char temp = a[firstIndex];
a[firstIndex] = a[secondIndex];
a[secondIndex] = temp;
vis[firstIndex] = true;
vis[secondIndex] = true;
}
public static void solve(FastReader in, PrintWriter out, int nTestCase){
int n = in.nextInt();
char[] a = in.next().toCharArray();
boolean[] vis = new boolean[n];
ArrayList<Pair> arr = new ArrayList<>();
for(int i=0;i<n;i++){
arr.add(new Pair(a[i],i));
}
Collections.sort(arr);
int last = n+1;
int index = 0;
// for(Pair p:arr) out.println(p.a+" "+p.b);
for(int i=0;i<n;i++){
while(index<arr.size() && arr.get(index).b<=i) index++;
if(index==arr.size()) break;
Pair p = arr.get(index);
if(p.b>i && p.b<last && p.a<a[i]){
if(!vis[i] && !vis[p.b]){
// out.println(i+" "+p.b);
swap(i,p.b,a,vis);
last = p.b;
index++;
}
}
}
for(char c:a) out.print(c);
out.println();
}
public static void fastSort(int[] a){
Random random = new Random();
for(int i=0;i<a.length;i++){
int next = random.nextInt(a.length);
int curr = a[next];
a[next] = a[i];
a[i] = curr;
}
Arrays.sort(a);
}
public static void main(String[] args) throws IOException {
FastReader in;
PrintWriter out;
boolean isInputOutputFiles = args!=null&&args.length>0&&args[0].equals("LOCAL_RUN");
if (isInputOutputFiles) {
in = new FastReader(new BufferedReader(new FileReader("./input/input.txt")));
out = new PrintWriter(new BufferedWriter(new FileWriter("./output/output.txt")));
}
else{
in = new FastReader(new InputStreamReader(System.in));
out = new PrintWriter(System.out);
}
long startT = 0;
if (isInputOutputFiles) startT = System.currentTimeMillis();
int T = 1;
// T = in.nextInt();
for (int tt = 1; tt <= T; tt++) {
solve(in, out, tt);
}
if (isInputOutputFiles) out.println("Total time: "+(System.currentTimeMillis()-startT)+"ms");
out.close();
}
static class Pair implements Comparable<Pair> {
char a;
int b;
public Pair(char a,int b) {
this.a = a;
this.b = b;
}
public int compareTo(Pair o) {
if(this.a==o.a)
return -(this.b-o.b);
return (int) (this.a - o.a);
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader(Reader rd) {
br = new BufferedReader(rd);
}
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;
}
public int[] readArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
}
}
import java.io.*;
import java.util.*;
import java.lang.*;
// import java.math.BigInteger;
public class Main {
public static void swap(int firstIndex, int secondIndex,char[] a,boolean[] vis){
char temp = a[firstIndex];
a[firstIndex] = a[secondIndex];
a[secondIndex] = temp;
vis[firstIndex] = true;
vis[secondIndex] = true;
}
public static void solve(FastReader in, PrintWriter out, int nTestCase){
int n = in.nextInt();
char[] a = in.next().toCharArray();
boolean[] vis = new boolean[n];
ArrayList<Pair> arr = new ArrayList<>();
for(int i=0;i<n;i++){
arr.add(new Pair(a[i],i));
}
Collections.sort(arr);
int last = n+1;
int index = 0;
// for(Pair p:arr) out.println(p.a+" "+p.b);
for(int i=0;i<n;i++){
while(index<arr.size() && ((arr.get(index).b<=i)||(arr.get(index).b>last)) ) index++;
if(index==arr.size()) break;
Pair p = arr.get(index);
if(p.b>i && p.b<last && p.a<a[i]){
if(!vis[i] && !vis[p.b]){
// out.println(i+" "+p.b);
swap(i,p.b,a,vis);
last = p.b;
index++;
}
}
}
for(char c:a) out.print(c);
out.println();
}
public static void fastSort(int[] a){
Random random = new Random();
for(int i=0;i<a.length;i++){
int next = random.nextInt(a.length);
int curr = a[next];
a[next] = a[i];
a[i] = curr;
}
Arrays.sort(a);
}
public static void main(String[] args) throws IOException {
FastReader in;
PrintWriter out;
boolean isInputOutputFiles = args!=null&&args.length>0&&args[0].equals("LOCAL_RUN");
if (isInputOutputFiles) {
in = new FastReader(new BufferedReader(new FileReader("./input/input.txt")));
out = new PrintWriter(new BufferedWriter(new FileWriter("./output/output.txt")));
}
else{
in = new FastReader(new InputStreamReader(System.in));
out = new PrintWriter(System.out);
}
long startT = 0;
if (isInputOutputFiles) startT = System.currentTimeMillis();
int T = 1;
// T = in.nextInt();
for (int tt = 1; tt <= T; tt++) {
solve(in, out, tt);
}
if (isInputOutputFiles) out.println("Total time: "+(System.currentTimeMillis()-startT)+"ms");
out.close();
}
static class Pair implements Comparable<Pair> {
char a;
int b;
public Pair(char a,int b) {
this.a = a;
this.b = b;
}
public int compareTo(Pair o) {
if(this.a==o.a)
return -(this.b-o.b);
return (int) (this.a - o.a);
}
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader(Reader rd) {
br = new BufferedReader(rd);
}
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;
}
public int[] readArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++) a[i] = nextInt();
return a;
}
}
}
| ConDefects/ConDefects/Code/arc134_b/Java/29626566 |
condefects-java_data_752 | import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
private static int[] counts;
private static List<Path>[] tree;
private static final int MOD = 998244353;
public static void main(String[] args) {
int n = nextInt();
int m = nextInt();
int k = nextInt();
int[] a = nextIntArray(m);
tree = new List[n];
for (int i = 0; i < n; i++) tree[i] = new ArrayList<>();
for (int i = 0; i < n - 1; i++) {
int u = nextInt()-1;
int v = nextInt()-1;
tree[u].add(new Path(u, v, i));
tree[v].add(new Path(v, u, i));
}
counts = new int[n-1];
for (int i = 0; i < m-1; i++) {
int start = a[i]-1;
int goal = a[i+1]-1;
dfs(start, -1, goal);
}
int sum = Arrays.stream(counts).sum();
int max = sum+sum+1;
long[] dp = new long[max];
dp[sum] = 1;
for (int i = 0; i < n - 1; i++) {
long[] tmp = new long[max];
int ci = counts[i];
for (int j = 0; j < max; j++) {
int minus = j - ci;
if (minus>0) {
tmp[minus] += dp[j];
tmp[minus] %= MOD;
}
int plus = j + ci;
if (plus<max) {
tmp[plus] += dp[j];
tmp[plus] %= MOD;
}
}
dp = tmp;
}
out.println((sum+k>=0&&sum+k<max) ? dp[sum+k] : 0);
out.flush();
}
private static boolean dfs(int current, int prev, int goal) {
if (current == goal) return true;
for (Path path : tree[current]) {
int next = path.to;
if (next == prev) continue;
boolean result = dfs(next, current, goal);
if (result) {
counts[path.i]++;
return true;
}
}
return false;
}
private static class Path {
int from;
int to;
int i;
public Path(int from, int to, int i) {
this.from = from;
this.to = to;
this.i = i;
}
}
static PrintWriter out = new PrintWriter(System.out);
static Scanner scanner = new Scanner(System.in);
static String next() { return scanner.next(); }
static int nextInt() { return Integer.parseInt(next()); }
static long nextLong() { return Long.parseLong(next()); }
static double nextDouble() { return Double.parseDouble(next()); }
static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) { array[i] = nextInt(); }
return array;
}
static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) { array[i] = nextLong(); }
return array;
}
}
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
private static int[] counts;
private static List<Path>[] tree;
private static final int MOD = 998244353;
public static void main(String[] args) {
int n = nextInt();
int m = nextInt();
int k = nextInt();
int[] a = nextIntArray(m);
tree = new List[n];
for (int i = 0; i < n; i++) tree[i] = new ArrayList<>();
for (int i = 0; i < n - 1; i++) {
int u = nextInt()-1;
int v = nextInt()-1;
tree[u].add(new Path(u, v, i));
tree[v].add(new Path(v, u, i));
}
counts = new int[n-1];
for (int i = 0; i < m-1; i++) {
int start = a[i]-1;
int goal = a[i+1]-1;
dfs(start, -1, goal);
}
int sum = Arrays.stream(counts).sum();
int max = sum+sum+1;
long[] dp = new long[max];
dp[sum] = 1;
for (int i = 0; i < n - 1; i++) {
long[] tmp = new long[max];
int ci = counts[i];
for (int j = 0; j < max; j++) {
int minus = j - ci;
if (minus>=0) {
tmp[minus] += dp[j];
tmp[minus] %= MOD;
}
int plus = j + ci;
if (plus<max) {
tmp[plus] += dp[j];
tmp[plus] %= MOD;
}
}
dp = tmp;
}
out.println((sum+k>=0&&sum+k<max) ? dp[sum+k] : 0);
out.flush();
}
private static boolean dfs(int current, int prev, int goal) {
if (current == goal) return true;
for (Path path : tree[current]) {
int next = path.to;
if (next == prev) continue;
boolean result = dfs(next, current, goal);
if (result) {
counts[path.i]++;
return true;
}
}
return false;
}
private static class Path {
int from;
int to;
int i;
public Path(int from, int to, int i) {
this.from = from;
this.to = to;
this.i = i;
}
}
static PrintWriter out = new PrintWriter(System.out);
static Scanner scanner = new Scanner(System.in);
static String next() { return scanner.next(); }
static int nextInt() { return Integer.parseInt(next()); }
static long nextLong() { return Long.parseLong(next()); }
static double nextDouble() { return Double.parseDouble(next()); }
static int[] nextIntArray(int n) {
int[] array = new int[n];
for (int i = 0; i < n; i++) { array[i] = nextInt(); }
return array;
}
static long[] nextLongArray(int n) {
long[] array = new long[n];
for (int i = 0; i < n; i++) { array[i] = nextLong(); }
return array;
}
} | ConDefects/ConDefects/Code/abc222_e/Java/31947563 |
condefects-java_data_753 | import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int r=sc.nextInt();
int c=sc.nextInt();
if(r==1||c==1||r==15||c==15){
System.out.println("black");
}else if(r==2||r==14||c==2||c==14){
System.out.println("white");
}else if(r==3||c==13||c==3||r==13){
System.out.println("black");
}else if(r==4||c==12||r==12||c==4){
System.out.println("white");
}else if(r==5||c==11||r==11||c==5){
System.out.println("black");
}else if(r==6||c==10||r==10||c==6){
System.out.println("white");
}else if(r==7||c==8||r==8||c==7){
System.out.println("black");
}else{
System.out.println("white");
}
}
}
import java.util.*;
public class Main
{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int r=sc.nextInt();
int c=sc.nextInt();
if(r==1||c==1||r==15||c==15){
System.out.println("black");
}else if(r==2||r==14||c==2||c==14){
System.out.println("white");
}else if(r==3||c==13||c==3||r==13){
System.out.println("black");
}else if(r==4||c==12||r==12||c==4){
System.out.println("white");
}else if(r==5||c==11||r==11||c==5){
System.out.println("black");
}else if(r==6||c==10||r==10||c==6){
System.out.println("white");
}else if(r==7||c==9||r==9||c==7){
System.out.println("black");
}else{
System.out.println("white");
}
}
} | ConDefects/ConDefects/Code/abc264_b/Java/41861071 |
condefects-java_data_754 | import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int dis = Math.max(Math.abs(x-8),Math.abs(y));
if(dis % 2 == 0){
System.out.println("white");
}else{
System.out.println("black");
}
sc.close();
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
int dis = Math.max(Math.abs(x-8),Math.abs(y-8));
if(dis % 2 == 0){
System.out.println("white");
}else{
System.out.println("black");
}
sc.close();
}
} | ConDefects/ConDefects/Code/abc264_b/Java/41090309 |
condefects-java_data_755 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int r = sc.nextInt();
int c = sc.nextInt();
System.out.println(solve(r,c));
}
public static String solve(int r, int c) {
int max = Math.max((8-r),(8-c));
return max%2 == 1? "black":"white";
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int r = sc.nextInt();
int c = sc.nextInt();
System.out.println(solve(r,c));
}
public static String solve(int r, int c) {
int max = Math.max(Math.abs(8-r),Math.abs(8-c));
return max%2 == 1? "black":"white";
}
} | ConDefects/ConDefects/Code/abc264_b/Java/34490980 |
condefects-java_data_756 |
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int r = sc.nextInt();
int c = sc.nextInt();
String s = "";
if(r == c || r == 16 -c){
if(c% 2 == 1) s = "black";
else{ s = "white";}
}
else if(r > c){
if( r < 16 - c){
s = c%2 == 1? "black" : "white";
}else{
s = r % 2 == 1 ? "black" : "white";
}
}
else if(r < c){
if( c < 16 -r) {
s = r % 2 == 1? "black" : "white";
}else {
s = r % 2 == 1? "black" : "white";
}
}
System.out.println(s);
}
}
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int r = sc.nextInt();
int c = sc.nextInt();
String s = "";
if(r == c || r == 16 -c){
if(c% 2 == 1) s = "black";
else{ s = "white";}
}
else if(r > c){
if( r < 16 - c){
s = c%2 == 1? "black" : "white";
}else{
s = r % 2 == 1 ? "black" : "white";
}
}
else if(r < c){
if( c < 16 -r) {
s = r % 2 == 1? "black" : "white";
}else {
s = c % 2 == 1? "black" : "white";
}
}
System.out.println(s);
}
}
| ConDefects/ConDefects/Code/abc264_b/Java/34894448 |
condefects-java_data_757 | import java.util.Scanner;
public class Main{
public static void main(String[]args) {
Scanner scan=new Scanner (System.in);
int r=scan.nextInt();
int c=scan.nextInt();
int i;
for(i=1;i<=8;i++){
int jehad=16-8;
if(r==i||r==jehad||c==i||c==jehad){
break;
}
}
int answer=i%2;
if(answer==0){
System.out.println("white");
}else{
System.out.println("black");
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[]args) {
Scanner scan=new Scanner (System.in);
int r=scan.nextInt();
int c=scan.nextInt();
int i;
for(i=1;i<=8;i++){
int jehad=16-i;
if(r==i||r==jehad||c==i||c==jehad){
break;
}
}
int answer=i%2;
if(answer==0){
System.out.println("white");
}else{
System.out.println("black");
}
}
}
| ConDefects/ConDefects/Code/abc264_b/Java/35960124 |
condefects-java_data_758 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
Scanner sc = new Scanner(System.in);
//Scanner sc = new Scanner(new FileReader(new File("input.txt")));
int r = sc.nextInt();
int c = sc.nextInt();
if (Math.min(Math.abs(r-8), Math.abs(c-8)) % 2 == 0) System.out.println("white");
else System.out.println("black");
sc.close();
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws FileNotFoundException {
Scanner sc = new Scanner(System.in);
//Scanner sc = new Scanner(new FileReader(new File("input.txt")));
int r = sc.nextInt();
int c = sc.nextInt();
if (Math.max(Math.abs(r-8), Math.abs(c-8)) % 2 == 0) System.out.println("white");
else System.out.println("black");
sc.close();
}
}
| ConDefects/ConDefects/Code/abc264_b/Java/34818581 |
condefects-java_data_759 |
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
boolean[][] bool = new boolean[15][15];
for(int i=0;i<15;i++){
for(int j=0;j<15;j++){
if(i==0 || i==14) bool[i][j] = true;
else if(j==0 || j==14) bool[i][j] = true;
else if((i==2 || i==12) && (j>=2 && j<=12)) bool[i][j] = true;
else if((j==2 || j==12) && (i>=2 && i<=12)) bool[i][j] = true;
else if((i==4 || i==10) && (j>=4 && j<=10)) bool[i][j] = true;
else if((j==4 || j==10) && (i>=4 && i<=12)) bool[i][j] = true;
else if((i==6 || i==8) && (j>=6 && j<=8)) bool[i][j] = true;
else if((j==6 || j==8) && (i>=6 && i<=8)) bool[i][j] = true;
else bool[i][j] = false;
}
}
int r = sc.nextInt()-1;
int c = sc.nextInt()-1;
if(bool[r][c]) System.out.println("black");
else System.out.println("White");
sc.close();
}
}
import java.util.*;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
boolean[][] bool = new boolean[15][15];
for(int i=0;i<15;i++){
for(int j=0;j<15;j++){
if(i==0 || i==14) bool[i][j] = true;
else if(j==0 || j==14) bool[i][j] = true;
else if((i==2 || i==12) && (j>=2 && j<=12)) bool[i][j] = true;
else if((j==2 || j==12) && (i>=2 && i<=12)) bool[i][j] = true;
else if((i==4 || i==10) && (j>=4 && j<=10)) bool[i][j] = true;
else if((j==4 || j==10) && (i>=4 && i<=12)) bool[i][j] = true;
else if((i==6 || i==8) && (j>=6 && j<=8)) bool[i][j] = true;
else if((j==6 || j==8) && (i>=6 && i<=8)) bool[i][j] = true;
else bool[i][j] = false;
}
}
int r = sc.nextInt()-1;
int c = sc.nextInt()-1;
if(bool[r][c]) System.out.println("black");
else System.out.println("white");
sc.close();
}
}
| ConDefects/ConDefects/Code/abc264_b/Java/39759164 |
condefects-java_data_760 | import java.util.*;
public class Main {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
int r = Integer.parseInt(sc.next());
int c = Integer.parseInt(sc.next());
// rใๅฅๆฐใชใ้ป
// c ใ r ~ 15-(r-1) ้ป
// c ใ 0<r ใๅฅๆฐใชใ้ป
if(r==1 || r==15 || c==1 || r==15){
System.out.println("black");
}
else if(r==2 || r==14 || c==2 || c==14){
System.out.println("white");
}
else if(r==3 || r==13 || c==3 || c==13){
System.out.println("black");
}
else if(r==4 || r==12 || c==4 || c==12){
System.out.println("white");
}
else if(r==5 || r==11 || c==5 || c==11){
System.out.println("black");
}
else if(r==6 || r==10 || c==6 || c==10){
System.out.println("white");
}
else if(r==7 || r==9 || c==7 || c==9){
System.out.println("black");
}
else if(r==8){
System.out.println("white");
}
}
}
// oj t -c "java Main.java" -d ./test/
// acc submit Main.java -- -l 4005
import java.util.*;
public class Main {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
int r = Integer.parseInt(sc.next());
int c = Integer.parseInt(sc.next());
// rใๅฅๆฐใชใ้ป
// c ใ r ~ 15-(r-1) ้ป
// c ใ 0<r ใๅฅๆฐใชใ้ป
if(r==1 || r==15 || c==1 || c==15){
System.out.println("black");
}
else if(r==2 || r==14 || c==2 || c==14){
System.out.println("white");
}
else if(r==3 || r==13 || c==3 || c==13){
System.out.println("black");
}
else if(r==4 || r==12 || c==4 || c==12){
System.out.println("white");
}
else if(r==5 || r==11 || c==5 || c==11){
System.out.println("black");
}
else if(r==6 || r==10 || c==6 || c==10){
System.out.println("white");
}
else if(r==7 || r==9 || c==7 || c==9){
System.out.println("black");
}
else if(r==8){
System.out.println("white");
}
}
}
// oj t -c "java Main.java" -d ./test/
// acc submit Main.java -- -l 4005 | ConDefects/ConDefects/Code/abc264_b/Java/36911248 |
condefects-java_data_761 | import java.io.*;
import java.util.*;
public class Main extends PrintWriter {
Main() { super(System.out, true); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
Main o = new Main(); o.main(); o.flush();
}
void main() {
int n = sc.nextInt();
int[] aa = new int[n];
int x = 0;
for (int i = 0; i < n; i++)
x ^= aa[i] = sc.nextInt();
boolean win = false;
for (int i = 0; i < n; i++)
if (aa[i] == x) {
win = true;
break;
}
println(win ? "Win" : "Lose");
}
}
import java.io.*;
import java.util.*;
public class Main extends PrintWriter {
Main() { super(System.out, true); }
Scanner sc = new Scanner(System.in);
public static void main(String[] $) {
Main o = new Main(); o.main(); o.flush();
}
void main() {
int n = sc.nextInt();
int[] aa = new int[n];
int x = 0;
for (int i = 0; i < n; i++)
x ^= aa[i] = sc.nextInt();
boolean win = false;
for (int i = 0; i < n; i++)
if (aa[i] == x) {
win = true;
break;
}
println(win || n % 2 == 1 ? "Win" : "Lose");
}
}
| ConDefects/ConDefects/Code/arc131_c/Java/27715981 |
condefects-java_data_762 | 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 s = 0;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
s ^= a[i];
}
if (n % 1 == 1) System.out.println("Win");
else {
for (int i : a) {
if ((i ^ s) == 0) {
System.out.println("Win");
return;
}
}
System.out.println("Lose");
}
}
}
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 s = 0;
for (int i = 0;i < n;i++) {
a[i] = sc.nextInt();
s ^= a[i];
}
if (n % 2 == 1) System.out.println("Win");
else {
for (int i : a) {
if ((i ^ s) == 0) {
System.out.println("Win");
return;
}
}
System.out.println("Lose");
}
}
} | ConDefects/ConDefects/Code/arc131_c/Java/28475632 |
condefects-java_data_763 | import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }
return tok.nextToken();
}
int ni() throws IOException { return Integer.parseInt(next()); }
long nl() throws IOException { return Long.parseLong(next()); }
int[] na(int n) throws IOException { int[]A=new int[n]; for (int i=0;i<n;i++) A[i]=ni(); return A; }
long mod=1000000007;
void solve() throws IOException {
int n=ni();
int[]A=na(n);
int x=0;
for (int v:A) x^=v;
boolean f=false;
for (int v:A)
if (x==v) f=true;
if (f) out.println("Win");
else out.println("Lose");
out.flush();
}
int gcd(int a,int b) { return(b==0?a:gcd(b,a%b)); }
long gcd(long a,long b) { return(b==0?a:gcd(b,a%b)); }
long mp(long a,long p) { long r=1; while(p>0) { if ((p&1)==1) r=(r*a)%mod; p>>=1; a=(a*a)%mod; } return r; }
public static void main(String[] args) throws IOException {
new Main().solve();
}
}
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreTokens()) { tok = new StringTokenizer(in.readLine()); }
return tok.nextToken();
}
int ni() throws IOException { return Integer.parseInt(next()); }
long nl() throws IOException { return Long.parseLong(next()); }
int[] na(int n) throws IOException { int[]A=new int[n]; for (int i=0;i<n;i++) A[i]=ni(); return A; }
long mod=1000000007;
void solve() throws IOException {
int n=ni();
int[]A=na(n);
int x=0;
for (int v:A) x^=v;
boolean f=false;
for (int v:A)
if (x==v) f=true;
if (f || n%2==1) out.println("Win");
else out.println("Lose");
out.flush();
}
int gcd(int a,int b) { return(b==0?a:gcd(b,a%b)); }
long gcd(long a,long b) { return(b==0?a:gcd(b,a%b)); }
long mp(long a,long p) { long r=1; while(p>0) { if ((p&1)==1) r=(r*a)%mod; p>>=1; a=(a*a)%mod; } return r; }
public static void main(String[] args) throws IOException {
new Main().solve();
}
} | ConDefects/ConDefects/Code/arc131_c/Java/27743500 |
condefects-java_data_764 | import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
solve();
pw.flush();
}
public static void solve() {
int N = sc.nextInt();
int[] A = sc.nextIntArray(N);
int xor = 0;
for(int i = 0; i < N; i++){
xor ^= A[i];
}
boolean win = false;
for(int i = 0; i < N; i++){
if((xor^A[i]) == 0){
win = true;
break;
}
}
pw.println(win || N == 3 ? "Win" : "Lose");
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
import java.util.*;
import java.io.*;
public class Main {
static FastScanner sc = new FastScanner(System.in);
static PrintWriter pw = new PrintWriter(System.out);
static StringBuilder sb = new StringBuilder();
static long mod = (long) 1e9 + 7;
public static void main(String[] args) throws Exception {
solve();
pw.flush();
}
public static void solve() {
int N = sc.nextInt();
int[] A = sc.nextIntArray(N);
int xor = 0;
for(int i = 0; i < N; i++){
xor ^= A[i];
}
boolean win = false;
for(int i = 0; i < N; i++){
if((xor^A[i]) == 0){
win = true;
break;
}
}
pw.println(win || N % 2 == 1 ? "Win" : "Lose");
}
static class GeekInteger {
public static void save_sort(int[] array) {
shuffle(array);
Arrays.sort(array);
}
public static int[] shuffle(int[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
int randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
public static void save_sort(long[] array) {
shuffle(array);
Arrays.sort(array);
}
public static long[] shuffle(long[] array) {
int n = array.length;
Random random = new Random();
for (int i = 0, j; i < n; i++) {
j = i + random.nextInt(n - i);
long randomElement = array[j];
array[j] = array[i];
array[i] = randomElement;
}
return array;
}
}
}
class FastScanner {
private BufferedReader reader = null;
private StringTokenizer tokenizer = null;
public FastScanner(InputStream in) {
reader = new BufferedReader(new InputStreamReader(in));
tokenizer = null;
}
public FastScanner(FileReader in) {
reader = new BufferedReader(in);
tokenizer = null;
}
public String next() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public String nextLine() {
if (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
return reader.readLine();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken("\n");
}
public long nextLong() {
return Long.parseLong(next());
}
public int nextInt() {
return Integer.parseInt(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String[] nextArray(int n) {
String[] a = new String[n];
for (int i = 0; i < n; i++)
a[i] = next();
return a;
}
public int[] nextIntArray(int n) {
int[] a = new int[n];
for (int i = 0; i < n; i++)
a[i] = nextInt();
return a;
}
public long[] nextLongArray(int n) {
long[] a = new long[n];
for (int i = 0; i < n; i++)
a[i] = nextLong();
return a;
}
}
| ConDefects/ConDefects/Code/arc131_c/Java/27718141 |
condefects-java_data_765 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;
public final class Main {
private static Scanner scanner;
private static PrintWriter writer;
// private static final long PRIME = 1000000007;
// private static final long PRIME = 998244353;
static {
scanner = new Scanner(System.in);
writer = new PrintWriter(System.out);
}
public static final void main(String[] args) {
final int N = getNextInt();
final int M = getNextInt();
final int[][] B = get2dIntArray(N, M);
if(B[0][0] % 7 == 0 || B[0][0] % 7 > 8 - M) {
println("No");
flush();
return;
}
for(int idx = 1; idx < M; idx++) {
if(B[0][idx] != B[0][idx - 1] + 1) {
println("No");
flush();
return;
}
}
for(int hidx = 1; hidx < N; hidx++) {
for(int widx = 0; widx < M; widx++) {
if(B[hidx][widx] != B[hidx - 1][widx] + 7) {
println("No");
flush();
return;
}
}
}
println("Yes");
flush();
}
private static String getNext() {
return scanner.next();
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(scanner.next());
}
private static long getNextLong() {
return Long.parseLong(scanner.next());
}
private static double getNextDouble() {
return Double.parseDouble(scanner.next());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(()->getNextInt()).limit(length).map(mapper).toArray();
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(()->getNextInt()).limit(length).map(mapper).collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(()->getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(()->getNextLong()).limit(length).map(mapper).collect(Collectors.toCollection(ArrayList::new));
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(()->getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(()->getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static void print(int[] argi) {
Arrays.stream(argi).forEach(i->print(String.valueOf(i) + " "));
}
private static void print(Object obj) {
writer.print(obj);
}
private static void print(Object... arg) {
Arrays.stream(arg).forEach(obj->print(obj));
}
private static void println(int[] argi) {
print(argi);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println(Object... arg) {
print(arg);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;
public final class Main {
private static Scanner scanner;
private static PrintWriter writer;
// private static final long PRIME = 1000000007;
// private static final long PRIME = 998244353;
static {
scanner = new Scanner(System.in);
writer = new PrintWriter(System.out);
}
public static final void main(String[] args) {
final int N = getNextInt();
final int M = getNextInt();
final int[][] B = get2dIntArray(N, M);
if((B[0][0] - 1) % 7 > 7 - M) {
println("No");
flush();
return;
}
for(int idx = 1; idx < M; idx++) {
if(B[0][idx] != B[0][idx - 1] + 1) {
println("No");
flush();
return;
}
}
for(int hidx = 1; hidx < N; hidx++) {
for(int widx = 0; widx < M; widx++) {
if(B[hidx][widx] != B[hidx - 1][widx] + 7) {
println("No");
flush();
return;
}
}
}
println("Yes");
flush();
}
private static String getNext() {
return scanner.next();
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(scanner.next());
}
private static long getNextLong() {
return Long.parseLong(scanner.next());
}
private static double getNextDouble() {
return Double.parseDouble(scanner.next());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(()->getNextInt()).limit(length).map(mapper).toArray();
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(()->getNextInt()).limit(length).map(mapper).collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(()->getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(()->getNextLong()).limit(length).map(mapper).collect(Collectors.toCollection(ArrayList::new));
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(()->getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(()->getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static void print(int[] argi) {
Arrays.stream(argi).forEach(i->print(String.valueOf(i) + " "));
}
private static void print(Object obj) {
writer.print(obj);
}
private static void print(Object... arg) {
Arrays.stream(arg).forEach(obj->print(obj));
}
private static void println(int[] argi) {
print(argi);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println(Object... arg) {
print(arg);
println();
}
private static void println() {
writer.println();
}
private static void flush() {
writer.flush();
}
}
| ConDefects/ConDefects/Code/abc225_c/Java/44932029 |
condefects-java_data_766 | import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
boolean isTrue = true;
int[] num = new int[M];
for(int i=0;i<M;i++)
num[i] = sc.nextInt()-1;
for(int i=1;i<M;i++)
isTrue &= num[i-1]%7+1==num[i]%7;
for(int i=1;i<N;i++){
for(int j=0;j<M;j++){
int B = sc.nextInt()-1;
isTrue &= B-7==num[j];
num[j] = B;
}
}
System.out.println(isTrue?"Yes":"No");
}
}
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
boolean isTrue = true;
int[] num = new int[M];
for(int i=0;i<M;i++)
num[i] = sc.nextInt()-1;
for(int i=1;i<M;i++)
isTrue &= num[i-1]+1==num[i]&&num[i-1]%7+1==num[i]%7;
for(int i=1;i<N;i++){
for(int j=0;j<M;j++){
int B = sc.nextInt()-1;
isTrue &= B-7==num[j];
num[j] = B;
}
}
System.out.println(isTrue?"Yes":"No");
}
}
| ConDefects/ConDefects/Code/abc225_c/Java/41892231 |
condefects-java_data_767 | import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner entrada = new Scanner(System.in);
int m = entrada.nextInt();
int n = entrada.nextInt();
int [][] mat = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
mat[i][j]= entrada.nextInt();
}
}
int x = mat[0][0];
boolean sen = true;
for (int i = 1; i < n && sen; i++) {
sen = x+i == mat[0][i];
}
if (!sen) {
System.out.println("No");
return;
}
while((x-1)%7 != 0){
x--;
}
if (mat[0][n-1] >= x+8 ) {
System.out.println("No");
}else{
sen=true;
for (int i = 1; i < m && sen; i++) {
for (int j = 0; j < n && sen ; j++) {
sen = mat[i-1][j]+7 == mat[i][j];
}
}
if (sen) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
}
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner entrada = new Scanner(System.in);
int m = entrada.nextInt();
int n = entrada.nextInt();
int [][] mat = new int[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
mat[i][j]= entrada.nextInt();
}
}
int x = mat[0][0];
boolean sen = true;
for (int i = 1; i < n && sen; i++) {
sen = x+i == mat[0][i];
}
if (!sen) {
System.out.println("No");
return;
}
while((x-1)%7 != 0){
x--;
}
if (mat[0][n-1] >= x+7 ) {
System.out.println("No");
}else{
sen=true;
for (int i = 1; i < m && sen; i++) {
for (int j = 0; j < n && sen ; j++) {
sen = mat[i-1][j]+7 == mat[i][j];
}
}
if (sen) {
System.out.println("Yes");
} else {
System.out.println("No");
}
}
}
} | ConDefects/ConDefects/Code/abc225_c/Java/45269340 |
condefects-java_data_768 | import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
boolean check=true;
int[][] arr=new int[n][m];
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
arr[i][j]=sc.nextInt();
if(i!=0 && arr[i-1][j]+7!=arr[i][j]) check=false;
if(j!=0 && arr[i][j-1]+1!=arr[i][j]) check=false;
}
}
if(arr[0][0]%7==0 || arr[0][0]%7+m>8) check=false;
System.out.println(check?"Yes":"No");
}
}
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
boolean check=true;
int[][] arr=new int[n][m];
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
arr[i][j]=sc.nextInt();
if(i!=0 && arr[i-1][j]+7!=arr[i][j]) check=false;
if(j!=0 && arr[i][j-1]+1!=arr[i][j]) check=false;
}
}
if((arr[0][0]%7==0 && m!=1) || arr[0][0]%7+m>8) check=false;
System.out.println(check?"Yes":"No");
}
} | ConDefects/ConDefects/Code/abc225_c/Java/38476918 |
condefects-java_data_769 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
int b = scanner.nextInt();
if (b == 0) {
System.out.println("0.000");
} else if (a == b) {
System.out.println("1.000");
} else {
int c = b * 10000 / a;
if (c % 10 < 5) {
System.out.println("0." + c / 10);
} else {
System.out.println("0." + c / 10 + 1);
}
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
int b = scanner.nextInt();
if (b == 0) {
System.out.println("0.000");
} else if (a == b) {
System.out.println("1.000");
} else {
int c = b * 10000 / a;
if (c % 10 < 5) {
System.out.println("0." + c / 10);
} else {
System.out.println("0." + (c / 10 + 1));
}
}
}
} | ConDefects/ConDefects/Code/abc274_a/Java/36031181 |
condefects-java_data_770 | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double b = sc.nextDouble();
System.out.println(Math.round(b/a*1000)/1000.0);
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double b = sc.nextDouble();
System.out.println(String.format("%.3f",Math.round(b/a*1000)/1000.0));
}
} | ConDefects/ConDefects/Code/abc274_a/Java/36006140 |
condefects-java_data_771 | import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
StringBuilder sb = new StringBuilder();
int A = sc.nextInt();
int B = sc.nextInt();
if(A == B){
System.out.println("1.000");
}else{
sb.append("0.");
B = B*10000;
double c = B/A;
c /= 10;
long res = Math.round(c);
sb.append(Long.toString(res));
String ans = sb.toString();
System.out.println(ans);
}
sc.close();
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
StringBuilder sb = new StringBuilder();
int A = sc.nextInt();
int B = sc.nextInt();
if(A == B){
System.out.println("1.000");
}else if(B == 0){
System.out.println("0.000");
}else{
sb.append("0.");
B = B*10000;
double c = B/A;
c /= 10;
long res = Math.round(c);
sb.append(Long.toString(res));
String ans = sb.toString();
System.out.println(ans);
}
sc.close();
}
}
| ConDefects/ConDefects/Code/abc274_a/Java/36495255 |
condefects-java_data_772 | import java.util.Scanner;
import java.math.BigDecimal;
import java.math.RoundingMode;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
double a = sc.nextInt();
double b = sc.nextInt();
sc.close();
double x = b / a;
BigDecimal bd = new BigDecimal(x).setScale(3, RoundingMode.HALF_UP);
x = bd.doubleValue();
System.out.println(x);
}
}
import java.util.Scanner;
import java.math.BigDecimal;
import java.math.RoundingMode;
public class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
double a = sc.nextInt();
double b = sc.nextInt();
sc.close();
double x = b / a;
BigDecimal bd = new BigDecimal(x).setScale(3, RoundingMode.HALF_UP);
x = bd.doubleValue();
System.out.printf("%.3f\n",x);
}
} | ConDefects/ConDefects/Code/abc274_a/Java/41296427 |
condefects-java_data_773 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double A = sc.nextDouble();
double B = sc.nextDouble();
double ans = B/A;
System.out.println(String.format("%.3g%n", ans));
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double A = sc.nextDouble();
double B = sc.nextDouble();
double ans = B/A;
System.out.format("%.3f", ans);
}
} | ConDefects/ConDefects/Code/abc274_a/Java/36004580 |
condefects-java_data_774 | 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();
double d = (double)B / A;
d = Math.round(d * 10000) / 10000.0; // ๅฐๆฐ็น็ฌฌ4ไฝใงๅๆจไบๅ
ฅ
System.out.printf("%.4f", d);
System.out.println();
}
}
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();
double d = (double)B / A;
d = Math.round(d * 10000) / 10000.0; // ๅฐๆฐ็น็ฌฌ4ไฝใงๅๆจไบๅ
ฅ
System.out.printf("%.3f", d);
System.out.println();
}
} | ConDefects/ConDefects/Code/abc274_a/Java/39490709 |
condefects-java_data_775 | import java.util.*;
import java.io.*;
class Solver {
void solve(FScanner sc, FWriter out) {
double a = sc.nextDouble(), b = sc.nextDouble();
out.println(b / a);
}
}
class ModInt extends Number {
static final int MOD = 998244353;
// static final int MOD = 998244353;
static final int MEMO_SIZE = 1024;
static List<ModInt> memoFactrial;
static Map<Integer, ModInt> memoInverse = new HashMap<>();
static ModInt memoModInt[];
int value;
static {
memoModInt = new ModInt[MEMO_SIZE];
memoFactrial = new ArrayList<ModInt>();
memoFactrial.add(ModInt.valueOf(1));
}
static int add(int a, int b) {
int result = a + b;
return result > MOD ? result - MOD : result;
}
static int sub(int a, int b) {
int result = a - b;
return result < 0 ? result + MOD : result;
}
static int mul(int a, int b) {
long result = ((long) a) * b;
return (int) (result % MOD);
}
static int pow(int a, long b) {
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 int inverse(int a) {
if (memoInverse.containsKey(a)) {
return memoInverse.get(a).intValue();
} else {
ModInt inverse = ModInt.valueOf(pow(a, MOD - 2));
memoInverse.put(a, inverse);
return inverse.intValue();
}
}
static int div(int a, int b) {
return mul(a, inverse(b));
}
static ModInt factrial(int n) {
for (int i = memoFactrial.size(); i <= n; i++) {
memoFactrial.add(memoFactrial.get(i - 1).mul(i));
}
return memoFactrial.get(n);
}
static Map<Integer, List<ModInt>> memoConbination = new TreeMap<>();
static ModInt combination(int n, int r) {
if (n < 1 || r < 1 || n < r)
return ModInt.valueOf(0);
if (n == r)
return ModInt.valueOf(1);
// nใๅฐใใๅ ดๅใฏๅ
ฌๅผใไฝฟใ
if (n < 51000)
return factrial(n).div(factrial(r).mul(factrial(n - r)));
// nCr = nC(n - r)ใ่จ็ฎ้ใๅฐใชใๆนใ้ธใถ
if (r > n - r)
r = n - r;
List<ModInt> result;
if (!memoConbination.containsKey(n)) {
// ๅๆๅคใฏnC0 = 0, nC1 = n
result = Arrays.asList(ModInt.valueOf(0), ModInt.valueOf(n));
memoConbination.put(n, result);
} else {
result = memoConbination.get(n);
}
for (int i = result.size(); i <= r; i++) {
// nC(r) = nC(r - 1) * (n - r + 1) / r
result.add(result.get(i - 1).mul(n - i + 1).div(i));
}
return result.get(r);
}
static Map<Integer, List<ModInt>> memoPermutations = new TreeMap<>();
static ModInt permutations(int n, int r) {
if (n < 1 || r < 1 || n < r)
return ModInt.valueOf(0);
if (n == r)
return ModInt.valueOf(1);
// nใๅฐใใๅ ดๅใฏๅ
ฌๅผใไฝฟใ
if (n < 51000)
return factrial(n).div(factrial(n - r));
// nCr = nC(n - r)ใ่จ็ฎ้ใๅฐใชใๆนใ้ธใถ
if (r > n - r)
r = n - r;
List<ModInt> result;
if (!memoPermutations.containsKey(n)) {
// ๅๆๅคใฏnC0 = 0, nC1 = n
result = Arrays.asList(ModInt.valueOf(0), ModInt.valueOf(n));
memoPermutations.put(n, result);
} else {
result = memoPermutations.get(n);
}
for (int i = result.size(); i <= r; i++) {
// nC(r) = nC(r - 1) * (n - r + 1)
result.add(result.get(i - 1).mul(n - i + 1));
}
return result.get(r);
}
static ModInt combination(Number n, Number r) {
return combination(n, r);
}
/*
* ็ญๅทฎๆฐๅใฎๅ
* @param n ้
ๆฐ
* @param a ๅ้
* @param l ๆซ้
*/
static ModInt sumOfArithmeticProgressions(long n, long a, long l) {
return ModInt.valueOf(n).mul(ModInt.valueOf(a).add(l)).div(2);
}
ModInt add(int b) {
return ModInt.valueOf(ModInt.add(value, b % MOD));
}
ModInt sub(int b) {
return ModInt.valueOf(ModInt.sub(value, b % MOD));
}
ModInt mul(int b) {
return ModInt.valueOf(ModInt.mul(value, b % MOD));
}
ModInt div(int b) {
return ModInt.valueOf(ModInt.div(value, b % MOD));
}
ModInt pow(int b) {
return ModInt.valueOf(ModInt.pow(value, b));
}
ModInt add(long b) {
return ModInt.valueOf(ModInt.add(value, (int)(b % MOD)));
}
ModInt sub(long b) {
return ModInt.valueOf(ModInt.sub(value, (int)(b % MOD)));
}
ModInt mul(long b) {
return ModInt.valueOf(ModInt.mul(value, (int)(b % MOD)));
}
ModInt div(long b) {
return ModInt.valueOf(ModInt.div(value, (int)(b % MOD)));
}
ModInt pow(long b) {
return ModInt.valueOf(ModInt.pow(value, b));
}
ModInt add(ModInt b) {
if(b == null) return this;
return add(b.intValue());
}
ModInt sub(ModInt b) {
if(b == null) return this;
return sub(b.intValue());
}
ModInt mul(ModInt b) {
if(b == null) return this;
return mul(b.intValue());
}
ModInt div(ModInt b) {
if(b == null) return this;
return div(b.intValue());
}
ModInt pow(ModInt b) {
if(b == null) return this;
return pow(b.intValue());
}
static ModInt valueOf(int value) {
if(value < 0) value += (value / MOD + 1) * MOD;
value %= MOD;
if (value < MEMO_SIZE) {
return memoModInt[value] = memoModInt[value] != null ? memoModInt[value] : new ModInt(value);
}
return new ModInt(value);
}
static ModInt valueOf(long value) {
return valueOf((int)(value % MOD));
}
static ModInt valueOf(Number value) {
return valueOf(value.longValue());
}
public ModInt(int value) {
this.value = value;
}
public int intValue() {
return value;
}
public long longValue() {
return value;
}
public float floatValue() {
return value;
}
public double doubleValue() {
return value;
}
@Override
public int hashCode() {
return value;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (!(obj instanceof Number))
return false;
Number other = (Number) obj;
return value == other.intValue();
}
@Override
public String toString() {
return String.valueOf(value);
}
}
// common
public class Main {
public static void main(String[] args) {
FScanner sc = new FScanner(System.in);
FWriter out = new FWriter(System.out);
try {
(new Solver()).solve(sc, out);
} catch (Throwable e) {
out.println(e);
out.flush();
System.exit(1);
} finally {
out.flush();
sc.close();
}
}
}
class TwoKeyMap<K, V> {
Map<K, Map<K, V>> map = new HashMap<>();
Set<K> _key2Set = new HashSet<>();
TwoKeyMap<K, V> put(K key1, K key2, V value) {
_key2Set.add(key2);
map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).put(key2, value);
return this;
}
TwoKeyMap<K, V> put(K[] key, V value) {
return put(key[0], key[1], value);
}
TwoKeyMap<K, V> merge(K key1, K key2, V value,
java.util.function.BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
_key2Set.add(key2);
map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).merge(key2, value, remappingFunction);
return this;
}
TwoKeyMap<K, V> merge(K[] key, V value,
java.util.function.BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
return merge(key[0], key[1], value, remappingFunction);
}
V get(K key1, K key2) {
var m1 = map.get(key1);
if (m1 == null)
return null;
return m1.get(key2);
}
Map<K, V> get(K key1) {
return map.get(key1);
}
V get(K[] key) {
return get(key[0], key[1]);
}
V computeIfAbsent(K key1, K key2, java.util.function.Function<? super K, ? extends V> mappingFunction) {
return map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).computeIfAbsent(key2, mappingFunction);
}
boolean containsKey(K key1, K key2) {
return get(key1, key2) != null;
}
Set<K> key1Set() {
return map.keySet();
}
Set<K> key2Set() {
// ๆฌๆฅใฏใคใณในใฟใณในไฝใในใใ ใใ็ซถๆใใญใฐใฉใใณใฐๅใใชใฎใงใใใฉใผใใณในๅชๅ
return _key2Set;
}
}
class FScanner {
private InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public java.math.BigDecimal nextDecimal() {
return new java.math.BigDecimal(next());
}
public java.util.stream.IntStream nextIntStream(int n) {
return java.util.stream.IntStream.range(0, n).map(i -> nextInt());
}
public java.util.stream.LongStream nextLongStream(int n) {
return java.util.stream.LongStream.range(0L, (long) n).map(i -> nextLong());
}
public java.util.stream.Stream<String> nextStream(int n) {
return java.util.stream.IntStream.range(0, n).mapToObj(i -> next());
}
public int[] nextIntArray(int arraySize) {
int[] ary = new int[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextInt();
}
return ary;
}
public long[] nextLongArray(int arraySize) {
long[] ary = new long[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextLong();
}
return ary;
}
public java.util.stream.Stream<int[]> nextIntArrayStream(int n, int arraySize) {
return java.util.stream.IntStream.range(0, n).mapToObj(_i -> {
int[] ary = new int[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextInt();
}
return ary;
});
}
public java.util.stream.Stream<long[]> nextLongArrayStream(int n, int arraySize) {
return java.util.stream.IntStream.range(0, n).mapToObj(_i -> {
long[] ary = new long[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextLong();
}
return ary;
});
}
public boolean close() {
return true;
}
}
class FWriter {
OutputStream out;
byte[] buf = new byte[1 << 16];
byte[] ibuf = new byte[20];
int tail = 0;
final byte SP = (byte) ' ', LF = (byte) '\n', HYPHEN = (byte) '-';
boolean isDebug = false;
FWriter(OutputStream out) {
this.out = out;
}
void flush() {
try {
out.write(buf, 0, tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
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 println() {
write(LF);
}
FWriter print(char c) {
write((byte) c);
return this;
}
FWriter println(char c) {
print(c);
println();
return this;
}
FWriter print(int n) {
if (n < 0) {
n = -n;
write(HYPHEN);
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
return this;
}
FWriter println(int n) {
print(n);
println();
return this;
}
FWriter print(long n) {
if (n < 0) {
n = -n;
write(HYPHEN);
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
return this;
}
FWriter println(long n) {
print(n);
println();
return this;
}
FWriter print(String s) {
if (s != null) {
byte[] b = s.getBytes();
write(b, 0, b.length);
}
return this;
}
FWriter println(String s) {
print(s);
println();
return this;
}
FWriter print(int[] a) {
for (int i = 0; i < a.length; i++) {
if (i > 0)
write(SP);
print(a[i]);
}
return this;
}
FWriter println(int[] a) {
print(a);
println();
return this;
}
FWriter print(long[] a) {
for (int i = 0; i < a.length; i++) {
if (i > 0)
write(SP);
print(a[i]);
}
return this;
}
FWriter println(long[] a) {
print(a);
println();
return this;
}
FWriter print(char[] s, int from, int to) {
for (int i = from; i < to && s[i] != '\0'; i++) {
print(s[i]);
}
return this;
}
FWriter print(char[] s) {
print(s, 0, s.length);
return this;
}
FWriter println(char[] s, int from, int to) {
print(s, from, to);
println();
return this;
}
FWriter println(char[] s) {
println(s, 0, s.length);
return this;
}
FWriter print(double n, int accuracy) {
long longN = (long) n;
print(longN);
n -= (long) n;
write((byte) '.');
for (int j = 0; j < accuracy; j++) {
n *= 10;
int digit = (int) n;
write((byte) (digit + '0'));
n -= digit;
}
return this;
}
FWriter print(double n) {
print(n, 10);
return this;
}
FWriter println(double n) {
print(n);
println();
return this;
}
FWriter println(double n, int accuracy) {
print(n, accuracy);
println();
return this;
}
FWriter print(Object o) {
if (o != null) {
print(o.toString());
}
return this;
}
FWriter println(Object o) {
print(o);
println();
return this;
}
FWriter println(Throwable e) {
println(e.toString());
for (StackTraceElement el : e.getStackTrace()) {
print(" ").println(el.toString());
}
if (e.getCause() != null) {
println(e.getCause());
}
return this;
}
void enableDebug() {
this.isDebug = true;
}
private void _debug(Object o, int indent) {
if(o == null) {
for(var i = 0; i < indent; i++) print(' ');
print("null");
} else if(o.getClass().isArray()) {
for(int i = 0; i < java.lang.reflect.Array.getLength(o); i++) {
println();
_debug(java.lang.reflect.Array.get(o, i), indent + 2);
}
return;
} else if(o instanceof Collection) {
for(var item : (Collection<?>)o) {
println();
_debug(item, indent + 2);
}
} else if(o instanceof Map) {
for(var i = 0; i < indent; i++) print(' ');
println('{');
for(var entry : ((Map<?,?>)o).entrySet()) {
for(var i = 0; i < indent + 2; i++) print(' ');
_debug(entry.getKey(), 0);
_debug(" ", 0);
_debug(entry.getValue(), 0);
println();
}
for(var i = 0; i < indent; i++) print(' ');
println('}');
return;
}
for(var i = 0; i < indent; i++) print(' ');
print(o);
}
FWriter debug(Object... os) {
if(!isDebug) return this;
print("[DEBUG:").print(Thread.currentThread().getStackTrace()[2].getLineNumber()).print("]: ");
for(var o : os) {
_debug(o, 0);
print(' ');
}
print(" :[DEBUG:").print(Thread.currentThread().getStackTrace()[2].getLineNumber()).println("]");
return this;
}
}
import java.util.*;
import java.io.*;
class Solver {
void solve(FScanner sc, FWriter out) {
double a = sc.nextDouble(), b = sc.nextDouble();
out.println(String.format("%.3f", b / a));
}
}
class ModInt extends Number {
static final int MOD = 998244353;
// static final int MOD = 998244353;
static final int MEMO_SIZE = 1024;
static List<ModInt> memoFactrial;
static Map<Integer, ModInt> memoInverse = new HashMap<>();
static ModInt memoModInt[];
int value;
static {
memoModInt = new ModInt[MEMO_SIZE];
memoFactrial = new ArrayList<ModInt>();
memoFactrial.add(ModInt.valueOf(1));
}
static int add(int a, int b) {
int result = a + b;
return result > MOD ? result - MOD : result;
}
static int sub(int a, int b) {
int result = a - b;
return result < 0 ? result + MOD : result;
}
static int mul(int a, int b) {
long result = ((long) a) * b;
return (int) (result % MOD);
}
static int pow(int a, long b) {
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 int inverse(int a) {
if (memoInverse.containsKey(a)) {
return memoInverse.get(a).intValue();
} else {
ModInt inverse = ModInt.valueOf(pow(a, MOD - 2));
memoInverse.put(a, inverse);
return inverse.intValue();
}
}
static int div(int a, int b) {
return mul(a, inverse(b));
}
static ModInt factrial(int n) {
for (int i = memoFactrial.size(); i <= n; i++) {
memoFactrial.add(memoFactrial.get(i - 1).mul(i));
}
return memoFactrial.get(n);
}
static Map<Integer, List<ModInt>> memoConbination = new TreeMap<>();
static ModInt combination(int n, int r) {
if (n < 1 || r < 1 || n < r)
return ModInt.valueOf(0);
if (n == r)
return ModInt.valueOf(1);
// nใๅฐใใๅ ดๅใฏๅ
ฌๅผใไฝฟใ
if (n < 51000)
return factrial(n).div(factrial(r).mul(factrial(n - r)));
// nCr = nC(n - r)ใ่จ็ฎ้ใๅฐใชใๆนใ้ธใถ
if (r > n - r)
r = n - r;
List<ModInt> result;
if (!memoConbination.containsKey(n)) {
// ๅๆๅคใฏnC0 = 0, nC1 = n
result = Arrays.asList(ModInt.valueOf(0), ModInt.valueOf(n));
memoConbination.put(n, result);
} else {
result = memoConbination.get(n);
}
for (int i = result.size(); i <= r; i++) {
// nC(r) = nC(r - 1) * (n - r + 1) / r
result.add(result.get(i - 1).mul(n - i + 1).div(i));
}
return result.get(r);
}
static Map<Integer, List<ModInt>> memoPermutations = new TreeMap<>();
static ModInt permutations(int n, int r) {
if (n < 1 || r < 1 || n < r)
return ModInt.valueOf(0);
if (n == r)
return ModInt.valueOf(1);
// nใๅฐใใๅ ดๅใฏๅ
ฌๅผใไฝฟใ
if (n < 51000)
return factrial(n).div(factrial(n - r));
// nCr = nC(n - r)ใ่จ็ฎ้ใๅฐใชใๆนใ้ธใถ
if (r > n - r)
r = n - r;
List<ModInt> result;
if (!memoPermutations.containsKey(n)) {
// ๅๆๅคใฏnC0 = 0, nC1 = n
result = Arrays.asList(ModInt.valueOf(0), ModInt.valueOf(n));
memoPermutations.put(n, result);
} else {
result = memoPermutations.get(n);
}
for (int i = result.size(); i <= r; i++) {
// nC(r) = nC(r - 1) * (n - r + 1)
result.add(result.get(i - 1).mul(n - i + 1));
}
return result.get(r);
}
static ModInt combination(Number n, Number r) {
return combination(n, r);
}
/*
* ็ญๅทฎๆฐๅใฎๅ
* @param n ้
ๆฐ
* @param a ๅ้
* @param l ๆซ้
*/
static ModInt sumOfArithmeticProgressions(long n, long a, long l) {
return ModInt.valueOf(n).mul(ModInt.valueOf(a).add(l)).div(2);
}
ModInt add(int b) {
return ModInt.valueOf(ModInt.add(value, b % MOD));
}
ModInt sub(int b) {
return ModInt.valueOf(ModInt.sub(value, b % MOD));
}
ModInt mul(int b) {
return ModInt.valueOf(ModInt.mul(value, b % MOD));
}
ModInt div(int b) {
return ModInt.valueOf(ModInt.div(value, b % MOD));
}
ModInt pow(int b) {
return ModInt.valueOf(ModInt.pow(value, b));
}
ModInt add(long b) {
return ModInt.valueOf(ModInt.add(value, (int)(b % MOD)));
}
ModInt sub(long b) {
return ModInt.valueOf(ModInt.sub(value, (int)(b % MOD)));
}
ModInt mul(long b) {
return ModInt.valueOf(ModInt.mul(value, (int)(b % MOD)));
}
ModInt div(long b) {
return ModInt.valueOf(ModInt.div(value, (int)(b % MOD)));
}
ModInt pow(long b) {
return ModInt.valueOf(ModInt.pow(value, b));
}
ModInt add(ModInt b) {
if(b == null) return this;
return add(b.intValue());
}
ModInt sub(ModInt b) {
if(b == null) return this;
return sub(b.intValue());
}
ModInt mul(ModInt b) {
if(b == null) return this;
return mul(b.intValue());
}
ModInt div(ModInt b) {
if(b == null) return this;
return div(b.intValue());
}
ModInt pow(ModInt b) {
if(b == null) return this;
return pow(b.intValue());
}
static ModInt valueOf(int value) {
if(value < 0) value += (value / MOD + 1) * MOD;
value %= MOD;
if (value < MEMO_SIZE) {
return memoModInt[value] = memoModInt[value] != null ? memoModInt[value] : new ModInt(value);
}
return new ModInt(value);
}
static ModInt valueOf(long value) {
return valueOf((int)(value % MOD));
}
static ModInt valueOf(Number value) {
return valueOf(value.longValue());
}
public ModInt(int value) {
this.value = value;
}
public int intValue() {
return value;
}
public long longValue() {
return value;
}
public float floatValue() {
return value;
}
public double doubleValue() {
return value;
}
@Override
public int hashCode() {
return value;
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (!(obj instanceof Number))
return false;
Number other = (Number) obj;
return value == other.intValue();
}
@Override
public String toString() {
return String.valueOf(value);
}
}
// common
public class Main {
public static void main(String[] args) {
FScanner sc = new FScanner(System.in);
FWriter out = new FWriter(System.out);
try {
(new Solver()).solve(sc, out);
} catch (Throwable e) {
out.println(e);
out.flush();
System.exit(1);
} finally {
out.flush();
sc.close();
}
}
}
class TwoKeyMap<K, V> {
Map<K, Map<K, V>> map = new HashMap<>();
Set<K> _key2Set = new HashSet<>();
TwoKeyMap<K, V> put(K key1, K key2, V value) {
_key2Set.add(key2);
map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).put(key2, value);
return this;
}
TwoKeyMap<K, V> put(K[] key, V value) {
return put(key[0], key[1], value);
}
TwoKeyMap<K, V> merge(K key1, K key2, V value,
java.util.function.BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
_key2Set.add(key2);
map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).merge(key2, value, remappingFunction);
return this;
}
TwoKeyMap<K, V> merge(K[] key, V value,
java.util.function.BiFunction<? super V, ? super V, ? extends V> remappingFunction) {
return merge(key[0], key[1], value, remappingFunction);
}
V get(K key1, K key2) {
var m1 = map.get(key1);
if (m1 == null)
return null;
return m1.get(key2);
}
Map<K, V> get(K key1) {
return map.get(key1);
}
V get(K[] key) {
return get(key[0], key[1]);
}
V computeIfAbsent(K key1, K key2, java.util.function.Function<? super K, ? extends V> mappingFunction) {
return map.computeIfAbsent(key1, (f) -> new HashMap<K, V>()).computeIfAbsent(key2, mappingFunction);
}
boolean containsKey(K key1, K key2) {
return get(key1, key2) != null;
}
Set<K> key1Set() {
return map.keySet();
}
Set<K> key2Set() {
// ๆฌๆฅใฏใคใณในใฟใณในไฝใในใใ ใใ็ซถๆใใญใฐใฉใใณใฐๅใใชใฎใงใใใฉใผใใณในๅชๅ
return _key2Set;
}
}
class FScanner {
private InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
FScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
} else {
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte())
return buffer[ptr++];
else
return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
private void skipUnprintable() {
while (hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++;
}
public boolean hasNext() {
skipUnprintable();
return hasNextByte();
}
public String next() {
if (!hasNext())
throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public int nextInt() {
if (!hasNext())
throw new NoSuchElementException();
int n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public long nextLong() {
if (!hasNext())
throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while (b != -1 && isPrintableChar(b)) {
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
} else {
throw new NumberFormatException();
}
b = readByte();
}
return minus ? -n : n;
}
public double nextDouble() {
return Double.parseDouble(next());
}
public java.math.BigDecimal nextDecimal() {
return new java.math.BigDecimal(next());
}
public java.util.stream.IntStream nextIntStream(int n) {
return java.util.stream.IntStream.range(0, n).map(i -> nextInt());
}
public java.util.stream.LongStream nextLongStream(int n) {
return java.util.stream.LongStream.range(0L, (long) n).map(i -> nextLong());
}
public java.util.stream.Stream<String> nextStream(int n) {
return java.util.stream.IntStream.range(0, n).mapToObj(i -> next());
}
public int[] nextIntArray(int arraySize) {
int[] ary = new int[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextInt();
}
return ary;
}
public long[] nextLongArray(int arraySize) {
long[] ary = new long[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextLong();
}
return ary;
}
public java.util.stream.Stream<int[]> nextIntArrayStream(int n, int arraySize) {
return java.util.stream.IntStream.range(0, n).mapToObj(_i -> {
int[] ary = new int[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextInt();
}
return ary;
});
}
public java.util.stream.Stream<long[]> nextLongArrayStream(int n, int arraySize) {
return java.util.stream.IntStream.range(0, n).mapToObj(_i -> {
long[] ary = new long[arraySize];
for (int i = 0; i < arraySize; i++) {
ary[i] = nextLong();
}
return ary;
});
}
public boolean close() {
return true;
}
}
class FWriter {
OutputStream out;
byte[] buf = new byte[1 << 16];
byte[] ibuf = new byte[20];
int tail = 0;
final byte SP = (byte) ' ', LF = (byte) '\n', HYPHEN = (byte) '-';
boolean isDebug = false;
FWriter(OutputStream out) {
this.out = out;
}
void flush() {
try {
out.write(buf, 0, tail);
tail = 0;
} catch (IOException e) {
e.printStackTrace();
}
}
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 println() {
write(LF);
}
FWriter print(char c) {
write((byte) c);
return this;
}
FWriter println(char c) {
print(c);
println();
return this;
}
FWriter print(int n) {
if (n < 0) {
n = -n;
write(HYPHEN);
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
return this;
}
FWriter println(int n) {
print(n);
println();
return this;
}
FWriter print(long n) {
if (n < 0) {
n = -n;
write(HYPHEN);
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n % 10 + '0');
n /= 10;
} while (n > 0);
write(ibuf, i, ibuf.length - i);
return this;
}
FWriter println(long n) {
print(n);
println();
return this;
}
FWriter print(String s) {
if (s != null) {
byte[] b = s.getBytes();
write(b, 0, b.length);
}
return this;
}
FWriter println(String s) {
print(s);
println();
return this;
}
FWriter print(int[] a) {
for (int i = 0; i < a.length; i++) {
if (i > 0)
write(SP);
print(a[i]);
}
return this;
}
FWriter println(int[] a) {
print(a);
println();
return this;
}
FWriter print(long[] a) {
for (int i = 0; i < a.length; i++) {
if (i > 0)
write(SP);
print(a[i]);
}
return this;
}
FWriter println(long[] a) {
print(a);
println();
return this;
}
FWriter print(char[] s, int from, int to) {
for (int i = from; i < to && s[i] != '\0'; i++) {
print(s[i]);
}
return this;
}
FWriter print(char[] s) {
print(s, 0, s.length);
return this;
}
FWriter println(char[] s, int from, int to) {
print(s, from, to);
println();
return this;
}
FWriter println(char[] s) {
println(s, 0, s.length);
return this;
}
FWriter print(double n, int accuracy) {
long longN = (long) n;
print(longN);
n -= (long) n;
write((byte) '.');
for (int j = 0; j < accuracy; j++) {
n *= 10;
int digit = (int) n;
write((byte) (digit + '0'));
n -= digit;
}
return this;
}
FWriter print(double n) {
print(n, 10);
return this;
}
FWriter println(double n) {
print(n);
println();
return this;
}
FWriter println(double n, int accuracy) {
print(n, accuracy);
println();
return this;
}
FWriter print(Object o) {
if (o != null) {
print(o.toString());
}
return this;
}
FWriter println(Object o) {
print(o);
println();
return this;
}
FWriter println(Throwable e) {
println(e.toString());
for (StackTraceElement el : e.getStackTrace()) {
print(" ").println(el.toString());
}
if (e.getCause() != null) {
println(e.getCause());
}
return this;
}
void enableDebug() {
this.isDebug = true;
}
private void _debug(Object o, int indent) {
if(o == null) {
for(var i = 0; i < indent; i++) print(' ');
print("null");
} else if(o.getClass().isArray()) {
for(int i = 0; i < java.lang.reflect.Array.getLength(o); i++) {
println();
_debug(java.lang.reflect.Array.get(o, i), indent + 2);
}
return;
} else if(o instanceof Collection) {
for(var item : (Collection<?>)o) {
println();
_debug(item, indent + 2);
}
} else if(o instanceof Map) {
for(var i = 0; i < indent; i++) print(' ');
println('{');
for(var entry : ((Map<?,?>)o).entrySet()) {
for(var i = 0; i < indent + 2; i++) print(' ');
_debug(entry.getKey(), 0);
_debug(" ", 0);
_debug(entry.getValue(), 0);
println();
}
for(var i = 0; i < indent; i++) print(' ');
println('}');
return;
}
for(var i = 0; i < indent; i++) print(' ');
print(o);
}
FWriter debug(Object... os) {
if(!isDebug) return this;
print("[DEBUG:").print(Thread.currentThread().getStackTrace()[2].getLineNumber()).print("]: ");
for(var o : os) {
_debug(o, 0);
print(' ');
}
print(" :[DEBUG:").print(Thread.currentThread().getStackTrace()[2].getLineNumber()).println("]");
return this;
}
} | ConDefects/ConDefects/Code/abc274_a/Java/36086393 |
condefects-java_data_776 | import java.text.DecimalFormat;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
int a = sn.nextInt();
int b = sn.nextInt();
double shosu = (double)b / a;
double result = (Math.round(shosu * 1000)) / 1000;
DecimalFormat decimalFormat = new DecimalFormat("0.000");
String formattedNumber = decimalFormat.format(result);
sn.close();
System.out.println(formattedNumber);
}
}
import java.text.DecimalFormat;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sn = new Scanner(System.in);
int a = sn.nextInt();
int b = sn.nextInt();
double shosu = (double)b / a;
double result = ((double)Math.round(shosu * 1000)) / 1000;
DecimalFormat decimalFormat = new DecimalFormat("0.000");
String formattedNumber = decimalFormat.format(result);
sn.close();
System.out.println(formattedNumber);
}
} | ConDefects/ConDefects/Code/abc274_a/Java/44170835 |
condefects-java_data_777 | import java.io.*;
import java.util.*;
public class Main {
private static final long INF = Long.MAX_VALUE;
public static void main(String[] args) {
InputReader reader = new InputReader(System.in);
PrintWriter writer = new PrintWriter(System.out, false);
int N = reader.nextInt();
long C = reader.nextLong();
long[] A = new long[N];
for (int i = 0; i < N; i++) {
A[i] = reader.nextLong();
}
long[] B = new long[N];
for (int i = 0; i < N; i++) {
B[i] = reader.nextLong();
}
long[] dp = new long[(1 << N)];
Arrays.fill(dp, INF);
dp[0] = 0;
for (int mask = 0; mask < (1 << N); mask++) {
int bit = Integer.bitCount(mask);
if (dp[mask] == INF) continue;
for (int i = 0; i < N; i++) {
if ((mask & (1 << i)) != 0) continue;
long cost = C;
int newMask = mask;
for (int j = i, k = bit; j < N && k < N; j++, k++) {
if ((mask & (1 << j)) != 0) break;
cost += Math.abs(A[j] - B[k]);
newMask |= (1 << j);
}
dp[newMask] = Math.min(dp[newMask], dp[mask] + cost);
}
}
writer.println(dp[(1 << N) - 1] - C);
writer.close();
System.exit(0);
}
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String nextLine() {
String str = "";
try {
str = reader.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}
import java.io.*;
import java.util.*;
public class Main {
private static final long INF = Long.MAX_VALUE;
public static void main(String[] args) {
InputReader reader = new InputReader(System.in);
PrintWriter writer = new PrintWriter(System.out, false);
int N = reader.nextInt();
long C = reader.nextLong();
long[] A = new long[N];
for (int i = 0; i < N; i++) {
A[i] = reader.nextLong();
}
long[] B = new long[N];
for (int i = 0; i < N; i++) {
B[i] = reader.nextLong();
}
long[] dp = new long[(1 << N)];
Arrays.fill(dp, INF);
dp[0] = 0;
for (int mask = 0; mask < (1 << N); mask++) {
int bit = Integer.bitCount(mask);
if (dp[mask] == INF) continue;
for (int i = 0; i < N; i++) {
if ((mask & (1 << i)) != 0) continue;
long cost = C;
int newMask = mask;
for (int j = i, k = bit; j < N && k < N; j++, k++) {
if ((mask & (1 << j)) != 0) break;
cost += Math.abs(A[j] - B[k]);
newMask |= (1 << j);
dp[newMask] = Math.min(dp[newMask], dp[mask] + cost);
}
}
}
writer.println(dp[(1 << N) - 1] - C);
writer.close();
System.exit(0);
}
static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader(InputStream stream) {
reader = new BufferedReader(new InputStreamReader(stream), 32768);
tokenizer = null;
}
public String next() {
while (tokenizer == null || !tokenizer.hasMoreTokens()) {
try {
tokenizer = new StringTokenizer(reader.readLine());
} catch (IOException e) {
throw new RuntimeException(e);
}
}
return tokenizer.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String nextLine() {
String str = "";
try {
str = reader.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
} | ConDefects/ConDefects/Code/abc328_g/Java/47639422 |
condefects-java_data_778 |
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
long xa = nl(), ya = nl();
long xb = nl(), yb = nl();
long xc = nl(), yc = nl();
if(xb > xc){
xb = -xb;
xc = -xc;
xa = -xa;
}
if(yb > yc){
yb = -yb;
yc = -yc;
ya = -ya;
}
if(yb == yc){
long d = xa; xa = ya; ya = d;
d = xb; xb = yb; yb = d;
d = xc; xc = yc; yc = d;
}
// xb <= xc
// yb < yc
// tr(xa, ya, xb, yb, xc, yc);
if(xb < xc && yb < yc){
long ans = Long.MAX_VALUE;
{
if(ya == yb && xa > xb) {
long d = Math.abs(xa - (xb - 1)) + Math.abs(ya - yb);
d += xc - xb + yc - yb;
d += 2;
d += 2;
ans = Math.min(ans, d);
}else{
long d = Math.abs(xa - (xb - 1)) + Math.abs(ya - yb);
d += xc - xb + yc - yb;
d += 2;
ans = Math.min(ans, d);
}
}
{
if(xa == xb && ya > yb) {
long d = Math.abs(ya - (yb - 1)) + Math.abs(xa - xb);
d += xc - xb + yc - yb;
d += 2;
d += 2;
ans = Math.min(ans, d);
}else{
long d = Math.abs(ya - (yb - 1)) + Math.abs(xa - xb);
d += xc - xb + yc - yb;
d += 2;
ans = Math.min(ans, d);
}
}
out.println(ans);
}else{
if(xa == xb && ya > yb){
out.println(Math.abs(ya-yb)-1+4 + yc-yb);
}else{
out.println(Math.abs(xa-xb) + Math.abs(ya-yb) + yc-yb - 1);
}
}
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static void solve()
{
long xa = nl(), ya = nl();
long xb = nl(), yb = nl();
long xc = nl(), yc = nl();
if(xb > xc){
xb = -xb;
xc = -xc;
xa = -xa;
}
if(yb > yc){
yb = -yb;
yc = -yc;
ya = -ya;
}
if(yb == yc){
long d = xa; xa = ya; ya = d;
d = xb; xb = yb; yb = d;
d = xc; xc = yc; yc = d;
}
// xb <= xc
// yb < yc
// tr(xa, ya, xb, yb, xc, yc);
if(xb < xc && yb < yc){
long ans = Long.MAX_VALUE;
{
if(ya == yb && xa > xb) {
long d = Math.abs(xa - (xb - 1)) + Math.abs(ya - yb);
d += xc - xb + yc - yb;
d += 2;
d += 2;
ans = Math.min(ans, d);
}else{
long d = Math.abs(xa - (xb - 1)) + Math.abs(ya - yb);
d += xc - xb + yc - yb;
d += 2;
ans = Math.min(ans, d);
}
}
{
if(xa == xb && ya > yb) {
long d = Math.abs(ya - (yb - 1)) + Math.abs(xa - xb);
d += xc - xb + yc - yb;
d += 2;
d += 2;
ans = Math.min(ans, d);
}else{
long d = Math.abs(ya - (yb - 1)) + Math.abs(xa - xb);
d += xc - xb + yc - yb;
d += 2;
ans = Math.min(ans, d);
}
}
out.println(ans);
}else{
if(xa == xb && ya > yb){
out.println(Math.abs(ya-yb)-1+4 + yc-yb);
}else{
out.println(Math.abs(xa-xb) + Math.abs(ya-(yb-1)) + yc-yb);
}
}
}
public static void main(String[] args) throws Exception
{
long S = System.currentTimeMillis();
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
}
private static boolean eof()
{
if(lenbuf == -1)return true;
int lptr = ptrbuf;
while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
try {
is.mark(1000);
while(true){
int b = is.read();
if(b == -1){
is.reset();
return true;
}else if(!isSpaceChar(b)){
is.reset();
return false;
}
}
} catch (IOException e) {
return true;
}
}
private static byte[] inbuf = new byte[1024];
static int lenbuf = 0, ptrbuf = 0;
private static int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
// private static boolean isSpaceChar(int c) { return !(c >= 32 && c <= 126); }
private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private static double nd() { return Double.parseDouble(ns()); }
private static char nc() { return (char)skip(); }
private static String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private static char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private static char[][] nm(int n, int m)
{
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private static int[][] nmi(int n, int m)
{
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private static int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private static long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private static int ni()
{
int num = 0, b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
| ConDefects/ConDefects/Code/abc323_f/Java/46311909 |
condefects-java_data_779 | import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.IntStream;
class Solver{
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();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long L = in.lg();
long W = in.lg();
long[] A = in.lg(N);
Object solve(){
long ans = 0;
ans += ceil(A[0],W);
A[0] = Math.max(ans *W,A[0]);
ans += ceil(Math.max(0,L -A[N -1] -W),W);
for (int i = 1;i < N;i++) {
var ceil = ceil(A[i] -A[i -1] -W,W);
ans += ceil;
A[i] = Math.max(A[i],A[i -1] +W *ceil);
}
return ans;
}
long ceil(final long a,final long b){ return (a +b -1) /b; }
}
class Permutation{
int n;
int[] arr;
int[] fac;
Permutation(int n){
this.n = n;
arr = new int[n];
Arrays.setAll(arr,i -> i);
fac = new int[n];
fac[0] = 1;
for (int i = 1;i < n;i++)
fac[i] = i *fac[i -1];
}
boolean increment(){
int l = n -2;
while (0 <= l && arr[l] > arr[l +1])
l--;
if (l < 0)
return false;
int r = n -1;
while (arr[l] > arr[r])
r--;
swap(l,r);
l++;
r = n -1;
while (l < r)
swap(l++,r--);
return true;
}
void swap(int l,int r){
arr[l] ^= arr[r];
arr[r] ^= arr[l];
arr[l] ^= arr[r];
}
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
class Main{
public static void main(String[] args) throws Exception{
long st = System.currentTimeMillis();
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(System.currentTimeMillis() -st);
}
}
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 Math.toIntExact(lg()); }
int[] it(int N){ return IntStream.range(0,N).map(i -> it()).toArray(); }
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return IntStream.range(0,N).map(i -> idx()).toArray(); }
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return IntStream.range(0,N).mapToLong(i -> lg()).toArray(); }
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return IntStream.range(0,N).mapToDouble(i -> dbl()).toArray(); }
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;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(T[] arr,IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (var e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = arr(new Edge[N][],i -> new Edge[c[i]]);
for (var e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
var rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
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();
}
}
private void sp(){ write((byte) ' '); }
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void write(Object obj){
if (obj instanceof Boolean)
write((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
boolean ln = false;
if (0 < l) {
Object a = Array.get(obj,0);
ln = !(a instanceof char[]) && a.getClass().isArray();
}
for (int i = 0;i < l;i++) {
write(Array.get(obj,i));
if (i +1 < l)
if (ln)
ln();
else
sp();
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
write(obj);
ln();
}
}
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.function.*;
import java.util.stream.IntStream;
class Solver{
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();
MyReader in = new MyReader(System.in);
MyWriter out = new MyWriter(System.out);
MyWriter log = new MyWriter(System.err){
@Override
protected void ln(){
super.ln();
flush();
};
};
int N = in.it();
long L = in.lg();
long W = in.lg();
long[] A = in.lg(N);
Object solve(){
long ans = 0;
ans += ceil(A[0],W);
ans += ceil(Math.max(0,L -A[N -1] -W),W);
for (int i = 1;i < N;i++) {
var ceil = ceil(A[i] -A[i -1] -W,W);
ans += ceil;
}
return ans;
}
long ceil(final long a,final long b){ return (a +b -1) /b; }
}
class Permutation{
int n;
int[] arr;
int[] fac;
Permutation(int n){
this.n = n;
arr = new int[n];
Arrays.setAll(arr,i -> i);
fac = new int[n];
fac[0] = 1;
for (int i = 1;i < n;i++)
fac[i] = i *fac[i -1];
}
boolean increment(){
int l = n -2;
while (0 <= l && arr[l] > arr[l +1])
l--;
if (l < 0)
return false;
int r = n -1;
while (arr[l] > arr[r])
r--;
swap(l,r);
l++;
r = n -1;
while (l < r)
swap(l++,r--);
return true;
}
void swap(int l,int r){
arr[l] ^= arr[r];
arr[r] ^= arr[l];
arr[l] ^= arr[r];
}
}
class Edge{
int id;
int u;
int v;
long l;
Edge rev;
Edge(int id,int u,int v){
this.id = id;
this.u = u;
this.v = v;
}
void rev(Edge rev){ rev.l = l; }
}
class Main{
public static void main(String[] args) throws Exception{
long st = System.currentTimeMillis();
Solver solver = new Solver();
Optional.ofNullable(solver.solve()).ifPresent(solver.out::println);
solver.out.flush();
solver.log.println(System.currentTimeMillis() -st);
}
}
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 Math.toIntExact(lg()); }
int[] it(int N){ return IntStream.range(0,N).map(i -> it()).toArray(); }
int[][] it(int H,int W){ return arr(new int[H][],i -> it(W)); }
int idx(){ return it() -1; }
int[] idx(int N){ return IntStream.range(0,N).map(i -> idx()).toArray(); }
int[][] idx(int H,int W){ return arr(new int[H][],i -> idx(W)); }
int[][] qry(int Q){ return arr(new int[Q][],i -> new int[]{idx(), idx(), i}); }
long lg(){
byte i = nextPrintable();
boolean negative = i == 45;
long n = negative ? 0 : i -'0';
while (isPrintable(i = read()))
n = 10 *n +i -'0';
return negative ? -n : n;
}
long[] lg(int N){ return IntStream.range(0,N).mapToLong(i -> lg()).toArray(); }
long[][] lg(int H,int W){ return arr(new long[H][],i -> lg(W)); }
double dbl(){ return Double.parseDouble(str()); }
double[] dbl(int N){ return IntStream.range(0,N).mapToDouble(i -> dbl()).toArray(); }
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;(c = read()) != '\n';)
sb.append((char) c);
return sb.toString();
}
String str(){
StringBuilder sb = new StringBuilder();
sb.append((char) nextPrintable());
for (byte c;isPrintable(c = read());)
sb.append((char) c);
return sb.toString();
}
String[] str(int N){ return arr(new String[N],i -> str()); }
<T> T[] arr(T[] arr,IntFunction<T> f){
Arrays.setAll(arr,f);
return arr;
}
Edge[] e(int N,int M){ return e(N,M,e -> e.l = 1); }
Edge[] e(int N,int M,Consumer<Edge> f){
return arr(new Edge[M],i -> {
Edge e = new Edge(i,idx(),idx());
f.accept(e);
return e;
});
}
Edge[][] g(int N,int M,boolean b){ return g(N,b,e(N,M)); }
Edge[][] g(int N,int M,boolean b,Consumer<Edge> f){ return g(N,b,e(N,M,f)); }
Edge[][] g(int N,boolean b,Edge[] E){
int[] c = new int[N];
for (var e:E) {
c[e.u]++;
if (!b)
c[e.v]++;
}
Edge[][] g = arr(new Edge[N][],i -> new Edge[c[i]]);
for (var e:E) {
g[e.u][--c[e.u]] = e;
if (!b) {
var rev = new Edge(e.id,e.v,e.u);
e.rev(rev);
g[e.v][--c[e.v]] = e.rev = rev;
}
}
return g;
}
}
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();
}
}
private void sp(){ write((byte) ' '); }
protected void ln(){ write((byte) '\n'); }
private void write(byte b){
buf[tail++] = b;
if (tail == buf.length)
flush();
}
private void write(byte[] b,int off,int len){
for (int i = off;i < off +len;i++)
write(b[i]);
}
private void write(long n){
if (n < 0) {
n = -n;
write((byte) '-');
}
int i = ibuf.length;
do {
ibuf[--i] = (byte) (n %10 +'0');
n /= 10;
} while (n > 0);
write(ibuf,i,ibuf.length -i);
}
private void write(Object obj){
if (obj instanceof Boolean)
write((boolean) obj ? Solver.yes : Solver.no);
else if (obj instanceof Character)
write((byte) (char) obj);
else if (obj instanceof Integer)
write((int) obj);
else if (obj instanceof Long)
write((long) obj);
else if (obj instanceof char[])
for (char b:(char[]) obj)
write((byte) b);
else if (obj.getClass().isArray()) {
int l = Array.getLength(obj);
boolean ln = false;
if (0 < l) {
Object a = Array.get(obj,0);
ln = !(a instanceof char[]) && a.getClass().isArray();
}
for (int i = 0;i < l;i++) {
write(Array.get(obj,i));
if (i +1 < l)
if (ln)
ln();
else
sp();
}
} else
for (char b:Objects.toString(obj).toCharArray())
write((byte) b);
}
void println(Object obj){
if (obj == null)
return;
write(obj);
ln();
}
} | ConDefects/ConDefects/Code/arc134_a/Java/40062943 |
condefects-java_data_780 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long l = sc.nextLong();
long w = sc.nextLong();
long a[] = new long[n];
for(int i = 0; i < n; i++) {
a[i] = sc.nextLong();
}
int count = 0;
long prevRight = 0;
for(int i = 0 ; i < n; i++) {
// System.out.println("i = " + i + " right = " + prevRight);
if(a[i] > prevRight) {
// System.out.println("put!");
count += (a[i] - prevRight - 1)/w + 1;
}
prevRight = a[i] + w;
}
if(prevRight < l) {
// System.out.println("put (last) right = "+prevRight);
count += (l - prevRight - 1)/w + 1;
}
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();
long l = sc.nextLong();
long w = sc.nextLong();
long a[] = new long[n];
for(int i = 0; i < n; i++) {
a[i] = sc.nextLong();
}
long count = 0;
long prevRight = 0;
for(int i = 0 ; i < n; i++) {
// System.out.println("i = " + i + " right = " + prevRight);
if(a[i] > prevRight) {
// System.out.println("put!");
count += (a[i] - prevRight - 1)/w + 1;
}
prevRight = a[i] + w;
}
if(prevRight < l) {
// System.out.println("put (last) right = "+prevRight);
count += (l - prevRight - 1)/w + 1;
}
System.out.println(count);
}
} | ConDefects/ConDefects/Code/arc134_a/Java/28986413 |
condefects-java_data_781 | import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long L = sc.nextLong();
long W = sc.nextLong();
long now = 0;
long answer = 0;
while(N-->0){
long next = sc.nextLong();
if(next<=now){
now = next+W;
continue;
}
long sub = next-now;
answer += sub/W;
answer += (sub%W)>0 ? 1 : 0;
now = next+W;
}
answer += (L-now)/W;
answer += (L-now)*((L-now)%W)>0 ? 1 : 0;
System.out.println(answer);
}
}
import java.util.Scanner;
class Main{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long L = sc.nextLong();
long W = sc.nextLong();
long now = 0;
long answer = 0;
while(N-->0){
long next = sc.nextLong();
if(next<=now){
now = next+W;
continue;
}
long sub = next-now;
answer += sub/W;
answer += (sub%W)>0 ? 1 : 0;
now = next+W;
}
answer += (L-now)/W;
answer += (L-now)>0&&((L-now)%W)>0 ? 1 : 0;
System.out.println(answer);
}
} | ConDefects/ConDefects/Code/arc134_a/Java/34475372 |
condefects-java_data_782 | 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;
private final static int MAXN = 100100;
static void solve() {
int N = readInt();
long L = readLong(), W = readLong();
Deque<List<Long>> coord = new LinkedList<>();
coord.add(Arrays.asList(0l,0l));
for (int i=0;i<N;i++) {
long A = readLong();
long B = A+W;
List<Long> last = coord.pollLast();
if (last.get(1) >= A) {
coord.add(Arrays.asList(last.get(0), B));
} else {
coord.add(last);
coord.add(Arrays.asList(A,B));
}
}
coord.add(Arrays.asList(L,L));
int ans=0;
while (coord.size()>1) {
List<Long> curr = coord.pollFirst();
long diff = coord.peekFirst().get(0) - curr.get(1);
ans += (diff+W-1L)/W;
}
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;
private final static int MAXN = 100100;
static void solve() {
int N = readInt();
long L = readLong(), W = readLong();
Deque<List<Long>> coord = new LinkedList<>();
coord.add(Arrays.asList(0l,0l));
for (int i=0;i<N;i++) {
long A = readLong();
long B = A+W;
List<Long> last = coord.pollLast();
if (last.get(1) >= A) {
coord.add(Arrays.asList(last.get(0), B));
} else {
coord.add(last);
coord.add(Arrays.asList(A,B));
}
}
coord.add(Arrays.asList(L,L));
long ans=0;
while (coord.size()>1) {
List<Long> curr = coord.pollFirst();
long diff = coord.peekFirst().get(0) - curr.get(1);
ans += (diff+W-1L)/W;
}
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/arc134_a/Java/31710011 |
condefects-java_data_783 | import java.util.HashSet;
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();
int[] fireworks = new int[M];
for (int i = 0; i < M; i++) {
fireworks[i] = sc.nextInt();
}
HashSet<Integer> set = new HashSet<>();
for (int num : fireworks) {
set.add(num);
}
int[] result = new int[N + 1];
for (int i = 1; i <= N; i++) {
if (set.contains(i))
result[i] = i;
}
int store = N - 1;
for (int i = N - 1; i >= 1; i--) {
if (result[i] == 0) result[i] = store;
else store = result[i];
}
for (int i = 1; i <= N; i++) {
System.out.println(result[i] - i);
}
}
}
import java.util.HashSet;
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();
int[] fireworks = new int[M];
for (int i = 0; i < M; i++) {
fireworks[i] = sc.nextInt();
}
HashSet<Integer> set = new HashSet<>();
for (int num : fireworks) {
set.add(num);
}
int[] result = new int[N + 1];
for (int i = 1; i <= N; i++) {
if (set.contains(i))
result[i] = i;
}
int store = N;
for (int i = N - 1; i >= 1; i--) {
if (result[i] == 0) result[i] = store;
else store = result[i];
}
for (int i = 1; i <= N; i++) {
System.out.println(result[i] - i);
}
}
}
| ConDefects/ConDefects/Code/abc322_c/Java/46113751 |
condefects-java_data_784 | 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();
int[] a = new int[m];
for(int i = 0; i < m; i++) {
a[i] = sc.nextInt();
}
for(int j = 1; j <= n; j++) {
int k = 0;
if ((a[k] - j) < 0) k++;
System.out.println(a[k] - j);
}
}
}
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();
int k = 0;
int[] a = new int[m];
for(int i = 0; i < m; i++) {
a[i] = sc.nextInt();
}
for(int j = 1; j <= n; j++) {
if ((a[k] - j) < 0) k++;
System.out.println(a[k] - j);
}
}
}
| ConDefects/ConDefects/Code/abc322_c/Java/51246603 |
condefects-java_data_785 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] a = new int[m + 1];
for (int i = 0; i < m; i++) {
a[i] = sc.nextInt();
}
for (int i = 1, j = 1; i <= n; i++) {
if (i == a[j]) {
System.out.println(0);
j++;
} else if (i < a[j]) System.out.println(a[j] - i);
}
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[] a = new int[m + 1];
for (int i = 1; i <= m; i++) {
a[i] = sc.nextInt();
}
for (int i = 1, j = 1; i <= n; i++) {
if (i == a[j]) {
System.out.println(0);
j++;
} else if (i < a[j]) System.out.println(a[j] - i);
}
}
}
| ConDefects/ConDefects/Code/abc322_c/Java/48872169 |
condefects-java_data_786 | import java.util.*;
import java.io.*;
class Main {
public static void main(String args[] ) throws Exception {
//Scanner sc = new Scanner(System.in);
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//int n = sc.nextInt();
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] a = new int[n];
Arrays.setAll(a, i->Integer.parseInt(st.nextToken()));
Map<Integer, Integer> freq = new TreeMap<>();
for(int x:a)
freq.put(x, freq.getOrDefault(x, 0) + 1);
long ans = n * (n - 1L) / 2L * (n - 2L) / 3L, copy = 0L;
int l = freq.size();
for(int x:freq.values()) {
copy += x * (x - 1L) / 2L * (l - 1L);
if(x >= 3)
copy += x * (x - 1L) / 2L * (x - 2L) / 3L;
}
// System.out.println(freq + " " + ans + " " + copy + " " + l);
System.out.println(ans - copy);
}
}
import java.util.*;
import java.io.*;
class Main {
public static void main(String args[] ) throws Exception {
//Scanner sc = new Scanner(System.in);
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
//int n = sc.nextInt();
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());
int[] a = new int[n];
Arrays.setAll(a, i->Integer.parseInt(st.nextToken()));
Map<Integer, Integer> freq = new TreeMap<>();
for(int x:a)
freq.put(x, freq.getOrDefault(x, 0) + 1);
long ans = n * (n - 1L) / 2L * (n - 2L) / 3L, copy = 0L;
int l = freq.size();
for(int x:freq.values()) {
copy += x * (x - 1L) / 2L * (n - x);
if(x >= 3)
copy += x * (x - 1L) / 2L * (x - 2L) / 3L;
}
// System.out.println(freq + " " + ans + " " + copy + " " + l);
System.out.println(ans - copy);
}
}
| ConDefects/ConDefects/Code/abc252_d/Java/40916880 |
condefects-java_data_787 | class Main{
public static void main(String[] args){
java.util.Scanner sc = new java.util.Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
for(int i=0;i<N;i++)A[i] = sc.nextInt();
int[] sum = new int[(int)2e5+1];
for(int i=0;i<N;i++)sum[A[i]]++;
for(int i=1;i<sum.length;i++)sum[i] += sum[i-1];
long count = 0;
for(int i=0;i<N;i++) count += sum[A[i]-1]*(N-sum[A[i]]);
System.out.println(count);
}
}
class Main{
public static void main(String[] args){
java.util.Scanner sc = new java.util.Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
for(int i=0;i<N;i++)A[i] = sc.nextInt();
long[] sum = new long[(int)2e5+1];
for(int i=0;i<N;i++)sum[A[i]]++;
for(int i=1;i<sum.length;i++)sum[i] += sum[i-1];
long count = 0;
for(int i=0;i<N;i++) count += sum[A[i]-1]*(N-sum[A[i]]);
System.out.println(count);
}
} | ConDefects/ConDefects/Code/abc252_d/Java/33562974 |
condefects-java_data_788 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
{
FastReader sc = new FastReader();
long h = sc.nextInt();
long w = sc.nextInt();
k = sc.nextInt();
long[] vera = new long[(int)h];
long sv = 0;
long sh = 0;
for(int i=0;i<h;i++)
{
vera[i]=sc.nextLong();
sv+=vera[i];
}
long[] hora = new long[(int)w];
for(int i=0;i<w;i++)
{
hora[i]=sc.nextLong();
sh+=hora[i];
}
if(sv%k!=sh%k)
{
//System.out.println("TEST " + sv + " " + sh);
System.out.println(-1);
return;
}
sv=0;
sh=0;
long[] a = new long[(int)h-1];
long[] b = new long[(int)w-1];
for(int i=0;i<h-1;i++)
{
a[i] = vera[i] + w-1;
a[i]=mod(a[i]);
sv+=a[i];
}
for(int i=0;i<w-1;i++)
{
b[i] = hora[i] + h-1;
b[i]=mod(b[i]);
sh+=b[i];
}
cor = hora[(int)w-1]-sv;
cor=mod(cor);
{
long cor2 = vera[(int)h-1]-sh;
cor2=mod(cor2);
if(cor!=cor2)
{
System.out.println("ERROR! " + sv + " " + sh + "->" + cor + " " + cor2);
}
}
if(debug)
{
System.out.println(Arrays.toString(a));
System.out.println(Arrays.toString(b));
}
//maximize
Arrays.sort(a);
Arrays.sort(b);
long ma = 0;
{
int y=0;
int x=0;
//turn all to 9? except corner.
an = (k-1)*(w-1)*(h-1)+cor;
if(debug)System.out.println("Startan " + an + ", cor " + cor);
//pairoff?
long sum1 = 0;
long sum2 = 0;
long[] a1=b; //bigger array
long[] a2=a;
if(h>=w)
{
a1=a;a2=b;
}
int s1 = a1.length;
int s2 = a2.length;
long remx = 0;
long remy = 0;
for(x=0;x<s1;x++)
{
sum1+=a1[x];
remx += k-1-a1[x];
}
for(y=0;y<s2;y++)
{
sum2+=a2[y];
remy += k-1-a2[y];
}
System.out.println(remx + " " + remy);
y=0;
for(x=0;x<s1;x++)
{
while(a1[x] < k-1)
{
while(y<s2&&a2[y]==k-1)y++;
if(y>=s2)break;
long need = k-1-a1[x];
//if sumy don't have this much... try maximizing cor instead?
//System.out.println(x + " " + y + " need "+ need + ", rem " + remx + " " + remy);
if(need > remy)
{
//System.out.println("Break " + x + " " + y);
long rem = Math.min(remx, remy);
if(rem>=cor)
{
an+=k;
}
x=s1;
y=s2;
break;
}
if(a1[x] <= a2[y])
{ //a2 becomes 9
long d = k-1-a2[y];
//System.out.println("Go 1 with " + d + ", val " + a1[x] + " " + a2[y]);
a1[x]=mod(a1[x]+d);
a2[y]=mod(a2[y]+d);
if(a2[y]!=k-1)System.out.println("ERROR1!");
y++;
an -= d; //loss of 9
an += incor(-d); //corner is decreased
//System.out.println("Pair off " + a1[x] + " " + a2[y] + "->" + d);
remy-=d;
remx-=d;
}
else
{
//a1 becomes 9
long d = k-1-a1[x];
//System.out.println("Go 2 with " + d + ", val " + a1[x] + " " + a2[y]);
a1[x]=mod(a1[x]+d);
a2[y]=mod(a2[y]+d);
if(a1[x]!=k-1)System.out.println("ERROR2!");
an -= d; //loss of 9
an += incor(-d); //corner is decreased
remy-=d;
remx-=d;
}
}
if(y>=s2)
{
//System.out.println("Breaky " + x + " " + y + ", rem " + remy);
break;
}
//make a1[x] to 9 by increasing it and a2[y].
//possibly increase a2[y] to 9, if
}
for(x=0;x<s1;x++)an+=a1[x];
for(y=0;y<s2;y++)an+=a2[y];
/*
long[] remmer=null;
if(x<s1)remmer = a1;
if(y<s2)remmer = a2;
*/
if(debug)
{
System.out.println(Arrays.toString(a1));
System.out.println(Arrays.toString(a2));
}
}
System.out.println(an);
//corner case w,h=1
}
static boolean debug = false;
static long an, cor;
static int k;
static long incor(long inc)
{
long cor2 = mod(cor+inc);
long d = cor2-cor;
cor=cor2;
return d;
}
static long mod(long a)
{
if(a>=k)a%=k;
while(a<0)a+=k;
return a;
}
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.Arrays;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
{
FastReader sc = new FastReader();
long h = sc.nextInt();
long w = sc.nextInt();
k = sc.nextInt();
long[] vera = new long[(int)h];
long sv = 0;
long sh = 0;
for(int i=0;i<h;i++)
{
vera[i]=sc.nextLong();
sv+=vera[i];
}
long[] hora = new long[(int)w];
for(int i=0;i<w;i++)
{
hora[i]=sc.nextLong();
sh+=hora[i];
}
if(sv%k!=sh%k)
{
//System.out.println("TEST " + sv + " " + sh);
System.out.println(-1);
return;
}
sv=0;
sh=0;
long[] a = new long[(int)h-1];
long[] b = new long[(int)w-1];
for(int i=0;i<h-1;i++)
{
a[i] = vera[i] + w-1;
a[i]=mod(a[i]);
sv+=a[i];
}
for(int i=0;i<w-1;i++)
{
b[i] = hora[i] + h-1;
b[i]=mod(b[i]);
sh+=b[i];
}
cor = hora[(int)w-1]-sv;
cor=mod(cor);
{
long cor2 = vera[(int)h-1]-sh;
cor2=mod(cor2);
if(cor!=cor2)
{
System.out.println("ERROR! " + sv + " " + sh + "->" + cor + " " + cor2);
}
}
if(debug)
{
System.out.println(Arrays.toString(a));
System.out.println(Arrays.toString(b));
}
//maximize
Arrays.sort(a);
Arrays.sort(b);
long ma = 0;
{
int y=0;
int x=0;
//turn all to 9? except corner.
an = (k-1)*(w-1)*(h-1)+cor;
if(debug)System.out.println("Startan " + an + ", cor " + cor);
//pairoff?
long sum1 = 0;
long sum2 = 0;
long[] a1=b; //bigger array
long[] a2=a;
if(h>=w)
{
a1=a;a2=b;
}
int s1 = a1.length;
int s2 = a2.length;
long remx = 0;
long remy = 0;
for(x=0;x<s1;x++)
{
sum1+=a1[x];
remx += k-1-a1[x];
}
for(y=0;y<s2;y++)
{
sum2+=a2[y];
remy += k-1-a2[y];
}
//System.out.println(remx + " " + remy);
y=0;
for(x=0;x<s1;x++)
{
while(a1[x] < k-1)
{
while(y<s2&&a2[y]==k-1)y++;
if(y>=s2)break;
long need = k-1-a1[x];
//if sumy don't have this much... try maximizing cor instead?
//System.out.println(x + " " + y + " need "+ need + ", rem " + remx + " " + remy);
if(need > remy)
{
//System.out.println("Break " + x + " " + y);
long rem = Math.min(remx, remy);
if(rem>=cor)
{
an+=k;
}
x=s1;
y=s2;
break;
}
if(a1[x] <= a2[y])
{ //a2 becomes 9
long d = k-1-a2[y];
//System.out.println("Go 1 with " + d + ", val " + a1[x] + " " + a2[y]);
a1[x]=mod(a1[x]+d);
a2[y]=mod(a2[y]+d);
if(a2[y]!=k-1)System.out.println("ERROR1!");
y++;
an -= d; //loss of 9
an += incor(-d); //corner is decreased
//System.out.println("Pair off " + a1[x] + " " + a2[y] + "->" + d);
remy-=d;
remx-=d;
}
else
{
//a1 becomes 9
long d = k-1-a1[x];
//System.out.println("Go 2 with " + d + ", val " + a1[x] + " " + a2[y]);
a1[x]=mod(a1[x]+d);
a2[y]=mod(a2[y]+d);
if(a1[x]!=k-1)System.out.println("ERROR2!");
an -= d; //loss of 9
an += incor(-d); //corner is decreased
remy-=d;
remx-=d;
}
}
if(y>=s2)
{
//System.out.println("Breaky " + x + " " + y + ", rem " + remy);
break;
}
//make a1[x] to 9 by increasing it and a2[y].
//possibly increase a2[y] to 9, if
}
for(x=0;x<s1;x++)an+=a1[x];
for(y=0;y<s2;y++)an+=a2[y];
/*
long[] remmer=null;
if(x<s1)remmer = a1;
if(y<s2)remmer = a2;
*/
if(debug)
{
System.out.println(Arrays.toString(a1));
System.out.println(Arrays.toString(a2));
}
}
System.out.println(an);
//corner case w,h=1
}
static boolean debug = false;
static long an, cor;
static int k;
static long incor(long inc)
{
long cor2 = mod(cor+inc);
long d = cor2-cor;
cor=cor2;
return d;
}
static long mod(long a)
{
if(a>=k)a%=k;
while(a<0)a+=k;
return a;
}
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/arc133_c/Java/33902077 |
condefects-java_data_789 | //package com.example.practice.atcoder.dailyprac;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;
//sc500, C - Row Column Sums
public class Main {
public static void main (String [] args) throws IOException {
// Use BufferedReader rather than RandomAccessFile; it's much faster
final BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
// input file name goes above
StringTokenizer st = new StringTokenizer(input.readLine());
final int n = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken()), k = Integer.parseInt(st.nextToken());
final int[] ns = readArrayInt(n, input);
final int[] ms = readArrayInt(m, input);
out.println(calc(n, m, k, ns, ms));
out.close(); // close the output file
}
private static long calc(final int n, final int m, final int k, final int[] ns, final int[] ms) {
final long rw = ((long)m) * (k-1) % k;
final long cl = ((long)n) * (k-1) % k;
long res = ((long)m) * n * (k-1), cur = 0;
long[] rs = new long[n], cs = new long[m];
Arrays.fill(rs, ((long)m) * (k-1));
Arrays.fill(cs, ((long)n) * (k-1));
for (int i=0,j=0;i<n || j<m;++j,++i){
if (i<n){
long t = rw - ns[i];
if (t<0)t+=k;
rs[i] -= t;
if (res<t){
return -1;
}
res -= t;
cur += t;
}
if (j<m){
long t = cl - ms[j];
if (t<0)t+=k;
cs[j] -= t;
cur -= t;
}
}
if (cur < 0){
if (Math.abs(cur)%k == 0){
long cnt = 0;
for (int i=0;i<n;++i){
cnt += rs[i] / k;
}
if (cnt >= Math.abs(cur)/k){
res += cur;
}else {
return -1;
}
}else {
return -1;
}
}else if (cur > 0){
if (cur%k != 0){
return -1;
}else {
res -= cur;
}
}
return res;
}
private static void printArray(long[] ns, final PrintWriter out){
for (int i=0;i<ns.length;++i){
out.print(ns[i]);
if (i+1<ns.length)out.print(" ");
else out.println();
}
}
private static void printArrayInt(int[] ns, final PrintWriter out){
for (int i=0;i<ns.length;++i){
out.print(ns[i]);
if (i+1<ns.length)out.print(" ");
else out.println();
}
}
private static void printArrayVertical(long[] ns, final PrintWriter out){
for (long a : ns){
out.println(a);
}
}
private static void printArrayVerticalInt(int[] ns, final PrintWriter out){
for (int a : ns){
out.println(a);
}
}
private static void printArray2D(long[][] ns, final int len, final PrintWriter out){
int cnt = 0;
for (long[] kk : ns){
cnt++;
if (cnt > len)break;
for (int i=0;i<kk.length;++i){
out.print(kk[i]);
if (i+1<kk.length)out.print(" ");
else out.println();
}
}
}
private static void printArray2DInt(int[][] ns, final int len, final PrintWriter out){
int cnt = 0;
for (int[] kk : ns){
cnt++;
if (cnt > len)break;
for (int i=0;i<kk.length;++i){
out.print(kk[i]);
if (i+1<kk.length)out.print(" ");
else out.println();
}
}
}
private static long[] readArray(final int n, final BufferedReader input) throws IOException{
long[] ns = new long[n];
StringTokenizer st = new StringTokenizer(input.readLine());
for (int i=0;i<n;++i){
ns[i] = Long.parseLong(st.nextToken());
}
return ns;
}
private static int[] readArrayInt(final int n, final BufferedReader input) throws IOException{
int[] ns = new int[n];
StringTokenizer st = new StringTokenizer(input.readLine());
for (int i=0;i<n;++i){
ns[i] = Integer.parseInt(st.nextToken());
}
return ns;
}
private static long[] readArrayVertical(final int n, final BufferedReader input) throws IOException{
long[] ns = new long[n];
for (int i=0;i<n;++i){
ns[i] = Long.parseLong(input.readLine());
}
return ns;
}
private static int[] readArrayVerticalInt(final int n, final BufferedReader input) throws IOException{
int[] ns = new int[n];
for (int i=0;i<n;++i){
ns[i] = Integer.parseInt(input.readLine());
}
return ns;
}
private static long[][] readArray2D(final int n, final int len, final BufferedReader input) throws IOException{
long[][] ns = new long[len][];
for (int i=0;i<n;++i){
StringTokenizer st = new StringTokenizer(input.readLine());
ArrayList<Long> al = new ArrayList<>();
while (st.hasMoreTokens()){
al.add(Long.parseLong(st.nextToken()));
}
long[] kk = new long[al.size()];
for (int j=0;j<kk.length;++j){
kk[j] = al.get(j);
}
ns[i] = kk;
}
return ns;
}
private static int[][] readArray2DInt(final int n, final int len, final BufferedReader input) throws IOException{
int[][] ns = new int[len][];
for (int i=0;i<n;++i){
StringTokenizer st = new StringTokenizer(input.readLine());
ArrayList<Integer> al = new ArrayList<>();
while (st.hasMoreTokens()){
al.add(Integer.parseInt(st.nextToken()));
}
int[] kk = new int[al.size()];
for (int j=0;j<kk.length;++j){
kk[j] = al.get(j);
}
ns[i] = kk;
}
return ns;
}
private static int GCD(int x, int y){
if (x > y)return GCD(y, x);
if (x==0)return y;
return GCD(y%x, x);
}
}
//package com.example.practice.atcoder.dailyprac;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;
//sc500, C - Row Column Sums
public class Main {
public static void main (String [] args) throws IOException {
// Use BufferedReader rather than RandomAccessFile; it's much faster
final BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
// input file name goes above
StringTokenizer st = new StringTokenizer(input.readLine());
final int n = Integer.parseInt(st.nextToken()), m = Integer.parseInt(st.nextToken()), k = Integer.parseInt(st.nextToken());
final int[] ns = readArrayInt(n, input);
final int[] ms = readArrayInt(m, input);
out.println(calc(n, m, k, ns, ms));
out.close(); // close the output file
}
private static long calc(final int n, final int m, final int k, final int[] ns, final int[] ms) {
final long rw = ((long)m) * (k-1) % k;
final long cl = ((long)n) * (k-1) % k;
long res = ((long)m) * n * (k-1), cur = 0;
long[] rs = new long[n], cs = new long[m];
Arrays.fill(rs, ((long)m) * (k-1));
Arrays.fill(cs, ((long)n) * (k-1));
for (int i=0,j=0;i<n || j<m;++j,++i){
if (i<n){
long t = rw - ns[i];
if (t<0)t+=k;
rs[i] -= t;
if (res<t){
return -1;
}
res -= t;
cur += t;
}
if (j<m){
long t = cl - ms[j];
if (t<0)t+=k;
cs[j] -= t;
cur -= t;
}
}
if (cur < 0){
if (Math.abs(cur)%k == 0){
long cnt = 0;
for (int i=0;i<n;++i){
cnt += rs[i] / k;
}
if (cnt >= Math.abs(cur)/k){
res += cur;
}else {
return -1;
}
}else {
return -1;
}
}else if (cur > 0){
if (cur%k != 0){
return -1;
}
}
return res;
}
private static void printArray(long[] ns, final PrintWriter out){
for (int i=0;i<ns.length;++i){
out.print(ns[i]);
if (i+1<ns.length)out.print(" ");
else out.println();
}
}
private static void printArrayInt(int[] ns, final PrintWriter out){
for (int i=0;i<ns.length;++i){
out.print(ns[i]);
if (i+1<ns.length)out.print(" ");
else out.println();
}
}
private static void printArrayVertical(long[] ns, final PrintWriter out){
for (long a : ns){
out.println(a);
}
}
private static void printArrayVerticalInt(int[] ns, final PrintWriter out){
for (int a : ns){
out.println(a);
}
}
private static void printArray2D(long[][] ns, final int len, final PrintWriter out){
int cnt = 0;
for (long[] kk : ns){
cnt++;
if (cnt > len)break;
for (int i=0;i<kk.length;++i){
out.print(kk[i]);
if (i+1<kk.length)out.print(" ");
else out.println();
}
}
}
private static void printArray2DInt(int[][] ns, final int len, final PrintWriter out){
int cnt = 0;
for (int[] kk : ns){
cnt++;
if (cnt > len)break;
for (int i=0;i<kk.length;++i){
out.print(kk[i]);
if (i+1<kk.length)out.print(" ");
else out.println();
}
}
}
private static long[] readArray(final int n, final BufferedReader input) throws IOException{
long[] ns = new long[n];
StringTokenizer st = new StringTokenizer(input.readLine());
for (int i=0;i<n;++i){
ns[i] = Long.parseLong(st.nextToken());
}
return ns;
}
private static int[] readArrayInt(final int n, final BufferedReader input) throws IOException{
int[] ns = new int[n];
StringTokenizer st = new StringTokenizer(input.readLine());
for (int i=0;i<n;++i){
ns[i] = Integer.parseInt(st.nextToken());
}
return ns;
}
private static long[] readArrayVertical(final int n, final BufferedReader input) throws IOException{
long[] ns = new long[n];
for (int i=0;i<n;++i){
ns[i] = Long.parseLong(input.readLine());
}
return ns;
}
private static int[] readArrayVerticalInt(final int n, final BufferedReader input) throws IOException{
int[] ns = new int[n];
for (int i=0;i<n;++i){
ns[i] = Integer.parseInt(input.readLine());
}
return ns;
}
private static long[][] readArray2D(final int n, final int len, final BufferedReader input) throws IOException{
long[][] ns = new long[len][];
for (int i=0;i<n;++i){
StringTokenizer st = new StringTokenizer(input.readLine());
ArrayList<Long> al = new ArrayList<>();
while (st.hasMoreTokens()){
al.add(Long.parseLong(st.nextToken()));
}
long[] kk = new long[al.size()];
for (int j=0;j<kk.length;++j){
kk[j] = al.get(j);
}
ns[i] = kk;
}
return ns;
}
private static int[][] readArray2DInt(final int n, final int len, final BufferedReader input) throws IOException{
int[][] ns = new int[len][];
for (int i=0;i<n;++i){
StringTokenizer st = new StringTokenizer(input.readLine());
ArrayList<Integer> al = new ArrayList<>();
while (st.hasMoreTokens()){
al.add(Integer.parseInt(st.nextToken()));
}
int[] kk = new int[al.size()];
for (int j=0;j<kk.length;++j){
kk[j] = al.get(j);
}
ns[i] = kk;
}
return ns;
}
private static int GCD(int x, int y){
if (x > y)return GCD(y, x);
if (x==0)return y;
return GCD(y%x, x);
}
} | ConDefects/ConDefects/Code/arc133_c/Java/36751107 |
condefects-java_data_790 | import java.nio.charset.StandardCharsets;
import java.util.Scanner;
public class Main {
static int n, m, k;
static int[] a, b;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in, StandardCharsets.UTF_8);
n = scanner.nextInt();
m = scanner.nextInt();
k = scanner.nextInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt();
}
b = new int[m];
for (int i = 0; i < m; i++) {
b[i] = scanner.nextInt();
}
System.out.println(solve());
}
private static String solve() {
long sa = 0, sb = 0;
for (int v : a) sa += ((k - 1L) * m - v) % k;
for (int v : b) sb += ((k - 1L) * n - v) % k;
long ans = (sa % k != sb % k) ? -1 : n * m * (k - 1L) - Math.max(sa, sb);
return String.valueOf(ans);
}
}
/*
C - Row Column Sums
https://atcoder.jp/contests/arc133/tasks/arc133_c
็ต่ถใฎ่ฏ็ผ 2022-11-24
้ข็ฎๅคงๆ๏ผ
่พๅ
ฅ n m k (โค2e5) ๅ้ฟๅบฆๅๅซไธบ n ๅ m ็ๆฐ็ป a ๅ b๏ผๅ
็ด ่ๅด [0,k-1]ใ
ๆ้ ไธไธช n ่ก m ๅ๏ผๅ
็ด ่ๅดๅจ [0,k-1] ็็ฉ้ต๏ผไฝฟๅพ็ฌฌ i ่ก็ๅ
็ด ๅ % k = a[i]๏ผ็ฌฌ j ๅ็ๅ
็ด ๅ % k = b[j]ใ
ไฝ ๅช้่ฆ่พๅบ่ฟไธช็ฉ้ต็ๅ
็ด ๅ็ๆๅคงๅผใ
ๅฆๆ่ฟไธช็ฉ้ตไธๅญๅจ๏ผ่พๅบ -1ใ
https://atcoder.jp/contests/arc133/submissions/36747125
ไธๅฆจๆ็ฉ้ต็ๆฏไธชๆฐ้ฝ็ฝฎไธบ k-1๏ผ็ถๅๆ
ขๆ
ขๅๅฐใ
ๅฏนไบ็ฌฌ i ่กๆฅ่ฏด๏ผ่ฟไธ่ก็ๅ
็ด ๆปๅ
ฑ้่ฆๅๅฐ ((k-1)*m-a[i])%k๏ผ็ดฏๅ ๆๆ่ก็ๅๅฐ้๏ผๅพๅฐ saใ
ๅฏนไบ็ฌฌ j ๅๆฅ่ฏด๏ผ่ฟไธๅ็ๅ
็ด ๆปๅ
ฑ้่ฆๅๅฐ ((k-1)*n-b[j])%k๏ผ็ดฏๅ ๆๆๅ็ๅๅฐ้๏ผๅพๅฐ sbใ
ๅฆๆ sa%k != sb%k๏ผๅๆ ่งฃใ
ๅฆๅ sa-sb ๆฏ k ็ๅๆฐ๏ผไธๅฆจ่ฎพ sa > sb๏ผ้ฃไนๅฏไปฅๆ็ฌฌไธๅ็ๅๅฐ้ += sa-sb๏ผไฝฟๅพ่กๅๅๅฐ้ไนๅ็ธๅใ
็ถๅๅฐฑๅฏไปฅไธๆญ้ๆฉ่กๅ็ๅๅฐ้ๅไธบๆญฃๆฐ็๏ผๆ่ฟไธชๅ
็ด ๅไธใ
่ฟๆ ทๆๅไผๆไฝ max(sa,sb) ๆฌกใ
ๆไปฅ็ญๆกๆฏ n*m*(k-1) - max(sa,sb)ใ
======
Input 1
2 4 3
0 2
1 2 2 0
Output 1
11
Input 2
3 3 4
0 1 2
1 2 3
Output 2
-1
*/
import java.nio.charset.StandardCharsets;
import java.util.Scanner;
public class Main {
static int n, m, k;
static int[] a, b;
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in, StandardCharsets.UTF_8);
n = scanner.nextInt();
m = scanner.nextInt();
k = scanner.nextInt();
a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = scanner.nextInt();
}
b = new int[m];
for (int i = 0; i < m; i++) {
b[i] = scanner.nextInt();
}
System.out.println(solve());
}
private static String solve() {
long sa = 0, sb = 0;
for (int v : a) sa += ((k - 1L) * m - v) % k;
for (int v : b) sb += ((k - 1L) * n - v) % k;
long ans = (sa % k != sb % k) ? -1 : (long) n * m * (k - 1) - Math.max(sa, sb);
return String.valueOf(ans);
}
}
/*
C - Row Column Sums
https://atcoder.jp/contests/arc133/tasks/arc133_c
็ต่ถใฎ่ฏ็ผ 2022-11-24
้ข็ฎๅคงๆ๏ผ
่พๅ
ฅ n m k (โค2e5) ๅ้ฟๅบฆๅๅซไธบ n ๅ m ็ๆฐ็ป a ๅ b๏ผๅ
็ด ่ๅด [0,k-1]ใ
ๆ้ ไธไธช n ่ก m ๅ๏ผๅ
็ด ่ๅดๅจ [0,k-1] ็็ฉ้ต๏ผไฝฟๅพ็ฌฌ i ่ก็ๅ
็ด ๅ % k = a[i]๏ผ็ฌฌ j ๅ็ๅ
็ด ๅ % k = b[j]ใ
ไฝ ๅช้่ฆ่พๅบ่ฟไธช็ฉ้ต็ๅ
็ด ๅ็ๆๅคงๅผใ
ๅฆๆ่ฟไธช็ฉ้ตไธๅญๅจ๏ผ่พๅบ -1ใ
https://atcoder.jp/contests/arc133/submissions/36747125
ไธๅฆจๆ็ฉ้ต็ๆฏไธชๆฐ้ฝ็ฝฎไธบ k-1๏ผ็ถๅๆ
ขๆ
ขๅๅฐใ
ๅฏนไบ็ฌฌ i ่กๆฅ่ฏด๏ผ่ฟไธ่ก็ๅ
็ด ๆปๅ
ฑ้่ฆๅๅฐ ((k-1)*m-a[i])%k๏ผ็ดฏๅ ๆๆ่ก็ๅๅฐ้๏ผๅพๅฐ saใ
ๅฏนไบ็ฌฌ j ๅๆฅ่ฏด๏ผ่ฟไธๅ็ๅ
็ด ๆปๅ
ฑ้่ฆๅๅฐ ((k-1)*n-b[j])%k๏ผ็ดฏๅ ๆๆๅ็ๅๅฐ้๏ผๅพๅฐ sbใ
ๅฆๆ sa%k != sb%k๏ผๅๆ ่งฃใ
ๅฆๅ sa-sb ๆฏ k ็ๅๆฐ๏ผไธๅฆจ่ฎพ sa > sb๏ผ้ฃไนๅฏไปฅๆ็ฌฌไธๅ็ๅๅฐ้ += sa-sb๏ผไฝฟๅพ่กๅๅๅฐ้ไนๅ็ธๅใ
็ถๅๅฐฑๅฏไปฅไธๆญ้ๆฉ่กๅ็ๅๅฐ้ๅไธบๆญฃๆฐ็๏ผๆ่ฟไธชๅ
็ด ๅไธใ
่ฟๆ ทๆๅไผๆไฝ max(sa,sb) ๆฌกใ
ๆไปฅ็ญๆกๆฏ n*m*(k-1) - max(sa,sb)ใ
======
Input 1
2 4 3
0 2
1 2 2 0
Output 1
11
Input 2
3 3 4
0 1 2
1 2 3
Output 2
-1
*/ | ConDefects/ConDefects/Code/arc133_c/Java/45223043 |
condefects-java_data_791 | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int H = Integer.parseInt(st.nextToken());
int W = Integer.parseInt(st.nextToken());
int K = Integer.parseInt(st.nextToken());
int[] A = new int[H], B = new int[W];
long a = 0, b = 0;
st = new StringTokenizer(br.readLine());
for (int i = 0; i < H; i++) {
A[i] = Integer.parseInt(st.nextToken());
a += A[i];
}
st = new StringTokenizer(br.readLine());
for (int i = 0; i < W; i++) {
B[i] = Integer.parseInt(st.nextToken());
b += B[i];
}
if ((a-b) % K != 0) {
System.out.println(-1);
return;
}
long ans = (long) H * W * (K-1);
long C = 0;
int mod = (int) ((long) (K-1) * W % K);
for (int i = 0; i < H; i++) {
C += (K + mod - A[i]) % K;
}
long D = 0;
mod = (int) ((long) (K-1) * W % K);
for (int i = 0; i < W; i++) {
D += (K + mod - B[i]) % K;
}
ans -= Math.max(C, D);
System.out.println(ans);
}
}
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int H = Integer.parseInt(st.nextToken());
int W = Integer.parseInt(st.nextToken());
int K = Integer.parseInt(st.nextToken());
int[] A = new int[H], B = new int[W];
long a = 0, b = 0;
st = new StringTokenizer(br.readLine());
for (int i = 0; i < H; i++) {
A[i] = Integer.parseInt(st.nextToken());
a += A[i];
}
st = new StringTokenizer(br.readLine());
for (int i = 0; i < W; i++) {
B[i] = Integer.parseInt(st.nextToken());
b += B[i];
}
if ((a-b) % K != 0) {
System.out.println(-1);
return;
}
long ans = (long) H * W * (K-1);
long C = 0;
int mod = (int) ((long) (K-1) * W % K);
for (int i = 0; i < H; i++) {
C += (K + mod - A[i]) % K;
}
long D = 0;
mod = (int) ((long) (K-1) * H % K);
for (int i = 0; i < W; i++) {
D += (K + mod - B[i]) % K;
}
ans -= Math.max(C, D);
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/arc133_c/Java/35592940 |
condefects-java_data_792 | import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();//ๅฐๆฐ
int q = sc.nextInt();//ใฏใจใชๆฐ
List<Long> r = new ArrayList<>();
for (int i = 1; i <= n; i++) {
r.add(sc.nextLong());
}
Collections.sort(r);
List<Long> sumR = new ArrayList<>();//i+1ๅฐๅผใใฎใซๅฟ
่ฆใชใใใซใคๆฐ
long sum = 0;
for (int i = 0; i < n; i++) {
sum += r.get(i);
sumR.add(sum);
}
for (int i = 0; i < q; i++) {
long x = sc.nextLong();
System.out.println(ans(x, sumR));
}
sc.close();
}
public static long ans(long x, List<Long> sumR) {
int s = 0;
int g = sumR.size() - 1;
int h = g / 2;
boolean b = true;
while (s < g) {
h = (s + g) / 2;
if (x == sumR.get(h)) {
return h + 1;
} else if (x > sumR.get(h)) {
s = h + 1;
b = true;
} else {
g = h;
b = false;
}
}
if (b && x > sumR.get(s)) {
return s + 1;
} else {
return s;
}
}
}
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();//ๅฐๆฐ
int q = sc.nextInt();//ใฏใจใชๆฐ
List<Long> r = new ArrayList<>();
for (int i = 1; i <= n; i++) {
r.add(sc.nextLong());
}
Collections.sort(r);
List<Long> sumR = new ArrayList<>();//i+1ๅฐๅผใใฎใซๅฟ
่ฆใชใใใซใคๆฐ
long sum = 0;
for (int i = 0; i < n; i++) {
sum += r.get(i);
sumR.add(sum);
}
for (int i = 0; i < q; i++) {
long x = sc.nextLong();
System.out.println(ans(x, sumR));
}
sc.close();
}
public static long ans(long x, List<Long> sumR) {
int s = 0;
int g = sumR.size() - 1;
int h = g / 2;
boolean b = true;
while (s < g) {
h = (s + g) / 2;
if (x == sumR.get(h)) {
return h + 1;
} else if (x > sumR.get(h)) {
s = h + 1;
b = true;
} else {
g = h;
b = false;
}
}
if (b && x >= sumR.get(s)) {
return s + 1;
} else {
return s;
}
}
} | ConDefects/ConDefects/Code/abc334_d/Java/54259946 |
condefects-java_data_793 | import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({ "unused" })
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final int N = IO.getNextInt();
final String S = IO.getNext();
final int[] digitCountOrg = new int[10];
S.chars().map(i -> i - '0').forEach(i -> digitCountOrg[i]++);
int result = 0;
for(long num = 1; String.valueOf(num * num).length() <= N; num++) {
final int[] digitCount = Arrays.copyOf(digitCountOrg, 10);
final String genSquare = String.valueOf(num * num);
genSquare.chars().map(i -> i - '0').forEach(i -> digitCount[i]--);
if(digitCount[0] >= 0 && Arrays.stream(digitCount).skip(1).allMatch(i -> i == 0)) result++;
}
IO.println(result);
IO.flush();
}
private static final class IO {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new
// FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for (int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for (int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for (int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for (int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void printf(String format, Object... args) {
print(String.format(format, args));
}
private static void flush() {
writer.flush();
}
}
}
import java.util.*;
import java.io.*;
import java.util.function.*;
import java.util.stream.*;
@SuppressWarnings({ "unused" })
public final class Main {
// @SuppressWarnings({"unchecked"})
public static final void main(String[] args) {
final int N = IO.getNextInt();
final String S = IO.getNext();
final int[] digitCountOrg = new int[10];
S.chars().map(i -> i - '0').forEach(i -> digitCountOrg[i]++);
int result = 0;
for(long num = 0; String.valueOf(num * num).length() <= N; num++) {
final int[] digitCount = Arrays.copyOf(digitCountOrg, 10);
final String genSquare = String.valueOf(num * num);
genSquare.chars().map(i -> i - '0').forEach(i -> digitCount[i]--);
if(digitCount[0] >= 0 && Arrays.stream(digitCount).skip(1).allMatch(i -> i == 0)) result++;
}
IO.println(result);
IO.flush();
}
private static final class IO {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static String[] readBuffer = new String[] {};
private static int readBufferCursor = 0;
private static PrintWriter writer = new PrintWriter(System.out);
// private static BufferedReader reader;
// static {
// try {
// reader = new BufferedReader(new InputStreamReader(new
// FileInputStream("test.txt")));
// } catch (FileNotFoundException e) {
// e.printStackTrace();
// }
// }
private static String getNextLine() {
try {
return reader.readLine();
} catch (IOException e) {
e.printStackTrace();
return null;
}
}
private static String getNext() {
// return scanner.next();
if (readBuffer.length == readBufferCursor) {
readBuffer = getNextLine().trim().split("\\s");
readBufferCursor = 0;
}
return readBuffer[readBufferCursor++];
}
private static int[] getCharIntArray() {
return getCharIntArray(v -> v);
}
private static int[] getCharIntArray(IntUnaryOperator mapper) {
return getNext().chars().map(mapper).toArray();
}
private static char[][] get2dCharArray(int rows) {
return Stream.generate(() -> getNext().toCharArray()).limit(rows).toArray(char[][]::new);
}
private static char[][] get2dCharArrayWithBorder(int rows, int cols, char borderChar) {
Stream.Builder<char[]> sb = Stream.builder();
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
for (int idx = 0; idx < rows; idx++) {
sb.add((Character.toString(borderChar) + getNext() + Character.toString(borderChar)).toCharArray());
}
sb.add(Character.toString(borderChar).repeat(cols + 2).toCharArray());
return sb.build().toArray(char[][]::new);
}
private static int[][] get2dCharIntArray(int rows) {
return get2dCharIntArray(rows, v -> v);
}
private static int[][] get2dCharIntArray(int rows, IntUnaryOperator mapper) {
return Stream.generate(() -> getNext().chars().map(mapper).toArray()).limit(rows).toArray(int[][]::new);
}
private static int getNextInt() {
return Integer.parseInt(getNext());
}
private static long getNextLong() {
return Long.parseLong(getNext());
}
private static double getNextDouble() {
return Double.parseDouble(getNext());
}
private static int[] getIntArray(int length) {
return getIntArray(length, v -> v);
}
private static int[] getIntArray(int length, IntUnaryOperator mapper) {
return IntStream.generate(() -> getNextInt()).limit(length).map(mapper).toArray();
}
private static int[][] getIntArrayWithSeq(int length) {
return getIntArrayWithSeq(length, v -> v);
}
private static int[][] getIntArrayWithSeq(int length, IntUnaryOperator mapper) {
int[][] array = new int[length][2];
for (int counter = 0; counter < length; counter++) {
array[counter][0] = counter;
array[counter][1] = mapper.applyAsInt(getNextInt());
}
return array;
}
private static int getBitLineInt() {
final int[] line = getCharIntArray(c -> c - '0');
int result = 0;
for (int pos = 0; pos < line.length; pos++) {
result <<= 1;
result |= line[pos];
}
return result;
}
private static int[] getBitLineIntAry(int length) {
final int[] bitAry = new int[length];
for (int idx = 0; idx < length; idx++) {
bitAry[idx] = getBitLineInt();
}
return bitAry;
}
private static List<Integer> getIntList(int length) {
return getIntList(length, v -> v);
}
private static List<Integer> getIntList(int length, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getNextInt()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[] getLongArray(int length) {
return getLongArray(length, v -> v);
}
private static long[] getLongArray(int length, LongUnaryOperator mapper) {
return LongStream.generate(() -> getNextLong()).limit(length).map(mapper).toArray();
}
private static List<Long> getLongList(int length) {
return getLongList(length, v -> v);
}
private static List<Long> getLongList(int length, Function<Long, Long> mapper) {
return Stream.generate(() -> getNextLong()).limit(length).map(mapper)
.collect(Collectors.toCollection(ArrayList::new));
}
private static double[] getDoubleArray(int length) {
return DoubleStream.generate(() -> getNextDouble()).limit(length).toArray();
}
private static int[][] get2dIntArray(int rows, int cols) {
return get2dIntArray(rows, cols, v -> v);
}
private static int[][] get2dIntArray(int rows, int cols, IntUnaryOperator mapper) {
return Stream.generate(() -> getIntArray(cols, mapper)).limit(rows).toArray(int[][]::new);
}
private static List<List<Integer>> get2dIntList(int rows, int cols) {
return get2dIntList(rows, cols, v -> v);
}
private static List<List<Integer>> get2dIntList(int rows, int cols, Function<Integer, Integer> mapper) {
return Stream.generate(() -> getIntList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private static long[][] get2dLongArray(int rows, int cols) {
return get2dLongArray(rows, cols, v -> v);
}
private static long[][] get2dLongArray(int rows, int cols, LongUnaryOperator mapper) {
return Stream.generate(() -> getLongArray(cols, mapper)).limit(rows).toArray(long[][]::new);
}
private static List<List<Long>> get2dLongList(int rows, int cols) {
return get2dLongList(rows, cols, v -> v);
}
private static List<List<Long>> get2dLongList(int rows, int cols, Function<Long, Long> mapper) {
return Stream.generate(() -> getLongList(cols, mapper)).limit(rows)
.collect(Collectors.toCollection(ArrayList::new));
}
private static void print(int... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(long... ary) {
for (int idx = 0; idx < ary.length; idx++) {
print(ary[idx] + (idx < ary.length - 1 ? " " : ""));
}
}
private static void print(char[] ary) {
print(String.valueOf(ary));
}
private static void print(Collection<?> list) {
for (Iterator<?> itr = list.iterator(); itr.hasNext();) {
print(itr.next() + (itr.hasNext() ? " " : ""));
}
}
private static void print(Object obj) {
writer.print(obj);
}
private static void println(int... ary) {
print(ary);
println();
}
private static void println(long... ary) {
print(ary);
println();
}
private static void println(char[] ary) {
print(ary);
println();
}
private static void println(char[][] cmap) {
Arrays.stream(cmap).forEach(line -> println(line));
}
private static void println(Collection<?> list) {
print(list);
println();
}
private static void println(Object obj) {
print(obj);
println();
}
private static void println() {
writer.println();
}
private static void printf(String format, Object... args) {
print(String.format(format, args));
}
private static void flush() {
writer.flush();
}
}
}
| ConDefects/ConDefects/Code/abc324_d/Java/53046124 |
condefects-java_data_794 | 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 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 = sc.next().toCharArray();
int[] cnt = new int[10];
for (int i = 0; i < cs.length; i++) {
cnt[Character.getNumericValue(cs[i])]++;
}
int[] cnt2 = new int[10];
int ans = 0;
for (long i = 1; i <= 5000000; i++) {
long m = i * i;
if (m >= 10000000000000l) break;
Arrays.fill(cnt2, 0);
int k = 0;
while (m > 0) {
cnt2[(int) (m % 10)]++;
m /= 10;
k++;
}
if (k > n) break;
cnt2[0] += n - k;
boolean ok = true;
for (int j = 0; j < 10; j++) {
ok &= (cnt2[j] == cnt[j]);
}
if (ok) ans++;
}
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 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 = sc.next().toCharArray();
int[] cnt = new int[10];
for (int i = 0; i < cs.length; i++) {
cnt[Character.getNumericValue(cs[i])]++;
}
int[] cnt2 = new int[10];
int ans = 0;
for (long i = 0; i <= 5000000; i++) {
long m = i * i;
if (m >= 10000000000000l) break;
Arrays.fill(cnt2, 0);
int k = 0;
while (m > 0) {
cnt2[(int) (m % 10)]++;
m /= 10;
k++;
}
if (k > n) break;
cnt2[0] += n - k;
boolean ok = true;
for (int j = 0; j < 10; j++) {
ok &= (cnt2[j] == cnt[j]);
}
if (ok) ans++;
}
System.out.println(ans);
}
} | ConDefects/ConDefects/Code/abc324_d/Java/51597903 |
condefects-java_data_795 | import com.sun.source.tree.WhileLoopTree;
import javax.management.MBeanConstructorInfo;
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();
char[] s = in.nextCharArray();
long ans = 0;
Arrays.sort(s);
long num = f(s);
int[] cnt = new int[10];
for (char c : s) {
cnt[c-'0']++;
}
long m = 1;
while (m * m <= num){
long temp = m*m;
char[] t = (temp+"").toCharArray();
int[] newcnt = new int[10];
for (char c : t) {
newcnt[c-'0']++;
}
newcnt[0] += s.length - t.length;
if(Arrays.equals(cnt, newcnt)){
ans++;
}
m++;
}
out.println(ans);
}
long f(char[] s){
long a = 1;
long sum = 0;
for (char c : s) {
sum += a * (c-'0');
a *= 10;
}
return sum;
}
long lcm(long a,long b){
return a / gcd(a,b) * b;
}
long gcd(long a,long b){
return b == 0 ? a : gcd(b,a%b);
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class IntPair{
int f;
int s;
IntPair(int f,int s){
this.f = f;
this.s = s;
}
}
class LongPair{
long f;
long s;
LongPair(long f,long s){
this.f = f;
this.s = s;
}
}
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(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 com.sun.source.tree.WhileLoopTree;
import javax.management.MBeanConstructorInfo;
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();
char[] s = in.nextCharArray();
long ans = 0;
Arrays.sort(s);
long num = f(s);
int[] cnt = new int[10];
for (char c : s) {
cnt[c-'0']++;
}
long m = 0;
while (m * m <= num){
long temp = m*m;
char[] t = (temp+"").toCharArray();
int[] newcnt = new int[10];
for (char c : t) {
newcnt[c-'0']++;
}
newcnt[0] += s.length - t.length;
if(Arrays.equals(cnt, newcnt)){
ans++;
}
m++;
}
out.println(ans);
}
long f(char[] s){
long a = 1;
long sum = 0;
for (char c : s) {
sum += a * (c-'0');
a *= 10;
}
return sum;
}
long lcm(long a,long b){
return a / gcd(a,b) * b;
}
long gcd(long a,long b){
return b == 0 ? a : gcd(b,a%b);
}
public static void main(String... args) {
new Main().solve();
out.flush();
}
}
class IntPair{
int f;
int s;
IntPair(int f,int s){
this.f = f;
this.s = s;
}
}
class LongPair{
long f;
long s;
LongPair(long f,long s){
this.f = f;
this.s = s;
}
}
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(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/abc324_d/Java/46645222 |
condefects-java_data_796 | // package atcoder.beginner_300_399.abc_324;
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 char[] w = fs.next().toCharArray();
Arrays.sort(w);
long limit = 0;
for (int i = n - 1; i >= 0; i--) {
limit = limit * 10 + (w[i] - '0');
}
int res = 0;
for (long l = 1; l * l <= limit; l++) {
long u = l * l;
final char[] curr = new char[n];
Arrays.fill(curr, '0');
int idx = 0;
while (u > 0) {
curr[idx++] = (char) ('0' + (u % 10));
u /= 10;
}
Arrays.sort(curr);
if (Arrays.equals(curr, w)) {
res++;
}
}
System.out.println(res);
}
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();
}
}
}
// package atcoder.beginner_300_399.abc_324;
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 char[] w = fs.next().toCharArray();
Arrays.sort(w);
long limit = 0;
for (int i = n - 1; i >= 0; i--) {
limit = limit * 10 + (w[i] - '0');
}
int res = 0;
for (long l = 0; l * l <= limit; l++) {
long u = l * l;
final char[] curr = new char[n];
Arrays.fill(curr, '0');
int idx = 0;
while (u > 0) {
curr[idx++] = (char) ('0' + (u % 10));
u /= 10;
}
Arrays.sort(curr);
if (Arrays.equals(curr, w)) {
res++;
}
}
System.out.println(res);
}
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/abc324_d/Java/46864112 |
condefects-java_data_797 |
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String numStr = sc.next();
int count[] = new int[10];
for(int i = 0; i < numStr.length(); i++) {
int digit = numStr.charAt(i) - '0';
count[digit]++;
}
int tmpCount[] = new int[10];
long result = 0;
loop: for(long i = 1; i <= 4000000; i++){
Arrays.fill(tmpCount, 0);
long sq = i*i;
if(Math.log10(sq) > numStr.length()) {
break;
}
long sqCopy = sq;
while(sqCopy > 0) {
tmpCount[(int)(sqCopy%10)]++;
sqCopy /= 10;
}
for(int j = 1 ; j <= 9; j++) {
if(count[j] != tmpCount[j]) {
continue loop;
}
}
// System.out.println("hit " + sq);
result++;
}
// long factorial[] = new long[14];
// factorial[0] = 1;
// for (int i = 1; i <= 13; i++) {
// factorial[i] = factorial[i - 1] * i;
// }
//
// for(int i = 0; i <= 9; i++) {
// result *= factorial[count[i]];
// }
System.out.println(result);
}
}
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String numStr = sc.next();
int count[] = new int[10];
for(int i = 0; i < numStr.length(); i++) {
int digit = numStr.charAt(i) - '0';
count[digit]++;
}
int tmpCount[] = new int[10];
long result = 0;
loop: for(long i = 0; i <= 4000000; i++){
Arrays.fill(tmpCount, 0);
long sq = i*i;
if(Math.log10(sq) > numStr.length()) {
break;
}
long sqCopy = sq;
while(sqCopy > 0) {
tmpCount[(int)(sqCopy%10)]++;
sqCopy /= 10;
}
for(int j = 1 ; j <= 9; j++) {
if(count[j] != tmpCount[j]) {
continue loop;
}
}
// System.out.println("hit " + sq);
result++;
}
// long factorial[] = new long[14];
// factorial[0] = 1;
// for (int i = 1; i <= 13; i++) {
// factorial[i] = factorial[i - 1] * i;
// }
//
// for(int i = 0; i <= 9; i++) {
// result *= factorial[count[i]];
// }
System.out.println(result);
}
}
| ConDefects/ConDefects/Code/abc324_d/Java/46752634 |
condefects-java_data_798 | import javax.imageio.ImageTranscoder;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class Main {
static class twodarray {
int first;
int second;
// boolean state;
public twodarray() {
}
public twodarray(int first,int second) {
this.first = first;
this.second = second;
// this.state=state;
}
//
// @Override
// public boolean equals(Object other) {
// if (other instanceof twodarray) {
// twodarray casted = (twodarray) other;
// return casted.first == this.first && casted.second == this.second;
// }
// return false;
// }
//
// @Override
// public int hashCode() {
// String unique = this.first + "_" + this.second;
// return unique.hashCode();
// }
}
static long gcd(long a,long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastReader(String filePath) {
FileReader in = null;
try {
in = new FileReader(filePath);
} catch (FileNotFoundException e) {
throw new RuntimeException(e);
}
br = new BufferedReader(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() //considers white spaces also
{
String str = "";
try {
str = br.readLine().trim();//used to eliminate trailing and leading spaces
} catch (Exception e) {
e.printStackTrace();
}
return str;
}
}
static class FastWriter {
private final BufferedWriter bw;
public FastWriter() {
this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
}
public FastWriter(String outputFileName) {
try {
this.bw = new BufferedWriter(new FileWriter(outputFileName));
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public void print(Object object) throws IOException {
bw.append("" + object);
}
public void println(Object object) throws IOException {
print(object);
bw.append("\n");
}
public void close() throws IOException {
bw.close();
}
}
// static FastReader in = new FastReader("C:\\Users\\sifat\\OneDrive\\Desktop\\hackercup\\input.txt");
// static FastWriter out = new FastWriter("C:\\Users\\sifat\\OneDrive\\Desktop\\hackercup\\output.txt");
static FastReader in = new FastReader();
static FastWriter out = new FastWriter();
static int findSet(int v,int[] parent)
{
if(v==parent[v])
return v;
return parent[v]=findSet(parent[v],parent);//log(n) operation
}
static void unionSets(int a,int b,int[] parent)
{
a=findSet(a,parent);
b=findSet(b,parent);
if(a!=b)
{
parent[b]=a;
}
}
public static boolean isPrime(long n) {
if (n <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
public static void primeFactors(long n)//O(sqrt(n))
{
// Print the number of 2s that divide n
if(n%2==0)
{
freq.put(2l,0l);
}
while (n%2==0)
{
// System.out.print(2 + " ");
freq.put(2l,freq.get(2l)+1);
n /= 2;
}
// n must be odd at this point. So we can
// skip one element (Note i = i +2)
for (long i = 3; i <= Math.sqrt(n); i+= 2)
{
// While i divides n, print i and divide n
if(n%i==0)
{
freq.put(i,0l);
}
while (n%i == 0)
{
// System.out.print(i + " ");
freq.put(i,freq.get(i)+1);
n /= i;
}
}
// This condition is to handle the case when
// n is a prime number greater than 2
if (n > 2)
freq.put(n,1l);
}
static HashMap<Long,Long> freq=new HashMap<>();
static boolean[] visited;
static int count=0;
// public static void rec(int sum,HashMap<Integer,ArrayList<Integer>> map,ArrayList<Integer> ls) throws IOException {
// if(sum>10){
// return;
// }
// if(sum==10){
// count++;
// out.println(ls);
//// int pro=1;
//// for(int i:ls){
//// pro*=i;
//// }
//// if(map.containsKey(pro)){
//// return;
//// }
//// map.put(pro,ls);
// }
// for(int i=1;i<=10-sum;i++){
// int sum2=sum+i;
// ArrayList<Integer> ls2=new ArrayList<>(ls);
// ls2.add(i);
// rec(sum2,map,ls2);
// }
// }
public static void main(String[] args) throws IOException {
try {
// int testCases =in.nextInt();
int testCases=1;
int i=1;
// while (i<=testCases) {
// int val=in.nextInt();
//// HashMap<Integer,ArrayList<Integer>> map=new HashMap<>();
//// ArrayList<Integer> ls=new ArrayList<>();
//// int sum=0;
//// out.println(count);
//// rec(sum,map,ls);
//
//// out.println(map);
//// if(map.containsKey(val)){
//// out.println("yes");
//// }
//// else {
//// out.println("No");
//// }
//// out.println(count);
// primeFactors(val);
// out.println(freq);
// ArrayList<Long> ls=new ArrayList<>();
// for(Map.Entry<Long,Long> entry:freq.entrySet()){
// for(int k=0;k<entry.getValue();k++){
// ls.add(entry.getKey());
// }
// }
// long sum=0;
// for(long k:ls){
// sum+=k;
// }
// StringBuilder sb=new StringBuilder();
// sb.append("Case #"+i+": ");
// if(sum!=41){
// sb.append(-1);
// }
// else{
// for(long k:ls){
// sb.append(k+" ");
// }
// }
// out.println(sb);
// i++;
// freq.clear();
// }
solve();
out.close();
} catch (Exception e) {
e.printStackTrace();
out.print(e);
return;
}
}
static void reverse(long a[], int n)
{
int i, k;
long t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
// printing the reversed array
// System.out.println("Reversed array is: \n");
// for (k = 0; k < n; k++) {
// System.out.println(a[k]);
// }
}
static long lcm(long a, long b)
{
return (a / gcd(a, b)) * b;
}
static void solve() throws IOException {
int n=in.nextInt();
String s=in.next();
char[] arr=s.toCharArray();
Arrays.sort(arr);
s=String.valueOf(arr);
s=new StringBuilder(s).reverse().toString();
long toReach=Long.parseLong(s);
long itr=1;
int[] freq=new int[10];
for(int i=0;i<n;i++){
freq[s.charAt(i)-'0']++;
}
int ans=0;
while(itr*itr<=toReach){
long i=(itr*itr);
String str=Long.toString(i);
int[] freq2=new int[10];
for(int j=0;j<str.length();j++){
freq2[str.charAt(j)-'0']++;
}
boolean st=true;
if(freq2[0]>freq[0]){
itr++;
continue;
}
for(int j=1;j<10;j++){
if(freq[j]!=freq2[j]){
st=false;
}
}
if(st){
ans++;
}
itr++;
}
out.println(ans);
}
static int[] fillIntArray(int n) throws IOException{
int[] arr = new int[n];
for (int i = 0; i < n; i++)
arr[i] = in.nextInt();
// for(int i=0;i<n;i++)
// out.print(arr[i]+" ");
return arr;
}
static int[] fillIntArrayOneBased(int n) throws IOException {
int[] arr = new int[n+1];
for (int i = 1; i <= n; i++)
arr[i] = in.nextInt();
// for(int i=0;i<n;i++)
// out.print(arr[i]+" ");
return arr;
}
static long exp(long a, long b) {
if(b==0) return 1;
long ret=exp(a, b/2);
if(b%2==0) return ret*ret;
return ret*ret*a;
}
static void merge(int arr[], int l, int m, int r)
{
int n1 = m - l + 1;
int n2 = r - m;
int L[] = new int[n1];
int R[] = new int[n2];
for (int i = 0; i < n1; ++i)
L[i] = arr[l + i];
for (int j = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];
int i = 0, j = 0;
int k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
static void sort(int arr[], int l, int r)
{
if (l < r) {
int m =l+ (r-l)/2;
sort(arr, l, m);
sort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
}
////hashmap code for getting key with freq of only one
////public int singleNumber(int[] nums) {
//// Map<Integer, Integer> freq = new HashMap<>();
////
//// for (int i : nums) {
//// if (freq.get(i) == null) {
//// freq.put(i, 1);
//// } else {
//// freq.put(i, freq.get(i) + 1);
//// }
//// }
////
//// for (Map.Entry<Integer, Integer> entry : freq.entrySet()) {
//// if (entry.getValue() == 1) {
//// return entry.getKey();
//// }
//// }
////
//// return 0;
////}
//CYCLE IN DFS
//static void dfs(int v,boolean[] visited,int[][] points,HashMap<Integer,Integer> index, Stack<Integer> inProcess) throws IOException {
// // base case, dead end
// if(!index.containsKey(v))
// {
// return;
// }
//
// // loop detected, we are already processing this node
// if(inProcess.contains(v))
// {
// out.println("No");
// state=true;
// return;
// }
// // dfs
// inProcess.push(v);
// visited[v]=true;
// dfs(index.get(v),visited,points,index, inProcess);
// inProcess.pop(); // end of processing children
//}
////building a heap is O(n) by using heapify method bottom to top
//// Note:- In order to take mod of negative number use (i % K + K)%K;
/* package codechef; // don't place package name! */
//import java.util.*;
//import java.lang.*;
//import java.io.*;
//class Codechef
//{
// public static void main (String[] args) throws java.lang.Exception
// {
// Scanner sc=new Scanner(System.in);
// int t=sc.nextInt();
// while(t-->0)
// {
// int n=sc.nextInt();
// int[] arr=new int[n];
// boolean state=false;
// for(int i=0;i<n;i++)
// {
// arr[i]=sc.nextInt();
// }
//
//
// }
//
// }
//
//}
////Techniques:
////divide into cases,brute force,pattern finding
////sorting,greedy,binary search,two pointer,sliding window
////dynamic programming,transform into graph,dfs,bfs,union find
////to create array of arraylist List<Integer>[] g=new List[size] use List interface;
/* package codechef; // don't place package name! */
//linked list contains is O(N)
//when you know the range in which the answer lies try using binary search such that all left elements give the ans and right ones dont
//use linkedhashmap is used for maintaining order of keys in sorted manner
//for dp think of 0 1 knapsack(especially when we need to select k out of n options) and recursive memoization
//in knapsack for i th row you always include the ith object and select the best of the two options (of considering ith object and by not considering ith object by simply choosing i-1,j)
//preorder is nothing but dfs in trees
//
//import java.util.*;
// import java.lang.*;
// import java.io.*;
//
//class Codechef
//{
// public static void main (String[] args) throws java.lang.Exception
// {
// Scanner sc=new Scanner(System.in);
// int t=sc.nextInt();
// while(t-->0)
// {
// int n=sc.nextInt();
// int[] arr=new int[n];
// boolean state=false;
// for(int i=0;i<n;i++)
// {
// arr[i]=sc.nextInt();
// }
// int min=Integer.MAX_VALUE;
// for(int i=1;i<n-1;i++)//we are assuming arr[i] to be median
// {
// int[] temp=new int[n-1-i];
// for(int j=i+1;j<n;j++){
// temp[j-(i+1)]=arr[j];
// }
// Arrays.sort(temp);
// for(int k=0;k<i;k++){
// int tofind= -arr[k];
// int l=i+1;
// int r=n-1;
// while()
// }
//
// }
// System.out.println(min);
//
// }
//
// }
//
//}
import javax.imageio.ImageTranscoder;
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class Main {
static class twodarray {
int first;
int second;
// boolean state;
public twodarray() {
}
public twodarray(int first,int second) {
this.first = first;
this.second = second;
// this.state=state;
}
//
// @Override
// public boolean equals(Object other) {
// if (other instanceof twodarray) {
// twodarray casted = (twodarray) other;
// return casted.first == this.first && casted.second == this.second;
// }
// return false;
// }
//
// @Override
// public int hashCode() {
// String unique = this.first + "_" + this.second;
// return unique.hashCode();
// }
}
static long gcd(long a,long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
public FastReader(String filePath) {
FileReader in = null;
try {
in = new FileReader(filePath);
} catch (FileNotFoundException e) {
throw new RuntimeException(e);
}
br = new BufferedReader(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() //considers white spaces also
{
String str = "";
try {
str = br.readLine().trim();//used to eliminate trailing and leading spaces
} catch (Exception e) {
e.printStackTrace();
}
return str;
}
}
static class FastWriter {
private final BufferedWriter bw;
public FastWriter() {
this.bw = new BufferedWriter(new OutputStreamWriter(System.out));
}
public FastWriter(String outputFileName) {
try {
this.bw = new BufferedWriter(new FileWriter(outputFileName));
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public void print(Object object) throws IOException {
bw.append("" + object);
}
public void println(Object object) throws IOException {
print(object);
bw.append("\n");
}
public void close() throws IOException {
bw.close();
}
}
// static FastReader in = new FastReader("C:\\Users\\sifat\\OneDrive\\Desktop\\hackercup\\input.txt");
// static FastWriter out = new FastWriter("C:\\Users\\sifat\\OneDrive\\Desktop\\hackercup\\output.txt");
static FastReader in = new FastReader();
static FastWriter out = new FastWriter();
static int findSet(int v,int[] parent)
{
if(v==parent[v])
return v;
return parent[v]=findSet(parent[v],parent);//log(n) operation
}
static void unionSets(int a,int b,int[] parent)
{
a=findSet(a,parent);
b=findSet(b,parent);
if(a!=b)
{
parent[b]=a;
}
}
public static boolean isPrime(long n) {
if (n <= 1) {
return false;
}
for (int i = 2; i <= Math.sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
public static void primeFactors(long n)//O(sqrt(n))
{
// Print the number of 2s that divide n
if(n%2==0)
{
freq.put(2l,0l);
}
while (n%2==0)
{
// System.out.print(2 + " ");
freq.put(2l,freq.get(2l)+1);
n /= 2;
}
// n must be odd at this point. So we can
// skip one element (Note i = i +2)
for (long i = 3; i <= Math.sqrt(n); i+= 2)
{
// While i divides n, print i and divide n
if(n%i==0)
{
freq.put(i,0l);
}
while (n%i == 0)
{
// System.out.print(i + " ");
freq.put(i,freq.get(i)+1);
n /= i;
}
}
// This condition is to handle the case when
// n is a prime number greater than 2
if (n > 2)
freq.put(n,1l);
}
static HashMap<Long,Long> freq=new HashMap<>();
static boolean[] visited;
static int count=0;
// public static void rec(int sum,HashMap<Integer,ArrayList<Integer>> map,ArrayList<Integer> ls) throws IOException {
// if(sum>10){
// return;
// }
// if(sum==10){
// count++;
// out.println(ls);
//// int pro=1;
//// for(int i:ls){
//// pro*=i;
//// }
//// if(map.containsKey(pro)){
//// return;
//// }
//// map.put(pro,ls);
// }
// for(int i=1;i<=10-sum;i++){
// int sum2=sum+i;
// ArrayList<Integer> ls2=new ArrayList<>(ls);
// ls2.add(i);
// rec(sum2,map,ls2);
// }
// }
public static void main(String[] args) throws IOException {
try {
// int testCases =in.nextInt();
int testCases=1;
int i=1;
// while (i<=testCases) {
// int val=in.nextInt();
//// HashMap<Integer,ArrayList<Integer>> map=new HashMap<>();
//// ArrayList<Integer> ls=new ArrayList<>();
//// int sum=0;
//// out.println(count);
//// rec(sum,map,ls);
//
//// out.println(map);
//// if(map.containsKey(val)){
//// out.println("yes");
//// }
//// else {
//// out.println("No");
//// }
//// out.println(count);
// primeFactors(val);
// out.println(freq);
// ArrayList<Long> ls=new ArrayList<>();
// for(Map.Entry<Long,Long> entry:freq.entrySet()){
// for(int k=0;k<entry.getValue();k++){
// ls.add(entry.getKey());
// }
// }
// long sum=0;
// for(long k:ls){
// sum+=k;
// }
// StringBuilder sb=new StringBuilder();
// sb.append("Case #"+i+": ");
// if(sum!=41){
// sb.append(-1);
// }
// else{
// for(long k:ls){
// sb.append(k+" ");
// }
// }
// out.println(sb);
// i++;
// freq.clear();
// }
solve();
out.close();
} catch (Exception e) {
e.printStackTrace();
out.print(e);
return;
}
}
static void reverse(long a[], int n)
{
int i, k;
long t;
for (i = 0; i < n / 2; i++) {
t = a[i];
a[i] = a[n - i - 1];
a[n - i - 1] = t;
}
// printing the reversed array
// System.out.println("Reversed array is: \n");
// for (k = 0; k < n; k++) {
// System.out.println(a[k]);
// }
}
static long lcm(long a, long b)
{
return (a / gcd(a, b)) * b;
}
static void solve() throws IOException {
int n=in.nextInt();
String s=in.next();
char[] arr=s.toCharArray();
Arrays.sort(arr);
s=String.valueOf(arr);
s=new StringBuilder(s).reverse().toString();
long toReach=Long.parseLong(s);
long itr=0;
int[] freq=new int[10];
for(int i=0;i<n;i++){
freq[s.charAt(i)-'0']++;
}
int ans=0;
while(itr*itr<=toReach){
long i=(itr*itr);
String str=Long.toString(i);
int[] freq2=new int[10];
for(int j=0;j<str.length();j++){
freq2[str.charAt(j)-'0']++;
}
boolean st=true;
if(freq2[0]>freq[0]){
itr++;
continue;
}
for(int j=1;j<10;j++){
if(freq[j]!=freq2[j]){
st=false;
}
}
if(st){
ans++;
}
itr++;
}
out.println(ans);
}
static int[] fillIntArray(int n) throws IOException{
int[] arr = new int[n];
for (int i = 0; i < n; i++)
arr[i] = in.nextInt();
// for(int i=0;i<n;i++)
// out.print(arr[i]+" ");
return arr;
}
static int[] fillIntArrayOneBased(int n) throws IOException {
int[] arr = new int[n+1];
for (int i = 1; i <= n; i++)
arr[i] = in.nextInt();
// for(int i=0;i<n;i++)
// out.print(arr[i]+" ");
return arr;
}
static long exp(long a, long b) {
if(b==0) return 1;
long ret=exp(a, b/2);
if(b%2==0) return ret*ret;
return ret*ret*a;
}
static void merge(int arr[], int l, int m, int r)
{
int n1 = m - l + 1;
int n2 = r - m;
int L[] = new int[n1];
int R[] = new int[n2];
for (int i = 0; i < n1; ++i)
L[i] = arr[l + i];
for (int j = 0; j < n2; ++j)
R[j] = arr[m + 1 + j];
int i = 0, j = 0;
int k = l;
while (i < n1 && j < n2) {
if (L[i] <= R[j]) {
arr[k] = L[i];
i++;
}
else {
arr[k] = R[j];
j++;
}
k++;
}
while (i < n1) {
arr[k] = L[i];
i++;
k++;
}
while (j < n2) {
arr[k] = R[j];
j++;
k++;
}
}
static void sort(int arr[], int l, int r)
{
if (l < r) {
int m =l+ (r-l)/2;
sort(arr, l, m);
sort(arr, m + 1, r);
merge(arr, l, m, r);
}
}
}
////hashmap code for getting key with freq of only one
////public int singleNumber(int[] nums) {
//// Map<Integer, Integer> freq = new HashMap<>();
////
//// for (int i : nums) {
//// if (freq.get(i) == null) {
//// freq.put(i, 1);
//// } else {
//// freq.put(i, freq.get(i) + 1);
//// }
//// }
////
//// for (Map.Entry<Integer, Integer> entry : freq.entrySet()) {
//// if (entry.getValue() == 1) {
//// return entry.getKey();
//// }
//// }
////
//// return 0;
////}
//CYCLE IN DFS
//static void dfs(int v,boolean[] visited,int[][] points,HashMap<Integer,Integer> index, Stack<Integer> inProcess) throws IOException {
// // base case, dead end
// if(!index.containsKey(v))
// {
// return;
// }
//
// // loop detected, we are already processing this node
// if(inProcess.contains(v))
// {
// out.println("No");
// state=true;
// return;
// }
// // dfs
// inProcess.push(v);
// visited[v]=true;
// dfs(index.get(v),visited,points,index, inProcess);
// inProcess.pop(); // end of processing children
//}
////building a heap is O(n) by using heapify method bottom to top
//// Note:- In order to take mod of negative number use (i % K + K)%K;
/* package codechef; // don't place package name! */
//import java.util.*;
//import java.lang.*;
//import java.io.*;
//class Codechef
//{
// public static void main (String[] args) throws java.lang.Exception
// {
// Scanner sc=new Scanner(System.in);
// int t=sc.nextInt();
// while(t-->0)
// {
// int n=sc.nextInt();
// int[] arr=new int[n];
// boolean state=false;
// for(int i=0;i<n;i++)
// {
// arr[i]=sc.nextInt();
// }
//
//
// }
//
// }
//
//}
////Techniques:
////divide into cases,brute force,pattern finding
////sorting,greedy,binary search,two pointer,sliding window
////dynamic programming,transform into graph,dfs,bfs,union find
////to create array of arraylist List<Integer>[] g=new List[size] use List interface;
/* package codechef; // don't place package name! */
//linked list contains is O(N)
//when you know the range in which the answer lies try using binary search such that all left elements give the ans and right ones dont
//use linkedhashmap is used for maintaining order of keys in sorted manner
//for dp think of 0 1 knapsack(especially when we need to select k out of n options) and recursive memoization
//in knapsack for i th row you always include the ith object and select the best of the two options (of considering ith object and by not considering ith object by simply choosing i-1,j)
//preorder is nothing but dfs in trees
//
//import java.util.*;
// import java.lang.*;
// import java.io.*;
//
//class Codechef
//{
// public static void main (String[] args) throws java.lang.Exception
// {
// Scanner sc=new Scanner(System.in);
// int t=sc.nextInt();
// while(t-->0)
// {
// int n=sc.nextInt();
// int[] arr=new int[n];
// boolean state=false;
// for(int i=0;i<n;i++)
// {
// arr[i]=sc.nextInt();
// }
// int min=Integer.MAX_VALUE;
// for(int i=1;i<n-1;i++)//we are assuming arr[i] to be median
// {
// int[] temp=new int[n-1-i];
// for(int j=i+1;j<n;j++){
// temp[j-(i+1)]=arr[j];
// }
// Arrays.sort(temp);
// for(int k=0;k<i;k++){
// int tofind= -arr[k];
// int l=i+1;
// int r=n-1;
// while()
// }
//
// }
// System.out.println(min);
//
// }
//
// }
//
//}
| ConDefects/ConDefects/Code/abc324_d/Java/46698084 |
condefects-java_data_799 |
import java.io.*;
import java.util.*;
public class Main {
// private static int[][] dirs = {{-1,-1}, {1, 1}, {-1, 1}, {1, -1}};
private static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
private static long inf = (long) 1e13;
private static long div = 998_244_353L;
// private static long div = ((long)1e9) + 7;
public static void main(String[] commands) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] parts = in.readLine().split(" ");
int N = Integer.parseInt(parts[0]);
String str = in.readLine();
char[] reversed = str.toCharArray();
Arrays.sort(reversed);
String max = new StringBuilder(new String(reversed)).reverse().toString();
long maxNum = Long.parseLong(max);
int[] digits = new int[10];
for(int i = 0;i < str.length(); ++i) {
digits[str.charAt(i) - '0']++;
}
int ans = 0;
for(long i = 1;i * i <= maxNum; ++i) {
long next = i * i;
StringBuilder nextStr = new StringBuilder(String.valueOf(next));
while(nextStr.length() < max.length()) {
nextStr.insert(0, "0");
}
var finalNext = nextStr.toString();
int[] currDigits = new int[10];
for(int j = 0;j < finalNext.length(); ++j) {
currDigits[finalNext.charAt(j) - '0']++;
}
boolean ok = true;
for(int k = 0;k < 10; ++k) {
if (currDigits[k] != digits[k]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
System.out.println(ans);
}
}
import java.io.*;
import java.util.*;
public class Main {
// private static int[][] dirs = {{-1,-1}, {1, 1}, {-1, 1}, {1, -1}};
private static int[][] dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
private static long inf = (long) 1e13;
private static long div = 998_244_353L;
// private static long div = ((long)1e9) + 7;
public static void main(String[] commands) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] parts = in.readLine().split(" ");
int N = Integer.parseInt(parts[0]);
String str = in.readLine();
char[] reversed = str.toCharArray();
Arrays.sort(reversed);
String max = new StringBuilder(new String(reversed)).reverse().toString();
long maxNum = Long.parseLong(max);
int[] digits = new int[10];
for(int i = 0;i < str.length(); ++i) {
digits[str.charAt(i) - '0']++;
}
int ans = 0;
for(long i = 0;i * i <= maxNum; ++i) {
long next = i * i;
StringBuilder nextStr = new StringBuilder(String.valueOf(next));
while(nextStr.length() < max.length()) {
nextStr.insert(0, "0");
}
var finalNext = nextStr.toString();
int[] currDigits = new int[10];
for(int j = 0;j < finalNext.length(); ++j) {
currDigits[finalNext.charAt(j) - '0']++;
}
boolean ok = true;
for(int k = 0;k < 10; ++k) {
if (currDigits[k] != digits[k]) {
ok = false;
break;
}
}
if (ok) {
ans++;
}
}
System.out.println(ans);
}
}
| ConDefects/ConDefects/Code/abc324_d/Java/46750549 |
condefects-java_data_800 | 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());
char[] s = sc.next().toCharArray();
int[] cnt = new int[10];
for(int i = 0; i < n; i++) {
cnt[s[i] - '0']++;
}
int ans = 0;
for(long i = 1; i <= 10000000; i++) {
char[] c = String.valueOf(i * i).toCharArray();
int m = c.length;
int[] cnt2 = new int[10];
for(int j = 0; j < m; j++) {
cnt2[c[j] - '0']++;
}
if(n - m > 0) {
for(int j = 0; j < n - m; j++) cnt2[0]++;
}
boolean same = true;
for(int j = 0; j < 10; j++) {
if(cnt[j] != cnt2[j]) same = false;
}
if(same) ans++;
}
System.out.println(ans);
}
}
}
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
try(Scanner sc = new Scanner(System.in);) {
int n = Integer.parseInt(sc.next());
char[] s = sc.next().toCharArray();
int[] cnt = new int[10];
for(int i = 0; i < n; i++) {
cnt[s[i] - '0']++;
}
int ans = 0;
for(long i = 0; i <= 10000000; i++) {
char[] c = String.valueOf(i * i).toCharArray();
int m = c.length;
int[] cnt2 = new int[10];
for(int j = 0; j < m; j++) {
cnt2[c[j] - '0']++;
}
if(n - m > 0) {
for(int j = 0; j < n - m; j++) cnt2[0]++;
}
boolean same = true;
for(int j = 0; j < 10; j++) {
if(cnt[j] != cnt2[j]) same = false;
}
if(same) ans++;
}
System.out.println(ans);
}
}
} | ConDefects/ConDefects/Code/abc324_d/Java/51424199 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.