# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
481674 | 2021-10-21T10:15:35 Z | SlavicG | Quality Of Living (IOI10_quality) | C++17 | 5000 ms | 2648 KB |
#include"quality.h" #include "bits/stdc++.h" using namespace std; #define ll long long #define forn(i,n) for(int i=0;i<n;i++) #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(),v.rend() #define pb push_back #define sz(a) (int)a.size() const int N = 3001; int rectangle(int n, int m, int a, int b, int c[3001][3001]){ int ans = INT_MAX; for(int i = 0;i + a - 1 < n;++i){ for(int j = 0;j + b - 1 < m;++j){ int l = 1, r = n * m; vector<int> v; vector<int> cnt(n * m + 5, 0); for(int x = i;x < i + a;++x){ for(int y = j;y < j + b;++y){ ++cnt[c[x][y]]; } } for(int i = 1;i <= n * m;++i){ while(cnt[i]--)v.pb(i); } ans = min(ans, v[sz(v) / 2]); } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 0 ms | 332 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 0 ms | 332 KB | Output is correct |
4 | Correct | 115 ms | 716 KB | Output is correct |
5 | Correct | 208 ms | 756 KB | Output is correct |
6 | Correct | 47 ms | 716 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 0 ms | 332 KB | Output is correct |
4 | Correct | 115 ms | 716 KB | Output is correct |
5 | Correct | 208 ms | 756 KB | Output is correct |
6 | Correct | 47 ms | 716 KB | Output is correct |
7 | Execution timed out | 5065 ms | 2648 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 0 ms | 332 KB | Output is correct |
4 | Correct | 115 ms | 716 KB | Output is correct |
5 | Correct | 208 ms | 756 KB | Output is correct |
6 | Correct | 47 ms | 716 KB | Output is correct |
7 | Execution timed out | 5065 ms | 2648 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 332 KB | Output is correct |
2 | Correct | 1 ms | 332 KB | Output is correct |
3 | Correct | 0 ms | 332 KB | Output is correct |
4 | Correct | 115 ms | 716 KB | Output is correct |
5 | Correct | 208 ms | 756 KB | Output is correct |
6 | Correct | 47 ms | 716 KB | Output is correct |
7 | Execution timed out | 5065 ms | 2648 KB | Time limit exceeded |
8 | Halted | 0 ms | 0 KB | - |