제출 #77037

#제출 시각아이디문제언어결과실행 시간메모리
77037win11905과수원 (NOI14_orchard)C++11
25 / 25
276 ms14376 KiB
#include <bits/stdc++.h> using namespace std; int n, m, ans = 1e9; int main() { scanf("%d %d", &n, &m); vector<vector<int>> dp(n+1, vector<int>(m+1)); for(int i = 1; i <= n; ++i) for(int j = 1, ret; j <= m; ++j) scanf("%1d", &ret), dp[i][j] = ret + dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1]; for(int i = 0 ; i < n; ++i) for(int j = i+1; j <= n; ++j) { int mn = 1e9; for(int k = 1; k <= m; ++k) { mn = min(mn, 2 * (dp[j][k-1] - dp[i][k-1]) + (i - j) * (k-1)); ans = min(ans, dp[n][m] - 2 * (dp[j][k] - dp[i][k]) + (j - i) * k + mn); } } printf("%d\n", ans); }

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

orchard.cpp: In function 'int main()':
orchard.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
orchard.cpp:9:84: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; ++i) for(int j = 1, ret; j <= m; ++j) scanf("%1d", &ret), dp[i][j] = ret + dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1];
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...