Submission #1156796

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156796		modwwe	산악 구조대 (JOI13_mountain)	C++20	0 / 100	3 ms	836 KiB

mountain

//#include "dungeon2.h"
#include "grader.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
    return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e9;
const ll mod2 = 1e9+7;
const ll base=67;
int  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int  i, s10, s12,k1,k2,k3,s11,lim,w,l,r,dem5,dem6,dem7,dem9;
int kk;
int t;
int el = 19;
int cost(int x,int y,int l,int r)
{
    return abs(x-l)+abs(y-r);
}
struct ib
{
    int a,b;
};
void Rescue(int R, int C, int RS, int CS, int X)
{
    vector<ib> v[401];
    n=R;
    m=C;
    l=RS;
    r=CS;
    k=X;
    s2=0;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
        {
            s2=max(cost(l,r,i,j),s2);
            v[cost(l,r,i,j)].pb({i,j});
        }
    l=0;
    r=s2-1;
    s3=s2;
    while(l<=r)
    {
        int mid=l+r>>1;
        s4=Measure(v[mid][0].a,v[mid][0].b);
        if(s4==k)
        {
            s3=mid;
            break;
        }
       // cout<<mid<<" "<<s4,down
        if(s4<=k)r=mid-1,s3=mid;
        else l=mid+1;
    }
    vector<ib> ask;
    if(s3!=0)
    {
        for(auto x:v[s3-1])
            ask.pb(x);
    }
    for(auto x:v[s3])
        ask.pb(x);
    shuffle(ask.begin(),ask.end(),rd);
    for(auto x:ask)
    {
        s4=Measure(x.a,x.b);
        if(s4==k){Pinpoint(x.a,x.b);return;}
    }
}/*
void phongbeo()
{
    cin>>n>>m>>l>>r>>k;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            cin>>a[i][j];
    Rescue(n,m,l,r,k);
}*/

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