# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
818683 | vjudge1 | Bitaro the Brave (JOI19_ho_t1) | C++17 | 1062 ms | 9428 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 int long long
#define el cout<<endl;
#define fr(n,m) for(int i=n;i<m;i++)
#define frj(n,m) for(int j=n;j<m;j++)
#define frl(n,m) for(int l=n;l<m;l++)
#define frd(n,m) for(int d=n;d<m;d++)
#define mii map<int,int>
#define mci map<char,int>
#define vi vector<int>
#define vc vector<char>
const int mod = 1e9 + 7;
// const int mod=998
int i = 0, j = 0, k = 0, l = 0, h = 0, w = 0, a = 0, b = 0, c = 0, d = 0;
int num = 0, ans = 0, sum = 0;
const int N = 1e3 + 5;
void solve() {
cin >> h >> w;
vector<string>v(h);
fr(0, h) {
cin >> v[i];
}
fr(0, h) {
frj(0, w) {
// cout << v[i][j] << " ";
if (v[i][j] == 'J') {
a = 0; b = 0;
frl(j + 1, w) {
if (v[i][l] == 'O') {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |