Submission #18301100


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,-1,0,1,1,-1,-1,1};
ll dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

double dp[1<<16];
int x[16];
int n;

double calc(int bit){
    if(dp[bit] != inf) return dp[bit];
    if(pcount(bit) == n) return 0.0;
    rep(i,16){
        double res = 0.0;
        int cnt = 0;
        if(i>0 && x[i-1]!=-1 && (bit>>x[i-1] & 1 ^ 1)){
            res += calc(bit|(1<<x[i-1])) / 3.0;
        }else cnt++;
        if(x[i]!=-1 && (bit>>x[i] & 1 ^ 1)){
            res += calc(bit|(1<<x[i])) / 3.0;
        }else cnt++;
        if(i<15 && x[i+1]!=-1 && (bit>>x[i+1] & 1 ^ 1)){
            res += calc(bit|(1<<x[i+1])) / 3.0;
        }else cnt++;
        if(cnt == 3) continue;
        chmin(dp[bit], (res + 1.0) * 3.0 / (3.0 - cnt));
    }
    return dp[bit];
}

int main(){
    cin >> n;
    rep(i,16) x[i] = -1;
    rep(i,1<<n) dp[i] = inf;
    rep(i,n){
        int a; cin >> a;
        x[a] = i;
    }
    printf("%.10f\n",calc(0));
}

Submission Info

Submission Time
Task J - ボール
User suta
Language C++ (GCC 9.2.1)
Score 5
Code Size 3345 Byte
Status AC
Exec Time 19 ms
Memory 4244 KB

Compile Error

./Main.cpp: In function ‘double calc(int)’:
./Main.cpp:97:46: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
   97 |         if(i>0 && x[i-1]!=-1 && (bit>>x[i-1] & 1 ^ 1)){
      |                                  ~~~~~~~~~~~~^~~
./Main.cpp:100:35: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
  100 |         if(x[i]!=-1 && (bit>>x[i] & 1 ^ 1)){
      |                         ~~~~~~~~~~^~~
./Main.cpp:103:47: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
  103 |         if(i<15 && x[i+1]!=-1 && (bit>>x[i+1] & 1 ^ 1)){
      |                                   ~~~~~~~~~~~~^~~

Judge Result

Set Name All
Score / Max Score 5 / 5
Status
AC × 6
Set Name Test Cases
All 00, 01, 02, 03, 90, 91
Case Name Status Exec Time Memory
00 AC 19 ms 4244 KB
01 AC 4 ms 3688 KB
02 AC 2 ms 3612 KB
03 AC 2 ms 3604 KB
90 AC 2 ms 3608 KB
91 AC 2 ms 3736 KB