oj.uz

Submission #259440

# Submission time Handle Problem Language Result Execution time Memory
259440 2020-08-07T20:25:46 Z dorijanlendvaj Two Dishes (JOI19_dishes) C++14
74 / 100
 3745 ms 247844 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=1000010;
int t,n,m;
ll re;
ll ti1[N],req1[N],rew1[N];
ll ti2[N],req2[N],rew2[N];
vector<pair<int,ll>> v[N];
map<ll,ll> mare;

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;
	for (int i=1;i<=n;++i) cin>>ti1[i]>>req1[i]>>rew1[i],ti1[i]+=ti1[i-1];
	for (int i=1;i<=m;++i) cin>>ti2[i]>>req2[i]>>rew2[i],ti2[i]+=ti2[i-1];
	for (int i=1;i<=n;++i)
	{
		if (req1[i]<ti1[i]) continue;
		int ind=upper_bound(ti2,ti2+m+1,req1[i]-ti1[i])-ti2;
		if (ind==m+1) re+=rew1[i];
		else v[ind].eb(i,rew1[i]);
	}
	for (int i=1;i<=m;++i)
	{
		if (req2[i]<ti2[i]) continue;
		int ind=upper_bound(ti1,ti1+n+1,req2[i]-ti2[i])-ti1;
		re+=rew2[i];
		v[i].eb(ind,-rew2[i]);
	}
	//cout<<re<<en;
	mare[MOD]=LLINF;
	for (int i=1;i<=m;++i)
	{
		sort(all(v[i]));
		//ll ma=0,cur=0;
		for (auto a: v[i])
		{
			mare[a.x]+=a.y;
			//ma=max(ma,cur);
			//cout<<a.x<<' '<<a.y<<' '<<cur<<' '<<ma<<en;
			//cout<<a.x<<' '<<a.y<<en;
		}
		set<int> z;
		for (auto a: v[i]) z.insert(a.x);
		while (z.size())
		{
			int ind=*z.begin();
			z.erase(z.begin());
			if (mare[ind]>0) continue;
			auto it=mare.upper_bound(ind);
			it->y+=mare[ind];
			z.insert(it->x);
			mare.erase(ind);
		}
		/*cout<<en;
		for (auto a: mare) cout<<a.x<<' '<<a.y<<en;
		cout<<en<<en;*/
		//cout<<en;
		//re+=ma;
	}
	for (auto a: mare) re+=a.y;
	cout<<re-mare[MOD]<<en;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 48120 KB Output is correct
