Submission #995998

#	Time	Username	Problem	Language	Result	Execution time	Memory
995998		Muaath_5	Quality Of Living (IOI10_quality)	C++17	60 / 100	5047 ms	31320 KiB

quality

#include "quality.h"
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename X>
using ordered_set = tree<X, null_type, less<X>, rb_tree_tag, tree_order_statistics_node_update>;



int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    int ans = R * C;
    int mid = H * W / 2;
    for (int a = 0; a + H - 1 < R; a++) {
        ordered_set<int> os;
        for (int i = 0; i < H; i++) {
            for (int j = 0; j < W; j++) {
                os.insert(Q[a + i][j]);
            }
        }
        ans = min(ans, *os.find_by_order(mid));

        for (int b = 0; b + W < C; b++) {
            // remove in column b, add in column b+W
            for (int i = 0; i < H; i++) {
                os.erase(Q[a + i][b]);
                os.insert(Q[a + i][b + W]);
            }
            ans = min(ans, *os.find_by_order(mid));
        }
    }
    return ans;
}

• Subtask 1: 20 / 20
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20