2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rules, Teams Prefer

A  题意：有几个邮箱，格式为@bmail.com的邮箱login域从第一个+到@之间的字符可全忽略

给mail分类

不难

#include<bits/stdc++.h>
using namespace std;
map<string,vector<string> > mp;
string cal(string ss)
{
    int len=ss.size();
	for(size_t t=0;t<len;t++)
		ss[t]=tolower(ss[t]);
	string smp=ss.substr(ss.find('@'));
	//cout<<smp;
	if(smp=="@bmail.com")
	{
		string stmp;
		for(char c:ss)
		{
			if(c=='.');
			else if(c=='+'||c=='@') break;
			else stmp+=c;
		}
		return stmp+smp;
	}
	return ss;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	string ss;
	for(int i=1;i<=n;i++)
	{
		cin>>ss;
		mp[cal(ss)].push_back(ss);
	}
	cout<<mp.size()<<'\n';
	for(auto& v:mp)
	{
		string ans;
		cout<<v.second.size();
		for(string& s:v.second)
			ans+=" "+s;
		cout<<ans<<'\n';
	}
	return 0;
}

B

暴力

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>

using namespace std;
const int maxn = 4000 + 40;
long long A[maxn],B[maxn];
int n;

int main(){
    cin>>n;
    long long   x,y,z;
    z=0;
    for(int i=0;i<n;i++){
        scanf("%d %d",&A[i],&B[i]);
        if(A[i]>B[i])swap(A[i],B[i]);


    }
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            if(A[i]<A[j]){
               swap(A[i],A[j]);
               swap(B[i],B[j]);
            }
        }
    }

    for(int i=0;i<n;i++){
        sort(B,B+i+1);
        for(int j=0;j<=i;j++){
            if(A[i]*B[j]*(i-j+1)>z){
                z=A[i]*B[j]*(i-j+1);
                x=A[i];
                y=B[j];

            }
        }
    }
    printf("%I64d\n",z);
    printf("%I64d %I64d\n",x,y);
}

因为给的时间足够大，所以就暴力

D想法题

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cmath>
#include <iostream>
#include <algorithm>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define mk make_pair
#define N 1200
using namespace std;
int a[N],t[N],s[N],f[N],d[N];
int n;
bool cross(int i,int j){
    int L=max(min(s[i],f[i]),min(s[j],f[j])),R=min( max(s[i],f[i]),max(s[j],f[j]) );
    if(L>R)return 0;
    int t1=t[i],t2=t[j];
    if(s[i]<=L)t1+=abs(L-s[i]);
        else t1+=abs(R-s[i]);

    if(s[j]<=L)t2+=abs(L-s[j]);
        else t2+=abs(R-s[j]);

    if(d[i]==d[j])return t1==t2;
    return abs(t1-t2)<=R-L;
}
int main(){
    scanf("%d",&n);
    rep(i,1,n){
        scanf("%d%d%d",&t[i],&s[i],&f[i]);
        if(s[i]<f[i])d[i]=1;
        else d[i]=-1;
    }
    rep(i,1,n)
        rep(j,i+1,n)if(cross(i,j)){a[i]++;a[j]++;}
    rep(i,1,n)printf("%d ",a[i]);
}

F

这是个二分

详细实现在代码里

二分时间（吃每种菜的时间）

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>

using namespace std;
const int maxn = 200 + 50;
int n,A[maxn],B[maxn],m,P[maxn];
bool ok(int se){
    int s,e,v;
    for(int i=0;i<m;i++)for(int j=0;j<i;j++){
            s=P[j];
            e=P[i];
            v=e-s;
            for(int k=0;k<n;k++){
                if(A[k]>=s&&B[k]<=e)
                    v-=se;
            }
        if(v<0)return false;
    }
    return true;
}
bool cmp(int a,int b){
    return a<b;
}
int main(){
    while(~scanf("%d",&n)&&n){
            m=0;
        for(int i=0;i<n;i++){
            scanf("%d%d",&A[i],&B[i]);
            P[m++]=A[i],P[m++]=B[i];
        }
        sort(P,P+m,cmp);
        int s=0,e=100000,mid,num;
        while(s<=e){
            int mid=(s+e)/2;
            if(ok(mid)){
                num=mid;
                s=mid+1;
            }
            else e=mid-1;
        }
        printf("%d\n",num*n);
    }
}

G

官方的题解是线段树，可我不会，就在别人那里看到了一个很好的代码，别人不得不说，想的真是远啊。

#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstdio>

using namespace std;
typedef long long LL;
const int maxn = 200000 + 50;
int n,m;
int Time[maxn];
struct candi{
    int pre,work;
    int pos;
}P[maxn];
int F[maxn];
bool cmp(candi a,candi b){
    return a.pre == b.pre ? a.work<b.work : a.pre<b.pre;

}
int main(){
    while(~scanf("%d%d",&n,&m)){
        for(int i=1;i<=m;i++){scanf("%d",&Time[i]);}
        for(int i=1;i<=n;i++){scanf("%d%d",&P[i].pre,&P[i].work);P[i].pos=i;}
        sort(P+1,P+n+1,cmp);
        memset(F,0,sizeof(F));
        LL ans=0;
        int k=1;
        for(int i=1;i<=n;i++){
           if(P[i].pre!=P[i-1].pre){k=1;ans=0;}
           else{
               if(ans>=(LL)P[i].work)
            {F[P[i].pos]=k;continue;}
            else k++;
           }
           for(;k<=m;k++){
               int mi=Time[k]-P[i].pre;
               if(mi>0)ans+=LL(mi);
               if(ans>=(LL)P[i].work){F[P[i].pos]=k;break;}
           }
        }
        for(int i=1;i<n;i++){

            printf("%d ",F[i]);
        }
        printf("%d\n",F[n]);
    }
}

J模拟题

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>


using namespace std;
char s[4]={'U','R','D','L'};
char maze[40][40];
int n,m;
bool ok(int x,int y){
    if(x<0||y<0||x>=n||y>=m||maze[x][y]=='*')return false;
    return true;
}
int vis[40][40];
int main(){
    cin>>n>>m;
    memset(vis,0,sizeof(vis));
    int i,j,p,q,l,t,k,cnt,num;
    for(i=0;i<n;i++){
        scanf("%s",&maze[i]);
        for(j=0;j<m;j++){
            if(maze[i][j]!='*'&&maze[i][j]!='.'){
                p=i,q=j;
            }
        }
    }
    if(maze[p][q]=='U') l=0; if(maze[p][q]=='R') l=1; if(maze[p][q]=='D') l=2; if(maze[p][q]=='L') l=3;
    i=p,j=q;
    cnt=0;
    num=0;
    k=0;
    t=0;
    while(cnt<=100000){
        Lable:cnt++;
        if(l==4)l=0;
        if(!t){
            if(!vis[i][j]){
                vis[i][j]=1;
                num++;
                k=0;
            }
        }
        if(k==4)break;
        t=0;
        if( s[l]=='U'&&ok(i-1,j) ){i--;goto Lable;}
        else if( s[l]=='R'&&ok(i,j+1) ){j++;goto Lable;}
        else if( s[l]=='D'&&ok(i+1,j) ){i++;goto Lable;}
        else if( s[l]=='L'&&ok(i,j-1) ){j--;goto Lable;}
        t=1;
        l++;

        k++;
        goto Lable;
    }
    cout<<num<<endl;

}

I

大水题，略