Submission #1273051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1273051		zagaro	Tracks in the Snow (BOI13_tracks)	C++20	2.19 / 100	211 ms	16304 KiB

tracks

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    ll n, m, r=1, a, b;
    bl F=false, R=false;
    car c;
    cin>>n>>m;
    vector<vector<car> > vec(n+2, vector<car> (m+2, '.'));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>vec[i][j];
            if(vec[i][j] == 'F')F=true;
            else if(vec[i][j] == 'R')R=true;
        }
    }
    if(F && R)r++;
    c = vec[1][1];
    queue<tuple<ll,ll> > pq;
    pq.push({1, 1});
    vec[1][1] = '.';
    wl(!pq.empty()){
        tie(a, b) = pq.front();
        pq.pop();
        if(vec[a+1][b] == c){
            vec[a+1][b] = '.';
            pq.push({a+1, b});
        }
        if(vec[a-1][b] == c){
            vec[a-1][b] = '.';
            pq.push({a-1, b});
        }
        if(vec[a][b+1] == c){
            vec[a][b+1] = '.';
            pq.push({a, b+1});
        }
        if(vec[a][b-1] == c){
            vec[a][b-1] = '.';
            pq.push({a, b-1});
        }
    }
    F = false;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(vec[i][j] == c){
                F=true;
            }
        }
    }
    if(F)r++;
    cout<<r<<ENDL;
    return 0;
}

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