oj.uz

답안 #66746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
66746 2018-08-12T08:42:07 Z cdemirer Dango Maker (JOI18_dango_maker) C++17
13 / 100
 778 ms 263168 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<vi> vvi;
typedef pair<double, double> dodo;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)


int N, M;

vvi edges;
int num_nodes = 0;
int createNode() {
	edges.pb(vi());
	return num_nodes++;
}
void connect(int a, int b) {
	edges[a].pb(b);
	edges[b].pb(a);
}

const int ARRSIZE = 3000*3000;
int parent[ARRSIZE];
bool vis[ARRSIZE] = {0};
int dpi[ARRSIZE], dpe[ARRSIZE];

void dfs(int x) {
	vis[x] = true;
	for (int i = 0; i < edges[x].size(); i++) {
		int y = edges[x][i];
		if (y == parent[x]) continue;
		parent[y] = x;
		dfs(y);
	}
	dpi[x] = 1;
	for (int i = 0; i < edges[x].size(); i++) {
		int y = edges[x][i];
		if (y == parent[x]) continue;
		dpi[x] += dpe[y];
	}
	dpe[x] = 0;
	for (int i = 0; i < edges[x].size(); i++) {
		int y = edges[x][i];
		if (y == parent[x]) continue;
		dpe[x] += max(dpi[y], dpe[y]);
	}
}

void memory_opt() {
	int mat[3000][3000];
	vi touch[3000][3000];
	cin >> N >> M;
	for (int i = 0; i < N; i++) {
		string s; cin >> s;
		for (int j = 0; j < M; j++) {
			if (s[j] == 'R') mat[i][j] = 0;
			if (s[j] == 'G') mat[i][j] = 1;
			if (s[j] == 'W') mat[i][j] = 2;
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M-2; j++) {
			if (mat[i][j]*9 + mat[i][j+1]*3 + mat[i][j+2]*1 == 5) {
				int x = createNode();
				if (touch[i][j].size() > 0) {
					for (int k = 0; k < touch[i][j].size(); k++) connect(x, touch[i][j][k]);
				}
				touch[i][j].pb(x);
				if (touch[i][j+1].size() > 0) {
					for (int k = 0; k < touch[i][j+1].size(); k++) connect(x, touch[i][j+1][k]);
				}
				touch[i][j+1].pb(x);
				if (touch[i][j+2].size() > 0) {
					for (int k = 0; k < touch[i][j+2].size(); k++) connect(x, touch[i][j+2][k]);
				}
				touch[i][j+2].pb(x);
			}
		}
	}
	for (int i = 0; i < N-2; i++) {
		for (int j = 0; j < M; j++) {
			if (mat[i][j]*9 + mat[i+1][j]*3 + mat[i+2][j]*1 == 5) {
				int x = createNode();
				if (touch[i][j].size() > 0) {
					for (int k = 0; k < touch[i][j].size(); k++) connect(x, touch[i][j][k]);
				}
				touch[i][j].pb(x);
				if (touch[i+1][j].size() > 0) {
					for (int k = 0; k < touch[i+1][j].size(); k++) connect(x, touch[i+1][j][k]);
				}
				touch[i+1][j].pb(x);
				if (touch[i+2][j].size() > 0) {
					for (int k = 0; k < touch[i+2][j].size(); k++) connect(x, touch[i+2][j][k]);
				}
				touch[i+2][j].pb(x);
			}
		};
	}
}

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	memory_opt();
	
	//cerr << num_nodes << endl;
	int sum = 0;
	for (int i = 0; i < num_nodes; i++) {
		if (vis[i]) continue;
		parent[i] = -1;
		dfs(i);
		sum += max(dpi[i], dpe[i]);
		//cerr << "i am " << i << " i added " << max(dpi[i], dpe[i]) << endl;
	}
	cout << sum << endl;
	
	return 0;
}

Compilation message

