oj.uz

Submission #587400

# Submission time Handle Problem Language Result Execution time Memory
587400 2022-07-01T19:02:40 Z Omar_Elgedawy Quality Of Living (IOI10_quality) C++14
60 / 100
 5000 ms 21732 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//#include "grader.cpp"
#include "quality.h"
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
#define f               find_by_order
int rectangle(int n, int m, int r, int c, int a[3001][3001]) {
    ordered_set s;
    int ans=1e9;
    for(int i=0;i<=n-r;i++){
        s.clear();
        for(int k=i;k<i+r;k++){
            for(int j=0;j<c;j++){
                s.insert(a[k][j]);
            }
        }
        ans=min(ans,*s.f(s.size()/2));
        for(int j=0;j<m-c;j++){
            for(int k=i;k<r+i;k++){
                s.erase(a[k][j]);
            }
            for(int k=i;k<r+i;k++){
                s.insert(a[k][j+c]);
            }
            ans=min(ans,*s.f(s.size()/2));
        }
    }
	return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 61 ms 892 KB Output is correct
5 Correct 62 ms 724 KB Output is correct
6 Correct 60 ms 1056 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 61 ms 892 KB Output is correct
5 Correct 62 ms 724 KB Output is correct
6 Correct 60 ms 1056 KB Output is correct
7 Correct 2736 ms 3532 KB Output is correct
8 Correct 2116 ms 4308 KB Output is correct
9 Correct 2405 ms 3052 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 61 ms 892 KB Output is correct
5 Correct 62 ms 724 KB Output is correct
6 Correct 60 ms 1056 KB Output is correct
7 Correct 2736 ms 3532 KB Output is correct
8 Correct 2116 ms 4308 KB Output is correct
9 Correct 2405 ms 3052 KB Output is correct
10 Execution timed out 5056 ms 21732 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 61 ms 892 KB Output is correct
5 Correct 62 ms 724 KB Output is correct
6 Correct 60 ms 1056 KB Output is correct
7 Correct 2736 ms 3532 KB Output is correct
8 Correct 2116 ms 4308 KB Output is correct
9 Correct 2405 ms 3052 KB Output is correct
10 Execution timed out 5056 ms 21732 KB Time limit exceeded
11 Halted 0 ms 0 KB -