oj.uz

Submission #53981

# Submission time Handle Problem Language Result Execution time Memory
53981 2018-07-02T06:55:32 Z tataky(#1443) Linear Garden (IOI08_linear_garden) C++11
100 / 100
 550 ms 196608 KB 
#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

int d[3][3][6][1000001];
char s[1000001];
int n, m;

int f(int mxL, int mxP, int bal, int k) {
	int v = bal - 2;
	if ((mxP - v > 2) || (mxL + v > 2)) return 0;
	if (k == 0) return 1;
	int& ret = d[mxL][mxP][bal][k];
	if (ret >= 0) return ret;
	ret = 0;
	ret += f(max(mxL, -v + 1), mxP, v + 1, k - 1);
	ret += f(mxL, max(mxP, v + 1), v + 3, k - 1);
	ret %= m;
	return ret;
}

int main() {
	memset(d, -1, sizeof(d));
	scanf("%d %d %s", &n, &m, s);
	int res = 1;
	int curmxL = 0, curmxP = 0, cnt = 0;
	for (int i = 0; i < n; i++) {
		if (s[i] == 'P') {
			res += f(max(curmxL, -cnt + 1), curmxP, cnt + 1, n - 1 - i);
			if (res >= m) res -= m;
		}
		if (s[i] == 'L') cnt--;
		else cnt++;
		curmxL = max(curmxL, -cnt);
		curmxP = max(curmxP, cnt);
	}
	printf("%d\n", res);
	return 0;
}

Compilation message

linear_garden.cpp: In function 'int main()':
linear_garden.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %s", &n, &m, s);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 182 ms 196608 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 196608 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 196608 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 196608 KB Output is correct

Subtask #5
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 196608 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 196608 KB Output is correct

Subtask #7
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 196608 KB Output is correct

Subtask #8
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 196608 KB Output is correct

Subtask #9
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 196608 KB Output is correct

Subtask #10
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 196608 KB Output is correct

Subtask #11
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 196608 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 196608 KB Output is correct
2 Correct 180 ms 196608 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 196608 KB Output is correct
2 Correct 183 ms 196608 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 196608 KB Output is correct
2 Correct 189 ms 196608 KB Output is correct
3 Correct 179 ms 196608 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 196608 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 196608 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 196608 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 196608 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 196608 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 196608 KB Output is correct

Subtask #21
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 343 ms 196608 KB Output is correct

Subtask #22
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 196608 KB Output is correct

Subtask #23
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 550 ms 196608 KB Output is correct
2 Correct 345 ms 196608 KB Output is correct
3 Correct 535 ms 196608 KB Output is correct