Submission #920096

#TimeUsernameProblemLanguageResultExecution timeMemory
920096thienbao1602Tracks in the Snow (BOI13_tracks)C++17
2.19 / 100
228 ms16464 KiB
#include <bits/stdc++.h> #define SKY #define ll long long #define ld long double #define MASK(x) (1LL << x) #define sz(x) (int)x.size() #define ii pair<ll, ll> #define fi first #define se second #define mp make_pair #define pb push_back #define pf push_front #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define set0(d) memset(d, 0, sizeof(d)) using namespace std; const int LOG = 20; const int base = 311; const ll inf = 1e18; const int block = 400; const ll MOD = 1e9 + 7; const int mxN = 1e6 + 66; const int mxN2D = 4e3 + 55; const int x[] = {0, 1, 0, -1}; const int y[] = {1, 0, -1, 0}; int H, W; char grid[mxN2D][mxN2D]; bool safe(int x, int y) { return (x >= 0 && x < H && y >= 0 && y < W); } void solve() { cin >> H >> W; bool is_rabbit = false; bool is_fox = false; for (int r=0; r<H; r++) { for(int c=0; c<W; c++) { cin >> grid[r][c]; if (grid[r][c] == 'F') is_fox = true; if (grid[r][c] == 'R') is_rabbit = true; } } cout << is_fox + is_rabbit; } int main() { ios_base::sync_with_stdio(false); #ifdef SKY // freopen("test.inp", "r", stdin); // freopen("test.out", "w", stdout); #endif //SKY solve(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...