oj.uz

Submission #264473

# Submission time Handle Problem Language Result Execution time Memory
264473 2020-08-14T07:08:06 Z Bruteforceman Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 637696 KB 
#include "bits/stdc++.h"
#include "rect.h"
using namespace std;
const int maxn = 2505;
struct rect {
  int i, j;
  int l, r;
  rect (int i, int j, int l, int r) : i(i), j(j), l(l), r(r) {}
  rect () {}
};
vector <pair <int, int>> ver[maxn][maxn], hor[maxn][maxn];

vector <rect> getLines(vector<std::vector<int>> a) {
  int n = a.size();
  int m = a.front().size();
  vector <int> v[m];
  vector <rect> vert;
  for(int i = 0; i < n; i++) {
    set <int> last;
    vector <int> arr (n, -1);
    for(int j = 0; j < m; j++) {
      set <int> aux;
      for(int k = int(v[j].size()) - 1; k >= 0; k--) {
        aux.insert(v[j][k]);
        if(a[v[j][k]][j] >= a[i][j]) break;
      }
      while(!v[j].empty() && a[v[j].back()][j] <= a[i][j]) {
        v[j].pop_back();
      }
      v[j].push_back(i);
      for(int k : last) {
        if(aux.find(k) == aux.end()) {
          if(k < i - 1) vert.emplace_back(k, i, arr[k], j - 1);
          arr[k] = -1;
        }
      }
      for(int k : aux) {
        if(arr[k] == -1) arr[k] = j;
      }
      last = aux;
    }
    for(int k : last) {
      if(k < i - 1) vert.emplace_back(k, i, arr[k], m - 1);
    }
  }
	return vert;
}
vector <vector <int>> rotate(vector <vector <int>> a) {
  int n = a.size();
  int m = a.front().size();
  vector <vector <int>> b (m, vector <int> (n, 0));
  for(int i = 0; i < m; i++) {
    for(int j = 0; j < n; j++) {
      b[i][j] = a[j][i];
    }
  }
  return b;
}
/*
0 2 1 2
2 4 0 1
1 4 4 4
*/
long long solve(int i, int j) {
  long long ans = 0;
  for(auto x : ver[i][j]) {
    for(auto y : hor[i][j]) {
      if(y.first >= x.first && y.second <= x.second) ++ans;
    }
  }
  /* for(auto x : hor[i][j]) {
    cout << x.first << " " << x.second << endl;
  }
  cout << i << " " << j << " " << ans << endl;
  */
  return ans;
}
long long count_rectangles(vector <vector <int>> a) {
  auto h = getLines(a);
  auto v = getLines(rotate(a));
  int n = a.size();
  int m = a.front().size();
  for(auto &x : v) {
    int aux = x.l;
    x.l = max(0, x.l - 1);
    x.r = min(n - 1, x.r + 1);
    for(int i = x.l; i <= x.r; i++) {
      ver[i][x.j].emplace_back(x.l, x.i);
      // cout << x.j << " " << i << " " << x.i << " " << x.l << endl;
    }
    // cout << x.i << " " << x.j << " " << x.l << " " << x.r << endl;
  }
  for(auto &x : h) {
    int aux = x.l;
    x.l = max(0, x.l - 1);
    x.r = min(m - 1, x.r + 1);
    for(int i = x.l; i <= x.r; i++) {
      hor[x.j][i].emplace_back(x.i, x.l);
    }
  }
  long long ans = 0;
  for(int i = 0; i < n; i++) {
    for(int j = 0; j < m; j++) {
      ans += solve(i, j);
    }
  }
  return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:84:9: warning: unused variable 'aux' [-Wunused-variable]
   84 |     int aux = x.l;
      |         ^~~
rect.cpp:94:9: warning: unused variable 'aux' [-Wunused-variable]
   94 |     int aux = x.l;
      |         ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 295032 KB Output is correct
2 Correct 209 ms 295288 KB Output is correct
3 Correct 203 ms 295032 KB Output is correct
4 Correct 202 ms 294988 KB Output is correct
5 Correct 189 ms 295036 KB Output is correct
6 Correct 185 ms 295160 KB Output is correct
7 Correct 183 ms 295160 KB Output is correct
8 Correct 182 ms 295032 KB Output is correct
9 Correct 184 ms 295056 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 188 ms 295160 KB Output is correct
12 Correct 186 ms 295160 KB Output is correct
13 Correct 182 ms 294960 KB Output is correct
14 Correct 190 ms 295032 KB Output is correct
15 Correct 190 ms 295032 KB Output is correct
16 Correct 181 ms 295032 KB Output is correct
17 Correct 189 ms 295032 KB Output is correct
18 Correct 183 ms 295032 KB Output is correct
19 Correct 187 ms 295032 KB Output is correct
20 Correct 182 ms 295032 KB Output is correct
21 Correct 184 ms 295032 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 295032 KB Output is correct
2 Correct 209 ms 295288 KB Output is correct
3 Correct 203 ms 295032 KB Output is correct
4 Correct 202 ms 294988 KB Output is correct
5 Correct 189 ms 295036 KB Output is correct
6 Correct 185 ms 295160 KB Output is correct
7 Correct 183 ms 295160 KB Output is correct
8 Correct 182 ms 295032 KB Output is correct
9 Correct 184 ms 295056 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 188 ms 295160 KB Output is correct
12 Correct 186 ms 295160 KB Output is correct
13 Correct 182 ms 294960 KB Output is correct
14 Correct 190 ms 295032 KB Output is correct
15 Correct 190 ms 295032 KB Output is correct
16 Correct 181 ms 295032 KB Output is correct
17 Correct 185 ms 295288 KB Output is correct
18 Correct 200 ms 295288 KB Output is correct
19 Correct 187 ms 295288 KB Output is correct
20 Correct 188 ms 295392 KB Output is correct
21 Correct 189 ms 295680 KB Output is correct
22 Correct 190 ms 295672 KB Output is correct
23 Correct 195 ms 295688 KB Output is correct
24 Correct 183 ms 295288 KB Output is correct
25 Correct 189 ms 295032 KB Output is correct
26 Correct 183 ms 295032 KB Output is correct
27 Correct 187 ms 295032 KB Output is correct
28 Correct 182 ms 295032 KB Output is correct
29 Correct 184 ms 295032 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 295032 KB Output is correct
2 Correct 209 ms 295288 KB Output is correct
3 Correct 203 ms 295032 KB Output is correct
4 Correct 202 ms 294988 KB Output is correct
5 Correct 189 ms 295036 KB Output is correct
6 Correct 185 ms 295160 KB Output is correct
7 Correct 183 ms 295160 KB Output is correct
8 Correct 182 ms 295032 KB Output is correct
9 Correct 184 ms 295056 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 188 ms 295160 KB Output is correct
12 Correct 186 ms 295160 KB Output is correct
13 Correct 182 ms 294960 KB Output is correct
14 Correct 190 ms 295032 KB Output is correct
15 Correct 190 ms 295032 KB Output is correct
16 Correct 181 ms 295032 KB Output is correct
17 Correct 185 ms 295288 KB Output is correct
18 Correct 200 ms 295288 KB Output is correct
19 Correct 187 ms 295288 KB Output is correct
20 Correct 188 ms 295392 KB Output is correct
21 Correct 189 ms 295680 KB Output is correct
22 Correct 190 ms 295672 KB Output is correct
23 Correct 195 ms 295688 KB Output is correct
24 Correct 183 ms 295288 KB Output is correct
25 Correct 203 ms 296212 KB Output is correct
26 Correct 201 ms 296160 KB Output is correct
27 Correct 207 ms 296184 KB Output is correct
28 Correct 204 ms 297612 KB Output is correct
29 Correct 223 ms 299528 KB Output is correct
30 Correct 225 ms 299528 KB Output is correct
31 Correct 216 ms 298888 KB Output is correct
32 Correct 214 ms 298884 KB Output is correct
33 Correct 189 ms 295032 KB Output is correct
34 Correct 183 ms 295032 KB Output is correct
35 Correct 187 ms 295032 KB Output is correct
36 Correct 182 ms 295032 KB Output is correct
37 Correct 184 ms 295032 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 295032 KB Output is correct
2 Correct 209 ms 295288 KB Output is correct
3 Correct 203 ms 295032 KB Output is correct
4 Correct 202 ms 294988 KB Output is correct
5 Correct 189 ms 295036 KB Output is correct
6 Correct 185 ms 295160 KB Output is correct
7 Correct 183 ms 295160 KB Output is correct
8 Correct 182 ms 295032 KB Output is correct
9 Correct 184 ms 295056 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 188 ms 295160 KB Output is correct
12 Correct 186 ms 295160 KB Output is correct
13 Correct 182 ms 294960 KB Output is correct
14 Correct 190 ms 295032 KB Output is correct
15 Correct 190 ms 295032 KB Output is correct
16 Correct 181 ms 295032 KB Output is correct
17 Correct 185 ms 295288 KB Output is correct
18 Correct 200 ms 295288 KB Output is correct
19 Correct 187 ms 295288 KB Output is correct
20 Correct 188 ms 295392 KB Output is correct
21 Correct 189 ms 295680 KB Output is correct
22 Correct 190 ms 295672 KB Output is correct
23 Correct 195 ms 295688 KB Output is correct
24 Correct 183 ms 295288 KB Output is correct
25 Correct 203 ms 296212 KB Output is correct
26 Correct 201 ms 296160 KB Output is correct
27 Correct 207 ms 296184 KB Output is correct
28 Correct 204 ms 297612 KB Output is correct
29 Correct 223 ms 299528 KB Output is correct
30 Correct 225 ms 299528 KB Output is correct
31 Correct 216 ms 298888 KB Output is correct
32 Correct 214 ms 298884 KB Output is correct
33 Correct 520 ms 323832 KB Output is correct
34 Correct 439 ms 326756 KB Output is correct
35 Correct 408 ms 326668 KB Output is correct
36 Correct 445 ms 329608 KB Output is correct
37 Correct 448 ms 310264 KB Output is correct
38 Correct 485 ms 310212 KB Output is correct
39 Correct 450 ms 310536 KB Output is correct
40 Correct 440 ms 309812 KB Output is correct
41 Correct 394 ms 320256 KB Output is correct
42 Correct 419 ms 326744 KB Output is correct
43 Correct 622 ms 350696 KB Output is correct
44 Correct 657 ms 351424 KB Output is correct
45 Correct 411 ms 322940 KB Output is correct
46 Correct 406 ms 322968 KB Output is correct
47 Correct 582 ms 341612 KB Output is correct
48 Correct 592 ms 342000 KB Output is correct
49 Correct 189 ms 295032 KB Output is correct
50 Correct 183 ms 295032 KB Output is correct
51 Correct 187 ms 295032 KB Output is correct
52 Correct 182 ms 295032 KB Output is correct
53 Correct 184 ms 295032 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 229 ms 295800 KB Output is correct
2 Correct 218 ms 295568 KB Output is correct
3 Correct 222 ms 295288 KB Output is correct
4 Correct 214 ms 295032 KB Output is correct
5 Correct 223 ms 295544 KB Output is correct
6 Correct 223 ms 295544 KB Output is correct
7 Correct 227 ms 295548 KB Output is correct
8 Correct 238 ms 295544 KB Output is correct
9 Correct 194 ms 295672 KB Output is correct
10 Correct 194 ms 295288 KB Output is correct
11 Correct 192 ms 295544 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 295032 KB Output is correct
2 Correct 1458 ms 442232 KB Output is correct
3 Correct 3216 ms 614696 KB Output is correct
4 Correct 3107 ms 616448 KB Output is correct
5 Correct 3151 ms 616568 KB Output is correct
6 Correct 722 ms 343652 KB Output is correct
7 Correct 1260 ms 387356 KB Output is correct
8 Correct 1311 ms 393640 KB Output is correct
9 Correct 189 ms 295032 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 187 ms 295032 KB Output is correct
12 Correct 182 ms 295032 KB Output is correct
13 Correct 184 ms 295032 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 197 ms 295032 KB Output is correct
2 Correct 209 ms 295288 KB Output is correct
3 Correct 203 ms 295032 KB Output is correct
4 Correct 202 ms 294988 KB Output is correct
5 Correct 189 ms 295036 KB Output is correct
6 Correct 185 ms 295160 KB Output is correct
7 Correct 183 ms 295160 KB Output is correct
8 Correct 182 ms 295032 KB Output is correct
9 Correct 184 ms 295056 KB Output is correct
10 Correct 183 ms 295032 KB Output is correct
11 Correct 188 ms 295160 KB Output is correct
12 Correct 186 ms 295160 KB Output is correct
13 Correct 182 ms 294960 KB Output is correct
14 Correct 190 ms 295032 KB Output is correct
15 Correct 190 ms 295032 KB Output is correct
16 Correct 181 ms 295032 KB Output is correct
17 Correct 185 ms 295288 KB Output is correct
18 Correct 200 ms 295288 KB Output is correct
19 Correct 187 ms 295288 KB Output is correct
20 Correct 188 ms 295392 KB Output is correct
21 Correct 189 ms 295680 KB Output is correct
22 Correct 190 ms 295672 KB Output is correct
23 Correct 195 ms 295688 KB Output is correct
24 Correct 183 ms 295288 KB Output is correct
25 Correct 203 ms 296212 KB Output is correct
26 Correct 201 ms 296160 KB Output is correct
27 Correct 207 ms 296184 KB Output is correct
28 Correct 204 ms 297612 KB Output is correct
29 Correct 223 ms 299528 KB Output is correct
30 Correct 225 ms 299528 KB Output is correct
31 Correct 216 ms 298888 KB Output is correct
32 Correct 214 ms 298884 KB Output is correct
33 Correct 520 ms 323832 KB Output is correct
34 Correct 439 ms 326756 KB Output is correct
35 Correct 408 ms 326668 KB Output is correct
36 Correct 445 ms 329608 KB Output is correct
37 Correct 448 ms 310264 KB Output is correct
38 Correct 485 ms 310212 KB Output is correct
39 Correct 450 ms 310536 KB Output is correct
40 Correct 440 ms 309812 KB Output is correct
41 Correct 394 ms 320256 KB Output is correct
42 Correct 419 ms 326744 KB Output is correct
43 Correct 622 ms 350696 KB Output is correct
44 Correct 657 ms 351424 KB Output is correct
45 Correct 411 ms 322940 KB Output is correct
46 Correct 406 ms 322968 KB Output is correct
47 Correct 582 ms 341612 KB Output is correct
48 Correct 592 ms 342000 KB Output is correct
49 Correct 229 ms 295800 KB Output is correct
50 Correct 218 ms 295568 KB Output is correct
51 Correct 222 ms 295288 KB Output is correct
52 Correct 214 ms 295032 KB Output is correct
53 Correct 223 ms 295544 KB Output is correct
54 Correct 223 ms 295544 KB Output is correct
55 Correct 227 ms 295548 KB Output is correct
56 Correct 238 ms 295544 KB Output is correct
57 Correct 194 ms 295672 KB Output is correct
58 Correct 194 ms 295288 KB Output is correct
59 Correct 192 ms 295544 KB Output is correct
60 Correct 217 ms 295032 KB Output is correct
61 Correct 1458 ms 442232 KB Output is correct
62 Correct 3216 ms 614696 KB Output is correct
63 Correct 3107 ms 616448 KB Output is correct
64 Correct 3151 ms 616568 KB Output is correct
65 Correct 722 ms 343652 KB Output is correct
66 Correct 1260 ms 387356 KB Output is correct
67 Correct 1311 ms 393640 KB Output is correct
68 Execution timed out 5090 ms 637696 KB Time limit exceeded
69 Halted 0 ms 0 KB -