oj.uz

Submission #501049

# Submission time Handle Problem Language Result Execution time Memory
501049 2022-01-02T09:48:01 Z beaconmc Quality Of Living (IOI10_quality) C++14
60 / 100
 5000 ms 57984 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;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
  
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>

int pos[9000001][2];
int pref[3001][3001];
int r,c,h,w;


bool check(int x){
    FOR(i,0,3000){
        FOR(j,0,3000){
            pref[i][j] = 0;
        }
    }

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

    FOR(i,0,r){
        if (pref[i][0] > int(h*w/2)) return true;
        FOR(j,1,c){
            pref[i][j] += pref[i][j-1];
            if (pref[i][j]> int(h*w/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;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 35660 KB Output is correct
2 Correct 44 ms 35640 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 35660 KB Output is correct
2 Correct 44 ms 35640 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 74 ms 36084 KB Output is correct
5 Correct 66 ms 36044 KB Output is correct
6 Correct 65 ms 36036 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 35660 KB Output is correct
2 Correct 44 ms 35640 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 74 ms 36084 KB Output is correct
5 Correct 66 ms 36044 KB Output is correct
6 Correct 65 ms 36036 KB Output is correct
7 Correct 202 ms 38312 KB Output is correct
8 Correct 185 ms 38308 KB Output is correct
9 Correct 174 ms 38140 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 35660 KB Output is correct
2 Correct 44 ms 35640 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 74 ms 36084 KB Output is correct
5 Correct 66 ms 36044 KB Output is correct
6 Correct 65 ms 36036 KB Output is correct
7 Correct 202 ms 38312 KB Output is correct
8 Correct 185 ms 38308 KB Output is correct
9 Correct 174 ms 38140 KB Output is correct
10 Execution timed out 5069 ms 57984 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 35660 KB Output is correct
2 Correct 44 ms 35640 KB Output is correct
3 Correct 48 ms 35656 KB Output is correct
4 Correct 74 ms 36084 KB Output is correct
5 Correct 66 ms 36044 KB Output is correct
6 Correct 65 ms 36036 KB Output is correct
7 Correct 202 ms 38312 KB Output is correct
8 Correct 185 ms 38308 KB Output is correct
9 Correct 174 ms 38140 KB Output is correct
10 Execution timed out 5069 ms 57984 KB Time limit exceeded
11 Halted 0 ms 0 KB -