Submission #551924

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
551924	2022-04-21T22:29:26 Z	LucaDantas	Abduction 2 (JOI17_abduction2)	C++17	27 / 100	10 ms	932 KB

abduction2

#include <bits/stdc++.h>
using namespace std;

constexpr int maxn = 2010, inf = 0x3f3f3f3f;

int A[maxn], B[maxn], R, C;

int find_first_A(int id, int val) { int i; for(i = id+1; A[i] < val; i++); return i; }
int find_first_B(int id, int val) { int i; for(i = id+1; B[i] < val; i++); return i; }

int find_last_A(int id, int val) { int i; for(i = id-1; A[i] < val; i--); return i; }
int find_last_B(int id, int val) { int i; for(i = id-1; B[i] < val; i--); return i; }

int find_first(int lim_id, int lim_val, bool k) { return k == 0 ? find_first_A(lim_id, lim_val) : find_first_B(lim_id, lim_val); }
int find_last(int lim_id, int lim_val, bool k) { return k == 0 ? find_last_A(lim_id, lim_val) : find_last_B(lim_id, lim_val); }

map<int, long long> dp[maxn][2];

long long go(int r, int c, bool k) {
	if(dp[r][k].count(c))
		return dp[r][k][c];

	int procurar = k == 0 ? r : c, eu = k == 0 ? c : r;
	int p1 = find_last(procurar, k == 0 ? B[eu] : A[eu], k), d1 = procurar - p1, v1 = k == 0 ? A[p1] : B[p1]; // ultimo cara vertical com indice menor que c e valor maior que A[r]
	int p2 = find_first(procurar, k == 0 ? B[eu] : A[eu], k), d2 = p2 - procurar, v2 = k == 0 ? A[p2] : B[p2]; // primeiro cara vertical com indice maior que c e valor maior que A[r]
	
	if(v1 > v2) // quero manter a invariante de que v1 < v2 pra ficar mais fácil de calcular as coisas
		swap(p1, p2), swap(d1, d2), swap(v1, v2);

	// subtraio 1 dos infinitos porque eu defini eles como o primeiro ponto fora do grid (0 ou R+1/C+1), então a distância deles fica 1 a mais doq pode
	if(v1 == inf)
		return dp[r][k][c] = max(d1, d2)-1; // cheguei ao fim indo pra algum dos lados, escolho o maior obviamente
	if(v2 == inf)
		return dp[r][k][c] = max(d1 + (k == 0 ? go(p1, c, 1) : go(r, p1, 0)), (long long) d2-1); // cheguei ao fim indo pro maior mas não cheguei indo pro menor, então pego o melhor entre os dois

	// brutao pq meu guloso ta dando errado
	return dp[r][k][c] = max((long long) d1 + (k == 0 ? go(p1, c, !k) : go(r, p1, !k)), (long long) d2 + (k == 0 ? go(p2, c, !k) : go(r, p2, !k)));
}

int main() {
	int q; scanf("%d %d %d", &R, &C, &q);
	for(int i = 1; i <= R; i++)
		scanf("%d", &A[i]);
	for(int i = 1; i <= C; i++)
		scanf("%d", &B[i]);
	A[0] = A[R+1] = B[0] = B[C+1] = inf;
	while(q--) {
		int r, c; scanf("%d %d", &r, &c);
		printf("%lld\n", max(go(r, c, 0), go(r, c, 1)));
	}
}

Compilation message

abduction2.cpp: In function 'int main()':
abduction2.cpp:41:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |  int q; scanf("%d %d %d", &R, &C, &q);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
abduction2.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |   scanf("%d", &A[i]);
      |   ~~~~~^~~~~~~~~~~~~
abduction2.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |   scanf("%d", &B[i]);
      |   ~~~~~^~~~~~~~~~~~~
abduction2.cpp:48:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |   int r, c; scanf("%d %d", &r, &c);
      |             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	496 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	496 KB	Output is correct
9	Correct	1 ms	496 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	496 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	496 KB	Output is correct
9	Correct	1 ms	496 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	2 ms	536 KB	Output is correct
14	Correct	1 ms	544 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	2 ms	468 KB	Output is correct
17	Correct	1 ms	504 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	6 ms	740 KB	Output is correct
20	Correct	4 ms	764 KB	Output is correct
21	Correct	7 ms	724 KB	Output is correct
22	Correct	9 ms	892 KB	Output is correct

Subtask #3
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	496 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	496 KB	Output is correct
9	Correct	1 ms	496 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	2 ms	536 KB	Output is correct
14	Correct	1 ms	544 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	2 ms	468 KB	Output is correct
17	Correct	1 ms	504 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	6 ms	740 KB	Output is correct
20	Correct	4 ms	764 KB	Output is correct
21	Correct	7 ms	724 KB	Output is correct
22	Correct	9 ms	892 KB	Output is correct
23	Runtime error	3 ms	896 KB	Execution killed with signal 11
24	Halted	0 ms	0 KB	-

Subtask #4
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	596 KB	Output is correct
2	Correct	2 ms	724 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	3 ms	664 KB	Output is correct
5	Correct	2 ms	636 KB	Output is correct
6	Correct	5 ms	796 KB	Output is correct
7	Correct	3 ms	764 KB	Output is correct
8	Correct	5 ms	924 KB	Output is correct
9	Correct	10 ms	888 KB	Output is correct
10	Correct	6 ms	852 KB	Output is correct
11	Correct	8 ms	932 KB	Output is correct

Subtask #5
0 / 56.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	468 KB	Output is correct
4	Correct	1 ms	496 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	0 ms	468 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	496 KB	Output is correct
9	Correct	1 ms	496 KB	Output is correct
10	Correct	1 ms	468 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	2 ms	536 KB	Output is correct
14	Correct	1 ms	544 KB	Output is correct
15	Correct	1 ms	468 KB	Output is correct
16	Correct	2 ms	468 KB	Output is correct
17	Correct	1 ms	504 KB	Output is correct
18	Correct	1 ms	468 KB	Output is correct
19	Correct	6 ms	740 KB	Output is correct
20	Correct	4 ms	764 KB	Output is correct
21	Correct	7 ms	724 KB	Output is correct
22	Correct	9 ms	892 KB	Output is correct
23	Runtime error	3 ms	896 KB	Execution killed with signal 11
24	Halted	0 ms	0 KB	-

Submission #551924

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 17.0

Subtask #4 4.0 / 4.0

Subtask #5 0 / 56.0

Subtask #1
13.0 / 13.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 17.0

Subtask #4
4.0 / 4.0

Subtask #5
0 / 56.0