B题:
题意:给一段字符串,它是由挨个添加字符生成,生成时当添加元音时会使得整个字符串翻转,给目标字符串求生成方案数
思路:计算整个字符串的元音数并找到不翻转原串的首个元音所在位置,若元音数为奇数答案为首个元音向后到下个元音或结尾的长度,若元音数为偶数答案则为向前到上个元音或开头的长度
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100010;
char s[maxn];
bool ok( char ch )
{
if ( ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u' ) return true;
else return false;
}
int main()
{
scanf ( "%s" , s );
int len = strlen(s),cnt = 0;
for ( int i=0 ; i<len ; i++ )
{
if ( ok(s[i]) )
{
cnt++;
if ( !ok(s[0]) )
{
cnt = -1;
break;
}
}
}
if ( cnt==-1 )
printf ( "0\n" );
else if ( cnt== 0 )
printf ( "1\n" );
else
{
int tmp,ans = 0;
if ( cnt%2==1 ) tmp = (cnt+1)/2;
else tmp = cnt/2+1;
for ( int i=0 ; i<len ; i++ )
{
if ( ok(s[i]) ) tmp--;
if ( tmp==0 )
{
if ( cnt%2==1 )
{
ans++;
while ( i+ans<len&&!ok(s[i+ans]) )
ans++;
}
else
{
ans++;
while ( i-ans>=0&&!ok(s[i-ans]) )
ans++;
}
break;
}
}
printf ( "%d\n" , ans );
}
return 0;
}
C题:
题意:一个长为n的数组,只含1-K,问进行以下一种操作是否可以使得整个数组中1-K的数目相同,若无解输出*
操作一:删除数组中的一个数 -X
操作二:添加一个数到数组中 +X
操作三:删除数组中的一个数并添加一个数 -X +Y
思路:模拟处理
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int Max( int a , int b ){ return a>b?a:b; }
int Min( int a , int b ){ return a<b?a:b; }
int k,n,a[1010];
int main()
{
scanf( "%d%d" , &k , &n );
for ( int i=1 ; i<=k ; i++ ) a[i] = 0;
for ( int i=1 ; i<=n ; i++ )
{
int x; scanf( "%d" , &x ); a[x]++;
}
int maxx = -inf,cnta = 0,idxa;
int minx = +inf,cntb = 0,idxb;
for ( int i=1 ; i<=k ; i++ )
{
if ( a[i]>maxx )
{
maxx = a[i]; cnta = 1; idxa = i;
}
else if ( a[i]==maxx )
{
cnta++;
}
if ( a[i]<minx )
{
minx = a[i]; cntb = 1; idxb = i;
}
else if ( a[i]==minx )
{
cntb++;
}
}
if ( maxx-minx==1 )
{
if ( cnta==1&&cntb==k-1 )
{
printf( "-%d\n" , idxa );
}
else if ( cntb==1&&cnta==k-1 )
{
printf( "+%d\n" , idxb );
}
else
{
printf( "*\n" );
}
}
else if ( maxx-minx==2 )
{
if ( cnta==1&&cntb==1 )
{
printf( "-%d +%d\n" , idxa , idxb );
}
else
{
printf( "*\n" );
}
}
else
{
printf( "*\n" );
}
return 0;
}
E题:
题意:给一个字符串S和一个整数N,字符串中的?可以用任意数字代替,求是否存在一种代替方式,使得整数S整除N
思路:长度1000,N<=1000可以用1000*1000的数组记录状态,dfs搜索
代码:
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int Max( int a , int b ){ return a>b?a:b; }
int Min( int a , int b ){ return a<b?a:b; }
char s[1010],ans[1010]; int n,len; bool vis[1010][1010],ok;
void dfs( int dep , int sum )
{
if ( ok ) return;
if ( vis[dep][sum] ) return;
vis[dep][sum] = true;
if ( dep==len )
{
if ( sum==0 ) ok = true;
return;
}
if ( s[dep]!='?' )
{
ans[dep] = s[dep]; dfs( dep+1 , (sum*10+s[dep]-'0')%n );
if ( ok ) return;
}
else
{
int down = dep==0?1:0;
for ( int i=down ; i<=9 ; i++ )
{
ans[dep] = i+'0',dfs( dep+1 , (sum*10+i)%n );
if ( ok ) return;
}
}
}
int main()
{
scanf ( "%s%d" , s , &n );
memset( vis , false , sizeof(vis) );
len = strlen(s);
ok = false;
dfs( 0 , 0 );
ans[len] = '\0';
if ( ok ) printf( "%s\n" , ans );
else printf( "*\n" );
return 0;
}
F题:
题意:n个人,每个人有三个属性a,b,val,从选取任意多人使得没有任何两个人的两个属性都是严格大于的,选取的人可以得到价值val,a,b相同也是允许的,求最大val和
思路:对a升序b降序进行排序,对b离散化后用线段树维护对应b值的最大价值
代码:
#include<bits/stdc++.h>
using namespace std;
#define lson rt<<1
#define rson rt<<1|1
typedef long long LL;
const int maxn = 100010;
const int inf = 0x3f3f3f3f;
LL Max( LL a , LL b ){ return a>b?a:b; }
LL Min( LL a , LL b ){ return a<b?a:b; }
struct node
{
int a,b; LL val;
friend bool operator<( const node&a , const node&b )
{
if ( a.a==b.a ) return a.b>b.b;
else return a.a<b.a;
}
}a[maxn];
int n,m,b[maxn];
LL maxx[maxn<<2];
void push_up( int rt )
{
maxx[rt] = Max( maxx[lson] , maxx[rson] );
}
void build( int l , int r , int rt )
{
if ( l==r )
{
maxx[rt] = 0;
return;
}
int mid = (l+r)>>1;
build( l , mid , lson );
build( mid+1 , r , rson );
push_up( rt );
}
void update( int p , LL v , int l , int r , int rt )
{
if ( l==r )
{
maxx[rt] = Max( maxx[rt] , v );
return;
}
int mid = (l+r)>>1;
if ( p<=mid ) update( p , v , l , mid , lson );
else update( p , v , mid+1 , r , rson );
push_up( rt );
}
LL query( int L , int R , int l , int r , int rt )
{
if ( R<L ) return 0;
if ( L<=l&&R>=r ) return maxx[rt];
int mid = (l+r)>>1; LL res = 0;
if ( L<=mid ) res = Max( res , query( L , R , l , mid , lson ) );
if ( R> mid ) res = Max( res , query( L , R , mid+1 , r , rson ) );
return res;
}
int main()
{
int n; scanf( "%d" , &n );
for ( int i=1 ; i<=n ; i++ )
{
scanf( "%d%d%I64d" , &a[i].a , &a[i].b , &a[i].val );
b[i] = a[i].b;
}
LL ans = 0;
sort ( a+1 , a+n+1 );
sort ( b+1 , b+n+1 );
m = unique( b+1 , b+n+1 )-b-1;
build( 1 , m , 1 );
for ( int i=1 ; i<=n ; i++ )
{
int l=i,r=i; LL tmp = a[i].val;
while ( r+1<=n&&a[r+1].a==a[l].a&&a[r+1].b==a[l].b )
{
r++;
tmp += a[r].val;
}
//printf ( "%d %d\n" , l , r );
//printf ( "%d %d\n" , a[i].a , a[i].b );
int t = lower_bound( b+1 , b+m+1 , a[l].b )-b;
LL res = query( 1 , t-1 , 1 , m , 1 );
ans = Max( ans , res+tmp );
update( t , tmp+res , 1 , m , 1 );
i = r;
}
printf( "%lld\n" , ans );
return 0;
}
H题:
题意:水题,求Max( 0 , d-a )+Max( 0 , e-b )+Max( 0 , f-c )
思路:水题
代码:
#include<bits/stdc++.h>
using namespace std;
int Max( int a , int b ){ return a>b?a:b; }
int main()
{
int a,b,c; scanf( "%d%d%d" , &a , &b , &c );
int d,e,f; scanf( "%d%d%d" , &d , &e , &f );
printf( "%d\n" , Max( 0 , d-a )+Max( 0 , e-b )+Max( 0 , f-c ) );
return 0;
}
I题:
题意:N个点R条边Q次询问,每次询问给定一条边为必选边,其余边任选,求使得整个图连通的最小花费
思路:先做出最小生成树,若询问边为最小树中的边则答案为最小树花费,若不是则是选定边花费+最小树花费-最小树上u到v的最长边
代码:
#include<bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int Max( int a , int b ){ return a>b?a:b; }
int Min( int a , int b ){ return a<b?a:b; }
const int maxn = 100010;
const int maxm = 200010;
int tol,head[maxn];
struct edge
{
int to,next,cost;
}es[maxm];
void addedge( int u , int v , int w )
{
es[tol].to = v;
es[tol].next = head[u];
es[tol].cost = w;
head[u] = tol++;
}
struct node
{
int u,v,w; bool used;
}a[maxm];
bool cmp1( node a , node b )
{
return a.w<b.w;
}
bool cmp2( node a , node b )
{
if ( a.u!=b.u ) return a.u<b.u;
else return a.v<b.v;
}
int pre[maxn],val;
int Find( int x )
{
if ( x!=pre[x] ) pre[x] = Find( pre[x] );
return pre[x];
}
void kruskal( int m )
{
val = 0; tol = 0; memset( head , -1 , sizeof(head) );
for ( int i=1 ; i<=m ; i++ )
{
int fx = Find( a[i].u );
int fy = Find( a[i].v );
if ( fx!=fy )
{
pre[fy] = fx;
addedge( a[i].u , a[i].v , a[i].w );
addedge( a[i].v , a[i].u , a[i].w );
val += a[i].w;
a[i].used = true;
}
}
}
int fa[maxn][20],maxx[maxn][20],dep[maxn];
void dfs( int u , int f , int d )
{
for ( int i=head[u] ; i!=-1 ; i=es[i].next )
{
int v = es[i].to; if ( v==f ) continue;
int w = es[i].cost;
fa[v][0] = u;
maxx[v][0] = w;
dep[v] = d+1;
dfs( v , u , d+1 );
}
}
int lca( int u , int v )
{
if( dep[u]<dep[v] ) swap( u , v );
//printf ( "%d %d\n" , dep[u] , dep[v] );
int d = dep[u]-dep[v],res = 0;
for ( int i=19 ; i>=0 ; i-- )
{
if ( d&(1<<i) )
{
res = Max( res , maxx[u][i] );
u = fa[u][i];
}
}
if ( u==v ) return res;
for ( int i=19 ; i>=0 ; i-- )
{
if ( fa[u][i]!=fa[v][i] )
{
res = Max( res , maxx[u][i] );
res = Max( res , maxx[v][i] );
u = fa[u][i];
v = fa[v][i];
}
}
res = Max( res , maxx[u][0] );
res = Max( res , maxx[v][0] );
return res;
}
int main()
{
int n,m; scanf( "%d%d" , &n , &m );
for ( int i=1 ; i<=m ; i++ )
{
scanf( "%d%d%d" , &a[i].u , &a[i].v , &a[i].w );
a[i].used = false;
}
sort( a+1 , a+m+1 , cmp1 );
for ( int i=1 ; i<=n ; i++ )
{
pre[i] = i;
}
kruskal( m );
//printf ( "%d\n" , val );
sort( a+1 , a+m+1 , cmp2 );
fa[1][0] = 0; maxx[1][0] = 0; dep[1] = 1;
dfs ( 1 , 0 , 1 );
for( int j=1 ; j<20 ; j++ )
{
for( int i=1 ; i<=n ; i++ )
{
maxx[i][j] = Max( maxx[i][j-1] , maxx[fa[i][j-1]][j-1] );
fa[i][j] = fa[fa[i][j-1]][j-1];
}
}
int q; scanf( "%d" , &q );
for ( int i=1 ; i<=q ; i++ )
{
int u,v; scanf( "%d%d" , &u , &v );
int l=1,r=m;
while ( l<=r )
{
int mid = (l+r)>>1;
if ( a[mid].u>u||(a[mid].u==u&&a[mid].v>=v) ) r = mid-1;
else l = mid+1;
}
if ( a[l].used )
{
printf ( "%d\n" , val );
continue;
}
int tmp = a[l].w;
//printf( "%d %d %d\n" , val , lca( u , v ) , tmp );
printf( "%d\n" , val-lca( u , v )+tmp );
}
return 0;
}
J题:
题意:一个环形数列,有石头’R‘有水潭‘P’,求步长范围[1,N-1]中有多少步长,是可以有从起点跳到起点的
思路:当步长为K时需要跳N/GCD(K,N)个石头,只要有余数相同且这些位置上都是石头则说明当前步长可行
代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int Max( int a , int b ){ return a>b?a:b; }
int Gcd( int a , int b ){ return b==0?a:Gcd( b , a%b ); }
char s[maxn]; bool a[maxn],b[maxn],ok[maxn];
int main()
{
scanf ( "%s" , s );
int len = strlen(s),ans=0;
for ( int i=0 ; i<=len ; i++ )
{
ok[i] = false;
}
for ( int i=1 ; i*i<=len ; i++ )
{
if ( len%i==0 )
{
int cnta = i,cntb = len/i;
for ( int j=0 ; j<cnta ; j++ )
{
a[j] = false;
}
for ( int j=0 ; j<cntb ; j++ )
{
b[j] = false;
}
for ( int j=0 ; j<len ; j++ )
{
if ( s[j]=='P' )
{
int ta = j%(i);
int tb = j%(len/i);
if ( a[ta]==false )
{
a[ta] = true;
cnta--;
}
if ( b[tb]==false )
{
b[tb] = true;
cntb--;
}
}
}
if ( cnta>0 ) ok[i] = true;
if ( cntb>0 ) ok[len/i] = true;
}
}
for ( int i=1 ; i<len ; i++ )
ans += (ok[Gcd( i , len )]==true);
printf( "%d\n" , ans );
return 0;
}