oj.uz

Submission #968052

# Submission time Handle Problem Language Result Execution time Memory
968052 2024-04-23T07:25:16 Z willychan Line Town (CCO23_day1problem3) C++17
0 / 25
 1 ms 348 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include<bits/extc++.h>
//__gnu_pbds




int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n;
	cin>>n;
	vector<int> a(n);
	for(int i=0;i<n;i++) cin>>a[i];
	int prev = 0;
	vector<pair<int,int> > arr;
	for(int i=1;i<n;i++){
		if(a[i]!=a[i-1]){
			arr.push_back({i-prev,a[prev]});
			prev = i;
		}
	}
	arr.push_back({n-prev,a[prev]});
	int N = arr.size();
	int l = 0;
	int r = N;
	int cnt = 0;
	for(int i=N-1;i>=0;i--){
		if(arr[i].second==-1 && arr[i].first%2)	{
			l = i+1;
			break;
		}
	}
	for(int i=0;i<N;i++){
		if(arr[i].second==1 && arr[i].first%2)	{
			r = i;
			break;
		}
	}

	for(int i=0;i<N;i++) if(arr[i].second==-1) cnt+=arr[i].first/2;
	int minn = 1e9;
	if(l>r){
		cout<<-1<<"\n";
		return 0;
	}
	for(int i=0;i<l;i++){
		if(arr[i].second==-1) cnt-=arr[i].first/2;
		else cnt+=arr[i].first/2;
	}
	minn = cnt;
	for(int i=l;i<r;i++){
		if(arr[i].second==-1) cnt-=arr[i].first/2;
		else cnt+=arr[i].first/2;
		minn = min(cnt,minn);
	}
	cout<<minn<<"\n";
	return 0;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 3.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 3.0

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

Subtask #7
0 / 2.0

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

Subtask #8
0 / 3.0

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