UVA - 1591 Data Mining
来源:互联网 发布:匡恩网络最新动态 编辑:程序博客网 时间:2024/05/17 07:26
Dr. Tuple is working on the new data-mining application for Advanced Commercial Merchandise Inc. One of the subroutines for this application works with two arrays P and Q containing N records of data each (records are numbered from 0 to N - 1). Array P contains hash-like structure with keys. ArrayP is used to locate record for processing and the data for the corresponding record is later retrieved from the array Q.
All records in array P have a size of SP bytes and records in array Q have size of SQ bytes. Dr. Tuple needs to implement this subroutine with the highest possible performance because it is a hot-spot of the whole data-mining application. However, SP and SQ are only known at run-time of application which complicates or makes impossible to make certain well-known compile-time optimizations.
The straightforward way to find byte-offset of i-th record in array P is to use the following formula:
However, multiplication computes much slower than addition or subtraction in modern processors. Dr. Tuple avoids usage of multiplication while scanning array P by keeping computed byte-offset Pofs(i) of i-th record instead of its index i in all other data-structures of data-mining application. He uses the following simple formulae when he needs to compute byte-offset of the record that precedes or follows i-th record in array P:
Whenever a record from array P is located by either scanning of the array or by taking Pofs(i) from other data structures, Dr. Tuple needs to retrieve information from the corresponding record in array Q. To access record in array Q its byte-offset Qofs(i) needs to be computed. One can immediately derive formula to compute Qofs(i) with known Pofs(i) from formulae (1) and (2):
Unfortunately, this formula not only contains multiplication, but also contains division. Even though only integer division is required here, it is still an order of magnitude slower than multiplication on modern processors. If coded this way, its computation is going to consume the most of CPU time in data-mining application for ACM Inc.
After some research Dr. Tuple has discovered that he can replace formula (3) with the following fast formula:
This formula is an order of magnitude faster than (3) to compute, but it generally cannot always produce the same result as (3) regardless of the choice for values of A and B. It still can be used if one is willing to sacrifice some extra memory.
Conventional layout of array Q in memory (using formula (2)) requires N . SQ bytes to store the entire array. Dr. Tuple has found that one can always choose such K that if he allocates K bytes of memory for the array Q (where KN . SQ) and carefully selects values for A and B, the fast formula (4) will give non-overlapping storage locations for each of the N records of array Q.
Your task is to write a program that finds minimal possible amount of memory K that needs to be allocated for array Q when formula (4) is used. Corresponding values for A and B are also to be found. If multiple pairs of values for A and B give the same minimal amount of memory K, then the pair where A is minimal have to be found, and if there is still several possibilities, the one where B is minimal. You shall assume that integer registers that will be used to compute formula (4) are wide enough so that overflow will never occur.
Input
Input consists of several datasets. Each dataset consists of three integer numbers N, SP , and SQ separated by spaces (1N220, 1SP210, 1SQ210).Output
For each dataset, write to the output a single line with three integer numbers K, A, and B separated by spaces.Sample Input
1024 7 1
Sample Output
1119 2 5
题目不太好理解,要深入多读几遍,要注意计算K的方法
实际上就是暴力,要注意A和B的暴力范围和K的初始值
#include <bits/stdc++.h>using namespace std;long long int n, sp, sq;int A, B;long long int getK(int a, int b){ return (((n-1)*sp + (((n-1)*sp)<<a)) >> b) + sq;}int main(){ while(cin >> n >> sp >> sq) { long long int k, mink = pow(2, 60); int a = 0, b = 0; for(A = 0; A<=31; A++) { for(B = 0; B<=31; B++) { k = getK(A, B); if(k < mink && k>=n*sq) mink = k, a = A, b = B; } } cout << mink << " " << a << " " << b << endl; } return 0;}
- UVA - 1591 Data Mining
- UVa 1591 Data Mining
- uva 1591 Data Mining
- UVA 1591(p99)----Data Mining
- UVa 1591 - Data Mining(暴力)
- UVA - 1591 Data Mining (考英语)
- 4-9 UVA 1591 Data Mining 数据挖掘
- 1591 - Data Mining
- Data Mining
- Data Mining
- Data Mining
- Data Mining
- DATA MINING
- DATA MINING(1) Data mining introduction
- What is Data Mining?
- DATA MINING 过程
- Data Mining Trends
- Data Mining资源大全
- GitHub详细教程
- EventBus初次使用
- Android 中关于SharedPreferences 操作模式的设置
- Ubuntu-校园网-神州数码客户端-ZDClient-连上后频繁掉线问题
- C++ Primer学习笔记2-变量与基本类型
- UVA - 1591 Data Mining
- Unity——UGUI之界面布局
- Kitkat小屏幕模式单手操作研究之缘起
- StringTokenizer类的使用
- c#字符串提供的各种方法
- Ajax乱码问题整理
- cocos2dx 3.X 中 json 文件生成与读取
- 以英语句子为例,去除每个句子的“停用词”,“标点”
- 【Unity Shaders】Alpha Test和Alpha Blending