oj.uz

Submission #259184

# Submission time Handle Problem Language Result Execution time Memory
259184 2020-08-07T10:36:05 Z patrikpavic2 Two Dishes (JOI19_dishes) C++17
10 / 100
 10000 ms 49768 KB 
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
 
#define PB push_back
 
using namespace std;
 
typedef long long ll;
 
const int N = 1e6 + 500;
const ll INF = 1e18;
 
ll del[N],  mora[N], S[N], T[N];
int n, m;
int Q[N], P[N], A[N], B[N];
int SS[N], TT[N];
vector < ll > v, v2;
vector < int > brisi[N];
 
/** 
 
int bio[N][N];
ll dp[N][N];
 
ll f(int x, int y){
	if(x == 0 && y == 0) return 0;
	if(bio[x][y]) return dp[x][y];
	ll ret = -INF;
	if(x)
		ret = max(ret, f(x - 1, y) + (y <= SS[x] ? P[x] : 0));
	if(y)
		ret = max(ret, f(x, y - 1) + (x <= TT[y] ? Q[y] : 0));
	bio[x][y] = 1; dp[x][y] = ret;
	return dp[x][y];
}
 
**/
 
void pocisti(int sad){
	while(sad <= m && del[sad] < mora[sad]){
		del[sad + 1] -= mora[sad] - del[sad];
		del[sad] = mora[sad]; sad++;
	}
}
 
 
int main(){
	scanf("%d%d", &n, &m);
	for(int i = 1;i <= n;i++)
		scanf("%d%lld%d", A + i, S + i, P + i);
	for(int i = 1;i <= m;i++)
		scanf("%d%lld%d", B + i, T + i, Q + i);
	ll cur = 0; v.PB(cur);
	for(int i = 1;i <= m;i++)
		cur += B[i], v.PB(cur);
	cur = 0; v2.PB(cur);
	for(int i = 1;i <= n;i++){
		cur += A[i]; v2.PB(cur);
		if(S[i] < cur)
			P[i] = 0, S[i] = cur;
		SS[i] = upper_bound(v.begin(), v.end(), S[i] - cur) - v.begin() - 1;
	}
	cur = 0;
	for(int i = 1;i <= m;i++){
		cur += B[i];
		if(T[i] < cur)
			Q[i] = 0, T[i] = cur;
		TT[i] = upper_bound(v2.begin(), v2.end(), T[i] - cur) - v2.begin() - 1;
	}
	for(int i = 1;i <= m;i++){
		del[i] = Q[i], mora[i] = Q[i];
		if(TT[i]) brisi[TT[i]].PB(i);
		else{
			mora[i] = 0; pocisti(i);
		}
	}
	//cur = 0;
	//for(int i = 1;i <= n;i++)
	//	printf("S[ %d ] = %d P[ %d ] = %d\n", i, SS[i], i, P[i]);
	//for(int i = 1;i <= m;i++)
	//	printf("T[ %d ] = %d Q[ %d ] = %d\n", i, TT[i], i, Q[i]);
	//for(int j = 0;j <= m;j++){
	//	cur += del[j];
	//	printf("%lld ", cur);
	//	if(j == m) printf("\n");
	//}
	for(int i = 1;i <= n;i++){
		del[0] += P[i];
		del[SS[i] + 1] -= P[i];
		pocisti(SS[i] + 1);
		//for(int j = 0;j <= m;j++)
		//	printf("mora[ %d ] = %d\n", j, mora[j]);
		//ll cur = 0;
		//for(int j = 0;j <= m;j++){
		//	cur += del[j];
			//if(f(i, j) != cur){
			//	printf("kurac na %d %d\n", i, j);
			//}
			//printf("%lld ", cur);
			//if(j == m) printf("\n");
		//}
		if(i == n) break;
		for(int j : brisi[i]){
			mora[j] = 0; pocisti(j);
		}
		//for(int j = 0;j <= m;j++){
		//	printf("%lld ", del[j]);
		//	if(j == m) printf("\n");
		//}
	}
	//printf("----------\n");
	//for(int i = 0;i <= n;i++){
	//	for(int j = 0;j <= m;j++)
	//		printf("%lld ", f(i, j));
	//	printf("\n");
	//}
	ll ans = 0;
	for(int i = 0;i <= m;i++)
		ans += del[i];
	printf("%lld\n", ans);
	//printf("%lld %lld\n", ans, f(n, m));
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~
dishes.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%lld%d", A + i, S + i, P + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%lld%d", B + i, T + i, Q + i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 41736 KB Output is correct
2 Execution timed out 10076 ms 49768 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 14 ms 23824 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23936 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 13 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 13 ms 23936 KB Output is correct
10 Correct 16 ms 23808 KB Output is correct
11 Correct 13 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 15 ms 23936 KB Output is correct
14 Correct 14 ms 23936 KB Output is correct
15 Correct 14 ms 23808 KB Output is correct
16 Correct 13 ms 23936 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 14 ms 23824 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23936 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 13 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 13 ms 23936 KB Output is correct
10 Correct 16 ms 23808 KB Output is correct
11 Correct 13 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 15 ms 23936 KB Output is correct
14 Correct 14 ms 23936 KB Output is correct
15 Correct 14 ms 23808 KB Output is correct
16 Correct 13 ms 23936 KB Output is correct
17 Correct 31 ms 24064 KB Output is correct
18 Correct 15 ms 24064 KB Output is correct
19 Correct 18 ms 24064 KB Output is correct
20 Correct 16 ms 24064 KB Output is correct
21 Correct 19 ms 24064 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 16 ms 24064 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 14 ms 23824 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23936 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 13 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 13 ms 23936 KB Output is correct
10 Correct 16 ms 23808 KB Output is correct
11 Correct 13 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 15 ms 23936 KB Output is correct
14 Correct 14 ms 23936 KB Output is correct
15 Correct 14 ms 23808 KB Output is correct
16 Correct 13 ms 23936 KB Output is correct
17 Correct 31 ms 24064 KB Output is correct
18 Correct 15 ms 24064 KB Output is correct
19 Correct 18 ms 24064 KB Output is correct
20 Correct 16 ms 24064 KB Output is correct
21 Correct 19 ms 24064 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 16 ms 24064 KB Output is correct
24 Execution timed out 10028 ms 40932 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 14 ms 23824 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23936 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 13 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 13 ms 23936 KB Output is correct
10 Correct 16 ms 23808 KB Output is correct
11 Correct 13 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 15 ms 23936 KB Output is correct
14 Correct 14 ms 23936 KB Output is correct
15 Correct 14 ms 23808 KB Output is correct
16 Correct 13 ms 23936 KB Output is correct
17 Correct 31 ms 24064 KB Output is correct
18 Correct 15 ms 24064 KB Output is correct
19 Correct 18 ms 24064 KB Output is correct
20 Correct 16 ms 24064 KB Output is correct
21 Correct 19 ms 24064 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 16 ms 24064 KB Output is correct
24 Execution timed out 10028 ms 40932 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23808 KB Output is correct
2 Correct 14 ms 23824 KB Output is correct
3 Correct 13 ms 23808 KB Output is correct
4 Correct 13 ms 23808 KB Output is correct
5 Correct 13 ms 23936 KB Output is correct
6 Correct 13 ms 23936 KB Output is correct
7 Correct 13 ms 23936 KB Output is correct
8 Correct 16 ms 23936 KB Output is correct
9 Correct 13 ms 23936 KB Output is correct
10 Correct 16 ms 23808 KB Output is correct
11 Correct 13 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 15 ms 23936 KB Output is correct
14 Correct 14 ms 23936 KB Output is correct
15 Correct 14 ms 23808 KB Output is correct
16 Correct 13 ms 23936 KB Output is correct
17 Correct 31 ms 24064 KB Output is correct
18 Correct 15 ms 24064 KB Output is correct
19 Correct 18 ms 24064 KB Output is correct
20 Correct 16 ms 24064 KB Output is correct
21 Correct 19 ms 24064 KB Output is correct
22 Correct 17 ms 24064 KB Output is correct
23 Correct 16 ms 24064 KB Output is correct
24 Execution timed out 10028 ms 40932 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 41736 KB Output is correct
2 Execution timed out 10076 ms 49768 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 41736 KB Output is correct
2 Execution timed out 10076 ms 49768 KB Time limit exceeded
3 Halted 0 ms 0 KB -