제출 #566153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
566153		Uzouf	Xylophone (JOI18_xylophone)	C++14	0 / 100	4 ms	208 KiB

xylophone

#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;
 
bool sign[5005];
 
void solve(int N) {
  map<pair<int,int>,int> df;
    for (int i=1;i<=N;i++) {
      if (i+1<=N) {
        df[{i,i+1}]=query(i,i+1);
      }
      if (i+2<=N)  {
        df[{i,i+2}]=query(i,i+2);
      }
    }
  
  for (int i=2;i<=N-1;i++) {
      if (df[{i-1,i+1}]==df[{i-1,i}]+df[{i,i+1}]) sign[i]=sign[i-1];
      else sign[i]=sign[i-1]^1;
    }

    int og[N+5];
    int mn=0;
    og[1]=0;
    for (int i=1;i<=N-1;i++) {
      if (sign[i]==0) {
        og[i+1]=og[i]+df[{i,i+1}];
      }
      else {
        og[i+1]=og[i]-df[{i,i+1}];
      }
      mn=min(mn,og[i]);
    }

    mn=1-mn;
    int ans[N+5];
    bool f1=false,gg=false;
    for (int i=1;i<=N;i++) {
      //cout<<og[i]<<' ';
      ans[i]=og[i]+mn;
      if (ans[i]==1) f1=true;
      if (ans[i]==N && !f1) gg=true;
    }

    for (int i=1;i<=N;i++) {
      if (gg) ans[i]=N+1-ans[i];
      answer(i,ans[i]);
    }
  
}

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