oj.uz

Submission #143616

# Submission time Handle Problem Language Result Execution time Memory
143616 2019-08-14T18:14:00 Z Kanon Rectangles (IOI19_rect) C++14
27 / 100
 5000 ms 250836 KB 
#include <bits/stdc++.h>

using namespace std;

#define range(i, m, n) for(int i = m; i < n; i++)
#define husk(i, m, n) for(int i = m; i > n; i--)

struct sp {
  vector<int> st;
  unordered_set<int> alive;
  sp(){};
  void add(int ss) {
    st.push_back(ss);
    alive.insert(ss);
  }
  int pos(int ss) {
    return upper_bound(st.begin(), st.end(), ss, greater<int>()) - st.begin();
  }
  sp operator ^ (const sp &a) const {
    sp res;
    for(auto i : (a.st.size() < st.size() ? a.st : st)) {
      if((a.st.size() < st.size() ? alive : a.alive).count(i)) res.add(i);
    }
    return res;
  }
};

long long count_rectangles(vector<vector<int>> a) {
  int m = a.front().size();
  int n = a.size();
  auto pos = [&] (vector<int> cur) {
    int s = cur.size();
    vector<pair<int, int>> res;
    range(i, 0, s) {
      range(j, i + 2, s) {
        bool ok = true;
        range(x, i + 1, j) {
          ok &= cur[x] < cur[i];
          ok &= cur[x] < cur[j];
        }
        if(ok) res.emplace_back(i + 1, j - 1);
      }
    }
    sort(res.begin(), res.end(), [&](pair<int, int> a, pair<int, int> b){return make_pair(a.second, -a.first) < make_pair(b.second, -b.first);});
    return res;
    vector<int> st;
    range(i, 0, s) {
      while(st.size() && cur[st.back()] <= cur[i]) {
        if(st.back() < i - 1) res.emplace_back(st.back() + 1, i - 1);
        st.pop_back();
      }
      if(st.size() && st.back() < i - 1) res.emplace_back(st.back() + 1, i - 1);
      st.push_back(i);
    }
    return res;
  };
  vector<vector<sp>> cur(n, vector<sp>(m));
  range(i, 0, n) {
    vector<pair<int, int>> ss = pos(a[i]);
    for(auto j : ss) {
      cur[i][j.second].add(j.first);
    }
  }
  long long res = 0;
  vector<vector<pair<int, int>>> to(n, vector<pair<int, int>> (n, make_pair(-2, -2)));
  range(i, 0, m) {
    vector<int> psy(n);
    range(j, 0, n) psy[j] = a[j][i];
    vector<pair<int, int>> ss = pos(psy);
    int sz = ss.size();
    vector<sp> dp(sz);
    vector<int> pr(n, -1);
    range(j, 0, sz) {
      int p = ss[j].second;
      dp[j] = cur[p][i];
      while(p >= ss[j].first) {
        if(~pr[p]) {
          dp[j] = dp[j] ^ dp[pr[p]];
          p = ss[pr[p]].first - 1;
        } else {
          dp[j] = dp[j] ^ cur[p][i];
          p--;
        }
      }
      pr[ss[j].second] = j;
      int l = to[ss[j].first][ss[j].second].second == i - 1 ? to[ss[j].first][ss[j].second].first : i;
      if(l == i) to[ss[j].first][ss[j].second] = make_pair(i, i);
      to[ss[j].first][ss[j].second].second = i;
      res += dp[j].pos(l);
    }
  }
  return res;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 21 ms 1528 KB Output is correct
18 Correct 33 ms 1528 KB Output is correct
19 Correct 21 ms 1528 KB Output is correct
20 Correct 19 ms 1180 KB Output is correct
21 Correct 22 ms 1272 KB Output is correct
22 Correct 22 ms 1272 KB Output is correct
23 Correct 23 ms 1272 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 21 ms 1528 KB Output is correct
18 Correct 33 ms 1528 KB Output is correct
19 Correct 21 ms 1528 KB Output is correct
20 Correct 19 ms 1180 KB Output is correct
21 Correct 22 ms 1272 KB Output is correct
22 Correct 22 ms 1272 KB Output is correct
23 Correct 23 ms 1272 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 530 ms 8104 KB Output is correct
26 Correct 532 ms 8184 KB Output is correct
27 Correct 537 ms 8160 KB Output is correct
28 Correct 519 ms 5496 KB Output is correct
29 Correct 544 ms 6912 KB Output is correct
30 Correct 544 ms 6776 KB Output is correct
31 Correct 544 ms 6648 KB Output is correct
32 Correct 527 ms 6656 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 21 ms 1528 KB Output is correct
18 Correct 33 ms 1528 KB Output is correct
19 Correct 21 ms 1528 KB Output is correct
20 Correct 19 ms 1180 KB Output is correct
21 Correct 22 ms 1272 KB Output is correct
22 Correct 22 ms 1272 KB Output is correct
23 Correct 23 ms 1272 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 530 ms 8104 KB Output is correct
26 Correct 532 ms 8184 KB Output is correct
27 Correct 537 ms 8160 KB Output is correct
28 Correct 519 ms 5496 KB Output is correct
29 Correct 544 ms 6912 KB Output is correct
30 Correct 544 ms 6776 KB Output is correct
31 Correct 544 ms 6648 KB Output is correct
32 Correct 527 ms 6656 KB Output is correct
33 Execution timed out 5095 ms 43084 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5094 ms 1420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

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

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 508 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 420 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 21 ms 1528 KB Output is correct
18 Correct 33 ms 1528 KB Output is correct
19 Correct 21 ms 1528 KB Output is correct
20 Correct 19 ms 1180 KB Output is correct
21 Correct 22 ms 1272 KB Output is correct
22 Correct 22 ms 1272 KB Output is correct
23 Correct 23 ms 1272 KB Output is correct
24 Correct 9 ms 760 KB Output is correct
25 Correct 530 ms 8104 KB Output is correct
26 Correct 532 ms 8184 KB Output is correct
27 Correct 537 ms 8160 KB Output is correct
28 Correct 519 ms 5496 KB Output is correct
29 Correct 544 ms 6912 KB Output is correct
30 Correct 544 ms 6776 KB Output is correct
31 Correct 544 ms 6648 KB Output is correct
32 Correct 527 ms 6656 KB Output is correct
33 Execution timed out 5095 ms 43084 KB Time limit exceeded
34 Halted 0 ms 0 KB -