제출 #1099881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1099881		model_code	모자이크 (IOI24_mosaic)	C++17	8 / 100	108 ms	15088 KiB

mosaic

// incorrect/subtask5.cpp

#include "mosaic.h"
#include "bits/stdc++.h"
using namespace std;

vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
    vector<long long> ans;
    for(int i = 0; i < T.size(); i++) {
        int rx = T[i], ry = B[i];
        int cx = L[i], cy = R[i];
        rx = max(rx, 1);
        cx = max(cx, 1);
        if(rx <= ry && cx <= cy) {
            long long area = 1ll*(ry-rx+1)*(cy-cx+1);
            ans.push_back((area+((rx+cx)&1^1)) / 2);
        }   else ans.push_back(0);
    }
    
    return ans;
}

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

mosaic.cpp: In function 'std::vector<long long int> mosaic(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
mosaic.cpp:9:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i = 0; i < T.size(); i++) {
      |                    ~~^~~~~~~~~~
mosaic.cpp:16:41: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   16 |             ans.push_back((area+((rx+cx)&1^1)) / 2);
      |                                  ~~~~~~~^~

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 7
• Subtask 3: 0 / 7
• Subtask 4: 0 / 10
• Subtask 5: 8 / 8
• Subtask 6: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22