oj.uz

답안 #262925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
262925 2020-08-13T11:10:37 Z dorijanlendvaj Cake 3 (JOI19_cake3) C++14
24 / 100
 128 ms 144308 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=3010;
int m,n;
pair<ll,ll> h[N];
ll dp[N][N];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>m;
	memset(dp,193,sizeof(dp));
	for (int i=0;i<n;++i) cin>>h[i].y>>h[i].x;
	sort(h,h+n);
	for (int i=0;i<n;++i) swap(h[i].y,h[i].x);
	ll ma=-LLINF;
	for (int i=0;i<n;++i)
	{
		ma=max(ma,dp[i][m-1]+h[i].x-2*h[i].y);
		for (int j=0;j<m;++j) dp[i+1][j+1]=max(dp[i][j+1],dp[i][j]+h[i].x);
		dp[i+1][1]=max(dp[i+1][1],h[i].x+2*h[i].y);
	}
	cout<<ma<<en;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 71288 KB Output is correct
2 Correct 40 ms 71288 KB Output is correct
3 Correct 44 ms 71288 KB Output is correct
4 Correct 44 ms 71288 KB Output is correct
5 Correct 43 ms 71288 KB Output is correct
6 Correct 40 ms 71288 KB Output is correct
7 Correct 40 ms 71288 KB Output is correct
8 Correct 39 ms 71288 KB Output is correct
9 Correct 39 ms 71288 KB Output is correct
10 Correct 40 ms 71288 KB Output is correct
11 Correct 40 ms 71288 KB Output is correct
12 Correct 39 ms 71288 KB Output is correct
13 Correct 39 ms 71288 KB Output is correct
14 Correct 39 ms 71292 KB Output is correct
15 Correct 39 ms 71288 KB Output is correct
16 Correct 41 ms 71288 KB Output is correct
17 Correct 39 ms 71288 KB Output is correct
18 Correct 39 ms 71296 KB Output is correct
19 Correct 40 ms 71288 KB Output is correct
20 Correct 39 ms 71296 KB Output is correct
21 Correct 43 ms 71296 KB Output is correct
22 Correct 46 ms 71288 KB Output is correct
23 Correct 39 ms 71296 KB Output is correct
24 Correct 39 ms 71296 KB Output is correct
25 Correct 39 ms 71296 KB Output is correct
26 Correct 39 ms 71288 KB Output is correct
27 Correct 39 ms 71288 KB Output is correct
28 Correct 39 ms 71288 KB Output is correct
29 Correct 40 ms 71304 KB Output is correct
30 Correct 40 ms 71308 KB Output is correct
31 Correct 41 ms 71288 KB Output is correct
32 Correct 39 ms 71296 KB Output is correct
33 Correct 41 ms 71288 KB Output is correct
34 Correct 40 ms 71288 KB Output is correct
35 Correct 41 ms 71288 KB Output is correct
36 Correct 39 ms 71312 KB Output is correct
37 Correct 40 ms 71288 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 71288 KB Output is correct
2 Correct 40 ms 71288 KB Output is correct
3 Correct 44 ms 71288 KB Output is correct
4 Correct 44 ms 71288 KB Output is correct
5 Correct 43 ms 71288 KB Output is correct
6 Correct 40 ms 71288 KB Output is correct
7 Correct 40 ms 71288 KB Output is correct
8 Correct 39 ms 71288 KB Output is correct
9 Correct 39 ms 71288 KB Output is correct
10 Correct 40 ms 71288 KB Output is correct
11 Correct 40 ms 71288 KB Output is correct
12 Correct 39 ms 71288 KB Output is correct
13 Correct 39 ms 71288 KB Output is correct
14 Correct 39 ms 71292 KB Output is correct
15 Correct 39 ms 71288 KB Output is correct
16 Correct 41 ms 71288 KB Output is correct
17 Correct 39 ms 71288 KB Output is correct
18 Correct 39 ms 71296 KB Output is correct
19 Correct 40 ms 71288 KB Output is correct
20 Correct 39 ms 71296 KB Output is correct
21 Correct 43 ms 71296 KB Output is correct
22 Correct 46 ms 71288 KB Output is correct
23 Correct 39 ms 71296 KB Output is correct
24 Correct 39 ms 71296 KB Output is correct
25 Correct 39 ms 71296 KB Output is correct
26 Correct 39 ms 71288 KB Output is correct
27 Correct 39 ms 71288 KB Output is correct
28 Correct 39 ms 71288 KB Output is correct
29 Correct 40 ms 71304 KB Output is correct
30 Correct 40 ms 71308 KB Output is correct
31 Correct 41 ms 71288 KB Output is correct
32 Correct 39 ms 71296 KB Output is correct
33 Correct 41 ms 71288 KB Output is correct
34 Correct 40 ms 71288 KB Output is correct
35 Correct 41 ms 71288 KB Output is correct
36 Correct 39 ms 71312 KB Output is correct
37 Correct 40 ms 71288 KB Output is correct
38 Correct 40 ms 71288 KB Output is correct
39 Correct 41 ms 71296 KB Output is correct
40 Correct 43 ms 71300 KB Output is correct
41 Correct 44 ms 71288 KB Output is correct
42 Correct 44 ms 71288 KB Output is correct
43 Correct 45 ms 71292 KB Output is correct
44 Correct 42 ms 71356 KB Output is correct
45 Correct 41 ms 71296 KB Output is correct
46 Correct 41 ms 71288 KB Output is correct
47 Correct 43 ms 71288 KB Output is correct
48 Correct 41 ms 71288 KB Output is correct
49 Correct 42 ms 71296 KB Output is correct
50 Correct 45 ms 71276 KB Output is correct
51 Correct 42 ms 71288 KB Output is correct
52 Correct 42 ms 71292 KB Output is correct
53 Correct 43 ms 71288 KB Output is correct
54 Correct 44 ms 71288 KB Output is correct
55 Correct 44 ms 71288 KB Output is correct
56 Correct 44 ms 71288 KB Output is correct
57 Correct 43 ms 71288 KB Output is correct
58 Correct 48 ms 71288 KB Output is correct
59 Correct 45 ms 71288 KB Output is correct
60 Correct 46 ms 71288 KB Output is correct
61 Correct 42 ms 71288 KB Output is correct
62 Correct 42 ms 71292 KB Output is correct
63 Correct 41 ms 71368 KB Output is correct
64 Correct 41 ms 71308 KB Output is correct
65 Correct 38 ms 71368 KB Output is correct
66 Correct 40 ms 71288 KB Output is correct
67 Correct 39 ms 71288 KB Output is correct
68 Correct 42 ms 71288 KB Output is correct
69 Correct 40 ms 71404 KB Output is correct
70 Correct 40 ms 71296 KB Output is correct
71 Correct 40 ms 71288 KB Output is correct
72 Correct 43 ms 71360 KB Output is correct
73 Correct 49 ms 71292 KB Output is correct
74 Correct 42 ms 71288 KB Output is correct

