# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1049628 | vjudge1 | T-Covering (eJOI19_covering) | C++17 | 61 ms | 20052 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 ll long long
#define fi first
#define se second
vector<vector<int>> a,check,dp;
int m,n,k,x,y,ketqua;
int dx[]={0,0,-1,1};
int dy[]={1,-1,0,0};
int soluong,minn,tong,soluongx;
void dfs(int u,int v)
{
check[u][v]=1;
soluongx+=dp[u][v];
tong+=a[u][v];
if (dp[u][v]==0) minn=min(minn,a[u][v]),soluong++;
for (int i=0;i<4;++i)
{
int u1=u+dx[i];
int v1=v+dy[i];
if (u1==0 || u1==m+1 || v1==0 || v1==n+1 || dp[u1][v1]==dp[u][v] || check[u1][v1]) continue;
dfs(u1,v1);
}
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>m>>n;
a.resize(m+1);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |