제출 #1211467

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1211467		sula2	모자이크 (IOI24_mosaic)	C++20	8 / 100	74 ms	11788 KiB

mosaic

#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define popcount(x) __builtin_popcountll(x)
using namespace std;
using namespace chrono;

vector<long long> mosaic(
        vector<int> X, vector<int> Y,
        vector<int> T, vector<int> B,
        vector<int> L, vector<int> R
        ) {
    int n = X.size();
    int q = T.size();
    vector<long long> ans(q);
    for (int i = 0; i < q; i++) {
        int r1 = T[i];
        int c1 = L[i];
        int r2 = B[i];
        int c2 = R[i];
        if (r1 == 0) r1++;
        if (c1 == 0) c1++;
        if (r1 > r2 || c1 > c2) {
            ans[i] = 0;
            continue;
        }
        long long area = max(0LL, 1LL*(r2 - r1 + 1)*(c2 - c1 + 1));
        ans[i] = area/2;
        if (r1 % 2 == c1 % 2 && area % 2) ans[i]++;
    }
    return ans;
}

//int main() {
//    vector<int> X = {0, 0, 0, 0, 0, 0, 0, 0};
//    vector<int> Y = {0, 0, 0, 0, 0, 0, 0, 0};
//    for (auto x : mosaic(X, Y,
//                         {0, 2, 0},
//                         {3, 3, 1},
//                         {0, 0, 0},
//                         {3, 2, 1})) {
//        cout << x << "\n";
//    }
//}

• 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