# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
182427 | duttaditya18 | Collecting Mushrooms (NOI18_collectmushrooms) | C++17 | 2025 ms | 11660 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
int main(void)
{
int r, c, d, k; cin >> r >> c >> d >> k;
vector<pair<int, int>> v;
vector<pair<int, int>> s;
char x;
for(int i = 1; i <= r; i++)
{
for(int j = 1; j <= c; j++)
{
cin >> x;
if(x == 'M') v.push_back(make_pair(i, j));
if(x == 'S') s.push_back(make_pair(i, j));
}
}
int a[r + 2][c + 2] = {};
for(auto u : s)
{
// cout << u.fi << " " << u.se << endl;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |