kuangbin1（上）

最新推荐文章于 2018-08-26 23:53:25 发布
最新推荐文章于 2018-08-26 23:53:25 发布
阅读量868 收藏
点赞数 1
分类专栏： acm水题 文章标签： acm
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/JayWRZZ/article/details/61937455
版权

[kuangbin带你飞]专题一 简单搜索（上）

[A - 棋盘问题 POJ - 1321 ]

#include<cstdio>
#include<iostream>
#include<cstring>
#define CLR(a,v) memset(a,v,sizeof a)
using namespace std;
char mp[10][10];
int pos[100][2];
int co[10];
int ro[10];
int row,k;
int ge,sum;
void init(){
    ge = sum = 0;
    CLR(mp,0);
    CLR(pos,0);
    CLR(co,0);
    CLR(ro,0);
}

void input(){
    for(int i = 0; i < row; i++)for(int j = 0; j < row; j++){
        cin >> mp[i][j];
        if(mp[i][j] == '#'){pos[ge][0] = i,pos[ge++][1] = j;}
    }
}

void dfs(int i,int num){
    if(i >= ge)return;
    if(num>=k){sum++;return;}
    ro[pos[i][0] ]++;
    co[pos[i][1] ]++;
    for(int j = i+1; j < ge; j++){
        if(ro[pos[j][0] ] || co[pos[j][1] ])
            continue;
        dfs(j,num+1);
    }
    ro[pos[i][0] ]--;
    co[pos[i][1] ]--;
    return ;
}

int main(){
    while(cin >> row >> k && row+1){
        init();
        input();
        for(int i = 0; i <= ge - k; i ++){
            dfs(i,1);
        }
        cout << sum <<endl;
    }
    return 0;
}

[B - Dungeon Master POJ - 2251]

