• CodeForces


    CodeForces - 344A
    Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

     Status

    Description

    Mad scientist Mike entertains himself by arranging rows of dominoes. He doesn't need dominoes, though: he uses rectangular magnets instead. Each magnet has two poles, positive (a "plus") and negative (a "minus"). If two magnets are put together at a close distance, then the like poles will repel each other and the opposite poles will attract each other.

    Mike starts by laying one magnet horizontally on the table. During each following step Mike adds one more magnet horizontally to the right end of the row. Depending on how Mike puts the magnet on the table, it is either attracted to the previous one (forming a group of multiple magnets linked together) or repelled by it (then Mike lays this magnet at some distance to the right from the previous one). We assume that a sole magnet not linked to others forms a group of its own.

    Mike arranged multiple magnets in a row. Determine the number of groups that the magnets formed.

    Input

    The first line of the input contains an integer n (1 ≤ n ≤ 100000) — the number of magnets. Then n lines follow. The i-th line (1 ≤ i ≤ n) contains either characters "01", if Mike put the i-th magnet in the "plus-minus" position, or characters "10", if Mike put the magnet in the "minus-plus" position.

    Output

    On the single line of the output print the number of groups of magnets.

    Sample Input

    Input
    6
    10
    10
    10
    01
    10
    10
    
    Output
    3
    
    Input
    4
    01
    01
    10
    10
    
    Output
    2
    

    Hint

    The first testcase corresponds to the figure. The testcase has three groups consisting of three, one and two magnets.

    The second testcase has two groups, each consisting of two

    题意:依照顺序给你一个个磁铁,以及他们放置的位置:

    比方说输入了01,10,01。10,10

    则形成的排放为01 10 01 10 10。当中同性相斥,异性相吸,相吸的会连在一起形成一个快。如此。题目要求出有多少个块。


    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <vector>
    #include <queue>
    using namespace std;
    #define lson rt << 1, l, mid
    #define rson rt << 1|1, mid + 1, r
    #define root 1, 1, N
    const int MAXN = 5e4 + 5;
    char op[2][5];
    int n;
    int main() {
        scanf("%d", &n);
        int cnt = 0;
        for(int i = 0 ; i < n ; i ++) {
            scanf("%s", op[0]);
            if(i == 0) {
                cnt ++;
                strcpy(op[1], op[0]);
                continue;
            }
            bool flag = true;
            if(op[1][0] - op[0][1] != 0) {
                flag = false;
            }
            strcpy(op[1], op[0]);
            if(flag) cnt ++;
        }
        printf("%d
    ", cnt);
        return 0;
    }
    


  • 相关阅读:
    java课程之团队开发冲刺阶段1.10
    java课程之团队开发冲刺阶段1.9
    java课程之团队开发之用户模板和用户场景
    大二第二学期周学习进度总结(八)
    java课程之团队开发冲刺阶段1.8
    java课程课后作业190425之一维数组最大子数组—功能扩展(界面实现)
    java课程之团队开发冲刺阶段1.7
    java课程之团队开发冲刺阶段1.6
    Python函数-高级(闭包/装饰器)
    Python之函数
  • 原文地址:https://www.cnblogs.com/clnchanpin/p/7088762.html
Copyright © 2020-2023  润新知