-
Notifications
You must be signed in to change notification settings - Fork 0
/
0120.cpp
58 lines (50 loc) · 1.06 KB
/
0120.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <string>
#include <sstream>
#include <vector>
using namespace std;
double dp[1 << 12][12];
int n;
int c[12];
double d(int back, int next){
return sqrt(pow(c[back]+c[next],2)-pow(c[back]-c[next],2));
}
double solve(int state, int back){
if(dp[state][back] != -1) return dp[state][back];
if(state == (1 << n) - 1) return dp[state][back]=c[back];
double ret=1e+20;
double dist;
for(int i=0;i<n;i++){
if(!((1 << i)&state)){
if(state==0){
dist = c[i];
}else{
dist = d(back,i);
}
ret = min(ret, solve(state|1<<i,i) + dist);
}
}
return dp[state][back] = ret;
}
int main(void){
string str;
while(getline(cin, str)){
istringstream iss(str);
double l;
double ret = 1e+20;
fill((double *)dp, (double *)dp+(1<<12)*12, -1);
memset(c, 0, sizeof(c));
n = 0;
iss >> l;
while(iss >> c[n]) n++;
ret = min(ret, solve(0, 0));
if(ret <= l){
cout << "OK" << endl;
}else{
cout << "NA" << endl;
}
}
}