Codeforces Round #317 [AimFund Thanks-Round] (Div. 2) B. Order Book


B. Order Book
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

In this task you need to process a set of stock exchange orders and use them to create order book.

An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy or sell, and integer qi. This means that the participant is ready to buy or sell qi stocks at price pi for one stock. A value qi is also known as a volume of an order.

All orders with the same price p and direction d are merged into one aggregated order with price p and direction d. The volume of such order is a sum of volumes of the initial orders.

An order book is a list of aggregated orders, the first part of which contains sell orders sorted by price in descending order, the second contains buy orders also sorted by price in descending order.

An order book of depth s contains s best aggregated orders for each direction. A buy order is better if it has higher price and a sell order is better if it has lower price. If there are less than s aggregated orders for some direction then all of them will be in the final order book.

You are given n stock exhange orders. Your task is to print order book of depth s for these orders.
Input

The input starts with two positive integers n and s (1 ≤ n ≤ 1000, 1 ≤ s ≤ 50), the number of orders and the book depth.

Next n lines contains a letter di (either 'B' or 'S'), an integer pi (0 ≤ pi ≤ 105) and an integer qi (1 ≤ qi ≤ 104) — direction, price and volume respectively. The letter 'B' means buy, 'S' means sell. The price of any sell order is higher than the price of any buy order.
Output

Print no more than 2s lines with aggregated orders from order book of depth s. The output format for orders should be the same as in input.
Sample test(s)
Input

6 2
B 10 3
S 50 2
S 40 1
S 50 6
B 20 4
B 25 10

Output

S 50 8
S 40 1
B 25 10
B 20 4

Note

Denote (x, y) an order with price x and volume y. There are 3 aggregated buy orders (10, 3), (20, 4), (25, 10) and two sell orders (50, 8), (40, 1) in the sample.

You need to print no more than two best orders for each direction, so you shouldn't print the order (10 3) having the worst price among buy orders.

跪在英文题意。。

题意: 对n个订购者,对卖家按降序输出小单价的s组结果;对买家按降序输出大单价的s组结果。相同单价的合并,若分别少于s组,则尽可能多输出。

思路:能看懂题意应该都能实现。

赛码

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#define min(a,b) (a>b?b:a)
#define max(a,b) (a>b?a:b)
#define CLR(arr,x) memset(arr,x,sizeof(arr))
using namespace std ;
const int maxn = 100000+10 ;
const int inf = 1<<30 ;
int init1[maxn] ,init2[maxn] ;
struct pm{
    int p ,q ;
};
pm ss[1100] , b[1100] ;
bool cmp(pm a, pm b) {
    if( a.p == b.p ) return a.q>b.q ;
    return a.p > b.p ;
}
int main() {
    int n , s ;
    while(~scanf("%d%d%*c",&n,&s)){
        CLR(init1,0) ;
        CLR(init2,0) ;
        char ch ;
        int temp1 , temp2 ;
        int num1 , num2 ;
        num1 = num2 = 0 ;
        for( int i = 0 ; i < n ; ++i ) {
            scanf("%c",&ch) ;
            if( ch == 'B' ) {
                scanf("%d %d",&temp1,&temp2)  ;
                init1[temp1] +=temp2 ;
                ss[num1].p = temp1 ;
                ss[num1].q = init1[temp1] ;
                num1++;
            }
            else {
                scanf("%d %d",&temp1,&temp2)  ;
                init2[temp1] +=temp2 ;
                b[num2].p = temp1 ;
                b[num2].q = init2[temp1] ;
                num2++;
            }
            getchar() ;
        }

        ss[num1].p = ss[num1].q = -1 ;
        sort(b,b+num2,cmp) ;
        sort(ss,ss+num1,cmp) ;
        int temp3 = -1 , numm = 0,numm1 = 0 ,wz;
        for(  wz = num2-1; wz >=0&&numm1<s+1 ; --wz){
            if( b[wz].p != temp3 ) { temp3 = b[wz].p ; numm1++; }
        }
        if(wz == -1 && (numm1 != (s+1)) ) wz = 0 ;
        else if(numm1 == s+1 ) {wz = wz+2 ;}
        temp3 = -1 ;
        for( int i = wz ; i < num2  && numm < s; ++i ) {
                if( (b[i].p!=temp3)&&(b[i].p!=-1) ){
            printf("S %d %d\n",b[i].p,b[i].q) ;
                    temp3 = b[i].p ;
                    numm++;
                }
        }
        temp3 = -1 , numm = 0 ;
        for( int i = 0 ; i < num1  && numm < s; ++i ) {
                if( (ss[i].p!=temp3)&&(ss[i].p!=-1) ){
            printf("B %d %d\n",ss[i].p,ss[i].q) ;
                    temp3 = ss[i].p ;
                    numm++;
                }
        }

    }
    return 0 ;
}





  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
目标检测(Object Detection)是计算机视觉领域的一个核心问题,其主要任务是找出图像中所有感兴趣的目标(物体),并确定它们的类别和位置。以下是对目标检测的详细阐述: 一、基本概念 目标检测的任务是解决“在哪里?是什么?”的问题,即定位出图像中目标的位置并识别出目标的类别。由于各类物体具有不同的外观、形状和姿态,加上成像时光照、遮挡等因素的干扰,目标检测一直是计算机视觉领域最具挑战性的任务之一。 二、核心问题 目标检测涉及以下几个核心问题: 分类问题:判断图像中的目标属于哪个类别。 定位问题:确定目标在图像中的具体位置。 大小问题:目标可能具有不同的大小。 形状问题:目标可能具有不同的形状。 三、算法分类 基于深度学习的目标检测算法主要分为两大类: Two-stage算法:先进行区域生成(Region Proposal),生成有可能包含待检物体的预选框(Region Proposal),再通过卷积神经网络进行样本分类。常见的Two-stage算法包括R-CNN、Fast R-CNN、Faster R-CNN等。 One-stage算法:不用生成区域提议,直接在网络中提取特征来预测物体分类和位置。常见的One-stage算法包括YOLO系列(YOLOv1、YOLOv2、YOLOv3、YOLOv4、YOLOv5等)、SSD和RetinaNet等。 四、算法原理 以YOLO系列为例,YOLO将目标检测视为回归问题,将输入图像一次性划分为多个区域,直接在输出层预测边界框和类别概率。YOLO采用卷积网络来提取特征,使用全连接层来得到预测值。其网络结构通常包含多个卷积层和全连接层,通过卷积层提取图像特征,通过全连接层输出预测结果。 五、应用领域 目标检测技术已经广泛应用于各个领域,为人们的生活带来了极大的便利。以下是一些主要的应用领域: 安全监控:在商场、银行
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值