제출 #738502

#제출 시각아이디문제언어결과실행 시간메모리
738502grossly_overconfident삶의 질 (IOI10_quality)C++17
0 / 100
1 ms468 KiB
#include <bits/stdc++.h> using namespace std; void chuck(set<int>::iterator& mid, set<int>& s, int in, set<int>::iterator& out){ if (*mid == *out){ if (in > *mid){ s.insert(in); ++mid; s.erase(out); return; } s.insert(in); --mid; s.erase(out); return; } if (in < *mid && *mid < *out){ s.insert(in); --mid; s.erase(out); return; } if (*out < *mid && *mid < in){ s.insert(in); ++mid; s.erase(out); return; } s.insert(in); s.erase(out); return; } int rectangle(int R, int C, int H, int W, int Q[3001][3001]) { set<int> s; for (int i = 0; i < H; ++i){ for (int j = 0; j < W; ++j){ s.insert(Q[i][j]); } } auto mid = s.begin(); for (int i = 0; i < (s.size() - 1) / 2; ++i){ mid++; } int best = *mid; for (int i = 0; i < C - W + 1; ++i){ for (int j = 0; j < R - H + 1; ++j){ if (i % 2 == 0){ if (j == R - H){ for (int k = 0; k < H; ++k){ auto out = s.find(Q[j + k][i]); chuck(mid, s, Q[j + k][i + W], out); } } else{ for (int k = 0; k < W; ++k){ auto out = s.find(Q[j][i + k]); chuck(mid, s, Q[j + H][i + k], out); } } } else{ int p = R - H - j; if (p == 0){ for (int k = 0; k < H; ++k){ auto out = s.find(Q[p + k][i]); chuck(mid, s, Q[p + k][i + W], out); } } else{ for (int k = 0; k < W; ++k){ auto out = s.find(Q[p + H - 1][i + k]); chuck(mid, s, Q[p - 1][i + k], out); } } } best = min(best, *mid); } } return best; }

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

quality.cpp: In function 'int rectangle(int, int, int, int, int (*)[3001])':
quality.cpp:43:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |  for (int i = 0; i < (s.size() - 1) / 2; ++i){
      |                  ~~^~~~~~~~~~~~~~~~~~~~
#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...