oj.uz

Submission #289516

# Submission time Handle Problem Language Result Execution time Memory
289516 2020-09-02T17:32:44 Z Mercenary Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 739064 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;

vector<int> 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;
    for(int i = 1 ; i <= m ; ++i){
        s.clear();
        for(int j = 1 ; j <= n ; ++j){
            while(s.size() && h[i][s.back()] + key <= h[i][j])s.pop_back();
            if(s.size())L[i][j] = s.back();
            else L[i][j] = 0;
            s.pb(j);
        }
        s.clear();
        for(int j = n ; j >= 1 ; --j){
            while(s.size() && h[i][s.back()] + key <= h[i][j])s.pop_back();
            if(s.size())R[i][j] = s.back();
            else R[i][j] = n + 1;
            s.pb(j);
        }
        if(!key)continue;
        for(int j = 1 ; j <= n ; ++j){
            if(L[i][j] != 0)valA[L[i][j]][j].pb(i);
            if(R[i][j] != n + 1 && L[i][R[i][j]] != j)valA[j][R[i][j]].pb(i);
        }
    }
    for(int j = 1 ; j <= n ; ++j){
        s.clear();
        for(int i = 1 ; i <= m ; ++i){
            while(s.size() && h[s.back()][j] + key <= h[i][j])s.pop_back();
            if(s.size())U[i][j] = s.back();
            else U[i][j] = 0;
            s.pb(i);
        }
        s.clear();
        for(int i = m ; i >= 1 ; --i){
            while(s.size() && h[s.back()][j] + key <= h[i][j])s.pop_back();
            if(s.size())D[i][j] = s.back();
            else D[i][j] = m + 1;
            s.pb(i);
        }
        if(!key)continue;
        for(int i = 1 ; i <= m ; ++i){
            if(U[i][j] != 0)valB[U[i][j]][i].pb(j);
            if(D[i][j] != m + 1 && U[D[i][j]][j] != i)valB[i][D[i][j]].pb(j);
        }
    }
}
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);
    vector<array<int,4>> val;
    for(int i = 1 ; i <= m ; ++i){
        for(int j = 1 ; j <= n ; ++j){
            array<int,4> cur = {L[i][j] , R[i][j] , U[i][j] , D[i][j]};
            if(L[i][j] && U[i][j] && R[i][j] <= n && D[i][j] <= m)val.pb(cur);
        }
    }
    init(1);
    sort(val.begin(),val.end());
    int res = 0;
    for(int i = 0 ; i < val.size() ; ++i){
        if(i > 0 && val[i] == val[i - 1])continue;
        int L = val[i][0] , R = val[i][1] , U = val[i][2] , D = val[i][3];
        auto check = [&](vector<int> & val , int L , int R)->int{
            auto it = lower_bound(val.begin(),val.end(),L)-val.begin();
            if(it + R - L >= val.size() || val[it] != L || val[it + R - L] != R)return 0;
            return 1;
        };
        if(check(valA[L][R] , U + 1 , D - 1) && check(valB[U][D] , L + 1 , R - 1)){
            res++;
        }
    }
    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:86:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 4> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i = 0 ; i < val.size() ; ++i){
      |                     ~~^~~~~~~~~~~~
rect.cpp: In lambda function:
rect.cpp:91:27: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |             if(it + R - L >= val.size() || val[it] != L || val[it + R - L] != R)return 0;
      |                ~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 295288 KB Output is correct
2 Correct 201 ms 295672 KB Output is correct
3 Correct 199 ms 295672 KB Output is correct
4 Correct 196 ms 295672 KB Output is correct
5 Correct 195 ms 295672 KB Output is correct
6 Correct 196 ms 295672 KB Output is correct
7 Correct 230 ms 295672 KB Output is correct
8 Correct 197 ms 295292 KB Output is correct
9 Correct 229 ms 295672 KB Output is correct
10 Correct 194 ms 295672 KB Output is correct
11 Correct 210 ms 295800 KB Output is correct
12 Correct 204 ms 295672 KB Output is correct
13 Correct 202 ms 295032 KB Output is correct
14 Correct 209 ms 295288 KB Output is correct
15 Correct 211 ms 295416 KB Output is correct
16 Correct 201 ms 295160 KB Output is correct
17 Correct 197 ms 295032 KB Output is correct
18 Correct 201 ms 295160 KB Output is correct
19 Correct 205 ms 295672 KB Output is correct
20 Correct 202 ms 295672 KB Output is correct
21 Correct 201 ms 295288 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 295288 KB Output is correct
2 Correct 201 ms 295672 KB Output is correct
3 Correct 199 ms 295672 KB Output is correct
4 Correct 196 ms 295672 KB Output is correct
5 Correct 195 ms 295672 KB Output is correct
6 Correct 196 ms 295672 KB Output is correct
7 Correct 230 ms 295672 KB Output is correct
8 Correct 197 ms 295292 KB Output is correct
9 Correct 229 ms 295672 KB Output is correct
10 Correct 194 ms 295672 KB Output is correct
11 Correct 210 ms 295800 KB Output is correct
12 Correct 204 ms 295672 KB Output is correct
13 Correct 202 ms 295032 KB Output is correct
14 Correct 209 ms 295288 KB Output is correct
15 Correct 211 ms 295416 KB Output is correct
16 Correct 201 ms 295160 KB Output is correct
17 Correct 201 ms 297084 KB Output is correct
18 Correct 205 ms 297208 KB Output is correct
19 Correct 199 ms 297208 KB Output is correct
20 Correct 201 ms 297080 KB Output is correct
21 Correct 206 ms 297080 KB Output is correct
22 Correct 201 ms 297080 KB Output is correct
23 Correct 200 ms 297080 KB Output is correct
24 Correct 198 ms 296824 KB Output is correct
25 Correct 197 ms 295032 KB Output is correct
26 Correct 201 ms 295160 KB Output is correct
27 Correct 205 ms 295672 KB Output is correct
28 Correct 202 ms 295672 KB Output is correct
29 Correct 201 ms 295288 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 295288 KB Output is correct
2 Correct 201 ms 295672 KB Output is correct
3 Correct 199 ms 295672 KB Output is correct
4 Correct 196 ms 295672 KB Output is correct
5 Correct 195 ms 295672 KB Output is correct
6 Correct 196 ms 295672 KB Output is correct
7 Correct 230 ms 295672 KB Output is correct
8 Correct 197 ms 295292 KB Output is correct
9 Correct 229 ms 295672 KB Output is correct
10 Correct 194 ms 295672 KB Output is correct
11 Correct 210 ms 295800 KB Output is correct
12 Correct 204 ms 295672 KB Output is correct
13 Correct 202 ms 295032 KB Output is correct
14 Correct 209 ms 295288 KB Output is correct
15 Correct 211 ms 295416 KB Output is correct
16 Correct 201 ms 295160 KB Output is correct
17 Correct 201 ms 297084 KB Output is correct
18 Correct 205 ms 297208 KB Output is correct
19 Correct 199 ms 297208 KB Output is correct
20 Correct 201 ms 297080 KB Output is correct
21 Correct 206 ms 297080 KB Output is correct
22 Correct 201 ms 297080 KB Output is correct
23 Correct 200 ms 297080 KB Output is correct
24 Correct 198 ms 296824 KB Output is correct
25 Correct 217 ms 301680 KB Output is correct
26 Correct 219 ms 301680 KB Output is correct
27 Correct 218 ms 301680 KB Output is correct
28 Correct 214 ms 301300 KB Output is correct
29 Correct 221 ms 301936 KB Output is correct
30 Correct 226 ms 301808 KB Output is correct
31 Correct 226 ms 301680 KB Output is correct
32 Correct 220 ms 301680 KB Output is correct
33 Correct 197 ms 295032 KB Output is correct
34 Correct 201 ms 295160 KB Output is correct
35 Correct 205 ms 295672 KB Output is correct
36 Correct 202 ms 295672 KB Output is correct
37 Correct 201 ms 295288 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 295288 KB Output is correct
2 Correct 201 ms 295672 KB Output is correct
3 Correct 199 ms 295672 KB Output is correct
4 Correct 196 ms 295672 KB Output is correct
5 Correct 195 ms 295672 KB Output is correct
6 Correct 196 ms 295672 KB Output is correct
7 Correct 230 ms 295672 KB Output is correct
8 Correct 197 ms 295292 KB Output is correct
9 Correct 229 ms 295672 KB Output is correct
10 Correct 194 ms 295672 KB Output is correct
11 Correct 210 ms 295800 KB Output is correct
12 Correct 204 ms 295672 KB Output is correct
13 Correct 202 ms 295032 KB Output is correct
14 Correct 209 ms 295288 KB Output is correct
15 Correct 211 ms 295416 KB Output is correct
16 Correct 201 ms 295160 KB Output is correct
17 Correct 201 ms 297084 KB Output is correct
18 Correct 205 ms 297208 KB Output is correct
19 Correct 199 ms 297208 KB Output is correct
20 Correct 201 ms 297080 KB Output is correct
21 Correct 206 ms 297080 KB Output is correct
22 Correct 201 ms 297080 KB Output is correct
23 Correct 200 ms 297080 KB Output is correct
24 Correct 198 ms 296824 KB Output is correct
25 Correct 217 ms 301680 KB Output is correct
26 Correct 219 ms 301680 KB Output is correct
27 Correct 218 ms 301680 KB Output is correct
28 Correct 214 ms 301300 KB Output is correct
29 Correct 221 ms 301936 KB Output is correct
30 Correct 226 ms 301808 KB Output is correct
31 Correct 226 ms 301680 KB Output is correct
32 Correct 220 ms 301680 KB Output is correct
33 Correct 419 ms 343804 KB Output is correct
34 Correct 409 ms 343800 KB Output is correct
35 Correct 405 ms 343800 KB Output is correct
36 Correct 390 ms 343928 KB Output is correct
37 Correct 549 ms 341868 KB Output is correct
38 Correct 545 ms 341716 KB Output is correct
39 Correct 562 ms 341584 KB Output is correct
40 Correct 527 ms 338900 KB Output is correct
41 Correct 415 ms 333788 KB Output is correct
42 Correct 452 ms 335952 KB Output is correct
43 Correct 565 ms 342228 KB Output is correct
44 Correct 571 ms 342352 KB Output is correct
45 Correct 379 ms 325936 KB Output is correct
46 Correct 373 ms 319072 KB Output is correct
47 Correct 542 ms 341072 KB Output is correct
48 Correct 549 ms 341328 KB Output is correct
49 Correct 197 ms 295032 KB Output is correct
50 Correct 201 ms 295160 KB Output is correct
51 Correct 205 ms 295672 KB Output is correct
52 Correct 202 ms 295672 KB Output is correct
53 Correct 201 ms 295288 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 295508 KB Output is correct
2 Correct 199 ms 295544 KB Output is correct
3 Correct 199 ms 295416 KB Output is correct
4 Correct 202 ms 295160 KB Output is correct
5 Correct 203 ms 295672 KB Output is correct
6 Correct 200 ms 295672 KB Output is correct
7 Correct 203 ms 295672 KB Output is correct
8 Correct 204 ms 295672 KB Output is correct
9 Correct 205 ms 295672 KB Output is correct
10 Correct 203 ms 295288 KB Output is correct
11 Correct 203 ms 295548 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 295288 KB Output is correct
2 Correct 1576 ms 447564 KB Output is correct
3 Correct 3307 ms 611708 KB Output is correct
4 Correct 3336 ms 613212 KB Output is correct
5 Correct 3366 ms 613296 KB Output is correct
6 Correct 1153 ms 418680 KB Output is correct
7 Correct 2037 ms 537720 KB Output is correct
8 Correct 2154 ms 543612 KB Output is correct
9 Correct 197 ms 295032 KB Output is correct
10 Correct 201 ms 295160 KB Output is correct
11 Correct 205 ms 295672 KB Output is correct
12 Correct 202 ms 295672 KB Output is correct
13 Correct 201 ms 295288 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 295288 KB Output is correct
2 Correct 201 ms 295672 KB Output is correct
3 Correct 199 ms 295672 KB Output is correct
4 Correct 196 ms 295672 KB Output is correct
5 Correct 195 ms 295672 KB Output is correct
6 Correct 196 ms 295672 KB Output is correct
7 Correct 230 ms 295672 KB Output is correct
8 Correct 197 ms 295292 KB Output is correct
9 Correct 229 ms 295672 KB Output is correct
10 Correct 194 ms 295672 KB Output is correct
11 Correct 210 ms 295800 KB Output is correct
12 Correct 204 ms 295672 KB Output is correct
13 Correct 202 ms 295032 KB Output is correct
14 Correct 209 ms 295288 KB Output is correct
15 Correct 211 ms 295416 KB Output is correct
16 Correct 201 ms 295160 KB Output is correct
17 Correct 201 ms 297084 KB Output is correct
18 Correct 205 ms 297208 KB Output is correct
19 Correct 199 ms 297208 KB Output is correct
20 Correct 201 ms 297080 KB Output is correct
21 Correct 206 ms 297080 KB Output is correct
22 Correct 201 ms 297080 KB Output is correct
23 Correct 200 ms 297080 KB Output is correct
24 Correct 198 ms 296824 KB Output is correct
25 Correct 217 ms 301680 KB Output is correct
26 Correct 219 ms 301680 KB Output is correct
27 Correct 218 ms 301680 KB Output is correct
28 Correct 214 ms 301300 KB Output is correct
29 Correct 221 ms 301936 KB Output is correct
30 Correct 226 ms 301808 KB Output is correct
31 Correct 226 ms 301680 KB Output is correct
32 Correct 220 ms 301680 KB Output is correct
33 Correct 419 ms 343804 KB Output is correct
34 Correct 409 ms 343800 KB Output is correct
35 Correct 405 ms 343800 KB Output is correct
36 Correct 390 ms 343928 KB Output is correct
37 Correct 549 ms 341868 KB Output is correct
38 Correct 545 ms 341716 KB Output is correct
39 Correct 562 ms 341584 KB Output is correct
40 Correct 527 ms 338900 KB Output is correct
41 Correct 415 ms 333788 KB Output is correct
42 Correct 452 ms 335952 KB Output is correct
43 Correct 565 ms 342228 KB Output is correct
44 Correct 571 ms 342352 KB Output is correct
45 Correct 379 ms 325936 KB Output is correct
46 Correct 373 ms 319072 KB Output is correct
47 Correct 542 ms 341072 KB Output is correct
48 Correct 549 ms 341328 KB Output is correct
49 Correct 205 ms 295508 KB Output is correct
50 Correct 199 ms 295544 KB Output is correct
51 Correct 199 ms 295416 KB Output is correct
52 Correct 202 ms 295160 KB Output is correct
53 Correct 203 ms 295672 KB Output is correct
54 Correct 200 ms 295672 KB Output is correct
55 Correct 203 ms 295672 KB Output is correct
56 Correct 204 ms 295672 KB Output is correct
57 Correct 205 ms 295672 KB Output is correct
58 Correct 203 ms 295288 KB Output is correct
59 Correct 203 ms 295548 KB Output is correct
60 Correct 202 ms 295288 KB Output is correct
61 Correct 1576 ms 447564 KB Output is correct
62 Correct 3307 ms 611708 KB Output is correct
63 Correct 3336 ms 613212 KB Output is correct
64 Correct 3366 ms 613296 KB Output is correct
65 Correct 1153 ms 418680 KB Output is correct
66 Correct 2037 ms 537720 KB Output is correct
67 Correct 2154 ms 543612 KB Output is correct
68 Correct 3440 ms 739064 KB Output is correct
69 Correct 3282 ms 736584 KB Output is correct
70 Correct 3155 ms 736304 KB Output is correct
71 Correct 2894 ms 736504 KB Output is correct
72 Execution timed out 5116 ms 713972 KB Time limit exceeded
73 Halted 0 ms 0 KB -