小鸡腿U T8 CERC2015

最新推荐文章于 2021-05-18 12:33:16 发布

nike0good

最新推荐文章于 2021-05-18 12:33:16 发布

阅读量843

点赞数

分类专栏：比赛题解

本文链接：https://blog.csdn.net/nike0good/article/details/52294685

版权

比赛题解专栏收录该内容

113 篇文章 0 订阅

订阅专栏

ASCII Addition
Book Borders
Digit Division
Hovering Hornet
Kernel Knights

ASCII Addition

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
char s[7][1000]={
"xxxxx ....x xxxxx xxxxx x...x xxxxx xxxxx xxxxx xxxxx xxxxx .....",
"x...x ....x ....x ....x x...x x.... x.... ....x x...x x...x ..x..",
"x...x ....x ....x ....x x...x x.... x.... ....x x...x x...x ..x..",
"x...x ....x xxxxx xxxxx xxxxx xxxxx xxxxx ....x xxxxx xxxxx xxxxx",
"x...x ....x x.... ....x ....x ....x x...x ....x x...x ....x ..x..",
"x...x ....x x.... ....x ....x ....x x...x ....x x...x ....x ..x..",
"xxxxx ....x xxxxx xxxxx ....x xxxxx xxxxx ....x xxxxx xxxxx ....."};
char a[7][1000];
bool cmp(int i,int k) {
    Rep(m,5) Rep(n,7) {
        if (s[n][i+m]!=a[n][k+m]) return 0;
    }
    return 1;
}
int calc(int x) {
    for(int i=0,p=0;;i+=6,p++) if (cmp(i,x)) return p;
}
char b[7][1000];    
ll paint(ll x) {
    int num[1000],siz=0;
    while(x) num[siz++]=x%10,x/=10;
    MEM(b)
    for(int i=siz-1,p=0;i>=0;i--,p+=6) {
        Rep(j,7) memcpy(b[j]+p,s[j]+num[i]*6,6*sizeof(char));
    }
    int len=strlen(b[0]);
    Rep(i,len) Rep(j,7) if (b[j][i]==' ') b[j][i]='.';
    Rep(j,7) b[j][len-1]=0;
    Rep(i,7) printf("%s\n",b[i]);   
}
ll work(int *num,int m) {
    ll p[2]={0};
    int j=0;
    Rep(i,m) {
        if (num[i]<10) p[j]=p[j]*10+num[i];
        else j++;
    }
    paint(p[0]+p[1]);
    return p[0]+p[1];   
}
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);
    while(1) {
        Rep(i,7) {
            if (scanf("%s",a[i])==EOF) return 0;
        }
        int m=0,len=strlen(a[0]);
        int num[100];
        for(int i=0;i<len;i+=6,m++) {
            num[m]=calc(i);
        }
        work(num,m);

    }


    return 0;
}

Book Borders

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip> 
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (500000+10)
int n;
char s[MAXN];
int pre[MAXN],len[MAXN];
int calc(int m) {
    int t=0;
    for(int i=0;i<n;) {
        t+=len[i];
        i=min(i+m,n-1);
        if (s[i]==' ') {
            i++; t++;
        } else if (i==n-1) {
            break;
        } else if (s[i+1]==' '){
            i+=2; t++;
        } else {
            i=pre[i]+1; t++; 
        }
    }
    return t;
}
int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    while(cin.getline(s,500000+5)) {
        n=strlen(s);
        Rep(i,n) pre[i]=(s[i]==' ')?i:(pre[i-1]);
        pre[n]=n;
        len[n]=0;
        RepD(i,n-1) len[i]=(s[i]==' ')?0:len[i+1]+1;
        int a=read(),b=read();
        Fork(i,a-1,b-1) {
            printf("%d\n",calc(i));
        }
    }
    return 0;
}

Digit Division

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip> 
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (300000+10)
ll a[MAXN];
char s[MAXN];
int main()
{
//  freopen("D.in","r",stdin);
//  freopen(".out","w",stdout);
    int n,m;
    while(cin>>n>>m) {
        scanf("%s",s);
        Rep(i,n) a[i]=s[i]-'0';
        For(i,n-1) a[i]=(a[i-1]*10+a[i])%m;
        int t=0;
        Rep(i,n) if (a[i]%m==0) t++;
        if (a[n-1]%m) {
            puts("0"); continue;
        } else t--;
        int p=1;
        while(t) {
            p=(p*2)%F; t--;
        }
        cout<<p<<endl;
    }
    return 0;
}

Hovering Hornet

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
ll sqr(ll a){return a*a;}
ld sqr(ld a){return a*a;}
double sqr(double a){return a*a;}

ld PI = 3.141592653589793238462643383;
class P{
public:
    double x,y;
    P(double x=0,double y=0):x(x),y(y){}
    friend long double dis2(P A,P B){return sqr(A.x-B.x)+sqr(A.y-B.y);  }
    friend long double Dot(P A,P B) {return A.x*B.x+A.y*B.y; }
    friend long double Length(P A) {return sqrt(Dot(A,A)); }
    friend long double Angle(P A,P B) {return acos(Dot(A,B) / Length(A) / Length(B) ); }

