[Offer收割]编程练习赛37

热门号码

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
using std::vector;
using std::queue;
using std::map;
using std::sort;
int cmp(const void * x, const void * y) {
    //x < y
#define datatype int
    return (*((datatype *)(x))) > (*((datatype *)(y))) ?  : -;
#undef datatype
}
map<long long, int> mp;
char str[];
const int num[] = {, , , , , , , , , , , , , , , , , , , , , , , , , };
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    int n, m, l;
    scanf("%d%d", &n, &m);
    for (int i = ; i < n; i++) {
        scanf("%s", str);
        l = strlen(str);
        long long tmp = ;
        for (int j = ; j < l; j++) {
            tmp = tmp *  + num[str[j] - 'A'];
        }
        mp[tmp]++;
    }
    for (int i = ; i < m; i++) {
        long long tmp;
        scanf("%lld", &tmp);
        printf("%d\n", mp[tmp]);
    }
    return ;
}

三角形面积和

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
using std::vector;
using std::queue;
using std::map;
using std::sort;
#define read(x) scanf("%d",&x)
struct point {
    int x, y;
};
int cmp(const void * x, const void * y) {
#define datatype point
    datatype dx = *((datatype *)(x)), dy = *((datatype *)(y));
    //x < y
    return dx.x - dx.y > dy.x - dy.y ?  : -;
#undef datatype
}

point p[];
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    int n;
    read(n);
    for (int i = ; i < n; i++) {
        read(p[i].x);
        read(p[i].y);
    }
    qsort(p, n, sizeof(point), cmp);
    double ans = ;
    int ptr = ;
    while (ptr < n) {
        double a = p[ptr].x + p[ptr].y;
        int j;
        bool find = false;
        for (j = ptr + ; j < n; j++) {
            if (p[j].x + p[j].y <= a) continue;
            if (p[j].x - p[j].y >= p[ptr].x + p[ptr].y) {
                ans += p[ptr].y * p[ptr].y;
                find = true;
                break;
            }
            double b = p[j].y - p[j].x;
            ans += p[ptr].y * p[ptr].y - (a + b) * (a + b) / ;
            find = true;
            break;
        }
        if (!find) ans += p[ptr].y * p[ptr].y;
        ptr = j;
    }
    printf("%.2lf\n", ans);
    return ;
}

最少换乘

其实很简单，但是最多50w个站编号却是1-500w，这就是map牛逼的地方了呀。

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
using std::vector;
using std::queue;
using std::map;
using std::sort;
#define read(x) scanf("%d",&x)
struct point {
    int x, y;
};
int cmp(const void * x, const void * y) {
#define datatype point
    datatype dx = *((datatype *)(x)), dy = *((datatype *)(y));
    //x < y
    return dx.x - dx.y > dy.x - dy.y ?  : -;
#undef datatype
}
map<int, int> mp;
vector<int> G[], H[];
int k[], d[];
bool fw[], fs[];
queue<int> q;
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    int n, s, e, p, cnt = ;
    read(n);
    read(s);
    read(e);
    for (int i = ; i < n; i++) {
        read(k[i]);
        for (int j = ; j < k[i]; j++) {
            read(p);
            G[i].push_back(p);
            if (mp.find(p) == mp.end()) {
                mp[p] = cnt++;
            }
            H[mp[p]].push_back(i);
        }
    }
    memset(d, 0x3F, sizeof(d));
    while (!q.empty()) q.pop();
    memset(fw, false, sizeof(fw));
    memset(fs, false, sizeof(fs));
    int mps = mp[s];
    for (int i = ; i < H[mps].size(); i++) {
        d[H[mps][i]] = ;
        q.push(H[mps][i]);
        fw[H[mps][i]] = true;
    }
    while (!q.empty()) {
        int x = q.front();
        q.pop();
        for (int i = ; i < G[x].size(); i++) {
            int v = G[x][i];
            int mpv = mp[v];
            if (fs[mpv]) continue;
            fs[mpv] = true;
            for (int j = ; j < H[mpv].size(); j++) {
                int w = H[mpv][j];
                if (fw[w]) continue;
                if (d[w] > d[x] + ) {
                    d[w] = d[x] + ;
                    fw[w] = true;
                    q.push(w);
                }
            }
        }
    }
    int ans = 0x3FFFFFFF;
    int mpe = mp[e];
    for (int i = ; i < H[mpe].size(); i++) {
        if (d[H[mpe][i]] < ans) ans = d[H[mpe][i]];
    }
    printf("%d\n",ans);
    return ;
}

完美命名的烦恼

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<string>
using std::vector;
using std::queue;
using std::map;
using std::sort;
using std::string;
#define read(x) scanf("%d",&x)
#define reads(x) scanf("%s",x)

int cmp(const void * x, const void * y) {
#define datatype int
    datatype dx = *((datatype *)(x)), dy = *((datatype *)(y));
    //x < y
    return dx > dy ?  : -;
#undef datatype
}

char str[];
map<string, int> mp;
vector<int> G[];
vector<bool> v[];
string sg[];
int din[], dout[], m = ;
char ans[];
void dfs(int x) {
    for (int i = ; i < G[x].size(); i++) {
        if (v[x][i]) continue;
        v[x][i] = true;
        dfs(G[x][i]);
    }
    ans[m++] = sg[x][sg[x].size() - ];
}
int main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    int n, cnt = , s = -, e = -;
    bool flag = false;
    read(n);
    for (int i = ; i <  * n; i++) G[i].clear();
    for (int i = ; i < n; i++) {
        reads(str);
        int len = strlen(str);
        if (len == ) {
            printf("%s", str);
            flag = true;
            continue;
        }
        string s(str);
        string sl = s.substr(, len - );
        string sr = s.substr(, len);
        if (mp.find(sl) == mp.end()) {
            mp[sl] = cnt;
            sg[cnt] = sl;
            cnt++;
        }
        if (mp.find(sr) == mp.end()) {
            mp[sr] = cnt;
            sg[cnt] = sr;
            cnt++;
        }
        int mpl = mp[sl], mpr = mp[sr];
        G[mpl].push_back(mpr);
        v[mpl].push_back(false);
        dout[mpl]++, din[mpr]++;
    }
    if (flag) return ;
    for (int i = ; i < cnt; i++) {
        if (din[i] == dout[i]) continue;
        if (din[i] - dout[i] >  || dout[i] - din[i] > ) {
            printf("NO\n");
            return ;
        }
        if (din[i] - dout[i] == ) {
            if (e == -) e = i;
            else {
                printf("NO\n");
                return ;
            }
        }
        if (dout[i] - din[i] == ) {
            if (s == -) s = i;
            else {
                printf("NO\n");
                return ;
            }
        }
    }
    if (s == -) s = ;
    dfs(s);
    for (int i = sg[s].size() - ; i >= ; i--) ans[m++] = sg[s][i];
    for (int i = m - ; i >= ; i--) printf("%c", ans[i]);
    return ;
}