Submission #971207

#	Time	Username	Problem	Language	Result	Execution time	Memory
971207		Abito	Line Town (CCO23_day1problem3)	C++17	0 / 25	1 ms	2396 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#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
#define y1 YONE
#define free freeee
#define lcm llcm
typedef unsigned long long ull;
using namespace std;
const int N=5e5+5;
int a[N],n,b[N];
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i],b[i]=a[i];
    int ans=INT_MAX;
    for (int i=0;i<=n;i++){
        for (int j=1;j<=n;j++) a[i]=b[i];
        int ansx=0;
        for (int j=1;j<i;j++){
            if (a[j]>0 && a[j+1]>0) a[j]*=-1,a[j+1]*=-1,ansx++;
        }
        for (int j=i+1;j<n;j++){
            if (a[j]<0 && a[j+1]<0) a[j]*=-1,a[j+1]*=-1,ansx++;
        }
        bool ok=true;
        for (int i=1;i<n;i++) ok&=(a[i]<=a[i+1]);
        if (ok) ans=min(ans,ansx);
    }if (ans==INT_MAX) ans=-1;
    cout<<ans<<endl;
    return 0;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 3
• Subtask 3: 0 / 3
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 3
• Subtask 7: 0 / 2
• Subtask 8: 0 / 3