Codeforces 938 正方形方格最多0/1 足球赛dijkstra建图

A

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-8;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 3e7 + ;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
ll mod = 1e9 + ;
string ans;
int n;
string a;
int flag;
bool ok(char x)
{
        if (x == 'a' || x == 'e' || x == 'i' || x == 'o' || x == 'u' || x == 'y')
        {
                return true;
        }
        return false;
}
int main()
{
        cin >> n >> a;
        flag = ;
        for (int i = ; i < n; i++)
        {
                if (flag)
                {
                        if (ok(a[i]))
                        {
                                continue;
                        }
                        else
                        {
                                ans += a[i];
                                flag = ;
                        }
                }
                else
                {
                        if (ok(a[i]))
                        {
                                flag = ;
                                ans += a[i];
                        }
                        else
                        {
                                ans += a[i];
                                flag = ;
                        }
                }
        }
        cout << ans << endl;
        return ;
}

B

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-8;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 3e7 + ;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
ll mod = 1e9 + ;
int number[];
int anser = ;
int main()
{
        int n;
        cin >> n;
        for (int i = ; i <= n; i++)
        {
                int cur;
                cin >> cur;
                number[cur] = ;
        }
        for (int i = ; i <= ; i++)
        {
                if (number[i])
                {
                        anser = max(anser, i - );
                }
        }
        for (int i = ; i >= ; i--)
        {
                if (number[i])
                {
                        anser = max(anser,  - i);
                }
        }
        cout << anser << endl;
        return ;
}

C

N*N的方格里 每个方格可以填0或者1 要求每个M*M的小方格里面必须要有一个0

题目给你一个数 问你有没有一对 N,M使之成立

总共有N^2个方格 因为每个M*M的小方格里面需要有一个0 所以每行和每列最少都需要N/M个0 总共就是（N/M）*（N/M）个0

所以答案就是N^2-（N/M）^2个 利用立方差公式可以分解为 (N+(N/M)*(N-(N/M)=ANS 也就是分解质因数 复杂度T*SQRT X

每次遇到一个N M都要检测是否符合条件

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
int main()
{
        int n;
        cin >> n;
        while (n--)
        {
                int flag = ;
                int x;
                cin >> x;
                if (x == )
                {
                        cout <<  << " " <<  << endl;
                        continue;
                }
                for (int i = ; i <= ((int)sqrt(x) + ) && (!flag); i++)
                {
                        if (x % i == )
                        {
                                int chu;
                                int beichu;
                                int a;
                                a = x / i;
                                chu = abs(i - a) / ;
                                if (chu == )
                                {
                                        continue;
                                }
                                beichu = min(i, a) + chu;
                                int m;
                                m = beichu / chu;
                                if (beichu * beichu - (beichu / m) * (beichu / m) == x)
                                {
                                        cout << beichu << " " << m << endl;
                                        flag = ;
                                }
                                //break;
                        }
                }
                if (!flag)
                {
                        cout << - << endl;
                }
        }
}

D

给你N个点 每个点可以都办足球比赛 票价为Ai 同时有M条路（不保证图联通）每条路有COST

问你在城市i的球迷想看球需要的最少的钱（往返加球票钱）

用floyd肯定不行 需要建一个超级源点 然后上堆优化的迪杰斯特拉跑一边 超级源点与原来每个点之间连的边的COST为其票价

#include <bits/stdc++.h>
#define PI acos(-1.0)
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define pb push_back
#define inf 1e9
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que; get min
const double eps = 1.0e-10;
const double EPS = 1.0e-4;
typedef pair<int, int> pairint;
typedef long long ll;
typedef unsigned long long ull;
//const int maxn = 3e5 + 10;
const int  maxm = ;
const int turn[][] = {{, }, { -, }, {, }, {, -}};
//priority_queue<int, vector<int>, less<int>> que;
//next_permutation
int n, m;
priority_queue<pair<ll, int> > que;
vector<pair<int, ll> > gra[];
ll sdis[];
int visit[];
int main()
{
        for (int i = ; i <= ; i++)
        {
                sdis[i] = 1e18;
        }
        cin >> n >> m;
        int from, to;
        ll cost;
        for (int i = ; i <= m; i++)
        {
                scanf("%d %d %lld", &from, &to, &cost);
                cost *= 2LL;
                gra[from].pb(make_pair(to, cost));
                gra[to].pb(make_pair(from, cost));
        }
        for (int i = ; i <= n; i++)
        {
                scanf("%lld", &cost);
                gra[].pb(make_pair(i, cost));
        }
        que.push({, });
        while (!que.empty())
        {
                int now = que.top().second;
                que.pop();
                if (visit[now])
                {
                        continue;
                }
                visit[now] = ;
                int len = gra[now].size();
                for (int i = ; i < len; i++)
                {
                        to = gra[now][i].first;
                        ll value = gra[now][i].second;
                        if (!visit[to] && sdis[to] > sdis[now] + value)
                        {
                                sdis[to] = sdis[now] + value;
                                que.push({ -sdis[to], to});
                        }
                }
        }
        for (int i = ; i <= n; i++)
        {
                cout << sdis[i] << " ";
        }
        cout << endl;
}