oj.uz

Submission #866666

# Submission time Handle Problem Language Result Execution time Memory
866666 2023-10-26T16:14:06 Z nasir_bashirov Quality Of Living (IOI10_quality) C++17
60 / 100
 5000 ms 28452 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#include "quality.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
 
#define db long double
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define vll vector<pll>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define fastio\
    ios_base::sync_with_stdio(0);\
    cin.tie(0);\
    cout.tie(0)\
 
typedef tree<
pii,
null_type,
less<pii>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
 
int rectangle(int r, int c, int h, int w, int Q[3001][3001]) {
	int res = 1e9, tt = 0;
	for(int i = 1; i <= r - h + 1; i++){
		ordered_set st;
		for(int a = 1; a < w; a++){
			for(int b = i; b <= i + h - 1; b++){
				st.insert({Q[b - 1][a - 1], tt++});
			}
		}
		for(int a = w; a <= c; a++){
			for(int b = i; b <= i + h - 1; b++){
				st.insert({Q[b - 1][a - 1], tt++});
			}
			if(a > w){
				for(int b = i; b <= i + h - 1; b++){
					st.erase(st.lower_bound({Q[b - 1][a - w - 1], -1}));
				}
			}
			res = min(res, (*st.find_by_order(h * w / 2)).first);
		}
	}
	return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 49 ms 2652 KB Output is correct
5 Correct 51 ms 2584 KB Output is correct
6 Correct 44 ms 2904 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 49 ms 2652 KB Output is correct
5 Correct 51 ms 2584 KB Output is correct
6 Correct 44 ms 2904 KB Output is correct
7 Correct 2303 ms 6328 KB Output is correct
8 Correct 1731 ms 7180 KB Output is correct
9 Correct 1959 ms 5628 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 49 ms 2652 KB Output is correct
5 Correct 51 ms 2584 KB Output is correct
6 Correct 44 ms 2904 KB Output is correct
7 Correct 2303 ms 6328 KB Output is correct
8 Correct 1731 ms 7180 KB Output is correct
9 Correct 1959 ms 5628 KB Output is correct
10 Execution timed out 5045 ms 28452 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 49 ms 2652 KB Output is correct
5 Correct 51 ms 2584 KB Output is correct
6 Correct 44 ms 2904 KB Output is correct
7 Correct 2303 ms 6328 KB Output is correct
8 Correct 1731 ms 7180 KB Output is correct
9 Correct 1959 ms 5628 KB Output is correct
10 Execution timed out 5045 ms 28452 KB Time limit exceeded
11 Halted 0 ms 0 KB -