# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
659148 | Kenpar | Bitaro the Brave (JOI19_ho_t1) | C++17 | 256 ms | 17980 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 endl '\n'
const ll MOD = 1e9+7;
const ll INF = 1e16;
const ll MAX = 2 * 1e5;
void solve(){
int n,m;
cin>>n>>m;
char arr[n][m];
vector<array<int,3>> cols(m), rows(n);
for(int i = 0; i < n ;i++){
for(int j = 0; j < m; j++){
cin>>arr[i][j];
if(arr[i][j] == 'J'){
cols[j][0]++;
rows[i][0]++;
}else if(arr[i][j] == 'O'){
cols[j][1]++;
rows[i][1]++;
}else{
cols[j][2]++;
rows[i][2]++;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |