oj.uz

Submission #203013

# Submission time Handle Problem Language Result Execution time Memory
203013 2020-02-19T03:17:32 Z arnold518 코알라 (JOI13_koala) C++14
30 / 100
 53 ms 8824 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const ll INF = 1e18;

int N;
ll S, E, D, A;
ll T[MAXN+10], B[MAXN+10];

ll dp[MAXN+10];

struct BIT
{
	ll tree[MAXN+10];
	BIT() { for(int i=0; i<MAXN+10; i++) tree[i]=-INF; }
	void update(ll i, ll x) { for(; i<=D; i+=(i&-i)) tree[i]=max(tree[i], x); }
	ll query(ll i) { ll ret=-INF; for(; i>0; i-=(i&-i)) ret=max(ret, tree[i]); return ret; }
}bitl, bitr;

int main()
{
	int i, j;

	scanf("%lld%lld%lld%lld%d", &S, &E, &D, &A, &N);
	for(i=1; i<=N; i++) scanf("%lld%lld", &T[i], &B[i]);
	T[0]=S; T[N+1]=E;

	for(i=0; i<=N+1; i++)
	{
		if(i) dp[i]=max(bitl.query(T[i]%D)-A, bitr.query(D-T[i]%D))+B[i]-A*(T[i]/D);
		else dp[i]=0;	

		bitl.update(T[i]%D+1, dp[i]+A*(T[i]/D));
		bitr.update(D-T[i]%D, dp[i]+A*(T[i]/D));
	}
	printf("%lld\n", dp[N+1]);
}

Compilation message

koala.cpp: In function 'int main()':
koala.cpp:27:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
koala.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld%d", &S, &E, &D, &A, &N);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
koala.cpp:30:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%lld%lld", &T[i], &B[i]);
                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 9 ms 3704 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 6136 KB Output is correct
2 Correct 41 ms 5880 KB Output is correct
3 Correct 28 ms 4472 KB Output is correct
4 Correct 44 ms 6136 KB Output is correct
5 Correct 29 ms 4472 KB Output is correct
6 Correct 21 ms 3448 KB Output is correct
7 Correct 29 ms 5240 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 6368 KB Output is correct
2 Runtime error 44 ms 8824 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -