結果

問題 No.489 株に挑戦
ユーザー butsurizukibutsurizuki
提出日時 2020-05-29 06:19:17
言語 C
(gcc 12.3.0)
結果
AC  
実行時間 48 ms / 1,000 ms
コード長 6,429 bytes
コンパイル時間 755 ms
コンパイル使用メモリ 33,724 KB
実行使用メモリ 12,160 KB
最終ジャッジ日時 2023-09-27 06:12:16
合計ジャッジ時間 2,938 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 33 ms
10,600 KB
testcase_01 AC 24 ms
10,416 KB
testcase_02 AC 4 ms
10,020 KB
testcase_03 AC 5 ms
10,052 KB
testcase_04 AC 4 ms
9,860 KB
testcase_05 AC 5 ms
10,076 KB
testcase_06 AC 4 ms
9,992 KB
testcase_07 AC 4 ms
9,996 KB
testcase_08 AC 4 ms
10,016 KB
testcase_09 AC 4 ms
10,032 KB
testcase_10 AC 4 ms
9,924 KB
testcase_11 AC 4 ms
10,044 KB
testcase_12 AC 4 ms
10,072 KB
testcase_13 AC 4 ms
9,928 KB
testcase_14 AC 4 ms
9,996 KB
testcase_15 AC 6 ms
10,104 KB
testcase_16 AC 39 ms
12,104 KB
testcase_17 AC 8 ms
10,144 KB
testcase_18 AC 23 ms
10,420 KB
testcase_19 AC 19 ms
10,228 KB
testcase_20 AC 41 ms
10,756 KB
testcase_21 AC 13 ms
10,188 KB
testcase_22 AC 7 ms
10,088 KB
testcase_23 AC 24 ms
10,404 KB
testcase_24 AC 46 ms
10,836 KB
testcase_25 AC 5 ms
10,008 KB
testcase_26 AC 46 ms
11,924 KB
testcase_27 AC 43 ms
12,128 KB
testcase_28 AC 4 ms
10,044 KB
testcase_29 AC 4 ms
9,976 KB
testcase_30 AC 48 ms
10,764 KB
testcase_31 AC 47 ms
10,836 KB
testcase_32 AC 26 ms
10,340 KB
testcase_33 AC 44 ms
12,160 KB
testcase_34 AC 38 ms
10,640 KB
testcase_35 AC 18 ms
10,284 KB
testcase_36 AC 10 ms
10,120 KB
testcase_37 AC 26 ms
10,432 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:17:5: 警告: conflicting types for built-in function ‘round’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   17 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:9:1: 備考: ‘round’ is declared in header ‘<math.h>’
    8 | #include<assert.h>
  +++ |+#include <math.h>
    9 | #define inf 1072114514
main.c:18:5: 警告: conflicting types for built-in function ‘ceil’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   18 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:18:5: 備考: ‘ceil’ is declared in header ‘<math.h>’
main.c:24:5: 警告: conflicting types for built-in function ‘pow’; expected ‘double(double,  double)’ [-Wbuiltin-declaration-mismatch]
   24 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:24:5: 備考: ‘pow’ is declared in header ‘<math.h>’
main.c:32:11: 警告: conflicting types for built-in function ‘llround’; expected ‘long long int(double)’ [-Wbuiltin-declaration-mismatch]
   32 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:32:11: 備考: ‘llround’ is declared in header ‘<math.h>’

ソースコード

diff # 

//set many funcs template
//Ver.20190820
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.h>
#include<assert.h>
#define inf 1072114514
#define llinf 4154118101919364364
#define mod 1000000007
#define pi 3.1415926535897932384

