oj.uz

Submission #322309

# Submission time Handle Problem Language Result Execution time Memory
322309 2020-11-14T12:37:19 Z anakib1 Rectangles (IOI19_rect) C++17
50 / 100
 5000 ms 129496 KB 
//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#include "rect.h"

long long count_rectangles(std::vector<std::vector<int> > a) {
    int n = sz(a), m = sz(a[0]);
    bool s6 = 1;
    rngi(i, n) rngi(j, m) if (a[i][j] > 1)s6 = 0;
    ll ans = 0;
    if (s6) {
        vector<vi> posr(n), posc(m);
        auto b(a);
        rngi(i, n) partial_sum(all(b[i]), b[i].begin());
        rngi(i, n - 1) rngi(j, m) b[i + 1][j] += b[i][j];
        auto s = [&](int x1, int y1, int x2, int y2) {
            return b[x2][y2] - (y1?b[x2][y1 - 1]:0) - (x1?b[x1 - 1][y2]:0) + (x1 && y1 ? b[x1 - 1][y1 - 1] : 0);
        };
        auto ok = [&](int x1, int y1, int x2, int y2) {
            if (x1 > x2 || y1 > y2)return 0;
            if (s(x1, y1, x2, y2))return 0;
            if (s(x1, y1 - 1, x2, y1 - 1) != x2 - x1 + 1)return 0;
            if (s(x1, y2 + 1, x2, y2 + 1) != x2 - x1 + 1)return 0;
            if (s(x1 - 1, y1, x1 - 1, y2) != y2 - y1 + 1)return 0;
            if (s(x2 + 1, y1, x2 + 1, y2) != y2 - y1 + 1)return 0;
            return 1;
        };
        rngi(i, n) rngi(j, m) if (a[i][j] == 1) posr[i].push_back(j), posc[j].push_back(i);
        for(int i = 1; i + 1 < n; i++)
            for (int j = 1; j + 1 < m; j++) if(!a[i][j]){
                if (a[i - 1][j] != 1 || a[i][j - 1] != 1)continue;
                int x = upper_bound(all(posc[j]), i) - posc[j].begin();
                if (x >= sz(posc[j])) continue;
                x = posc[j][x];
                int y = upper_bound(all(posr[i]), j) - posr[i].begin();
                if (y >= sz(posr[i])) continue;
                y = posr[i][y];
                if (ok(i, j, x - 1, y - 1)) ans++;
            }
    }
    else if (n <= 3) {
        if (n <= 2)return 0;
        auto b(a);
        for (int i = 1; i + 1 < m; i++)
            if (a[0][i] <= a[1][i] || a[2][i] <= a[1][i]) a[1][i] = inf;
        rngi(i, m - 2) {
            int j = i + 1; int mn = a[1][j];
            while (j < m - 1 && b[1][i] > mn) {
                if(mn < b[1][j + 1]) ans++;
                j++;
                mn = max(mn, a[1][j]);
            }
        }
    }
    else {

        for(int x1 = 1; x1 < n - 1; x1++)
        for(int y1 = 1; y1 < m - 1; y1++)
        for(int x2 = x1; x2 < n - 1; x2++)
            for (int y2 = y1; y2 < m - 1; y2++) {
                bool ok = 1;
                for (int i = x1; ok && i <= x2; i++) {
                    if (!ok)break;
                    for (int j = y1; ok && j <= y2; j++) {
                        if (a[i][y1 - 1] <= a[i][j] || a[i][y2 + 1] <= a[i][j] || a[x1 - 1][j] <= a[i][j] || a[x2 + 1][j] <= a[i][j]) {
                            ok = 0; break;
                        }
                    }
                }
                ans += ok;
            }
    }
    return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:44:13: warning: overflow in conversion from 'double' to '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} changes value from '1.0e+17' to '2147483647' [-Woverflow]
   44 | #define inf 1e17
      |             ^~~~
rect.cpp:153:69: note: in expansion of macro 'inf'
  153 |             if (a[0][i] <= a[1][i] || a[2][i] <= a[1][i]) a[1][i] = inf;
      |                                                                     ^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 49 ms 492 KB Output is correct
18 Correct 50 ms 364 KB Output is correct
19 Correct 51 ms 492 KB Output is correct
20 Correct 40 ms 364 KB Output is correct
21 Correct 45 ms 364 KB Output is correct
22 Correct 45 ms 364 KB Output is correct
23 Correct 45 ms 364 KB Output is correct
24 Correct 11 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 49 ms 492 KB Output is correct
18 Correct 50 ms 364 KB Output is correct
19 Correct 51 ms 492 KB Output is correct
20 Correct 40 ms 364 KB Output is correct
21 Correct 45 ms 364 KB Output is correct
22 Correct 45 ms 364 KB Output is correct
23 Correct 45 ms 364 KB Output is correct
24 Correct 11 ms 364 KB Output is correct
25 Correct 1860 ms 1004 KB Output is correct
26 Correct 1839 ms 1004 KB Output is correct
27 Correct 1858 ms 1132 KB Output is correct
28 Correct 1617 ms 876 KB Output is correct
29 Correct 1868 ms 844 KB Output is correct
30 Correct 1850 ms 1132 KB Output is correct
31 Correct 1782 ms 980 KB Output is correct
32 Correct 1727 ms 1008 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 0 ms 364 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 49 ms 492 KB Output is correct
18 Correct 50 ms 364 KB Output is correct
19 Correct 51 ms 492 KB Output is correct
20 Correct 40 ms 364 KB Output is correct
21 Correct 45 ms 364 KB Output is correct
22 Correct 45 ms 364 KB Output is correct
23 Correct 45 ms 364 KB Output is correct
24 Correct 11 ms 364 KB Output is correct
25 Correct 1860 ms 1004 KB Output is correct
26 Correct 1839 ms 1004 KB Output is correct
27 Correct 1858 ms 1132 KB Output is correct
28 Correct 1617 ms 876 KB Output is correct
29 Correct 1868 ms 844 KB Output is correct
30 Correct 1850 ms 1132 KB Output is correct
31 Correct 1782 ms 980 KB Output is correct
32 Correct 1727 ms 1008 KB Output is correct
33 Execution timed out 5061 ms 7404 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 492 KB Output is correct
2 Correct 4 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 209 ms 60140 KB Output is correct
3 Correct 450 ms 128620 KB Output is correct
4 Correct 454 ms 129496 KB Output is correct
5 Correct 453 ms 129388 KB Output is correct
6 Correct 88 ms 42860 KB Output is correct
7 Correct 144 ms 81084 KB Output is correct
8 Correct 148 ms 86380 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 49 ms 492 KB Output is correct
18 Correct 50 ms 364 KB Output is correct
19 Correct 51 ms 492 KB Output is correct
20 Correct 40 ms 364 KB Output is correct
21 Correct 45 ms 364 KB Output is correct
22 Correct 45 ms 364 KB Output is correct
23 Correct 45 ms 364 KB Output is correct
24 Correct 11 ms 364 KB Output is correct
25 Correct 1860 ms 1004 KB Output is correct
26 Correct 1839 ms 1004 KB Output is correct
27 Correct 1858 ms 1132 KB Output is correct
28 Correct 1617 ms 876 KB Output is correct
29 Correct 1868 ms 844 KB Output is correct
30 Correct 1850 ms 1132 KB Output is correct
31 Correct 1782 ms 980 KB Output is correct
32 Correct 1727 ms 1008 KB Output is correct
33 Execution timed out 5061 ms 7404 KB Time limit exceeded
34 Halted 0 ms 0 KB -