Submission #1091086

#	Time	Username	Problem	Language	Result	Execution time	Memory
1091086		steveonalex	Quality Of Living (IOI10_quality)	C++17	Compilation error	0 ms	0 KiB

quality

#include <bits/stdc++.h>
#include "quality.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 301;

int rectangle(int R, int C, int H, int W, int Q[N][N]) {
    int l = 1, r = R * C;
    ll half_way = (H * W + 1) / 2;
    while(l < r){
        int mid = (l + r) >> 1;
        int cnt[N][N]; memset(cnt, 0, sizeof cnt);

        // cout << "Mid: " << mid << "\n";
        for(int i = 0; i < R; ++i) for(int j = 0; j < C; ++j) cnt[i+1][j+1] = (Q[i][j] <= mid);
        for(int i = 1; i<=R; ++i) for(int j = 1; j <= C; ++j){
            cnt[i][j] = cnt[i][j] + cnt[i-1][j] + cnt[i][j-1] - cnt[i-1][j-1];
        }
        // for(int i = 1; i<=R; ++i) {
        //     for(int j = 1; j<=C; ++j) cout << cnt[i][j] << " ";
        //     cout << "\n";
        // }
        bool check = false;
        for(int i = H; i<=R; ++i) for(int j = W; j <= C; ++j){
            int cur = cnt[i][j] - cnt[i - H][j] - cnt[i][j - W] + cnt[i - H][j - W];
            if (cur >= half_way) check = true;
        }
        if (check) r = mid;
        else l = mid + 1;
    }
    return l;
}


// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     int R, C, H, W;
//     int Q[N][N];
//     cin >> R >> C >> H >> W;
//     for(int i = 0; i<R; ++i) for(int j = 0; j < C; ++j) cin >> Q[i][j];

//     cout << rectangle(R, C, H, W, Q) << "\n";

//     return 0;
// }

Compilation message (stderr)

/usr/bin/ld: /tmp/ccTMFJfv.o: in function `main':
grader.cpp:(.text.startup+0xe9): undefined reference to `rectangle(int, int, int, int, int (*) [3001])'
collect2: error: ld returned 1 exit status