Skip to content

Nayoung #29

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
young924 wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Nayoung #29

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
29e7676
Solve 1920
young924 Oct 2, 2022
688bcc9
Solve 1300, 19637, 12015
young924 Oct 6, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
46 changes: 46 additions & 0 deletions binary_search/12015/nayoung12015.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,46 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

// 풀이 참고 : https://st-lab.tistory.com/285

public class nayoung12015 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

int N = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(br.readLine());

int[] A = new int[N];

for (int i = 0; i < N; i++) {
A[i] = Integer.parseInt(st.nextToken());
}

int[] LIS = new int[N];
LIS[0] = A[0];
int lengthOfLIS = 1;

for (int i = 1; i < N; i++) {
if (LIS[lengthOfLIS - 1] < A[i]) {
LIS[lengthOfLIS] = A[i];
lengthOfLIS++;
} else {
int lo = 0;
int hi = lengthOfLIS;

while (lo < hi) {
int mid = (lo + hi) / 2;

if (LIS[mid] <= A[i]) lo = mid + 1;
else hi = mid;
}

LIS[lo] = A[i];
}
}

System.out.println(lengthOfLIS);
}
}
31 changes: 31 additions & 0 deletions binary_search/1300/nayoung1300.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

// 풀이 참고 : https://st-lab.tistory.com/281

public class nayoung1300 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

int N = Integer.parseInt(br.readLine());
int k = Integer.parseInt(br.readLine());

long low = 1;
long high = k;

while (low < high) {
long mid = (low + high) / 2;
long count = 0;

for (int i = 1; i <= N; i++) {
count += Math.min(mid / i, N);
}

if (k <= count) high = mid;
else low = mid + 1;
}

System.out.println(low);
}
}
49 changes: 49 additions & 0 deletions binary_search/1920/nayoung1920.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class nayoung1920 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;

int N = Integer.parseInt(br.readLine());
int[] A = new int[N];

st = new StringTokenizer(br.readLine());

for (int i = 0; i < N; i++) {
A[i] = Integer.parseInt(st.nextToken());
}

Arrays.sort(A);

int M = Integer.parseInt(br.readLine());
st = new StringTokenizer(br.readLine());

for (int i = 0; i < M; i++) {
int m = Integer.parseInt(st.nextToken());
if (isInArr(A, m)) {
System.out.println(1);
} else {
System.out.println(0);
}
}
}

public static boolean isInArr(int[] A, int m) {
int min = 0, max = A.length - 1;

while (min <= max) {
int mid = (min + max) / 2;

if (A[mid] == m) return true;
else if (A[mid] < m) min = mid + 1;
else max = mid - 1;
}

return false;
}
}
56 changes: 56 additions & 0 deletions binary_search/19637/nayoung19637.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,56 @@
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class nayoung19637 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

StringTokenizer st = new StringTokenizer(br.readLine());

StringBuilder sb = new StringBuilder();

int N = Integer.parseInt(st.nextToken());
int M = Integer.parseInt(st.nextToken());

List<Item> items = new ArrayList<>();

for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
String name = st.nextToken();
int value = Integer.parseInt(st.nextToken());

items.add(new Item(name, value));
}

for (int i = 0; i < M; i++) {
int power = Integer.parseInt(br.readLine());

int low = 0;
int high = N-1;

while (low <= high) {
int mid = (low + high) / 2;

if (power <= items.get(mid).value) high = mid - 1;
else low = mid + 1;
}

sb.append(items.get(high+1).name).append('\n');
}

System.out.println(sb);

}

static class Item {
String name;
int value;

public Item(String name, int value) {
this.name = name;
this.value = value;
}
}
}