結果
問題 | No.635 自然門松列 |
ユーザー | tsuishi |
提出日時 | 2021-02-22 10:46:11 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 1 ms / 650 ms |
コード長 | 7,047 bytes |
コンパイル時間 | 1,219 ms |
コンパイル使用メモリ | 32,256 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-21 08:17:33 |
合計ジャッジ時間 | 1,523 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,944 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 1 ms
6,944 KB |
コンパイルメッセージ
main.c: In function 'GETWORD': main.c:38:63: warning: implicit declaration of function 'getchar_unlocked' [-Wimplicit-function-declaration] 38 | static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];c=getchar_unlocked();while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=getchar_unlocked();}*cp='\0';return &str[0];} | ^~~~~~~~~~~~~~~~ main.c: In function 'main': main.c:23:16: warning: implicit declaration of function 'putchar_unlocked' [-Wimplicit-function-declaration] 23 | #define PRINCR putchar_unlocked('\n') | ^~~~~~~~~~~~~~~~ main.c:124:25: note: in expansion of macro 'PRINCR' 124 | PRINCR; | ^~~~~~
ソースコード
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <limits.h> #include <ctype.h> // Yukicoder №635 自然門松列 // https://yukicoder.me/problems/no/635 // *********************** // for debug #define DEBUGd // ----------- #define NOP do{}while(0) #ifdef DEBUG #define TRACE(...) do{printf(__VA_ARGS__);fflush(stdout);}while(0) #define TRACECR do{putchar_unlocked('\n');fflush(stdout);}while(0) #else #define TRACE(...) NOP #define TRACECR NOP #endif #define PRINCR putchar_unlocked('\n') #define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0) // The out-of-date function #define asctime(...) asctime_s(...) #define ctime(...) ctime_s(...) #define strlen(a) mystr_len(a) //#define fopen(...) fopen_s(...) //#define freopen(...) freopen_s(...) //#define rewind(a) fseek(a,0L,SEEK_SET) //#define setbuf(a,b) setvbuf(a,b,_IOFBF,BUFSIZ) // for stdio #define GETLINE(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0) #define mygc(c) (c)=getchar() static char *GETWORD( char* str ); static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];c=getchar_unlocked();while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=getchar_unlocked();}*cp='\0';return &str[0];} #define GETINTS(a,b) {char s[34];int *ap=a;REP(i,b){GETWORD(s);*ap++=atoi(s);}} static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);} static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);} #define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0) static int max(int a,int b){if(a>b){return a;}return b;} static int min(int a,int b){if(a<b){return a;}return b;} // for readaility typedef long long lolong; const int INF = 1e9; const int MOD = 1e9+7; const lolong LINF = 1e18; #define PI ((double)3.141592653589793238462643383279) #define YES(a) printf("%s",((a)?"YES":"NO")) #define Yes(a) printf("%s",((a)?"Yes":"No")) #define OK(a) printf("%s",((a)?"OK":"NG")) #define Ok(a) printf("%s",((a)?"Ok":"Ng")) #define POSSIBLE(a) printf("%s",((a)?"POSSIBLE":"IMPOSSIBLE")) #define Possible(a) printf("%s",((a)?"Possible":"Impossible")) #define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0) #define REP(a,b) for(int a=0;a<(int)(b);++a) #define REP1(a,b) for(int a=1;a<=(b);++a) #define FLOOP(a,b) for(a=0;a<(b);++a) #define FLOOP1(a,b) for(a=1;a<=(b);++a) #define MABS(c) ((c)<0?(-(c)):(c)) #define LSB(i) ((i) & -(i)) #define INPBUF (250+2) #define DI_KADOMATU 50 #define DI_ASC 123 #define DI_DESC 321 // *********************** // *********************** static int cmpint_asc(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} static int cmpint_desc(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} static int cmpchar_asc(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;} static int cmpchar_desc(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;} static int mystr_len(char *str){int i=0;do{if(str[i]=='\0')break;i++;if(i>9999)break;}while(1);return i;} static int countchar(char str[],char c,int limit ) {int cnt = 0;for(int i=0;i<limit;i++) if( str[i] == c )cnt++;return cnt;} static int absi(int c) {if(c<0){return -c;}else{return c;}} static double mind(double a,double b){if(a<b){return a;}return b;} // *********************** // 外部変数 // *********************** // *********************** // *********************** // *********************** // *********************** // *********************** // *********************** // *********************** int kadomatu( double aa, double bb, double cc ) { long a= aa * 10000; long b= bb * 10000; long c= cc * 10000; if( a == b ) return 0; // 同じ数値 if( a == c ) return 0; // 同じ数値 if( b == c ) return 0; // 同じ数値 if( ( a < b )&&( b < c ) ) return DI_ASC; // 昇順 if( ( a > b )&&( b > c ) ) return DI_DESC; // 降順 if( ( a < b )&&( b > c ) ) return DI_KADOMATU; // 門松 if( ( a > b )&&( b < c ) ) return DI_KADOMATU; // 門松 return 0; // ??? } // *********************** int main() { int query; double a1,a2,a3; double m1,m2,m3; int modef,model; query = GETLINEINT(); REP(i,query) { a1 = (double)GETWORDINT(); a2 = (double)GETWORDINT(); a3 = (double)GETWORDINT(); m1 = (double)GETWORDINT(); m2 = (double)GETWORDINT(); m3 = (double)GETWORDINT(); modef = kadomatu( a1, a2, a3 ); TRACE("%d %d %d:(%d)", (int)a1, (int)a2, (int)a3, modef); if( modef == DI_KADOMATU ) { YES(1); PRINCR; } else { model = kadomatu( a1+(double)m1*360., a2+(double)m2*360., a3+(double)m3*360. ); if( model != DI_KADOMATU ) { model = kadomatu( a1+(double)m1*10., a2+(double)m2*10., a3+(double)m3*10. ); } if( model != DI_KADOMATU ) { double Bb = a3 - a1; double aA = m1 - m3; double xx = Bb / aA; double m1m,m2m,m3m; double a1c,a2c,a3c; if( xx >= 0. ) { double xxc = xx; TRACE("CROSS%lf ",xx); xxc -= 0.0000002 ; if( xxc > 0.) { a1c = a1 + (double)m1 * xxc; a2c = a2 + (double)m2 * xxc; a3c = a3 + (double)m3 * xxc; model = kadomatu( a1c, a2c, a3c ); if( model != DI_KADOMATU ) { xxc = xx - 0.00002 ; if( xxc > 0.) { a1c = a1 + (double)m1 * xxc; a2c = a2 + (double)m2 * xxc; a3c = a3 + (double)m3 * xxc; model = kadomatu( a1c, a2c, a3c ); } } if( model != DI_KADOMATU ) { xxc = xx - 0.002 ; if( xxc > 0.) { a1c = a1 + (double)m1 * xxc; a2c = a2 + (double)m2 * xxc; a3c = a3 + (double)m3 * xxc; model = kadomatu( a1c, a2c, a3c ); } } if( model != DI_KADOMATU ) { xxc = xx - 0.02 ; if( xxc > 0.) { a1c = a1 + (double)m1 * xxc; a2c = a2 + (double)m2 * xxc; a3c = a3 + (double)m3 * xxc; model = kadomatu( a1c, a2c, a3c ); } } } if( model != DI_KADOMATU ) { a1c = a1 + (double)m1 * (xx + 0.000002); a2c = a2 + (double)m2 * (xx + 0.000002); a3c = a3 + (double)m3 * (xx + 0.000002); model = kadomatu( a1c, a2c, a3c ); } if( model != DI_KADOMATU ) { a1c = a1 + (double)m1 * (xx + 0.00002); a2c = a2 + (double)m2 * (xx + 0.00002); a3c = a3 + (double)m3 * (xx + 0.00002); model = kadomatu( a1c, a2c, a3c ); } if( model != DI_KADOMATU ) { a1c = a1 + (double)m1 * (xx + 0.002); a2c = a2 + (double)m2 * (xx + 0.002); a3c = a3 + (double)m3 * (xx + 0.002); model = kadomatu( a1c, a2c, a3c ); } if( model != DI_KADOMATU ) { a1c = a1 + (double)m1 * (xx + 0.02); a2c = a2 + (double)m2 * (xx + 0.02); a3c = a3 + (double)m3 * (xx + 0.02); model = kadomatu( a1c, a2c, a3c ); } } } if( model == DI_KADOMATU ) { YES(1); PRINCR; } else { YES(0); PRINCR; } } } return 0; } // WA