結果

問題 No.5003 物理好きクリッカー
ユーザー butsurizukibutsurizuki
提出日時 2018-11-26 15:33:35
言語 C
(gcc 12.3.0)
結果
AC  
実行時間 326 ms / 10,000 ms
コード長 4,660 bytes
コンパイル時間 197 ms
実行使用メモリ 22,008 KB
スコア 4,221,137
平均クエリ数 10000.00
最終ジャッジ日時 2021-07-19 07:22:55
合計ジャッジ時間 13,192 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 289 ms
21,528 KB
testcase_01 AC 291 ms
21,876 KB
testcase_02 AC 292 ms
21,336 KB
testcase_03 AC 294 ms
21,552 KB
testcase_04 AC 294 ms
21,780 KB
testcase_05 AC 293 ms
21,528 KB
testcase_06 AC 291 ms
21,492 KB
testcase_07 AC 297 ms
21,528 KB
testcase_08 AC 295 ms
21,528 KB
testcase_09 AC 292 ms
21,528 KB
testcase_10 AC 294 ms
21,948 KB
testcase_11 AC 299 ms
21,360 KB
testcase_12 AC 298 ms
21,876 KB
testcase_13 AC 292 ms
21,300 KB
testcase_14 AC 301 ms
21,372 KB
testcase_15 AC 294 ms
21,888 KB
testcase_16 AC 300 ms
21,900 KB
testcase_17 AC 299 ms
21,372 KB
testcase_18 AC 293 ms
21,516 KB
testcase_19 AC 299 ms
21,348 KB
testcase_20 AC 298 ms
21,360 KB
testcase_21 AC 291 ms
21,984 KB
testcase_22 AC 298 ms
21,360 KB
testcase_23 AC 294 ms
21,924 KB
testcase_24 AC 299 ms
21,852 KB
testcase_25 AC 297 ms
21,360 KB
testcase_26 AC 293 ms
21,528 KB
testcase_27 AC 289 ms
21,888 KB
testcase_28 AC 296 ms
21,504 KB
testcase_29 AC 292 ms
21,552 KB
testcase_30 AC 326 ms
21,528 KB
testcase_31 AC 311 ms
21,540 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.c:16:5: 警告: conflicting types for built-in function ‘round’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   16 | int round(int a,int b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |     ^~~~~
main.c:8:1: 備考: ‘round’ is declared in header ‘<math.h>’
    7 | #include<time.h>
  +++ |+#include <math.h>
    8 | #define inf 1072114514
main.c:17:5: 警告: conflicting types for built-in function ‘ceil’; expected ‘double(double)’ [-Wbuiltin-declaration-mismatch]
   17 | int ceil(int a,int b){if(a%b==0){return a/b;}return (a/b)+1;}
      |     ^~~~
main.c:17:5: 備考: ‘ceil’ is declared in header ‘<math.h>’
main.c:23:5: 警告: conflicting types for built-in function ‘pow’; expected ‘double(double,  double)’ [-Wbuiltin-declaration-mismatch]
   23 | int pow(int a,int b){int i,r=1;for(i=1;i<=b;i++){r*=a;}return r;}
      |     ^~~
main.c:23:5: 備考: ‘pow’ is declared in header ‘<math.h>’
main.c:30:11: 警告: conflicting types for built-in function ‘llround’; expected ‘long long int(double)’ [-Wbuiltin-declaration-mismatch]
   30 | long long llround(long long a,long long b){if((a%b)*2 >= b){return (a/b)+1;}return a/b;}
      |           ^~~~~~~
main.c:30:11: 備考: ‘llround’ is declared in header ‘<math.h>’

ソースコード

diff # 

//set many funcs template
//Ver.20180717
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<stdbool.h>
#include<time.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;}
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;}
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);}
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);}

void shuffledget(int x[],int n){
    srand(time(0));
    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;
}

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;
}

int main(void){
    int i,j,n,m,k,a[524288],b,c,h,w,r=0,l,t;
    double d;
    char s[524288];
    scanf("%d%s",&n,s);
    for(i=0;i<n;i++){
      if(i==100){printf("enhclick\n");}
      else if(i==1000){printf("buy hand\n");}
      else if(i==3000){printf("buy lily\n");}
      else if(i==5000){printf("reinforce hand\n");}
      else if(i==9000){printf("reinforce lily\n");}
      else if(i==9998){printf("sell hand\n");}
      else if(i==9999){printf("sell lily\n");}
      else{printf("click\n");}
      fflush(stdout);
      scanf("%s",s);
    }
    return 0;
}
0