oj.uz

Submission #263467

# Submission time Handle Problem Language Result Execution time Memory
263467 2020-08-13T17:26:42 Z Bruteforceman Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 80700 KB 
#include "bits/stdc++.h"
#include "rect.h"
using namespace std;
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 <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 count_rectangles(vector <vector <int>> a) {
  auto h = getLines(a);
  auto v = getLines(rotate(a));
  for(auto &x : v) {
    x.l -= 1;
    x.r += 1;
    // cout << x.i << " " << x.j << " " << x.l << " " << x.r << endl;
  }
  for(auto &x : h) {
    x.l -= 1;
    x.r += 1;
    // cout << x.i << " " << x.j << " " << x.l << " " << x.r << endl;
  }
  long long ans = 0;
  for(auto x : v) {
    for(auto y : h) {
      if(x.l <= y.i && y.j <= x.r) {
        if(y.l <= x.i && x.j <= y.r) {
          ++ans;
        }
      }
    }
  }
  return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 30 ms 768 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 26 ms 768 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 30 ms 768 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 26 ms 768 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 18 ms 1536 KB Output is correct
26 Correct 18 ms 1408 KB Output is correct
27 Correct 18 ms 1408 KB Output is correct
28 Correct 247 ms 1620 KB Output is correct
29 Correct 1259 ms 2436 KB Output is correct
30 Correct 1313 ms 2564 KB Output is correct
31 Correct 815 ms 2436 KB Output is correct
32 Correct 842 ms 2436 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 30 ms 768 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 26 ms 768 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 18 ms 1536 KB Output is correct
26 Correct 18 ms 1408 KB Output is correct
27 Correct 18 ms 1408 KB Output is correct
28 Correct 247 ms 1620 KB Output is correct
29 Correct 1259 ms 2436 KB Output is correct
30 Correct 1313 ms 2564 KB Output is correct
31 Correct 815 ms 2436 KB Output is correct
32 Correct 842 ms 2436 KB Output is correct
33 Execution timed out 5054 ms 20680 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 896 KB Output is correct
2 Correct 9 ms 896 KB Output is correct
3 Correct 9 ms 640 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 16 ms 896 KB Output is correct
6 Correct 20 ms 896 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 15 ms 896 KB Output is correct
9 Correct 15 ms 896 KB Output is correct
10 Correct 9 ms 640 KB Output is correct
11 Correct 10 ms 768 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Execution timed out 5060 ms 80700 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 4 ms 512 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 30 ms 768 KB Output is correct
22 Correct 32 ms 768 KB Output is correct
23 Correct 26 ms 768 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 18 ms 1536 KB Output is correct
26 Correct 18 ms 1408 KB Output is correct
27 Correct 18 ms 1408 KB Output is correct
28 Correct 247 ms 1620 KB Output is correct
29 Correct 1259 ms 2436 KB Output is correct
30 Correct 1313 ms 2564 KB Output is correct
31 Correct 815 ms 2436 KB Output is correct
32 Correct 842 ms 2436 KB Output is correct
33 Execution timed out 5054 ms 20680 KB Time limit exceeded
34 Halted 0 ms 0 KB -