Submission #372654

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372654	2021-03-01T08:40:00 Z	Dymo	산악 구조대 (JOI13_mountain)	C++14	0 / 100	23 ms	24428 KB

mountain

#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 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++)
       {
          ll h=abs(x-i)+abs(y-j);
          t=max(t,h);
          adj[h].pb(make_pair(i,j));
       }
   }
    ll l=0,h=t;
   while (l<=h)
   {
       ll mid=(l+h)/2;
       auto p=adj[mid].back();
       ll docao=ask(p.ff,p.ss);
       if (docao>=X) 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();
       }
   }


}
/*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

#	Verdict	Execution time	Memory	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	17 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	16 ms	23788 KB	Output is correct
10	Correct	17 ms	23788 KB	Output is correct
11	Correct	17 ms	23788 KB	Output is correct
12	Correct	16 ms	23788 KB	Output is correct
13	Correct	16 ms	23788 KB	Output is correct
14	Correct	16 ms	23808 KB	Output is correct
15	Correct	16 ms	23788 KB	Output is correct
16	Correct	16 ms	23788 KB	Output is correct
17	Correct	16 ms	23788 KB	Output is correct
18	Correct	16 ms	23788 KB	Output is correct
19	Correct	16 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	16 ms	23788 KB	Output is correct
25	Correct	16 ms	23788 KB	Output is correct
26	Correct	16 ms	23788 KB	Output is correct
27	Correct	16 ms	23788 KB	Output is correct
28	Correct	16 ms	23916 KB	Output is correct
29	Correct	16 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	16 ms	23788 KB	Output is correct
34	Correct	17 ms	23916 KB	Output is correct
35	Correct	16 ms	23808 KB	Output is correct
36	Correct	16 ms	23800 KB	Output is correct
37	Correct	16 ms	23788 KB	Output is correct
38	Correct	17 ms	23788 KB	Output is correct
39	Correct	17 ms	23788 KB	Output is correct
40	Correct	16 ms	23788 KB	Output is correct
41	Correct	17 ms	23788 KB	Output is correct
42	Correct	16 ms	23788 KB	Output is correct
43	Correct	16 ms	23788 KB	Output is correct
44	Correct	16 ms	23788 KB	Output is correct
45	Correct	16 ms	23788 KB	Output is correct
46	Incorrect	17 ms	23788 KB	Wrong Answer [5]
47	Halted	0 ms	0 KB	-

Subtask #2

0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	23 ms	24428 KB	Wrong Answer [5]
2	Halted	0 ms	0 KB	-