hdu5353

模拟，，，

每个人有一些糖果，每两个人之间只能给一个糖果，问最后是否能让所有人的糖果数量相同，只要确定一个糖果的流向其他的就能够确定。

马虎了，卡了好几天，心塞塞的。。。

#include<iostream>

#include<string.h>

#include<stdio.h>

using namespace std;

const int maxa = ;

int biaoji[maxa];

int vis[maxa];

int put[maxa][];

int ans(int a[], int n){

    int sta;

    int o = ;

    for(int i =;i < n; i++){

        if(a[i] > ){

            sta = i;

            break;

        }

    }

    memset(vis, , sizeof(vis));

    int len = ;

    int last = ;

    for(int k = sta;; k++){

        if(len++ > n*) break;

        int i = k % n;

        if(vis[i] == ){

            last = ;

            continue;

        }

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            last = ;

            put[o][] = i;

            put[o++][] = (i+)%n;

            vis[i] = ;

            a[i] --, a[(i+)%n] ++;

        }else if(a[i] < ) last = ;

    }

    /*for(int i =0 ;i < n; i++){

        printf("%d ", a[i]);

    }puts("");*/

    len = ;

    last = ;

    for(int i = sta; ; i--){

        i = (i%n+n*)%n;

        if(len++ > n*) break;

        if(vis[(i+n-)%n] == )continue;

        if(a[i] > ){

            put[o][] = i;

            put[o++][] = (i+n-)%n;

            vis[(i+n-)%n] = ;

            a[i] --;

            a[(i-+n)%n] ++;

        }

    }

    for(int i = ;i < n; i++){

        if(a[i] != ) return ;

    }

    puts("YES");

    printf("%d\n", o);

    for(int i = ;i  < o; i++){

        printf("%d %d\n", put[i][]+, put[i][]+);

    }return ;

}

int ans1(int a[], int n){

    int sta;

    int o = ;

    for(int i =;i < n; i++){

        if(a[i] > ){

            sta = i;

            break;

        }

    }

    memset(vis, , sizeof(vis));

    int len = ;

    int last = ;

    for(int i = sta; ; i--){

        i = (i%n+n)%n;

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(len++ > n*) break;

        if(vis[(i+n-)%n] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            put[o][] = i;

            put[o++][] = (i+n-)%n;

            vis[(i+n-)%n] = ;

            a[i] --;

            a[(i-+n)%n] ++;

        }else if(a[i] < ){

            last = ;

        }

    }

    /*for(int i =0 ;i < n; i++){

        printf("%d ", a[i]);

    }puts("");*/

    len = ;

    last = ;

    for(int k = sta;; k++){

        if(len++ > n*) break;

        int i = k % n;

        if(vis[i] == )continue;;

        if(a[i] > ){

            last = ;

            put[o][] = i;

            put[o++][] = (i+)%n;

            vis[i] = ;

            a[i] --, a[(i+)%n] ++;

        }

    }

    for(int i = ;i < n; i++){

        if(a[i] != ) return ;

    }

    puts("YES");

    printf("%d\n", o);

    for(int i = ;i  < o; i++){

        printf("%d %d\n", put[i][]+, put[i][]+);

    }return ;

}

int a[maxa], b[maxa], c[maxa];

int main(){

    int t;

    scanf("%d", &t);

    while(t--){

        memset(biaoji, , sizeof(biaoji));

        int n;

        scanf("%d", &n);

        long long sum = ;

        int ok = ;

        for(int i = ;i < n; i++){

            scanf("%d", &a[i]);

            sum += a[i];

        }

        for(int i = ; i < n; i++){

            if(a[i] != a[i-]){

                ok = ;

                break;

            }

        }

        int ook = ;

        for(int i = ;i  < n; i++){

            b[i] = a[i] - sum/n;

            c[i] = b[i];

            if(c[i] > )biaoji[i] = ;

            else biaoji[i] = ;

            if(b[i] >  || b[i] < -) ook =;

        }

        if(ok == ){

            puts("YES\n0");

            continue;

        }

        if(sum % n !=  || ook){

            puts("NO");

            continue;

        }

        if(ans(b, n));

        else if(ans1(c, n));

        else puts("NO");

    }

}

/*

5

6

2 0 0  2 0 2

8

3 0 0 3 0 2 0 0

8

3 0 0 3 0 0 2 0

8

0 0 3 3 0 0 2 0

8

1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000001

*/

这是a过后花了二十分钟敲的不那么丑但依旧很丑的代码

#include<iostream>

#include<stdio.h>

#include<string.h>

using namespace std;

const int maxa = ;

int put[maxa][], vis[maxa];

int ans(int n, int a[]){

    int sta= ;

    for(int i = ;i < n; i++){

        if(a[i] > ){

            sta = i;

        }

    }

    memset(vis, , sizeof(vis));

    int len = , last = , o = ;

    for(int i = sta; ;i++){

        i = i%n;

        if(len++ > *n) break;

        if(vis[i] == ){

             last= ;

             continue;

        }

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            vis[i] = ;

            a[i] --, a[(i+)%n] ++;

            put[o][] = i;

            put[o][] = (i+)%n;

            o++;

        }else if(a[i] < ){

            last = ;

        }

    }

    len = , last = ;

    for(int i = sta; ; i--){

        i = (i+n)%n;

        if(len++ > n*) break;

        if(vis[(i+n-)%n] == ){

            last = ;

            continue;;

        }

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            vis[(i+n-)%n] = ;

            a[i] --, a[(i+n-)%n] ++;

            put[o][] = i;

            put[o][] = (i+n-)%n;

            o++;

        }else if(a[i] < ) last = ;

    }

    for(int i = ; i< n; i++){

        if(a[i]) return ;

    }

    puts("YES");

    printf("%d\n", o);

    for(int i =  ;i < o; i++){

        printf("%d %d\n", +put[i][], +put[i][]);

    }

    return ;

}

