最后时刻过了一道题。。。。我自己都吓尿了。。。。。
1004 hdu 5045
DP做的
因为每个时刻每个人的解题次数不能超过1
所有用一个j来表示此刻的状态，当多1的时候为1 否则为0
然后当全部都为1的时候就 变成了0
每次只能更新为0的 应该更新为1的话就会与0的相差2
注意初始化状态为-1
因为有的状态是取不到的，-1的就不能用来更新
AC代码如下：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
double dp[1100][1100];
double num[20][1100];
int N, M;
int main(){
int T, Case = 1;
scanf( "%d", &T );
while( T-- ){
scanf( "%d%d", &N, &M );
for( int i = 1; i <= N; i++ ){
for( int j = 1; j <= M; j++ ){
scanf( "%lf", &num[i][j] );
}
}
for( int i = 0; i < 1100; i++ ){
for( int j = 0; j < 1100; j++){
dp[i][j] = -1;
}
}
dp[0][0] = 0;
for( int i = 0; i < M; i++ ){
for( int j = 0; j < ( 1 << N ); j++ ){
if( dp[i][j] < 0 ){
continue;
}
for( int k = 0; k < N; k++ ){
if( !( j & ( 1 << k ) ) ){
dp[i+1][j|(1<<k)] = max( dp[i+1][j|(1<<k)], dp[i][j] + num[k+1][i+1] );
}
}
}
dp[i+1][0] = max( dp[i+1][0], dp[i+1][(1<<N)-1] );
}
double ans = 0;
for( int i = 0; i < ( 1 << N ); i++ ){
ans = max( ans, dp[M][i] );
}
printf( "Case #%d: %.5f\n", Case++, ans );
}
return 0;
}
/*
100
3 2
0.1 0.2
0.2 0.1
0.3 0.4
*/1005 hdu 5046
二分+DLX过的。。。
套的模板。。。WA了25次。。。。。
真是那句话。。。。程序不能运行，我不知道为什么，程序突然能运行了，我还是不知道为什么。。。。
AC代码如下：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
const __int64 MAX_N = 1000;
using namespace std;
//**********************************************************************
__int64 primes, prime[MAX_N], phi[MAX_N];
bool com[MAX_N];
void get_prime_phi(){
__int64 N;
memset( com, false, sizeof( com ) );
primes = 0;
phi[1] = 1;
for (__int64 i = 2; i <= N; ++i){
if (!com[i]) {
prime[primes++] = i;
phi[i] = i-1;
}
for (__int64 j = 0; j < primes && i*prime[j] <= N; ++j){
com[i*prime[j]] = true;
if (i % prime[j])
phi[i*prime[j]] = phi[i]*(prime[j]-1);
else {
phi[i*prime[j]] = phi[i]*prime[j];
break;
}
}
}
}
//____int6464 get_phi( ____int6464 x )//单独求欧拉函数
//{
// ____int6464 i, res=x;
// for (i = 2; i < (__int64)sqrt( x * 1.0 ) + 1; i++)
// if(x%i==0) {
// res = res / i * (i - 1);
// while (x % i == 0) x /= i; // 保证i一定是素数
// }
// if (x > 1) res = res / x * (x - 1);
// return res;
//}
//**********************************************************************
struct hzh_po__int64
{
__int64 x, y;
} f[MAX_N];
__int64 dis[MAX_N][MAX_N];
__int64 N, K, head;
__int64 ABS(__int64 a)
{
return a < 0 ? -a : a;
}
void getDis()
{
__int64 i, j;
for (i = 1; i <= N; i++)
{
for (j = 1; j <= N; j++)
{
dis[i][j] = ABS(f[i].x - f[j].x) + ABS(f[i].y - f[j].y);
}
}
}
__int64 adj[MAX_N][MAX_N];
__int64 R[MAX_N * MAX_N], L[MAX_N * MAX_N], U[MAX_N * MAX_N], D[MAX_N * MAX_N];
__int64 C[MAX_N * MAX_N];
__int64 cntc[MAX_N];
void remove(__int64 c)
{
__int64 i;
for (i = D[c]; i != c; i = D[i])
{
R[L[i]] = R[i];
L[R[i]] = L[i];
}
}
void resume(__int64 c)
{
__int64 i;
for (i = D[c]; i != c; i = D[i])
{
R[L[i]] = i;
L[R[i]] = i;
}
}
__int64 h()
{
bool hash[MAX_N];
memset(hash, 0, sizeof(hash));
__int64 i, j, c;
__int64 ans = 0;
for (c = R[head]; c != head; c = R[c])
{
if (!hash[c])
{
ans ++;
for (i = D[c]; i != c; i = D[i])
{
for (j = R[i]; j != i; j = R[j])
{
hash[C[j]] = true;
}
}
}
}
// cout << c[j] <<endl;WWWWW
return ans;
}
__int64 dfs(__int64 k)
{
if (R[head] == head) return 1;
if (k + h() > K) return 0;
__int64 i, j, c;
__int64 Min = 1e10;
for (i = R[head]; i != head; i = R[i])
{
if (cntc[i] < Min)
{
Min = cntc[i];
c = i;
}
}
for (i = D[c]; i != c; i = D[i])
{
remove(i);
for (j = R[i]; j != i; j = R[j])
{
remove(j);
cntc[C[j]]--;
}
if (dfs(k + 1)) return 1;
for (j = L[i]; j != i; j = L[j])
{
resume(j);
cntc[j]++;
}
resume(i);
}
return 0;
}
__int64 Build()
{
__int64 i, j, now, pre, first;
head = 0;
for (j = head; j < N; j++)
{
R[j] = j + 1;
L[j + 1] = j;
}
L[head] = j;
R[j] = head;
for (j = 1; j <= N; j++)
{
pre = j;
cntc[j] = 0;
for (i = 1; i <= N; i++)
{
if (adj[i][j])
{
now = i * N + j;
C[now] = j;
cntc[j]++;
D[pre] = now;
U[now] = pre;
pre = now;
}
}
now = j;
D[pre] = now;
U[now] = pre;
if (cntc[j] == 0) return 0;
}
for (i = 1; i <= N; i++)
{
pre = first = -1;
for (j = 1; j <= N; j++)
{
if (adj[i][j])
{
now = i * N + j;
if (pre != -1)
{
R[pre] = now;
L[now] = pre;
}
else
{
first = now;
}
pre = now;
}
}
if (first != -1)
{
now = first;
R[pre] = now;
L[now] = pre;
}
}
return 1;
}
__int64 Judge(__int64 mid)
{
__int64 i, j;
for (i = 1; i <= N; i++)
{
for (j = 1; j <= N; j++)
{
if (dis[i][j] <= mid )
{
adj[i][j] = 1;
}
else adj[i][j] = 0;
}
}
if (Build())
return dfs(0);
else return 0;
}
__int64 Binary_Search()
{
__int64 low = 0, hig = 1e10, mid, ans = hig;
while(low <= hig)
{
mid = (low + hig) / 2;
if (Judge(mid))
{
ans = mid;
hig = mid - 1;
}
else low = mid + 1;
}
return low;
}
/*
100
2 2
1000000000 1000000000
-1000000000 -1000000000
*/
int main()
{
int T, t = 1;
scanf("%d", &T);
while(T--)
{
scanf("%I64d%I64d", &N, &K);
for (__int64 i = 1; i <= N; i++)
{
scanf("%I64d%I64d", &f[i].x, &f[i].y);
}
getDis();
__int64 ans = Binary_Search();
printf("Case #%d: %I64d\n", t++, ans);
}
return 0;
}公式 8 *n^2 - 7 * n +1
套了大数模板，然后还要加上输入输出外挂。。。
真是醉了
AC代码如下：
#include<iostream>
#include<string>
#include <cstring>
#include <cstdio>
#include<iomanip>
#include<algorithm>
using namespace std;
#define MAXN 9
#define MAXSIZE 10
#define DLEN 1
class BigNum
{
private:
int a[500]; //可以控制大数的位数
int len; //大数长度
public:
BigNum(){ len = 1;memset(a,0,sizeof(a)); } //构造函数
BigNum(const __int64); //将一个int类型的变量转化为大数
BigNum(const char*); //将一个字符串类型的变量转化为大数
BigNum(const BigNum &); //拷贝构造函数
BigNum &operator=(const BigNum &); //重载赋值运算符，大数之间进行赋值运算
friend istream& operator>>(istream&, BigNum&); //重载输入运算符
friend ostream& operator<<(ostream&, BigNum&); //重载输出运算符
BigNum operator+(const BigNum &) const; //重载加法运算符，两个大数之间的相加运算
BigNum operator-(const BigNum &) const; //重载减法运算符，两个大数之间的相减运算
BigNum operator*(const BigNum &) const; //重载乘法运算符，两个大数之间的相乘运算
BigNum operator/(const int &) const; //重载除法运算符，大数对一个整数进行相除运算
BigNum operator^(const int &) const; //大数的n次方运算
int operator%(const int &) const; //大数对一个int类型的变量进行取模运算
bool operator>(const BigNum & T)const; //大数和另一个大数的大小比较
bool operator==(const BigNum & T)const{//大数和另一个大数的大小是否相等
if( len != T.len ){
return false;
}else{
for( int i = 0; i < len; i++ ){
if( a[i] != T.a[i] ){
return false;
}
}
return true;
}
}
bool operator>(const int & t)const; //大数和一个int类型的变量的大小比较
void print(); //输出大数
};
BigNum::BigNum(const __int64 b) //将一个int类型的变量转化为大数
{
__int64 c,d = b;
len = 0;
memset(a,0,sizeof(a));
while(d > MAXN)
{
c = d - (d / (MAXN + 1)) * (MAXN + 1);
d = d / (MAXN + 1);
a[len++] = c;
}
a[len++] = d;
}
BigNum::BigNum(const char*s) //将一个字符串类型的变量转化为大数
{
int t,k,index,l,i;
memset(a,0,sizeof(a));
l=strlen(s);
len=l/DLEN;
if(l%DLEN)
len++;
index=0;
for(i=l-1;i>=0;i-=DLEN)
{
t=0;
k=i-DLEN+1;
if(k<0)
k=0;
for(int j=k;j<=i;j++)
t=t*10+s[j]-'0';
a[index++]=t;
}
}
BigNum::BigNum(const BigNum & T) : len(T.len) //拷贝构造函数
{
int i;
memset(a,0,sizeof(a));
for(i = 0 ; i < len ; i++)
a[i] = T.a[i];
}
BigNum & BigNum::operator=(const BigNum & n) //重载赋值运算符，大数之间进行赋值运算
{
int i;
len = n.len;
memset(a,0,sizeof(a));
for(i = 0 ; i < len ; i++)
a[i] = n.a[i];
return *this;
}
istream& operator>>(istream & in, BigNum & b) //重载输入运算符
{
char ch[MAXSIZE*4];
int i = -1;
in>>ch;
int l=strlen(ch);
int count=0,sum=0;
for(i=l-1;i>=0;)
{
sum = 0;
int t=1;
for(int j=0;j<4&&i>=0;j++,i--,t*=10)
{
sum+=(ch[i]-'0')*t;
}
b.a[count]=sum;
count++;
}
b.len =count++;
return in;
}
ostream& operator<<(ostream& out, BigNum& b) //重载输出运算符
{
int i;
cout << b.a[b.len - 1];
for(i = b.len - 2 ; i >= 0 ; i--)
{
cout.width(DLEN);
cout.fill('0');
cout << b.a[i];
}
return out;
}
BigNum BigNum::operator+(const BigNum & T) const //两个大数之间的相加运算
{
BigNum t(*this);
int i,big; //位数
big = T.len > len ? T.len : len;
for(i = 0 ; i < big ; i++)
{
t.a[i] +=T.a[i];
if(t.a[i] > MAXN)
{
t.a[i + 1]++;
t.a[i] -=MAXN+1;
}
}
if(t.a[big] != 0)
t.len = big + 1;
else
t.len = big;
return t;
}
BigNum BigNum::operator-(const BigNum & T) const //两个大数之间的相减运算
{
int i,j,big;
bool flag;
BigNum t1,t2;
if(*this>T)
{
t1=*this;
t2=T;
flag=0;
}
else
{
t1=T;
t2=*this;
flag=1;
}
big=t1.len;
for(i = 0 ; i < big ; i++)
{
if(t1.a[i] < t2.a[i])
{
j = i + 1;
while(t1.a[j] == 0)
j++;
t1.a[j--]--;
while(j > i)
t1.a[j--] += MAXN;
t1.a[i] += MAXN + 1 - t2.a[i];
}
else
t1.a[i] -= t2.a[i];
}
t1.len = big;
while(t1.a[len - 1] == 0 && t1.len > 1)
{
t1.len--;
big--;
}
if(flag)
t1.a[big-1]=0-t1.a[big-1];
return t1;
}
BigNum BigNum::operator*(const BigNum & T) const //两个大数之间的相乘运算
{
BigNum ret;
int i,j,up;
int temp,temp1;
for(i = 0 ; i < len ; i++)
{
up = 0;
for(j = 0 ; j < T.len ; j++)
{
temp = a[i] * T.a[j] + ret.a[i + j] + up;
if(temp > MAXN)
{
temp1 = temp - temp / (MAXN + 1) * (MAXN + 1);
up = temp / (MAXN + 1);
ret.a[i + j] = temp1;
}
else
{
up = 0;
ret.a[i + j] = temp;
}
}
if(up != 0)
ret.a[i + j] = up;
}
ret.len = i + j;
while(ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
BigNum BigNum::operator/(const int & b) const //大数对一个整数进行相除运算
{
BigNum ret;
int i,down = 0;
for(i = len - 1 ; i >= 0 ; i--)
{
ret.a[i] = (a[i] + down * (MAXN + 1)) / b;
down = a[i] + down * (MAXN + 1) - ret.a[i] * b;
}
ret.len = len;
while(ret.a[ret.len - 1] == 0 && ret.len > 1)
ret.len--;
return ret;
}
int BigNum::operator %(const int & b) const //大数对一个int类型的变量进行取模运算
{
int i,d=0;
for (i = len-1; i>=0; i--)
{
d = ((d * (MAXN+1))% b + a[i])% b;
}
return d;
}
BigNum BigNum::operator^(const int & n) const //大数的n次方运算
{
BigNum t,ret(1);
int i;
if(n<0)
exit(-1);
if(n==0)
return 1;
if(n==1)
return *this;
int m=n;
while(m>1)
{
t=*this;
for( i=1;i<<1<=m;i<<=1)
{
t=t*t;
}
m-=i;
ret=ret*t;
if(m==1)
ret=ret*(*this);
}
return ret;
}
bool BigNum::operator>(const BigNum & T) const //大数和另一个大数的大小比较
{
int ln;
if(len > T.len)
return true;
else if(len == T.len)
{
ln = len - 1;
while(a[ln] == T.a[ln] && ln >= 0)
ln--;
if(ln >= 0 && a[ln] > T.a[ln])
return true;
else
return false;
}
else
return false;
}
bool BigNum::operator >(const int & t) const //大数和一个int类型的变量的大小比较
{
BigNum b(t);
return *this>b;
}
inline void pt(int n){
if(n < 0)
putchar('-'), n = -n;
int len = 0,data[20];
while(n)
data[len++] = n%10, n /= 10;
if(!len) data[len++] = 0;
while(len--) putchar(data[len]+48);
}
void BigNum::print() //输出大数
{
int i;
pt(a[len - 1] );
for(i = len - 2 ; i >= 0 ; i--)
{
// cout.width(DLEN);
// cout.fill('0');
// cout << a[i];
pt( a[i] );
}
puts("");
}
inline bool rd(__int64 &n){
__int64 x = 0, tmp = 1;
char c = getchar();
while((c < '0' || c > '9') && c != '-' && c != EOF) c = getchar();
if(c == EOF) return false;
if(c == '-') c = getchar(), tmp = -1;
while(c >= '0' && c <= '9') x *= 10, x += (c - '0'),c = getchar();
n = x*tmp;
return true;
}
int main(){
int T, Case = 1;
BigNum n, ans;
__int64 N;
scanf( "%d", &T );
while( T-- ){
rd( N );
n = N;
BigNum t, t1 = 7, t2 = 8;
ans = n *n;
ans = t2 * ans;
t = t1 * n;
ans = ans - t;
ans = ans + 1;
printf( "Case #%d: ", Case++ );
ans.print();
}
}1009 hdu 5050
求最大公约数
队友写的。。。
用java
队友临时突击java我也是醉了
最后终于过了我也是快哭了
AC代码如下：
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner cin = new Scanner(System.in);
int Cas = cin.nextInt(), t = 1;
while (Cas-- > 0) {
BigInteger A = BigInteger.ZERO, B = BigInteger.ZERO;
String str1 = cin.next(), str2 = cin.next();
for (int i = 0; i < str1.length(); ++i) {
A = (A.multiply(BigInteger.valueOf(2))).add(BigInteger.valueOf(str1.charAt(i) - '0'));
}
for (int i = 0; i < str2.length(); ++i) {
B = (B.multiply(BigInteger.valueOf(2))).add(BigInteger.valueOf(str2.charAt(i) - '0'));
}
//System.out.println(A+ " " + B);
BigInteger ans = GCD(A, B);
String str = "";
while (ans.compareTo(BigInteger.ZERO) != 0) {
str += ans.mod(BigInteger.valueOf(2));
ans = ans.divide(BigInteger.valueOf(2));
}
System.out.print("Case #"+t++ +": ");
for (int i = str.length() - 1; i >= 0; --i) System.out.print(str.charAt(i));
System.out.println();
}
}
public static BigInteger GCD(BigInteger A, BigInteger B) {
return (B.compareTo(BigInteger.ZERO) == 0 ? A : GCD(B, A.mod(B)));
}
}1012 签到题
Orz
听说是赛前一小时的时候加上去的。。。
Orz 给bin神跪了
扫一扫
2524
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
