Submission #907564

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
907564	2024-01-15T21:14:47 Z	vjudge1	Self Study (JOI22_ho_t2)	C++17	10 / 100	47 ms	5108 KB

Main

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<ll> vi;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	ll n,m;cin>>n>>m;
	vi a(n);rep(i,0,n)cin>>a[i];
	vi b(n);rep(i,0,n)cin>>b[i];
	bool eq = true;
	rep(i,0,n)if(a[i]!=b[i]) eq=false;
	ll worst = 1e18;
	if(m==1){
		rep(i,0,n) worst=min(worst,m*max(a[i],b[i]));
	}else if(eq && n*m <= 300000){
		priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
		rep(i,0,n) pq.push({i,0});
		rep(_,0,n*m){
			auto p = pq.top(); pq.pop();
			pq.push({p.F + a[p.S], p.S});
		}
		worst = pq.top().F;
	}
	cout<<worst<<endl;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	45 ms	5108 KB	Output is correct
12	Correct	46 ms	4956 KB	Output is correct
13	Correct	36 ms	4956 KB	Output is correct
14	Correct	36 ms	5100 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	24 ms	4948 KB	Output is correct
17	Correct	47 ms	4948 KB	Output is correct
18	Correct	47 ms	4952 KB	Output is correct

Subtask #2

0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	24 ms	4948 KB	Output is correct
3	Correct	47 ms	4948 KB	Output is correct
4	Correct	47 ms	4952 KB	Output is correct
5	Incorrect	0 ms	344 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #3

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	45 ms	5108 KB	Output is correct
12	Correct	46 ms	4956 KB	Output is correct
13	Correct	36 ms	4956 KB	Output is correct
14	Correct	36 ms	5100 KB	Output is correct
15	Incorrect	0 ms	344 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #4

0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	45 ms	5108 KB	Output is correct
12	Correct	46 ms	4956 KB	Output is correct
13	Correct	36 ms	4956 KB	Output is correct
14	Correct	36 ms	5100 KB	Output is correct
15	Incorrect	0 ms	344 KB	Output isn't correct
16	Halted	0 ms	0 KB	-