Submission #1021117

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1021117	2024-07-12T14:16:48 Z	Malix	Rectangles (IOI19_rect)	C++14	10 / 100	15 ms	652 KB

rect

#include "rect.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

long long count_rectangles(std::vector<std::vector<int> > a) {
	bool flag=1;
	int n=a.size();
	int m=a[0].size();
	REP(i,0,n)REP(j,0,m)if(a[i][j]>1)flag=0;
if(flag){
	ll ans=0;
	queue<pi> pq;
	REP(i,1,n-1)REP(j,1,m-1){
		if(a[i][j]==1)continue;
		int c=0,d=0;
		while(j+c<m-1&&a[i][j+c]==0)c++;
		while(i+d<n-1&&a[i+d][j]==0)d++;
		bool g=1;
		REP(x,i,i+d){
			if(a[x][j-1]==0||a[x][j+c]==0)g=0;
		}
		REP(x,j,j+c){
			if(a[i-1][x]==0||a[i+d][x]==0)g=0;
		}
		pq.push({i,j});int k=0;
		while(!pq.empty()){
			int x=pq.front().F;
			int y=pq.front().S;
			pq.pop();
			if(a[x][y]==1)continue;
			a[x][y]=1;k++;
			if(x+1<n-1&&a[x+1][y]==0)pq.push({x+1,y});
			if(x-1>0&&a[x-1][y]==0)pq.push({x-1,y});
			if(y-1>0&&a[x][y-1]==0)pq.push({x,y-1});
			if(y+1<m-1&&a[x][y+1]==0)pq.push({x,y+1});
		}if(i==1&&j==1)
		if(k==c*d&&g)ans++;
	}
	return ans;
}
	vii b(n,vi(m,0)),c(n,vi(m,0));
	ll ans=0;
	REP(i,1,n-1)REP(j,1,m-1){
		vii top(n,vi(m,0)),left(n,vi(m,0)),d(n,vi(m,0));
		REP(x,i,n-1)REP(y,j,m-1){
			top[x][y]=max(top[x-1][y],a[x][y]);
			left[x][y]=max(left[x][y-1],a[x][y]);
		}
		REP(y,j,m-1)d[i-1][y]=1;
		REP(x,i,n-1)REP(y,j,m-1)if(left[x][y]<a[x][j-1]&&left[x][y]<a[x][y+1]&&d[x-1][y])d[x][y]=1;
		REP(x,i,n-1){
			REP(y,j,m-1){
				if(top[x][y]>=a[i-1][y]||top[x][y]>=a[x+1][y])break;
				if(d[x][y]){
					ans++;//cerr<<i<<" "<<j<<" "<<x<<" "<<y<<"\n";
				}
			}
		}
		// if(i==n-2&&j==m-2){cout<<"\n";
		// 	REP(x,i,n-1){
		// 		REP(y,j,m-1)cout<<d[x][y]<<" ";
		// 	cout<<"\n";
		// 	}
		// }
	}
	return ans;
}

Subtask #1
0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #3
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Incorrect	0 ms	348 KB	Output isn't correct
20	Halted	0 ms	0 KB	-

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	600 KB	Output is correct
2	Correct	11 ms	620 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	12 ms	652 KB	Output is correct
6	Correct	12 ms	604 KB	Output is correct
7	Correct	14 ms	600 KB	Output is correct
8	Correct	14 ms	604 KB	Output is correct
9	Correct	12 ms	604 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #6
0 / 13.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Incorrect	348 KB	Output isn't correct
4	Halted	0 KB	-

Subtask #7
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	2 ms	348 KB	Output is correct
3	Correct	2 ms	348 KB	Output is correct
4	Correct	2 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	460 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	3 ms	344 KB	Output is correct
12	Correct	4 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	15 ms	600 KB	Output is correct
18	Correct	11 ms	620 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	12 ms	652 KB	Output is correct
22	Correct	12 ms	604 KB	Output is correct
23	Correct	14 ms	600 KB	Output is correct
24	Correct	14 ms	604 KB	Output is correct
25	Correct	12 ms	604 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Incorrect	0 ms	348 KB	Output isn't correct
31	Halted	0 ms	0 KB	-

Submission #1021117

Compilation message

Subtask #1 0 / 8.0

Subtask #2 0 / 7.0

Subtask #3 0 / 12.0

Subtask #4 0 / 22.0

Subtask #5 10.0 / 10.0

Subtask #6 0 / 13.0

Subtask #7 0 / 28.0

Subtask #1
0 / 8.0

Subtask #2
0 / 7.0

Subtask #3
0 / 12.0

Subtask #4
0 / 22.0

Subtask #5
10.0 / 10.0

Subtask #6
0 / 13.0

Subtask #7
0 / 28.0