oj.uz

답안 #965891

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
965891 2024-04-19T07:46:41 Z willychan 벽 칠하기 (APIO20_paint) C++17
0 / 100
 1 ms 348 KB 
#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int minimumInstructions(int N, int M, int K, std::vector<int> C,std::vector<int> A, std::vector<std::vector<int>> B) {
  vector<int> ok;
  for(int i=0;i<=N-M;i++){
	for(int j=0;j<M;j++){
  		bool work=1;
		for(int k=0;k<M;k++){
			int f = lower_bound(B[(j+k)%M].begin(),B[(j+k)%M].end(),C[i+k])-B[(j+k)%M].begin();
			work&=(f<A[(j+k)%M] && B[(j+k)%M][f]==C[i+k]);
		}
		if(work){
			ok.push_back(i);
			break;
		}
	}
  }
  if(ok.empty() || ok[0]!=0) return -1;
  int cur = 0;
  int ans = 1;
 
  while(cur<N-M-1){
  	int k = upper_bound(ok.begin(),ok.end(),cur+M)-ok.begin();
	k--;
	if(k<0 || ok[k]==cur) return -1;
	cur = ok[k];
	ans++;
  }
  
  return ans;
}

Subtask #1
0 / 12.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 37.0

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