oj.uz

Submission #289807

# Submission time Handle Problem Language Result Execution time Memory
289807 2020-09-03T05:18:10 Z Mercenary Rectangles (IOI19_rect) C++14
100 / 100
 3732 ms 820336 KB 
#include "rect.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2505;
const int lim = 50;

vector<ii> valA[maxn][maxn] , valB[maxn][maxn];

int m , n;

int h[maxn][maxn];
int L[maxn][maxn] , R[maxn][maxn] , U[maxn][maxn] , D[maxn][maxn];

void init(int key){
    vector<int> s(maxn , 0);
    int sz = 0;
    auto add = [&](vector<ii> & val , int j){
        if(val.size() && val.back().first + val.back().second == j)val.back().second++;
        else {
            if(val.size() && val.back().second <= lim)val.back() = mp(j , 1);
            else val.pb(mp(j,1));
        }
    };
    for(int i = 1 ; i <= m ; ++i){
        sz = 0;
        for(int j = 1 ; j <= n ; ++j){
            while(sz > 0 && h[i][s[sz - 1]] + key <= h[i][j])sz--;
            if(sz > 0)L[i][j] = s[sz - 1];
            else L[i][j] = 0;
            s[sz++] = j;
        }
        sz = 0;
        for(int j = n ; j >= 1 ; --j){
            while(sz > 0 && h[i][s[sz - 1]] + key <= h[i][j])sz--;
            if(sz > 0)R[i][j] = s[sz - 1];
            else R[i][j] = n + 1;
            s[sz++] = j;
            if(key){
                if(L[i][j] != 0)add(valA[L[i][j]][j] , i);
                if(R[i][j] != n + 1 && L[i][R[i][j]] != j)add(valA[j][R[i][j]] , i);
            }
        }
    }
    for(int j = 1 ; j <= n ; ++j){
        sz = 0;
        for(int i = 1 ; i <= m ; ++i){
            while(sz > 0 && h[s[sz - 1]][j] + key <= h[i][j])sz--;
            if(sz > 0)U[i][j] = s[sz - 1];
            else U[i][j] = 0;
            s[sz++] = i;
        }
        sz = 0;
        for(int i = m ; i >= 1 ; --i){
            while(sz > 0 && h[s[sz - 1]][j] + key <= h[i][j])sz--;
            if(sz > 0)D[i][j] = s[sz - 1];
            else D[i][j] = m + 1;
            s[sz++] = i;
            if(key){
                if(U[i][j] != 0)add(valB[U[i][j]][i], j);
                if(D[i][j] != m + 1 && U[D[i][j]][j] != i)add(valB[i][D[i][j]] , j);
            }
        }
    }
}
vector<ii> val[maxn][maxn];
int cnt[maxn][maxn];

long long count_rectangles(std::vector<std::vector<int> > a) {
    m = a.size();n = a[0].size();
    for(int i = 1 ; i <= m ; ++i)for(int j = 1 ; j <= n ; ++j)h[i][j] = a[i - 1][j - 1];
    init(0);
    for(int i = 2 ; i < m ; ++i){
        for(int j = 2 ; j < n ; ++j){
            if(L[i][j] && U[i][j] && R[i][j] <= n && D[i][j] <= m){
                val[L[i][j]][R[i][j]].pb(mp(U[i][j] , D[i][j]));
            }
        }
    }
    init(1);
    int res = 0;
    for(int L = 1 ; L <= n ;  ++L){
        for(int R = L + 2 ; R <= n ; ++R){
            for(auto & [U , D] : val[L][R]){
                if(cnt[U][D]++ == 0){
                    auto checkA = [&](int L , int R , int U , int D)->bool{
                        if(::R[U][L] < R || ::L[U][R] > L)return 0;
                        if(D - U + 1 <= lim){
                            for(int i = U ; i <= D ; ++i){
                                if(::R[i][L] < R || ::L[i][R] > L){
                                    return 0;
                                }
                            }
                            return 1;
                        }
                        auto it = upper_bound(valA[L][R].begin(),valA[L][R].end(),mp(U + 1 , 0))-valA[L][R].begin()-1;
                        if(it < 0 || valA[L][R][it].first + valA[L][R][it].second <= D)return 0;
                        return 1;
                    };
                    auto checkB = [&](int L , int R , int U , int D)->bool{
                        if(::D[L][U] < R || ::U[R][U] > L)return 0;
                        if(D - U + 1 <= lim){
                            for(int i = U ; i <= D ; ++i){
                                if(::D[L][i] < R || ::U[R][i] > L){
                                    return 0;
                                }
                            }
                            return 1;
                        }
                        auto it = lower_bound(valB[L][R].begin(),valB[L][R].end(),mp(U+1,0))-valB[L][R].begin()-1;
                        if(it < 0 || valB[L][R][it].first + valB[L][R][it].second <= D)return 0;
                        return 1;
                    };
                    if(checkA(L , R , U + 1 , D - 1) && checkB(U , D , L + 1 , R - 1)){
                        res++;
                    }
                }
            }
            for(auto & [U , D] : val[L][R]){
                cnt[U][D] = 0;
            }
        }
    }
    return res;
}

#ifdef LOCAL
#include "rect.h"
#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>

using namespace std;

class InputReader {
private:
	static const int SIZE = 4096;

	int inputFileDescriptor;
	char buf[SIZE];
	int curChar;
	int numChars;

public:

	inline InputReader(int _inputFileDescriptor):
		inputFileDescriptor(_inputFileDescriptor),
		curChar(0),
		numChars(0) {
	}

	inline void close() {
		::close(inputFileDescriptor);
	}

	inline char read() {
		assert(numChars != -1);
		if (curChar >= numChars) {
			curChar = 0;
			numChars = ::read(inputFileDescriptor, buf, SIZE);
			if (numChars == -1)
				return -1;
		}
		return buf[curChar++];
	}

	inline int readInt() {
		int c = eatWhite();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			assert(c >= '0' && c <= '9');
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	inline string readString() {
		char c = eatWhite();
		string res;
		do {
			res += c;
			c = read();
		} while (!isSpaceChar(c));
		return res;
	}

	inline string readLine() {
		string res;
		while (true) {
			char c = read();
			if (c == '\n' || c == '\r' || c == -1)
				break;
			res += c;
		}
		return res;
	}

	inline char eatWhite() {
		char c = read();
		while (isSpaceChar(c))
			c = read();
		return c;
	}

	static inline bool isSpaceChar(char c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
};


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
	InputReader inputReader(STDIN_FILENO);
	int n, m;
	n = inputReader.readInt();
	m = inputReader.readInt();
	vector<vector<int>> a(n, vector<int>(m));
	for (int i = 0; i < n; i++)	{
		for (int j = 0; j < m; j++) {
			a[i][j] = inputReader.readInt();
		}
	}
	inputReader.close();

	long long result = count_rectangles(a);

	printf("%lld\n", result);
	fclose(stdout);
	return 0;
}

#endif // LOCAL

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:97:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   97 |             for(auto & [U , D] : val[L][R]){
      |                        ^
rect.cpp:132:24: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  132 |             for(auto & [U , D] : val[L][R]){
      |                        ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 442584 KB Output is correct
2 Correct 304 ms 443132 KB Output is correct
3 Correct 292 ms 443128 KB Output is correct
4 Correct 300 ms 443128 KB Output is correct
5 Correct 292 ms 443128 KB Output is correct
6 Correct 337 ms 443128 KB Output is correct
7 Correct 300 ms 443256 KB Output is correct
8 Correct 294 ms 442744 KB Output is correct
9 Correct 294 ms 443128 KB Output is correct
10 Correct 296 ms 443256 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 312 ms 443256 KB Output is correct
13 Correct 292 ms 442488 KB Output is correct
14 Correct 297 ms 442616 KB Output is correct
15 Correct 295 ms 442616 KB Output is correct
16 Correct 298 ms 442488 KB Output is correct
17 Correct 298 ms 442488 KB Output is correct
18 Correct 290 ms 442488 KB Output is correct
19 Correct 294 ms 443128 KB Output is correct
20 Correct 296 ms 443180 KB Output is correct
21 Correct 293 ms 442616 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 442584 KB Output is correct
2 Correct 304 ms 443132 KB Output is correct
3 Correct 292 ms 443128 KB Output is correct
4 Correct 300 ms 443128 KB Output is correct
5 Correct 292 ms 443128 KB Output is correct
6 Correct 337 ms 443128 KB Output is correct
7 Correct 300 ms 443256 KB Output is correct
8 Correct 294 ms 442744 KB Output is correct
9 Correct 294 ms 443128 KB Output is correct
10 Correct 296 ms 443256 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 312 ms 443256 KB Output is correct
13 Correct 292 ms 442488 KB Output is correct
14 Correct 297 ms 442616 KB Output is correct
15 Correct 295 ms 442616 KB Output is correct
16 Correct 298 ms 442488 KB Output is correct
17 Correct 300 ms 444636 KB Output is correct
18 Correct 297 ms 444596 KB Output is correct
19 Correct 299 ms 444664 KB Output is correct
20 Correct 301 ms 444608 KB Output is correct
21 Correct 300 ms 444792 KB Output is correct
22 Correct 297 ms 444664 KB Output is correct
23 Correct 297 ms 444664 KB Output is correct
24 Correct 298 ms 444664 KB Output is correct
25 Correct 298 ms 442488 KB Output is correct
26 Correct 290 ms 442488 KB Output is correct
27 Correct 294 ms 443128 KB Output is correct
28 Correct 296 ms 443180 KB Output is correct
29 Correct 293 ms 442616 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 442584 KB Output is correct
2 Correct 304 ms 443132 KB Output is correct
3 Correct 292 ms 443128 KB Output is correct
4 Correct 300 ms 443128 KB Output is correct
5 Correct 292 ms 443128 KB Output is correct
6 Correct 337 ms 443128 KB Output is correct
7 Correct 300 ms 443256 KB Output is correct
8 Correct 294 ms 442744 KB Output is correct
9 Correct 294 ms 443128 KB Output is correct
10 Correct 296 ms 443256 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 312 ms 443256 KB Output is correct
13 Correct 292 ms 442488 KB Output is correct
14 Correct 297 ms 442616 KB Output is correct
15 Correct 295 ms 442616 KB Output is correct
16 Correct 298 ms 442488 KB Output is correct
17 Correct 300 ms 444636 KB Output is correct
18 Correct 297 ms 444596 KB Output is correct
19 Correct 299 ms 444664 KB Output is correct
20 Correct 301 ms 444608 KB Output is correct
21 Correct 300 ms 444792 KB Output is correct
22 Correct 297 ms 444664 KB Output is correct
23 Correct 297 ms 444664 KB Output is correct
24 Correct 298 ms 444664 KB Output is correct
25 Correct 307 ms 448812 KB Output is correct
26 Correct 308 ms 448884 KB Output is correct
27 Correct 308 ms 448892 KB Output is correct
28 Correct 310 ms 448788 KB Output is correct
29 Correct 311 ms 449260 KB Output is correct
30 Correct 311 ms 449324 KB Output is correct
31 Correct 309 ms 449144 KB Output is correct
32 Correct 311 ms 449144 KB Output is correct
33 Correct 298 ms 442488 KB Output is correct
34 Correct 290 ms 442488 KB Output is correct
35 Correct 294 ms 443128 KB Output is correct
36 Correct 296 ms 443180 KB Output is correct
37 Correct 293 ms 442616 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 442584 KB Output is correct
2 Correct 304 ms 443132 KB Output is correct
3 Correct 292 ms 443128 KB Output is correct
4 Correct 300 ms 443128 KB Output is correct
5 Correct 292 ms 443128 KB Output is correct
6 Correct 337 ms 443128 KB Output is correct
7 Correct 300 ms 443256 KB Output is correct
8 Correct 294 ms 442744 KB Output is correct
9 Correct 294 ms 443128 KB Output is correct
10 Correct 296 ms 443256 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 312 ms 443256 KB Output is correct
13 Correct 292 ms 442488 KB Output is correct
14 Correct 297 ms 442616 KB Output is correct
15 Correct 295 ms 442616 KB Output is correct
16 Correct 298 ms 442488 KB Output is correct
17 Correct 300 ms 444636 KB Output is correct
18 Correct 297 ms 444596 KB Output is correct
19 Correct 299 ms 444664 KB Output is correct
20 Correct 301 ms 444608 KB Output is correct
21 Correct 300 ms 444792 KB Output is correct
22 Correct 297 ms 444664 KB Output is correct
23 Correct 297 ms 444664 KB Output is correct
24 Correct 298 ms 444664 KB Output is correct
25 Correct 307 ms 448812 KB Output is correct
26 Correct 308 ms 448884 KB Output is correct
27 Correct 308 ms 448892 KB Output is correct
28 Correct 310 ms 448788 KB Output is correct
29 Correct 311 ms 449260 KB Output is correct
30 Correct 311 ms 449324 KB Output is correct
31 Correct 309 ms 449144 KB Output is correct
32 Correct 311 ms 449144 KB Output is correct
33 Correct 456 ms 488328 KB Output is correct
34 Correct 444 ms 488312 KB Output is correct
35 Correct 449 ms 488312 KB Output is correct
36 Correct 428 ms 488312 KB Output is correct
37 Correct 488 ms 478840 KB Output is correct
38 Correct 494 ms 478588 KB Output is correct
39 Correct 510 ms 478584 KB Output is correct
40 Correct 483 ms 476668 KB Output is correct
41 Correct 437 ms 476024 KB Output is correct
42 Correct 449 ms 477048 KB Output is correct
43 Correct 512 ms 481408 KB Output is correct
44 Correct 522 ms 481528 KB Output is correct
45 Correct 406 ms 470904 KB Output is correct
46 Correct 398 ms 462456 KB Output is correct
47 Correct 496 ms 479608 KB Output is correct
48 Correct 494 ms 479608 KB Output is correct
49 Correct 298 ms 442488 KB Output is correct
50 Correct 290 ms 442488 KB Output is correct
51 Correct 294 ms 443128 KB Output is correct
52 Correct 296 ms 443180 KB Output is correct
53 Correct 293 ms 442616 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 443064 KB Output is correct
2 Correct 304 ms 442872 KB Output is correct
3 Correct 307 ms 442744 KB Output is correct
4 Correct 295 ms 442492 KB Output is correct
5 Correct 306 ms 443000 KB Output is correct
6 Correct 308 ms 443000 KB Output is correct
7 Correct 303 ms 443004 KB Output is correct
8 Correct 303 ms 443000 KB Output is correct
9 Correct 308 ms 442976 KB Output is correct
10 Correct 303 ms 442744 KB Output is correct
11 Correct 309 ms 442872 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 298 ms 442616 KB Output is correct
2 Correct 1236 ms 549496 KB Output is correct
3 Correct 2377 ms 664056 KB Output is correct
4 Correct 2413 ms 665688 KB Output is correct
5 Correct 2412 ms 665104 KB Output is correct
6 Correct 978 ms 527636 KB Output is correct
7 Correct 1653 ms 612216 KB Output is correct
8 Correct 1751 ms 615348 KB Output is correct
9 Correct 298 ms 442488 KB Output is correct
10 Correct 290 ms 442488 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 296 ms 443180 KB Output is correct
13 Correct 293 ms 442616 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 442584 KB Output is correct
2 Correct 304 ms 443132 KB Output is correct
3 Correct 292 ms 443128 KB Output is correct
4 Correct 300 ms 443128 KB Output is correct
5 Correct 292 ms 443128 KB Output is correct
6 Correct 337 ms 443128 KB Output is correct
7 Correct 300 ms 443256 KB Output is correct
8 Correct 294 ms 442744 KB Output is correct
9 Correct 294 ms 443128 KB Output is correct
10 Correct 296 ms 443256 KB Output is correct
11 Correct 294 ms 443128 KB Output is correct
12 Correct 312 ms 443256 KB Output is correct
13 Correct 292 ms 442488 KB Output is correct
14 Correct 297 ms 442616 KB Output is correct
15 Correct 295 ms 442616 KB Output is correct
16 Correct 298 ms 442488 KB Output is correct
17 Correct 300 ms 444636 KB Output is correct
18 Correct 297 ms 444596 KB Output is correct
19 Correct 299 ms 444664 KB Output is correct
20 Correct 301 ms 444608 KB Output is correct
21 Correct 300 ms 444792 KB Output is correct
22 Correct 297 ms 444664 KB Output is correct
23 Correct 297 ms 444664 KB Output is correct
24 Correct 298 ms 444664 KB Output is correct
25 Correct 307 ms 448812 KB Output is correct
26 Correct 308 ms 448884 KB Output is correct
27 Correct 308 ms 448892 KB Output is correct
28 Correct 310 ms 448788 KB Output is correct
29 Correct 311 ms 449260 KB Output is correct
30 Correct 311 ms 449324 KB Output is correct
31 Correct 309 ms 449144 KB Output is correct
32 Correct 311 ms 449144 KB Output is correct
33 Correct 456 ms 488328 KB Output is correct
34 Correct 444 ms 488312 KB Output is correct
35 Correct 449 ms 488312 KB Output is correct
36 Correct 428 ms 488312 KB Output is correct
37 Correct 488 ms 478840 KB Output is correct
38 Correct 494 ms 478588 KB Output is correct
39 Correct 510 ms 478584 KB Output is correct
40 Correct 483 ms 476668 KB Output is correct
41 Correct 437 ms 476024 KB Output is correct
42 Correct 449 ms 477048 KB Output is correct
43 Correct 512 ms 481408 KB Output is correct
44 Correct 522 ms 481528 KB Output is correct
45 Correct 406 ms 470904 KB Output is correct
46 Correct 398 ms 462456 KB Output is correct
47 Correct 496 ms 479608 KB Output is correct
48 Correct 494 ms 479608 KB Output is correct
49 Correct 306 ms 443064 KB Output is correct
50 Correct 304 ms 442872 KB Output is correct
51 Correct 307 ms 442744 KB Output is correct
52 Correct 295 ms 442492 KB Output is correct
53 Correct 306 ms 443000 KB Output is correct
54 Correct 308 ms 443000 KB Output is correct
55 Correct 303 ms 443004 KB Output is correct
56 Correct 303 ms 443000 KB Output is correct
57 Correct 308 ms 442976 KB Output is correct
58 Correct 303 ms 442744 KB Output is correct
59 Correct 309 ms 442872 KB Output is correct
60 Correct 298 ms 442616 KB Output is correct
61 Correct 1236 ms 549496 KB Output is correct
62 Correct 2377 ms 664056 KB Output is correct
63 Correct 2413 ms 665688 KB Output is correct
64 Correct 2412 ms 665104 KB Output is correct
65 Correct 978 ms 527636 KB Output is correct
66 Correct 1653 ms 612216 KB Output is correct
67 Correct 1751 ms 615348 KB Output is correct
68 Correct 2917 ms 820336 KB Output is correct
69 Correct 2701 ms 820312 KB Output is correct
70 Correct 2567 ms 820220 KB Output is correct
71 Correct 2263 ms 820088 KB Output is correct
72 Correct 3352 ms 693976 KB Output is correct
73 Correct 2248 ms 608888 KB Output is correct
74 Correct 2445 ms 668280 KB Output is correct
75 Correct 3598 ms 715020 KB Output is correct
76 Correct 2297 ms 610648 KB Output is correct
77 Correct 3019 ms 691660 KB Output is correct
78 Correct 3732 ms 718820 KB Output is correct
79 Correct 2109 ms 597580 KB Output is correct
80 Correct 3421 ms 702712 KB Output is correct
81 Correct 3309 ms 695748 KB Output is correct
82 Correct 2172 ms 646608 KB Output is correct
83 Correct 3370 ms 694092 KB Output is correct
84 Correct 3409 ms 694048 KB Output is correct
85 Correct 3361 ms 694116 KB Output is correct
86 Correct 298 ms 442488 KB Output is correct
87 Correct 290 ms 442488 KB Output is correct
88 Correct 294 ms 443128 KB Output is correct
89 Correct 296 ms 443180 KB Output is correct
90 Correct 293 ms 442616 KB Output is correct