제출 #824609

#제출 시각아이디문제언어결과실행 시간메모리
824609exodus_Orchard (NOI14_orchard)C++14
17 / 25
390 ms8176 KiB
#include<bits/stdc++.h> using namespace std; int orch[155][5005]; int main() { int r,c; int hitone=0; cin >> r >> c; for(int i=1; i<=r; i++) { for(int j=1; j<=c; j++) { cin >> orch[i][j]; if(orch[i][j]==1) hitone++; } } int answer = hitone; int ter, sum; for(int i=1; i<=r; i++) { vector<int>co(c+1,0); for(int j=i; j<=r; j++) { sum = 0; ter = 0; for(int kol=1; kol<=c; kol++) { if(orch[j][kol]==0) { sum++; } else { sum--; } co[kol]+=sum; answer = min(answer, hitone+co[kol]-ter); ter = max(ter, co[kol]); } } } cout << answer << endl; return 0; }
#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...