CCF-CSP_201604(第7次)

1-折点计数

---

//水题
#include<iostream>
using namespace std;
const int maxn=10000;
int a[maxn];
int main(){
    int n,count=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        scanf("%d",&a[i]);
    for(int i=1;i<=n-2;i++)
        if((a[i]>a[i-1]&&a[i]>a[i+1])||(a[i]<a[i-1]&&a[i]<a[i+1]))
            count++;
    printf("%d\n",count);
    return 0;
}

2.俄罗斯方块

---

/* CCF201604-2 俄罗斯方块 */
 
#include <iostream>
 
const int ROW = 15;
const int COL = 10;
const int N = 4;
 
int board[ROW+1][COL];
int block[N][N];
struct {
    int row, col;
} coords[N];
 
using namespace std;
 
int main()
{
    int row, col;
 
    // 输入数据
    for(int i=0; i<ROW; i++)
        for(int j=0; j<COL; j++)
            cin >> board[i][j];
    for(int i=0; i<N; i++)
        for(int j=0; j<N; j++)
            cin >> block[i][j];
    cin >> col;
 
    // 底边全放1
    for(int j=0; j<COL; j++)
        board[ROW][j] = 1;
 
    // 提取小方块坐标
    int k = 0;
    for(int i=N-1; i>=0; i--)
        for(int j=0; j<N; j++)
            if(block[i][j] == 1) {
                coords[k].row = i;
                coords[k].col = j;
                k++;
            }
 
    // 模拟小方块落下过程
    row = 1;
    col--;
    bool checkflag;
    for(;;) {
        checkflag = false;
 
        for(int i=0; i<N; i++)
            if(board[row + coords[i].row][col + coords[i].col] == 1) {
                checkflag = true;
                break;
            }
 
        if(checkflag)
            break;
 
        row++;
    }
    row--;
 
    // 合并小方块到方格
    for(int i=0; i<N; i++)
        board[row + coords[i].row][col + coords[i].col] = 1;
 
    // 输出结果
    for(int i=0; i<ROW; i++) {
        for(int j=0; j<COL; j++) {
            if(j != 0)
                cout << " ";
            cout << board[i][j];
        }
        cout << endl;
    }
 
    return 0;
}

0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 1 0 0 
0 0 0 0 0 0 1 0 0 0 
0 0 0 0 0 0 1 0 0 0 
1 1 1 0 0 0 1 1 1 1 
0 0 0 0 1 0 0 0 0 0 
0 0 0 0 
0 1 1 1 
0 0 0 1 
0 0 0 0 
3

0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 0 0 0 
0 0 0 0 0 0 0 1 0 0 
0 0 0 0 0 0 1 0 0 0 
0 0 0 0 0 0 1 0 0 0 
1 1 1 1 1 1 1 1 1 1 
0 0 0 0 1 1 0 0 0 0 

3.路径解析

---

#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;

int main(){
    int p,flag;
    string s,t;
    
    scanf("%d",&p);
    getchar();//报错点，使用getline()函数前，去掉空白符
    getline(cin,s);//s:当前目录
    for(int i=1;i<=p;i++){
        getline(cin,t);//会读入换行符
        if(t.size()==0){//1.空字符串，正规化为当前目录
            t=s;
        }
        if(t[0]!='/'){  //2.相对路径,不以/符号开头，表示从当前目录开始构建的路径
            t=s+'/'+t;
        }
      
        while(t[t.length()-1]=='/'&&t.length()>1){
            t=t.substr(0,t.length()-1);  //去掉结尾的'/'
        }
        while((flag=(int)t.find("//"))!=-1){
            t.erase(flag,1);//去掉多余的'//'
        }
       
        while((flag=(int)t.find("/./"))!=-1){
            t.erase(flag,2); //.表示本目录
        }
        while((flag=(int)t.find("/../"))!=-1){//..表示上一级目录
            if(flag==0){//根目录为/，相对路径转换后开头为//../
                t.erase(flag,3);
            }else{
                 int count=4;
                 while(flag>=1&&t[flag-1]!='/'){
                     flag--;
                     count++;
                 }
                 t.erase(flag,count);
            }
        }
        cout<<t<<endl;
    }
}

7
/d2/d3
/d2/d4/f1
../d4/f1
/d1/./f1
/d1///f1
/d1/
///
/d1/../../d2
 
/d2/d4/f1
/d2/d4/f1
/d1/f1
/d1/f1
/d1
/
/d2

4.游戏

---

//bfs
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int N = 100;
const int DIRECTSIZE = 4;
struct node {
    int row, col, level;
};
struct direct {
    int drow, dcol;
} direct[DIRECTSIZE] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

int visited[N+1][N+1][300+1];
int n,m;

int bfs()
{
    node start;
    start.row = 1;
    start.col = 1;
    start.level = 0;
    
    queue<node> q;
    q.push(start);
    while(!q.empty()) {
        node front;
        front = q.front();
        q.pop();
       
        if(front.row == n && front.col == m)//到达终点则结束
            return front.level;
        
        for(int i=0; i<DIRECTSIZE; i++) {//四个方向移动一格
            node v;
            v.row = front.row + direct[i].drow;
            v.col = front.col + direct[i].dcol;
            v.level = front.level + 1;
            
            if(v.row < 1 || v.row > n || v.col < 1 || v.col > m) // 行列越界则跳过
                continue;
            if(visited[v.row][v.col][v.level]) // 已经访问过的点不再访问
                continue;
            
            q.push(v);
            visited[v.row][v.col][v.level] = 1;  // 向前搜索：标记v点为已经访问过，v点加入队列中
        }
    }
    
    return 0;
}

int main()
{
    int t, r, c, a, b;
    
    memset(visited, 0, sizeof(visited));
    cin >> n >> m >> t;             //行数、列数、方格图中有危险的方格数量 (1,1)->(m,n)
    for(int i=1; i<=t; i++) {        //(r,c)在(a,b)时刻危险
        cin >> r >> c >> a >> b;
        for(int j=a; j<=b; j++)     // 设置方格危险时间，使之那些时间不可进入
            visited[r][c][j] = 1;
    } 
    int ans = bfs();
    cout << ans << endl; //返回层数，即时间
    
    return 0;
}

3 3 3
2 1 1 1
1 3 2 10
2 2 2 10
 
6

5.无线网络

---