# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1161024 | elotelo966 | Dango Maker (JOI18_dango_maker) | C++20 | 0 ms | 528 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define OYY LLONG_MAX
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define fi first
#define se second
#define FOR for(int i=1;i<=n;i++)
#define pb push_back
#define lim 3005
int n,m,cev,maxi,cur1,cur2;
char dizi[lim][lim];
vector<int> v[lim];
int vis[lim*lim*2];
inline int ind(int x,int y,int z){
return n*m*z+(x-1)*m+y;
}
inline bool check(int x,int y){
return x>=1 && x<=n && y>=1 && y<=m;
}
inline bool check_left(int x,int y){
return check(x,y) && check(x,y+1) && check(x,y+2) && dizi[x][y]=='R' && dizi[x][y+1]=='G' && dizi[x][y+2]=='W';
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |