oj.uz

답안 #1032295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032295 2024-07-23T15:15:24 Z slivajan 벽 칠하기 (APIO20_paint) C++17
0 / 100
 1 ms 348 KB 
#include "paint.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long un;
typedef vector<un> vuc;
typedef vector<bool> vol;

#define vec vector
#define REP(i, a, b) for (un i = (un)a; i < (un)b; i++)
#define FEAC(i, a) for (auto&& i : a)

constexpr un INF = 1e9;

int minimumInstructions(int N, int M, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
  
    vec<vol> tab(M, vol(K, false));

    REP(m, 0, M) {
      FEAC(col, B[m]) tab[m][col] = true;
    }

    un ret = 0;
    un x = 0;

    while (x < N)
    {
      un nejkdy = 0;
      REP(y, 0, M){
        bool bad = false;
        bool skoc = false;
        un kdy = M;

        REP(l, 0, M){
          if ((x+l - skoc*M < 0) or (x+l - skoc*M >= N) or (not tab[(y+l)%M][C[x+l - skoc*M]])){
            if (not skoc) {
              kdy = l+1;
              l--;
              skoc = true;
            }
            else{
              bad = true;
              break;
            }
          }
        }

        if(not bad){
          nejkdy = max(nejkdy, kdy);
        }
      }

      if (nejkdy == 0){
        return -1;
      }

      x += nejkdy;
      ret++;

    }
    
  return ret;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -