oj.uz

Submission #259444

# Submission time Handle Problem Language Result Execution time Memory
259444 2020-08-07T20:49:13 Z dorijanlendvaj Two Dishes (JOI19_dishes) C++14
100 / 100
 3668 ms 239252 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];
		if (ind!=n+1) 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 324 ms 47096 KB Output is correct
2 Correct 350 ms 55164 KB Output is correct
3 Correct 229 ms 37624 KB Output is correct
4 Correct 279 ms 43000 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 318 ms 44536 KB Output is correct
7 Correct 120 ms 33272 KB Output is correct
8 Correct 121 ms 33272 KB Output is correct
9 Correct 243 ms 37368 KB Output is correct
10 Correct 289 ms 47864 KB Output is correct
11 Correct 173 ms 38776 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 15 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct
12 Correct 15 ms 23936 KB Output is correct
13 Correct 15 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 17 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 15 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct
12 Correct 15 ms 23936 KB Output is correct
13 Correct 15 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 17 ms 23808 KB Output is correct
17 Correct 17 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 20 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 18 ms 24064 KB Output is correct
23 Correct 19 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 15 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct
12 Correct 15 ms 23936 KB Output is correct
13 Correct 15 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 17 ms 23808 KB Output is correct
17 Correct 17 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 20 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 18 ms 24064 KB Output is correct
23 Correct 19 ms 24064 KB Output is correct
24 Correct 344 ms 63072 KB Output is correct
25 Correct 258 ms 49724 KB Output is correct
26 Correct 333 ms 62184 KB Output is correct
27 Correct 263 ms 49652 KB Output is correct
28 Correct 308 ms 46200 KB Output is correct
29 Correct 208 ms 42872 KB Output is correct
30 Correct 575 ms 53368 KB Output is correct
31 Correct 135 ms 36856 KB Output is correct
32 Correct 173 ms 46316 KB Output is correct
33 Correct 368 ms 48888 KB Output is correct
34 Correct 457 ms 56312 KB Output is correct
35 Correct 523 ms 47608 KB Output is correct
36 Correct 519 ms 47352 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 15 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct
12 Correct 15 ms 23936 KB Output is correct
13 Correct 15 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 17 ms 23808 KB Output is correct
17 Correct 17 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 20 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 18 ms 24064 KB Output is correct
23 Correct 19 ms 24064 KB Output is correct
24 Correct 344 ms 63072 KB Output is correct
25 Correct 258 ms 49724 KB Output is correct
26 Correct 333 ms 62184 KB Output is correct
27 Correct 263 ms 49652 KB Output is correct
28 Correct 308 ms 46200 KB Output is correct
29 Correct 208 ms 42872 KB Output is correct
30 Correct 575 ms 53368 KB Output is correct
31 Correct 135 ms 36856 KB Output is correct
32 Correct 173 ms 46316 KB Output is correct
33 Correct 368 ms 48888 KB Output is correct
34 Correct 457 ms 56312 KB Output is correct
35 Correct 523 ms 47608 KB Output is correct
36 Correct 519 ms 47352 KB Output is correct
37 Correct 347 ms 59384 KB Output is correct
38 Correct 298 ms 46968 KB Output is correct
39 Correct 291 ms 52224 KB Output is correct
40 Correct 430 ms 64248 KB Output is correct
41 Correct 18 ms 23808 KB Output is correct
42 Correct 640 ms 50792 KB Output is correct
43 Correct 427 ms 45816 KB Output is correct
44 Correct 486 ms 53368 KB Output is correct
45 Correct 559 ms 50680 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 15 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 15 ms 23808 KB Output is correct
7 Correct 15 ms 23808 KB Output is correct
8 Correct 15 ms 23808 KB Output is correct
9 Correct 15 ms 23808 KB Output is correct
10 Correct 15 ms 23808 KB Output is correct
11 Correct 15 ms 23808 KB Output is correct
12 Correct 15 ms 23936 KB Output is correct
13 Correct 15 ms 23808 KB Output is correct
14 Correct 19 ms 23808 KB Output is correct
15 Correct 18 ms 23808 KB Output is correct
16 Correct 17 ms 23808 KB Output is correct
17 Correct 17 ms 24320 KB Output is correct
18 Correct 17 ms 24064 KB Output is correct
19 Correct 20 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 18 ms 24064 KB Output is correct
23 Correct 19 ms 24064 KB Output is correct
24 Correct 344 ms 63072 KB Output is correct
25 Correct 258 ms 49724 KB Output is correct
26 Correct 333 ms 62184 KB Output is correct
27 Correct 263 ms 49652 KB Output is correct
28 Correct 308 ms 46200 KB Output is correct
29 Correct 208 ms 42872 KB Output is correct
30 Correct 575 ms 53368 KB Output is correct
31 Correct 135 ms 36856 KB Output is correct
32 Correct 173 ms 46316 KB Output is correct
33 Correct 368 ms 48888 KB Output is correct
34 Correct 457 ms 56312 KB Output is correct
35 Correct 523 ms 47608 KB Output is correct
36 Correct 519 ms 47352 KB Output is correct
37 Correct 347 ms 59384 KB Output is correct
38 Correct 298 ms 46968 KB Output is correct
39 Correct 291 ms 52224 KB Output is correct
40 Correct 430 ms 64248 KB Output is correct
41 Correct 18 ms 23808 KB Output is correct
42 Correct 640 ms 50792 KB Output is correct
43 Correct 427 ms 45816 KB Output is correct
44 Correct 486 ms 53368 KB Output is correct
45 Correct 559 ms 50680 KB Output is correct
46 Correct 1773 ms 167288 KB Output is correct
47 Correct 1422 ms 104360 KB Output is correct
48 Correct 1399 ms 119684 KB Output is correct
49 Correct 2785 ms 181928 KB Output is correct
50 Correct 3618 ms 122848 KB Output is correct
51 Correct 2183 ms 96576 KB Output is correct
52 Correct 2692 ms 126996 KB Output is correct
53 Correct 3161 ms 120060 KB Output is correct

Subtask #7
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 47096 KB Output is correct
2 Correct 350 ms 55164 KB Output is correct
3 Correct 229 ms 37624 KB Output is correct
4 Correct 279 ms 43000 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 318 ms 44536 KB Output is correct
7 Correct 120 ms 33272 KB Output is correct
8 Correct 121 ms 33272 KB Output is correct
9 Correct 243 ms 37368 KB Output is correct
10 Correct 289 ms 47864 KB Output is correct
11 Correct 173 ms 38776 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 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 15 ms 23808 KB Output is correct
18 Correct 15 ms 23808 KB Output is correct
19 Correct 15 ms 23808 KB Output is correct
20 Correct 15 ms 23808 KB Output is correct
21 Correct 15 ms 23808 KB Output is correct
22 Correct 15 ms 23808 KB Output is correct
23 Correct 15 ms 23936 KB Output is correct
24 Correct 15 ms 23808 KB Output is correct
25 Correct 19 ms 23808 KB Output is correct
26 Correct 18 ms 23808 KB Output is correct
27 Correct 17 ms 23808 KB Output is correct
28 Correct 17 ms 24320 KB Output is correct
29 Correct 17 ms 24064 KB Output is correct
30 Correct 20 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 18 ms 24064 KB Output is correct
34 Correct 19 ms 24064 KB Output is correct
35 Correct 344 ms 63072 KB Output is correct
36 Correct 258 ms 49724 KB Output is correct
37 Correct 333 ms 62184 KB Output is correct
38 Correct 263 ms 49652 KB Output is correct
39 Correct 308 ms 46200 KB Output is correct
40 Correct 208 ms 42872 KB Output is correct
41 Correct 575 ms 53368 KB Output is correct
42 Correct 135 ms 36856 KB Output is correct
43 Correct 173 ms 46316 KB Output is correct
44 Correct 368 ms 48888 KB Output is correct
45 Correct 457 ms 56312 KB Output is correct
46 Correct 523 ms 47608 KB Output is correct
47 Correct 519 ms 47352 KB Output is correct
48 Correct 347 ms 59384 KB Output is correct
49 Correct 298 ms 46968 KB Output is correct
50 Correct 291 ms 52224 KB Output is correct
51 Correct 430 ms 64248 KB Output is correct
52 Correct 18 ms 23808 KB Output is correct
53 Correct 640 ms 50792 KB Output is correct
54 Correct 427 ms 45816 KB Output is correct
55 Correct 486 ms 53368 KB Output is correct
56 Correct 559 ms 50680 KB Output is correct
57 Correct 295 ms 41352 KB Output is correct
58 Correct 358 ms 66168 KB Output is correct
59 Correct 436 ms 67360 KB Output is correct
60 Correct 305 ms 54776 KB Output is correct
61 Correct 417 ms 54268 KB Output is correct
62 Correct 20 ms 23808 KB Output is correct
63 Correct 652 ms 57080 KB Output is correct
64 Correct 414 ms 51832 KB Output is correct
65 Correct 520 ms 56312 KB Output is correct
66 Correct 548 ms 50936 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 324 ms 47096 KB Output is correct
2 Correct 350 ms 55164 KB Output is correct
3 Correct 229 ms 37624 KB Output is correct
4 Correct 279 ms 43000 KB Output is correct
5 Correct 15 ms 23808 KB Output is correct
6 Correct 318 ms 44536 KB Output is correct
7 Correct 120 ms 33272 KB Output is correct
8 Correct 121 ms 33272 KB Output is correct
9 Correct 243 ms 37368 KB Output is correct
10 Correct 289 ms 47864 KB Output is correct
11 Correct 173 ms 38776 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 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 15 ms 23808 KB Output is correct
18 Correct 15 ms 23808 KB Output is correct
19 Correct 15 ms 23808 KB Output is correct
20 Correct 15 ms 23808 KB Output is correct
21 Correct 15 ms 23808 KB Output is correct
22 Correct 15 ms 23808 KB Output is correct
23 Correct 15 ms 23936 KB Output is correct
24 Correct 15 ms 23808 KB Output is correct
25 Correct 19 ms 23808 KB Output is correct
26 Correct 18 ms 23808 KB Output is correct
27 Correct 17 ms 23808 KB Output is correct
28 Correct 17 ms 24320 KB Output is correct
29 Correct 17 ms 24064 KB Output is correct
30 Correct 20 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 18 ms 24064 KB Output is correct
34 Correct 19 ms 24064 KB Output is correct
35 Correct 344 ms 63072 KB Output is correct
36 Correct 258 ms 49724 KB Output is correct
37 Correct 333 ms 62184 KB Output is correct
38 Correct 263 ms 49652 KB Output is correct
39 Correct 308 ms 46200 KB Output is correct
40 Correct 208 ms 42872 KB Output is correct
41 Correct 575 ms 53368 KB Output is correct
42 Correct 135 ms 36856 KB Output is correct
43 Correct 173 ms 46316 KB Output is correct
44 Correct 368 ms 48888 KB Output is correct
45 Correct 457 ms 56312 KB Output is correct
46 Correct 523 ms 47608 KB Output is correct
47 Correct 519 ms 47352 KB Output is correct
48 Correct 347 ms 59384 KB Output is correct
49 Correct 298 ms 46968 KB Output is correct
50 Correct 291 ms 52224 KB Output is correct
51 Correct 430 ms 64248 KB Output is correct
52 Correct 18 ms 23808 KB Output is correct
53 Correct 640 ms 50792 KB Output is correct
54 Correct 427 ms 45816 KB Output is correct
55 Correct 486 ms 53368 KB Output is correct
56 Correct 559 ms 50680 KB Output is correct
57 Correct 1773 ms 167288 KB Output is correct
58 Correct 1422 ms 104360 KB Output is correct
59 Correct 1399 ms 119684 KB Output is correct
60 Correct 2785 ms 181928 KB Output is correct
61 Correct 3618 ms 122848 KB Output is correct
62 Correct 2183 ms 96576 KB Output is correct
63 Correct 2692 ms 126996 KB Output is correct
64 Correct 3161 ms 120060 KB Output is correct
65 Correct 295 ms 41352 KB Output is correct
66 Correct 358 ms 66168 KB Output is correct
67 Correct 436 ms 67360 KB Output is correct
68 Correct 305 ms 54776 KB Output is correct
69 Correct 417 ms 54268 KB Output is correct
70 Correct 20 ms 23808 KB Output is correct
71 Correct 652 ms 57080 KB Output is correct
72 Correct 414 ms 51832 KB Output is correct
73 Correct 520 ms 56312 KB Output is correct
74 Correct 548 ms 50936 KB Output is correct
75 Correct 1472 ms 174068 KB Output is correct
76 Correct 1887 ms 236220 KB Output is correct
77 Correct 2439 ms 239252 KB Output is correct
78 Correct 1474 ms 176876 KB Output is correct
79 Correct 3668 ms 191464 KB Output is correct
80 Correct 2214 ms 162544 KB Output is correct
81 Correct 2797 ms 181504 KB Output is correct
82 Correct 3284 ms 159036 KB Output is correct
83 Correct 3330 ms 176580 KB Output is correct