oj.uz

Submission #341867

# Submission time Handle Problem Language Result Execution time Memory
341867 2020-12-31T10:19:30 Z AmineWeslati Quality Of Living (IOI10_quality) C++14
40 / 100
 5000 ms 2412 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}
#ifndef LOCAL
#include "quality.h"
#endif

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
	int l=1,r=R*C;
	int ans;
	while(l<=r){
		int m=(l+r)/2;
		bool y=false;
		FOR(i,0,R-H+1) FOR(j,0,C-W+1){
			int cnt=0;
			FOR(k,i,i+H) FOR(l,j,j+W){
				if(Q[k][l]<=m) cnt++;

			}
			if(cnt>=(H*W+1)/2) y=true;
		}

		if(y){
			ans=m; r=m-1;
		}
		else l=m+1;
	}
	return ans;
}

/*
5 5 3 3
5 11 12 16 25
17 18 2 7 10
4 23 20 3 1
24 21 19 14 9
6 22 8 13 15
*/

#ifdef LOCAL
int g[3001][3001]; 
int main() {
    boost; IO();

    int R,C,H,W; cin>>R>>C>>H>>W;
    FOR(i,0,R) FOR(j,0,C) cin>>g[i][j];
    cout << rectangle(R,C,H,W,g) << endl;


    

    return 0;
}
#endif

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Compilation message

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:88:9: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   88 |  return ans;
      |         ^~~

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 62 ms 748 KB Output is correct
5 Correct 72 ms 876 KB Output is correct
6 Correct 36 ms 748 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 62 ms 748 KB Output is correct
5 Correct 72 ms 876 KB Output is correct
6 Correct 36 ms 748 KB Output is correct
7 Execution timed out 5065 ms 2412 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 62 ms 748 KB Output is correct
5 Correct 72 ms 876 KB Output is correct
6 Correct 36 ms 748 KB Output is correct
7 Execution timed out 5065 ms 2412 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 62 ms 748 KB Output is correct
5 Correct 72 ms 876 KB Output is correct
6 Correct 36 ms 748 KB Output is correct
7 Execution timed out 5065 ms 2412 KB Time limit exceeded
8 Halted 0 ms 0 KB -