제출 #1228961

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228961		PVM_pvm	모자이크 (IOI24_mosaic)	C++20	0 / 100	96 ms	18484 KiB

mosaic

#include "mosaic.h"
#include<bits/stdc++.h>
using namespace std;
#define MAXN 200'007
int n;
unordered_map<long long, long long> un;
vector<long long> mosaic(vector<int> X, vector<int> Y, vector<int> T, vector<int> B, vector<int> L, vector<int> R) {
    int Q = (int)T.size();
    n=(int)X.size();
    if (n==1)
    {
        assert(false);
        vector<long long> C(Q, X[0]);
        return C;
    }
    vector<int> k2(n);
    k2[0]=X[1];
    for (int q=1;q<n;q++)
    {
        if (Y[q]==0 && k2[q-1]==0) k2[q]=1;
        else k2[q]=0;
        if (k2[q]==1)
        {
            ///na q 1 sme
            un[q-1]=1;
        }
    }
    vector<int> r2(n);
    r2[0]=Y[1];
    for (int q=1;q<n;q++)
    {
        if (X[q]==0 && r2[q-1]==0) r2[q]=1;
        else r2[q]=0;
        if (r2[q]==1)
        {
            ///na 1 q sme
            un[1-q]=1;
        }
    }
    vector<long long> C(Q, 0);
    for (int q=0;q<Q;q++)
    {
        int red=T[q];
        int kolona=L[q];
        if (red==0)
        {
            C[q]=X[kolona];
        }
        else if (kolona==0)
        {
            C[q]=Y[red];
        }
        else if (un.find(red-kolona)!=un.end()) C[q]=1;
        else C[q]=0;
    }
    return C;
}

• 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: 0 / 22
• Subtask 7: 0 / 19
• Subtask 8: 0 / 22