Atcoder Beginner Contest 276题解A-E

 A - Rightmost

传送门

很简单，用一个变量，命名为last，表示‘a’字符最后一次出现的地方，last的初始值为-1

遍历整个字符串，如果这个字符是‘a’，last等于它的下标+1（下标从0开始计算，如果下标从1开始，last就等于它的下标），最后输出last。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define endl "\n"
#define _clear(q) while (!q.empty()){q.pop();}
int yes(int dx){cout << "Yes" << endl;return 0;}
int no(int dx){cout << "No" << endl;return 0;}
string s;
void init(){
    
}
signed main(){
    int n,m,k;
    init();
    cin >> s;
    int last = -1;
    for (int i = 0 ; i < s.size() ; i ++) if (s[i] == 'a') last = i + 1;
    cout << last << endl; 
    return 0;
}

B - Adjacency List

传送门

邻接矩阵存图，vector<int> G[500005]，如果uv之间有一条边，建一条双向边，

最后遍历n个点，设这个点是i，输出G[i].size()表示和他相邻的点的个数，首先排个序，然后j循环0-G[i].size(),输出G[i][j]表示每个节点。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1048586
#define N 500005
#define int long long
#define endl "\n"
#define _clear(q) while (!q.empty()){q.pop();}
int yes(int dx){cout << "Yes" << endl;return 0;}
int no(int dx){cout << "No" << endl;return 0;}
string s;
void init(){
    
}
vector <int> G[N];
signed main(){
    int n,m,k;
    init();
    cin >> n >> m;
    for (int i = 1 ; i <= m ; i ++){
        int u,v;
        cin >> u >> v;
        G[u].push_back(v);
        G[v].push_back(u);
// 建双向边
    }
    for (int i = 1 ; i <= n ;i ++){
        cout << G[i].size() << " ";
        sort(all(G[i]));
        for (int j = 0 ; j < G[i].size() ; j ++) cout << G[i][j] << " ";
        cout << endl; 
    }
    return 0;
}

C - Previous Permutation

传送门

循环遍历n个数，当后面的第一次小于前面的时候，设这个数的下标为i，在（i + 1）到n之间取小于它的最大值，交换，然后从大到小（i+1到n）排序

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1048586
#define M 5005
#define N 500005
#define lowbit(x) ((x)&(-(x)))
#define mod 998244353
#define all(s) s.begin(),s.end()
#define Mn(a,b,c) min(a,min(b,c))
#define Mx(a,b,c) max(a,max(b,c))
#define sq(x) ((x) * (x))
#define cub(x) ((x) * (x) * (x))
#define all(s) s.begin(),s.end()
#define e9 1000000000
#define int long long
#define endl "\n"
#define _clear(q) while (!q.empty()){q.pop();}
int yes(int dx){cout << "Yes" << endl;return 0;}
int no(int dx){cout << "No" << endl;return 0;}
string s;
void init(){
    
}
int a[N],b[N],c[N];
bool cmp(int a,int b){
    return a > b;
}
vector <int> g;
signed main(){
    int n,m,k;
    init();
    cin >> n;
    for (int i = 1 ; i <= n ; i ++) cin >> a[i];
    for (int i = n ; i >= 1 ; i --){
        if (a[i] < a[i - 1]){
            int Min = 0,id;
            for (int j = i; j <= n ; j ++){
                if (a[j] < a[i - 1]){
                    if (Min < a[j]){
                        Min = a[j];
                        id = j;
                    }
                }
            }
            // cout << id << endl;
            swap(a[id] , a[i - 1]);
            for (int j = i ; j <= n ; j ++) g.push_back(a[j]);
            sort(all(g),cmp);
            for (int j = i ; j <= n ; j ++) a[j] = g[j - i];
            for (int j = 1 ; j <= n ; j ++) cout << a[j] << " ";
            return 0;
        }
    }
    return 0;
}

