제출 #357591

#제출 시각아이디문제언어결과실행 시간메모리
357591Mefarnis삶의 질 (IOI10_quality)C++14
0 / 100
5099 ms35692 KiB
#include <bits/stdc++.h> #include "quality.h" #include "grader.h" #define maxn 3001 using namespace std; int sum[maxn][maxn]; int rectangle(int n, int m, int h, int w, int ar[3001][3001]) { int N = n*m , ans; int l = 1 , r = N; while(l <= r) { int mid = (l+r) >> 1; memset(sum,0,sizeof(sum)); for( int i = 1 ; i <= n ; i++ ) for( int j = 1 ; j <= m ; j++ ) { int add = (ar[i-1][j-1] >= mid) ? +1 : -1; sum[i][j] = sum[i-1][j] + sum[i][j-1] - sum[i-1][j-1] + add; } bool ok = false; for( int r = h ; r <= n ; r++ ) for( int c = w ; c <= m ; c++ ) { int total = sum[r][c] - sum[r-h][c] - sum[r][c-w] + sum[r-h][c-w]; if(total > 0) ok = true; } if(ok) ans = mid , r = mid-1; else l = mid+1; } }

컴파일 시 표준 에러 (stderr) 메시지

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:10:16: warning: variable 'ans' set but not used [-Wunused-but-set-variable]
   10 |  int N = n*m , ans;
      |                ^~~
quality.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
   32 | }
      | ^
#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...