제출 #1332181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1332181		activedeltorre	Paint By Numbers (IOI16_paint)	C++20	컴파일 에러	0 ms	0 KiB

paint

//#include "paint.h"
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <cstdlib>
using namespace std;
long long mod=1e9+7;
long long dpst[200005][105][2];
long long dpdr[200005][105][2];
int v[200005];
int vec[1005];
int spar[200005][2];
string solve_puzzle(string s,vector<int> c) {
    int n=s.size();
    int k=c.size();
    for(int i=1;i<=n;i++)
    {
        v[i]=s[i-1];
        spar[i][0]=spar[i-1][0];
        spar[i][1]=spar[i-1][1];
        if(v[i]==88)
        {
            spar[i][1]++;
        }
        if(v[i]==95)
        {
            spar[i][0]++;
        }
    }
    for(int i=1;i<=k;i++)
    {
        vec[i]=c[i-1];
    }
    dpst[0][0][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=k;j++)
        {
            int dr=i+vec[j+1]-1;
            if(v[i]!=95 && dr<=n && j<k)
            {
               if(spar[dr][0]-spar[i-1][0]==0)
               {
                    dpst[dr][j+1][1]=(dpst[dr][j+1][1]+dpst[i-1][j][0])%mod;
               }
            }
            if(v[i]!=88)
            {
                dpst[i][j][0]=(dpst[i][j][0]+dpst[i-1][j][0]+dpst[i-1][j][1])%mod;
            }
        }
    }
    dpdr[n+1][k][0]=1;
    for(int i=n;i>=1;i--)
    {
        for(int j=k;j>=0;j--)
        {
            int st=i-vec[j]+1;
            if(v[i]!=95 && st>=1 && j>=1)
            {
               if(spar[i][0]-spar[st-1][0]==0)
               {
                    dpdr[st][j-1][1]=(dpdr[st][j-1][1]+dpdr[i+1][j][0])%mod;
               }
            }
            if(v[i]!=88)
            {
                dpdr[i][j][0]=(dpdr[i][j][0]+dpdr[i+1][j][0]+dpdr[i+1][j][1])%mod;
            }
        }
    }
    long long fin=(dpst[n][k][0]+dpst[n][k][1])%mod;
    string rez;
    for(int i=1;i<=n;i++)
    {
        if(v[i]==88)
        {
            rez.push_back('X');
        }
        else if(v[i]==95)
        {
            rez.push_back('_');
        }
        else
        {
            long long tot=0;
            for(int j=0;j<=k;j++)
            {
                tot=tot+(dpst[i-1][j][0]+dpst[i-1][j][1])*(dpdr[i+1][j][0]+dpdr[i+1][j][1])%mod;
            }
            if(tot==0)
            {
                rez.push_back('X');
            }
            else if(tot==fin)
            {
                rez.push_back('_');
            }
            else
            {
                rez.push_back('?');
            }
        }
    }
    return rez;
}

#include <vector>
#include <string>
#include <cstdio>
#include <cassert>

const int S_MAX_LEN = 200 * 1000;
char buf[S_MAX_LEN + 1];

signed main() {
    assert(1 == scanf("%s", buf));
    std::string s = buf;
    int c_len;
    assert(1 == scanf("%d", &c_len));
    std::vector<int> c(c_len);
    for (int i = 0; i < c_len; i++) {
        assert(1 == scanf("%d", &c[i]));
    }
    std::string ans = solve_puzzle(s, c);


    printf("%s\n", ans.data());
    return 0;
}
//??X???XX??

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

/usr/bin/ld: /tmp/ccS3rUNp.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccwpRGUp.o:paint.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/ccS3rUNp.o:(.bss+0x0): multiple definition of `buf'; /tmp/ccwpRGUp.o:(.bss+0x0): first defined here
collect2: error: ld returned 1 exit status