2020 ICPC Universidad Nacional de Colombia Programming Contest题解分析

A题 可能两条线段不一样长，所以把较长的线段分两段讨论，第一段，两人同时走，所以在不交叉的情况下，距离最小一定是两者的起点距离和终点距离中的最小值，交叉那距离自然就是0，第二段，一人停下来了，另一人还在走，并且是沿直线走，所以一个点固定，另一个点沿直线行走，两人的距离和一人行走的距离的函数，要不就是单调函数，要不就是凹函数，所以可以用三分解决。

#include<bits/stdc++.h>
using namespace std;
const double eps = 1e-7;
struct Point{
    double x, y;
    Point() {}
    Point(double xx, double yy) : x(xx), y(yy){}
    void input() { scanf("%lf%lf",&x,&y);}
};
double distance(Point a, Point b){
    return sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
struct  Line{
    Point st, en;
    double len, ang;
    void input(){
        st.input();
        en.input();
        len = distance(st, en);
        ang = atan2(en.y - st.y , en.x - st.x);
    }
}line1, line2;
double get_distance(double mid){
	/*
    Point p1=Point(line1.st.x+min(mid,line1.len)*cos(line1.ang),line1.st.y+min(mid,line1.len)*sin(line1.ang));
    Point p2=Point(line2.st.x+min(mid,line2.len)*cos(line2.ang),line2.st.y+min(mid,line2.len)*sin(line2.ang));
    double ans=distance(p1,p2);
    */
	
    Point p1=Point(line1.st.x+min(mid,line1.len)*cos(line1.ang),line1.st.y+min(mid,line1.len)*sin(line1.ang));
    Point p2=Point(line2.st.x+min(mid,line2.len)*cos(line2.ang),line2.st.y+min(mid,line2.len)*sin(line2.ang));
    double ans=distance(p1,p2);
    return ans;
    
    /*
    Point p1 = Point(line1.st.x+min(mid,line1.len)/line1.len*(line1.en.x-line1.st.x),line1.st.y+min(mid,line1.len)/line1.len*(line1.en.y-line1.st.y));
    Point p2 = Point(line2.st.x+min(mid,line2.len)/line2.len*(line2.en.x-line2.st.x),line2.st.y+min(mid,line2.len)/line2.len*(line2.en.y-line2.st.y));

    return distance(p1,p2);
     */
}
double trisection(double l, double r){
    /*
    while(r-l > eps){
        double midl = (2*l+r)/3;
        double midr = (2*r+l)/3;
        //cout << l << ':' << get_distance(l) <<  ' ' << r << ':' << get_distance(r) << endl;
        if(get_distance(midl) < get_distance(midr)) r = midr;
        else l = midl;
    }
    return get_distance(l);
    */
    for(int i=1;i<=1e2;++i){
        double midl=(l*2+r)/3,midr=(l+r*2)/3;
        if(get_distance(l)<get_distance(r)){
            r=midr;
        }
        else{
            l=midl;
        }
    }
    double ans=get_distance(l);
    if(ans-get_distance(r)>eps){
        ans=get_distance(r);
    }
    return ans;

}
int main(){
    //freopen("A.in","r",stdin);
    line1.input();
    line2.input();
    double res = min(trisection(0,min(line1.len,line2.len)),trisection(min(line1.len,line2.len),max(line1.len,line2.len)));
    printf("%.12f\n",res);
}

E题：先查询1和目标结点的距离为dis，然后每次查询左子树的根结点和目标的距离，如果每次查询到的距目标结点距离比父亲结点远，则取其兄弟的左子树的根结点为下一个查询目标，这样每一层最多查询一次，最多查询n次，符合题目给的限制。

#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i=l;i<=r;i++)
#define REP(i,l,r) for(int i=l;i>=r;i--)
typedef long long ll;
int main(){
    int n;
    scanf("%d",&n);
    if(n==1) printf("! 1\n");
    else {
        int dis = 0;
        printf("1\n"); fflush(stdout); scanf("%d",&dis);
        int i = 1;
        int x2;
        while(dis!=0){
            printf("%d\n",i*2); fflush(stdout); scanf("%d",&x2);
            if(x2 > dis) i = i * 2 + 1;
            else i = i * 2;
            dis--;
        }
        cout << "! " << i << endl;
    }
}

G题：一共n人，有m对人有矛盾，所以这m对人的的排序不能颠倒。
这样理解，假设m等于1，对于n个人，本来有n！种情况，但是现在两人的顺序不能颠倒，所以排列情况就是n！/2种情况，那对于m等于2来说，就是在m等于1的情况下再加上一次除以2，所以这样下来，答案就是n!/2^m种排列情况

#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(ll i=l;i<=r;i++)
const int mod = 1e9+7;
typedef long long ll;
int main(){
    ll n, m;
    cin >> n >> m;
    int t, tt;
    FOR(i,1,m) scanf("%d%d",&t,&tt);
    ll res = 1;
    FOR(i,1,n) {
        res = (res*i) % mod;
        if((!(res&1)) && m-- && res > 2) res /= 2;
    }
    while(m--) res /= 2;
    cout << res << endl;
}

K:

# include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
char s1[maxn],s2[maxn];
int main(){
    scanf("%s",s1+1);
    scanf("%s",s2+1);
    int l1=strlen(s1+1),l2=strlen(s2+1);
    int i;
    bool tag = 0;
    for(i=1;i<=l1&&i<=l2;++i){
        if(s1[i]>='0' && s1[i] <= '9'){
            tag = 1;
            break;
        }
        else{
            if(s1[i] < s2[i]){
                printf("<\n");
                return 0;
            }
            else if(s1[i] > s2[i]){
                printf(">\n");
                return 0;
            }
        }
    }
    if(tag){
        if(l1 > l2){
            printf(">\n");
            return 0;
        }
        else if(l1 < l2) {
            printf("<\n");
            return 0;
        }
        else{
            for(;i<=l1;++i){
                if(s1[i] < s2[i]){
                    printf("<\n");
                    return 0;
                }
                else if(s1[i] > s2[i]){
                    printf(">\n");
                    return 0;
                }
            }
            printf("=\n");
        }
    }
    else{
        printf("=\n");
        return 0;
    }
    return 0;
}

H：

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+6;
typedef unsigned long long ull;
int n;
ull seed = 31,base[N],_hash[N],d1[N];
char s[N];
map<ull,int>mp;
int ans = 0;

void init(){
    base[0] = 1;
    for(int i=1;i<N;++i) base[i] = base[i-1]*seed;
}

void makehash(int len,char str[]){
    for(int i=1;i<=len;++i) _hash[i] = _hash[i-1]*seed+(str[i]-'a'+1);
}

// 从i开始，长度为l
ull gethash(int i,int l){
    return _hash[i+l-1]-_hash[i-1]*base[l];
}

void insert(int i,int l){
    if(l==1) return;
    ull tmp = gethash(i,l);
    if(mp.find(tmp)==mp.end()) mp[tmp]=1,ans++;
}

void manacher_odd(char str[]){
    for(int i=1,l=1,r=0;i<=n;++i){
        int k = (i>r)?1:min(d1[l+r-i],r-i);
        while(1<=i-k&&i+k<=n&&str[i-k]==str[i+k]) k++,insert(i-k+1,2*k-1);
        d1[i] = k--;
        if(i+k>r) l=i-k,r=i+k;
    }
}

int main(){
    scanf("%d",&n);
    scanf("%s",s+1);
    init();
    makehash(n,s);
    manacher_odd(s);
    printf("%d\n",ans);
}

L：

//DLRU
# include <bits/stdc++.h>
# define pii pair<int,int>
# define fi first
# define se second
# define mp make_pair
using namespace std;
const int maxn = 2e3+10;
const char d[4] = {'D','L','R','U'};
const int dx[4] = {1,0,0,-1};
const int dy[4] = {0,-1,1,0};
int n,m;
char p[maxn][maxn];
int dis[maxn][maxn];
int from[maxn][maxn];
pii t[maxn][maxn][4];       //CLosest clear cell, which contains (x,y) itself.
queue<pii> Q;
vector<char> ans;
/*
void print(){
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j){
            printf("Now at point(%d,%d)\n",i,j);
            for(int k=0;k<4;++k){
                printf("jump to (%d,%d)\n",t[i][j][k].fi,t[i][j][k].se);
            }
        }
    printf("\n");
}
void print(int x,int y){
    printf("Now det %d,%d\n",x,y);
    for(int k=0;k<4;++k) printf("k=%d,(%d,%d) ",k,t[x][y][k].fi,t[x][y][k].se);
    printf("\n");
}
void print(int x,int y,int k){
    printf("Sear (%d,%d) whe k= %d: = (%d,%d)\n",x,y,k,t[x][y][k].fi,t[x][y][k].se);
}
 */
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;++i) {
        scanf("%s", p[i] + 1);
    }
  //  for(int i=0;i<=(n+1);++i)for(int j=0;j<=(m+1);++j)for(int k=0;k<4;++k)t[i][j][k]=mp(0,0);
    int sx,sy,ex,ey;
    for(int x=1;x<=n;++x){
        for(int y=1;y<=m;++y){
            for(int k=1;k<=3;k+=2){ //k = 1 & 3
                int tx = x+dx[k];
                int ty = y+dy[k];
                if(p[x][y] == '.' || p[x][y] == 'S' || p[x][y] == 'E') t[x][y][k] = mp(x,y);
                else t[x][y][k] = t[tx][ty][k];
 
                if(p[x][y] == 'S') sx = x,sy = y;
                if(p[x][y] == 'E') ex = x,ey = y;
            }
        }
    }
 
    for(int x=n;x>0;--x){
        for(int y=m;y>0;--y){
            for(int k=0;k<=2;k+=2){ //k = 0 & 2
                int tx = x+dx[k];
                int ty = y+dy[k];
                if(p[x][y] == '.' || p[x][y] == 'S' || p[x][y] == 'E') t[x][y][k] = mp(x,y);
                else t[x][y][k] = t[tx][ty][k];
 
                if(p[x][y] == 'S') sx = x,sy = y;
                if(p[x][y] == 'E') ex = x,ey = y;
            }
        }
    }
 
    for(int i=0;i<=(n+1);++i){
        for(int j=0;j<=(m+1);++j){
            dis[i][j] = n*m+10;
        }
    }
    dis[sx][sy] = 0;
    Q.push(mp(sx,sy));
    while(!Q.empty()){
        int x = Q.front().fi,y=Q.front().se;
      //  printf("VIS(%d,%d)\n",x,y);
        Q.pop();
        for(int k=0;k<4;++k){
            int tx = t[x+dx[k]][y+dy[k]][k].fi;
            int ty = t[x+dx[k]][y+dy[k]][k].se;
            if(tx==0||ty==0)continue;
            if(dis[tx][ty]>dis[x][y]+1){
             //   printf("(%d,%d) jmp2 (%d,%d) dis = %d,k=%d\n",x,y,tx,ty,dis[tx][ty],k);
                dis[tx][ty]=dis[x][y]+1;
                from[tx][ty]=k;
                Q.push(mp(tx,ty));
            }
        }
    }
    int td = dis[ex][ey];
    if(td >n*m){
        puts("-1");
        return 0;
    }
    printf("%d\n",dis[ex][ey]);
    int nx = ex,ny = ey;
 
 
 
    while(td--){
     //   printf("%d %d\n",nx,ny);
       // printf("%c",d[from[nx][ny]]);
        //4-k <= go back
        ans.push_back(d[from[nx][ny]]);
        int tx = nx - dx[from[nx][ny]];
        int ty = ny - dy[from[nx][ny]];
     //   printf("t(%d %d) %d\n",tx,ty,3-from[nx][ny]);
     //   print(tx,ty,3-from[nx][ny]);
    //    printf("%d %d\n",t[tx][ty][3-from[nx][ny]].fi,t[tx][ty][3-from[nx][ny]].se);
        int tnx = nx,tny = ny;
        nx = t[tx][ty][3-from[tnx][tny]].fi;
        ny = t[tx][ty][3-from[tnx][tny]].se;
      //  printf("juuuump from %d %d\n",nx,ny);
    }
 
    for(int i=ans.size()-1;i>=0;--i){
        printf("%c",ans[i]);
    }
    printf("\n");
    return 0;
}
/*
3 3
S..
...
..E
 
3 3
SX.
XXX
XXE
 
2 2
SX
XE
 */

M：

# include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5+10;
char s[maxn];
int nxt[maxn][26];
int n;
char u[maxn];
int main(){
    scanf("%s",s+1);
    int l= strlen(s+1);
    int nowlas[26];
    for(int i=0;i<26;++i) nowlas[i] = -1;
    for(int i=l;i>=0;--i){
        for(int j=0;j<26;++j) nxt[i][j] = nowlas[j];
        nowlas[s[i]-'a'] = i;
    }
    scanf("%d",&n);
    while(n--){
        scanf("%s",u+1);
        int m = strlen(u+1);
        int nowpos = 0,prefix_length = 0;
        for(int i=1;i<=m;++i){
            nowpos = nxt[nowpos][u[i]-'a'];
            if(nowpos == -1){
                break;
            }
            else{
                printf("%c",u[i]);
                ++prefix_length;
            }
        }
        if(prefix_length == 0){
            printf("IMPOSSIBLE\n");
        }
        else printf("\n");
    }
    return 0;
}