oj.uz

Submission #136373

# Submission time Handle Problem Language Result Execution time Memory
136373 2019-07-25T07:58:31 Z KLPP Dango Maker (JOI18_dango_maker) C++14
33 / 100
 914 ms 262148 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int has[3000][3000][2];
int n,m;
bool valid(int x, int y){
  if(x>=0 && x<n && y>=0 && y<m)return true;
  return false;
}
bool visited[3000000];
int size;
int independent;
vector<int> graph[3000000];
queue<int> q;
vector<int> tree[3000000];
int DP[3000000][2];
void DFS(int node){
  visited[node]=true;
  //q.push(node);
  trav(v,graph[node]){
    if(!visited[v]){
      tree[node].push_back(v);
      DFS(v);
    }
  }
}
int compute(int node, int x){
  if(DP[node][x]!=-1)return DP[node][x];
  DP[node][x]=0;
  if(x==0){
    trav(v,tree[node]){
      DP[node][x]+=max(compute(v,0),compute(v,1));
    }
    return DP[node][x];
  }
  DP[node][x]++;
  trav(v,tree[node]){
    DP[node][x]+=compute(v,0);
  }
  return DP[node][x];
}
int main(){
  
  cin>>n>>m;
  string table[n];
  rep(i,0,n){
    cin>>table[i];
  }
  int V=0;
  int H=0;
  vector<pii> v;
  vector<pii> h;
  rep(i,0,n){
    rep(j,0,m){
      has[i][j][0]=-1;
      has[i][j][1]=-1;
      if(table[i][j]=='R'){
	if(i+2<n && table[i+1][j]=='G' && table[i+2][j]=='W'){
	  has[i][j][0]=V;
	  V++;
	  v.push_back(pii(i,j));
	}
	if(j+2<m && table[i][j+1]=='G' && table[i][j+2]=='W'){
	  has[i][j][1]=H;
	  H++;
	  h.push_back(pii(i,j));
	}
      }
    }
  }
  rep(i,0,n){
    rep(j,0,m){
      if(has[i][j][0]!=-1){
	if(has[i][j][1]!=-1){
	  graph[has[i][j][0]].push_back(has[i][j][1]+V);
	  graph[has[i][j][1]+V].push_back(has[i][j][0]);
	}
	if(valid(i+1,j-1) && has[i+1][j-1][1]!=-1){
	  graph[has[i][j][0]].push_back(has[i+1][j-1][1]+V);
	  graph[has[i+1][j-1][1]+V].push_back(has[i][j][0]);
	}
	if(valid(i+2,j-2) && has[i+2][j-2][1]!=-1){
	  graph[has[i][j][0]].push_back(has[i+2][j-2][1]+V);
	  graph[has[i+2][j-2][1]+V].push_back(has[i][j][0]);
	}
      }
    }
  }
  //cout<<V+H<<endl;
  rep(i,0,V+H){
    DP[i][0]=-1;
    DP[i][1]=-1;
    /*trav(v,graph[i]){
      cout<<v<<" ";
    }
    cout<<endl;*/
  }
  rep(i,0,V+H){
    visited[i]=false;
  }
  int ans=0;
  rep(i,0,V+H){
    if(!visited[i]){
      
      DFS(i);
      /*while(!q.empty()){
	//if(q.front()<V)cout<<v[q.front()].first<<","<<v[q.front()].second<<" ";
	//if(q.front()>=V)cout<<h[q.front()-V].first<<","<<h[q.front()-V].second<<" ";
	visited[q.front()]=false;
	q.pop();
      }//cout<<endl;*/
      ans+=max(compute(i,0),compute(i,1));
      
      //cout<<independent<<" "<<size-independent<<"A"<<endl;
    }
  }
  /*rep(i,0,V+H){
    cout<<compute(i,0)<<" "<<compute(i,1)<<endl;
  }*/
  cout<<ans<<endl;
  
  return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 141420 KB Output is correct
2 Correct 131 ms 141304 KB Output is correct
3 Correct 129 ms 141304 KB Output is correct
4 Correct 132 ms 141176 KB Output is correct
5 Correct 130 ms 141304 KB Output is correct
6 Correct 132 ms 141432 KB Output is correct
7 Correct 129 ms 141276 KB Output is correct
8 Correct 130 ms 141176 KB Output is correct
9 Correct 130 ms 141176 KB Output is correct
10 Correct 131 ms 141240 KB Output is correct
11 Correct 130 ms 141432 KB Output is correct
12 Correct 129 ms 141304 KB Output is correct
13 Correct 130 ms 141292 KB Output is correct
14 Correct 131 ms 141280 KB Output is correct
15 Correct 130 ms 141192 KB Output is correct
16 Correct 131 ms 141304 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 141420 KB Output is correct
2 Correct 131 ms 141304 KB Output is correct
3 Correct 129 ms 141304 KB Output is correct
4 Correct 132 ms 141176 KB Output is correct
5 Correct 130 ms 141304 KB Output is correct
6 Correct 132 ms 141432 KB Output is correct
7 Correct 129 ms 141276 KB Output is correct
8 Correct 130 ms 141176 KB Output is correct
9 Correct 130 ms 141176 KB Output is correct
10 Correct 131 ms 141240 KB Output is correct
11 Correct 130 ms 141432 KB Output is correct
12 Correct 129 ms 141304 KB Output is correct
13 Correct 130 ms 141292 KB Output is correct
14 Correct 131 ms 141280 KB Output is correct
15 Correct 130 ms 141192 KB Output is correct
16 Correct 131 ms 141304 KB Output is correct
17 Correct 130 ms 141176 KB Output is correct
18 Correct 130 ms 141208 KB Output is correct
19 Correct 139 ms 141276 KB Output is correct
20 Correct 133 ms 141360 KB Output is correct
21 Correct 132 ms 141276 KB Output is correct
22 Correct 131 ms 141304 KB Output is correct
23 Correct 131 ms 141304 KB Output is correct
24 Correct 131 ms 141236 KB Output is correct
25 Correct 131 ms 141404 KB Output is correct
26 Correct 130 ms 141276 KB Output is correct
27 Correct 139 ms 141292 KB Output is correct
28 Correct 144 ms 141280 KB Output is correct
29 Correct 131 ms 141320 KB Output is correct
30 Correct 135 ms 141360 KB Output is correct
31 Correct 132 ms 141304 KB Output is correct
32 Correct 144 ms 141304 KB Output is correct
33 Correct 130 ms 141304 KB Output is correct
34 Correct 131 ms 141280 KB Output is correct
35 Correct 131 ms 141204 KB Output is correct
36 Correct 133 ms 141236 KB Output is correct
37 Correct 130 ms 141304 KB Output is correct
38 Correct 131 ms 141304 KB Output is correct
39 Correct 132 ms 141372 KB Output is correct
40 Correct 132 ms 141404 KB Output is correct
41 Correct 132 ms 141304 KB Output is correct
42 Correct 130 ms 141344 KB Output is correct
43 Correct 136 ms 141304 KB Output is correct
44 Correct 133 ms 141304 KB Output is correct
45 Correct 143 ms 141312 KB Output is correct
46 Correct 132 ms 141292 KB Output is correct
47 Correct 131 ms 141196 KB Output is correct
48 Correct 129 ms 141304 KB Output is correct
49 Correct 129 ms 141304 KB Output is correct
50 Correct 131 ms 141240 KB Output is correct
51 Correct 128 ms 141304 KB Output is correct
52 Correct 128 ms 141276 KB Output is correct
53 Correct 128 ms 141304 KB Output is correct

Subtask #3
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 141420 KB Output is correct
2 Correct 131 ms 141304 KB Output is correct
3 Correct 129 ms 141304 KB Output is correct
4 Correct 132 ms 141176 KB Output is correct
5 Correct 130 ms 141304 KB Output is correct
6 Correct 132 ms 141432 KB Output is correct
7 Correct 129 ms 141276 KB Output is correct
8 Correct 130 ms 141176 KB Output is correct
9 Correct 130 ms 141176 KB Output is correct
10 Correct 131 ms 141240 KB Output is correct
11 Correct 130 ms 141432 KB Output is correct
12 Correct 129 ms 141304 KB Output is correct
13 Correct 130 ms 141292 KB Output is correct
14 Correct 131 ms 141280 KB Output is correct
15 Correct 130 ms 141192 KB Output is correct
16 Correct 131 ms 141304 KB Output is correct
17 Correct 130 ms 141176 KB Output is correct
18 Correct 130 ms 141208 KB Output is correct
19 Correct 139 ms 141276 KB Output is correct
20 Correct 133 ms 141360 KB Output is correct
21 Correct 132 ms 141276 KB Output is correct
22 Correct 131 ms 141304 KB Output is correct
23 Correct 131 ms 141304 KB Output is correct
24 Correct 131 ms 141236 KB Output is correct
25 Correct 131 ms 141404 KB Output is correct
26 Correct 130 ms 141276 KB Output is correct
27 Correct 139 ms 141292 KB Output is correct
28 Correct 144 ms 141280 KB Output is correct
29 Correct 131 ms 141320 KB Output is correct
30 Correct 135 ms 141360 KB Output is correct
31 Correct 132 ms 141304 KB Output is correct
32 Correct 144 ms 141304 KB Output is correct
33 Correct 130 ms 141304 KB Output is correct
34 Correct 131 ms 141280 KB Output is correct
35 Correct 131 ms 141204 KB Output is correct
36 Correct 133 ms 141236 KB Output is correct
37 Correct 130 ms 141304 KB Output is correct
38 Correct 131 ms 141304 KB Output is correct
39 Correct 132 ms 141372 KB Output is correct
40 Correct 132 ms 141404 KB Output is correct
41 Correct 132 ms 141304 KB Output is correct
42 Correct 130 ms 141344 KB Output is correct
43 Correct 136 ms 141304 KB Output is correct
44 Correct 133 ms 141304 KB Output is correct
45 Correct 143 ms 141312 KB Output is correct
46 Correct 132 ms 141292 KB Output is correct
47 Correct 131 ms 141196 KB Output is correct
48 Correct 129 ms 141304 KB Output is correct
49 Correct 129 ms 141304 KB Output is correct
50 Correct 131 ms 141240 KB Output is correct
51 Correct 128 ms 141304 KB Output is correct
52 Correct 128 ms 141276 KB Output is correct
53 Correct 128 ms 141304 KB Output is correct
54 Correct 128 ms 141248 KB Output is correct
55 Correct 139 ms 153480 KB Output is correct
56 Correct 131 ms 141480 KB Output is correct
57 Correct 139 ms 149508 KB Output is correct
58 Correct 222 ms 158280 KB Output is correct
59 Correct 914 ms 249296 KB Output is correct
60 Correct 893 ms 249324 KB Output is correct
61 Correct 891 ms 249256 KB Output is correct
62 Correct 130 ms 141304 KB Output is correct
63 Correct 881 ms 248800 KB Output is correct
64 Runtime error 858 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
65 Halted 0 ms 0 KB -