oj.uz

Submission #1071814

# Submission time Handle Problem Language Result Execution time Memory
1071814 2024-08-23T11:33:29 Z Abito Tricks of the Trade (CEOI23_trade) C++17
0 / 100
 8000 ms 17528 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=3e5+5;
int n,k,a[N],b[N];
bool ans[N];
int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	cin>>n>>k;
	for (int i=1;i<=n;i++) cin>>a[i];
	for (int i=1;i<=n;i++) cin>>b[i];
	int mx=LLONG_MIN;
	for (int i=1;i+k-1<=n;i++){
		multiset<int> s;
		int sum=0;
		for (int j=i;j<i+k;j++){
			s.ep(b[j]);
			sum-=a[j];
			sum+=b[j];
		}
		mx=max(mx,sum);
		for (int j=i+k;j<=n;j++){
			s.ep(b[j]);
			sum-=a[j];
			sum+=b[j];
			int x=*s.begin();
			sum-=x;
			mx=max(mx,sum);
		}
	}cout<<mx<<endl;
	return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Partially correct 1 ms 4444 KB Partially correct

Subtask #1
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Partially correct 1 ms 4440 KB Partially correct
3 Partially correct 1 ms 4444 KB Partially correct
4 Incorrect 2 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Partially correct 1 ms 4440 KB Partially correct
3 Partially correct 1 ms 4444 KB Partially correct
4 Incorrect 2 ms 4444 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Execution timed out 8084 ms 17528 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Execution timed out 8084 ms 17528 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 4444 KB Partially correct
2 Partially correct 1 ms 4444 KB Partially correct
3 Partially correct 1 ms 4444 KB Partially correct
4 Partially correct 1 ms 4440 KB Partially correct
5 Partially correct 1 ms 4444 KB Partially correct
6 Incorrect 2 ms 4444 KB Output isn't correct
7 Halted 0 ms 0 KB -