알고리즘/백준
10810 공넣기
ukkkk7
2023. 8. 30. 09:26
728x90
반응형
1. Scanner 입력
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
//바구니의 개수
int N = sc.nextInt();
int[] arr = new int[N];
//공을 넣는 횟수
int M = sc.nextInt();
for(int I=0; I<M; I++){
int i = sc.nextInt();
int j = sc.nextInt();
int k = sc.nextInt();
for(int J = i-1; J<j; J++){
arr[J] = k;
}
}
for(int k=0; k<arr.length; k++) {
System.out.print(arr[k] + " ");
}
}
}
2. BufferedReader로 입력받았을 때
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int[] arr = new int[n];
int m = Integer.parseInt(st.nextToken());
for(int I=0; I<m; I++){
st = new StringTokenizer(br.readLine());
int i = Integer.parseInt(st.nextToken());
int j = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
for(int J = i-1; J<j; J++){
arr[J] = k;
}
}
br.close();
for(int k=0; k<arr.length; k++) {
System.out.print(arr[k] + " ");
}
}
}
확실히 시간 차이가 2배정도 난다.
728x90
반응형