# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891812 | Trisanu_Das | Rectangles (IOI19_rect) | C++17 | 836 ms | 274436 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 "rect.h"
#include <bits/stdc++.h>
using namespace std;
int n, m;
int bit[2505];
int a[2][2505][2505], lst[2][2505][2505], cnt[2][2505][2505];
vector<pair<int, int> > p[2];
vector<int> s[2][2505];
void upd(int idx, int val){
for(idx++; idx < 2505; idx += (idx & -idx)) bit[idx] += val;
}
int qry(int idx){
int ans = 0;
for(idx++; idx; idx -= (idx & -idx)) ans += bit[idx];
return ans;
}
long long count_rectangles(vector<vector<int>> A) {
n = A.size(), m = A[0].size();
for(int i = 0; i < n; i++) s[0][i].push_back(0);
for(int i = 0; i < m; i++) s[1][i].push_back(0);
long long ans = 0;
for(int i = 0; i < n - 1; i++){
for(int j = 0; j < m - 1; j++){
a[0][i][j] = a[1][j][i] = A[i][j];
a[0][i][j + 1] = A[i][j + 1];
a[1][j][i + 1] = A[i + 1][j];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |