oj.uz

Submission #208899

# Submission time Handle Problem Language Result Execution time Memory
208899 2020-03-12T12:22:27 Z DodgeBallMan Quality Of Living (IOI10_quality) C++14
100 / 100
 3788 ms 184300 KB 
#include "quality.h"
#include <bits/stdc++.h>

#define pii pair<int, int>
#define x first
#define y second

using namespace std;

const int N = 3e3+5;

int sum[N][N], n, c, r, h, w;
pii pos[N*N];


bool chk( int mid, int rec[3001][3001] ) {
    for( int i = 1 ; i <= r ; i++ ) {
        for( int j = 1 ; j <= c ; j++ ) {
            if( rec[i-1][j-1] < mid ) sum[i][j] = -1;
            else if( rec[i-1][j-1] > mid ) sum[i][j] = 1;
            else sum[i][j] = 0;
        }
    }
    for( int i = 1 ; i <= r ; i++ )
        for( int j = 1 ; j <= c ; j++ )
            sum[i][j] += sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1];
    for( int i = h ; i <= r ; i++ ) 
        for( int j = w ; j <= c ; j++ ) 
            if( sum[i][j] - sum[i-h][j] - sum[i][j-w] + sum[i-h][j-w] <= 0  ) return true;
        
    
    return false;
}

int rectangle( int R, int C, int H, int W, int rec[3001][3001] ) {
    r = R, c = C, w = W, h = H;
    n = r*c;
    for( int i = 0 ; i < r ; i++ ) for( int j = 0 ; j < c ; j++ ) pos[rec[i][j]] = pii( i+1, j+1 );
    int l = 1, r = n;
    while( l < r ) {
        int m = l + r >> 1;
        if( chk( m, rec ) ) r = m;
        else l = m + 1;
    }
	return l;
}
/*int rrr[3001][3001];
int main()
{
    int r, c, h, w;
    scanf("%d %d %d %d",&r,&c,&h,&w);
    for( int i = 0 ; i < r ; i++ ) for( int j = 0 ; j < c ; j++ ) scanf("%d",&rrr[i][j]);
    printf("%d",rectangle( r, c, h, w, rrr ) );
}*/

Compilation message

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:41:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
         int m = l + r >> 1;
                 ~~^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 9 ms 1400 KB Output is correct
6 Correct 8 ms 1272 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 9 ms 1400 KB Output is correct
6 Correct 8 ms 1272 KB Output is correct
7 Correct 34 ms 4732 KB Output is correct
8 Correct 35 ms 4856 KB Output is correct
9 Correct 33 ms 4472 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 9 ms 1400 KB Output is correct
6 Correct 8 ms 1272 KB Output is correct
7 Correct 34 ms 4732 KB Output is correct
8 Correct 35 ms 4856 KB Output is correct
9 Correct 33 ms 4472 KB Output is correct
10 Correct 423 ms 30852 KB Output is correct
11 Correct 388 ms 30840 KB Output is correct
12 Correct 204 ms 19448 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 632 KB Output is correct
2 Correct 5 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Correct 8 ms 1400 KB Output is correct
5 Correct 9 ms 1400 KB Output is correct
6 Correct 8 ms 1272 KB Output is correct
7 Correct 34 ms 4732 KB Output is correct
8 Correct 35 ms 4856 KB Output is correct
9 Correct 33 ms 4472 KB Output is correct
10 Correct 423 ms 30852 KB Output is correct
11 Correct 388 ms 30840 KB Output is correct
12 Correct 204 ms 19448 KB Output is correct
13 Correct 3788 ms 184272 KB Output is correct
14 Correct 3750 ms 184300 KB Output is correct
15 Correct 3412 ms 172104 KB Output is correct