oj.uz

Submission #143187

# Submission time Handle Problem Language Result Execution time Memory
143187 2019-08-13T10:00:00 Z cheetose 코알라 (JOI13_koala) C++11
100 / 100
 130 ms 7636 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll K,M,D,A;
int n;
ll x[100003],y[100003];
ll d[100003];
Vll vv;

ll tree[262144];
void init(int node, int S, int E)
{
	tree[node]=-INF;
	if (S == E)return;
	init(2 * node, S, (S + E) / 2);
	init(2 * node + 1, (S + E) / 2 + 1, E);
}
void upd(int node, int S, int E, int k, ll dif)
{
	if (S == E)
	{
		tree[node]=max(tree[node],dif);
		return;
	}
	if (k <= (S + E) / 2)upd(node * 2, S, (S + E) / 2, k, dif);
	else upd(node * 2 + 1, (S + E) / 2 + 1, E, k, dif);
	tree[node]=max(tree[node*2],tree[node*2+1]);
}

ll find(int node, int S, int E, int i, int j)
{
	if (i > E || j < S)return -INF;
	if (i <= S && j >= E)return tree[node];
	return max(find(node * 2, S, (S + E) / 2, i, j), find(node * 2 + 1, (S + E) / 2 + 1, E, i, j));
}
int main() {
	fill(d,d+100003,-INF);
	scanf("%lld%lld%lld%lld%d",&K,&M,&D,&A,&n);
	fup(i,1,n,1)
	{
		scanf("%lld%lld",x+i,y+i);
		x[i]-=K;
		vv.pb(x[i]%D);
	}
	x[++n]=M-K;
	vv.pb(x[n]%D);
	vv.pb(0);
	sort(ALL(vv));
	vv.resize(unique(ALL(vv))-vv.begin());
	int N=vv.size();
	init(1,0,N-1);
	d[0]=0;
	upd(1,0,N-1,0,0);
	fup(i,1,n,1)
	{
		ll t=x[i]%D;
		t=lower_bound(ALL(vv),t)-vv.begin();
		ll t1=find(1,0,N-1,t,N-1)-(x[i]/D)*A+y[i],t2=find(1,0,N-1,0,t-1)-(x[i]/D+1)*A+y[i];
		d[i]=max(t1,t2);
		upd(1,0,N-1,t,d[i]+(x[i]/D)*A);
	}
	printf("%lld",d[n]);
}

Compilation message

koala.cpp: In function 'int main()':
koala.cpp:97:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld%lld%d",&K,&M,&D,&A,&n);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
koala.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",x+i,y+i);
   ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1272 KB Output is correct
2 Correct 4 ms 1144 KB Output is correct
3 Correct 4 ms 1144 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1144 KB Output is correct
6 Correct 3 ms 1144 KB Output is correct
7 Correct 3 ms 1144 KB Output is correct
8 Correct 4 ms 1144 KB Output is correct
9 Correct 4 ms 1144 KB Output is correct
10 Correct 4 ms 1144 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 5660 KB Output is correct
2 Correct 59 ms 5228 KB Output is correct
3 Correct 28 ms 3952 KB Output is correct
4 Correct 61 ms 5580 KB Output is correct
5 Correct 37 ms 3824 KB Output is correct
6 Correct 24 ms 2992 KB Output is correct
7 Correct 33 ms 4712 KB Output is correct

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 6508 KB Output is correct
2 Correct 129 ms 7636 KB Output is correct
3 Correct 130 ms 7532 KB Output is correct
4 Correct 105 ms 7528 KB Output is correct
5 Correct 83 ms 4972 KB Output is correct
6 Correct 58 ms 4336 KB Output is correct