제출 #1204256

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204256		perekopskad	모자이크 (IOI24_mosaic)	C++20	7 / 100	72 ms	14408 KiB

mosaic

#include "mosaic.h"
#include <vector>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pii pair <ll, ll>
#define el '\n'
#define fr(i, l, r) for(ll (i) = l; (i) <= r; (i)++)
#define frb(i, r, l) for(ll (i) = r; (i) >= l; (i)--)

ll const N = 2e5 + 100;

ll pref[2][N];

std::vector<long long> mosaic(std::vector<int> X, std::vector<int> Y, std::vector<int> T, std::vector<int> B, std::vector<int> L, std::vector<int> R) {
    int Q = (int)T.size();
    int N = (int)X.size();

    fr(i, 0, N - 1) {
        pref[0][i] = X[i];
        pref[1][i] = Y[i];

        if(i) {
            pref[0][i] += pref[0][i - 1];
            pref[1][i] += pref[1][i - 1];
        }
    }

    vector <ll> ans(Q);
    fr(i, 0, Q - 1) {
        if(T[i] == 0) {
            ans[i] += pref[0][R[i]];
            if(L[i]) ans[i] -= pref[0][L[i] - 1];
            T[i]++;
        }
        if(L[i] == 0) {
            ans[i] += pref[1][B[i]];
            ans[i] -= pref[1][T[i] - 1];
            L[i]++;
        }

        // calc ans
    }


    return ans;
}

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