Submission #542037

#	Time	Username	Problem	Language	Result	Execution time	Memory
542037		Sho10	Gondola (IOI14_gondola)	C++17	20 / 100	50 ms	7252 KiB

gondola

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "gondola.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=1000000007;
ld const PI=3.14159265359;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int valid(int n,int a[]){
int mn=INF,pos=-1;
map<ll,ll>viz;
for(int i=0;i<n;i++)
{
    viz[a[i]]++;
    if(a[i]<mn){
        mn=a[i];
        pos=i;
    }
}
for(ll i=0;i<n;i++)
{
    if(viz[a[i]]>=2){
        return 0;
    }
}
if(mn>n){
    return 1;
}
int b[200005];
for(int i=0;i<n;i++)
{
    b[i]=a[i];
}
a[0]=b[pos];
ll val=0;
for(ll i=pos+1;i<n;i++)
{
    a[i-pos]=b[i];
    val=i-pos;
}
val++;
for(ll i=0;i<pos;i++)
{
a[val]=b[i];
val++;
}
ll x=a[0];
x++;
b[0]=a[0];
for(ll i=1;i<n;i++)
{
    x%=n;
    if(x==0){
        x=n;
    }
b[i]=x;
x++;
}
for(ll i=1;i<n;i++)
{
    if(b[i]!=a[i]){
        if(a[i]<=n){
            return 0;
        }
    }
}
return 1;
}
int replacement(int n,int g[],int a[]){
return 0;
}
int countReplacement(int n,int a[]){
return 0;
}
/*
int32_t main(){
int n,a[15];
cin>>n;
for(int i=0;i<n;i++)
{
    cin>>a[i];
}
cout<<valid(n,a)<<endl;
}
*/

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 0 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10