# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
572690 | Devigo | Collecting Mushrooms (NOI18_collectmushrooms) | C++14 | 2080 ms | 5352 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 pb push_back
#define mp make_pair
const int siz = 0;
const int mod = 0;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r, c, d, k;
cin >> r >> c >> d >> k;
vector<string> v(r);
for(int i=0; i<r; i++) {
cin >> v[i];
}
//for(int i=0; i<r; i++) {
// for(int j=0; j<c; j++) {
// cout << v[i][j] << " ";
// }
// cout << "\n";
//}
vector<vector<int>> cnt(r,vector<int>(c,0));
for(int i=0; i<r; i++) {
for(int j=0; j<c; j++) {
if(v[i][j] == 'S') {
int x,y,z,e; //cout << "c\n";
x = max(0,i-d);
# | 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... |