Submission #535002

#TimeUsernameProblemLanguageResultExecution timeMemory
535002MedalistSlayerCollecting Mushrooms (NOI18_collectmushrooms)C++14
19 / 100
2 ms864 KiB
/* Does he have IGM on CF? -neko_nyaa */ #include <bits/stdc++.h> using namespace std; //define #define PB push_back #define MP make_pair #define pi acos(-1) #define int long long //constant const int mod=1e9+7; const long long MOD=998244353LL; const long long inf=(long long)1e18; //typedef typedef long long ll; typedef pair<int,int> pii; typedef map<int,int> mii; typedef map<string,int> msi; typedef set<int> SI; typedef priority_queue<int> pqi; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); //freopen("haybales.in", "r", stdin); //freopen("haybales.out", "w", stdout); int r,c,d,k; cin >> r >> c >> d >> k; vector<string> s(r); for(int i=0;i<r;i++) { cin >> s[i]; } int mushroom=0; int sprinkler=0; for(int i=0;i<r;i++) { for(int j=0;j<c;j++) { if(s[i][j]=='M') { mushroom++; } if(s[i][j]=='S') { sprinkler++; } } } cout << (k<=sprinkler?mushroom:0) << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...