竞赛排名 (Standard IO)

最新推荐文章于 2024-07-14 17:39:06 发布

Kesiruto

最新推荐文章于 2024-07-14 17:39:06 发布

阅读量583

点赞数 3

分类专栏： 2016暑假中山文章标签： 1743

本文链接：https://blog.csdn.net/qq_34593871/article/details/51926623

版权

2016暑假中山专栏收录该内容

71 篇文章 0 订阅

订阅专栏

Description

题解：

模拟，按题目说的做就AC了，那个奇奇怪怪的符号是大致是从x枚举到y。

代码：

var
  n:longint;
  a:array[0..1000,0..8] of longint;
  b:array[0..1000,0..8] of real;
  f,x:array[0..1000] of longint;
  y,t,avg:array[0..1000] of real;
procedure qsort(l,r:longint);
var
  m1,t:real;
  i,j,m2,m3,c:longint;
begin
  i:=1;j:=r;
  m1:=y[(l+r)div 2];
  m2:=x[(l+r)div 2];
  m3:=f[(l+r)div 2];
  repeat
    while ((y[i]>m1)or((y[i]=m1)and(x[i]>m2))or((y[i]=m1)and(x[i]=m2)and(f[i]<m3))) do
      inc(i);
    while ((y[j]<m1)or((y[j]=m1)and(x[j]<m2))or((y[j]=m1)and(x[j]=m2)and(f[j]>m3))) do
    dec(j);
    if i<=j then
      begin
        t:=y[i];y[i]:=y[j];y[j]:=t;
        c:=x[i];x[i]:=x[j];x[j]:=c;
        c:=f[i];f[i]:=f[j];f[j]:=c;
        inc(i);dec(j);
      end;
  until i>j;
  if i<r then qsort(i,r);
  if l<j then qsort(l,j);
end;
procedure init;
var
  i,j:longint;
begin
  readln(n);
  for i:=1 to n do
    for j:=1 to 8 do
      begin
        read(a[i,j]);
        avg[j]:=avg[j]+a[i,j];
        x[i]:=x[i]+a[i,j];
      end;
  for i:=1 to 8 do
    avg[i]:=avg[i]/n;
end;
var
  i,j:longint;
begin
  init;
  for i:=1 to 8 do
    begin
      for j:=1 to n do
        begin
          t[i]:=t[i]+abs(a[j,i]-avg[i]);
          f[j]:=j;
        end;
      t[i]:=t[i]/n;
    end;
  for i:=1 to n do
    for j:=1 to 8 do
      if t[j]=0 then
        b[i,j]:=0
      else
        b[i,j]:=(a[i,j]-avg[j])/t[j];
  for i:=1 to n do
    for j:=1 to 8 do
      if j<4 then
        y[i]:=y[i]+b[i,j]
      else
        y[i]:=y[i]+b[i,j]*0.8;
  qsort(1,n);
  for i:=1 to n do
    writeln(f[i]);
end.