Submission #169939

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
169939	2019-12-23T10:46:58 Z	socho	Rectangles (IOI19_rect)	C++14	18 / 100	5000 ms	28408 KB

rect

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

long long count_rectangles(std::vector<std::vector<int> > a) {
	
	int n = a.size();
	int m = a[0].size();
	
	int count = 0;
	
	for (int i=1; i<n-1; i++) {
		for (int j=1; j<m-1; j++) {
			for (int k=i; k<n-1; k++) {
				for (int l=j; l<m-1; l++) {
					// check i,j to k,l
					bool ok = true;
					for (int x=i; x<=k; x++) {
						for (int y=j; y<=l; y++) {
							if (a[x][y] >= a[i-1][y]) ok = false;
							if (a[x][y] >= a[k+1][y]) ok = false;
							if (a[x][y] >= a[x][j-1]) ok = false;
							if (a[x][y] >= a[x][l+1]) ok = false;
						}
					}
					count += ok;
				}
			}
		}
	}
	
	return count;
	
}

Subtask #1

8.0 / 8.0

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

Subtask #2

0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	35 ms	376 KB	Output is correct
3	Correct	35 ms	376 KB	Output is correct
4	Correct	34 ms	256 KB	Output is correct
5	Correct	35 ms	376 KB	Output is correct
6	Correct	35 ms	368 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	34 ms	256 KB	Output is correct
10	Correct	34 ms	256 KB	Output is correct
11	Correct	35 ms	256 KB	Output is correct
12	Correct	35 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Execution timed out	5093 ms	376 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	35 ms	376 KB	Output is correct
3	Correct	35 ms	376 KB	Output is correct
4	Correct	34 ms	256 KB	Output is correct
5	Correct	35 ms	376 KB	Output is correct
6	Correct	35 ms	368 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	34 ms	256 KB	Output is correct
10	Correct	34 ms	256 KB	Output is correct
11	Correct	35 ms	256 KB	Output is correct
12	Correct	35 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Execution timed out	5093 ms	376 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	35 ms	376 KB	Output is correct
3	Correct	35 ms	376 KB	Output is correct
4	Correct	34 ms	256 KB	Output is correct
5	Correct	35 ms	376 KB	Output is correct
6	Correct	35 ms	368 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	34 ms	256 KB	Output is correct
10	Correct	34 ms	256 KB	Output is correct
11	Correct	35 ms	256 KB	Output is correct
12	Correct	35 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Execution timed out	5093 ms	376 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #5

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4600 ms	504 KB	Output is correct
2	Correct	2824 ms	472 KB	Output is correct
3	Correct	4601 ms	444 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	4592 ms	604 KB	Output is correct
6	Correct	4598 ms	504 KB	Output is correct
7	Correct	4604 ms	604 KB	Output is correct
8	Correct	4598 ms	464 KB	Output is correct
9	Correct	4621 ms	476 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	380 KB	Output is correct

Subtask #6

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Execution timed out	5030 ms	28408 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #7

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	35 ms	376 KB	Output is correct
3	Correct	35 ms	376 KB	Output is correct
4	Correct	34 ms	256 KB	Output is correct
5	Correct	35 ms	376 KB	Output is correct
6	Correct	35 ms	368 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	4 ms	256 KB	Output is correct
9	Correct	34 ms	256 KB	Output is correct
10	Correct	34 ms	256 KB	Output is correct
11	Correct	35 ms	256 KB	Output is correct
12	Correct	35 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Execution timed out	5093 ms	376 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-