2016 Multi-University Training Contest 2 1001 Acperience

最新推荐文章于 2018-03-25 19:12:35 发布

原创最新推荐文章于 2018-03-25 19:12:35 发布 · 519 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ACM #hdu #多校联合训练 #2016 Multi-Universit

多校联合训练专栏收录该内容

42 篇文章

订阅专栏

本文探讨了在资源受限设备上应用卷积神经网络(CNN)的问题，提出了一种通过二值化权重来简化网络的方法，并提供了一个具体的数学问题及解决方案。

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5734

题目：

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 vector

W=(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)).

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 integers

(1≤n≤100000) -- the length of the vector. The next line contains

n integers:

w1,w2,...,wn

(−10000≤wi≤10000).

Output

For each test case, output the minimum value of

∥W−αB∥2 as an irreducible fraction "

q" where

q are integers,

q>0.

Sample Input

Sample Output

5/1
0/1
10/1

其实就是求绝对值的方差。由于要表示成分式，所以需要对分子分母进行化简，化简成 ∑ai²-sum²/n 即可。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
using namespace std;

ll a[110000];

ll gcd(ll x,ll y)
{
    return y==0?x:gcd(y,x%y);
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        ll n;
        scanf("%lld",&n);
        ll sum=0;
        for(int i=0;i<n;i++)
        {
            scanf("%lld",&a[i]);
            if(a[i]<0)  a[i]=-a[i];
            sum+=a[i];
        }
        ll sum0=0;
        for(int i=0;i<n;i++)
        {
            sum0+=a[i]*a[i];
        }
        ll sum1=sum*sum;
        ll t=n;
        ll d=gcd(t,sum1);
        sum1/=d;
        t/=d;
        printf("%lld/%lld\n",sum0*t-sum1,t);
    }
}