AtCoder Beginner Contest 183 | 全题解

最新推荐文章于 2023-01-16 15:28:18 发布

一只酷酷光儿( CoolGuang)

最新推荐文章于 2023-01-16 15:28:18 发布

阅读量373

点赞数 3

本文链接：https://blog.csdn.net/qq_43857314/article/details/109719242

版权

又一次没AK abc 真的菜..

A - ReLU

水题判断是否大于等于0?

B - Billiards

找镜像对称的点

相似三角形判断即可

C - Travel

找出有多少条从1开始的路径不重复经过点回到1 并且花费为m?

dfs的水题

Code:

/*** keep hungry and calm CoolGuang!***/
/*#pragma GCC optimize(2)
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")*/
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define d(x) printf("%lld\n",x);
typedef long long ll;
using namespace std;
const ll INF= 1e17;
const ll maxn = 1e6+700;
const ll mod= 1e9+7;
inline bool read(ll &num)
{char in;bool IsN=false;
    in=getchar();if(in==EOF) return false;while(in!='-'&&(in<'0'||in>'9')) in=getchar();if(in=='-'){ IsN=true;num=0;}else num=in-'0';while(in=getchar(),in>='0'&&in<='9'){num*=10,num+=in-'0';}if(IsN) num=-num;return true;}
ll n,m,p;
ll mp[105][105];
int vis[105];
ll ans = 0;
void dfs(int s,int t,ll w,int u){
    if(u == n+1){
        if(t == s && w == m) ans++;
        return ;
    }
    for(int i=1;i<=n;i++){
        if(mp[t][i]&&!vis[i]){
            vis[i] = 1;
            dfs(s,i,w+mp[t][i],u+1);
            vis[i] = 0;
        }
    }
}
int main(){
    read(n);read(m);
    for(int i=1;i<=n;i++){
        for(int k=1;k<=n;k++){
            read(mp[i][k]);
        }
    }
    dfs(1,1,0,1);
    d(ans);
    return 0;
}
/**
by/ay = x/y
**/

D - Water Heater

题目大概是要确保每分钟都能满足所有人的条件

差分就vans了

注意一下区间是左开右闭

Code:

/*** keep hungry and calm CoolGuang!***/
/*#pragma GCC optimize(2)
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")*/
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define d(x) printf("%lld\n",x);
typedef long long ll;
using namespace std;
const ll INF= 1e17;
const ll maxn = 1e6+700;
const ll mod= 1e9+7;
inline bool read(ll &num)
{char in;bool IsN=false;
    in=getchar();if(in==EOF) return false;while(in!='-'&&(in<'0'||in>'9')) in=getchar();if(in=='-'){ IsN=true;num=0;}else num=in-'0';while(in=getchar(),in>='0'&&in<='9'){num*=10,num+=in-'0';}if(IsN) num=-num;return true;}
ll n,m,p;
ll f[maxn];
struct node{
    int pos;
    ll w;
    bool friend operator<(node a,node b){
        return a.pos < b.pos;
    }
}q[maxn];
int main(){
    read(n);read(m);
    for(int i=1;i<=n;i++){
        ll x,y,z;read(x);read(y);read(z);
        q[i] = node{x+1,z};
        q[n+i] = node{y+1,-z};
    }
    sort(q+1,q+1+2*n);
    ll maxl = 0,ans = 0;
    for(int i=1;i<=2*n;i++){
        int k = i;
        while(q[k].pos == q[i].pos && k<=2*n){
            ans += q[k].w;
            k++;
        }
        i = k-1;
        maxl = max(maxl,ans);
    }

    if(maxl<=m) printf("Yes\n");
    else printf("No\n");
    return 0;
}
/**
by/ay = x/y
**/

E - Queen on Grid

一个简单的计数dp

大概是这个点可以由左上角左边或者上面过来，有'#'阻挡就不可以通过

问从(1,1) 到 (n,m)的方案数？

维护一个前缀和加速状态转移就好了

Code:

/*** keep hungry and calm CoolGuang!***/
/*#pragma GCC optimize(2)
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")*/
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define d(x) printf("%lld\n",x);
typedef long long ll;
using namespace std;
const ll INF= 1e17;
const ll maxn = 1e6+700;
const ll mod= 1e9+7;
inline bool read(ll &num)
{char in;bool IsN=false;
    in=getchar();if(in==EOF) return false;while(in!='-'&&(in<'0'||in>'9')) in=getchar();if(in=='-'){ IsN=true;num=0;}else num=in-'0';while(in=getchar(),in>='0'&&in<='9'){num*=10,num+=in-'0';}if(IsN) num=-num;return true;}
ll n,m,p;

ll dp[2005][2005];///0/1 是否以(i,k)结束
ll sum[2005][2005];
char mp[2005][2005];
ll lef[2005][2005];
ll up[2005][2005];
ll xie[2005][2005];
int main(){
    read(n);read(m);
    for(int i=1;i<=n;i++) scanf("%s",mp[i]+1);
    dp[1][1] = 1;
    for(int i=1;i<=n;i++){
        for(int k=1;k<=m;k++){
            if(i == 1&&k == 1){
                lef[i][k] = (lef[i][k-1] + dp[i][k])%mod;
                up[i][k] = (up[i-1][k]+dp[i][k])%mod;
                xie[i][k] = (xie[i-1][k-1]+dp[i][k])%mod;
                continue;
            }
            if(mp[i][k] == '#') lef[i][k] = up[i][k] = xie[i][k] = 0;
            else{
                dp[i][k] = (lef[i][k-1]+up[i-1][k] + xie[i-1][k-1])%mod;
                lef[i][k] = (lef[i][k-1] + dp[i][k])%mod;
                up[i][k] = (up[i-1][k]+dp[i][k])%mod;
                xie[i][k] = (xie[i-1][k-1]+dp[i][k])%mod;
            }
        }
    }
    printf("%lld\n",dp[n][m]);
    return 0;
}
/**
**/