Submission #1235365

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235365		CELD_07	Xylophone (JOI18_xylophone)	C++20	0 / 100	0 ms	408 KiB

xylophone

#include "xylophone.h"
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
typedef long long ll;
typedef long double ld;
#define endl "\n"
#define vll vector<ll>
#define sd second
#define ft first
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pll pair<ll, ll>
#define mod 1000000007
#define _set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>
#define inf (ll)1e15
#define db(x) cout<<#x<<" : "<<x<<endl;
#define PRESICION(x) cout.setf(ios::fixed,ios::floatfield); cout.precision(x);
using namespace std;
using namespace __gnu_pbds;
ll dx[]={1, -1, 0, 0};
ll dy[]={0, 0, 1, -1};
inline ll sm(ll a, ll b){
return ((a%mod)+(b%mod))%mod;
}
inline ll ml(ll a, ll b){
return ((a%mod)*(b%mod))%mod;
}
inline ll rs(ll a, ll b){
return ((a%mod)-(b%mod)+mod)%mod;
}
ll bpow(ll a , ll b) {
if (b==0)return 1;
if (b%2!=0)return ((bpow(a, b-1)%mod)*(a%mod))%mod;
ll r=bpow (a ,b/ 2) ;
return ((r%mod)*(r%mod))%mod;
}
void solve(int N) {
vector<ll> res(N+1, -1), res1(N+1, -1);
ll tl=1, tr=N, r=N, r1=1;
while(tl<=tr){
ll tm=(tl+tr)/2;
if(query(1, tm)==N-1){tr=tm-1;r=tm;}
else tl=tm+1;
}
ll o1=N, o2=r;
for(ll i=r; i>=1; i--){
ll o=N-query(min(i, r), max(i, r));
//cout<<i<<" "<<o<<endl;
if(res[o]==-1){answer(i, o);res[o]=1;o1=o;o2=i;}
else {
o=o1+query(min(i, o2), max(i, o2));
//cout<<i<<" "<<o<<endl;
res[o]=1;
answer(i, o);
}
}
o1=N;
o2=r;
//cout<<endl;
for(ll i=r+1; i<=N; i++){
ll o=N-query(min(i, r), max(i, r));
//cout<<i<<" "<<o<<endl;
if(res[o]==-1){answer(i, o);res[o]=1;o1=o;o2=i;}
else {
o=o1+query(min(i, o2), max(i, o2));
//cout<<i<<" "<<o<<endl;
res[o]=1;
answer(i, o);
}
}
}

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