//多亏大神帮忙，才解决ML问题，visit的都应该标记一下。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#define CLR(a,v) memset(a,v,sizeof a)
using namespace std;
char mp[35][35][35];
bool vis[35][35][35];
int stx,sty,stz;
int h,row,col;
int dir[6][3] = {{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
struct Node{
    int x;
    int y;
    int z;
    int step;
};


void init(){
    CLR(mp,0);
    CLR(vis,0);
}
int bfs(int x, int y, int z, int step){
    queue<Node> a;
    a.push(Node{x,y,z,step});
    while(!a.empty()){
        Node e = a.front();a.pop();
        vis[e.x][e.y][e.z] = 1;
        for(int i = 0; i< 6; i++){
            int __x = e.x + dir[i][0];
            int __y = e.y + dir[i][1];
            int __z = e.z + dir[i][2];
            if(min(min(__x,__y),__z)<0 || __x >= h || __y >= row || __z >= col)
                continue;
            if(vis[__x][__y][__z])continue;
            else if(mp[__x][__y][__z] == '#')
                continue;
            else if(mp[__x][__y][__z] == 'E')
                return e.step+1;
            a.push(Node{__x, __y, __z, e.step+1});
            vis[__x][__y][__z] = 1;

        }
    }
    return 0;
}

int main(){
    while(cin >> h >> row >> col && h){
        init();
        for(int i = 0; i < h; i++)for(int j = 0; j < row; j++){
            scanf("%s",mp[i][j]);
            for(int k = 0; k < col; k++){
                if(mp[i][j][k] == 'S'){stx = i; sty = j; stz = k;}
            }
        }
        int a = bfs(stx,sty,stz,0);
        if(a) printf("Escaped in %d minute(s).\n",a);
        else cout << "Trapped!" << endl;
    }

    return 0;
}

[C - Catch That Cow POJ - 3278 ]

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
#define CLR(a,v) memset(a,v,sizeof a)
bool vis[210000];
using namespace std;
int n,to;
void init(){
    CLR(vis,0);
}
struct Node{
    int v;
    int s;
};

int bfs(int a){
    queue<Node> q;
    q.push((Node){a,0});
    if(a == to)return 0;
    while(!q.empty()){
        Node e = q.front();q.pop();
        if(vis[e.v])continue;
        vis[e.v] = 1;
        if(e.v == to)return e.s;
        if(e.v < 0)continue;
        q.push((Node){e.v-1,e.s+1});
        if(e.v >= 100000)continue;
        q.push((Node){e.v+1,e.s+1});
        if(e.v >= 51000)continue;
        q.push((Node){e.v*2,e.s+1});
    }
    return -1;
}

int main(){
    init();
    while(cin >> n >> to){
        cout << bfs(n) << endl;
    }
    return 0;
}

[D - Fliptile POJ - 3279 ]

#include<cstdio>
#include<iostream>
#include<cstring>
#define CLR(a,v) memset(a,v,sizeof a)
using namespace std;
bool mp[20][20];
bool ans[20][20];
bool temp[20][20];
bool anstemp[20][20];
int bu = 0;
long long flag = 1 << 29;
int n,m;
void fan(int a, int b){
    temp[a-1][b] = !temp[a-1][b];
    temp[a+1][b] = !temp[a+1][b];
    temp[a][b-1] = !temp[a][b-1];
    temp[a][b+1] = !temp[a][b+1];
    temp[a][b] = !temp[a][b];
}

void dfs(int hang){
    if(hang == n)return ;

    for(int i = 1; i <= m; i++)
        if(temp[hang][i] == 1){
            fan(hang+1,i);
            bu++;
            anstemp[hang+1][i]=1;
        }
    dfs(hang+1);
}

bool check(){
    for(int i = 1; i <= m; i++)
        if(temp[n][i])return 0;
    return 1;
}
void init(){
    CLR(mp,0);
    CLR(temp,0);
    CLR(ans,0);
    CLR(anstemp,0);
    flag = (1<<30);
}
int main(){
    while(cin >> n >> m && n){
        init();
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
                cin >> mp[i][j];
        for(int k = 0; k < (1<<m); ++k){
            CLR(anstemp,0);
            bu = 0;
            for(int i = 1; i <= n; i++)
                for(int j = 1; j <= m; j++)
                    temp[i][j] = mp[i][j];
            int time=0;
            for(int j = k; j > 0; j>>=1){
                time++;
                if(j%2){
                    fan(1,time);
                    anstemp[1][time] = 1;
                    bu++;
                }
            }
            dfs(1);
            if(!check())continue;
            if(bu > flag)continue;
            else if(bu < flag){
                flag = bu;
                for(int i = 1; i <= n; i++)
                    for(int j = 1; j <= m; j++)
                        ans[i][j] = anstemp[i][j];
            }
            else{
                int choose1 = 0;
                int choose2 = 0;
                for(int i = 1; i <= n; i++)
                    for(int j = 1; j <= m; j++){
                        if(!choose1){
                            if(ans[i][j]>anstemp[i][j]){choose1 = 1;choose2 = 1;}
                            else if(ans[i][j]<anstemp[i][j]) {choose1 = 1;}
                        }
                        if(choose2)ans[i][j] = anstemp[i][j];
                    }
            }
        }
        if(flag>(1 << 27)){cout <<"IMPOSSIBLE"<<endl;continue;}
        for(int i = 1; i <= n; i++){
            for(int j = 1; j < m; j++)
                printf("%d ",ans[i][j]);
            printf("%d\n",ans[i][m]);
        }
    }
    return 0;
}

[E - Find The Multiple POJ - 1426]

#include<cstdio>
#include<iostream>
int mod[1000000];//存放余数
int ans[110];
//mod[x]=(mod[x/2]*10+x%2)%n;

using namespace std;

int main(){
    int n,i,j,k;
    while(cin >> n && n){
        mod[1] = 1%n;
        for(i = 2; mod[i-1]!= 0; i++){
            mod[i] = (mod[i/2]*10 + i%2)%n;
        }
        k = 0;
        i--;
        while(i){
            ans[k++] = i%2;
            i/=2;
        }
        for(int j = k-1; j >= 0; j--){
            cout << ans[j];
        }
        cout << endl;
    }
    return 0;
}

[F - Prime PathPOJ - 3126]

#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
int biao[]={1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973};
bool prime[11000]={0};
using namespace std;
int endn,startn;
bool vis[11000];

struct node{
    int value;
    int num;
};

int bfs(int a){
    if(a == endn)return 0;
    memset(vis, 0, sizeof(vis));
    queue<node> Q;
    vis[a] = 1;
    Q.push((node){a,0});

    while(!Q.empty()){
        node e = Q.front(); Q.pop();
        for(int i = 1; i <= 1000; i *= 10)for(int j = 0; j < 10; j++){
            if(i == 1000 && j == 0) continue;
            int t = e.value/i/10*i*10 + i * j + e.value%i  ;//只改变一位数
            if (t == endn) return e.num+1;
            if (prime[t]){
                if(!vis[t])Q.push((node){t, e.num + 1});
                vis[t] = 1;
            }
        }
    }
    return -1;
}

int main(){
    for(int i = 0; biao[i]; i++)
        prime[biao[i]] = 1;
    int T;
    cin >> T;
    while(T--){
        cin >> startn >> endn;
        int ans = bfs(startn);
        if(ans+1) cout << ans << endl;
        else cout << "Impossible" << endl;
    }
    return 0;
}

[G - Shuffle’m UpPOJ - 3087]

[K - 迷宫问题 POJ - 3984]

#include<cstdio>
#include<iostream>
#include<cstring>
#include<queue>
#include<stack>
#define CLR(a,v) memset(a,v,sizeof a)

using namespace std;
int mp[6][6];
int xx[30];
int yy[30];
int vis[6][6];
int lens,flag;
int dir[4][2] ={{1,0},{-1,0},{0,1},{0,-1}};
void init(){
    CLR(mp,0);
    CLR(xx,0);
    CLR(yy,0);
    CLR(vis,0);
    lens = flag = 0;
}

struct Node{
    int x;
    int y;
    int step;
    Node *last;
};
queue<Node> a;
void bfs(int x, int y){
    a.push(Node{x,y,0,NULL});
    while(!a.empty()){
        Node e =a.front();a.pop();
        vis[e.x][e.y] = 1;
        if(e.x == 4 && e.y ==4){lens = e.step;return ;}
        xx[e.step] = e.x;
        yy[e.step] = e.y;
        for(int i = 0; i < 4; i++){
            int __x = e.x+dir[i][0];
            int __y = e.y+dir[i][1];
            if(__x<0||__y<0||__x>4||__y>4)continue;
            if(__x == 4 && __y ==4){lens = e.step;return ;}
            if(vis[__x][__y] == 1)continue;
            if(mp[__x][__y] == 1)continue;
            a.push(Node{__x,__y,e.step+1, &e});
        }
    }
}
int main(){
    init();
    for(int i = 0; i < 5; i++)for(int j = 0; j < 5; j++){
        cin >> mp[i][j];
    }
    bfs(0,0);
    for(int i = 0; i <= lens; i++)
        printf("(%d, %d)\n",xx[i],yy[i]);
    cout <<"(4, 4)" <<endl;
    return 0;
}

[M - 非常可乐 HDU - 1495]

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
struct Node{
    int y1,y2,y3;
    int step;
};
using namespace std;

int vis[110][110];

int n,m,k;
int bfs(int yu1,int yu2, int yu3){
    queue<Node> a;
    a.push((Node){yu1,yu2,yu3,0});
    while(!a.empty()){
        Node e = a.front();a.pop();
        if(vis[e.y1][e.y2])continue;
        vis[e.y1][e.y2] = 1;
        if(e.y1 == e.y2 && e.y1 == n/2)return e.step;
        if(e.y1 && e.y2<= m){
            int cha = m - e.y2;
            if(cha > e.y1){a.push((Node){0,e.y2+e.y1,e.y3,e.step+1});}
            else{a.push((Node){e.y1-cha,e.y2+cha,e.y3,e.step+1});}
        }
        if(e.y1 && e.y3<= k){
            int cha = k - e.y3;
            if(cha > e.y1){a.push((Node){0,e.y2,e.y3+e.y1,e.step+1});}
            else{a.push((Node){e.y1-cha,e.y2,e.y3+cha,e.step+1});}
        }
        if(e.y2 && e.y3<= k){
            int cha = k - e.y3;
            if(cha > e.y2){a.push((Node){e.y1,0,e.y3+e.y2,e.step+1});}
            else{a.push((Node){e.y1,e.y2-cha,e.y3+cha,e.step+1});}
        }
        if(e.y3 && e.y2<= m){
            int cha = m - e.y2;
            if(cha > e.y3){a.push((Node){e.y1,e.y2+e.y3,0,e.step+1});}
            else{a.push((Node){e.y1,e.y2+cha,e.y3-cha,e.step+1});}
        }
        if(e.y2){
            a.push((Node){e.y1+e.y2,0,e.y3,e.step+1});
        }
        if(e.y3){
            a.push((Node){e.y1+e.y3,e.y2,0,e.step+1});
        }

    }
    return -1;
}
void init(){
    memset(vis, 0, sizeof vis);
}
int main(){
    while(cin >> n >> m >> k &&(n||m||k)){
        init();
        if(n%2){cout <<"NO\n";continue;}
        if(n/2>max(m,k)){cout <<"NO\n";continue;}
        int bei1 = max(m,k);
        int bei2 = min(m,k);
        m = bei1;k = bei2;
        int a =bfs(n,0,0);
        if(a+1)cout << a << endl;
        else cout << "NO" << endl;
    }
    return 0;
}
小哧
关注
专栏目录
kuangbin 模板
09-08
kuangbin 模板
[kuangbin带你飞]专题十四 数论基础 （数论）（fmod）
hi_just_do_it的博客
01-14 630
这道题学会了两个函数的用法——
kuangbin的ACM模板（2018.7更新）
07-25
kuangbin说他之前的老模板有...本来这个东西是公开的免费的，但是上传资源积分至少1个，不支持免费分享。大家如果没有积分的话可以给我私信，我不忙的时候一定会发的~~~欢迎关注~~~~~~kuangbin的ACM模板（2018.7更新）
kuangbin的ACM模板（新）_模板_kuangbin_kuangbinacm_ACM_
09-29
《kuangbin的ACM模板（新）》是面向ACM（国际大学生程序设计竞赛）参赛者的一份宝贵的参考资料，由kuangbin分享并命名为"kuangbinacm"。这份模板聚焦于算法和数据结构的实践应用，尤其是动态规划和计算几何两大核心...
kuangbin的ACM模板（新）.pdf
11-15
Contents 1 字符串处理 5 1.1 KMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.2 e-KMP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
acm模板kuangbin
05-17
1. **输入处理**：Kuangbin模板会提供一个基础的输入处理框架，以快速读取数据。这通常涉及到C++中的`cin`或`scanf`，以及处理大型输入数据时的缓冲区优化，例如使用`ios_base::sync_with_stdio(false)`来禁用C++ I/...
我倒要看看你葫芦里装的是什么事药
JayWRZZ的博客
03-19 1813
我倒要看看你葫芦里装的是什么BClick me我倒要看看你葫芦里装的是什么B UVA11388 UVA11889 UVA10943 UVA10780 UVA10892 11752 UVA11076 11609 11609 UVA 12050 10791 UVAUVA11388#include<cstdio> #include<iostream>using namespace std;long lon
Acdreamer博客数论学习(1)
JayWRZZ的博客
07-24 950
Acdreamer博客数论学习Day One等比数列求和．求解Sn=(a+a2+...+an)modMS_n = (a+a^2+...+a^n)modM采用二分．n%2==0时 Sn=(1+a(n2))Sn2 S_n = (1+a^{(\frac{n}{2})} )S_{\frac{n}{2}} ,n%2==1时，Sn=(1+an+12)Sn−12+an+12S_n = (1+a^{\frac{n
kuangbin简单数论(上)
JayWRZZ的博客
03-24 813
kuangbin14数论简单题kuangbin14数论简单题 A - Bi-shoe and Phi-shoe C - Aladdin and the Flying Carpet E - Leading and Trailing F - Goldbachs Conjecture G - Harmonic Number II H - Pairs Forming LCM I - Harmonic Num
HDU 6445(竞赛图 + 网络流)
JayWRZZ的博客
08-26 798
题意： 给出一个n(&lt;=200)个节点的竞赛图， 计算图中所给的ans. 枚举四元组(a, b, c, d) , 四元组一共有3种情况: 1. 成环 ans ++, 也就是有向环组成的。 2. 不成环， ans不变， 也就是说有且仅有一个点的出度为2 3. 不成换，ans– , 拥有两个点出度为2. 一共有A(n, 4)种组合， 枚举每一个度数&gt;=2的点，对于其出度的...
三分学习 hdu 4454
JayWRZZ的博客
08-05 669
A - Stealing a Cake HDU - 4454本题可以枚举5000个点跑一下也能过.考虑三分的话,我们发现随着角度的变化,他一定是一个凹函数+一个凸函数, 我们分两段跑圆的三分,一段是[0,pi],一段是[pi,pi*2],.不违背三分.然后我想了一下,他肯定是一个凹函数+一个凸函数,一个函数都是由cosa,sina构成的,虽然有波折,但一定是有一个极大值,一个极小值.用我下面的二分是
HDU - 5976　　简单逆元
JayWRZZ的博客
08-14 648
首先预处理，分解为n位数至少要多大，然后upper_bound大概就知道拆分为几个数了． 然后考虑最优解，就是每位数劲量的大，因为是相乘，所以中间做多有一个空，我们记录中间空的位置和其实位置以及最后的位置就知道了答案． 前面的数的阶乘以及逆元可以预处理，阶乘的逆元也可以预处理．复制度在O(logn)#include<cstdio> #include<iostream> #include<algo
G - Dome of Circus UVALive - 4986 (三分)
JayWRZZ的博客
08-06 629
https://vjudge.net/contest/123097#problem/G 三分最后一题 其实看上去像一个三维问题,分分钟化成二维平面内的问题, 三分的是体积,我们只要比较r*r*h的大小就行, 下凸函数,自己画一下图感受一下就行了. 还是用斜率的角度走一下流程.#include<cstdio> #include<iostream> #include<cmath>const in
搜索入门
JayWRZZ的博客
03-05 601
搜索入门简单题:(┬＿┬)搜索入门简单题 hdu 1239 hdu 1010 hdu 1015  Safecracker hdu 1016 Prime Ring Problem POj 2488A - A Knights Journey POJ 3126 H - Prime Path hdu1035 hdu 1045 hdu 1172 hdu 1241水题练速度 第一道dfsdp hdu1078
kuangbin4(上)
JayWRZZ的博客
03-19 531
kuangbin4(上) kuangbin4上 A - Til the Cows Come Home POJ - 2387 B - Frogger POJ - 2253 C - Heavy Transportation POJ - 1797 D - Silver Cow PartyPOJ - 3268 E - Currency Exchange POJ - 1860 H - Cow Cont
堆　POJ - 2010 　优先队列 (错误二分)
JayWRZZ的博客
08-14 530
这是一道利用优先队列预处理的一道题． 网上有一些二分的题解，但是是错的． 对于每个中位数，我们对于其前面的n/2个数，并用优先队列预处理．size大于n/2时pop掉学费最贵的． 后n/2也是这么预处理的 最后只要到过来找第一个成立的即可，否则就是－１#include<cstdio> #include<iostream> #include<cstring> #include<queue> #
背包练习－混合背包 AreYouBusy HDU - 3535
JayWRZZ的博客
08-12 530
这是我wa了一道很久的背包题目． 关键点在于我错在了理解分组背包．本题有三种类型的集合．第一种是至少选择其中一个．关于至少选择一个的背包可以参考D - I love sneakers! HDU - 3033这道题目． 之多选择一个的背包．还有01背包．在处理这三种集合的时候我选择了分类，先处理了至少选择一个背包，他可以先预判断哪些是不可能的． 状态转移方程： dp[i][k]=max{ dp
第三章数组和字符串下
JayWRZZ的博客
02-22 509
第三章数组和字符串下(๑•ᴗ•๑)第三章数组和字符串下 Uva1368 DNA Consensus String UVa202 Repeating Decimals UVa 10340 All in All UVa 1587 Box UVa 1588 Kickdown UVa 11809 Floating-Point Numbers Uva1368 DNA Consensus String//一道典
探索ACM竞赛核心算法：kuangbin模板解析
1. ACM竞赛介绍： ACM国际大学生程序设计竞赛（ACM International Collegiate Programming Contest, 简称ACM-ICPC）是由国际计算机学界历史悠久、享有盛誉的国际大学生程序设计竞赛，主要考察学生使用计算机来充分...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值