oj.uz

Submission #165628

# Submission time Handle Problem Language Result Execution time Memory
165628 2019-11-27T21:09:21 Z cbertram Growing Vegetable is Fun 3 (JOI19_ho_t3) C++14
75 / 100
 500 ms 310172 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 NN;
  cin >> NN;
  const int N = NN;
  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(pos[0].size()+2, vvvi(pos[1].size()+2, vvi(pos[2].size()+2, vi(3, 1000000000))));
  vvvvb vis(pos[0].size()+2, vvvb(pos[1].size()+2, vvb(pos[2].size()+2, 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(front+N*N*3 -C+0);
    }
    if(G < (int)pos[1].size() && !vis[R][G+1][Y][1]) {
      vis[R][G+1][Y][1] = true;
      q.push(front+N*3 -C+1);
    }
    if(Y < (int)pos[2].size() && !vis[R][G][Y+1][2]) {
      vis[R][G][Y+1][2] = true;
      q.push(front+3 -C+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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 5 ms 1656 KB Output is correct
19 Correct 5 ms 1656 KB Output is correct
20 Correct 5 ms 1656 KB Output is correct
21 Correct 5 ms 1656 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1656 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 3 ms 760 KB Output is correct
27 Correct 5 ms 1528 KB Output is correct
28 Correct 6 ms 1784 KB Output is correct
29 Correct 5 ms 1784 KB Output is correct
30 Correct 5 ms 1788 KB Output is correct
31 Correct 5 ms 1656 KB Output is correct
32 Correct 6 ms 1784 KB Output is correct
33 Correct 3 ms 888 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 5 ms 1528 KB Output is correct
36 Correct 5 ms 1656 KB Output is correct
37 Correct 4 ms 1532 KB Output is correct
38 Correct 5 ms 1656 KB Output is correct
39 Correct 19 ms 1784 KB Output is correct
40 Correct 2 ms 632 KB Output is correct
41 Correct 3 ms 888 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 25 ms 13820 KB Output is correct
3 Correct 25 ms 13688 KB Output is correct
4 Correct 25 ms 13816 KB Output is correct
5 Correct 25 ms 13816 KB Output is correct
6 Correct 25 ms 13856 KB Output is correct
7 Correct 24 ms 13688 KB Output is correct
8 Correct 25 ms 13816 KB Output is correct
9 Correct 24 ms 13688 KB Output is correct
10 Correct 25 ms 13816 KB Output is correct
11 Correct 25 ms 13816 KB Output is correct
12 Correct 8 ms 3960 KB Output is correct
13 Correct 13 ms 6648 KB Output is correct
14 Correct 17 ms 9592 KB Output is correct
15 Correct 25 ms 13788 KB Output is correct
16 Correct 25 ms 13816 KB Output is correct

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 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 5 ms 1656 KB Output is correct
19 Correct 5 ms 1656 KB Output is correct
20 Correct 5 ms 1656 KB Output is correct
21 Correct 5 ms 1656 KB Output is correct
22 Correct 5 ms 1528 KB Output is correct
23 Correct 5 ms 1656 KB Output is correct
24 Correct 4 ms 1528 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 3 ms 760 KB Output is correct
27 Correct 5 ms 1528 KB Output is correct
28 Correct 6 ms 1784 KB Output is correct
29 Correct 5 ms 1784 KB Output is correct
30 Correct 5 ms 1788 KB Output is correct
31 Correct 5 ms 1656 KB Output is correct
32 Correct 6 ms 1784 KB Output is correct
33 Correct 3 ms 888 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 5 ms 1528 KB Output is correct
36 Correct 5 ms 1656 KB Output is correct
37 Correct 4 ms 1532 KB Output is correct
38 Correct 5 ms 1656 KB Output is correct
39 Correct 19 ms 1784 KB Output is correct
40 Correct 2 ms 632 KB Output is correct
41 Correct 3 ms 888 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 25 ms 13820 KB Output is correct
44 Correct 25 ms 13688 KB Output is correct
45 Correct 25 ms 13816 KB Output is correct
46 Correct 25 ms 13816 KB Output is correct
47 Correct 25 ms 13856 KB Output is correct
48 Correct 24 ms 13688 KB Output is correct
49 Correct 25 ms 13816 KB Output is correct
50 Correct 24 ms 13688 KB Output is correct
51 Correct 25 ms 13816 KB Output is correct
52 Correct 25 ms 13816 KB Output is correct
53 Correct 8 ms 3960 KB Output is correct
54 Correct 13 ms 6648 KB Output is correct
55 Correct 17 ms 9592 KB Output is correct
56 Correct 25 ms 13788 KB Output is correct
57 Correct 25 ms 13816 KB Output is correct
58 Execution timed out 1061 ms 310172 KB Time limit exceeded
59 Halted 0 ms 0 KB -