Submission #330090

#	Time	Username	Problem	Language	Result	Execution time	Memory
330090		Sho10	Xylophone (JOI18_xylophone)	C++14	47 / 100	3080 ms	748 KiB

xylophone

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#include "xylophone.h"
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod (10*10*10*10*10*10*10*10*10+7)
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,a[5005],s1[5005],s2[5005];
map<ll,ll>viz,v;
ll check(){
    ll nr=0;
for(ll i=1;i<=n;i++)
{
    if(v[i]==1){
        nr=1;
    }
    if(nr==0&&v[i]==n){
        return 0;
    }
    if(v[i]<1||v[i]>n){
        return 0;
    }
}
return 1;
}
void solve(int N){
    n=N;
for(ll i=1;i<n;i++)
{
    s1[i]=query(i,i+1);
}
for(ll i=1;i<n-1;i++)
{
    s2[i]=query(i,i+2);
}
for(ll i=3;i<=n;i++)
{
    if(s1[i-2]+s1[i-1]==s2[i-2]){
        viz[i]=0;
    }else {
    viz[i]=1;
    }
}
for(ll i=1;i<=n;i++)
{
    for(ll j=0;j<2;j++)
    {
        v.clear();
        v[1]=i;
        ll x=j;
        for(ll k=2;k<=n;k++)
        {
            if(x){
                v[k]=v[k-1]+s1[k-1];
            }else v[k]=v[k-1]-s1[k-1];
            if(k+1<=n&&viz[k+1]){
                x^=1;
            }
        }
        if(check()){
            for(ll i=1;i<=n;i++)
            {
                answer(i,v[i]);
            }
            return;
        }
    }
}
}
/*
int32_t main(){
CODE_START;
v[1]=2;
v[2]=1;
v[3]=5;
v[4]=3;
v[5]=4;
solve(5);
}
*/

• Subtask 1: 11 / 11
• Subtask 2: 36 / 36
• Subtask 3: 0 / 53