hdu 5734 (2016 Multi-University Training Contest 2)
来源:互联网 发布:mac用户头像更改 编辑:程序博客网 时间:2024/06/05 17:30
Acperience
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 493 Accepted Submission(s): 264
Problem Description
Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as Convolutional Neural Networks (CNN), have demonstrated state-of-the-art results in object recognition and detection.
Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus), augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.
In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.
More specifically, you are given a weighted vectorW=(w1,w2,...,wn) . Professor Zhang would like to find a binary vector B=(b1,b2,...,bn) (bi∈{+1,−1}) and a scaling factor α≥0 in such a manner that ∥W−αB∥2 is minimum.
Note that∥⋅∥ denotes the Euclidean norm (i.e. ∥X∥=x21+⋯+x2n−−−−−−−−−−−√ , where X=(x1,x2,...,xn) ).
Convolutional neural networks show reliable results on object recognition and detection that are useful in real world applications. Concurrent to the recent progress in recognition, interesting advancements have been happening in virtual reality (VR by Oculus), augmented reality (AR by HoloLens), and smart wearable devices. Putting these two pieces together, we argue that it is the right time to equip smart portable devices with the power of state-of-the-art recognition systems. However, CNN-based recognition systems need large amounts of memory and computational power. While they perform well on expensive, GPU-based machines, they are often unsuitable for smaller devices like cell phones and embedded electronics.
In order to simplify the networks, Professor Zhang tries to introduce simple, efficient, and accurate approximations to CNNs by binarizing the weights. Professor Zhang needs your help.
More specifically, you are given a weighted vector
Note that
Input
There are multiple test cases. The first line of input contains an integer T , indicating the number of test cases. For each test case:
The first line contains an integersn (1≤n≤100000) -- the length of the vector. The next line contains n integers: w1,w2,...,wn (−10000≤wi≤10000) .
The first line contains an integers
Output
For each test case, output the minimum value of ∥W−αB∥2 as an irreducible fraction "p /q " where p , q are integers, q>0 .
Sample Input
341 2 3 442 2 2 255 6 2 3 4
Sample Output
5/10/110/1
Author
zimpha
Source
2016 Multi-University Training Contest 2
题意:给定一个向量W =(w1,w2...wn),一个向量B = {+1,-1},一个实数a > 0;求最小的 || W - aB ||。
分析:起初咋一看这题,恩...好大的数,是大数吧,再一看,恩...小数化分数,无限小数咋办!@#¥*&¥#.....最后,化简公式....AC.....扯犊子一样;
首先,因为 B 可为+ - 1,所以W - aB 要最小就相当于 | W | - a(w1,w2...wn的平均数),然后完全平方展开,得 wi^2 - 2*wi*a + a^2;
化简,(n*sum1 - sum2^2)/n ;sum1是W的平方和,sum2是W的和。呵呵....
#include <iostream>#include <cstdio>#include <cstring>#include <stack>#include <queue>#include <map>#include <set>#include <vector>#include <cmath>#include <algorithm>using namespace std;const double eps = 1e-6;const double pi = acos(-1.0);const int INF = 1e9;const int MOD = 1e9+7;#define ll long long#define CL(a,b) memset(a,b,sizeof(a))#define lson (i<<1)#define rson ((i<<1)|1)#define N 100010int n;ll x,sum1,sum2;double ww;int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d",&n); sum1 = sum2 = 0; for(int i=0; i<n; i++) { scanf("%lld",&x); x = abs(x); sum1 += x*x; sum2 += x; } ll p,q; q = n*sum1-sum2*sum2; p = n; printf("%lld/%lld\n",q/__gcd(q,p),p/__gcd(q,p)); } return 0;}
0 0
- 【HDU】5734 Acperience(2016 Multi-University Training Contest 2)
- hdu 5734 (2016 Multi-University Training Contest 2)
- 2016 Multi-University Training Contest 2 1001 hdu 5734 暴力
- hdu 5734 Acperience 2016 Multi-University Training Contest 2
- 2016 Multi-University Training Contest 2-1001---HDU 5734 Acperience
- hdu 5742 (2016 Multi-University Training Contest 2)
- hdu 5744(2016 Multi-University Training Contest 2)
- hdu 5745(2016 Multi-University Training Contest 2)
- hdu 5745 2016 Multi-University Training Contest 2 (暴力)
- (HDU 5734)Acperience <数学题> 2016 Multi-University Training Contest 2
- HDU 2016 Multi-University Training Contest 2 1001
- HDU 5738 Eureka (from: 2016 Multi-University Training Contest 2)
- 2016 Multi-University Training Contest 2-1005---HDU 5738 Eureka
- hdu 5791 2016 Multi-University Training Contest 5(dp)
- HDU 5305 Friends(2015 Multi-University Training Contest 2)
- 2016 Multi-University Training Contest 2 Acperience
- 2016 Multi-University Training Contest 2
- 2016 Multi-University Training Contest 2 Acperience
- vivado设计流程
- PAT-B 1036. 跟奥巴马一起编程
- 欢迎使用CSDN-markdown编辑器
- MFC控件使用说明(combo box Button Check Box Radio Button List Control Edit Box Hot Key IP Address....)
- HDOJ1003 最大子数组
- hdu 5734 (2016 Multi-University Training Contest 2)
- 非关系型数据库mongodb和redis
- 百度知道截流:自答、留Q、微信,别人不说的,这里都有?
- Windows7下JavaEE(jsp开发环境)快速搭建+第一个jsp程序 超详细教程
- 3.4窗口和视口,sinc函数
- LeetCode: Count Primes(计算n以内素数个数:高效算法)
- STM32时钟配置,不同晶振时需要配置的程序
- SDUT 3341数据结构实验之二叉树二:遍历二叉树
- 冲正