Submission #275725

#	Time	Username	Problem	Language	Result	Execution time	Memory
275725		khangal	Rectangles (IOI19_rect)	C++14	0 / 100	76 ms	59512 KiB

rect

#include<bits/stdc++.h>
using namespace std;
typedef int ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
bool check(vector<vector<int>> vec,int r,int r1,int c,int c1){
    for(ll i=r;i<=r1;i++){
        for(ll j=c;j<=c1;j++){
            if(vec[i][c-1]<=vec[i][j])
                return false;
            if(vec[i][c1+1]<=vec[i][j])
                return false;
            if(vec[r-1][j]<=vec[i][j])
                return false;
            if(vec[r1+1][j]<=vec[i][j])
                return false;
        }
    }
    return true;
}
ll count_rectangles(vector<vector<int> > vec){
    ll n=vec.size();
    ll m=vec[0].size();
    ll ans=0;
    for(ll r=1;r<n-1;r++){
        for(ll r1=1;r1<m-1;r1++){
            for(ll c=i;c<n-1;c++){
                for(ll c1=j;c1<m-1;c1++){
                    if(check(vec,r,r1,c,c1))ans++;
                }
            }
        }
    }
    return ans;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 0 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28