oj.uz

Submission #854647

# Submission time Handle Problem Language Result Execution time Memory
854647 2023-09-28T10:11:13 Z abcvuitunggio Quality Of Living (IOI10_quality) C++17
100 / 100
 1382 ms 140264 KB 
#include "quality.h"
#include <iostream>
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	int l=1,r=R*C,kq=0,S[R][C];
	while (l<=r){
        int mid=(l+r)>>1,ch=0;
        for (int i=0;i<R;i++)
            for (int j=0;j<C;j++){
                S[i][j]=(i?S[i-1][j]:0)+(j?S[i][j-1]:0)-(i&&j?S[i-1][j-1]:0)+(Q[i][j]<mid)-(Q[i][j]>mid);
                if (i>=H-1&&j>=W-1&&S[i][j]-(i<H?0:S[i-H][j])-(j<W?0:S[i][j-W])+(i<H||j<W?0:S[i-H][j-W])>=0)
                    ch=1;
            }
        if (ch){
            kq=mid;
            r=mid-1;
        }
        else
            l=mid+1;
	}
	return kq;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 14 ms 5464 KB Output is correct
8 Correct 12 ms 5468 KB Output is correct
9 Correct 11 ms 5212 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 14 ms 5464 KB Output is correct
8 Correct 12 ms 5468 KB Output is correct
9 Correct 11 ms 5212 KB Output is correct
10 Correct 141 ms 23584 KB Output is correct
11 Correct 145 ms 23716 KB Output is correct
12 Correct 69 ms 18084 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 2396 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 14 ms 5464 KB Output is correct
8 Correct 12 ms 5468 KB Output is correct
9 Correct 11 ms 5212 KB Output is correct
10 Correct 141 ms 23584 KB Output is correct
11 Correct 145 ms 23716 KB Output is correct
12 Correct 69 ms 18084 KB Output is correct
13 Correct 1382 ms 140264 KB Output is correct
14 Correct 1376 ms 140260 KB Output is correct
15 Correct 1256 ms 129620 KB Output is correct