#398582 (C) No.945 YKC饅頭

提出ソース

結果

問題	No.945 YKC饅頭
ユーザー	butsurizuki
提出日時	2019-11-18 17:03:32
言語	C (gcc 12.3.0)
結果	AC
実行時間	278 ms / 2,000 ms
コード長	6,953 bytes
コンパイル時間	629 ms
コンパイル使用メモリ	34,688 KB
実行使用メモリ	18,176 KB
最終ジャッジ日時	2024-10-01 21:44:36
合計ジャッジ時間	10,280 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 18,176 KB
testcase_01	AC	7 ms 18,176 KB
testcase_02	AC	6 ms 18,176 KB
testcase_03	AC	7 ms 18,048 KB
testcase_04	AC	6 ms 18,152 KB
testcase_05	AC	6 ms 18,176 KB
testcase_06	AC	7 ms 18,176 KB
testcase_07	AC	7 ms 18,176 KB
testcase_08	AC	6 ms 18,176 KB
testcase_09	AC	7 ms 18,176 KB
testcase_10	AC	7 ms 18,048 KB
testcase_11	AC	8 ms 18,176 KB
testcase_12	AC	6 ms 18,176 KB
testcase_13	AC	8 ms 18,176 KB
testcase_14	AC	8 ms 18,176 KB
testcase_15	AC	7 ms 18,048 KB
testcase_16	AC	6 ms 18,176 KB
testcase_17	AC	7 ms 18,176 KB
testcase_18	AC	6 ms 18,048 KB
testcase_19	AC	6 ms 18,176 KB
testcase_20	AC	7 ms 18,176 KB
testcase_21	AC	7 ms 18,048 KB
testcase_22	AC	7 ms 18,048 KB
testcase_23	AC	7 ms 18,048 KB
testcase_24	AC	7 ms 18,176 KB
testcase_25	AC	7 ms 18,176 KB
testcase_26	AC	8 ms 18,176 KB
testcase_27	AC	7 ms 18,048 KB
testcase_28	AC	6 ms 18,176 KB
testcase_29	AC	6 ms 18,048 KB
testcase_30	AC	6 ms 18,176 KB
testcase_31	AC	21 ms 18,048 KB
testcase_32	AC	33 ms 18,176 KB
testcase_33	AC	77 ms 18,176 KB
testcase_34	AC	132 ms 18,176 KB
testcase_35	AC	228 ms 18,176 KB
testcase_36	AC	141 ms 18,176 KB
testcase_37	AC	126 ms 18,176 KB
testcase_38	AC	127 ms 18,176 KB
testcase_39	AC	51 ms 18,176 KB
testcase_40	AC	58 ms 18,176 KB
testcase_41	AC	33 ms 18,176 KB
testcase_42	AC	183 ms 18,176 KB
testcase_43	AC	115 ms 18,176 KB
testcase_44	AC	172 ms 18,176 KB
testcase_45	AC	199 ms 18,176 KB
testcase_46	AC	21 ms 18,152 KB
testcase_47	AC	134 ms 18,048 KB
testcase_48	AC	30 ms 18,048 KB
testcase_49	AC	70 ms 18,176 KB
testcase_50	AC	214 ms 18,176 KB
testcase_51	AC	275 ms 18,048 KB
testcase_52	AC	268 ms 18,176 KB
testcase_53	AC	271 ms 18,176 KB
testcase_54	AC	278 ms 18,048 KB
testcase_55	AC	273 ms 18,048 KB
testcase_56	AC	47 ms 18,176 KB
testcase_57	AC	47 ms 18,176 KB
testcase_58	AC	162 ms 18,176 KB
testcase_59	AC	177 ms 18,048 KB
testcase_60	AC	96 ms 18,176 KB
testcase_61	AC	162 ms 18,176 KB
testcase_62	AC	155 ms 18,148 KB
testcase_63	AC	50 ms 18,176 KB
testcase_64	AC	101 ms 18,176 KB
testcase_65	AC	89 ms 18,048 KB
testcase_66	AC	89 ms 18,048 KB
testcase_67	AC	133 ms 18,176 KB
testcase_68	AC	99 ms 18,176 KB
testcase_69	AC	65 ms 18,176 KB
testcase_70	AC	74 ms 18,176 KB
testcase_71	AC	67 ms 18,176 KB
testcase_72	AC	118 ms 18,176 KB
testcase_73	AC	179 ms 18,048 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.c:17:5: warning: 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: note: 'round' is declared in header '<math.h>'
    8 | #include<assert.h>
  +++ |+#include <math.h>
    9 | #define inf 1072114514
main.c:18:5: warning: 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: note: 'ceil' is declared in header '<math.h>'
main.c:24:5: warning: 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: note: 'pow' is declared in header '<math.h>'
main.c:32:11: warning: 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: note: 'llround' is declared in header '<math.h>'

ソースコード

raw source code

//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],lazy[1048576];

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

//lazy evaluation
void eval(long long k){
  if(lazy[k]!=0){
    stree[k]=llmax(stree[k],lazy[k]);
    if(k<(ssize-1)){
      lazy[2*k+1]=llmax(lazy[2*k+1],lazy[k]);
      lazy[2*k+2]=llmax(lazy[2*k+2],lazy[k]);
    }
    lazy[k]=0;
  }
  return;
}

//spread t [a,b)
//call:k=0,l=0,r=ssize
void sprquery(long long a,long long b,long long t,long long k,long long l,long long r){
    if(r<=a){return;}
    if(b<=l){return;}
    long long ld,rd,md;
    eval(k);
    if(a<=l && r<=b){
        lazy[k]=llmax(lazy[k],t);
        eval(k);
        return;
    }
    //eval(k*2+1);
    //eval(k*2+2);
    sprquery(a,b,t,k*2+1,l,(l+r)/2);
    sprquery(a,b,t,k*2+2,(l+r)/2,r);
    stree[k]=llmax(stree[k*2+1],stree[k*2+2]);
    lazy[k]=0;
}

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

long long cvrt(char c){
  if(c=='Y'){return 1;}
  if(c=='K'){return 2;}
  if(c=='C'){return 3;}
}

int main(void){
  sinit();
  long long i,j,n,m,l,r,res[4]={0},v;
  char t[2];
  scanf("%lld%lld",&n,&m);
  for(i=0;i<m;i++){
    scanf("%lld%lld%s",&l,&r,t);
    v=1000000000-10*i+cvrt(t[0]);
    sprquery(l,r+1,v,0,0,ssize);
  }
  for(i=1;i<=n;i++){
    res[maxquery(i,i+1,0,0,ssize)%10]++;
  }
  printf("%lld %lld %lld\n",res[1],res[2],res[3]);
  return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード