oj.uz

Submission #918705

# Submission time Handle Problem Language Result Execution time Memory
918705 2024-01-30T09:33:47 Z xynex Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 334512 KB 
/**
  * Author: Tenjin
  * Created: 27.04.2022 18:58
  * Why am I so stupid? :c
  * Slishkom slab
**/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

template<typename T> T get_rand(T l, T r) {
  random_device rd;
  mt19937 gen(rd());
  return uniform_int_distribution<T>(l, r)(gen);
}

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
  freopen((s + ".in").c_str(), "r", stdin);
  freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 4e5 + 5;
const double long pi = acos(-1);
const double long eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

const int N = 1e6 + 5;
const ll X = 5e3;
const ll Y = X * X * X;
bool valid[2501][2501];
ll count_rectangles(vt<vt<int>> a) {
  int n = sz(a);
  int m = sz(a[0]);
  vt<vt<int>> L(n, vt<int> (m, -1)), R(n, vt<int> (m, -1));
  vt<vt<int>> L1(n, vt<int> (m, -1)), R1(n, vt<int> (m, -1));
  for(int i = 0; i < n; ++i) {
    vt<pr<int, int> > st;
    for(int j = 0; j < m; ++j) {
      valid[i][j] = 1;
      while(!st.empty() && st.back().ff <= a[i][j]) st.pop_back();
      if(!st.empty()) L[i][j] = st.back().ss;
      else L[i][j] = -1;
      st.push_back({a[i][j], j});
    }
    st.clear();
    for(int j = m - 1; j >= 0; --j) {
      while(!st.empty() && st.back().ff <= a[i][j]) st.pop_back();
      if(!st.empty()) R[i][j] = st.back().ss;
      else R[i][j] = m;
      st.push_back({a[i][j], j});
    }
  }
  for(int i = 0; i < m; ++i) {
    vt<pr<int, int> > st;
    for(int j = 0; j < n; ++j) {
      while(!st.empty() && st.back().ff <= a[j][i]) st.pop_back();
      if(!st.empty()) L1[j][i] = st.back().ss;
      else L1[j][i] = -1;
      st.push_back({a[j][i], j});
    }
    st.clear();
    for(int j = n - 1; j >= 0; --j) {
      while(!st.empty() && st.back().ff <= a[j][i]) st.pop_back();
      if(!st.empty()) R1[j][i] = st.back().ss;
      else R1[j][i] = n;
      st.push_back({a[j][i], j});
    }
  }
  set<pr<int, int>> last;
  for(int i = 0; i < n; ++i) {
    set<pr<int, int>> nxt;
    for(int j = 0; j < m; ++j) {
      int limL = L1[i][j], limR = i;
     // print(i, j, limL, limR);
      if(limL == -1) {
        valid[i][j] = 0;
        continue;
      }
      int curL = L[i][j], curR = R[i][j];
     // print(curL, curR);
      if(curL == -1 || curR == m) {
        valid[i][j] = 0;
        continue;
      }
      curL *= n;
      curL += curR;
      auto fnd = last.lower_bound({curL, 0});
      int cur = 0;
      if(fnd != last.end() && (*fnd).ff == curL) {
        cur = (*fnd).ss;
      }
      cur++;
      //print(cur);
      if(cur < (limR - limL)) {
        valid[i][j] = 0;
      }
      //print(valid[i][j]);
      nxt.insert({curL, cur});
    }
    swap(last, nxt);
  }
  last.clear();
  for(int i = n - 1; i >= 0; --i) {
    set<pr<int, int>> nxt;
    for(int j = 0; j < m; ++j) {
      int limL = i, limR = R1[i][j];
      //print(i, j, limL, limR);
      if(limR == n) {
        valid[i][j] = 0;
        continue;
      }
      int curL = L[i][j], curR = R[i][j];
     // print(curL, curR);
      if(curL == -1 || curR == m) {
        valid[i][j] = 0;
        continue;
      }
      curL *= n;
      curL += curR;
      auto fnd = last.lower_bound({curL, 0});
      int cur = 0;
      if(fnd != last.end() && (*fnd).ff == curL) {
        cur = (*fnd).ss;
      }
      cur++;
      //print(cur);
      if(cur < (limR - limL)) {
        valid[i][j] = 0;
      }
      //print(valid[i][j]);
      nxt.insert({curL, cur});
    }
    swap(last, nxt);
  }
  last.clear();
  for(int i = 0; i < m; ++i) {
    set<pr<int, int>> nxt;
    for(int j = 0; j < n; ++j) {
      int limL = L[j][i], limR = i;
      //print(j, i, limL, limR);
      if(limL == -1) {
        valid[j][i] = 0;
        continue;
      }
      int curL = L1[j][i], curR = R1[j][i];
     // print(curL, curR);
      if(curL == -1 || curR == n) {
        valid[j][i] = 0;
        continue;
      }
      curL *= m;
      curL += curR;
      auto fnd = last.lower_bound({curL, 0});
      int cur = 0;
      if(fnd != last.end() && (*fnd).ff == curL) {
        cur = (*fnd).ss;
      }
      cur++;
      //print(cur);
      if(cur < (limR - limL)) {
        valid[j][i] = 0;
      }
      //print(valid[j][i]);
      nxt.insert({curL, cur});
    }
    swap(last, nxt);
  }
  last.clear();
  for(int i = m - 1; i >= 0; --i) {
    set<pr<int, int>> nxt;
    for(int j = 0; j < n; ++j) {
      int limL = i, limR = R[j][i];
      if(limR == m) {
        valid[j][i] = 0;
        continue;
      }
      int curL = L1[j][i], curR = R1[j][i];
      if(curL == -1 || curR == n) {
        valid[j][i] = 0;
        continue;
      }
      curL *= m;
      curL += curR;
      auto fnd = last.lower_bound({curL, 0});
      int cur = 0;
      if(fnd != last.end() && (*fnd).ff == curL) {
        cur = (*fnd).ss;
      }
      cur++;
      if(cur < (limR - limL)) {
        valid[j][i] = 0;
      }
      nxt.insert({curL, cur});
    }
    swap(last, nxt);
  }
  //vt<pr<int, int>> ord
 // set<pr<int, int>> have;
  int ans = 0;
  vt<pr<ll, int>> an;
  for(int i = 1; i < n - 1; ++i) {
    for(int j = 1; j < m - 1; ++j) {
      ll cur = L[i][j] * X + R[i][j];
      ll cur1 = L1[i][j] * X + R1[i][j];
      cur *= Y;
      cur += cur1;
      an.push_back({cur, valid[i][j]});
    }
  }
  sort(all(an));
  for(int i = 0; i < sz(an); ++i) {
    if(i && an[i].ff == an[i - 1].ff) continue;
    ans += an[i].ss;
  }
  /*int ans = 0;
  for(auto cur : ord) ans += valid[cur.ff][cur.ss];*/
  return ans;
}


/*
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  //freop("");
  int t = 1;
  //read(t);
  for (int i = 1; i <= t; ++i) {
    //write("Case #" + to_string(i) + ": ");
    solve();
  }
  return 0;
}*/

Compilation message

rect.cpp: In function 'void freop(std::string)':
rect.cpp:64:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   64 |   freopen((s + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:65:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   65 |   freopen((s + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 548 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 496 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 548 KB Output is correct
17 Correct 1 ms 500 KB Output is correct
18 Correct 1 ms 504 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 496 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 4 ms 3056 KB Output is correct
23 Correct 3 ms 2908 KB Output is correct
24 Correct 3 ms 3164 KB Output is correct
25 Correct 3 ms 2908 KB Output is correct
26 Correct 4 ms 3420 KB Output is correct
27 Correct 4 ms 3160 KB Output is correct
28 Correct 4 ms 2908 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 548 KB Output is correct
17 Correct 4 ms 3056 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 3164 KB Output is correct
20 Correct 3 ms 2908 KB Output is correct
21 Correct 4 ms 3420 KB Output is correct
22 Correct 4 ms 3160 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 1 ms 500 KB Output is correct
26 Correct 1 ms 504 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 496 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 17 ms 4784 KB Output is correct
31 Correct 17 ms 5020 KB Output is correct
32 Correct 19 ms 5064 KB Output is correct
33 Correct 18 ms 4828 KB Output is correct
34 Correct 24 ms 4968 KB Output is correct
35 Correct 25 ms 5104 KB Output is correct
36 Correct 29 ms 4816 KB Output is correct
37 Correct 24 ms 5064 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 548 KB Output is correct
17 Correct 4 ms 3056 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 3164 KB Output is correct
20 Correct 3 ms 2908 KB Output is correct
21 Correct 4 ms 3420 KB Output is correct
22 Correct 4 ms 3160 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 17 ms 4784 KB Output is correct
26 Correct 17 ms 5020 KB Output is correct
27 Correct 19 ms 5064 KB Output is correct
28 Correct 18 ms 4828 KB Output is correct
29 Correct 24 ms 4968 KB Output is correct
30 Correct 25 ms 5104 KB Output is correct
31 Correct 29 ms 4816 KB Output is correct
32 Correct 24 ms 5064 KB Output is correct
33 Correct 1 ms 500 KB Output is correct
34 Correct 1 ms 504 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 496 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 125 ms 24976 KB Output is correct
39 Correct 111 ms 24708 KB Output is correct
40 Correct 121 ms 24600 KB Output is correct
41 Correct 107 ms 26344 KB Output is correct
42 Correct 281 ms 26244 KB Output is correct
43 Correct 273 ms 24464 KB Output is correct
44 Correct 258 ms 26248 KB Output is correct
45 Correct 260 ms 24484 KB Output is correct
46 Correct 172 ms 23632 KB Output is correct
47 Correct 214 ms 24928 KB Output is correct
48 Correct 326 ms 24204 KB Output is correct
49 Correct 325 ms 24712 KB Output is correct
50 Correct 166 ms 15056 KB Output is correct
51 Correct 166 ms 15112 KB Output is correct
52 Correct 326 ms 25992 KB Output is correct
53 Correct 321 ms 25480 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 856 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 856 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 496 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1212 ms 142864 KB Output is correct
8 Correct 2612 ms 291452 KB Output is correct
9 Correct 2685 ms 293020 KB Output is correct
10 Correct 2632 ms 292420 KB Output is correct
11 Correct 372 ms 147140 KB Output is correct
12 Correct 728 ms 283776 KB Output is correct
13 Correct 747 ms 293472 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 436 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 440 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 548 KB Output is correct
17 Correct 4 ms 3056 KB Output is correct
18 Correct 3 ms 2908 KB Output is correct
19 Correct 3 ms 3164 KB Output is correct
20 Correct 3 ms 2908 KB Output is correct
21 Correct 4 ms 3420 KB Output is correct
22 Correct 4 ms 3160 KB Output is correct
23 Correct 4 ms 2908 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 17 ms 4784 KB Output is correct
26 Correct 17 ms 5020 KB Output is correct
27 Correct 19 ms 5064 KB Output is correct
28 Correct 18 ms 4828 KB Output is correct
29 Correct 24 ms 4968 KB Output is correct
30 Correct 25 ms 5104 KB Output is correct
31 Correct 29 ms 4816 KB Output is correct
32 Correct 24 ms 5064 KB Output is correct
33 Correct 125 ms 24976 KB Output is correct
34 Correct 111 ms 24708 KB Output is correct
35 Correct 121 ms 24600 KB Output is correct
36 Correct 107 ms 26344 KB Output is correct
37 Correct 281 ms 26244 KB Output is correct
38 Correct 273 ms 24464 KB Output is correct
39 Correct 258 ms 26248 KB Output is correct
40 Correct 260 ms 24484 KB Output is correct
41 Correct 172 ms 23632 KB Output is correct
42 Correct 214 ms 24928 KB Output is correct
43 Correct 326 ms 24204 KB Output is correct
44 Correct 325 ms 24712 KB Output is correct
45 Correct 166 ms 15056 KB Output is correct
46 Correct 166 ms 15112 KB Output is correct
47 Correct 326 ms 25992 KB Output is correct
48 Correct 321 ms 25480 KB Output is correct
49 Correct 2 ms 856 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 1 ms 600 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 3 ms 856 KB Output is correct
54 Correct 3 ms 860 KB Output is correct
55 Correct 3 ms 856 KB Output is correct
56 Correct 2 ms 768 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 604 KB Output is correct
60 Correct 1 ms 344 KB Output is correct
61 Correct 1212 ms 142864 KB Output is correct
62 Correct 2612 ms 291452 KB Output is correct
63 Correct 2685 ms 293020 KB Output is correct
64 Correct 2632 ms 292420 KB Output is correct
65 Correct 372 ms 147140 KB Output is correct
66 Correct 728 ms 283776 KB Output is correct
67 Correct 747 ms 293472 KB Output is correct
68 Correct 1 ms 500 KB Output is correct
69 Correct 1 ms 504 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 496 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 2099 ms 333440 KB Output is correct
74 Correct 1855 ms 332928 KB Output is correct
75 Correct 2132 ms 332896 KB Output is correct
76 Correct 1911 ms 332580 KB Output is correct
77 Correct 4729 ms 334512 KB Output is correct
78 Correct 3036 ms 173660 KB Output is correct
79 Correct 2802 ms 189628 KB Output is correct
80 Execution timed out 5042 ms 309332 KB Time limit exceeded
81 Halted 0 ms 0 KB -