oj.uz

Submission #165623

# Submission time Handle Problem Language Result Execution time Memory
165623 2019-11-27T20:47:09 Z cbertram Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
60 / 100
 500 ms 855076 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<vll> vvll;
#define all(x) x.begin(), x.end()
#define rep(i,a,b) for(int i = a; i < b; i++)
#define relax(a, b) a = min(a,b)
#define posNow(pos,behind,c,i,R,G,Y) pos[c][i]+max(0,R-behind[0][pos[c][i]])+max(0,G-behind[1][pos[c][i]])+max(0,Y-behind[2][pos[c][i]])

int posNow2(vvi &pos, vvi &behind, int c, int i, int R, int G, int Y) {
  int p = pos[c][i];
  return p+max(0,R-behind[0][p])+max(0,G-behind[1][p])+max(0,Y-behind[2][p]);
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int N;
  cin >> N;
  vi S(N);
  string sS;
  cin >> sS;
  rep(n,0,N) {
    switch(sS[n]) {
    case 'R': S[n] = 0; break;
    case 'G': S[n] = 1; break;
    case 'Y': S[n] = 2; break;
    }
  }
  vvi pos(3, vi(0));
  rep(n,0,N) pos[S[n]].push_back(n);
  vvi behind(3, vi(N+1));
  rep(c,0,3) {
    int i = 0;
    rep(n,0,N+1) {
      behind[c][n] = i;
      if(i < (int)pos[c].size() && pos[c][i] == n) i++;
    }
  }
  vvvvi steps(N+1, vvvi(N+1, vvi(N+1, vi(3, 1000000000))));
  vvvvb vis(N+1, vvvb(N+1, vvb(N+1, vb(3))));
  steps[0][0][0][0] = 0;
  steps[0][0][0][1] = 0;
  steps[0][0][0][2] = 0;
  queue<int> q;
  q.push(0);
  q.push(1);
  q.push(2);
  while(!q.empty()) {
    int front = q.front();
    q.pop();
    int R = front/3/N/N;
    int G = (front/3/N)%N;
    int Y = (front/3)%N;
    int C = front%3;
    int here = steps[R][G][Y][C];
    int used = R+G+Y;
    if(here == 1000000000) continue;
    if(R < (int)pos[0].size() && !vis[R+1][G][Y][0]) {
      vis[R+1][G][Y][0] = true;
      q.push((R+1)*N*N*3 + G*N*3 + Y*3 + 0);
    }
    if(G < (int)pos[1].size() && !vis[R][G+1][Y][1]) {
      vis[R][G+1][Y][1] = true;
      q.push(R*N*N*3 + (G+1)*N*3 + Y*3 + 1);
    }
    if(Y < (int)pos[2].size() && !vis[R][G][Y+1][2]) {
      vis[R][G][Y+1][2] = true;
      q.push(R*N*N*3 + G*N*3 + (Y+1)*3 + 2);
    }
    //cerr << "(R,G,Y,C) = ("<<R<<", "<<G<<", "<<Y<<", "<<C<<") "<<here<<"\n";
    if(R < (int)pos[0].size() && C != 0) relax(steps[R+1][G][Y][0], here+posNow(pos, behind, 0, R, R, G, Y)-used);
    if(G < (int)pos[1].size() && C != 1) relax(steps[R][G+1][Y][1], here+posNow(pos, behind, 1, G, R, G, Y)-used);
    if(Y < (int)pos[2].size() && C != 2) relax(steps[R][G][Y+1][2], here+posNow(pos, behind, 2, Y, R, G, Y)-used);
  }

  int res = 1000000000;
  relax(res, steps[(int)pos[0].size()][(int)pos[1].size()][(int)pos[2].size()][0]);
  relax(res, steps[(int)pos[0].size()][(int)pos[1].size()][(int)pos[2].size()][1]);
  relax(res, steps[(int)pos[0].size()][(int)pos[1].size()][(int)pos[2].size()][2]);
  if(res == 1000000000)
    cout << "-1\n";
  else
    cout << res << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 892 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 4 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 3 ms 888 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 3 ms 788 KB Output is correct

Subtask #2
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 892 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 4 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 3 ms 888 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 3 ms 788 KB Output is correct
18 Correct 52 ms 29352 KB Output is correct
19 Correct 51 ms 29348 KB Output is correct
20 Correct 52 ms 29304 KB Output is correct
21 Correct 52 ms 29304 KB Output is correct
22 Correct 51 ms 29196 KB Output is correct
23 Correct 52 ms 29304 KB Output is correct
24 Correct 51 ms 29216 KB Output is correct
25 Correct 82 ms 29404 KB Output is correct
26 Correct 52 ms 29304 KB Output is correct
27 Correct 51 ms 29304 KB Output is correct
28 Correct 53 ms 29304 KB Output is correct
29 Correct 50 ms 29304 KB Output is correct
30 Correct 52 ms 29304 KB Output is correct
31 Correct 52 ms 29304 KB Output is correct
32 Correct 52 ms 29428 KB Output is correct
33 Correct 48 ms 27896 KB Output is correct
34 Correct 48 ms 27948 KB Output is correct
35 Correct 46 ms 26744 KB Output is correct
36 Correct 112 ms 27896 KB Output is correct
37 Correct 43 ms 25208 KB Output is correct
38 Correct 50 ms 29304 KB Output is correct
39 Correct 52 ms 29304 KB Output is correct
40 Correct 113 ms 27896 KB Output is correct
41 Correct 53 ms 29304 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Execution timed out 1140 ms 855076 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 3 ms 892 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 3 ms 888 KB Output is correct
9 Correct 3 ms 888 KB Output is correct
10 Correct 12 ms 888 KB Output is correct
11 Correct 4 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 3 ms 888 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 3 ms 888 KB Output is correct
16 Correct 3 ms 888 KB Output is correct
17 Correct 3 ms 788 KB Output is correct
18 Correct 52 ms 29352 KB Output is correct
19 Correct 51 ms 29348 KB Output is correct
20 Correct 52 ms 29304 KB Output is correct
21 Correct 52 ms 29304 KB Output is correct
22 Correct 51 ms 29196 KB Output is correct
23 Correct 52 ms 29304 KB Output is correct
24 Correct 51 ms 29216 KB Output is correct
25 Correct 82 ms 29404 KB Output is correct
26 Correct 52 ms 29304 KB Output is correct
27 Correct 51 ms 29304 KB Output is correct
28 Correct 53 ms 29304 KB Output is correct
29 Correct 50 ms 29304 KB Output is correct
30 Correct 52 ms 29304 KB Output is correct
31 Correct 52 ms 29304 KB Output is correct
32 Correct 52 ms 29428 KB Output is correct
33 Correct 48 ms 27896 KB Output is correct
34 Correct 48 ms 27948 KB Output is correct
35 Correct 46 ms 26744 KB Output is correct
36 Correct 112 ms 27896 KB Output is correct
37 Correct 43 ms 25208 KB Output is correct
38 Correct 50 ms 29304 KB Output is correct
39 Correct 52 ms 29304 KB Output is correct
40 Correct 113 ms 27896 KB Output is correct
41 Correct 53 ms 29304 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Execution timed out 1140 ms 855076 KB Time limit exceeded
44 Halted 0 ms 0 KB -