昨天晚上的题，早上一看第18组数据wa了，实在想不明白为啥。。。可能是因为数据太大精度损失了,太sad了.(PS能老老实实模拟就模拟…)被恶心到了.
wa的代码贴过来做记录.
B. Update Files
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
void solve(){
ll n,k;
cin >> n >> k;
ll mid = log(k)/log(2) + 1;
ll x = (1ll<<mid)-1;
n--;
ll ans = 0;
ans = mid + ceil(((ld)n-(ld)x)/(ld)k);
cout << ans << endl;
}
int main()
{
//buff;
int t = 1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
// 2^(n-1)<k n < log2(k)+1 向下取整. 2^n-1 + ceil((sum-2^n+1)/k*1.0)
今天总结总结简单构造算法题
/*
B. Before an Exam
https://codeforces.com/problemset/problem/4/B
思路：扫描两遍，第一遍把所有max加起来去判断.
第二遍去用尽可能小的数去替换.
总的来说：其实只需要扫描一遍.
*/
#include <bits/stdc++.h>
#define MaxN 0x3f3f3f3f
#define MinN 0xc0c0c0c0
#define bug(x) cout << #x"=" << x << endl;
#define BUG(a,b) cout << #a"=" << a << " " << #b"=" << b << endl;
#define ALL(a) a.begin(), a.end()
#define rep1(i,a,b) for(int i=(a);i<=(b);i++)
#define per1(i,a,b) for(int i=(a);i>=(b);i--)
#define rep2(i,a,b) for(int i=(a);i<(b);i++)
#define per2(i,a,b) for(int i=(a);i>(b);i--)
#define mset(a,b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define EPS 1e-9
#define MAX(a,b) (((a)>(b)? (a):(b)))
#define MIN(a,b) (((a)>(b)? (b):(a)))
#define buff ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define INF 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define pf(x) printf("%d\n",x);
#define sf(x) scanf("%d",&x);
using namespace std;
template<typename T>
T gcd(T a,T b){
return b?gcd(b,a%b):a;}
template<typename T>
T lcm(T a,T b){
return a*b/gcd(a,b);}
typedef long long ll;
typedef pair<int,int> PII;
typedef map<int,int> MP;
typedef set<int> ST;
const int N = 100010;
const int M = 1000100;
pair<int,int> p[40];
int b[40];
void solve(){
int n,sum;
scanf("%d%d",&n,&sum);
memset(b,-1,sizeof(b));
int s = 0;
for(int i=1;i<=n;i++){
scanf("%d%d",&p[i].fi,&p[i].se);
s += p[i].se;
}
bool f = 0;
if(s<sum) f = 0;
else if(s==sum) f = 1;
else{
for(int i=1;i<=n;i++){
if(s-p[i].se+p[i].fi<=sum){
b[i] = sum - s + p[i].se;
f = 1;
break;
}else{
b[i] = p[i].fi;
s = s - p[i].se + p[i].fi;
}
}
}
if(!f) puts("NO");
else{
puts("YES");
for(int i=1;i<=n;i++){
if(b[i]!=-1) printf("%d ",b[i]);
else printf("%d ",p[i].se);
}
printf("\n");
}
}
int main()
{
//buff;
int t = 1;
// scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
string s;
int main()
{
int ans1=0,ans2=10;
for(int i=1;i<=8;i++){
cin >> s;
int add = 0;
for(int j=0;j<8;j++)
if(s[j]=='B')add++;
if(add==8)ans1++;
ans2=min(ans2,add);
}
if(ans1==8) cout<<8<<endl;
else cout<< (ans1+ans2) <<endl;
}
/*
WWWWWWWW
BWBWBWBW
WWWWWWWW
WWWWWWWW
WWWWWWWW
WWWWWWWW
WWWWWWWW
WWWWWWWW
*/
#include <bits/stdc++.h>
#define MaxN 0x3f3f3f3f
#define MinN 0xc0c0c0c0
#define bug(x) cout << #x"=" << x << endl;
#define BUG(a,b) cout << #a"=" << a << " " << #b"=" << b << endl;
#define ALL(a) a.begin(), a.end()
#define rep1(i,a,b) for(int i=(a);i<=(b);i++)
#define per1(i,a,b) for(int i=(a);i>=(b);i--)
#define rep2(i,a,b) for(int i=(a);i<(b);i++)
#define per2(i,a,b) for(int i=(a);i>(b);i--)
#define mset(a,b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define EPS 1e-9
#define MAX(a,b) (((a)>(b)? (a):(b)))
#define MIN(a,b) (((a)>(b)? (b):(a)))
#define buff ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define INF 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
#define pf(x) printf("%d\n",x);
#define sf(x) scanf("%d",&x);
using namespace std;
template<typename T>
T gcd(T a,T b){
return b?gcd(b,a%b):a;}
template<typename T>
T lcm(T a,T b){
return a*b/gcd(a,b);}
typedef long long ll;
/*
B. Obsession with Robots
https://codeforces.com/problemset/problem/8/B
思路：记录是否回到过同一点.
注意审题!
*/
map<pair<int,int>,int> mp;
void solve(){
string s;
cin >> s;
int len = s.size();
bool f = 1;
mp[make_pair(0,0)] = 1;
int x = 0,y = 0;
for(int i=0;i<len;i++){
if(s[i]=='U'){
y++;
if(mp[make_pair(x,y+1)]==1 || mp[make_pair(x-1,y)]==1 || mp[make_pair(x+1,y)]==1){
f = 0;
break;
}
}else if(s[i]=='D'){
y--;
if(mp[make_pair(x,y-1)]==1 || mp[make_pair(x-1,y)]==1 || mp[make_pair(x+1,y)]==1){
f = 0;
break;
}
}else if(s[i]=='L'){
x--;
if(mp[make_pair(x-1,y)]==1 || mp[make_pair(x,y-1)]==1 || mp[make_pair(x,y+1)]==1){
f = 0;
break;
}
}else if(s[i]=='R'){
x++;
if(mp[make_pair(x+1,y)]==1 || mp[make_pair(x,y-1)]==1 || mp[make_pair(x,y+1)]==1){
f = 0;
break;
}
}
if(mp[make_pair(x,y)]==1){
f = 0;
break;
}
mp[make_pair(x,y)] = 1;
}
if(f) puts("OK");
else puts("BUG");
}
int main()
{
//buff;
int t = 1;
scanf("%d",&t);
while(t--){
solve();
}
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
/*
A. Increasing Sequence
https://codeforces.com/problemset/problem/11/A
*/
int b;
int main()
{
int n,d;
scanf("%d%d",&n,&d);
int ans = 0;
int a;
scanf("%d",&a);
for(int i=2;i<=n;i++){
scanf("%d",&b);
if(b<=a){
int ls = a-b;
ans += ls/d + 1;
b += (ls/d + 1)*d;
}
a = b;
}
cout << ans << endl;
return 0;
}