# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759057 | boris_7 | Dijamant (COCI22_dijamant) | C++17 | 1 ms | 452 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;
using ll = long long;
int n,m;
bool check(int i,int j){
return (i>=0 && j>=0 && i<n && j<m);
}
void solve(){
cin>>n>>m;
vector<string>v(n);
for(int i = 0;i<n;i++){
cin>>v[i];
}
vector<vector<int>>pref(n,vector<int>(m));
vector<vector<int>>e(n);
for(int i = 0;i<n;i++){
if(v[i][0]=='#'){
pref[i][0]=1;
e[i].push_back(0);
}
}
for(int i =0;i<n;i++){
for(int j = 1;j<m;j++){
pref[i][j]=pref[i][j-1]+(v[i][j]=='#');
if(v[i][j]=='#') e[i].push_back(j);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |