제출 #896125

#제출 시각아이디문제언어결과실행 시간메모리
896125Macker삶의 질 (IOI10_quality)C++14
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h> #include "quality.h" //#pragma GCC optimize("Ofast") //#pragma GCC target("avx2") using namespace std; typedef long long ll; typedef long double ld; #define all(v) v.begin(), v.end() #define ckmin(a, b) a = min(a, b) void add(int x, multiset<int>& low, multiset<int>& hig){ int m; if(low.size() == 0) m = 0; else m = *(--low.end()); if(x >= m){ hig.insert(x); while(hig.size() >= low.size()){ low.insert(*hig.begin()); hig.erase(*hig.begin()); } } else { low.insert(x); while(low.size() > hig.size() + 1) { hig.insert(*(--low.end())); low.erase(--low.end()); } } } void rem(int x, multiset<int>& low, multiset<int>& hig){ if(low.find(x) != low.end()){ low.erase(low.find(x)); while(hig.size() >= low.size()){ low.insert(*hig.begin()); hig.erase(*hig.begin()); } } else { hig.erase(hig.find(x)); while(low.size() > hig.size() + 1) { hig.insert(*(--low.end())); low.erase(--low.end()); } } } void rectangle(int r, int c, int h, int w, int *v){ multiset<int> low, hig; int mn = INT_MAX; for (int i = 0; i < r - h; i++) { for (int j = 0; j < w; j++) { for (int k = 0; k < h; k++){ add(v[i + k][j], low, hig); } } mn = min(mn, (*--low.end())); for (int j = w; j < c; j++) { for (int k = 0; k < h; k++) { rem(v[i + k][j - w], low, hig); } for (int k = 0; k < h; k++) { add(v[i + k][j], low, hig); } mn = min(mn, (*--low.end())); } } cout << mn << endl; }

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

quality.cpp: In function 'void rectangle(int, int, int, int, int*)':
quality.cpp:57:29: error: invalid types 'int[int]' for array subscript
   57 |                 add(v[i + k][j], low, hig);
      |                             ^
quality.cpp:64:29: error: invalid types 'int[int]' for array subscript
   64 |                 rem(v[i + k][j - w], low, hig);
      |                             ^
quality.cpp:67:29: error: invalid types 'int[int]' for array subscript
   67 |                 add(v[i + k][j], low, hig);
      |                             ^