oj.uz

답안 #372657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372657 2021-03-01T08:45:55 Z two_sides 산악 구조대 (JOI13_mountain) C++17
0 / 100
 7 ms 492 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

void Rescue(int r, int c, int rs, int cs, int x) {
    int lim = max({rs + cs - 2, rs - 1 + c - cs,
    r - rs + cs - 1, r - rs + c - cs});
    auto getRand = [&](int d) {
        if (d < 0) return INT_MAX;
        if (d > lim) return INT_MIN;
        for (int i = 1; i <= r; i++)
            for (int j = 1; j <= c; j++)
                if (abs(i - rs) + abs(j - cs) == d)
                    return Measure(i, j);
    };
    int curd;
    for (int d = 1; d <= lim; d++)
        if (getRand(d - 1) > x && getRand(d + 1) < x) {
            curd = d; break;
        }
    for (int i = 1; i <= r; i++)
        for (int j = 1; j <= c; j++)
            if (abs(i - rs) + abs(j - cs) == curd) {
                if (Measure(i, j) == x) {
                    Pinpoint(i, j); return;
                }
            }
}

Compilation message

mountain.cpp: In lambda function:
mountain.cpp:16:5: warning: control reaches end of non-void function [-Wreturn-type]
   16 |     };
      |     ^
mountain.cpp: In function 'void Rescue(int, int, int, int, int)':
mountain.cpp:24:13: warning: 'curd' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |             if (abs(i - rs) + abs(j - cs) == curd) {
      |             ^~

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 492 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -