牛客多校第三场C题

版权声明:转就转吧~~记得声明噢~~ https://blog.csdn.net/Soul_97/article/details/81227521

链接:https://www.nowcoder.com/acm/contest/141/C
来源:牛客网
 

题目描述

Eddy likes to play cards game since there are always lots of randomness in the game. For most of the cards game, the very first step in the game is shuffling the cards. And, mostly the randomness in the game is from this step. However, Eddy doubts that if the shuffling is not done well, the order of the cards is predictable!

To prove that, Eddy wants to shuffle cards and tries to predict the final order of the cards. Actually, Eddy knows only one way to shuffle cards that is taking some middle consecutive cards and put them on the top of rest. When shuffling cards, Eddy just keeps repeating this procedure. After several rounds, Eddy has lost the track of the order of cards and believes that the assumption he made is wrong. As Eddy's friend, you are watching him doing such foolish thing and easily memorizes all the moves he done. Now, you are going to tell Eddy the final order of cards as a magic to surprise him.

Eddy has showed you at first that the cards are number from 1 to N from top to bottom.

For example, there are 5 cards and Eddy has done 1 shuffling. He takes out 2-nd card from top to 4-th card from top(indexed from 1) and put them on the top of rest cards. Then, the final order of cards from top will be [2,3,4,1,5].

输入描述:

The first line contains two space-separated integer N, M indicating the number of cards and the number of shuffling Eddy has done.
Each of following M lines contains two space-separated integer pi, si indicating that Eddy takes pi-th card from top to (pi+si-1)-th card from top(indexed from 1) and put them on the top of rest cards.


1 ≤ N, M ≤ 105
1 ≤ pi ≤ N
1 ≤ si ≤ N-pi+1

输出描述:

Output one line contains N space-separated integers indicating the final order of the cards from top to bottom.

示例1

输入

复制

5 1
2 3

输出

复制

2 3 4 1 5

示例2

输入

复制

5 2
2 3
2 3

输出

复制

3 4 1 2 5

示例3

输入

复制

5 3
2 3
1 4
2 4

输出

复制

3 4 1 5 2

 

题意:给你n张纸牌  顺序是从1 到 n ,1在最上面  n在最底下,有m中操作,给你一个区间 p到s  一次操作抽走 p到p+s-1这个区间的所有纸牌  放到最上面,问你最后的顺序

分析:开始想了几个方法都不行,最后字符串模拟,依然超时,赛后听大佬说是用平衡树  

emmmmmm  不会平衡树,倒是学了一给俏皮的东西,STL里面封装好的平衡树  

#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
typedef long long ll;
const int N = 1e5 + 5;

rope<int> t;
int n, m;
int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i ++)
        t.push_back(i);
    while(m --)
    {
        int p, s;
        cin >> p >>s;
        p --;
        
        t = t.substr(p,s) + t.substr(0,p) + t.substr(p+s,n-p-s);
    }
    for(int i = 0;i < n;i ++)
        cout << t.at(i) << " ";
    return 0;
}

 

展开阅读全文

没有更多推荐了,返回首页