제출 #507586

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
507586	2022-01-12 18:50:26	CSQ31	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	75 / 100	1116 ms	383596 KiB

joi2019_ho_t3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int dp[3][401][401][401],pos[3][401],cnt[3];
void chmin(int &x,int y){
  x = min(x,y);
}
int main()
{
  int n;
  string s;
  cin>>n>>s;
  vector<int>c;
  for(char x:s){
    if(x == 'R')c.push_back(0);
    if(x == 'G')c.push_back(1);
    if(x == 'Y')c.push_back(2);
  }
  for(int i=0;i<=n;i++)pos[0][i] = pos[1][i] = pos[2][i] = -1;
  for(int i=0;i<n;i++)pos[c[i]][cnt[c[i]]++] = i;
  /*
  for(int i=0;i<3;i++){
    for(int j=0;j<cnt[i];j++)cout<<pos[i][j]<<" ";
    cout<<'\n';
  }*/
  for(int i=0;i<=n;i++)
    for(int j=0;j<=i;j++)
      for(int k=0;k+j<=i;k++)
        dp[0][i][j][k] = dp[1][i][j][k] = dp[2][i][j][k] = INF;
        
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 55 / 55
• Subtask 3: 15 / 15
• Subtask 4: 0 / 25