oj.uz

답안 #752716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752716 2023-06-03T13:26:49 Z benjaminkleyn 벽 칠하기 (APIO20_paint) C++17
0 / 100
 1500 ms 212 KB 
#include <bits/stdc++.h>
#include "paint.h"
using namespace std;
typedef bitset<50000> mask;

int minimumInstructions(int N, int M, int K, vector<int> C, vector<int> A, vector<vector<int>> B)
{
    vector<mask> contractors(K);
    for (int i = 0; i < M; i++)
        for (int c : B[i])
            contractors[c][i] = 1;

    int ans = 0;
    for (int i = 0; i < N; i++)
    {
        ans++;
        int R = -1;
        mask yay = contractors[C[i]], last;

        for (int l = 0; l < M; l++)
        {
            last = yay;

            // we can only use contractor x on wall i if we can use contractor x+l on wall i+l.
            // thus we want the x'th bit of mask[i] to be set, and the x+l'th bit of mask[i+l] to be set.
            yay &= (contractors[C[i+l]] >> l) | (contractors[C[i+l]] << (M-l));

            if (yay.count() == 0)
            {
                R = i + l - 1;
                break;
            }
        }
        if (R == -1)
        {
            R = i + M - 1;
            i = R;
            continue;
        }

        int L = N;
        yay = last;
        int remaining = M - (R - i + 1);
        if (i < remaining)
            return -1;

        for (int l = -1; -l <= -remaining; l--)
        {
            last = yay;
            yay &= (contractors[C[i+l]] >> l) | (contractors[C[i+l]] << (M-l));
            if (yay.count() == 0)
            {
                L = i + l + 1;
                break;
            }
        }
        if (L == N)
        {
            i = R;
            continue;
        }

        return -1;
    }
    
    return ans;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 1581 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 1581 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 1581 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 1581 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Execution timed out 1581 ms 212 KB Time limit exceeded
4 Halted 0 ms 0 KB -