10.6模拟赛

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,ans;
int main()
{
    freopen("star.in","r",stdin);
    freopen("star.out","w",stdout);
    scanf("%lld",&n);
    if(n<=7) ans=1ll*5*(n+2);
    else ans=1ll*10*(n-3);
    printf("%lld\n",ans);
    return 0;
}

#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,dp[11];
int main()
{
    freopen("alice.in","r",stdin);
    freopen("alice.out","w",stdout);
    scanf("%lld",&n);
    dp[6]=n/100,n%=100;
    while(n>=50) n-=50,++dp[5];
    while(n>=20) n-=20,++dp[4];
    while(n>=10) n-=10,++dp[3];
    while(n>=5) n-=5,++dp[2];
    while(n>=1) n-=1,++dp[1];
    for(ll i=1;i<=6;++i) printf("%lld ",dp[i]); puts("");
    return 0;
}

 

#include <bits/stdc++.h>
#define ll long long
const ll N=4e4+11,L=23,mod=1e9+7;
ll T,n,m,dp[L][L],ans;
char a[N],b[N];
int main()
{
    freopen("marisa.in", "r", stdin);
    freopen("marisa.out", "w", stdout);
    scanf("%lld%s%s",&T,a+1,b+1);
    n=strlen(a+1),m=strlen(b+1),dp[0][0]=1;
    for(ll i=1;i<=T;++i) {
        for(ll j=n;j>=0;--j) for(ll k=m;k>=0;--k) {
            ll t=24; t+=(j==n)+(k==m);
            if(j<n && k<m && a[j+1]==b[k+1]) ++t;
            (dp[j][k]*=t)%=mod;
            if(k && a[j+1]!=b[k]) (dp[j][k]+=dp[j][k-1])%=mod;
            if(j && a[j]!=b[k+1]) (dp[j][k]+=dp[j-1][k])%=mod;
            if(j && k && a[j]==b[k]) (dp[j][k]+=dp[j-1][k-1])%=mod;
        }
        for(ll k=0;k<m;++k) (ans+=dp[n][k])%=mod;
    }
    printf("%lld\n", ans);
    return 0;
}

#pragma GCC optimize(2)

#define FASTER
#ifdef FASTER
#pragma GCC diagnostic error "-std=c++11"
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#endif

#include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
using namespace std;
inline ll re_ad() {
    char ch=getchar(); ll x=0,f=1;
    while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
    while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}

const ll N=2e5+11,inf=9e18;
ll n,k;
struct Node { ll x,y; }a[N];
inline ll Dist(Node A,Node B) { ll t=(A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y); return t>0?t:inf; }
inline bool cmp(Node A,Node B) { return Dist(A,a[n+1])>Dist(B,a[n+1]); }
priority_queue<pll>dg,xg;

int main()
{
    freopen("flower.in","r",stdin);
    freopen("flower.out","w",stdout);
    n=re_ad(),k=re_ad();
    a[n+1].x=re_ad(),a[n+1].y=re_ad(),a[n+2].x=re_ad(),a[n+2].y=re_ad();
    for(ll i=1;i<=n;++i) a[i].x=re_ad(),a[i].y=re_ad();
    sort(a+1,a+n+1,cmp);
    ll ans=inf,t=Dist(a[n+1],a[1]);
    if(t>0) ans=min(ans,t);
    for(ll i=1;i<=n;++i) {
        ll r1=0; if(i<n) r1=Dist(a[n+1],a[i+1]);
        xg.push(make_pair(-Dist(a[n+2],a[i]),i));
        if(xg.size()>k) {
            ll u=xg.top().first,v=xg.top().second;
            xg.pop(),dg.push(make_pair(-u,v));
        }
        ll r2=0; if(!dg.empty()) r2=dg.top().first;
        ll t=r1+r2;
        if(t>0) ans=min(ans,r1+r2);
//        printf("%llu %llu\n",r1,r2);
    }
    printf("%lld\n",ans);
    return 0;
}