제출 #755040

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
755040		Unforgettablepl	삶의 질 (IOI10_quality)	C++17	0 / 100	3 ms	724 KiB

quality

/*
ID: samikgo1
TASK:
LANG: C++
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define f first
#define s second
//#define x first
//#define y second
const int INF = INT32_MAX;
#include "quality.h"
int rectangle(int R, int C, int H, int W, int Q[3001][3001]) {
    ll ans = INFINITY;
    for (int i = 0; i < R-H; i++) {
        for (int j = 0; j < C-W; j++) {
            vector<ll> quality;
            for (int k = i; k < i+H; k++) {
                for (int l = j; l < j+W; l++) {
                    quality.emplace_back(Q[k][l]);
                }
            }
            ans = min(ans,quality[quality.size()>>1]);
        }
    }
    cout << ans;
}
//
//int main() {
//    ios_base::sync_with_stdio(false);
//    cin.tie(nullptr);
////    freopen("haybales.in","r",stdin);
////    freopen("haybales.out","w",stdout);
//    ll r,c,h,w;
//    cin >> r >> c >> h >> w;
//    vector<vector<ll>> grid(r,vector<ll>(c));
//    for(auto&i:grid)for(ll&j:i)cin>>j;
//    ll ans = INFINITY;
//    for (int i = 0; i < r-h; i++) {
//        for (int j = 0; j < c-w; j++) {
//            vector<ll> quality;
//            for (int k = i; k < i+h; k++) {
//                for (int l = j; l < j+h; l++) {
//                    quality.emplace_back(grid[k][l]);
//                }
//            }
//            ans = min(ans,quality[quality.size()>>1]);
//        }
//    }
//    cout << ans;
//}

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

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:19:14: warning: overflow in conversion from 'float' to 'll' {aka 'long long int'} changes value from '+Inff' to '9223372036854775807' [-Woverflow]
   19 |     ll ans = INFINITY;
      |              ^~~~~~~~
quality.cpp:32:1: warning: no return statement in function returning non-void [-Wreturn-type]
   32 | }
      | ^

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