2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)

最新推荐文章于 2019-05-03 20:52:04 发布
最新推荐文章于 2019-05-03 20:52:04 发布
阅读量883 收藏 2
点赞数 1
分类专栏： 比赛题解
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/nike0good/article/details/78467898
版权

A Alien Sunset

模拟

#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 ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;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,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#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: %lld\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")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
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;}
inline 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 (22)
int h[MAXN],l[MAXN],r[MAXN];
int check(int p,int i) {
    p%=h[i];
    if (l[i] <= r[i]) return p<=l[i] || p>=r[i];
    else return p<=l[i] && p>=r[i]; 
}
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    int dy=0;
    For(i,n) {
        h[i]=read(),l[i]=read(),r[i]=read();
        gmax(dy,h[i]);
    }


    Rep(i,1825*dy) {
        bool fl=0;
        For(j,n) if (!check(i,j)) {
            fl=1;break;
        }
        if (!fl) {
            cout<<i<<endl;return 0;
        }
    }
    puts("impossible");
    return 0;
}

B Breaking Biscuits

找凸包，旋转卡壳

#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())
#define ALL(x) (x).begin(),(x).end()
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;}
const double eps=1e-10;
int dcmp(double x) {
    if (fabs(x)<eps) return 0; else return x<0 ? -1 : 1; 
}
ld PI = 3.141592653589793238462643383;
class P{
public:
    double x,y;
    P(double x=0,double y=0):x(x),y(y){}
    friend ld dis2(P A,P B){return sqr(A.x-B.x)+sqr(A.y-B.y);   }
    friend ld Dot(P A,P B) {return A.x*B.x+A.y*B.y; }
    friend ld Length(P A) {return sqrt(Dot(A,A)); }

    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 dcmp(a.x-b.x)<0 ||(dcmp(a.x-b.x)==0&& dcmp(a.y-b.y)<0 );}

}; 
P read_point() {
    P a;
    scanf("%lf%lf",&a.x,&a.y);
    return a;   
} 
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;}
double Area2(P A,P B,P C) {return Cross(B-A,C-A);}
double DistanceToSegment(P p,P A,P B) {
    if (A==B) return Length(p-A);
    V v1 = B-A, v2 = p-A, v3 = p - B;
    if (dcmp(Dot(v1,v2))<0) return Length(v2);
    else if (dcmp(Dot(v1,v3))>0 ) return Length(v3);
    else return fabs(Cross(v1,v2) ) / Length(v1);
}
int ConvexHull(P *p,int n,P *ch) {
    sort(p,p+n);
    int m=0;
    Rep(i,n) {
        while(m>1 && Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    int k=m;
    RepD(i,n-2) {
        while(m>k && Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
        ch[m++]=p[i];
    }
    if ( n > 1 ) m--;
    return m;
}
P p[1000],ch[1000];
double rotating_calipers(P *p,int n) {
    int q=1;
    double ans=INF;
    Rep(i,n) {
        while(fabs(Area2(p[i],p[(i+1)%n],p[(q+1)%n]))> fabs(Area2(p[i],p[(i+1)%n],p[q] )) ) 
            q=(q+1)%n;
        ans = min( ans, (double)DistanceToSegment(p[q],p[i],p[(i+1)%n]) );          
    }
    return ans;
}

int main()
{
//  freopen("B.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    Rep(i,n) {
        p[i]=read_point();
    }
    int m=ConvexHull(p,n,ch);
    printf("%.10lf\n",rotating_calipers(ch,m));

    return 0;
}

C Cued In

#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 ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;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,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#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: %lld\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")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
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;}
inline 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;
} 
map<string,int> h;
int c[1000]={};
int main()
{
//  freopen("C.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    h["red"]=1;
    h["yellow"]=2;
    h["green"]=3;
    h["brown"]=4;
    h["blue"]=5;
    h["pink"]=6;
    h["black"]=7;

    int r1=0;
    For(i,n) {
//      char s[1000];
        string s;
        cin>>s;
        int p=h[s];
        c[p]++;
    }
    if (c[1]==n) {
        puts("1");return 0;
    }
//  PRi(c,7)
    ll ans=0;
    if (c[1]>0) {
        int p=7;
        while(!c[p]) --p;
        ans+=p*c[1] + c[1];
    }
    Fork(i,2,7) ans+=i*c[i];
    cout<<ans<<endl;

    return 0;
}

