2018多校3

最新推荐文章于 2022-08-01 11:23:28 发布

原创最新推荐文章于 2022-08-01 11:23:28 发布 · 187 阅读

0 ·

CC 4.0 BY-SA版权

本文解析了三道C++编程竞赛题目，包括滑动窗口最值问题、数学规律求解及图论中的DFS遍历技巧。通过示例代码详细阐述了解题思路与算法实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define endl '\n'
const double pi = acos(-1);
const int maxn = 1e7 + 10;
const int maxm = 1200;
const ll mod = 1e7 + 7;
int n,m,k,p,q,r,mo,tt;
int a[maxn];
ll ans, anss;
int deq[maxn], cnt[maxn];
int main(){
    scanf("%d", &tt);
    while(tt--){
        ans= 0, anss=0;
        scanf("%d%d%d%d%d%d%d",&n,&m,&k,&p,&q,&r,&mo);
        for(int i = 1 ; i <= k ; ++ i){
            scanf("%d", &a[i]);
        }
        for(int i = k+1 ; i <= n ; ++ i){
            a[i] = ((1LL*p*a[i-1])+(1LL*q*i)+r) % mo;
        }
        int head=1,tail=0;
        for(int i = n ; i >= 1 ; -- i){
            while(head <= tail && a[deq[tail]] <= a[i])
                tail--;
            deq[++tail] = i;
            while(deq[head] - i >= m) head ++;
            if(i <= n - m + 1){
                ans += (ll)(a[deq[head]]^i);
                anss +=  (ll)((tail-head+1)^i);
            }
        }
        cout << ans << ' ' << anss <<  endl;
    }
    return 0;
}

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define endl '\n'
const double pi = acos(-1);
const int maxn = 5000;
const int maxm = 1200;
const ll mod = 1e9 + 7;
int n, t;
int main(){
    scanf("%d", &t);
    while(t--){
        scanf("%d", &n);
        if(n == 1) cout << "5" << endl;
        else if(n == 2) cout << "7" << endl;
        else cout << n + 5 << endl;
    }
    return 0;
}

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define endl '\n'
const double pi = acos(-1);
const int maxn = 1e5 + 10;
const int maxm = 1200;
const ll mod = 1e9 + 7;
int n, t,u, v;
int a[maxn], vis[maxn];
ll xo, xxo;
vector<int> g[maxn];
void dfs(int u, int dep){
    if(dep & 1) xxo ^= a[u];
    for(int i = 0 ; i < g[u].size() ; ++ i){
        int v = g[u][i];
        if(!vis[v]){
            vis[v] = 1;
            dfs(v, dep + 1);
        }
    }
}
int main(){
    scanf("%d", &t);
    while(t--){
        scanf("%d", &n);
        memset(vis, 0, sizeof(vis));
        for(int i = 1 ; i <= n ; ++ i) g[i].clear();
        xo = xxo = 0;
        for(int i = 1 ; i <= n ; ++ i){
            scanf("%d", &a[i]);
            xo ^= a[i];
        }
        for(int i = 1 ; i < n ; ++ i){
            scanf("%d %d", &u, &v);
            g[u].push_back(v);
            g[v].push_back(u);
        }
        vis[1] = 1;
        dfs(1, 1);
        //cout << xxo << ' ' << xo << endl;
        if(xxo == (xo^xxo)){
            cout << "D" << endl;
        }
        else{
            cout << "Q" << endl;
        }
    }
    return 0;
}

#include<bits/stdc++.h>

using namespace std;

#define maxn 1005
#define ll long long

int a,b,c,n,m;
char mp[maxn][maxn];

int main(){
    int t;cin>>t;
    while(t--) {
        scanf("%d %d %d",&a,&b,&c);
        n=2*c+1+2*b;
        m=2*a+1+2*b;
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++)
                mp[i][j]='.';
        for(int i=1;i<=2*b;i+=2){
            for(int j=2*b-i+2;j<=2*b-i+2+2*a;j++) {
                if(j%2==1) mp[i][j]='+';
                else mp[i][j]='-';
            }
            for(int j=2*b-i+2+2*a+2;j<=m;j++)
                if(j%2==1)mp[i][j]='+';
        }
        for(int i=2;i<=2*b;i+=2) {
            for(int j=2*b-i+2;j<=m;j++)
                if(j%2==0)mp[i][j]='/';
            for(int j=m;j>=m-i+2;j-=2)
                mp[i][j] = '|';
        }
        for(int i=2*b+2;i<=n;i+=2){
            for(int j=1;j<=m;j+=2)mp[i][j]='|';
            for(int j=2*a+2;j<=m;j+=2)mp[i][j]='/';
        }
        for(int i=2*b+1;i<=2*c+1;i+=2) {
            for(int j=1;j<=2*a+1;j++){
                if(j%2==1)mp[i][j]='+';
                else mp[i][j]='-';
            }
            for(int j=2*a+2;j<=m;j++)if(j%2==1)mp[i][j]='+';
        }
        for(int i=n;i>2*c+1;i-=2){
            for(int j=1;j<=2*a+1;j++){
                if(j%2==1)mp[i][j]='+';
                else mp[i][j]='-';
            }
            for(int j=2*a+2;j<=m;j++)if(j%2==1)mp[i][j]='+';
        }
        int y=0;
        for(int i=1;i<2*b+1;i++)
            for(int j=1;j<=2*b+1-i;j++)
                mp[i][j]='.';
        for(int i=n;i>2*c+1;i--){
            for(int j=2*a+2+y;j<=m;j++)
                mp[i][j]='.';
            y++;
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++)
                printf("%c",mp[i][j]);
            printf("\n");
        }
    }
    return 0;
}