D - Divide by 2 or 3

传送门

题解自行搜，我不过多赘述，只放代码

#include<bits/stdc++.h>
using namespace std;
#define N 500005
#define int long long
#define endl "\n"
string s;
void init(){
	
}
int a[N];
int ex_gcd(int a,int b,int &x,int &y){
	if (!b) {
		x = 1 , y = 0;
		return a;
	}
	else {
		int g = ex_gcd(b , a % b, x , y);
		int t = x;
		x = y;
		y = t - a / b * y;
		return g;
	}
}
signed main(){
	int n,m,k;
	init();
	cin >> n;
	int x,y,g;
	for (int i = 1 ; i <= n; i ++) cin >> a[i];
	g = a[1];
	for (int i = 2 ; i <= n ; i ++) g = ex_gcd(g,a[i],x,y);
	int cnt = 0;
	for (int i = 1 ; i <= n ;i ++){
		a[i] /= g;
		while (a[i] % 2 == 0) a[i] /= 2,cnt ++;
		while (a[i] % 3 == 0) a[i] /= 3,cnt ++;
		if (a[i] != 1){
			cout << -1 << endl; 
			return 0;
		}
	}
	cout << cnt << endl; 
	return 0;
}

E - Round Trip

传送门

首先，我们定义id(x,y,m)表示第i行，第j列的数，m表示每行有多少个数。

check(x,y,n,m)表示x，y是否合法。

跑一遍DFS，记下走过的步数。当回到起点，如果走过的步数大于4，返回true，

否则继续DFS，直到遍历完，返回false。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1048586
#define M 5005
#define N 500005
#define lowbit(x) ((x)&(-(x)))
#define mod 998244353
#define all(s) s.begin(),s.end()
#define Mn(a,b,c) min(a,min(b,c))
#define Mx(a,b,c) max(a,max(b,c))
#define sq(x) ((x) * (x))
#define cub(x) ((x) * (x) * (x))
#define all(s) s.begin(),s.end()
#define e9 1000000000
#define int long long
#define endl "\n"
#define _clear(q) while (!q.empty()){q.pop();}
int yes(int dx){cout << "Yes" << endl;return 0;}
int no(int dx){cout << "No" << endl;return 0;}
char s[10000006];
struct Point{
    int x,y,t;
    Point(){}
    Point(int x,int y,int t):x(x),y(y),t(t){}
};
int id(int x,int y,int m){
    return x * m + y;
}
int n,m;
void init(){
    
}
int vis[10000006];
int dis[10000006];
queue <Point> q;
int l = 0;
int s1,s2;
int dx[] = {0,1,0,-1,0};
int dy[] = {0,0,1,0,-1};
bool check(int x,int y,int n,int m) {return x >= 0 && x < n && y >= 0 && y < m && s[id(x,y,m)] != '#' && vis[id(x,y,m)] != 1;}
bool DFS(int x,int y,int n,int m,int t){
    // cout << x << " " << y << endl;
    for (int i = 1 ; i <= 4 ; i ++){
        int tx = x + dx[i];
        int ty = y + dy[i];
        if (tx == s1 && ty == s2 && t >= 4) return true;
        if (check(tx,ty,n,m)) {
            vis[id(tx,ty,m)] = 1;
            if (DFS(tx,ty,n,m,t + 1)) return true;
        }
    }
    return false;
}
signed main(){
    int n,m,k;
    init();
    cin >> n >> m;
    for (int i = 0 ; i < n ; i ++){
        for (int j = 0 ; j < m ; j ++){
            cin >> s[id(i,j,m)];
            if (s[id(i,j,m)] == 'S') s1 = i,s2 = j;
        }
    }
    vis[id(s1,s2,m)] = 1;
    // cout << s1 << ' ' << s2 << endl; 
    cout << (DFS(s1,s2,n,m,1) ? "Yes":"No") << endl; 
    return 0;
}