[SW Expert Academy] 현주의 상자 바꾸기 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWYygN36Qn8DFAVm&categoryId=AWYygN36Qn8DFAVm&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=7

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int t = sc.nextInt();
		
		for(int tc=1;tc<=t;tc++) {
			int n = sc.nextInt();
			int q = sc.nextInt();
			
			int arr[] = new int[n];
			
			for(int i=1;i<=q;i++) {
				
				int l = sc.nextInt();
				int r = sc.nextInt();
				
				for(int j=l-1;j<=r-1;j++) {
					arr[j]=i;
				}
			}
			
			System.out.print("#"+tc+" ");
			for(int i=0;i<n;i++) {
				System.out.print(arr[i]+" ");
			}
			
			System.out.println();
			
		}
		
		
	}
}

 

인덱스만 잘 설정해주면 어렵지 않은 문제이다.