Submission #1176777

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176777		nguyenkhangninh99	Growing Vegetable is Fun 3 (JOI19_ho_t3)	C++17	Compilation error	0 ms	0 KiB

joi2019_ho_t3

#include <bits/stdc++.h>
using namespace std;

#define int long long

int f[401][401][401][3];

void solve(){
    int n; cin >> n;
    string s; cin >> s;

    s = ' ' + s;
    int cntr = 0, cntg = 0, cnty = 0;
    vector<int> prer(n + 1, 0), preg(n + 1, 0), prey(n + 1, 0);
    vector<int> posr(n + 1, 0), posg(n + 1, 0), posy(n + 1, 0);
    for(int i = 1; i <= n; i++){
        prer[i] = prer[i - 1] + (s[i] == 'R');
        preg[i] = preg[i - 1] + (s[i] == 'G');
        prey[i] = prey[i - 1] + (s[i] == 'Y');
        if(s[i] == 'R') posr[++cntr] = i;
        if(s[i] == 'G') posg[++cntg] = i;
        if(s[i] == 'Y') posy[++cnty] = i;
    }

    for(int r = 0; r <= cntr; r++){
        for(int g = 0; g <= cntg; g++){
            for(int y = 0; y <= cnty; y++){
                for(int k = 0; k < 3; k++){
                    f[r][g][y][k] = 1e9 + 5;
                }
            }
        }
    }

    for(int k = 0; k < 3; k++){
        f[0][0][0][k] = 0;
    }

    for(int i = 1; i <= n; i++){
        for(int r = 0; r <= cntr; r++){
            for(int g = 0; g <= cntg; g++){
                int y = i - r - g;
                if(y < 0 || y > cnty) continue;
                if(r >= 1) f[r][g][y][0] = min(f[r][g][y][0], min(f[r - 1][g][y][1], f[r - 1][g][y][2]) + posr[r] + max(0ll, g - preg[posr[r]]) + max(0ll, y - prey[posr[r]]) - i);
                if(g >= 1) f[r][g][y][1] = min(f[r][g][y][1], min(f[r][g - 1][y][0], f[r][g - 1][y][2]) + posg[g] + max(0ll, r - prer[posg[g]]) + max(0ll, y - prey[posg[g]]) - i);
                if(y >= 1) f[r][g][y][2] = min(f[r][g][y][2], min(f[r][g][y - 1][0], f[r][g][y - 1][1]) + posy[y] + max(0ll, r - prer[posy[y]]) + max(0ll, g - preg[posy[y]]) - i);
            }
        }
    }
    int ans = 1e15;
    for(int k = 0; k < 3; k++) chmin(ans, f[cntr][cntg][cnty][k]);
    
    cout << (ans > 1e8 ? -1 : ans);
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    solve();
}

#include <bits/stdc++.h>
using namespace std;

#define int long long

int f[401][401][401][3];

void solve(){
    int n; cin >> n;
    string s; cin >> s;

    s = ' ' + s;
    int cntr = 0, cntg = 0, cnty = 0;
    vector<int> prer(n + 1, 0), preg(n + 1, 0), prey(n + 1, 0);
    vector<int> posr(n + 1, 0), posg(n + 1, 0), posy(n + 1, 0);
    for(int i = 1; i <= n; i++){
        prer[i] = prer[i - 1] + (s[i] == 'R');
        preg[i] = preg[i - 1] + (s[i] == 'G');
        prey[i] = prey[i - 1] + (s[i] == 'Y');
        if(s[i] == 'R') posr[++cntr] = i;
        if(s[i] == 'G') posg[++cntg] = i;
        if(s[i] == 'Y') posy[++cnty] = i;
    }

    for(int r = 0; r <= cntr; r++){
        for(int g = 0; g <= cntg; g++){
            for(int y = 0; y <= cnty; y++){
                for(int k = 0; k < 3; k++) if(r + g + y) f[r][g][y][k] = 1e9 + 5;
            }
        }
    }

    for(int i = 1; i <= n; i++){
        for(int r = 0; r <= cntr; r++){
            for(int g = 0; g <= cntg; g++){
                int y = i - r - g;
                if(y < 0 || y > cnty) continue;
                if(r >= 1) f[r][g][y][0] = min(f[r][g][y][0], min(f[r - 1][g][y][1], f[r - 1][g][y][2]) + posr[r] + max(0ll, g - preg[posr[r]]) + max(0ll, y - prey[posr[r]]) - i);
                if(g >= 1) f[r][g][y][1] = min(f[r][g][y][1], min(f[r][g - 1][y][0], f[r][g - 1][y][2]) + posg[g] + max(0ll, r - prer[posg[g]]) + max(0ll, y - prey[posg[g]]) - i);
                if(y >= 1) f[r][g][y][2] = min(f[r][g][y][2], min(f[r][g][y - 1][0], f[r][g][y - 1][1]) + posy[y] + max(0ll, r - prer[posy[y]]) + max(0ll, g - preg[posy[y]]) - i);
            }
        }
    }
    int ans = 1e15;
    for(int k = 0; k < 3; k++) chmin(ans, f[cntr][cntg][cnty][k]);
    
    cout << (ans > 1e8 ? -1 : ans);
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    solve();
}

Compilation message (stderr)

joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:53:32: error: 'chmin' was not declared in this scope
   53 |     for(int k = 0; k < 3; k++) chmin(ans, f[cntr][cntg][cnty][k]);
      |                                ^~~~~
joi2019_ho_t3.cpp: At global scope:
joi2019_ho_t3.cpp:70:5: error: redefinition of 'long long int f [401][401][401][3]'
   70 | int f[401][401][401][3];
      |     ^
joi2019_ho_t3.cpp:8:5: note: 'long long int f [401][401][401][3]' previously declared here
    8 | int f[401][401][401][3];
      |     ^
joi2019_ho_t3.cpp:72:6: error: redefinition of 'void solve()'
   72 | void solve(){
      |      ^~~~~
joi2019_ho_t3.cpp:10:6: note: 'void solve()' previously defined here
   10 | void solve(){
      |      ^~~~~
joi2019_ho_t3.cpp: In function 'void solve()':
joi2019_ho_t3.cpp:109:32: error: 'chmin' was not declared in this scope
  109 |     for(int k = 0; k < 3; k++) chmin(ans, f[cntr][cntg][cnty][k]);
      |                                ^~~~~
joi2019_ho_t3.cpp: At global scope:
joi2019_ho_t3.cpp:114:8: error: redefinition of 'int main()'
  114 | signed main(){
      |        ^~~~
joi2019_ho_t3.cpp:58:8: note: 'int main()' previously defined here
   58 | signed main(){
      |        ^~~~