# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
949819 | amirhoseinfar1385 | Dango Maker (JOI18_dango_maker) | C++17 | 401 ms | 199548 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;
const int maxn=3005;
int all[maxn][maxn],n,m,mainres=0,row[maxn][maxn],cal[maxn][maxn];
vector<pair<int,int>>asabnadaram[maxn*2];
struct fdp{
int r,c;
fdp(){
r=c=0;
}
};
void vorod(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
char c;
cin>>c;
if(c=='R'){
all[i][j]=1;
}else if(c=='G'){
all[i][j]=2;
}else{
all[i][j]=3;
}
//cin>>all[i][j];
}
}
}
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... |