dango_maker.cpp: In function 'void dfs(int)':
dango_maker.cpp:34:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < edges[x].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < edges[x].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp:47:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < edges[x].size(); i++) {
                  ~~^~~~~~~~~~~~~~~~~
dango_maker.cpp: In function 'void memory_opt()':
dango_maker.cpp:71:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i][j].size(); k++) connect(x, touch[i][j][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:75:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i][j+1].size(); k++) connect(x, touch[i][j+1][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:79:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i][j+2].size(); k++) connect(x, touch[i][j+2][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:90:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i][j].size(); k++) connect(x, touch[i][j][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:94:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i+1][j].size(); k++) connect(x, touch[i+1][j][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~~~
dango_maker.cpp:98:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int k = 0; k < touch[i+2][j].size(); k++) connect(x, touch[i+2][j][k]);
                      ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 211704 KB Output is correct
2 Correct 239 ms 211824 KB Output is correct
3 Correct 205 ms 211956 KB Output is correct
4 Correct 202 ms 211956 KB Output is correct
5 Correct 245 ms 211956 KB Output is correct
6 Correct 203 ms 212020 KB Output is correct
7 Correct 211 ms 212020 KB Output is correct
8 Correct 200 ms 212020 KB Output is correct
9 Correct 186 ms 212088 KB Output is correct
10 Correct 218 ms 212184 KB Output is correct
11 Correct 205 ms 212212 KB Output is correct
12 Correct 199 ms 212212 KB Output is correct
13 Correct 185 ms 212268 KB Output is correct
14 Correct 202 ms 212268 KB Output is correct
15 Correct 182 ms 212268 KB Output is correct
16 Correct 209 ms 212268 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 211704 KB Output is correct
2 Correct 239 ms 211824 KB Output is correct
3 Correct 205 ms 211956 KB Output is correct
4 Correct 202 ms 211956 KB Output is correct
5 Correct 245 ms 211956 KB Output is correct
6 Correct 203 ms 212020 KB Output is correct
7 Correct 211 ms 212020 KB Output is correct
8 Correct 200 ms 212020 KB Output is correct
9 Correct 186 ms 212088 KB Output is correct
10 Correct 218 ms 212184 KB Output is correct
11 Correct 205 ms 212212 KB Output is correct
12 Correct 199 ms 212212 KB Output is correct
13 Correct 185 ms 212268 KB Output is correct
14 Correct 202 ms 212268 KB Output is correct
15 Correct 182 ms 212268 KB Output is correct
16 Correct 209 ms 212268 KB Output is correct
17 Correct 177 ms 212268 KB Output is correct
18 Correct 217 ms 212268 KB Output is correct
19 Correct 216 ms 212268 KB Output is correct
20 Correct 231 ms 212268 KB Output is correct
21 Correct 216 ms 212336 KB Output is correct
22 Correct 215 ms 212336 KB Output is correct
23 Correct 191 ms 212336 KB Output is correct
24 Correct 208 ms 212336 KB Output is correct
25 Correct 193 ms 212336 KB Output is correct
26 Correct 184 ms 212336 KB Output is correct
27 Runtime error 778 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #3
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 184 ms 211704 KB Output is correct
2 Correct 239 ms 211824 KB Output is correct
3 Correct 205 ms 211956 KB Output is correct
4 Correct 202 ms 211956 KB Output is correct
5 Correct 245 ms 211956 KB Output is correct
6 Correct 203 ms 212020 KB Output is correct
7 Correct 211 ms 212020 KB Output is correct
8 Correct 200 ms 212020 KB Output is correct
9 Correct 186 ms 212088 KB Output is correct
10 Correct 218 ms 212184 KB Output is correct
11 Correct 205 ms 212212 KB Output is correct
12 Correct 199 ms 212212 KB Output is correct
13 Correct 185 ms 212268 KB Output is correct
14 Correct 202 ms 212268 KB Output is correct
15 Correct 182 ms 212268 KB Output is correct
16 Correct 209 ms 212268 KB Output is correct
17 Correct 177 ms 212268 KB Output is correct
18 Correct 217 ms 212268 KB Output is correct
19 Correct 216 ms 212268 KB Output is correct
20 Correct 231 ms 212268 KB Output is correct
21 Correct 216 ms 212336 KB Output is correct
22 Correct 215 ms 212336 KB Output is correct
23 Correct 191 ms 212336 KB Output is correct
24 Correct 208 ms 212336 KB Output is correct
25 Correct 193 ms 212336 KB Output is correct
26 Correct 184 ms 212336 KB Output is correct
27 Runtime error 778 ms 263168 KB Execution killed with signal 9 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -