제출 #124526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124526		deinfreund	과수원 (NOI14_orchard)	C++14	13 / 25	544 ms	165404 KiB

orchard

#include <bits/stdc++.h>

using namespace std;

int solve1D(vector<int> vals){
  vector<int> sums(vals.size());
  int totalTrees;

  for (int x= 0; x < vals.size(); x++){
    /*cin >> vals[x][y];
    totalTrees[y] += vals[x][y];
    vals[x][y] = 2 * vals[x][y] - 1;
    if (x > 0) sums[x][y] += sums[x-1][y];
    sums[x][y] += vals[x][y];*/
  }
}

int main(){
  int h, w;
  cin >> h >> w;
  vector<vector<int> > sums(w, vector<int>(h));
  vector<vector<int>> totalTrees(w, vector<int>(h));
  vector<vector<int> > vals(w, vector<int>(h));
  for (int y = 0; y< h; y++){
    for (int x= 0; x < w; x++){
      cin >> vals[x][y];
      totalTrees[x][y] += vals[x][y];
      if (x > 0) totalTrees[x][y] += totalTrees[x-1][y];
      vals[x][y] = 2 * vals[x][y] - 1;
      if (x > 0) sums[x][y] += sums[x-1][y];
      sums[x][y] += vals[x][y];
    }
  }
  for (int y = 0; y< h; y++){
    int minv = 0;
    int minx = -1;
    int bests = 0;
    int beste = 0;
    int bestv = 0;
    for (int x= 0; x < w; x++){
      if (sums[x][y] < minv){
	minv = sums[x][y];
	minx = x;
      }
      int v = sums[x][y] - minv;
      if (v > bestv){
	bestv = v;
	bests = minx;
	beste = x;
      }
    }
    //    cout << bests << " - " << beste << ": " << bestv << endl;
    cout << totalTrees[w - 1][y] - 2*(totalTrees[beste][y] - (bests < 0 ? 0 : totalTrees[bests][y])) + beste - bests << endl;
  }
}

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

orchard.cpp: In function 'int solve1D(std::vector<int>)':
orchard.cpp:9:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int x= 0; x < vals.size(); x++){
                  ~~^~~~~~~~~~~~~
orchard.cpp:7:7: warning: unused variable 'totalTrees' [-Wunused-variable]
   int totalTrees;
       ^~~~~~~~~~
orchard.cpp:16:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 4 / 4
• Subtask 2: 4 / 4
• Subtask 3: 5 / 5
• Subtask 4: 0 / 3
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5