oj.uz

답안 #980833

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
980833 2024-05-12T13:23:43 Z emad234 Paint By Numbers (IOI16_paint) C++17
7 / 100
 1 ms 2396 KB 
#include "paint.h"
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll mxN = 3e5 + 2;
using namespace std;
bool dpP[200010][110][2], dpS[200010][110][2];
int prfx[200010], suff[200010];
int a[200010], b[200010];
string solve_puzzle(string s, vector<int> c)
{
    int n = s.size(), k = c.size();
    string s1 = "#";
    s1 += s;
    s = s1;
    vector<int> c1;
    c1.push_back(-1);
    for (auto x : c)
        c1.push_back(x);
    c = c1;
    for (int i = 1; i <= n; i++)
    {
        prfx[i] = prfx[i - 1] + (s[i] == '_');
    }
    dpP[0][0][0] = 1;
    dpS[n + 1][k + 1][0] = 1;
    for (int j = 0; j <= k; j++)
    {
        for (int i = 1; i <= n; i++)
        {
            dpP[i][j][0] = dpP[i - 1][j][0];
            if (j == 0)
            {
                dpP[i][j][0] = 1;
            }
            else
            {
                if (i >= c[j])
                {
                    if (prfx[i] == prfx[i - c[j]])
                    {
                        if (j == 1) dpP[i][j][1] = dpP[i - c[j]][j - 1][0];
                        else dpP[i][j][1] = dpP[i - c[j] - 1][j - 1];
                    }
                }
            }
            // cout << dpP[i][j] << ' ';
            dpP[i][j][0] = max(dpP[i][j][0], dpP[i][j][1]);
        }
        // cout << '\n';
    }
    // cout<<'\n';
    for (int i = n; i; i--)
    {
        suff[i] = suff[i + 1] + (s[i] == '_');
    }
    for (int j = k + 1; j; j--)
    {
        for (int i = n; i; i--)
        {
            dpS[i][j][0] = dpS[i + 1][j][0];
            if (j == k + 1)
            {
                dpS[i][j][0] = 1;
                dpS[i][j][1] = 1;
            }
            else
            {
                if (suff[i] == suff[i + c[j]])
                {
                    if (j == k) dpS[i][j][1] = dpS[i + c[j]][j + 1][0];
                    else dpS[i][j][1] = dpS[i + c[j] + 1][j + 1][0];
                }
            }
            dpS[i][j][0] = max(dpS[i][j][0], dpS[i][j][1]);
            // cout << dpS[i][j] << ' ';
        }
        // cout<<'\n';
    }
    // cout<<'\n';
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= k + 1; j++)
        {
            if (s[i] != '.')
            {
                continue;
            }
            if (j != k + 1 && (dpP[i][j][1] && dpS[i + 1][j + 1][0]))
            {
                a[i - c[j] + 1] += 1;
                a[i + 1] += -1;
            }
            if (j != k + 1 && (dpP[i - 1][j - 1][0] && dpS[i][j][1]))
            {
                a[i] += 1;
                a[i + c[j] + 1] += -1;
            }
            if (dpP[i - 1][j - 1][0] && dpS[i + 1][j][0])
                b[i] = 1;
        }
    }
    for (int i = 1; i <= n; i++)
    {
        a[i] += a[i - 1];
    }
    string ans;
    for (int i = 1; i <= n; i++)
    {
        char ch;
        if(s[i] != '.'){
            ans += s[i];
            continue;
        }
        if (a[i] && b[i])
            ch = '?';
        else if (a[i])
            ch = 'X';
        else if (b[i])
            ch = '_';  
        ans += ch;
    }
    // cout<<ans<<' '<<"TEST";
    return ans;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #4
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB n = 13, m = 1
2 Correct 1 ms 2396 KB n = 18, m = 1
3 Correct 1 ms 2396 KB n = 17, m = 1
4 Correct 1 ms 2396 KB n = 1, m = 1
5 Correct 1 ms 2396 KB n = 20, m = 1
6 Correct 1 ms 2396 KB n = 20, m = 1
7 Correct 1 ms 2396 KB n = 20, m = 1
8 Incorrect 1 ms 2392 KB char #4 differ - expected: 'X', found: '?'
9 Halted 0 ms 0 KB -