oj.uz

Submission #306749

# Submission time Handle Problem Language Result Execution time Memory
306749 2020-09-26T08:39:30 Z cheetose Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 695148 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<db> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };

int n,m;
Vi vr[2500][2500],vc[2500][2500];
int L[2500][2500],R[2500][2500],U[2500][2500],D[2500][2500];
ll count_rectangles(vector<Vi> a){
	MEM_1(L);MEM_1(R);MEM_1(U);MEM_1(D);
	n=a.size(),m=a[0].size();
	fup(i,1,n-2,1){
		stack<Pi> st;
		fup(j,0,m-1,1){
			while(!st.empty() && st.top().X<=a[i][j])st.pop();
			if(!st.empty())L[i][j]=st.top().Y;
			st.push(mp(a[i][j],j));
		}
		while(!st.empty())st.pop();
		fdn(j,m-1,0,1){
			while(!st.empty() && st.top().X<=a[i][j])st.pop();
			if(!st.empty())R[i][j]=st.top().Y;
			st.push(mp(a[i][j],j));
		}
		fup(j,1,m-2,1){
			if(L[i][j]!=-1 && R[i][j]!=-1)vc[L[i][j]+1][R[i][j]-1].pb(i);
		}
	}
	fup(j,1,m-2,1){
		stack<Pi> st;
		fup(i,0,n-1,1){
			while(!st.empty() && st.top().X<=a[i][j])st.pop();
			if(!st.empty())U[i][j]=st.top().Y;
			st.push(mp(a[i][j],i));
		}
		while(!st.empty())st.pop();
		fdn(i,n-1,0,1){
			while(!st.empty() && st.top().X<=a[i][j])st.pop();
			if(!st.empty())D[i][j]=st.top().Y;
			st.push(mp(a[i][j],i));
		}
		fup(i,1,n-2,1){
			if(U[i][j]!=-1 && D[i][j]!=-1)vr[U[i][j]+1][D[i][j]-1].pb(j);
		}
	}
	fup(i,1,n-2,1)fup(j,i,n-2,1){
		sort(ALL(vr[i][j]));vr[i][j].resize(unique(ALL(vr[i][j]))-vr[i][j].begin());
	}
	fup(i,1,m-2,1)fup(j,i,m-2,1){
		sort(ALL(vc[i][j]));vc[i][j].resize(unique(ALL(vc[i][j]))-vc[i][j].begin());
	}
	vector<iiii> vv;
	fup(i,1,n-2,1){
		fup(j,1,m-2,1){
			if(L[i][j]!=-1 && R[i][j]!=-1 && U[i][j]!=-1 && D[i][j]!=-1)vv.emplace_back(L[i][j]+1,R[i][j]-1,U[i][j]+1,D[i][j]-1);
		}
	}
	ll ans=0;
	sort(ALL(vv));vv.resize(unique(ALL(vv))-vv.begin());
	for(auto &I:vv){
		auto [y1,y2,x1,x2]=I;
		if(vr[x1][x2].empty() || vc[y1][y2].empty())continue;
		int t1=lower_bound(ALL(vr[x1][x2]),y1)-vr[x1][x2].begin(),t2=t1+y2-y1;
		int N=vr[x1][x2].size();
		if(t1==N || t2>=N || vr[x1][x2][t1]!=y1 || vr[x1][x2][t2]!=y2)continue;

		t1=lower_bound(ALL(vc[y1][y2]),x1)-vc[y1][y2].begin(),t2=t1+x2-x1;
		N=vc[y1][y2].size();
		if(t1==N || t2>=N || vc[y1][y2][t1]!=x1 || vc[y1][y2][t2]!=x2)continue;

		ans++;
	}
	return ans;
}/*
int main() {
	int n,m;
	scanf("%d%d",&n,&m);
	vector<Vi> v(n,Vi(m));
	fup(i,0,n-1,1)fup(j,0,m-1,1)scanf("%d",&v[i][j]);
	printf("%lld\n",count_rectangles(v));
}*/

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:50:2: note: in expansion of macro 'fup'
   50 |  fup(i,1,n-2,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:52:3: note: in expansion of macro 'fup'
   52 |   fup(j,0,m-1,1){
      |   ^~~
rect.cpp:11:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
rect.cpp:58:3: note: in expansion of macro 'fdn'
   58 |   fdn(j,m-1,0,1){
      |   ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:63:3: note: in expansion of macro 'fup'
   63 |   fup(j,1,m-2,1){
      |   ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:67:2: note: in expansion of macro 'fup'
   67 |  fup(j,1,m-2,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:69:3: note: in expansion of macro 'fup'
   69 |   fup(i,0,n-1,1){
      |   ^~~
rect.cpp:11:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   11 | #define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
      |                              ^
rect.cpp:75:3: note: in expansion of macro 'fdn'
   75 |   fdn(i,n-1,0,1){
      |   ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:80:3: note: in expansion of macro 'fup'
   80 |   fup(i,1,n-2,1){
      |   ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:84:2: note: in expansion of macro 'fup'
   84 |  fup(i,1,n-2,1)fup(j,i,n-2,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:84:16: note: in expansion of macro 'fup'
   84 |  fup(i,1,n-2,1)fup(j,i,n-2,1){
      |                ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:87:2: note: in expansion of macro 'fup'
   87 |  fup(i,1,m-2,1)fup(j,i,m-2,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:87:16: note: in expansion of macro 'fup'
   87 |  fup(i,1,m-2,1)fup(j,i,m-2,1){
      |                ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:91:2: note: in expansion of macro 'fup'
   91 |  fup(i,1,n-2,1){
      |  ^~~
rect.cpp:10:30: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   10 | #define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
      |                              ^
rect.cpp:92:3: note: in expansion of macro 'fup'
   92 |   fup(j,1,m-2,1){
      |   ^~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 391672 KB Output is correct
2 Correct 239 ms 391672 KB Output is correct
3 Correct 239 ms 391800 KB Output is correct
4 Correct 240 ms 391800 KB Output is correct
5 Correct 239 ms 391672 KB Output is correct
6 Correct 234 ms 391672 KB Output is correct
7 Correct 237 ms 391804 KB Output is correct
8 Correct 238 ms 391708 KB Output is correct
9 Correct 238 ms 391800 KB Output is correct
10 Correct 239 ms 391924 KB Output is correct
11 Correct 238 ms 391776 KB Output is correct
12 Correct 238 ms 391800 KB Output is correct
13 Correct 238 ms 391672 KB Output is correct
14 Correct 242 ms 391672 KB Output is correct
15 Correct 240 ms 391712 KB Output is correct
16 Correct 240 ms 391672 KB Output is correct
17 Correct 244 ms 391672 KB Output is correct
18 Correct 240 ms 391800 KB Output is correct
19 Correct 240 ms 391800 KB Output is correct
20 Correct 240 ms 391672 KB Output is correct
21 Correct 240 ms 391676 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 391672 KB Output is correct
2 Correct 239 ms 391672 KB Output is correct
3 Correct 239 ms 391800 KB Output is correct
4 Correct 240 ms 391800 KB Output is correct
5 Correct 239 ms 391672 KB Output is correct
6 Correct 234 ms 391672 KB Output is correct
7 Correct 237 ms 391804 KB Output is correct
8 Correct 238 ms 391708 KB Output is correct
9 Correct 238 ms 391800 KB Output is correct
10 Correct 239 ms 391924 KB Output is correct
11 Correct 238 ms 391776 KB Output is correct
12 Correct 238 ms 391800 KB Output is correct
13 Correct 238 ms 391672 KB Output is correct
14 Correct 242 ms 391672 KB Output is correct
15 Correct 240 ms 391712 KB Output is correct
16 Correct 240 ms 391672 KB Output is correct
17 Correct 246 ms 392056 KB Output is correct
18 Correct 244 ms 392316 KB Output is correct
19 Correct 246 ms 392056 KB Output is correct
20 Correct 244 ms 391928 KB Output is correct
21 Correct 241 ms 392100 KB Output is correct
22 Correct 245 ms 392056 KB Output is correct
23 Correct 246 ms 392092 KB Output is correct
24 Correct 239 ms 391800 KB Output is correct
25 Correct 244 ms 391672 KB Output is correct
26 Correct 240 ms 391800 KB Output is correct
27 Correct 240 ms 391800 KB Output is correct
28 Correct 240 ms 391672 KB Output is correct
29 Correct 240 ms 391676 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 391672 KB Output is correct
2 Correct 239 ms 391672 KB Output is correct
3 Correct 239 ms 391800 KB Output is correct
4 Correct 240 ms 391800 KB Output is correct
5 Correct 239 ms 391672 KB Output is correct
6 Correct 234 ms 391672 KB Output is correct
7 Correct 237 ms 391804 KB Output is correct
8 Correct 238 ms 391708 KB Output is correct
9 Correct 238 ms 391800 KB Output is correct
10 Correct 239 ms 391924 KB Output is correct
11 Correct 238 ms 391776 KB Output is correct
12 Correct 238 ms 391800 KB Output is correct
13 Correct 238 ms 391672 KB Output is correct
14 Correct 242 ms 391672 KB Output is correct
15 Correct 240 ms 391712 KB Output is correct
16 Correct 240 ms 391672 KB Output is correct
17 Correct 246 ms 392056 KB Output is correct
18 Correct 244 ms 392316 KB Output is correct
19 Correct 246 ms 392056 KB Output is correct
20 Correct 244 ms 391928 KB Output is correct
21 Correct 241 ms 392100 KB Output is correct
22 Correct 245 ms 392056 KB Output is correct
23 Correct 246 ms 392092 KB Output is correct
24 Correct 239 ms 391800 KB Output is correct
25 Correct 256 ms 393592 KB Output is correct
26 Correct 255 ms 393588 KB Output is correct
27 Correct 253 ms 393592 KB Output is correct
28 Correct 255 ms 393236 KB Output is correct
29 Correct 267 ms 393840 KB Output is correct
30 Correct 263 ms 393840 KB Output is correct
31 Correct 263 ms 393720 KB Output is correct
32 Correct 258 ms 393844 KB Output is correct
33 Correct 244 ms 391672 KB Output is correct
34 Correct 240 ms 391800 KB Output is correct
35 Correct 240 ms 391800 KB Output is correct
36 Correct 240 ms 391672 KB Output is correct
37 Correct 240 ms 391676 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 391672 KB Output is correct
2 Correct 239 ms 391672 KB Output is correct
3 Correct 239 ms 391800 KB Output is correct
4 Correct 240 ms 391800 KB Output is correct
5 Correct 239 ms 391672 KB Output is correct
6 Correct 234 ms 391672 KB Output is correct
7 Correct 237 ms 391804 KB Output is correct
8 Correct 238 ms 391708 KB Output is correct
9 Correct 238 ms 391800 KB Output is correct
10 Correct 239 ms 391924 KB Output is correct
11 Correct 238 ms 391776 KB Output is correct
12 Correct 238 ms 391800 KB Output is correct
13 Correct 238 ms 391672 KB Output is correct
14 Correct 242 ms 391672 KB Output is correct
15 Correct 240 ms 391712 KB Output is correct
16 Correct 240 ms 391672 KB Output is correct
17 Correct 246 ms 392056 KB Output is correct
18 Correct 244 ms 392316 KB Output is correct
19 Correct 246 ms 392056 KB Output is correct
20 Correct 244 ms 391928 KB Output is correct
21 Correct 241 ms 392100 KB Output is correct
22 Correct 245 ms 392056 KB Output is correct
23 Correct 246 ms 392092 KB Output is correct
24 Correct 239 ms 391800 KB Output is correct
25 Correct 256 ms 393592 KB Output is correct
26 Correct 255 ms 393588 KB Output is correct
27 Correct 253 ms 393592 KB Output is correct
28 Correct 255 ms 393236 KB Output is correct
29 Correct 267 ms 393840 KB Output is correct
30 Correct 263 ms 393840 KB Output is correct
31 Correct 263 ms 393720 KB Output is correct
32 Correct 258 ms 393844 KB Output is correct
33 Correct 363 ms 410984 KB Output is correct
34 Correct 362 ms 414060 KB Output is correct
35 Correct 357 ms 414072 KB Output is correct
36 Correct 344 ms 414072 KB Output is correct
37 Correct 487 ms 412900 KB Output is correct
38 Correct 498 ms 412900 KB Output is correct
39 Correct 491 ms 413156 KB Output is correct
40 Correct 485 ms 412652 KB Output is correct
41 Correct 390 ms 403948 KB Output is correct
42 Correct 427 ms 408804 KB Output is correct
43 Correct 534 ms 412132 KB Output is correct
44 Correct 536 ms 414184 KB Output is correct
45 Correct 382 ms 403180 KB Output is correct
46 Correct 381 ms 403176 KB Output is correct
47 Correct 516 ms 412520 KB Output is correct
48 Correct 531 ms 413412 KB Output is correct
49 Correct 244 ms 391672 KB Output is correct
50 Correct 240 ms 391800 KB Output is correct
51 Correct 240 ms 391800 KB Output is correct
52 Correct 240 ms 391672 KB Output is correct
53 Correct 240 ms 391676 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 392056 KB Output is correct
2 Correct 251 ms 392056 KB Output is correct
3 Correct 251 ms 391800 KB Output is correct
4 Correct 248 ms 391672 KB Output is correct
5 Correct 254 ms 391800 KB Output is correct
6 Correct 260 ms 391904 KB Output is correct
7 Correct 258 ms 392056 KB Output is correct
8 Correct 262 ms 391800 KB Output is correct
9 Correct 257 ms 391800 KB Output is correct
10 Correct 254 ms 391672 KB Output is correct
11 Correct 266 ms 391676 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 248 ms 391672 KB Output is correct
2 Correct 1336 ms 466072 KB Output is correct
3 Correct 2892 ms 546080 KB Output is correct
4 Correct 2911 ms 546336 KB Output is correct
5 Correct 2901 ms 546136 KB Output is correct
6 Correct 650 ms 415864 KB Output is correct
7 Correct 1030 ms 437812 KB Output is correct
8 Correct 1049 ms 440912 KB Output is correct
9 Correct 244 ms 391672 KB Output is correct
10 Correct 240 ms 391800 KB Output is correct
11 Correct 240 ms 391800 KB Output is correct
12 Correct 240 ms 391672 KB Output is correct
13 Correct 240 ms 391676 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 234 ms 391672 KB Output is correct
2 Correct 239 ms 391672 KB Output is correct
3 Correct 239 ms 391800 KB Output is correct
4 Correct 240 ms 391800 KB Output is correct
5 Correct 239 ms 391672 KB Output is correct
6 Correct 234 ms 391672 KB Output is correct
7 Correct 237 ms 391804 KB Output is correct
8 Correct 238 ms 391708 KB Output is correct
9 Correct 238 ms 391800 KB Output is correct
10 Correct 239 ms 391924 KB Output is correct
11 Correct 238 ms 391776 KB Output is correct
12 Correct 238 ms 391800 KB Output is correct
13 Correct 238 ms 391672 KB Output is correct
14 Correct 242 ms 391672 KB Output is correct
15 Correct 240 ms 391712 KB Output is correct
16 Correct 240 ms 391672 KB Output is correct
17 Correct 246 ms 392056 KB Output is correct
18 Correct 244 ms 392316 KB Output is correct
19 Correct 246 ms 392056 KB Output is correct
20 Correct 244 ms 391928 KB Output is correct
21 Correct 241 ms 392100 KB Output is correct
22 Correct 245 ms 392056 KB Output is correct
23 Correct 246 ms 392092 KB Output is correct
24 Correct 239 ms 391800 KB Output is correct
25 Correct 256 ms 393592 KB Output is correct
26 Correct 255 ms 393588 KB Output is correct
27 Correct 253 ms 393592 KB Output is correct
28 Correct 255 ms 393236 KB Output is correct
29 Correct 267 ms 393840 KB Output is correct
30 Correct 263 ms 393840 KB Output is correct
31 Correct 263 ms 393720 KB Output is correct
32 Correct 258 ms 393844 KB Output is correct
33 Correct 363 ms 410984 KB Output is correct
34 Correct 362 ms 414060 KB Output is correct
35 Correct 357 ms 414072 KB Output is correct
36 Correct 344 ms 414072 KB Output is correct
37 Correct 487 ms 412900 KB Output is correct
38 Correct 498 ms 412900 KB Output is correct
39 Correct 491 ms 413156 KB Output is correct
40 Correct 485 ms 412652 KB Output is correct
41 Correct 390 ms 403948 KB Output is correct
42 Correct 427 ms 408804 KB Output is correct
43 Correct 534 ms 412132 KB Output is correct
44 Correct 536 ms 414184 KB Output is correct
45 Correct 382 ms 403180 KB Output is correct
46 Correct 381 ms 403176 KB Output is correct
47 Correct 516 ms 412520 KB Output is correct
48 Correct 531 ms 413412 KB Output is correct
49 Correct 259 ms 392056 KB Output is correct
50 Correct 251 ms 392056 KB Output is correct
51 Correct 251 ms 391800 KB Output is correct
52 Correct 248 ms 391672 KB Output is correct
53 Correct 254 ms 391800 KB Output is correct
54 Correct 260 ms 391904 KB Output is correct
55 Correct 258 ms 392056 KB Output is correct
56 Correct 262 ms 391800 KB Output is correct
57 Correct 257 ms 391800 KB Output is correct
58 Correct 254 ms 391672 KB Output is correct
59 Correct 266 ms 391676 KB Output is correct
60 Correct 248 ms 391672 KB Output is correct
61 Correct 1336 ms 466072 KB Output is correct
62 Correct 2892 ms 546080 KB Output is correct
63 Correct 2911 ms 546336 KB Output is correct
64 Correct 2901 ms 546136 KB Output is correct
65 Correct 650 ms 415864 KB Output is correct
66 Correct 1030 ms 437812 KB Output is correct
67 Correct 1049 ms 440912 KB Output is correct
68 Correct 2581 ms 664868 KB Output is correct
69 Correct 2296 ms 683124 KB Output is correct
70 Correct 2142 ms 683348 KB Output is correct
71 Correct 1781 ms 683384 KB Output is correct
72 Correct 4537 ms 695148 KB Output is correct
73 Correct 3113 ms 547356 KB Output is correct
74 Correct 3318 ms 564248 KB Output is correct
75 Execution timed out 5138 ms 669888 KB Time limit exceeded
76 Halted 0 ms 0 KB -