Submission #550768

#	Time	Username	Problem	Language	Result	Execution time	Memory
550768		inventiontime	Tracks in the Snow (BOI13_tracks)	C++17	2.19 / 100	283 ms	15900 KiB

tracks

#include <bits/stdc++.h>
using namespace std;

#define int ll
#define endl '\n' //comment for interactive

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl << flush

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector  <ti> vti;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;
//const int maxn = ;

void solve() {

    int h, w; cin >> h >> w;
    int f = 0;
    int r = 0;

    loop(i, h) loop(i, w) {
        char c; cin >> c;
        if(c == 'F') f++;
        if(c == 'R') r++;
    }

    if(f and r) cout << 2 << endl;
    else if(!f and !r) cout << 0 << endl;
    else cout << 1 << endl;

}

signed main() {

    fast_io;

    int t = 1; //cin >> t;
    while(t--)
        solve();

    return 0;

}

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