2 Correct 366 ms 57164 KB Output is correct
3 Correct 284 ms 44792 KB Output is correct
4 Correct 282 ms 44152 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 336 ms 46936 KB Output is correct
7 Correct 174 ms 41208 KB Output is correct
8 Correct 121 ms 35452 KB Output is correct
9 Correct 295 ms 44664 KB Output is correct
10 Correct 289 ms 49712 KB Output is correct
11 Correct 234 ms 46456 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

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

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 14 ms 23808 KB Output is correct
3 Correct 14 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 14 ms 23936 KB Output is correct
9 Correct 16 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 14 ms 23808 KB Output is correct
14 Correct 15 ms 23936 KB Output is correct
15 Correct 15 ms 23808 KB Output is correct
16 Correct 14 ms 23808 KB Output is correct
17 Correct 18 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 19 ms 24192 KB Output is correct
20 Correct 18 ms 24064 KB Output is correct
21 Correct 19 ms 24192 KB Output is correct
22 Correct 19 ms 24064 KB Output is correct
23 Correct 18 ms 24064 KB Output is correct
24 Correct 450 ms 67560 KB Output is correct
25 Correct 259 ms 50128 KB Output is correct
26 Correct 463 ms 65400 KB Output is correct
27 Correct 267 ms 50296 KB Output is correct
28 Correct 374 ms 50680 KB Output is correct
29 Correct 268 ms 50936 KB Output is correct
30 Correct 584 ms 54008 KB Output is correct
31 Correct 164 ms 40036 KB Output is correct
32 Correct 176 ms 46312 KB Output is correct
33 Correct 388 ms 49144 KB Output is correct
34 Correct 480 ms 57976 KB Output is correct
35 Correct 530 ms 47656 KB Output is correct
36 Correct 514 ms 47480 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 14 ms 23808 KB Output is correct
3 Correct 14 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 14 ms 23936 KB Output is correct
9 Correct 16 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 14 ms 23808 KB Output is correct
14 Correct 15 ms 23936 KB Output is correct
15 Correct 15 ms 23808 KB Output is correct
16 Correct 14 ms 23808 KB Output is correct
17 Correct 18 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 19 ms 24192 KB Output is correct
20 Correct 18 ms 24064 KB Output is correct
21 Correct 19 ms 24192 KB Output is correct
22 Correct 19 ms 24064 KB Output is correct
23 Correct 18 ms 24064 KB Output is correct
24 Correct 450 ms 67560 KB Output is correct
25 Correct 259 ms 50128 KB Output is correct
26 Correct 463 ms 65400 KB Output is correct
27 Correct 267 ms 50296 KB Output is correct
28 Correct 374 ms 50680 KB Output is correct
29 Correct 268 ms 50936 KB Output is correct
30 Correct 584 ms 54008 KB Output is correct
31 Correct 164 ms 40036 KB Output is correct
32 Correct 176 ms 46312 KB Output is correct
33 Correct 388 ms 49144 KB Output is correct
34 Correct 480 ms 57976 KB Output is correct
35 Correct 530 ms 47656 KB Output is correct
36 Correct 514 ms 47480 KB Output is correct
37 Correct 412 ms 68528 KB Output is correct
38 Correct 357 ms 53268 KB Output is correct
39 Correct 298 ms 53848 KB Output is correct
40 Correct 434 ms 66548 KB Output is correct
41 Correct 15 ms 23808 KB Output is correct
42 Correct 634 ms 57208 KB Output is correct
43 Correct 444 ms 52200 KB Output is correct
44 Correct 509 ms 60660 KB Output is correct
45 Correct 597 ms 50844 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23808 KB Output is correct
2 Correct 14 ms 23808 KB Output is correct
3 Correct 14 ms 23808 KB Output is correct
4 Correct 15 ms 23808 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 14 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 14 ms 23936 KB Output is correct
9 Correct 16 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23936 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 14 ms 23808 KB Output is correct
14 Correct 15 ms 23936 KB Output is correct
15 Correct 15 ms 23808 KB Output is correct
16 Correct 14 ms 23808 KB Output is correct
17 Correct 18 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 19 ms 24192 KB Output is correct
20 Correct 18 ms 24064 KB Output is correct
21 Correct 19 ms 24192 KB Output is correct
22 Correct 19 ms 24064 KB Output is correct
23 Correct 18 ms 24064 KB Output is correct
24 Correct 450 ms 67560 KB Output is correct
25 Correct 259 ms 50128 KB Output is correct
26 Correct 463 ms 65400 KB Output is correct
27 Correct 267 ms 50296 KB Output is correct
28 Correct 374 ms 50680 KB Output is correct
29 Correct 268 ms 50936 KB Output is correct
30 Correct 584 ms 54008 KB Output is correct
31 Correct 164 ms 40036 KB Output is correct
32 Correct 176 ms 46312 KB Output is correct
33 Correct 388 ms 49144 KB Output is correct
34 Correct 480 ms 57976 KB Output is correct
35 Correct 530 ms 47656 KB Output is correct
36 Correct 514 ms 47480 KB Output is correct
37 Correct 412 ms 68528 KB Output is correct
38 Correct 357 ms 53268 KB Output is correct
39 Correct 298 ms 53848 KB Output is correct
40 Correct 434 ms 66548 KB Output is correct
41 Correct 15 ms 23808 KB Output is correct
42 Correct 634 ms 57208 KB Output is correct
43 Correct 444 ms 52200 KB Output is correct
44 Correct 509 ms 60660 KB Output is correct
45 Correct 597 ms 50844 KB Output is correct
46 Correct 2175 ms 247844 KB Output is correct
47 Correct 1442 ms 172360 KB Output is correct
48 Correct 1439 ms 174052 KB Output is correct
49 Correct 2450 ms 236320 KB Output is correct
50 Correct 3745 ms 191492 KB Output is correct
51 Correct 2220 ms 163120 KB Output is correct
52 Correct 2757 ms 195828 KB Output is correct
53 Correct 3373 ms 158620 KB Output is correct

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 48120 KB Output is correct
2 Correct 366 ms 57164 KB Output is correct
3 Correct 284 ms 44792 KB Output is correct
4 Correct 282 ms 44152 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 336 ms 46936 KB Output is correct
7 Correct 174 ms 41208 KB Output is correct
8 Correct 121 ms 35452 KB Output is correct
9 Correct 295 ms 44664 KB Output is correct
10 Correct 289 ms 49712 KB Output is correct
11 Correct 234 ms 46456 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 14 ms 23808 KB Output is correct
14 Correct 14 ms 23808 KB Output is correct
15 Correct 15 ms 23808 KB Output is correct
16 Correct 15 ms 23808 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 15 ms 23808 KB Output is correct
19 Correct 14 ms 23936 KB Output is correct
20 Correct 16 ms 23808 KB Output is correct
21 Correct 15 ms 23808 KB Output is correct
22 Correct 15 ms 23936 KB Output is correct
23 Correct 15 ms 23808 KB Output is correct
24 Correct 14 ms 23808 KB Output is correct
25 Correct 15 ms 23936 KB Output is correct
26 Correct 15 ms 23808 KB Output is correct
27 Correct 14 ms 23808 KB Output is correct
28 Correct 18 ms 24320 KB Output is correct
29 Correct 17 ms 24064 KB Output is correct
30 Correct 19 ms 24192 KB Output is correct
31 Correct 18 ms 24064 KB Output is correct
32 Correct 19 ms 24192 KB Output is correct
33 Correct 19 ms 24064 KB Output is correct
34 Correct 18 ms 24064 KB Output is correct
35 Correct 450 ms 67560 KB Output is correct
36 Correct 259 ms 50128 KB Output is correct
37 Correct 463 ms 65400 KB Output is correct
38 Correct 267 ms 50296 KB Output is correct
39 Correct 374 ms 50680 KB Output is correct
40 Correct 268 ms 50936 KB Output is correct
41 Correct 584 ms 54008 KB Output is correct
42 Correct 164 ms 40036 KB Output is correct
43 Correct 176 ms 46312 KB Output is correct
44 Correct 388 ms 49144 KB Output is correct
45 Correct 480 ms 57976 KB Output is correct
46 Correct 530 ms 47656 KB Output is correct
47 Correct 514 ms 47480 KB Output is correct
48 Correct 412 ms 68528 KB Output is correct
49 Correct 357 ms 53268 KB Output is correct
50 Correct 298 ms 53848 KB Output is correct
51 Correct 434 ms 66548 KB Output is correct
52 Correct 15 ms 23808 KB Output is correct
53 Correct 634 ms 57208 KB Output is correct
54 Correct 444 ms 52200 KB Output is correct
55 Correct 509 ms 60660 KB Output is correct
56 Correct 597 ms 50844 KB Output is correct
57 Incorrect 325 ms 56440 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 334 ms 48120 KB Output is correct
2 Correct 366 ms 57164 KB Output is correct
3 Correct 284 ms 44792 KB Output is correct
4 Correct 282 ms 44152 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 336 ms 46936 KB Output is correct
7 Correct 174 ms 41208 KB Output is correct
8 Correct 121 ms 35452 KB Output is correct
9 Correct 295 ms 44664 KB Output is correct
10 Correct 289 ms 49712 KB Output is correct
11 Correct 234 ms 46456 KB Output is correct
12 Correct 15 ms 23808 KB Output is correct
13 Correct 14 ms 23808 KB Output is correct
14 Correct 14 ms 23808 KB Output is correct
15 Correct 15 ms 23808 KB Output is correct
16 Correct 15 ms 23808 KB Output is correct
17 Correct 14 ms 23808 KB Output is correct
18 Correct 15 ms 23808 KB Output is correct
19 Correct 14 ms 23936 KB Output is correct
20 Correct 16 ms 23808 KB Output is correct
21 Correct 15 ms 23808 KB Output is correct
22 Correct 15 ms 23936 KB Output is correct
23 Correct 15 ms 23808 KB Output is correct
24 Correct 14 ms 23808 KB Output is correct
25 Correct 15 ms 23936 KB Output is correct
26 Correct 15 ms 23808 KB Output is correct
27 Correct 14 ms 23808 KB Output is correct
28 Correct 18 ms 24320 KB Output is correct
29 Correct 17 ms 24064 KB Output is correct
30 Correct 19 ms 24192 KB Output is correct
31 Correct 18 ms 24064 KB Output is correct
32 Correct 19 ms 24192 KB Output is correct
33 Correct 19 ms 24064 KB Output is correct
34 Correct 18 ms 24064 KB Output is correct
35 Correct 450 ms 67560 KB Output is correct
36 Correct 259 ms 50128 KB Output is correct
37 Correct 463 ms 65400 KB Output is correct
38 Correct 267 ms 50296 KB Output is correct
39 Correct 374 ms 50680 KB Output is correct
40 Correct 268 ms 50936 KB Output is correct
41 Correct 584 ms 54008 KB Output is correct
42 Correct 164 ms 40036 KB Output is correct
43 Correct 176 ms 46312 KB Output is correct
44 Correct 388 ms 49144 KB Output is correct
45 Correct 480 ms 57976 KB Output is correct
46 Correct 530 ms 47656 KB Output is correct
47 Correct 514 ms 47480 KB Output is correct
48 Correct 412 ms 68528 KB Output is correct
49 Correct 357 ms 53268 KB Output is correct
50 Correct 298 ms 53848 KB Output is correct
51 Correct 434 ms 66548 KB Output is correct
52 Correct 15 ms 23808 KB Output is correct
53 Correct 634 ms 57208 KB Output is correct
54 Correct 444 ms 52200 KB Output is correct
55 Correct 509 ms 60660 KB Output is correct
56 Correct 597 ms 50844 KB Output is correct
57 Correct 2175 ms 247844 KB Output is correct
58 Correct 1442 ms 172360 KB Output is correct
59 Correct 1439 ms 174052 KB Output is correct
60 Correct 2450 ms 236320 KB Output is correct
61 Correct 3745 ms 191492 KB Output is correct
62 Correct 2220 ms 163120 KB Output is correct
63 Correct 2757 ms 195828 KB Output is correct
64 Correct 3373 ms 158620 KB Output is correct
65 Incorrect 325 ms 56440 KB Output isn't correct
66 Halted 0 ms 0 KB -