D Deranging Hat

#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 ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;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,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#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: %lld\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")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
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;}
inline 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[1010];
char s2[1010];
int main()
{
//  freopen("A.in","r",stdin);
//  freopen(".out","w",stdout);

    cin>>(s+1);
    int n=strlen(s+1);
    For(i,n) {
        s2[i]=s[i];
    }
    sort(s2+1,s2+1+n);
    For(i,n) {
        swap(s[i],s2[i]);
    }
    For(i,n) if (s[i]!=s2[i]) {
        Fork(j,i+1,n) {
            if (s[j]==s2[i]) {
                if (s[i]>s[j])
                    printf("%d %d\n",i,j);
                else {
                    printf("%d %d\n",j,i);

                }
                swap(s[j],s[i]);
                break;
            }
        }
//      puts(s+1);
    }





    return 0;
}

H Hiking

#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 ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;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,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#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: %lld\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")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
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;}
inline 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 (123456)
ll B;
int n;
ll d[MAXN];
int k;
int a[MAXN],v[MAXN];
vi ans;
bool avi(int i,int j) {
    if (i!=1) {
        if (j-d[v[i-1]]>B) return 0;
    }
    if (i<k) {
        if (d[v[i+1]]-j>B) return 0;
    }
    if (i<k) {
        if (j>d[v[i+1]]-a[i+1]) return 0;
        if (j+a[i]>d[v[i+1]]) return 0;
    }
    return 1;
}
int main()
{
//  freopen("H.in","r",stdin);
//  freopen(".out","w",stdout);
    B=read();
    n=read();
    For(i,n) d[i]=read();
    k=read();
    For(i,k) a[i]=read(),v[i]=read();
    while(1) {
        while (v[k]==n && k ) --k;
        if (!k) break;
        bool fl=0; 
        ForD(i,k) {
            while (v[i]<n && avi(i,d[v[i]+1]) ) {
                ans.pb(i);// cout<<i<<' ';
                v[i]++; fl=1;
            }
        }
        if (!fl) puts("impossible"),exit(0);

    }
    Rep(i,SI(ans)) cout<<ans[i]<<' ';
    return 0;
}

K nightsbridge Rises

贪心

