oj.uz

Submission #503598

# Submission time Handle Problem Language Result Execution time Memory
503598 2022-01-08T12:03:46 Z LouayFarah Quality Of Living (IOI10_quality) C++14
40 / 100
 5000 ms 2764 KB 
#include "bits/stdc++.h"

using namespace std;

#define endl "\n"
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second

const long long MOD = 1e9+7;
const long long INF = 1e18;

int nx[4] = {0, 0, -1, 1};
int ny[4] = {1, -1, 0, 0};

int rectangle(int r, int c, int h, int w, int q[3001][3001])
{
    int res = 1e8;
    for(int i = 0; i<=r-h; i++)
    {
        for(int j = 0; j<=c-w; j++)
        {
            vector<int> arr;
            for(int k = i; k<h+i; k++)
            {
                for(int t = j; t<w+j; t++)
                {
                    arr.pb(q[k][t]);
                }
            }

            sort(arr.begin(), arr.end());
            int len = int(arr.size());
            int curr = arr[len/2];

            res = min(res, curr);
        }
    }

    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 240 ms 796 KB Output is correct
5 Correct 192 ms 780 KB Output is correct
6 Correct 139 ms 844 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 240 ms 796 KB Output is correct
5 Correct 192 ms 780 KB Output is correct
6 Correct 139 ms 844 KB Output is correct
7 Execution timed out 5060 ms 2764 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 240 ms 796 KB Output is correct
5 Correct 192 ms 780 KB Output is correct
6 Correct 139 ms 844 KB Output is correct
7 Execution timed out 5060 ms 2764 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 428 KB Output is correct
2 Correct 1 ms 424 KB Output is correct
3 Correct 1 ms 428 KB Output is correct
4 Correct 240 ms 796 KB Output is correct
5 Correct 192 ms 780 KB Output is correct
6 Correct 139 ms 844 KB Output is correct
7 Execution timed out 5060 ms 2764 KB Time limit exceeded
8 Halted 0 ms 0 KB -