int ans1(int n, int a[]){

    int sta= ;

    for(int i = ;i < n; i++){

        if(a[i] > ){

            sta = i;

        }

    }

    memset(vis, , sizeof(vis));

    int len = , last = , o = ;

    for(int i = sta; ; i--){

        i = (i+n)%n;

        if(len++ > n*) break;

        if(vis[(i+n-)%n] == ){

            last = ;

            continue;;

        }

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            vis[(i+n-)%n] = ;

            a[i] --, a[(i+n-)%n] ++;

            put[o][] = i;

            put[o][] = (i+n-)%n;

            o++;

        }else if(a[i] < ) last = ;

    }

    len = , last = ;

    for(int i = sta; ;i++){

        i = i%n;

        if(len++ > *n) break;

        if(vis[i] == ){

             last= ;;continue;

        }

        if(last ==  && a[i] == ){

            last = ;

            continue;

        }

        if(a[i] > ){

            vis[i] = ;

            a[i] --, a[(i+)%n] ++;

            put[o][] = i;

            put[o][] = (i+)%n;

            o++;

        }else if(a[i] < ){

            last = ;

        }

    }

    for(int i = ; i< n; i++){

        if(a[i]) return ;

    }

    puts("YES");

    printf("%d\n", o);

    for(int i =  ;i < o; i++){

        printf("%d %d\n", +put[i][], +put[i][]);

    }

    return ;

}

int a[maxa], b[maxa], c[maxa];

int main(){

    int n, t;

    scanf("%d", &t);

    while(t--){

        scanf("%d", &n);

        long long sum = ;

        for(int i = ;i < n; i++){

            scanf("%d", &a[i]);

            sum += a[i];

        }

        if(sum % n){

            puts("NO"); continue;

        }

        for(int i = ;i < n; i++){

            b[i] = a[i] - sum /n;

            c[i] = b[i];

        }

        if(ans(n, b)) ;

        else if(ans1(n, c));

        else puts("NO");

    }

}

hdu5353的更多相关文章

hdu5353 Average(模拟)
转载请注明出处: http://www.cnblogs.com/fraud/ ——by fraud Average Time Limit: 4000/2000 MS (Java/Ot ...
hdu5353 Average
Problem Description There are n soda sitting around a round table. soda are numbered from 1 to n and ...
2015 多校联赛 ——HDU5353（构造）
Each soda has some candies in their hand. And they want to make the number of candies the same by do ...
[hdu5353]模拟
题意:有n个小朋友,每个小朋友手上有一些糖,考虑每两个相邻的小朋友a.b,可以选择执行3种操作中的任一种:(1)a给b一粒糖(2)b给a一粒糖(3)不进行任何动作,问能否通过确定每两个相邻的小朋友的操 ...

随机推荐

php 求两个文件的相对路径
网上看了一些这个题的一些解答方法,不过大多数就是对目前需求而定的,比如 $a = '/a/b/c/d/e.php'; $b = '/a/d/12/34/c.php'; getpath($a , $b ...
BOM头问题
最近有不少在微博上谈论BOM头问题,BOM头会造成页面展示的乱码,xml分析出现问题.而我恰巧遇到一种情况,在wml页面中如果加上BOM头,PC浏览器(IE,火狐)和手机浏览器(UC)都很正常,而如果 ...
64位系统中开启32位应用，特别是OLEDB
IIS7 - Running 32-bit and 64-bit ASP.NET versions at the same time on different worker processes IIS ...
【结构型】Composite模式
组合模式意在将对象组合成树形结构以表示部分与整体的层次结构关系,并且用户对单个对象的操作以有对组合对象的操作都是一致的.即:组合对象 is-a 单个对象,同时又可以组合着 n 个的单个对象(甚至于其他 ...
PE文件结构整理
一直想做一个PE结构的总结,只是学的时候有很多东西就没搞懂,加上时间一长,很多知识也早忘了,也就一直没完成.这几天从头看了下,好不容易理清楚了,整理一下,以免又忘了 pe文件框架结构,图片贴过来太模糊 ...
T-SQL表联接查询
由于实践不足,总是忘记SQL Server 联接表查询的细节,在这里记录以便查询. 一.交叉联接交叉联接仅执行一个罗辑查询处理阶段——笛卡尔积.也就是说,将一个输入表的每一行与另一个表的所有行匹配. ...
the smallest positive number
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any rema ...
android中使用PopupWindow实现弹出窗口菜单
结合上篇android中使用ViewPager实现图片拖动,我们实现了点击“帮助”按钮的功能,这一篇则是接着上一篇,让我们一起来完成“我的”按钮的功能,这一功能,则是使用PopupWindow来实现弹 ...
ss命令,显示socket状态
ss命令用于显示socket状态. 他可以显示PACKET sockets, TCP sockets, UDP sockets, DCCP sockets, RAW sockets, Unix dom ...
ORACLE_CLASS_ENDING
[JSU]LJDragon's Oracle course notes In the first semester, junior year Oracle考前复习试题结构分析: 1.选择题2x10, ...

hdu5353

hdu5353的更多相关文章

随机推荐

热门专题