A
标记遍历。
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 2e5 + 10;
const int mod = 10007;
int a[N];
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
int n; cin>>n;
map<int,int> mp;
for(int i=1;i<=n;i++) cin>>a[i],mp[a[i]] ++;
for(int i=1;i<=n;i++) if(mp[a[i]] == 1) cout<<i<<endl;
}
return 0;
}
B
维护上下左右的值。 特殊处理上下相同,左右相同的情况
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 2e5 + 10;
const int mod = 10007;
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
int n; cin>>n;
int l = 1e9,r = -1e9,u = 1e9,d = -1e9;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
char p; cin>>p;
if(p == '*'){
l = min(l,j);
r = max(r,j);
u = min(u,i);
d = max(d,i);
}
}
if(l == r){
if(l == 1) r = r + 1;
else if(l == n) l = l - 1;
else l = r - 1;
}
if(u == d){
if(u == 1) d = d + 1;
else if(u == n) u = u - 1;
else d = u + 1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i == u && j == l) cout<<'*';
else if(i == u && j == r) cout<<'*';
else if(i == d && j == l) cout<<'*';
else if(i == d && j == r) cout<<'*';
else cout<<'.';
}
cout<<endl;
}
}
return 0;
}
C
双指针,第一遍先处理好一个确定,但另一个不确定的情况。第二遍剩下的都是问号对,如果1的个数,或者0的个数大于1,则这两个补上,注意长度奇数时的处理
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 2e5 + 10;
const int mod = 10007;
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
int a,b; cin>>b>>a;
string s; cin>>s;
int len = (int)s.size();
if(a + b != len){
cout<<-1<<endl;
continue;
}
for(int i=0,j=len-1;i<=j;i++,j--){
if(i == j){
if(s[i] == s[j]){
if(s[i] == '1') a --;
else if(s[i] == '0') b --;
}
break;
}
if((s[i] == '?' && s[j] != '?') || (s[i] != '?' && s[j] == '?')){
if(s[i] == '?'){
if(s[j] == '1') a-=2,s[i] = '1';
else b-=2,s[i] = '0';
}else{
if(s[i] == '1') a-=2,s[j] = '1';
else b-=2,s[j] = '0';
}
}else{
if(s[i] == s[j]){
if(s[i] == '1') a -= 2;
else if(s[i] == '0') b -= 2;
}
}
}
for(int i=0,j=len-1;i<=j;i++,j--){
if(s[i] != '?' || s[j] != '?') continue;
if(i == j){
if(a == 1) s[i] = '1',a --;
else s[i] = '0',b --;
}else{
if(a >= 2){
s[i] = s[j] = '1';
a -= 2;
}else if(b >= 2){
s[i] = s[j] = '0';
b -= 2;
}
}
}
if(a == 0 && b == 0) cout<<s<<endl;
else cout<<-1<<endl;
}
return 0;
}
D
排序后
两种情况,1 ~ n+1中去掉一个构成a[n+2]的值。去掉n+2,1 ~ n构成a[n+1]的值。不行则为-1 (代码难看了点)
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 2e5 + 10;
const int mod = 10007;
int a[N];
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
int n,sum = 0; cin>>n;
for(int i=1;i<=n+2;i++) cin>>a[i],sum += a[i];
sort(a+1,a+n+3);
sum -= (a[n+1] + a[n+2]);
if(sum == a[n+1]){
for(int i=1;i<=n;i++) cout<<a[i]<<" ";
cout<<endl;
}else if(sum == a[n+2]){
for(int i=1;i<=n;i++) cout<<a[i]<<" ";
cout<<endl;
}else{
bool plas = false;
for(int i=1;i<=n;i++){
if(sum - a[i] + a[n+1] == a[n+2]){
plas = true;
for(int j=1;j<=n+1;j++)
if(j != i) cout<<a[j]<<" ";
cout<<endl;
break;
}
}
if(!plas) cout<<-1<<endl;
}
}
return 0;
}
E
只会暴力,维护一段长度为(r - l + 1)的连续区间,找到sum(l , r) >= s 的第一个点。
等于直接就为这个区间,否则去寻找这个区间中的一个数是否可以替换为更小的数去缩减差值。
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 1e3 + 10;
const int mod = 10007;
int ans[N];
bool vis[N];
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
memset(vis,0,sizeof(vis));
memset(ans,0,sizeof(ans));
int n,l,r,s; cin>>n>>l>>r>>s;
int len = r - l + 1,a = 0,b = 0,sum = 0;
bool plas = false;
for(int i=1;i<=n;i++){
a = i,b = i + len - 1;
if(b > n) break;
sum = (a + b) * len / 2;
if(sum >= s) break;
}
int k = sum - s;
if(k < 0){
cout<<-1<<endl;
continue;
}
if(k == 0) for(int i=l;i<=r;i++,a++) ans[i] = a,vis[a] = true;
else{
for(int i=a;i<=b;i++){
int p = i - k;
if(p >= 1 && p < a){
plas = true;
ans[l] = p;
vis[p] = true;
for(int j=l+1;j<=r;j++,a++){
if(a == i) a ++;
ans[j] = a,vis[a] = true;
}
break;
}
}
}
if(!plas && k != 0) cout<<-1<<endl;
else{
for(int i=1,j=1;i<=n;i++){
if(ans[i]) continue;
while(vis[j]) j ++;
ans[i] = j;
vis[j] = true;
}
for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
cout<<endl;
}
}
return 0;
}
F
直接贪心,这个人要么一直在这个位置,要么够前进的时候立即花费1前进。再每个位置时,记录一下就以当前位置一直呆下去所花费的时间,取最小值就行。
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 2e5 + 10;
const int mod = 10007;
int a[N],b[N];
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
int tt; cin>>tt;
while(tt --){
int n,c; cin>>n>>c;
int ans = 1e18,res = 0,sum = 0;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=2;i<=n;i++) cin>>b[i];
for(int i=1;i<=n;i++){
int d1 = (c - sum - 1) / a[i] + 1;
ans = min(ans,d1+res);
if(i == n) break;
int d2 = 0;
if(b[i+1] > sum){
d2 = (b[i+1] - sum - 1) / a[i] + 1;
sum += d2*a[i];
sum -= b[i+1];
}else{
d2 = 0;
sum -= b[i+1];
}
res += d2 + 1;
}
cout<<ans<<endl;
}
return 0;
}
G
埃斯筛或者欧拉筛求n之前各个数的约数之和。
埃斯筛
对于埃斯筛,没什么好解释,就是套一下板子,把每一个数的约数都加进去就行了。
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
//#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 1e7 + 10;
const int mod = 10007;
int vis[N];
int book[N];
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
for(int i=1;i<=1e7;i++)
for(int j=i;j<=1e7;j+=i)
vis[j] += i;
for(int i=1;i<=1e7;i++){
if(vis[i] > 1e7) continue;
if(!book[vis[i]]) book[vis[i]] = i;
}
int tt; cin>>tt;
while(tt --){
int n; cin>>n;
if(book[n] != 0) cout<<book[n]<<endl;
else cout<<-1<<endl;
}
return 0;
}
欧拉筛
首先有约数之和的公式(1+p1 + p2 + … + pw)* (1 + …) 好难写。
假设当前已经求出来了为s(i),那么当得到一个质数 p 时。
如果 i 和 p 互质,那么 s(i * primes(j)) = s(i )* (primes(j)+ 1).
否则就会在第一个表达式里面,多加一个p(w+1) .
之后会维护一个最小质因数的等比数列,然后就可以先用s(i)/ psum(i)* psum(i*primes(j))。
具体可以参考一下 博客
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include<bits/stdc++.h>
//#define int long long
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const double eps = 1e-5;
const int N = 1e7 + 10;
const int mod = 10007;
int primes[N],cnt;
int s[N],psum[N],ans[N];
bool vis[N];
void ols(int n){
s[1] = psum[1] = 1;
for(int i=2;i<=n;i++){
if(!vis[i]) primes[cnt++] = i,s[i] = i+1,psum[i] = i+1;
for(int j=0;j<cnt&&i*primes[j]<=n;j++){
vis[i*primes[j]] = true;
if(i % primes[j] == 0){
psum[i*primes[j]] = psum[i] * primes[j] + 1;
s[i*primes[j]] = s[i]/psum[i] * psum[i*primes[j]];
break;
}
psum[i*primes[j]] = primes[j] + 1;
s[i*primes[j]] = s[i] * (primes[j] + 1);
}
}
memset(ans,-1,sizeof(ans));
for(int i=1;i<=n;i++)
if(s[i] <= n && ans[s[i]] == -1) ans[s[i]] = i;
}
signed main(){
IOS
#ifdef ddgo
freopen("C:\\Users\\asus\\Desktop\\ddgoin.txt","r",stdin);
#endif
ols(1e7);
int tt; cin>>tt;
while(tt --){
int n; cin>>n;
cout<<ans[n]<<endl;
}
return 0;
}