oj.uz

Submission #207667

# Submission time Handle Problem Language Result Execution time Memory
207667 2020-03-08T12:09:40 Z Sho10 Rectangles (IOI19_rect) C++14
50 / 100
 5000 ms 441724 KB 
/*
ID: Sho10
LANG: C++
*/
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll a[2505][2505];
ll count_rectangles(vector<vector<int> >A){
ll n=A.size();
ll m=A[0].size();
ll ans=0;
ll s1=-1;
for(ll i=0;i<n;i++)
    for(ll j=0;j<m;j++){
    a[i][j]=A[i][j];
    if(a[i][j]>=2){
        s1=1;
    }
    }
    if(s1==1){
for(ll i=1;i<n-1;i++)
    for(ll j=1;j<m-1;j++)
{
    for(ll c=i;c<n-1;c++)
        for(ll k=j;k<m-1;k++){
           for(ll ii=i;ii<=c;ii++)
           for(ll jj=j;jj<=k;jj++)
           {
               if(a[ii][jj]<a[ii][j-1]&&a[ii][jj]<a[i-1][jj]&&a[ii][jj]<a[c+1][jj]&&a[ii][jj]<a[ii][k+1]){
                continue;
               }else goto Next;
           }
           ans++;
           Next:ans=ans+0;
        }
}
    }else {
    for(ll i=0;i<n;i++)
        for(ll j=0;j<m;j++)
        a[i+1][j+1]=A[i][j];
    ll s[2505][2505];
    for(ll i=1;i<=n;i++)
        for(ll j=1;j<=m;j++)
        s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
    ll l[2505][2505][3];
    ll r[2505][2505][3];
    for(ll i=n;i>=1;i--)
        for(ll j=m;j>=1;j--)
    {
        ll x=a[i][j];
        l[i][j][x]=l[i+1][j][x]+1;
        r[i][j][x]=r[i][j+1][x]+1;
    }
    for(ll i=2;i<n;i++)
        for(ll j=2;j<m;j++)
    {
        if(a[i][j]==1)continue;
    ll x,y;
    x=i+l[i][j][0]-1;
    y=j+r[i][j][0]-1;
    ll val=s[x][y]+s[i-1][j-1]-s[x][j-1]-s[i-1][y];
    if(val!=0){
        continue;
    }
    if(l[i][j-1][1]<l[i][j][0]) continue;
    if(r[i-1][j][1]<r[i][j][0]) continue;
    if(l[i][y+1][1]<l[i][j][0]) continue;
    if(r[x+1][j][1]<r[i][j][0]) continue;
    ans++;
    }
    }
return ans;
}
/*
int32_t main(){
CODE_START;
cout<<count_rectangles({{1, 1, 1, 1, 1},{0, 0, 0, 0, 0},{1, 0, 1, 1, 1},{1, 1, 1, 1, 1},{1, 1, 1, 1, 1},{1, 1, 1, 1, 1}});
}
*/

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:30:1: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 for(ll i=0;i<n;i++)
 ^~~
rect.cpp:37:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     if(s1==1){
     ^~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 31 ms 760 KB Output is correct
18 Correct 32 ms 760 KB Output is correct
19 Correct 31 ms 760 KB Output is correct
20 Correct 21 ms 760 KB Output is correct
21 Correct 26 ms 760 KB Output is correct
22 Correct 26 ms 760 KB Output is correct
23 Correct 25 ms 760 KB Output is correct
24 Correct 10 ms 760 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 5 ms 888 KB Output is correct
28 Correct 5 ms 888 KB Output is correct
29 Correct 5 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 31 ms 760 KB Output is correct
18 Correct 32 ms 760 KB Output is correct
19 Correct 31 ms 760 KB Output is correct
20 Correct 21 ms 760 KB Output is correct
21 Correct 26 ms 760 KB Output is correct
22 Correct 26 ms 760 KB Output is correct
23 Correct 25 ms 760 KB Output is correct
24 Correct 10 ms 760 KB Output is correct
25 Correct 995 ms 2144 KB Output is correct
26 Correct 986 ms 2168 KB Output is correct
27 Correct 1004 ms 2168 KB Output is correct
28 Correct 554 ms 1912 KB Output is correct
29 Correct 742 ms 1912 KB Output is correct
30 Correct 716 ms 2168 KB Output is correct
31 Correct 709 ms 2040 KB Output is correct
32 Correct 685 ms 2040 KB Output is correct
33 Correct 5 ms 376 KB Output is correct
34 Correct 5 ms 376 KB Output is correct
35 Correct 5 ms 888 KB Output is correct
36 Correct 5 ms 888 KB Output is correct
37 Correct 5 ms 504 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 31 ms 760 KB Output is correct
18 Correct 32 ms 760 KB Output is correct
19 Correct 31 ms 760 KB Output is correct
20 Correct 21 ms 760 KB Output is correct
21 Correct 26 ms 760 KB Output is correct
22 Correct 26 ms 760 KB Output is correct
23 Correct 25 ms 760 KB Output is correct
24 Correct 10 ms 760 KB Output is correct
25 Correct 995 ms 2144 KB Output is correct
26 Correct 986 ms 2168 KB Output is correct
27 Correct 1004 ms 2168 KB Output is correct
28 Correct 554 ms 1912 KB Output is correct
29 Correct 742 ms 1912 KB Output is correct
30 Correct 716 ms 2168 KB Output is correct
31 Correct 709 ms 2040 KB Output is correct
32 Correct 685 ms 2040 KB Output is correct
33 Execution timed out 5040 ms 12536 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 11 ms 504 KB Output is correct
3 Correct 5 ms 888 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 13 ms 504 KB Output is correct
6 Correct 12 ms 504 KB Output is correct
7 Correct 12 ms 504 KB Output is correct
8 Correct 11 ms 504 KB Output is correct
9 Correct 12 ms 504 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 194 ms 217592 KB Output is correct
3 Correct 396 ms 439764 KB Output is correct
4 Correct 386 ms 441724 KB Output is correct
5 Correct 390 ms 441720 KB Output is correct
6 Correct 182 ms 218232 KB Output is correct
7 Correct 355 ms 438648 KB Output is correct
8 Correct 343 ms 441720 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 888 KB Output is correct
12 Correct 5 ms 888 KB Output is correct
13 Correct 5 ms 504 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 31 ms 760 KB Output is correct
18 Correct 32 ms 760 KB Output is correct
19 Correct 31 ms 760 KB Output is correct
20 Correct 21 ms 760 KB Output is correct
21 Correct 26 ms 760 KB Output is correct
22 Correct 26 ms 760 KB Output is correct
23 Correct 25 ms 760 KB Output is correct
24 Correct 10 ms 760 KB Output is correct
25 Correct 995 ms 2144 KB Output is correct
26 Correct 986 ms 2168 KB Output is correct
27 Correct 1004 ms 2168 KB Output is correct
28 Correct 554 ms 1912 KB Output is correct
29 Correct 742 ms 1912 KB Output is correct
30 Correct 716 ms 2168 KB Output is correct
31 Correct 709 ms 2040 KB Output is correct
32 Correct 685 ms 2040 KB Output is correct
33 Execution timed out 5040 ms 12536 KB Time limit exceeded
34 Halted 0 ms 0 KB -