結果

問題 No.911 ラッキーソート
ユーザー apricity
提出日時 2023-02-12 18:41:51
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 5,364 bytes
コンパイル時間 1,481 ms
コンパイル使用メモリ 134,252 KB
最終ジャッジ日時 2025-02-10 14:52:15
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
# include "debug_print.hpp"
# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
# define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) is >> x;
return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
cout << t;
outr(u...);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n; ll left,right; in(n,left,right);
if(n == 1){
out(right-left+1);
return 0;
}
vector<ll> a(n); in(a);
auto get = [&](ll x, int d) -> int{
return (x >> d) & 1;
};
vector<int> v(61);
stack<P> seg;
seg.push({0,n-1});
rrep(d,61){
stack<P> nex;
int status = 0;
while(seg.size()){
auto [l,r] = seg.top(); seg.pop();
int inv_cnt = 0;
int inv_idx = -1;
FOR(i,l,r){
if(get(a[i], d) != get(a[i+1], d)){
if(inv_cnt == 1){
out(0);
return 0;
}
else{
inv_cnt = 1;
inv_idx = i;
}
}
}
if(inv_idx == -1){
nex.push({l,r});
}
else{
int newr = inv_idx;
int newl = inv_idx+1;
if(l < newr){
nex.push({l,newr});
}
if(newl < r){
nex.push({newl, r});
}
if(get(a[inv_idx],d) == 1){
status |= 2;
}
else{
status |= 1;
}
}
}
if((status & 3) == 3){
out(0);
return 0;
}
if(status == 0){
v[d] = -1;
}
if(status == 1){
v[d] = 0;
}
if(status == 2){
v[d] = 1;
}
swap(seg,nex);
}
if(seg.size()){
out(0);
return 0;
}
auto solve = [&](ll x) -> ll{
if(x < 0) return 0;
ll dp[62][2];
rep(i,62)rep(j,2) dp[i][j] = 0;
dp[61][0] = 1;
rrep(d,61){
if(get(x,d)){
if(v[d] == 1){
dp[d][0] += dp[d+1][0];
dp[d][1] += dp[d+1][1];
}
else if(v[d] == 0){
dp[d][1] += dp[d+1][0] + dp[d+1][1];
}
else{
dp[d][0] += dp[d+1][0];
dp[d][1] += dp[d+1][0] + dp[d+1][1] * 2;
}
}
else{
if(v[d] == 1){
dp[d][1] += dp[d+1][1];
}
else if(v[d] == 0){
dp[d][0] += dp[d+1][0];
dp[d][1] += dp[d+1][1];
}
else{
dp[d][0] += dp[d+1][0];
dp[d][1] += dp[d+1][1] * 2;
}
}
}
return dp[0][0] + dp[0][1];
};
out(solve(right) - solve(left-1));
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0