AtCoder Beginner Contest 167 Solution
题目链接: AtCoder Beginner Contest 167
A,B不做解释
C - Skill Up
解题思路: 前期被题面卡了一下,以为是个DP,后来看到 1≤N,M≤12 的数据范围马上暴搜,复杂度O(M*2^N),1e4左右。
代码实现:
#include <bits/stdc++.h>
#define ll long long
#define mem( f, x ) memset( f, x, sizeof( f ) )
#define INF 0x3f3f3f3f
#define pii pair<int, int>
#define mk( x, y ) make_pair(x, y)
#define pk push_back
#define fi first
#define se second
using namespace std;
const int M = 15;
const int N = 15;
const int MAXN = 15;
ll m, n, x;
ll c[N], mp[N][N];
ll ret[N];
ll ans;
void DFS( int cur, ll sum ){
bool flag = 0;
for( int i = 1; i <= m; i++ ){
if( ret[i] > 0 ){
flag = 1;
break;
}
}
if( !flag ){
ans = min( ans, sum );
return;
}
for( int i = cur+1; i <= n; i++ ){
for( int j = 1; j <= m; j++ )
ret[j] -= mp[i][j];
DFS( i, sum+c[i] );
for( int j = 1; j <= m; j++ )
ret[j] += mp[i][j];
}
}
int main( ){
while( scanf( "%lld %lld %lld", &n, &m, &x ) != EOF ){
for( int i = 1; i <= m; i++ )
ret[i] = x;
for( int i = 1; i <= n; i++ ){
scanf( "%lld", c+i );
for( int j = 1; j <= m; j++ )
scanf( "%lld", *(mp+i)+j );
}
ans = INF;
DFS( 0, 0 );
if( ans == INF )
printf( "-1\n" );
else
printf( "%lld\n", ans );
}
return 0;
}
D - Teleporter
解题思路: 注意K的数据范围为1e18,而N的数据范围为2*1e5,N个结点,N条边,显然链中可能存在环,因此需要对K进行取余处理,但需要注意结点1不一定在环内。我们需要考虑两段:(1) 入环前的那段 (2) 环内那段
若在入环前那一段,直接暴力求即可;若在环内,则需减去入环前路程后对环长取余后再从入环口暴力跑。提供两种链中的判环解法:标记法和Floyed判环法。
代码实现:
1. Floyed(省空间):
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define mem(f, x) memset(f, x, sizeof(f))
#define INF 0x3f3f3f3f
using namespace std;
const int M = 2*1e5 + 50;
const int N = 2*1e5 + 50;
ll m, n;
int nxt[N];
int main( ){
while( scanf( "%lld %lld", &n, &m ) != EOF ){
for( int i = 1; i <= n; i++ )
scanf( "%d", nxt+i );
int lw = 1, fa = 1;
lw = nxt[lw], fa = nxt[fa];
fa = nxt[fa];
int cnt = 1;
bool flag = 0;
while( lw != fa ){
lw = nxt[lw];
fa = nxt[fa], fa = nxt[fa];
cnt++;
if( cnt == m ){
flag = 1;
printf( "%d\n", lw );
break;
}
}
if( flag ) continue;
fa = 1;
while( lw != fa )
lw = nxt[lw], fa = nxt[fa];
// lw: 入环口
fa = 1;
while( fa != lw ){
fa = nxt[fa];
m--; //减去入环前部分长度
}
m %= cnt;
fa = lw;
while( m ){
fa = nxt[fa];
m--;
}
printf( "%d\n", fa );
}
return 0;
}
标记法:
#include <bits/stdc++.h>
#define ll long long
#define mem( f, x ) memset( f, x, sizeof( f ) )
#define INF 0x3f3f3f3f
#define pii pair<int, int>
#define mk( x, y ) make_pair(x, y)
#define pk push_back
#define fi first
#define se second
using namespace std;
const int M = 2*1e5+50;
const int N = 2*1e5+50;
const int MAXN = 2*1e5+50;
int nxt[N];
int path[N], hh[N];
bool vis[N];
ll n, m;
int main( ){
while( scanf( "%lld %lld", &n, &m ) != EOF ){
for( int i = 1; i <= n; i++ ){
scanf( "%d", nxt+i );
vis[i] = 0;
}
int cnt = 0, cur = 1, pre = 0;
bool flag = 0;
while( !vis[cur] ){
vis[cur] = 1;
path[++cnt] = cur; //记录路径
cur = nxt[cur];
if( cnt == m ){
flag = 1;
printf( "%d\n", cur );
break;
}
}
if( flag ) continue;
for( int i = 1; i <= cnt; i++ )
hh[path[i]] = i;
int num = cnt-hh[cur]+1; //num环长,cur: 环入
m -= hh[cur]-1; //减去入环前部分
m %= num;
printf( "%d\n", path[hh[cur]+m] );
}
return 0;
}
E - Colorful Blocks
解题思路: 听说是排列组合的裸题,但公式真心推不出来,看了一眼别人推出的公式后写的,证明以后补。
公式:
对公式的一些理解: n-1 是n个block共有 n-1 对,前面乘的系数m是确定i对block的颜色共 m 种可能,C(n-1,i)为从 n-1 对中选出 i 对,还剩下 n-1-i对,每对可有 m-1 种涂色方案 (这点我没能证明出来) 因此后面乘
(m-1)^(n-1-i)。
代码实现:
#include <bits/stdc++.h>
#include <iostream>
#define mem(f, x) memset(f, x, sizeof(f))
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int M = 2*1e5 + 50;
const int N = 2*1e5 + 50;
const int MOD = 998244353;
ll m, n, k;
ll jie[N], inv[N];
ll q_pow( ll x, ll y ){ // x^y
x %= MOD, y %= MOD;
ll ret = 1;
while( y ){
if( y&1ll ) ret = ret*x%MOD;
x = x*x%MOD;
y >>= 1ll;
}
return ret%MOD;
}
void init( ){
jie[0] = inv[0] = 1ll;
for( int i = 1; i < N; i++ ){
jie[i] = jie[i-1]*i%MOD;
inv[i] = q_pow( jie[i], MOD-2 ); //阶乘的逆元
}
}
ll C( ll x, ll y ){ //C(x, y)
if( !y ) return 1;
return ( jie[x]*inv[y]%MOD )*inv[x-y]%MOD;
}
int main( ){
init( );
while( scanf( "%lld %lld %lld", &n, &m, &k ) != EOF ){
ll ret = 0;
for( ll i = 0; i <= k; i++ ){
ll tmp = q_pow( m-1, n-1-i );
ret = ( ret+( C(n-1, i)*tmp%MOD ) ) %MOD;
}
printf( "%lld\n", ret*m%MOD );
}
return 0;
}
F - Bracket Sequencing
思路来源:洛谷P4025 Bohater
解题思路: 可以参照 bzoj 3709 或是洛谷 4025(同一题) ,很经典的贪心思维,比赛时看出是贪心,后面把按左括号排序,按右括号排序,按两者差值排序都试了一遍都不行,后面才想到分段处理。
首先每一个括号串都可以看作一个怪,每个串多出来的右括号可看作打这个怪时所要消耗的血量,每个串多出来的左括号可看作打完这个怪后捡到血瓶后增加的血量。我们需要将所有怪分成两部分,(1). 打完这只怪收获的血量大于等于消耗的血量;(2). 打完这只怪收获的血量小于消耗的血量。当讨论(1)部分的怪时,很明显要先打消耗血量低的;当讨论(2)部分的怪时,很明显要先打收获血量高的。因为不管按照何种顺序处理(2)部分的怪,最终剩余的血量都是一定的,我们可以从最终体力倒推,相当于先吃药掉血,打怪物回血,这样就转变为第一种情况了,也就是倒着先打耗血少的,正着先打耗血多的,在(2)中体现为正序先打吃药时回血多的。需要注意的一点是,本题初始血量和最终的血量都要求是0,最后加特判即可;
代码实现:
#include <bits/stdc++.h>
#define ll long long
#define mem( f, x ) memset( f, x, sizeof( f ) )
#define INF 0x3f3f3f3f
#define pii pair<int, int>
#define mk( x, y ) make_pair(x, y)
#define pk push_back
#define fi first
#define se second
using namespace std;
const int M = 1e6+50;
const int N = 1e6+50;
const int MAXN = 1e6+50;
int n;
char s[N];
pii add[N], sub[N];
bool cmp1( pii p1, pii p2 ){
if( p1.se == p2.se )
return p1.fi > p2.fi;
return p1.se < p2.se;
}
bool cmp2( pii p1, pii p2 ){
if( p1.fi == p2.fi )
return p1.se < p2.se;
return p1.fi > p2.fi;
}
int main( ){
while( scanf( "%d", &n ) != EOF ){
int cnt_a = 0, cnt_s = 0, sum = 0;
for( int i = 1; i <= n; i++ ){
scanf( "%s", s );
int len = strlen( s );
int st = 0, ed = len-1;
int L = 0, R = 0;
while( s[st] == ')' && st < len )
R++, st++, sum--;
while( s[ed] == '(' && ed >= 0 )
L++, ed--, sum++;
int tmp = 0;
for( int j = st; j <= ed; j++ ){
if( s[j] == '(' ) tmp++, sum++;
else tmp--, sum--;
}
if( tmp > 0 ) L += tmp;
else R -= tmp;
if( L >= R ) add[cnt_a++] = mk( L, R );
else sub[cnt_s++] = mk( L, R );
}
if( sum ){
printf( "No\n" );
continue;
}
sort( add, add+cnt_a, cmp1 );
sort( sub, sub+cnt_s, cmp2 );
sum = 0;
bool flag = 0;
for( int i = 0; i < cnt_a; i++ ){
sum -= add[i].se;
if( sum < 0 ){
flag = 1;
printf( "No\n" );
break;
}
sum += add[i].fi;
}
if( flag ) continue;
for( int i = 0; i < cnt_s; i++ ){
sum -= sub[i].se;
if( sum < 0 ){
flag = 1;
printf( "No\n" );
break;
}
sum += sub[i].fi;
}
if( flag ) continue;
if( sum ) flag = 1;
if( flag ) printf( "No\n" );
else printf( "Yes\n" );
}
return 0;
}