Submission #253614

#	Time	Username	Problem	Language	Result	Execution time	Memory
253614		khangal	Rectangles (IOI19_rect)	C++14	10 / 100	22 ms	29472 KiB

rect

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define po pop_back
#define pb push_back
#define mk make_pair
#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
// 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 sz,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<ll> v[1234567];
string s1,s;
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
struct trio{
    ll x,y;
}str[1234567];
bool comp(trio &a,trio &b) {
    return (a.y < b.y);
    return false;
}
long long count_rectangles(vector<vector<int> > a){
    ll n = a.size();
    ll m = a[0].size();
    if (n <= 2) return 0;
    ll cnt = 0;
    for(ll i = 0; i < m-1; i++) {
        ll mx = a[1][i+1];
        if (mx >= a[1][i]) continue;
        for (ll j = i+2; j < m; j++) {
            if (a[0][j-1] <= a[1][j-1] || a[2][j-1] <= a[1][j-1]) break;
            if (a[1][j] > mx) {
                mx = a[1][j];
                cnt++;
                if(mx >= a[1][i]) break;
            }
        }
    }
    return cnt;
}

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