oj.uz

Submission #733271

# Submission time Handle Problem Language Result Execution time Memory
733271 2023-04-30T10:36:14 Z That_Salamander Quality Of Living (IOI10_quality) C++17
40 / 100
 5000 ms 3224 KB 
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <set>

#define FOR(var,bound) for(int var = 0; var < bound; var++)
#define FORB(var,lb,ub) for (int var = lb; var < ub; var++)
#define FORR(var,bound) for(int var = bound-1; var >= 0; var--)

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pii;

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    int res = 10000000;
    for (int i = 0; i + H <= R; i++) {
        for (int j = 0; j + W <= C; j++) {
            vector<int> vals;

            for (int k = 0; k < H; k++) {
                for (int l = 0; l < W; l++) {
                    vals.push_back(Q[i + k][j + l]);
                }
            }

            sort(vals.begin(), vals.end());

            res = min(res, vals[H * W / 2]);
        }
    }

    return res;
}

#ifdef LOCAL_TEST
int grid[3001][3001];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    int r, c, h, w;
    cin >> r >> c >> h >> w;


    FOR(i, r) {
        FOR(j, c) {
            cin >> grid[i][j];
        }
    }

    cout << rectangle(r, c, h, w, grid) << endl;
}
#endif

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 432 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 243 ms 800 KB Output is correct
5 Correct 191 ms 776 KB Output is correct
6 Correct 141 ms 844 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 432 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 243 ms 800 KB Output is correct
5 Correct 191 ms 776 KB Output is correct
6 Correct 141 ms 844 KB Output is correct
7 Execution timed out 5026 ms 3224 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 432 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 243 ms 800 KB Output is correct
5 Correct 191 ms 776 KB Output is correct
6 Correct 141 ms 844 KB Output is correct
7 Execution timed out 5026 ms 3224 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 432 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 432 KB Output is correct
4 Correct 243 ms 800 KB Output is correct
5 Correct 191 ms 776 KB Output is correct
6 Correct 141 ms 844 KB Output is correct
7 Execution timed out 5026 ms 3224 KB Time limit exceeded
8 Halted 0 ms 0 KB -