oj.uz

Submission #288356

# Submission time Handle Problem Language Result Execution time Memory
288356 2020-09-01T12:39:37 Z NemanjaSo2005 Quality Of Living (IOI10_quality) C++14
40 / 100
 5000 ms 4992 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
multiset<int> mediani,pocset;
int res;
int nadjim(){
   //cout<<mediani.size()<<endl;
    int koliko=mediani.size()/2;
    multiset<int>::iterator it = mediani.begin();
    while(koliko--)
        *it++;
    //cout<<*it<<endl;
    return *it;
}
int nadjip(){
    int koliko=pocset.size()/2;
    multiset<int>::iterator it = pocset.begin();
    while(koliko--)
        *it++;
   // cout<<*it<<endl;
    return *it;
}
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    for(int i=0;i<H;i++)
        for(int j=0;j<W;j++)
            pocset.insert(Q[i][j]);
    res=nadjip();
    mediani=pocset;
    for(int j=1;j+W<=C;j++){
        for(int i=0;i<H;i++){
            mediani.erase(Q[i][j-1]);
            mediani.insert(Q[i][j+W-1]);
            //cout<<mediani.size()<<endl;
        }
        res=min(res,nadjim());
    }
    for(int gde=1;gde<=R-H;gde++){
        for(int j=0;j<W;j++){
            pocset.erase(Q[gde-1][j]);
            pocset.insert(Q[gde+H-1][j]);
        }
        res=min(res,nadjip());
        mediani=pocset;
        for(int j=1;j+W<=C;j++){
            for(int i=gde;i<=gde+H-1;i++){
                mediani.erase(Q[i][j-1]);
                //cout<<Q[i][j-1]<<" "<<Q[i][j+C-3]<<endl;
                mediani.insert(Q[i][j+W-1]);
            }
        res=min(res,nadjim());
        }
    }
    return res;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 61 ms 1152 KB Output is correct
5 Correct 75 ms 1024 KB Output is correct
6 Correct 40 ms 1528 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 61 ms 1152 KB Output is correct
5 Correct 75 ms 1024 KB Output is correct
6 Correct 40 ms 1528 KB Output is correct
7 Execution timed out 5050 ms 4992 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 61 ms 1152 KB Output is correct
5 Correct 75 ms 1024 KB Output is correct
6 Correct 40 ms 1528 KB Output is correct
7 Execution timed out 5050 ms 4992 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 61 ms 1152 KB Output is correct
5 Correct 75 ms 1024 KB Output is correct
6 Correct 40 ms 1528 KB Output is correct
7 Execution timed out 5050 ms 4992 KB Time limit exceeded
8 Halted 0 ms 0 KB -