oj.uz

답안 #372666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372666 2021-03-01T09:08:31 Z Dymo 산악 구조대 (JOI13_mountain) C++14
0 / 100
 6 ms 512 KB 
#include<bits/stdc++.h>

#include "grader.h"
using namespace std;

#define ll int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const ll maxn =1e6+10;
const ll mod=1e9+7;
const ll base=3e18;

ll a[maxn];
ll ask(ll x,ll y)
{
    return Measure(x,y);
}

void Rescue(ll R,ll C,ll RS,ll CS,ll X)
{
    ll w=X;
    ll x=RS;
    ll y=CS;
    ll n=R;
    ll m=C;
    ll t=0;

    ll l=1, h=y;
    while (l<=h)
    {
        ll mid=(l+h)/2;
        ll t=ask(x,mid);
        if (t>=w)
            h=mid-1;
        else
            l=mid+1;
    }
    if (l>=1&&l<=m)
    {
        for (int i=1; i<=n; i++)
        {
            ll t=ask(i,l);
            if (t==w)
            {
                Pinpoint(i,l);
            }
        }
    }
    l--;
     if (l>=1&&l<=m)
    {
        for (int i=1; i<=n; i++)
        {
            ll t=ask(i,l);
            if (t==w)
            {
                Pinpoint(i,l);
            }
        }
    }

    l=y,h=m;
    while (l<=h)
    {
        ll mid=(l+h)/2;
        ll t=ask(x,mid);
        if (t>=w) l=mid+1;
        else h=mid-1;
    }
    if (h>=1&&h<=m)
    {
       for (int i=1; i<=n; i++)
        {
            ll t=ask(i,h);
            if (t==w)
            {
                Pinpoint(i,h);
            }
        }
    }
    h++;
     if (h>=1&&h<=m)
    {
       for (int i=1; i<=n; i++)
        {
            ll t=ask(i,h);
            if (t==w)
            {
                Pinpoint(i,h);
            }
        }
    }


}
/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp","r"))
    {
        freopen("test.inp","r",stdin);
        freopen("test.out","w",stdout);
    }


}*/

Compilation message

mountain.cpp:14:15: warning: overflow in conversion from 'double' to 'int' changes value from '3.0e+18' to '2147483647' [-Woverflow]
   14 | const ll base=3e18;
      |               ^~~~
mountain.cpp: In function 'void Rescue(int, int, int, int, int)':
mountain.cpp:29:8: warning: unused variable 't' [-Wunused-variable]
   29 |     ll t=0;
      |        ^

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 0 ms 364 KB Output is correct
50 Correct 0 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 0 ms 364 KB Output is correct
53 Correct 0 ms 364 KB Output is correct
54 Correct 0 ms 364 KB Output is correct
55 Correct 0 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 0 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 0 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Incorrect 1 ms 364 KB Wrong Answer [5]
80 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

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