oj.uz

Submission #364422

# Submission time Handle Problem Language Result Execution time Memory
364422 2021-02-09T05:52:14 Z arujbansal Rectangles (IOI19_rect) C++17
37 / 100
 5000 ms 28396 KB 
#include <iostream>
#include <random>
#include <chrono>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epock().count())
#define rng_seed(x) mt19937 rng(x)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
// #define int long long

const int MXN = 1e5 + 1, INF = 1e9 + 5;

bool valid(int r1, int c1, int r2, int c2, vector<vector<int>> &a) {
    int N = sz(a), M = sz(a.back());

    for (int i = r1; i <= r2; i++) {
        for (int j = c1; j <= c2; j++) {
            if (a[i][j] >= a[r1 - 1][j] || a[i][j] >= a[r2 + 1][j]) return false;
            if (a[i][j] >= a[i][c1 - 1] || a[i][j] >= a[i][c2 + 1]) return false;
        }
    }

    return true;
}

int64_t count_rectangles(vector<vector<int>> a) {
    int64_t ans = 0;

    int N = sz(a), M = sz(a.back());

    for (int r1 = 1; r1 < N - 1; r1++) {
        for (int c1 = 1; c1 < M - 1; c1++) {
            for (int r2 = r1; r2 < N - 1; r2++) {
                for (int c2 = c1; c2 < M - 1; c2++) {
                    ans += valid(r1, c1, r2, c2, a);
                }
            }
        }
    }

    return ans;
}

// void solve() {
    
// }   

// signed main() {
//     ios_base::sync_with_stdio(false);
//     cin.tie(nullptr);

//     int TC = 1;
//     // cin >> TC;
//     while (TC--) solve();
// }

Compilation message

rect.cpp: In function 'bool valid(int, int, int, int, std::vector<std::vector<int> >&)':
rect.cpp:26:9: warning: unused variable 'N' [-Wunused-variable]
   26 |     int N = sz(a), M = sz(a.back());
      |         ^
rect.cpp:26:20: warning: unused variable 'M' [-Wunused-variable]
   26 |     int N = sz(a), M = sz(a.back());
      |                    ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 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 364 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 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 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 364 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 75 ms 452 KB Output is correct
23 Correct 85 ms 364 KB Output is correct
24 Correct 75 ms 364 KB Output is correct
25 Correct 64 ms 364 KB Output is correct
26 Correct 67 ms 364 KB Output is correct
27 Correct 67 ms 364 KB Output is correct
28 Correct 68 ms 364 KB Output is correct
29 Correct 20 ms 364 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 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 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 75 ms 452 KB Output is correct
18 Correct 85 ms 364 KB Output is correct
19 Correct 75 ms 364 KB Output is correct
20 Correct 64 ms 364 KB Output is correct
21 Correct 67 ms 364 KB Output is correct
22 Correct 67 ms 364 KB Output is correct
23 Correct 68 ms 364 KB Output is correct
24 Correct 20 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 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 2971 ms 920 KB Output is correct
31 Correct 2969 ms 920 KB Output is correct
32 Correct 2941 ms 1004 KB Output is correct
33 Correct 2549 ms 876 KB Output is correct
34 Correct 2730 ms 844 KB Output is correct
35 Correct 2735 ms 876 KB Output is correct
36 Correct 2708 ms 1092 KB Output is correct
37 Correct 2621 ms 1004 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 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 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 75 ms 452 KB Output is correct
18 Correct 85 ms 364 KB Output is correct
19 Correct 75 ms 364 KB Output is correct
20 Correct 64 ms 364 KB Output is correct
21 Correct 67 ms 364 KB Output is correct
22 Correct 67 ms 364 KB Output is correct
23 Correct 68 ms 364 KB Output is correct
24 Correct 20 ms 364 KB Output is correct
25 Correct 2971 ms 920 KB Output is correct
26 Correct 2969 ms 920 KB Output is correct
27 Correct 2941 ms 1004 KB Output is correct
28 Correct 2549 ms 876 KB Output is correct
29 Correct 2730 ms 844 KB Output is correct
30 Correct 2735 ms 876 KB Output is correct
31 Correct 2708 ms 1092 KB Output is correct
32 Correct 2621 ms 1004 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 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 5071 ms 7276 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 560 KB Output is correct
2 Correct 19 ms 364 KB Output is correct
3 Correct 20 ms 492 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 24 ms 492 KB Output is correct
6 Correct 23 ms 492 KB Output is correct
7 Correct 23 ms 492 KB Output is correct
8 Correct 23 ms 364 KB Output is correct
9 Correct 23 ms 492 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 364 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 0 ms 364 KB Output is correct
7 Execution timed out 5050 ms 28396 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 2 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 2 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 75 ms 452 KB Output is correct
18 Correct 85 ms 364 KB Output is correct
19 Correct 75 ms 364 KB Output is correct
20 Correct 64 ms 364 KB Output is correct
21 Correct 67 ms 364 KB Output is correct
22 Correct 67 ms 364 KB Output is correct
23 Correct 68 ms 364 KB Output is correct
24 Correct 20 ms 364 KB Output is correct
25 Correct 2971 ms 920 KB Output is correct
26 Correct 2969 ms 920 KB Output is correct
27 Correct 2941 ms 1004 KB Output is correct
28 Correct 2549 ms 876 KB Output is correct
29 Correct 2730 ms 844 KB Output is correct
30 Correct 2735 ms 876 KB Output is correct
31 Correct 2708 ms 1092 KB Output is correct
32 Correct 2621 ms 1004 KB Output is correct
33 Execution timed out 5071 ms 7276 KB Time limit exceeded
34 Halted 0 ms 0 KB -