Subtask #3
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 71288 KB Output is correct
2 Correct 40 ms 71288 KB Output is correct
3 Correct 44 ms 71288 KB Output is correct
4 Correct 44 ms 71288 KB Output is correct
5 Correct 43 ms 71288 KB Output is correct
6 Correct 40 ms 71288 KB Output is correct
7 Correct 40 ms 71288 KB Output is correct
8 Correct 39 ms 71288 KB Output is correct
9 Correct 39 ms 71288 KB Output is correct
10 Correct 40 ms 71288 KB Output is correct
11 Correct 40 ms 71288 KB Output is correct
12 Correct 39 ms 71288 KB Output is correct
13 Correct 39 ms 71288 KB Output is correct
14 Correct 39 ms 71292 KB Output is correct
15 Correct 39 ms 71288 KB Output is correct
16 Correct 41 ms 71288 KB Output is correct
17 Correct 39 ms 71288 KB Output is correct
18 Correct 39 ms 71296 KB Output is correct
19 Correct 40 ms 71288 KB Output is correct
20 Correct 39 ms 71296 KB Output is correct
21 Correct 43 ms 71296 KB Output is correct
22 Correct 46 ms 71288 KB Output is correct
23 Correct 39 ms 71296 KB Output is correct
24 Correct 39 ms 71296 KB Output is correct
25 Correct 39 ms 71296 KB Output is correct
26 Correct 39 ms 71288 KB Output is correct
27 Correct 39 ms 71288 KB Output is correct
28 Correct 39 ms 71288 KB Output is correct
29 Correct 40 ms 71304 KB Output is correct
30 Correct 40 ms 71308 KB Output is correct
31 Correct 41 ms 71288 KB Output is correct
32 Correct 39 ms 71296 KB Output is correct
33 Correct 41 ms 71288 KB Output is correct
34 Correct 40 ms 71288 KB Output is correct
35 Correct 41 ms 71288 KB Output is correct
36 Correct 39 ms 71312 KB Output is correct
37 Correct 40 ms 71288 KB Output is correct
38 Correct 40 ms 71288 KB Output is correct
39 Correct 41 ms 71296 KB Output is correct
40 Correct 43 ms 71300 KB Output is correct
41 Correct 44 ms 71288 KB Output is correct
42 Correct 44 ms 71288 KB Output is correct
43 Correct 45 ms 71292 KB Output is correct
44 Correct 42 ms 71356 KB Output is correct
45 Correct 41 ms 71296 KB Output is correct
46 Correct 41 ms 71288 KB Output is correct
47 Correct 43 ms 71288 KB Output is correct
48 Correct 41 ms 71288 KB Output is correct
49 Correct 42 ms 71296 KB Output is correct
50 Correct 45 ms 71276 KB Output is correct
51 Correct 42 ms 71288 KB Output is correct
52 Correct 42 ms 71292 KB Output is correct
53 Correct 43 ms 71288 KB Output is correct
54 Correct 44 ms 71288 KB Output is correct
55 Correct 44 ms 71288 KB Output is correct
56 Correct 44 ms 71288 KB Output is correct
57 Correct 43 ms 71288 KB Output is correct
58 Correct 48 ms 71288 KB Output is correct
59 Correct 45 ms 71288 KB Output is correct
60 Correct 46 ms 71288 KB Output is correct
61 Correct 42 ms 71288 KB Output is correct
62 Correct 42 ms 71292 KB Output is correct
63 Correct 41 ms 71368 KB Output is correct
64 Correct 41 ms 71308 KB Output is correct
65 Correct 38 ms 71368 KB Output is correct
66 Correct 40 ms 71288 KB Output is correct
67 Correct 39 ms 71288 KB Output is correct
68 Correct 42 ms 71288 KB Output is correct
69 Correct 40 ms 71404 KB Output is correct
70 Correct 40 ms 71296 KB Output is correct
71 Correct 40 ms 71288 KB Output is correct
72 Correct 43 ms 71360 KB Output is correct
73 Correct 49 ms 71292 KB Output is correct
74 Correct 42 ms 71288 KB Output is correct
75 Runtime error 128 ms 144308 KB Execution killed with signal 11 (could be triggered by violating memory limits)
76 Halted 0 ms 0 KB -