제출 #1171754

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171754		LaMatematica14	모자이크 (IOI24_mosaic)	C++20	22 / 100	80 ms	15944 KiB

mosaic

#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) {
    int N = X.size();
    vector<int> fr(N), sr(N), tr(N);
    vector<int> fc(N), sc(N), tc(N);
    fr = X;
    fc = Y;

    sr[0] = fc[1];
    for (int i = 1; i < N; i++) sr[i] = !(fr[i]||sr[i-1]);
    tr[0] = fc[2];
    for (int i = 1; i < N; i++) tr[i] = !(sr[i]||tr[i-1]);

    sc[0] = fr[1];
    for (int i = 1; i < N; i++) sc[i] = !(fc[i]||sc[i-1]);
    tc[0] = fr[2];
    for (int i = 1; i < N; i++) tc[i] = !(sc[i]||tc[i-1]);

    int M = T.size();
    vector<long long> ans(M);
    for (int i = 0; i < M; i++) {
        int t = max(0, min(T[i], L[i])-2);
        T[i] -= t; L[i] -= t;
        if (L[i] == 0) ans[i] = fc[T[i]];
        else if (L[i] == 1) ans[i] = sc[T[i]];
        else if (L[i] == 2) ans[i] = tc[T[i]];
        else if (T[i] == 0) ans[i] = fr[L[i]];
        else if (T[i] == 1) ans[i] = sr[L[i]];
        else if (T[i] == 2) ans[i] = tr[L[i]];
    }
    return ans;
}

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