Submission #428368

#	Time	Username	Problem	Language	Result	Execution time	Memory
428368		Blistering_Barnacles	Rectangles (IOI19_rect)	C++14	0 / 100	3226 ms	13400 KiB

rect

#include "rect.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
long long count_rectangles(std::vector<std::vector<int> > a) {
    n = sz(a) ;
    m = sz(a[0]) ;
    //cout << mn[0][0][n - 1][m - 1] ;
    int ans = 0 ;
    for(ll i = 1 ; i < n - 1 ; i++){
        for(ll j = 1 ; j < m - 1 ; j++){
            for(ll i1 = i ; i1 < n - 1 ; i1++){
                for(ll j1 = j ; j1 < m - 1 ; j1++){
                    o = 1 ;
                    for(ll i2 = i ; i2 <= i1 ; i2++){
                        for(ll j2 = j ; j2 <= j1 ; j2++){
                            if(a[i2][j2] > min({a[i2][j - 1] , a[i2][j1 + 1] , a[i - 1][j2] , a[i1 + 1][j2]})){
                                o = 0 ;
                                B ;
                            }
                        }
                        if(!o)B ;
                    }
                    ans += o ;
                }
            }
        }
    }
    R 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