# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
824461 | PoonYaPat | Sandcastle 2 (JOI22_ho_t5) | C++14 | 5061 ms | 6428 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;
int h,w,c[5000][5000],val[50005];
ll ans,dp1[50005],dp2[50005];
map<int,int> mp;
int cc=0;
void dfs(int x, int y) {
++cc;
if (mp[c[x-1][y]]==cc+1) dfs(x-1,y);
else if (mp[c[x+1][y]]==cc+1) dfs(x+1,y);
else if (mp[c[x][y-1]]==cc+1) dfs(x,y-1);
else if (mp[c[x][y+1]]==cc+1) dfs(x,y+1);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>h>>w;
if (h==1) {
for (int i=1; i<=w; ++i) cin>>val[i];
for (int i=1; i<=w; ++i) {
if (i && val[i]>val[i-1]) dp1[i]=dp1[i-1]+1;
else dp1[i]=1;
ans+=dp1[i];
}
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... |