牛客小白月赛44

深渊水妖

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
int n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;
int tr[MAX];

void work(){
    cin >> n;
    for(int i = 1; i <= n; ++i)cin >> tr[i];
    int l = 1, r = 1;
    vector<pii>v;
    int maxn = 0;
    for(int i = 2; i <= n; ++i){
        if(tr[i] >= tr[i - 1]){
            r = i;
        }
        else{
            v.push_back(m_p(l, r));
            l = r = i;
        }
        maxn = max(maxn, tr[r] - tr[l]);
    }
    v.push_back(m_p(l, r));
    for(auto [l, r] : v){
        if(tr[r] - tr[l] == maxn)cout << l << ' ' << r << ' ';
    }
    cout << endl;
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){
    //printf("Case #%d: ", _t);
    work();
    }
    return 0;
}

顽皮恶魔

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
int n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;
char tr[1005][1005];

int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};

bool judge(int x, int y){
    if(x > n || x < 1 || y > m || y < 1)return false;
    else if(tr[x][y] == 'Z')return false;
    else if(tr[x][y] == 'P')return false;
    return true;
}

void work(){
    cin >> n >> m;
    for(int i = 1; i <=n; ++i){
        for(int j = 1; j <= m; ++j){
            cin >> tr[i][j];
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j){
            if(tr[i][j] == 'P'){
                bool p = 0;
                for(int k = 0; k < 8; ++k){
                    if(judge(i + dx[k], j + dy[k])){
                        p = 1;
                        break;
                    }
                }
                if(!p)++ans;
            }
        }
    }
    cout << ans << endl;
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){
    //printf("Case #%d: ", _t);
    		work();
    }
    return 0;
}

绝命沙虫

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define eps 1e-6
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
double n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;

void work(){
    double p;
    cin >> a >> p;
    ll ans = 0;
    while (a) {
        ans += ll((min(10000.0, a * 100.0 * (p - 1)) + eps) / 10) + 1ll * (10 * a);
        a = ll(a / 2);
    }
    cout << ans << endl;
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){
    work();
    }
    return 0;
}

丛林木马

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
int n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;
int tr[MAX];

void work(){
    cin >> s >> t;
    a = s.size();
    b = t.size();
    ll aa = 0;
    for(int i = 0; i < a; ++i){
        aa *= 10;
        aa += s[i] - '0';
        aa %= mod;
    }
    ll bb = 0;
    for(int i = 0; i < b; ++i){
        bb *= 10;
        bb += t[i] - '0';
        bb %= mod;
    }
    ll ans = ((a * bb) % mod + (b * aa) % mod) % mod;
    cout << ans << endl;
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){
        printf("Case #%d: ", _t);
        work();
    }
    return 0;
}

变异蛮牛

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
int n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;
vector<int>tr[MAX];
ll num = 0;
void dfs(int u, int fa, int h){
    if(h % 2)++num;
    for(auto v : tr[u]){
        if(fa == v)continue;
        dfs(v, u, h + 1);
    }
    return;
}


void work(){
    cin >> n;
    num = 0;
    for(int i = 1; i <= n; ++i)tr[i].clear();
    for(int i = 1; i <= n - 1; ++i){
        cin >> x >> y;
        tr[x].push_back(y);
        tr[y].push_back(x);
    }
    dfs(1, -1, 1);
    cout << num + num * (num - 1) / 2 << endl;
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){
    //printf("Case #%d: ", _t);
    work();
    }
    return 0;
}

幽暗统领

题目描述：

思路：

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define inf 0x3f3f3f3f
#define mod 998244353
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d %d",&n,&m)
#define m_p(a,b) make_pair(a, b)
#define mem(a,b) memset((a),(b),sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef pair <int,int> pii;

#define MAX 300000 + 50
int n, m, k, op;
int x, y, z;
ll a, b, c;
string s, t;
ll tr[MAX];

void work(){
    cin >> n;
    for(int i = 1; i <= n; ++i)cin >> tr[i];
    ll maxn = 0;
    ll sum = 0;
    for(int i = 1; i <= n; ++i){
        maxn = max(tr[i], maxn);
        sum += tr[i];
    }
    ll yu = sum - maxn;
    if(yu >= maxn)cout << sum << endl;
    else{
        ll l = (sum + 1) / 2 - yu;
        ll r = maxn - l + 1;
        cout << r - l + 1 << endl;
    }
}


int main(){
    io;
    int tt;cin>>tt;
    for(int _t = 1; _t <= tt; ++_t){

        work();
    }
    return 0;
}