Submission #142805

#	Time	Username	Problem	Language	Result	Execution time	Memory
142805		cheetose	산악 구조대 (JOI13_mountain)	C++11	100 / 100	17 ms	640 KiB

mountain

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
//int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

#include "grader.h"
void go(int x1,int y1,int x2,int y2,int dx,int dy,int xx)
{
	int x,y;
	if(dx==1)x=1;
	else x=x2;
	if(dy==1)y=y1;
	else y=y2;
	while(x>=x1 && x<=x2 && y>=y1 && y<=y2)
	{
		int t=Measure(x,y);
		if(t==xx)
		{
			Pinpoint(x,y);
			return;
		}
		if(t>xx)y+=dy;
		if(t<xx)x+=dx;
	}
}
void Rescue(int R, int C, int RS, int CS, int X) {
	go(1,1,RS,CS,1,-1,X);
	go(1,CS,RS,C,1,1,X);
	go(RS,1,R,CS,-1,-1,X);
	go(RS,CS,R,C,-1,1,X);
}

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