oj.uz

Submission #525443

# Submission time Handle Problem Language Result Execution time Memory
525443 2022-02-11T16:11:54 Z SmolBrain Quality Of Living (IOI10_quality) C++17
100 / 100
 2016 ms 175460 KB 
#include "quality.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

int rectangle(int n, int m, int rows, int cols, int a[3001][3001]) {
    int b[3005][3005], pre[3005][3005];
    rep(i, n) {
        rep(j, m) {
            b[i + 1][j + 1] = a[i][j];
        }
    }

    int cnt = (rows * cols + 1) / 2;
    int l = 1, r = n * m;
    int ans;

    auto check = [&](int mid) {
        rep1(i, n) {
            rep1(j, m) {
                pre[i][j] = pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1] + (b[i][j] <= mid);
            }
        }

        for (int i = rows; i <= n; ++i) {
            for (int j = cols; j <= m; ++j) {
                int sum = pre[i][j] - pre[i - rows][j] - pre[i][j - cols] + pre[i - rows][j - cols];
                if (sum >= cnt) {
                    return true;
                }
            }
        }

        return false;
    };

    while (l <= r) {
        int mid = (l + r) / 2;
        if (check(mid)) {
            ans = mid;
            r = mid - 1;
        }
        else {
            l = mid + 1;
        }
    }

    return ans;
}

Compilation message

quality.cpp: In function 'void usaco(std::string)':
quality.cpp:59:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
quality.cpp:60:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:110:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
  110 |     return ans;
      |            ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 71052 KB Output is correct
2 Correct 35 ms 71076 KB Output is correct
3 Correct 30 ms 70976 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 71052 KB Output is correct
2 Correct 35 ms 71076 KB Output is correct
3 Correct 30 ms 70976 KB Output is correct
4 Correct 30 ms 71440 KB Output is correct
5 Correct 33 ms 71456 KB Output is correct
6 Correct 33 ms 71364 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 71052 KB Output is correct
2 Correct 35 ms 71076 KB Output is correct
3 Correct 30 ms 70976 KB Output is correct
4 Correct 30 ms 71440 KB Output is correct
5 Correct 33 ms 71456 KB Output is correct
6 Correct 33 ms 71364 KB Output is correct
7 Correct 51 ms 72988 KB Output is correct
8 Correct 59 ms 72936 KB Output is correct
9 Correct 46 ms 72936 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 71052 KB Output is correct
2 Correct 35 ms 71076 KB Output is correct
3 Correct 30 ms 70976 KB Output is correct
4 Correct 30 ms 71440 KB Output is correct
5 Correct 33 ms 71456 KB Output is correct
6 Correct 33 ms 71364 KB Output is correct
7 Correct 51 ms 72988 KB Output is correct
8 Correct 59 ms 72936 KB Output is correct
9 Correct 46 ms 72936 KB Output is correct
10 Correct 257 ms 85520 KB Output is correct
11 Correct 240 ms 85580 KB Output is correct
12 Correct 142 ms 80120 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 71052 KB Output is correct
2 Correct 35 ms 71076 KB Output is correct
3 Correct 30 ms 70976 KB Output is correct
4 Correct 30 ms 71440 KB Output is correct
5 Correct 33 ms 71456 KB Output is correct
6 Correct 33 ms 71364 KB Output is correct
7 Correct 51 ms 72988 KB Output is correct
8 Correct 59 ms 72936 KB Output is correct
9 Correct 46 ms 72936 KB Output is correct
10 Correct 257 ms 85520 KB Output is correct
11 Correct 240 ms 85580 KB Output is correct
12 Correct 142 ms 80120 KB Output is correct
13 Correct 2016 ms 175416 KB Output is correct
14 Correct 1890 ms 175460 KB Output is correct
15 Correct 1727 ms 168356 KB Output is correct