A. Add Candies
输出1-n
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 2e5 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
int main()
{
ios ;
int T ;
cin >> T ;
while(T --)
{
int n ;
cin >> n ;
cout << n << '\n' ;
rep(i , 1 , n) cout << i << " \n"[i == n] ;
}
return 0 ;
}
B. Numbers Box
判一下负数的个数的奇偶性,是否存在0。
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 100 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
int n , m ;
int a[maxn][maxn] ;
int main()
{
ios ;
int T ;
cin >> T ;
while(T --)
{
int sum = 0 ;
int mn = 200 ;
cin >> n >> m ;
rep(i , 1 , n) rep(j , 1 , m) cin >> a[i][j] , sum += abs(a[i][j]) , mn = min(mn , abs(a[i][j])) ;
bool f = 0 ;
int num = 0 ;
rep(i , 1 , n) rep(j , 1 , m) if(a[i][j] < 0) num ++ ; else if(a[i][j] == 0) f = 1 ;
f |= (num % 2 == 0) ;
if(f == 1) cout << sum << '\n' ;
else cout << sum - 2 * mn << '\n' ;
}
return 0 ;
}
C. Knapsack
在不超过W的物品中按照重量从大到小取就行了。
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 2e5 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
int n ;
ll w ;
struct node
{
ll val ;
int id ;
bool operator < (const node &s) const
{
return val > s.val ;
}
} a[maxn] ;
int now = 0 ;
vector<int> ans ;
int main()
{
ios ;
int T ;
cin >> T ;
while(T --)
{
cin >> n >> w ;
now = 0 ;
ll sum = 0 ;
cl(ans) ;
rep(i , 1 , n)
{
ll x ;
cin >> x ;
if(x > w) continue ;
a[++ now].val = x ;
a[now].id = i ;
}
sort(a + 1 , a + now + 1) ;
rep(i , 1 , now)
{
if(sum + a[i].val > w) continue ;
sum += a[i].val ;
ans.pb(a[i].id) ;
}
if(sum < (w + 1) / 2) cout << "-1\n" ;
else
{
cout << sz(ans) << '\n' ;
for(auto x : ans) cout << x << ' ' ;
cout << '\n' ;
}
}
return 0 ;
}
D. Catching Cheaters
魔改一下LCS就行了。主要是想清楚贡献。
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 5e3 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
int n , m ;
char s[maxn] , t[maxn] ;
int dp[maxn][maxn] ;
int main()
{
ios ;
cin >> n >> m ;
cin >> (s + 1) ;
cin >> (t + 1) ;
int ans = 0 ;
rep(i , 1 , n) rep(j , 1 , m)
{
if(s[i] == t[j]) dp[i][j] = 2 ;
if(s[i] == t[j]) dp[i][j] = max(dp[i][j] , dp[i - 1][j - 1] + 2) ;
else dp[i][j] = max(dp[i][j] , dp[i - 1][j - 1] - 2) ;
dp[i][j] = max(dp[i][j] , dp[i][j - 1] - 1) ;
dp[i][j] = max(dp[i][j] , dp[i - 1][j] - 1) ;
ans = max(ans , dp[i][j]) ;
}
cout << ans << '\n' ;
return 0 ;
}
E. Xor Tree
有一个性质:假如有若干个数的最高位相同,那么这若干个数连边。
假如现在有一个集合U,通过当前位是0和1,可以分为集合S和T。
假设S和T都非空,那么答案就是max(dfs(S)+1,dfs(T)+1),因为尽量保留其中一个集合时,另一个集合最多保留1个数。dfs()是递归求解的函数。
用01tire的话很好写。
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 2e5 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
struct Trie //01字典树
{
int cnt ;
int num[maxn * 30] ; // 子树上的数的个数
int nxt[maxn * 30][2] ; // nxt[i][0] 表示 0 儿子,nxt[i][1] 表示 1 儿子
int up = 29 ; //范围 [0 , (1 << (up + 1)) - 1]
vector<int> v ;
void init()
{
cnt = 0 ;
memset(num , 0 , sizeof(num)) ;
memset(nxt , 0 , sizeof(nxt)) ;
}
void update(int x , int y)
{
int now = 0 ;
v.clear() ;
for(int i = 0 ; i <= up ; i ++)
v.push_back(x % 2) , x /= 2 ;
for(int i = up ; i >= 0 ; i --)
{
if(nxt[now][v[i]] == 0) nxt[now][v[i]] = ++ cnt ;
now = nxt[now][v[i]] ;
num[now] += y ;
}
}
int dfs(int now)
{
if(nxt[now][0] == 0 && nxt[now][1] == 0) return 1 ;
else if(nxt[now][0] == 0) return dfs(nxt[now][1]) ;
else if(nxt[now][1] == 0) return dfs(nxt[now][0]) ;
else return max(dfs(nxt[now][0]) + 1 , dfs(nxt[now][1]) + 1) ;
}
} trie ;
int n , a[maxn] ;
int main()
{
ios ;
cin >> n ;
rep(i , 1 , n) cin >> a[i] ;
trie.init() ;
rep(i , 1 , n) trie.update(a[i] , 1) ;
cout << n - trie.dfs(0) << '\n' ;
return 0 ;
}
F2. Frequency Problem (Hard Version)
有一个性质是:如果有解,那么整个序列的众数D就是答案区间的众数之一。
按照官方题解根号分治就行了,主要是小于根号的部分不太会实现。感谢这位老哥。
upd:小于根号的部分是尺取。
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define cl(x) x.clear()
#define all(x) x.begin() , x.end()
#define rep(i , x , n) for(int i = x ; i <= n ; i ++)
#define per(i , n , x) for(int i = n ; i >= x ; i --)
#define mem0(x) memset(x , 0 , sizeof(x))
#define mem_1(x) memset(x , -1 , sizeof(x))
#define mem_inf(x) memset(x , 0x3f , sizeof(x))
#define debug(x) cerr << #x << " = " << x << '\n'
#define ddebug(x , y) cerr << #x << " = " << x << " " << #y << " = " << y << '\n'
#define ios std::ios::sync_with_stdio(false) , cin.tie(0)
using namespace std ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int , int> pii ;
typedef pair<ll , ll> pll ;
typedef double db ;
const int mod = 998244353 ;
const int maxn = 2e5 + 10 ;
const int inf = 0x3f3f3f3f ;
const double eps = 1e-6 ;
int n , a[maxn] ;
int num[maxn] ;
int pre[maxn] ;
int lst[maxn << 1] ;
int up = 500 ;
int mx = 0 ;
int c0[maxn] , c[maxn] ;
void add(int x)
{
c0[c[x]] -- ;
c[x] ++ ;
c0[c[x]] ++ ;
mx = max(mx , c[x]) ;
}
void sub(int x)
{
c0[c[x]] -- ;
c[x] -- ;
c0[c[x]] ++ ;
mx -= (c0[mx] == 0) ;
}
int solve1(int D)
{
int res = 0 ;
rep(i , 1 , up)
{
mem0(c) , mem0(c0) ;
mx = 0 ;
int k = 1 , x = 0 ;
rep(j , 1 , n)
{
while(k <= n && x + (a[k] == D) <= i) add(a[k]) , x += (a[k] == D) , k ++ ;
if(c0[mx] >= 2) res = max(res , k - j) ;
sub(a[j]) , x -= (a[j] == D) ;
}
}
return res ;
}
int solve2(int D , int V)
{
int res = 0 ;
int fix = 2e5 ;
mem0(pre) ;
mem_1(lst) ;
rep(i , 1 , n)
{
if(a[i] == D) pre[i] = pre[i - 1] + 1 ;
else if(a[i] == V) pre[i] = pre[i - 1] - 1 ;
else pre[i] = pre[i - 1] ;
}
per(i , n , 1) lst[pre[i] + fix] = i ;
lst[0 + fix] = 0 ;
rep(i , 1 , n) res = max(res , i - lst[pre[i] + fix]) ;
return res ;
}
int main()
{
ios ;
cin >> n ;
rep(i , 1 , n) cin >> a[i] , num[a[i]] ++ ;
int mx = 0 , mx_id = 0 , cnt = 0 ;
rep(i , 1 , n)
{
if(num[i] > mx) mx = num[i] , mx_id = i , cnt = 1 ;
else if(num[i] == mx) cnt ++ ;
}
if(cnt > 1)
{
cout << n << '\n' ;
return 0 ;
}
int D = mx_id ;
int ans = 0 ;
ans = max(ans , solve1(D)) ;
rep(V , 1 , n)
{
if(V == D) continue ;
if(num[V] > up) ans = max(ans , solve2(D , V)) ;
}
cout << ans << '\n' ;
return 0 ;
}