글 읽기 - N의 범위가 100이하가 맞는지 확인해주실 수 있나요?

shfshfdl 2년 전 1

제가 잘못했을 수도 있는데 MXN의 범위를 105로 잡고 했는데 런타임 에러가 발생하여

해당 값을 200으로 바꾸니 성공을 합니다. 혹시 이부분 확인해주실 수 있나요?

#include <stdio.h>
typedef long long int ll;
#define MXN 200
#define ARRIVE 0
#define TIME 1
ll N;
ll cows[MXN][2] = { 0, };

const ll root = 1;
ll leaf = 0;
ll indexTree[MXN] = { 0, };

void input(ll index) {
	indexTree[++leaf] = index;
	ll curr = leaf;
	while (curr != 1) {
		ll currArrive = cows[indexTree[curr]][ARRIVE];
		ll currTime = cows[indexTree[curr]][TIME];
		ll nextArrive = cows[indexTree[curr / 2]][ARRIVE];
		ll nextTime = cows[indexTree[curr / 2]][TIME];

		if (nextArrive < currArrive) {
			ll temp = indexTree[curr];
			indexTree[curr] = indexTree[curr / 2];
			indexTree[curr / 2] = temp;
		} else if (nextArrive == currArrive) {
			if (nextTime < currTime) {
				ll temp = indexTree[curr];
				indexTree[curr] = indexTree[curr / 2];
				indexTree[curr / 2] = temp;
			}
			else break;
		}
		else break;

		curr /= 2;
	}
}

void hSort() {
	ll curr = root;
	ll rootIndex = indexTree[root];
	indexTree[root] = indexTree[leaf];
	indexTree[leaf] = rootIndex;
	leaf--;

	while (1) {
		ll currArrive = cows[indexTree[curr]][ARRIVE];
		ll currTime = cows[indexTree[curr]][TIME];
		ll nextArrive = cows[indexTree[curr * 2]][ARRIVE];
		ll nextTime = cows[indexTree[curr * 2]][TIME];
		ll nnextArrive = cows[indexTree[curr * 2 + 1]][ARRIVE];
		ll nnextTime = cows[indexTree[curr * 2 + 1]][TIME];

		if (curr * 2 + 1 <= leaf) {
			if (nextArrive > nnextArrive) {
				if (nextArrive > currArrive) {
					ll temp = indexTree[curr];
					indexTree[curr] = indexTree[curr * 2];
					indexTree[curr * 2] = temp;
					curr *= 2; continue;
				}
				else if (nextArrive == currArrive) {
					if (nextTime > currTime) {
						ll temp = indexTree[curr];
						indexTree[curr] = indexTree[curr * 2];
						indexTree[curr * 2] = temp;
						curr *= 2; continue;
					}
					else break;
				}
				else break;
			}
			else if (nextArrive < nnextArrive) {
				if (nnextArrive > currArrive) {
					ll temp = indexTree[curr];
					indexTree[curr] = indexTree[curr * 2 + 1];
					indexTree[curr * 2 + 1] = temp;
					curr *= 2; curr += 1; continue;
				}
				else if (nnextArrive == currArrive) {
					if (nnextTime > currTime) {
						ll temp = indexTree[curr];
						indexTree[curr] = indexTree[curr * 2 + 1];
						indexTree[curr * 2 + 1] = temp;
						curr *= 2; curr += 1; continue;
					}
					else break;
				}
				else break;
			}
			else {
				if (nextTime > nnextTime) {
					ll temp = indexTree[curr];
					indexTree[curr] = indexTree[curr * 2];
					indexTree[curr * 2] = temp;
					curr *= 2; continue;
				} else if (nextTime < nnextTime) {
					ll temp = indexTree[curr];
					indexTree[curr] = indexTree[curr * 2 + 1];
					indexTree[curr * 2 + 1] = temp;
					curr *= 2; curr += 1; continue;
				}
				else break;
			}
		}
		else if (curr * 2 <= leaf) {
			if (nextArrive > currArrive) {
				ll temp = indexTree[curr];
				indexTree[curr] = indexTree[curr * 2];
				indexTree[curr * 2] = temp;
				curr *= 2; continue;
			} else if (nextArrive == currArrive) {
				if (nextTime > currTime) {
					ll temp = indexTree[curr];
					indexTree[curr] = indexTree[curr * 2];
					indexTree[curr * 2] = temp;
					curr *= 2; continue;
				}
				else break;
			}
			else break;
		}
		else break;
	}
}

int main() {
	scanf("%lld", &N);
	for (ll n = 0; n < N; n++) {
		scanf("%lld %lld", &cows[n][ARRIVE], &cows[n][TIME]);
		input(n);
	};
	for (ll n = 0; n < N; n++) {
		hSort();
	}

	ll end = cows[indexTree[1]][ARRIVE] + cows[indexTree[1]][TIME];
	for (ll n = 2; n <= N; n++) {
		if (cows[indexTree[n]][ARRIVE] < end) end += cows[indexTree[n]][TIME];
		else end = cows[indexTree[n]][ARRIVE] + cows[indexTree[n]][TIME];
	}

	printf("%lld\n", end);

	return 0;
}

alex9801 2년 전 1

데이터에는 아무 이상 없습니다.

dotorya 2년 전 1

100 이하로 들어오는 것을 확인했습니다.

혹시 MAXN 이상의 크기를 요구하는 배열이 없으신가요?

shfshfdl 2년 전 0

감사합니다ㅠ 어딘가배열을초과할거 같은데 계속 못찾아서 혹시나 질문드렸습니다 ㅠ

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

N의 범위가 100이하가 맞는지 확인해주실 수 있나요?

shfshfdl 2년 전 1

alex9801 2년 전 1

dotorya 2년 전 1

shfshfdl 2년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회 / 고등학교 대회

출처

대학교 대회

도움말