oj.uz

Submission #143627

# Submission time Handle Problem Language Result Execution time Memory
143627 2019-08-14T18:43:08 Z Kanon Rectangles (IOI19_rect) C++14
50 / 100
 5000 ms 736244 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;
    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);
        int b = st.back();
        st.pop_back();
        if(cur[b] == cur[i]) goto A;
      }
      if(st.size() && st.back() < i - 1) res.emplace_back(st.back() + 1, i - 1);
      A:;
      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 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 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 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 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 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 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 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 7 ms 1528 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 8 ms 1272 KB Output is correct
23 Correct 8 ms 1272 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 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 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 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 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 7 ms 1528 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 8 ms 1272 KB Output is correct
23 Correct 8 ms 1272 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 36 ms 8056 KB Output is correct
26 Correct 36 ms 8056 KB Output is correct
27 Correct 36 ms 8056 KB Output is correct
28 Correct 20 ms 5496 KB Output is correct
29 Correct 45 ms 6776 KB Output is correct
30 Correct 46 ms 6776 KB Output is correct
31 Correct 44 ms 6648 KB Output is correct
32 Correct 44 ms 6520 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 256 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 256 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 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 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 7 ms 1528 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 8 ms 1272 KB Output is correct
23 Correct 8 ms 1272 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 36 ms 8056 KB Output is correct
26 Correct 36 ms 8056 KB Output is correct
27 Correct 36 ms 8056 KB Output is correct
28 Correct 20 ms 5496 KB Output is correct
29 Correct 45 ms 6776 KB Output is correct
30 Correct 46 ms 6776 KB Output is correct
31 Correct 44 ms 6648 KB Output is correct
32 Correct 44 ms 6520 KB Output is correct
33 Execution timed out 5021 ms 58592 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1460 KB Output is correct
2 Correct 5 ms 1360 KB Output is correct
3 Correct 3 ms 1144 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 6 ms 1460 KB Output is correct
6 Correct 6 ms 1460 KB Output is correct
7 Correct 6 ms 1460 KB Output is correct
8 Correct 7 ms 1460 KB Output is correct
9 Correct 7 ms 1456 KB Output is correct
10 Correct 4 ms 760 KB Output is correct
11 Correct 5 ms 1076 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1268 ms 329612 KB Output is correct
3 Correct 2735 ms 732176 KB Output is correct
4 Correct 2729 ms 736064 KB Output is correct
5 Correct 2743 ms 736244 KB Output is correct
6 Correct 412 ms 278964 KB Output is correct
7 Correct 790 ms 556352 KB Output is correct
8 Correct 842 ms 589620 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 508 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 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1528 KB Output is correct
18 Correct 7 ms 1528 KB Output is correct
19 Correct 7 ms 1528 KB Output is correct
20 Correct 5 ms 1144 KB Output is correct
21 Correct 8 ms 1272 KB Output is correct
22 Correct 8 ms 1272 KB Output is correct
23 Correct 8 ms 1272 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 36 ms 8056 KB Output is correct
26 Correct 36 ms 8056 KB Output is correct
27 Correct 36 ms 8056 KB Output is correct
28 Correct 20 ms 5496 KB Output is correct
29 Correct 45 ms 6776 KB Output is correct
30 Correct 46 ms 6776 KB Output is correct
31 Correct 44 ms 6648 KB Output is correct
32 Correct 44 ms 6520 KB Output is correct
33 Execution timed out 5021 ms 58592 KB Time limit exceeded
34 Halted 0 ms 0 KB -