제출 #1198067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1198067		Malix	벽 칠하기 (APIO20_paint)	C++20	40 / 100	1526 ms	516464 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))

ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

struct hash_pair {
    size_t operator()(const pair<int,int>& p) const {
        return hash<long long>()(((long long)p.first) << 32 | p.second);
    }
};

unordered_map<pair<int,int>, int, hash_pair> mp;


int minimumInstructions(int n, int m, int K, std::vector<int> C, std::vector<int> A, std::vector<std::vector<int>> B) {
  vii st(K);
  REP(i,0,m)REP(j,0,A[i])st[B[i][j]].PB(i);
  REP(i,0,n)REP(j,0,st[C[i]].size())mp[{i,st[C[i]][j]}]=mp[{i-1,(st[C[i]][j]-1+m)%m}]+1;
  int ans=0,pos=0;
  while(pos<n){
    bool f=1;
    for(int i=min(n,pos+m)-1;i>=pos;i--)REP(j,0,st[C[i]].size())if(mp[{i,st[C[i]][j]}]>=m){
      f=0;
      pos=i+1;
      break;
    }
    if(f)return -1;
    ans++;
  }
  return ans;
}

• Subtask 1: 12 / 12
• Subtask 2: 15 / 15
• Subtask 3: 13 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 37