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の页面跳转-常见方法
PHP页面跳转一.header()函数 header()函数是PHP中进行页面跳转的一种十分简单的方法.header()函数的主要功能是将HTTP协议标头(header)输出到浏览器. header( ...
解决VS2013中“This function or variable may be unsafe”的问题
1.在VS2013中编译代码时出现如上错误信息,下面就介绍下如何解决This function or variable may be unsafe的问题. 2.用VS2013打开出现错误的代码文件 3 ...
简单DOS命令实现局域网Windows远程关机
1秒内重启局域网内计算机名为ppgsvr-pc的用户电脑shutdown -r -m \\ComputerName -t 1 1秒内关闭局域网内ppgsvr用户电脑shutdown -s -m \\C ...
(转)關於flashback query的ORA-01466錯誤
摘自:http://blog.sina.com.cn/s/blog_70a2bdb80100pqid.html 使用Oracle 10g 新特性flashback query來查詢過去修改並已提交的記 ...
Another Look at Events（再谈Events）
转载:http://www.qtcn.org/bbs/simple/?t31383.html Another Look at Events(再谈Events) 最近在学习Qt事件处理的时候发现一篇很不 ...
说说自己对RESTful API的理解s
REST不是英文上的rest单词,其英文缩写为presentational State Transfer ,直译为表现状态转移,咋看起来很学术,不懂,其实不用去死抠这个词的意思.REST是一种约束和架 ...
8.2.1.2 How MySQL Optimizes WHERE Clauses MySQL 优化WHERE 子句
8.2.1.2 How MySQL Optimizes WHERE Clauses MySQL 优化WHERE 子句本节讨论优化用于处理WHERE子句, 例子是使用SELECT 语句,但是相同的优化 ...
HDU_2016——数据的交换输出
Problem Description 输入n(n<100)个数,找出其中最小的数,将它与最前面的数交换后输出这些数. Input 输入数据有多组,每组占一行,每行的开始是一个整数n,表示这 ...
HDU4432 Sum of Divisors
涉及知识点: 1. 进制转换. 2. 找因子时注意可以降低复杂度. Sum of divisors Time Limit: 2000/1000 MS (Java/Others) Memory L ...
cocos 的CCScheduler模块
scheduleSelector函数->查找m_pHashForTimers是否有存储回调的Obj类实例,否,创建新条目tHashTimerEntry,指向回调类实例,tHashTimerEnt ...

hdu5353

hdu5353的更多相关文章

随机推荐

热门专题