    friend P operator- (P A,P B) { return P(A.x-B.x,A.y-B.y); }
    friend P operator+ (P A,P B) { return P(A.x+B.x,A.y+B.y); }
    friend P operator* (P A,double p) { return P(A.x*p,A.y*p); }
    friend P operator/ (P A,double p) { return P(A.x/p,A.y/p); }
    friend bool operator< (const P& a,const P& b) {return a.x<b.x||(a.x==b.x&& a.y<b.y);}

}; 
const double eps=1e-10;
int dcmp(double x) {
    if (fabs(x)<eps) return 0; else return x<0 ? -1 : 1; 
}
bool operator==(const P& a,const P& b) {
    return dcmp(a.x-b.x)==0 && dcmp(a.y-b.y) == 0;
} 
typedef P V;
double Cross(V A,V B) {return A.x*B.y - A.y*B.x;}

//Cross(v,w)==0(Æ½ÐÐ)Ê±,²»ÄÜµ÷Õâ¸öº¯Êý 
P GetLineIntersection(P p,V v,P Q,V w){
    V u = p-Q;
    double t = Cross(w,u)/Cross(v,w);
    return p+v*t;
}
//¹æ·¶Ïà½»-Ïß¶ÎÏà½»ÇÒ½»µã²»ÔÚ¶Ëµã 
bool SegmentProperIntersection(P a1,P a2,P b1,P b2) { 
    double  c1 = Cross(a2-a1,b1-a1) , c2 = Cross(a2-a1,b2-a1),
            c3 = Cross(b2-b1,a1-b1) , c4 = Cross(b2-b1,a2-b1);
    return dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0;
}
//µãÔÚÏß¶ÎÉÏ£¨²»°üº¬¶Ëµã£© 
bool OnSegment(P p,P a1,P a2) {
    return dcmp(Cross(a1-p,a2-p)) == 0 && dcmp(Dot(a1-p,a2-p))<0;
}

P read_point() {
    P a;
    scanf("%lf%lf",&a.x,&a.y);
    return a;   
} 
typedef vector<P> Polygon ;
//ÓÐÏòÖ±ÏßA->B ÇÐ¸î¶à±ßÐÐpoly ¿ÉÄÜ·µ»Øµ¥µãÏß¶Î O(n)
Polygon CutPolygon(Polygon poly,P A,P B){
    Polygon newpoly;
    int n=poly.size();
    Rep(i,n) {
        P C = poly[i];
        P D = poly[(i+1)%n];
        if (dcmp(Cross(B-A,C-A))>=0)  newpoly.pb(C);
        if (dcmp(Cross(B-A,C-D))) {
            P ip = GetLineIntersection(A,B-A,C,D-C);
            if (OnSegment(ip,C,D)) newpoly.pb(ip);
        }
    }
    return newpoly;
}
double PolygonArea(Polygon &p) {
    double area=0;
    int n=p.size();
    For(i,n-2) area+=Cross(p[i]-p[0],p[i+1]-p[0]);
    return area/2;
} 

P a[4]={P(-0.5,-0.5),P(0.5,-0.5),P(0.5,0.5),P(-0.5,0.5)};
int c[4]={1,3,6,4};
int main()
{
//  freopen("H.in","r",stdin);
//  freopen(".out","w",stdout);
    while(1) {
        Polygon poly;
        Rep(i,4) {
            P A;
            if (scanf("%lf%lf",&A.x,&A.y)!=2) return 0;
            poly.pb(A);         
        }
        Polygon A[4];
        Rep(i,4) {
            A[i]=CutPolygon(poly,a[(i+1)%4],a[i]);
        }
        double p=0;
        Rep(i,4) {
            p+=PolygonArea(A[i])*5/(5*5*5-1)*c[i];
        }
        p+=5.0*(5*5*4)/(5*5*5-1);
        printf("%.10lf\n",p);
    }

    return 0;
}

Kernel Knights

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip> 
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (100000*2+10)
int n;
vi edges[MAXN],redges[MAXN];
int b[MAXN]; //0 unknown // 1 inS // 2 notInS
int vis[MAXN],indegree[MAXN];
int main()
{
//  freopen("K.in","r",stdin);
//  freopen(".out","w",stdout);
    while(cin>>n) {
        MEM(b) MEM(vis) MEM(indegree)
        For(i,2*n) {
            int v=read();
            edges[i].pb(v);
            redges[v].pb(i);
            indegree[v]++;
        }
        queue<int> q;
        For(i,2*n) if (!indegree[i]) q.push(i),b[i]=1,vis[i]=1;
        while(!q.empty()) {
            int x=q.front(); q.pop();
            if (b[x]==1) {
                Rep(i,SI(edges[x])) {
                    int v=edges[x][i];
                    b[v]=2; if (!vis[v]) q.push(v),vis[v]=1;
                }
                Rep(i,SI(redges[x])) {
                    int v=redges[x][i];
                    b[v]=2; if (!vis[v]) q.push(v),vis[v]=1;
                }               
            }
            if (b[x]==2) {
                int v=edges[x][0];
                indegree[v]--;
                if (!indegree[v]&&!vis[v]) q.push(v),vis[v]=1,b[v]=1;
            }
        }
        vi ans;
        For(i,2*n) if (b[i]==1||(!b[i]&&i<=n)) ans.pb(i);
        int sz=SI(ans);
        Rep(i,sz-1) printf("%d ",ans[i]);printf("%d\n",ans[sz-1]); 
        For(i,2*n) edges[i].clear(),redges[i].clear();
    }


    return 0;
}

nike0good

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
小鸡腿U T8 CERC2015

ASCII AdditionBook BordersDigit DivisionHovering HornetKernel KnightsASCII Addition#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=
复制链接

扫一扫