#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 ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;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,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#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: %lld\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")
#define ALL(x) (x).begin(),(x).end()
#define gmax(a,b) a=max(a,b);
#define gmin(a,b) a=min(a,b);
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;}
inline 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 (120) 
int w[MAXN],pl[MAXN];
bool use[MAXN]={};
vector<int> v[MAXN];
pi a[MAXN];
int main()
{
//  freopen("K.in","r",stdin);
//  freopen(".out","w",stdout);
    int n=read();
    For(i,n) w[i]=read(),pl[i]=read();
    For(i,n) {
        if (w[i]>=pl[i]) use[i]=1;
    }
    int m=read();
    For(i,m) {
        int p=read();
        a[i]=mp(p,i);
    }
    sort(a+1,a+1+m);
//  reverse(a+1,a+1+m);
    For(i,m) {
        int vv=a[i].fi;
//      cout<<vv<<endl;
        while(vv) {
            int j=0;
            For(i,n) {
                if (!use[i] && pl[i]>=vv ) {
                    if (!j || pl[j]>pl[i] || (pl[j]==pl[i] &&w[j]>w[i] ) ) j=i;
                }
            }
//          printf("(%d,%d)",w[j],pl[j]);
            if (!j) {
                puts("impossible"),exit(0);
            }
            v[a[i].se].pb(j);
            use[j]=1;
            vv=w[j];
        }
//      cout<<endl;
    }
    For(i,m) {
        int sz=SI(v[i]);
        if (sz) {
            printf("%d",v[i][sz-1]);
            RepD(j,sz-2) 
                printf(" %d",v[i][j]);

        }
        puts("");
    }

    return 0;
}
nike0good
关注
  • 1
    点赞
  • 踩
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
2015 United Kingdom and Ireland Programming Contest (UKIEPC 2015)
Owen_Q的博客
10-10 2883
2015年的icpc英国站，不到一百只过题队伍，可以算是icpc在英国刚起步的时候。 Problem B Mountain Biking 思路：作为本场的签到题，读懂题意之后，这题倒是更像一道数学题。给定n个坡面的角度，求解到达坡道底端的速度 利用经典力学动力学公式 即可直接求出. /* Author Owen_Q */ #include <bits/stdc++.h&gt...
Unit 2 The United Kingdom教案1.docx
11-21
【Unit 2 The United Kingdom教案1】 本单元主要聚焦于英国这一主题，旨在帮助学生学习和理解与英国相关的词汇和语言结构。以下是本教案的重点知识梳理： **词汇部分：** 1. **divide/separate**： - `divide` ...
【2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)】Knightsbridge Rises【最大流+路径输出】
Gene_I must wait for the sunrise
05-03 484
题意： 给出nnn个起重机，每个起重机有两个属性，W[i]W[i]W[i]表示这个起重机的重量，L[i]L[i]L[i]表示这个起重机能够拉起的最大重量（可以拉重物也可以拉起重机）。现在有mmm栋楼以及mmm个重物，要求给出每栋楼起重机的分配方案，使得每栋楼最后留下的起重机可以拉起对应的重物。(1≤n≤100,1≤M≤100)(1\leq n\leq 100, 1\leq M\leq 100)(1...
United Kingdom and Ireland Programming Contest 2017 B
AC_jie的博客
04-07 720
codeforces.com/gym/222400 题意是有一个饼干，这个饼干是标准的一个多边形，然后给这个饼干上的顶点，然后问要是将他放入一个杯子中的话，这个杯子的最小直径是多少？ 一开始的第一反应是两点之间的最远距离，但是TD说了可以将饼干竖起来之后的想法，就想到了旋转卡壳算法，然而并不知道旋转卡壳是干什么的，计算几何这块太差了。一定赶紧补起来。 那就先拿今天的这几个题来练一练。 因为...
unit 2 the united kingdom 新人教版必修5.docx
09-09
3. `The United Kingdom consists of Great Britain and Northern Ireland.` 这句话简洁明了地介绍了英国的组成，即大不列颠和北爱尔兰。 这个单元的学习不仅涵盖了词汇和短语的掌握，还强调了实际语境中的应用，...
人教版必修5 unit2 the united kingdom 单元复习学案.docx
09-11
例如，The United Kingdom consists of England, Scotland, Wales, and Northern Ireland. - **consist in**：表示“在于”，强调某事物的本质或特征在于什么。例如，The beauty of Venice consists in the style ...
高中英语必修5_Unit2_The_United_Kingdom课件(人教新课标).ppt
01-07
1. **英国全称**：完整的国家名称是大不列颠及北爱尔兰联合王国（The United Kingdom of Great Britain and Northern Ireland），通常简称为英国。 2. **英国组成**：英国由四个部分组成，包括英格兰（England）、...
2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017)(solve 11/12)
passer__的博客
09-30 982
题目链接：http://codeforces.com/gym/101606 A题: 题意：给你n个天，对于每个天来说有一个一天的天数和日出和日落，问你这样连续1825天数是否可以找到一个黑暗的时间。 思想：模拟，左不要右要，最后扫一边看看有没有那个是黑天，左不要原因是担心那种缝隙问题，就是上一天到这一天的开始，对于这个缝隙还是黑暗。 #include&lt;bits/stdc++.h&g...
UKIEPC 2017
weixin_34358365的博客
11-12 107
A Alien Sunset 暴力枚举t #include <bits/stdc++.h> using namespace std; typedef long long ll; struct node{ int h,r,t; }info[205]; int n; bool suit(int i,int t){ int tt=t%info[i].h; if...
Codeforces Gym101606 C.Cued In (2017 United Kingdom and Ireland Programming Contest (UKIEPC 2017))
weixin_30530339的博客
01-25 161
C Cued In 这个题是打球的。都忘了写的什么了。。。 代码: 1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 using namespace std; 5 string s[100]; 6 int main(){ 7 s...
2017 United Kingdom and Ireland Programming Contest [UKIEPC 2017]
weixin_30711917的博客
08-28 9976
枚举大法妙啊 今天比赛节奏把握相对还可以 队友都很优秀 %%tql 出了10个题 rank3 有史以来最高记录（叉会腰） 下面放AC代码 （除了 G 、H A - Alien Sunset 题目大意： 给n组日长、日出时间、日落时间，问是否能找到一个时间段点 使得n个行星都处于天黑中。 思路：暴力枚举模拟在1825 * 日长max 内 枚举每个小时是否每个行星都在天黑 如果...
Codeforces Gym101606 I.I Work All Day (2017 United Kingdom and Ireland Programming Contest (UKIEPC 2...
weixin_30374009的博客
01-25 189
I I Work All Day 这个题就是取模找最小的。 代码: 1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<cmath> 5 #include<queue> 6 #include<s...
2019.04.11 第四次训练 【 2017 United Kingdom and Ireland Programming Contest】
weixin_30654583的博客
04-13 354
题目链接: https://codeforces.com/gym/101606 A:✅ B: C:✅ D:✅ https://blog.csdn.net/Cassie_zkq/article/details/89305638 E:✅ F: 概率dp https://blog.csdn.net/Cassie_zkq/article/details/...
UKIEPC2017 - K - Knightsbridge Rises - 网络流
LucienShui
08-28 297
题解链接 http://www.lucien.ink/archives/320/ 题目链接 http://codeforces.com/gym/101606 题目 High-rise buildings in the wealthy retail district of Knightsbridge are usually built with exotic hoisting ma...
2017 United Kingdom and Ireland Programming（Gym - 101606）
weixin_30387339的博客
04-04 239
题目很水。睡过了迟到了一个小时，到达战场一看，俩队友AC五个了。。 就只贴我补的几个吧。 B - Breaking Biscuits Gym - 101606B 旋转卡壳模板题。然后敲错了。 代码是另一种做法：对于每条边，枚举两边的所有点到直线的距离，分别取最大值，然后加起来。 #include <bits/stdc++.h> #define FOPI freop...
UKIEPC2017 . I Work All Day（水题）
红鲤鱼与绿鲤鱼与驴
08-31 391
问题 I: I Work All Day 时间限制: 1 Sec  内存限制: 128 MB  Special Judge 提交: 74  解决: 69 [提交] [状态] [讨论版] [命题人:admin] 题目描述 Michael is a lumberjack, and a pretty OK one at that. However, automation is making fas...
John wantsto have a journey around Ireland. He has many items that he likes to carry with him, but although he has three suitcases, unfortunately, he cannot accommodate all his itemsin the suitcases. Thus, he needs to decide which items to pick. He knows the size and worth of each item. Therefore, he likes to pick the items so that the total values of the selected items be maximum. There are several items that he cannot take part of them, like his violin. But some of them, he can take part of them like sugar. You need to write a program in Java to help John select his items and tell John that each item should be put in which suitcase. The input of the program is the number of suitcases that John has and also the capacity of each of them. In addition, the total number of the items, the size and worth of each, and whether John can take a part of the item.
最新发布
06-08
好的，这是一个背包问题（Knapsack Problem），我们可以使用动态规划算法来解决。首先，我们需要定义以下几个变量： - `n`：旅行者带的物品总数 - `m`：旅行者拥有的行李箱数量 - `w[i]`：第 `i` 个物品的体积 ...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值