제출 #977423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977423		thegamercoder19	Tracks in the Snow (BOI13_tracks)	C++14	2.19 / 100	365 ms	236268 KiB

tracks

/*
Coded by thegamercoder
Happy Competition and Hacking
*/


#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ll MAX = 401;
const ll MODD = 998244353;
const ll BL = 1;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto i : a)
#define FORAE(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout<<(s?"YES":"NO")<<endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
ll n, m, ans, dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
V<string> g;
V<V<ll>> d;

bool chk(ll x, ll y)
{
    RET x >= 0 && x < n&& y >= 0 && y < m && g[x][y] == '.';
}
void solve()
{
    cin >> n >> m;
    g.resize(n); d.resize(n, V<ll>(m, INFL));
    deque<pll> dq;
    FOR(ll, i, 0, n, 1) cin >> g[i];
    d[0][0] = 1;
    ans = 1;
    dq.push_back({ 0,0 });
    WH(!dq.empty())
    {
        auto [x, y] = dq.front(); dq.pop_front();
        ans = max(ans, d[x][y]);
        FOR(ll, i, 0, 4, 1)
        {
            ll xp = x + dx[i], yp = y + dy[i];
            if (!chk(xp, yp))continue;
            ll w = g[x][y] != g[xp][yp];
            if (d[xp][yp] > d[x][y] + w)
            {
                d[xp][yp] = d[x][y] + w;
                if (w)dq.push_back({ xp,yp });
                else dq.push_front({ xp,yp });
            }
        }
    }
    cout << ans << endl;
}
void init()
{

    if (FILER)
    {
        freopen("pump.in", "r", stdin);
        freopen("pump.out", "w", stdout);
    }
}

void handle()
{
    init();
    ll t = 1;
    if (TYP)cin >> t;
    WHI(t)solve();
}

int main()
{
    IOF
        handle();
    RET 0;
}

컴파일 시 표준 에러 (stderr) 메시지

tracks.cpp: In function 'void solve()':
tracks.cpp:70:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |         auto [x, y] = dq.front(); dq.pop_front();
      |              ^
tracks.cpp: In function 'void init()':
tracks.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen("pump.in", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
tracks.cpp:93:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   93 |         freopen("pump.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 30
• Subtask 2: 2.1875 / 70