제출 #1156957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1156957		modwwe	산악 구조대 (JOI13_mountain)	C++20	100 / 100	3 ms	584 KiB

mountain

#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;/*
main()
{
    if(fopen(task2".inp","r"))
    {
        fin(task2);
        fou(task2);
    }
    if(fopen(task".inp","r"))
    {
        fin(task);
        fou(task);
    }
    ios_base::sync_with_stdio(0);
    cout.tie(0);
    cin.tie(0);
    /// cin>>s1;
//int t;cin>>t; while(t--)
    phongbeo();
    checktime
}
int a[201][201];
int cost(int x,int y,int l,int r)
{
    return abs(x-l)+abs(y-r);
}
int Measure(int RM, int CM)
{dem++;
    return a[RM][CM];
}
void Pinpoint(int RP, int CP)
{ debug
    if(a[RP][CP]!=k)assert(0);
    exit(0);
}*/
void Rescue(int R, int C, int RS, int CS, int X)
{
    n=R;
    m=C;
    k=X;
    l=1;
    r=CS;
    while(true)
    {
        if(r==0) break;
        if(l>RS)break;
        int x=Measure(l,r);
        if(x==k)Pinpoint(l,r);
        if(x<k)l++;
        else r--;
    }
    l=1;
    r=CS+1;
    while(true)
    {
        if(r==m+1)break;
        if(l>RS) break;
        int x=Measure(l,r);
        if(x==k)Pinpoint(l,r);
        if(x<k)l++;
        else r++;
    }
    l=n;
    r=CS;
    while(true)
    {
        if(l==RS) break;
        if(r==0)break;
        int x=Measure(l,r);
        if(x==k)Pinpoint(l,r);
        if(x<k)l--;
        else r--;
    }
    l=RS+1;
    r=m;
    while(true)
    {
        if(l==n+1) break;
        if(r==CS) break;
        int x=Measure(l,r);
        if(x==k)Pinpoint(l,r);
        if(x<k)r--;
        else l++;
    }
}/*
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);
    cout<<dem;
}
*/

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