# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003304 | Nailuj_217 | Dijamant (COCI22_dijamant) | C++17 | 1 ms | 604 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>
#define l long long
using namespace std;
const l INF = 1LL<<15;
array<vector<l>, 2005> rows;
array<l, 2005> positions;
int main() {
l n, m;
cin >> n >> m;
string row;
l sum = 0;
for (int i = 1; i <= n; i++) {
cin >> row;
for (int j = 0; j < row.size(); j++) {
if (row[j] == '#') rows[i].push_back(j+1);
}
}
l dist_to_left;
for (int i = 2; i < n; i++) {
positions.fill(0);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |