oj.uz

Submission #362228

# Submission time Handle Problem Language Result Execution time Memory
362228 2021-02-02T08:47:01 Z knightron0 Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 25452 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define lli long long int
#define float long double

const int MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;


lli count_rectangles(vector<vector<int>> a) {
    int n = a.size();
    int m = a[0].size();
    lli ans =0;
    for(int r1= 0;r1<n;r1++){
        for(int c1= 0;c1<m;c1++){
            for(int r2= r1+2;r2<n;r2++){
                for(int c2= c1+2;c2<m;c2++){
                    bool valid = true;
                    for(int i= r1+1;i<r2;i++){
                        for(int j= c1+1;j<c2;j++){
                            int mn = min({a[i][c1], a[i][c2], a[r1][j], a[r2][j]});
                            if(a[i][j] >= mn){
                                valid = false;
                                break;
                            }
                        }
                        if(!valid) break;
                    }
                    ans += (lli)valid;
                }
            }
        }
    }
    return ans;
}


// signed main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(NULL);
//     #ifdef LOCAL
//     freopen("input.txt", "r", stdin);
//     #endif
//     int n, m;
//     cin>>n>>m;
//     vector<vector<int>> vec;
//     for(int i= 0;i<n;i++){
//     	vector<int> tmp;
//     	for(int j= 0;j<m;j++){
//     		int x;
//     		cin>>x;
//     		tmp.pb(x);
//     	}
//     	vec.pb(tmp);
//     }
//     cout<<count_rectangles(vec)<<endl;
//     return 0;
// }

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 368 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 108 ms 424 KB Output is correct
23 Correct 103 ms 472 KB Output is correct
24 Correct 117 ms 492 KB Output is correct
25 Correct 83 ms 364 KB Output is correct
26 Correct 130 ms 364 KB Output is correct
27 Correct 112 ms 512 KB Output is correct
28 Correct 112 ms 492 KB Output is correct
29 Correct 27 ms 492 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 108 ms 424 KB Output is correct
18 Correct 103 ms 472 KB Output is correct
19 Correct 117 ms 492 KB Output is correct
20 Correct 83 ms 364 KB Output is correct
21 Correct 130 ms 364 KB Output is correct
22 Correct 112 ms 512 KB Output is correct
23 Correct 112 ms 492 KB Output is correct
24 Correct 27 ms 492 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 368 KB Output is correct
27 Correct 2 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 4135 ms 920 KB Output is correct
31 Correct 4133 ms 920 KB Output is correct
32 Correct 4056 ms 1000 KB Output is correct
33 Correct 3638 ms 776 KB Output is correct
34 Correct 4536 ms 876 KB Output is correct
35 Correct 4540 ms 1000 KB Output is correct
36 Correct 4388 ms 964 KB Output is correct
37 Correct 4298 ms 992 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 108 ms 424 KB Output is correct
18 Correct 103 ms 472 KB Output is correct
19 Correct 117 ms 492 KB Output is correct
20 Correct 83 ms 364 KB Output is correct
21 Correct 130 ms 364 KB Output is correct
22 Correct 112 ms 512 KB Output is correct
23 Correct 112 ms 492 KB Output is correct
24 Correct 27 ms 492 KB Output is correct
25 Correct 4135 ms 920 KB Output is correct
26 Correct 4133 ms 920 KB Output is correct
27 Correct 4056 ms 1000 KB Output is correct
28 Correct 3638 ms 776 KB Output is correct
29 Correct 4536 ms 876 KB Output is correct
30 Correct 4540 ms 1000 KB Output is correct
31 Correct 4388 ms 964 KB Output is correct
32 Correct 4298 ms 992 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 368 KB Output is correct
35 Correct 2 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Execution timed out 5083 ms 7292 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 364 KB Output is correct
2 Correct 24 ms 364 KB Output is correct
3 Correct 18 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 40 ms 364 KB Output is correct
6 Correct 40 ms 492 KB Output is correct
7 Correct 40 ms 364 KB Output is correct
8 Correct 42 ms 364 KB Output is correct
9 Correct 42 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 368 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Execution timed out 5086 ms 25452 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 3 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 364 KB Output is correct
10 Correct 3 ms 364 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 108 ms 424 KB Output is correct
18 Correct 103 ms 472 KB Output is correct
19 Correct 117 ms 492 KB Output is correct
20 Correct 83 ms 364 KB Output is correct
21 Correct 130 ms 364 KB Output is correct
22 Correct 112 ms 512 KB Output is correct
23 Correct 112 ms 492 KB Output is correct
24 Correct 27 ms 492 KB Output is correct
25 Correct 4135 ms 920 KB Output is correct
26 Correct 4133 ms 920 KB Output is correct
27 Correct 4056 ms 1000 KB Output is correct
28 Correct 3638 ms 776 KB Output is correct
29 Correct 4536 ms 876 KB Output is correct
30 Correct 4540 ms 1000 KB Output is correct
31 Correct 4388 ms 964 KB Output is correct
32 Correct 4298 ms 992 KB Output is correct
33 Execution timed out 5083 ms 7292 KB Time limit exceeded
34 Halted 0 ms 0 KB -