oj.uz

Submission #538794

# Submission time Handle Problem Language Result Execution time Memory
538794 2022-03-17T18:27:25 Z beaconmc Quality Of Living (IOI10_quality) C++14
0 / 100
 945 ms 35668 KB 
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;

#define ll int

ll pos[10000000][2];
ll pref[3001][3001];
ll r, c, h, w;

bool check(ll x){
    FOR(i,0,3001){
        FOR(j,0,3001){
            pref[i][j] = 0;
        }
    }
    FOR(i,1,x+1){
        ll a = pos[i][0];
        ll b = pos[i][1];
        pref[a+1][b+1] += 1;
        pref[max(0, a+1-h)][b+1] -= 1;
        pref[a+1][max(0, b+1-w)] -= 1;
        pref[max(0, a+1-h)][max(0, b+1-w)] += 1;

        FOR(i,0,3001){
            FOR(j,1,3001){
                pref[i][j] += pref[i-1][j];
            }
        }
        FOR(i,0,3001){
            FOR(j,1,3001){
                pref[j][i] += pref[j-1][i];
            }
        }

        FOR(i,0,3001){
            FOR(j,0,3001){
                if (pref[i][j] >= (r+c)/2){
                    return true;
                }
            }
        }
        return false;
        
    }
}

int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    r = R; c = C; h = H; w = W;
    FOR(i,0,R){
        FOR(j,0,C){
            pos[Q[i][j]][0] = i;
            pos[Q[i][j]][1] = j;
        }
    }
 
    int lo = 0;
    int hi = int(R*C/2)+1;
    while (lo < hi) {
		int mid = lo + (hi - lo) / 2;
		if (check(mid)) {
			hi = mid;
		} else {
			lo = mid + 1;
		}
	}
	return lo;
}

Compilation message

quality.cpp: In function 'bool check(int)':
quality.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 945 ms 35668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 945 ms 35668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 945 ms 35668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 945 ms 35668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 945 ms 35668 KB Output isn't correct
2 Halted 0 ms 0 KB -