oj.uz

Submission #405746

# Submission time Handle Problem Language Result Execution time Memory
405746 2021-05-16T21:12:01 Z rocks03 Rectangles (IOI19_rect) C++14
50 / 100
 5000 ms 548324 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

long long count_rectangles(vector<vector<int>> a){
    int N = SZ(a), M = SZ(a[0]);
    map<pair<pii, pii>, int> mp;
    vector<int> rt[N][M], dw[N][M];
    rep(i, 0, N - 1){
        vector<int> st;
        per(j, M - 1, 0){
            while(!st.empty() && a[i][j] > a[i][st.back()]){
                if(j + 1 < st.back()) rt[i][j].pb(st.back());
                st.pop_back();
            }
            if(!st.empty() && j + 1 < st.back()) rt[i][j].pb(st.back());
            if(!st.empty() && a[i][j] == a[i][st.back()]) st.pop_back();
            st.pb(j);
        }
    }
    rep(j, 0, M - 1){
        vector<int> st;
        per(i, N - 1, 0){
            while(!st.empty() && a[i][j] > a[st.back()][j]){
                if(i + 1 < st.back()) dw[i][j].pb(st.back());
                st.pop_back();
            }
            if(!st.empty() && i + 1 < st.back()) dw[i][j].pb(st.back());
            if(!st.empty() && a[i][j] == a[st.back()][j]) st.pop_back();
            st.pb(i);
        }
    }
    ll ans = 0;
    rep(i, 0, N - 1){
        rep(j, 0, M - 1){
            for(int j2 : rt[i][j]){
                mp[{{i, i}, {j, j2}}] = 1;
            }
        }
    }
    rep(i, 1, N - 2){
        rep(j, 0, M - 1){
            for(int j2 : rt[i][j]){
                set<int> st;
                for(int i2 : dw[i - 1][j + 1]) st.insert(i2);
                rep(k, j + 2, j2 - 1){
                    set<int> st2;
                    for(int i2 : dw[i - 1][k]){
                        if(st.count(i2)) st2.insert(i2);
                    }
                    st = st2;
                }
                for(int i2 : st){
                    bool ok = true;
                    rep(k, i, i2 - 1){
                        if(!mp.count({{k, k}, {j, j2}})){
                            ok = false; break;
                        }
                    }
                    ans += (ok == true);
                }
            }
        }
    }
    return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 288 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 288 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 48 ms 1444 KB Output is correct
23 Correct 50 ms 1356 KB Output is correct
24 Correct 49 ms 1356 KB Output is correct
25 Correct 3 ms 940 KB Output is correct
26 Correct 7 ms 1100 KB Output is correct
27 Correct 6 ms 1200 KB Output is correct
28 Correct 7 ms 1100 KB Output is correct
29 Correct 4 ms 716 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 48 ms 1444 KB Output is correct
18 Correct 50 ms 1356 KB Output is correct
19 Correct 49 ms 1356 KB Output is correct
20 Correct 3 ms 940 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 6 ms 1200 KB Output is correct
23 Correct 7 ms 1100 KB Output is correct
24 Correct 4 ms 716 KB Output is correct
25 Correct 1 ms 288 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1016 ms 7644 KB Output is correct
31 Correct 1043 ms 7748 KB Output is correct
32 Correct 1028 ms 7728 KB Output is correct
33 Correct 17 ms 4300 KB Output is correct
34 Correct 32 ms 6212 KB Output is correct
35 Correct 43 ms 6320 KB Output is correct
36 Correct 36 ms 6132 KB Output is correct
37 Correct 33 ms 5988 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 48 ms 1444 KB Output is correct
18 Correct 50 ms 1356 KB Output is correct
19 Correct 49 ms 1356 KB Output is correct
20 Correct 3 ms 940 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 6 ms 1200 KB Output is correct
23 Correct 7 ms 1100 KB Output is correct
24 Correct 4 ms 716 KB Output is correct
25 Correct 1016 ms 7644 KB Output is correct
26 Correct 1043 ms 7748 KB Output is correct
27 Correct 1028 ms 7728 KB Output is correct
28 Correct 17 ms 4300 KB Output is correct
29 Correct 32 ms 6212 KB Output is correct
30 Correct 43 ms 6320 KB Output is correct
31 Correct 36 ms 6132 KB Output is correct
32 Correct 33 ms 5988 KB Output is correct
33 Correct 1 ms 288 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 592 ms 60960 KB Output is correct
39 Correct 597 ms 54680 KB Output is correct
40 Correct 772 ms 54708 KB Output is correct
41 Execution timed out 5075 ms 48452 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 1484 KB Output is correct
2 Correct 124 ms 1228 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 5 ms 1356 KB Output is correct
6 Correct 5 ms 1356 KB Output is correct
7 Correct 5 ms 1356 KB Output is correct
8 Correct 4 ms 1228 KB Output is correct
9 Correct 4 ms 1228 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 972 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 949 ms 252644 KB Output is correct
8 Correct 2021 ms 545620 KB Output is correct
9 Correct 2286 ms 548104 KB Output is correct
10 Correct 2196 ms 548324 KB Output is correct
11 Correct 214 ms 175428 KB Output is correct
12 Correct 427 ms 332404 KB Output is correct
13 Correct 442 ms 352968 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 4 ms 420 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 48 ms 1444 KB Output is correct
18 Correct 50 ms 1356 KB Output is correct
19 Correct 49 ms 1356 KB Output is correct
20 Correct 3 ms 940 KB Output is correct
21 Correct 7 ms 1100 KB Output is correct
22 Correct 6 ms 1200 KB Output is correct
23 Correct 7 ms 1100 KB Output is correct
24 Correct 4 ms 716 KB Output is correct
25 Correct 1016 ms 7644 KB Output is correct
26 Correct 1043 ms 7748 KB Output is correct
27 Correct 1028 ms 7728 KB Output is correct
28 Correct 17 ms 4300 KB Output is correct
29 Correct 32 ms 6212 KB Output is correct
30 Correct 43 ms 6320 KB Output is correct
31 Correct 36 ms 6132 KB Output is correct
32 Correct 33 ms 5988 KB Output is correct
33 Correct 592 ms 60960 KB Output is correct
34 Correct 597 ms 54680 KB Output is correct
35 Correct 772 ms 54708 KB Output is correct
36 Execution timed out 5075 ms 48452 KB Time limit exceeded
37 Halted 0 ms 0 KB -