oj.uz

답안 #372661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372661 2021-03-01T08:48:40 Z Dymo 산악 구조대 (JOI13_mountain) C++14
0 / 100
 26 ms 24588 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);
}
vector<pll> adj[maxn];
void dosth(ll x,ll y,ll w,ll n,ll m,ll l,ll h)
{
    while (l<=h)
    {
        ll mid=(l+h)/2;
        auto p=adj[mid].back();
        ll docao=ask(p.ff,p.ss);
        if (docao>=w)
            l=mid+1;
        else
            h=mid-1;
    }
    for (auto to:adj[h])
    {
        ll t=ask(to.ff,to.ss);
        if (t==w)
        {
            Pinpoint(to.ff,to.ss);
        }
    }
    h++;
    for (auto to:adj[h])
    {
        ll t=ask(to.ff,to.ss);
        if (t==w)
        {
            Pinpoint(to.ff,to.ss);
        }
    }
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            adj[h].clear();
        }
    }
}
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;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (i<=x&&j<=y)
            {
                ll h=abs(x-i)+abs(y-j);
                t=max(t,h);
                adj[h].pb(make_pair(i,j));
            }
        }
    }
    dosth(x,y,w,n,m,0,t);
    t=0;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (i>=x&&j<=y)
            {
                ll h=abs(x-i)+abs(y-j);
                t=max(t,h);
                adj[h].pb(make_pair(i,j));
            }
        }
    }
    dosth(x,y,w,n,m,0,t);
    t=0;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (i>=x&&j>=y)
            {
                ll h=abs(x-i)+abs(y-j);
                t=max(t,h);
                adj[h].pb(make_pair(i,j));
            }
        }
    }
    dosth(x,y,w,n,m,0,t);
    t=0;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=m; j++)
        {
            if (i<=x&&j>=y)
            {
                ll h=abs(x-i)+abs(y-j);
                t=max(t,h);
                adj[h].pb(make_pair(i,j));
            }
        }
    }
    dosth(x,y,w,n,m,0,t);
    t=0;
}
/*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;
      |               ^~~~

Subtask #1
0 / 20.0

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

Subtask #2
0 / 80.0

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