제출 #1290687

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290687		opitu	Xylophone (JOI18_xylophone)	C++20	100 / 100	41 ms	452 KiB

xylophone

#include<bits/stdc++.h>
#include"xylophone.h"
#define X(t) m##t##_element(s.begin(),s.end())-s.begin()
using namespace std;using H=vector<int>;void solve(int N){H d(N,0),D(N,0);for(int i=1;i<N;++i)d[i]=query(i,i+1);for(int i=1;i<N-1;++i)D[i]=query(i, i+2);H s(N,0);s[1]=1;for(int i=2;i<N;++i)s[i]=s[i-1]*(1-2*(d[i-1]+d[i]>D[i-1]));for(int i=1;i<N;++i)s[i]=d[i]*s[i]+s[i-1];s[0]=0;int M=X(ax),m=X(in);int S,B;if(M<m)B=-1,S=N+s[m];else B=1,S=N-s[M];for(int i=1;i<=N;++i)answer(i,B*s[i-1]+S);}

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