Submission #985246

#TimeUsernameProblemLanguageResultExecution timeMemory
985246LOLOLOQuality Of Living (IOI10_quality)C++14
0 / 100
1 ms4444 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; #define f first #define s second #define pb push_back #define ep emplace #define eb emplace_back #define lb lower_bound #define ub upper_bound #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin()) #define mem(f,x) memset(f , x , sizeof(f)) #define sz(x) (int)(x).size() #define __lcm(a, b) (1ll * ((a) / __gcd((a), (b))) * (b)) #define mxx *max_element #define mnn *min_element #define cntbit(x) __builtin_popcountll(x) #define len(x) (int)(x.length()) const int N = 3e3 + 10; int mat[N][N]; int n, m, x, y; int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { n = R, m = C, x = H, y = W; int l = 0, r = R * C, ans; while (l <= r) { int mid = (l + r) / 2; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (Q[i - 1][j - 1] <= mid) { mat[i][j] = 1; } else { mat[i][j] = -1; } mat[i][j] = mat[i - 1][j] + mat[i - 1][j] - mat[i - 1][j - 1] + mat[i][j]; if (i >= x && j >= y) { int cnt = mat[i][j] - mat[i - x][j] - mat[i][j - y] + mat[i - x][j - y]; if (cnt >= 0) { ans = mid; l = mid + 1; } else { r = mid - 1; } } } } } return ans; }

Compilation message (stderr)

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:53:12: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |     return ans;
      |            ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...