int max(int a,int b){if(a>b){return a;}return b;}
int min(int a,int b){if(a<b){return a;}return b;}
int zt(int a,int b){return max(a,b)-min(a,b);}
int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}
int nCr(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
int nHr(int a,int b){return nCr(a+b-1,b);}
int fact(int a){int i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
int dsum(int x){int r=0;while(x){r+=(x%10);x/=10;}return r;}
int dsumb(int x,int b){int r=0;while(x){r+=(x%b);x/=b;}return r;}
int sankaku(int x){return ((1+x)*x)/2;}
void swap(int *a,int *b){int c;c=(*a);(*a)=(*b);(*b)=c;}
long long llmax(long long a,long long b){if(a>b){return a;}return b;}
long long llmin(long long a,long long b){if(a<b){return a;}return b;}
long long llzt(long long a,long long b){return llmax(a,b)-llmin(a,b);}
long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
long long llceil(long long a,long long b){if(a%b==0){return a/b;}return (a/b)+1;}
long long llgcd(long long a,long long b){long long c;while(b!=0){c=a%b;a=b;b=c;}return a;}
long long lllcm(long long a,long long b){long long c=llgcd(a,b);a/=c;return a*b;}
long long llnCr(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
long long llnHr(long long a,long long b){return llnCr(a+b-1,b);}
long long llfact(long long a){long long i,r=1;for(i=1;i<=a;i++){r*=i;}return r;}
long long llpow(long long a,long long b){long long i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
long long lldsum(long long x){long long r=0;while(x){r+=(x%10);x/=10;}return r;}
long long lldsumb(long long x,long long b){long long r=0;while(x){r+=(x%b);x/=b;}return r;}
long long llsankaku(long long x){return ((1+x)*x)/2;}
void llswap(long long *a,long long *b){long long c;c=(*a);(*a)=(*b);(*b)=c;}
double dbmax(double a,double b){if(a>b){return a;}return b;}
double dbmin(double a,double b){if(a<b){return a;}return b;}
double dbzt(double a,double b){return dbmax(a,b)-dbmin(a,b);}
void dbswap(double *a,double *b){double c;c=(*a);(*a)=(*b);(*b)=c;}
void chswap(char *a,char *b){char c;c=(*a);(*a)=(*b);(*b)=c;}
int sortfncsj(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int sortfnckj(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
int llsortfncsj(const void *a,const void *b){if(*(long long *)a>*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int llsortfnckj(const void *a,const void *b){if(*(long long *)a<*(long long *)b){return 1;}if(*(long long *)a==*(long long *)b){return 0;}return -1;}
int dbsortfncsj(const void *a,const void *b){if(*(double *)a>*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int dbsortfnckj(const void *a,const void *b){if(*(double *)a<*(double *)b){return 1;}if(*(double *)a==*(double *)b){return 0;}return -1;}
int strsortfncsj(const void *a,const void *b){return strcmp((char *)a,(char *)b);}
int strsortfnckj(const void *a,const void *b){return strcmp((char *)b,(char *)a);}
int chsortfncsj(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}
int chsortfnckj(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;}

void shuffledget(int x[],int n){
    int i,b[524288],p,c;
    for(i=0;i<n;i++){
        b[i]=i;
    }
    for(i=n;i>=1;i--){
        p=rand()%i;
        c=b[i-1];b[i-1]=b[p];b[p]=c;
    }
    for(i=0;i<n;i++){
        scanf("%d",&x[b[i]]);
    }
}

int dx4[4]={1,-1,0,0};
int dy4[4]={0,0,1,-1};
int dx8[8]={-1,-1,-1,0,0,1,1,1};
int dy8[8]={-1,0,1,-1,1,-1,0,1};

int search(int x,int a[],int n){
    int st=0,fi=n-1,te;
    while(st<=fi){
        te=(st+fi)/2;
        if(a[te]<x){st=te+1;}else{fi=te-1;}
    }
    return st;
}

void prarr(int arr[],int n){
  int i;
  for(i=0;i<n;i++){
    if(i){printf(" ");}
    printf("%d",arr[i]);
  }
  printf("\n");
  return;
}

void getperm(int a[],int n){
  int i,p;
  for(i=0;i<n;i++){
    a[i]=i;
  }
  for(i=n-1;i>=1;i--){
    p=rand()%(i+1);
    swap(&a[p],&a[i]);
  }
}

typedef struct{
int val;
int node;
}sd;

int sdsortfnc(const void *a,const void *b){
if(((sd*)a)->val < ((sd*)b)->val){return -1;}
if(((sd*)a)->val > ((sd*)b)->val){return 1;}
return 0;
}

void coordinate_comp(int a[],int n){
  int i,c=0;
  sd dat[524288];
  for(i=0;i<n;i++){
    dat[i].val=a[i];
    dat[i].node=i;
  }
  qsort(dat,n,sizeof(dat[0]),sdsortfnc);
  a[dat[0].node]=c;
  for(i=1;i<n;i++){
    if(dat[i-1].val!=dat[i].val){c++;}
    a[dat[i].node]=c;
  }
}

long long ssize=524288;
long long stree[1048576],vd=-llinf;

void sinit(){
    long long i,j;
    for(i=0;i<2*ssize;i++){
        stree[i]=-llinf;
    }
}

void upd(long long k,long long a){
    long long i,m;
    long long ld,rd,md;
    k+=ssize-1;
    stree[k]=a;
    while(k>0){
        k=(k-1)/2;
        ld=stree[2*k+1];
        rd=stree[2*k+2];
        md=llmax(ld,rd);
        stree[k]=md;
    }
}

//calc max[a,b)
//call:k=0,l=0,r=ssize
long long query(long long a,long long b,long long k,long long l,long long r){
  long long ld,rd,md;
  long long i,lp,rp;
  if(r<=a || b<=l){return vd;}
  if(a<=l && r<=b){
    return stree[k];
  }
  else{
    ld=query(a,b,k*2+1,l,(l+r)/2);
    rd=query(a,b,k*2+2,(l+r)/2,r);
    lp=0;rp=0;
    md=llmax(ld,rd);
    return md;
  }
}

int main(void){
  sinit();
  long long i,j,n,d,k,a[524288],b,c,h,w,r=0,l,t;
  long long st,fi;
  scanf("%lld%lld%lld",&n,&d,&k);
  for(i=1;i<=n;i++){
    scanf("%lld",&a[i]);
    upd(i,a[i]*1000000+(1000000-i));
  }
  for(i=1;i<=n;i++){
    w=query(i+1,i+d+1,0,0,ssize);
    h=w%1000000;h=1000000-h;
    w/=1000000;
    w-=a[i];
    if(r<w){
      r=w;st=i;fi=h;
    }
  }
  if(r==0){puts("0");return 0;}
  printf("%lld\n%lld %lld\n",r*k,st-1,fi-1);
  return 0;
}
0