oj.uz

답안 #932191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
932191 2024-02-23T05:16:43 Z sleepntsheep Palembang Bridges (APIO15_bridge) C++17
22 / 100
 49 ms 1164 KB 
#include<stdio.h>
unsigned X=12345;int rand_(){return(X*=3)>>1;}
int abs(int a){return a<0?-a:a;}
long long minll(long long a,long long b){return a<b?a:b;}
int(*compar)(int,int);
void sort(int*aa,int l,int r){ while(l<r){int i=l,j=l,k=r,tmp,p=aa[l+rand_()%(r-l)]; while(j<k)switch(compar(aa[j],p)){case 0:++j;break;case -1:tmp=aa[j],aa[j]=aa[i],aa[i]=tmp,++i,++j;break;case 1:tmp=aa[j],aa[j]=aa[--k],aa[k]=tmp;break;}sort(aa,l,i);l=k;} }

int c0(int a,int b){return a<b?-1:a>b?1:0;}

int a[1<<18],k,n0,n;char p,q;long long z;

long long chk(int x){long long z=0;for(int i=0;i<n;++i)z+=abs(a[i]-x);return z;}

int main(){
    scanf("%d%d",&k,&n0);for(int w,e,i=0;i<n0;++i){scanf(" %c%d %c%d",&p,&w,&q,&e);if(p-q)a[n++]=w,a[n++]=e,++z;else z+=abs(w-e);}
    compar=c0;sort(a,0,n);
    if(k==1)return printf("%lld",z+chk(a[n/2])),0;

    if(n<=200){
        long long zz=1e18;for(int i=0;i<n;++i)zz=minll(zz,z+chk(a[i]));return printf("%lld",zz),0;
    }
}

Compilation message

bridge.cpp: In function 'int main()':
bridge.cpp:15:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%d",&k,&n0);for(int w,e,i=0;i<n0;++i){scanf(" %c%d %c%d",&p,&w,&q,&e);if(p-q)a[n++]=w,a[n++]=e,++z;else z+=abs(w-e);}
      |     ~~~~~^~~~~~~~~~~~~~~
bridge.cpp:15:57: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     scanf("%d%d",&k,&n0);for(int w,e,i=0;i<n0;++i){scanf(" %c%d %c%d",&p,&w,&q,&e);if(p-q)a[n++]=w,a[n++]=e,++z;else z+=abs(w-e);}
      |                                                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 424 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 26 ms 1164 KB Output is correct
13 Correct 49 ms 1116 KB Output is correct
14 Correct 31 ms 1092 KB Output is correct
15 Correct 31 ms 972 KB Output is correct
16 Correct 20 ms 1108 KB Output is correct
17 Correct 38 ms 1116 KB Output is correct
18 Correct 42 ms 1116 KB Output is correct
19 Correct 47 ms 1116 KB Output is correct
20 Correct 22 ms 1116 KB Output is correct
21 Correct 44 ms 1116 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -