# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146971 | dongwon0427 | Collecting Mushrooms (NOI18_collectmushrooms) | C++14 | 52 ms | 35928 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;
typedef long long ll;
typedef pair<int,int> pii;
int n,m,d,k;
vector<int> A[500005], S[500005];
char tmp[500005];
vector<pii> mush;
int cnt(int x1,int y1,int x2,int y2) {
x2 = min(x2, n);
y2 = min(y2, m);
x1--; y1--;
x1 = max(0, x1);
y1 = max(0, y1);
return S[x2][y2] - S[x1][y2] - S[x2][y1] + S[x1][y1];
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>m>>d>>k;
for(int j=1;j<=n;j++) {
cin>>tmp;
int len = strlen(tmp);
# | 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... |