oj.uz

답안 #367161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
367161 2021-02-16T11:29:35 Z Killer2501 Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
15 / 100
 5 ms 5868 KB 
#include <bits/stdc++.h>
#define ll int
#define pb push_back
#define task "bus"
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
const ll mod = 1e9+7;
const ll N = 405;
const ll base = 250;
using namespace std;
ll n, m, t, k, T, ans, a[N],tong, b[N], c[N], d[N], dp[N][N][N][4], cnt[N][N][4][4], n1, n2, n3;
string s;

void sol()
{
    cin >> n >> s;
    for(int i = 0; i < n; i ++)
    {
        if(s[i] == 'R')a[++n1] = i+1;
        else if(s[i] == 'Y')b[++n2] = i+1;
        else c[++n3] = i+1;
    }
    for(int i = 1; i <= n1; i ++)
    {
        k = 0;
        for(int j = 1; j <= n2; j ++)
        {
            if(b[j] > a[i])++k;
            cnt[i][j][1][2] = k;
        }
        k = 0;
        for(int j = 1; j <= n3; j ++)
        {
            if(c[j] > a[i])++k;
            cnt[i][j][1][3] = k;
        }
    }
    for(int i = 1; i <= n2; i ++)
    {
        k = 0;
        for(int j = 1; j <= n1; j ++)
        {
            if(a[j] > b[i])++k;
            cnt[i][j][2][1] = k;
        }
        k = 0;
        for(int j = 1; j <= n3; j ++)
        {
            if(c[j] > b[i])++k;
            cnt[i][j][2][3] = k;
        }
    }
    for(int i = 1; i <= n3; i ++)
    {
        k = 0;
        for(int j = 1; j <= n2; j ++)
        {
            if(b[j] > c[i])++k;
            cnt[i][j][3][2] = k;
        }
        k = 0;
        for(int j = 1; j <= n1; j ++)
        {
            if(a[j] > c[i])++k;
            cnt[i][j][3][1] = k;
        }
    }
    for(int i = 0; i <= n1; i ++)for(int j = 0; j <= n2; j ++)for(int l = 0; l <= n3; l ++)
        dp[i][j][l][1] = dp[i][j][l][2] = dp[i][j][l][3] = mod;
    dp[0][0][0][1] = dp[0][0][0][2] = dp[0][0][0][3] = 0;
    //cout << n1 <<" "<<n2<<" "<<n3<<'\n';
    for(int i = 0; i <= n1; i ++)
    {
        for(int j = 0; j <= n2; j ++)
        {
            for(int l = 0; l <= n3; l ++)
            {
                if(i == 0 && j == 0 && l == 0)continue;
                if(i != 0)dp[i][j][l][1] = min(dp[i-1][j][l][2], dp[i-1][j][l][3]) + a[i] + cnt[i][j][1][2] + cnt[i][l][1][3] - (i + j + l);
                if(j != 0)dp[i][j][l][2] = min(dp[i][j-1][l][1], dp[i][j-1][l][3]) + b[j] + cnt[j][i][2][1] + cnt[j][l][2][3] - (i + j + l);
                if(l != 0)dp[i][j][l][3] = min(dp[i][j][l-1][1], dp[i][j][l-1][2]) + c[l] + cnt[l][j][3][2] + cnt[l][i][3][1] - (i + j + l);
            }
        }
    }
    ans = min(min(dp[n1][n2][n3][1], dp[n1][n2][n3][2]), dp[n1][n2][n3][3]);
    if(ans == mod)ans = -1;
    cout << ans;
}
int main()
{
    if(fopen(task".inp", "r")){
       freopen(task".inp", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest;
    ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
1 3
1 -1 1
10 5
487125983 7690599 333427386 884957999 246724760 224342552 130825246 518149612 37072017 132013639
*/

Compilation message

joi2019_ho_t3.cpp: In function 'int main()':
joi2019_ho_t3.cpp:94:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   94 |        freopen(task".inp", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t3.cpp:95:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   95 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 620 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 620 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 ms 5868 KB Output is correct
3 Correct 5 ms 5868 KB Output is correct
4 Correct 4 ms 5868 KB Output is correct
5 Correct 5 ms 5868 KB Output is correct
6 Correct 4 ms 5868 KB Output is correct
7 Correct 4 ms 5868 KB Output is correct
8 Correct 4 ms 5868 KB Output is correct
9 Correct 4 ms 5868 KB Output is correct
10 Correct 4 ms 5868 KB Output is correct
11 Correct 5 ms 5868 KB Output is correct
12 Correct 2 ms 2412 KB Output is correct
13 Correct 4 ms 3436 KB Output is correct
14 Correct 4 ms 4588 KB Output is correct
15 Correct 4 ms 5868 KB Output is correct
16 Correct 4 ms 5868 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 620 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 620 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Incorrect 1 ms 620 KB Output isn't correct
14 Halted 0 ms 0 KB -