# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733806 | 2023-05-01T10:33:35 Z | vjudge1 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2000 ms | 4940 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long vector <pair<ll,ll>> v; ll r, c, d, li; bool check(ll a, ll b) { if(a < r && b < c && a >= 0 && b >= 0) return 1; else return 0; } int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> r >> c; cin >> d >> li; char ch[r][c]; for(ll i = 0; i < r; i++) { for(ll j = 0; j < c; j++) { cin >> ch[i][j]; if(ch[i][j] == 'M') { v.push_back({i, j}); } } } ll ss, ans = 0, t = 0; for(ll i = 0; i < v.size(); i++) { ll f = v[i].first; ll s = v[i].second; ss = 0; for(ll k = f - d; k <= f + d; k++) { if(t == 1) { t = 0; break; } for(ll q = s - d; q <= s + d; q++) { if(!check(k, q)) continue; if(ch[k][q] == 'S') ss++; if(ss >= li) { ans++; break; t = 1; } } } } cout << ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 349 ms | 500 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2060 ms | 4940 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |