[SWEA 5789] 현주의 상자 바꾸기

SW Expert Academy :: SWEA :: 5789 :: 현주의 상자 바꾸기

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWYygN36Qn8DFAVm

#include <bits/stdc++.h>

using namespace std;

int i, j, T, N, Q, n1, n2;

int main() {

std::ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

cin >> T;

for (int tc = 1; tc <= T; tc++) {

cin >> N >> Q;

vector<pair<int, int>>q; vector<int>v(N + 1, 0), a(N + 1, 0);

while (Q--) {

cin >> n1 >> n2; q.push_back(make_pair(n1, n2));

}

for (i = q.size() - 1; i >= 0; i--) {

for (j = q[i].first; j <= q[i].second; j++) {

if (v[j]) j = v[j];

else {

a[j] = i + 1; v[j] = q[i].second;

}

}

}

cout << "#" << tc << " ";

for (i = 1;i <= N;i++) cout << a[i] << " ";

cout << '\n';

}

return 0;

}