제출 #297404

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297404		infinite_iq	Rectangles (IOI19_rect)	C++14	10 / 100	7 ms	512 KiB

rect

#include <bits/stdc++.h>
using namespace std ;
#define pb push_back
#define C continue 
#define lb lower_bound
typedef long long ll ;
typedef vector < int > vi ;
#include "rect.h"
int n , m ;
int a [3][2509] ;
long long count_rectangles ( vector <vi> A ) {
        n = A .size () ;
        m = A [0] .size () ; 
        for ( int i = 0 ; i < n ; i ++ ) {
                for ( int j = 0 ; j < m ; j ++ ) {
                        a [i][j] = A [i][j] ;
                }
        }
        if ( n <= 2 ) return 0 ;
        ll ans = 0 ;     
        for ( int i = 1 ; i < m - 1 ; i ++ ) {
                int mx = 0 ;
                for ( int j = i ; j < m -1 ; j ++ ) {
                        mx = max ( mx , a [1][j] ) ; 
                        if ( min ( a [0][j] , a [2][j] ) <= a [1][j] ) break ;
                        ans += ( min ( a [1][i-1] , a [1][j+1] ) > mx ) ;
                }
        }
        return ans ;
}

• 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