Submission #117473

#	Time	Username	Problem	Language	Result	Execution time	Memory
117473		tjd229	산악 구조대 (JOI13_mountain)	C++14	100 / 100	19 ms	1016 KiB

mountain

#include "grader.h"
const int dx[4] = { 1,1,-1,-1 };//to close peak
const int dy[4] = {-1,1,-1,1};
void Rescue(int R, int C, int RS, int CS, int X) {
	int sx[4] = {1,1,C,C};
	
	for (int i = 0; i < 4; ++i) {
		int cx = sx[i], cy = RS;
		while (0 < cy && cy <= R&&0<cx && cx<=C) {
			int h = Measure(cy, cx);
			if (h == X) {
				Pinpoint(cy, cx);
				return;
			}
			if (h > X) cy += dy[i];
			else cx += dx[i];
		}
	}

}

• Subtask 1: 20 / 20
• Subtask 2: 80 / 80