oj.uz

Submission #578848

# Submission time Handle Problem Language Result Execution time Memory
578848 2022-06-18T05:51:16 Z Theo830 Rectangles (IOI19_rect) C++17
37 / 100
 1167 ms 1048576 KB 

    #pragma GCC optimize("Ofast")
    #pragma GCC optimize ("O3")
    #pragma GCC optimization ("unroll-loops")
    #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
    #include <bits/stdc++.h>
    using namespace std;
    typedef int ll;
    const ll INF = 1e9+7;
    ll MOD = 998244353;
    typedef pair<ll,ll> ii;
    #define iii pair<ll,ii>
    #define f(i,a,b) for(ll i = a;i < b;i++)
    #define pb push_back
    #define vll vector<ll>
    #define F first
    #define S second
    #define all(x) (x).begin(), (x).end()
    ///I hope I will get uprating and don't make mistakes
    ///I will never stop programming
    ///sqrt(-1) Love C++
    ///Please don't hack me
    ///@TheofanisOrfanou Theo830
    ///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
    ///Stay Calm
    ///Look for special cases
    ///Beware of overflow and array bounds
    ///Think the problem backwards
    ///Training
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    uniform_int_distribution<ll> distr;
    ll rnd(ll a, ll b){return distr(rng)%(b-a+1)+a;}
    #include "rect.h"
    /*
    long long count_rectangles(std::vector<std::vector<int> > a);
    int main() {
    	int n, m;
    	cin>>n>>m;
    	vector<vector<int>> a(n, vector<int>(m));
    	for (int i = 0; i < n; i++)	{
    		for (int j = 0; j < m; j++) {
    			cin>>a[i][j];
    		}
    	}
    	long long result = count_rectangles(a);
     
    	printf("%lld\n", result);
    	return 0;
    }
    */
    long long count_rectangles(vector<vector<int> > a){
        ll ans = 0;
        ll n = a.size();
        ll m = a[0].size();
        bool ok1[n][m][m];
        bool ok2[m][n][n];
        memset(ok1,0,sizeof ok1);
        memset(ok2,0,sizeof ok2);
        f(i,1,n-1){
            f(j,1,m-1){
                ll Maxi = a[i][j];
                ok1[i][j][j] = min(a[i][j-1],a[i][j+1]) > Maxi;
                f(k,j+1,m-1){
                    Maxi = max(Maxi,a[i][k]);
                    ok1[i][j][k] = min(a[i][j-1],a[i][k+1]) > Maxi;
                }
            }
        }
        f(i,1,m-1){
            f(j,1,n-1){
                ll maxi = a[j][i];
                ok2[i][j][j] = min(a[j-1][i],a[j+1][i]) > maxi;
                f(k,j+1,n-1){
                    maxi = max(maxi,a[k][i]);
                    ok2[i][j][k] = min(a[j-1][i],a[k+1][i]) > maxi;
                }
            }
        }
        ll pre1[m][m][n+1];
        memset(pre1,0,sizeof pre1);
        f(j,1,m-1){
            f(jj,j,m-1){
                f(k,0,n){
                    pre1[j][jj][k+1] = pre1[j][jj][k] + ok1[k][j][jj];
                }
            }
        }
        ll pre2[n][n][m+1];
        memset(pre2,0,sizeof pre2);
        f(i,1,n-1){
            f(ii,i,n-1){
                f(k,0,m){
                    pre2[i][ii][k+1] = pre2[i][ii][k] + ok2[k][i][ii];
                }
            }
        }
        f(i,1,n-1){
            f(ii,i,n-1){
                f(j,1,m-1){
                    f(jj,j,m-1){
                        bool ok = (pre1[j][jj][ii+1] - pre1[j][jj][i]) == (ii - i  + 1);
                        bool ok2 = (pre2[i][ii][jj+1] - pre2[i][ii][j]) == (jj - j + 1);
                        if(!ok2){
                            break;
                        }
                        ans += ok & ok2;
                    }
                }
            }
        }
    	return ans;
    }
    /*
    6 5
    4 8 7 5 6
    7 4 10 3 5
    9 7 20 14 2
    9 14 7 3 6
    5 7 5 2 7
    4 5 13 5 6
    */

Compilation message

rect.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 |     #pragma GCC optimization ("unroll-loops")
      |

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 6 ms 5348 KB Output is correct
23 Correct 6 ms 5460 KB Output is correct
24 Correct 6 ms 5432 KB Output is correct
25 Correct 7 ms 5332 KB Output is correct
26 Correct 5 ms 5460 KB Output is correct
27 Correct 5 ms 5332 KB Output is correct
28 Correct 5 ms 5340 KB Output is correct
29 Correct 2 ms 2260 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 6 ms 5348 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 6 ms 5432 KB Output is correct
20 Correct 7 ms 5332 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 5 ms 5332 KB Output is correct
23 Correct 5 ms 5340 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 102 ms 79420 KB Output is correct
31 Correct 102 ms 79348 KB Output is correct
32 Correct 105 ms 79416 KB Output is correct
33 Correct 70 ms 79276 KB Output is correct
34 Correct 87 ms 79284 KB Output is correct
35 Correct 75 ms 79500 KB Output is correct
36 Correct 73 ms 79556 KB Output is correct
37 Correct 68 ms 77684 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 6 ms 5348 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 6 ms 5432 KB Output is correct
20 Correct 7 ms 5332 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 5 ms 5332 KB Output is correct
23 Correct 5 ms 5340 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 102 ms 79420 KB Output is correct
26 Correct 102 ms 79348 KB Output is correct
27 Correct 105 ms 79416 KB Output is correct
28 Correct 70 ms 79276 KB Output is correct
29 Correct 87 ms 79284 KB Output is correct
30 Correct 75 ms 79500 KB Output is correct
31 Correct 73 ms 79556 KB Output is correct
32 Correct 68 ms 77684 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Runtime error 1167 ms 1048576 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 116620 KB Output is correct
2 Correct 67 ms 84256 KB Output is correct
3 Correct 88 ms 116652 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 81 ms 116624 KB Output is correct
6 Correct 77 ms 116812 KB Output is correct
7 Correct 94 ms 116608 KB Output is correct
8 Correct 78 ms 116556 KB Output is correct
9 Correct 74 ms 116608 KB Output is correct
10 Correct 36 ms 55312 KB Output is correct
11 Correct 60 ms 85984 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Runtime error 425 ms 1048576 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 296 KB Output is correct
17 Correct 6 ms 5348 KB Output is correct
18 Correct 6 ms 5460 KB Output is correct
19 Correct 6 ms 5432 KB Output is correct
20 Correct 7 ms 5332 KB Output is correct
21 Correct 5 ms 5460 KB Output is correct
22 Correct 5 ms 5332 KB Output is correct
23 Correct 5 ms 5340 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 102 ms 79420 KB Output is correct
26 Correct 102 ms 79348 KB Output is correct
27 Correct 105 ms 79416 KB Output is correct
28 Correct 70 ms 79276 KB Output is correct
29 Correct 87 ms 79284 KB Output is correct
30 Correct 75 ms 79500 KB Output is correct
31 Correct 73 ms 79556 KB Output is correct
32 Correct 68 ms 77684 KB Output is correct
33 Runtime error 1167 ms 1048576 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -