結果
問題 | No.851 テストケース |
ユーザー | tsuishi |
提出日時 | 2021-04-15 14:14:47 |
言語 | C (gcc 12.3.0) |
結果 |
AC
|
実行時間 | 1 ms / 3,153 ms |
コード長 | 3,359 bytes |
コンパイル時間 | 708 ms |
コンパイル使用メモリ | 32,000 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-01 20:23:46 |
合計ジャッジ時間 | 1,538 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,944 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,940 KB |
testcase_10 | AC | 1 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,944 KB |
testcase_17 | AC | 1 ms
6,944 KB |
testcase_18 | AC | 1 ms
6,944 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 1 ms
6,944 KB |
testcase_22 | AC | 1 ms
6,944 KB |
ソースコード
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <math.h> extern int getchar_unlocked(void); extern int putchar_unlocked(int); #define DEBUG #define NOP do{}while(0) #define gc(d) (d)=getchar_unlocked() #define pc(d) putchar_unlocked(d) #define PRINCR pc('\n') #ifdef DEBUG #include <time.h> #define TRACE(...) do{fprintf(stderr,__VA_ARGS__);}while(0) #define TRACECR do{fprintf(stderr,"\n");}while(0) static clock_t startclock; void DEBUGSTART(void){TRACE("--DEBUG MODE --\n");startclock=clock();} void DEBUGEND(void){startclock=clock()-startclock;TRACE("--finish --\ntime is %.3fms\n",startclock/1000.);} #else #define TRACE(...) NOP #define TRACECR NOP void DEBUGSTART(void){return;} void DEBUGEND(void){return;} #endif #define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0) #define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0) #define MAX(a,b) ((a)>(b)?(a):(b)) #define MIN(a,b) ((a)<(b)?(a):(b)) #define MID(a,b,c) ((a)>(b)?(b)>(c)?(b):(a)>(c)?(c):(a):(c)>(b)?(b):(c)>(a)?(c):(a)) #define REP(a,b) for(int a=0;a<(int)(b);++a) #define REP1(a,b) for(int a=1;a<=(int)(b);++a) static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];gc(c);while(c!=EOF){if((c==' ')||(c=='\n'))break;*cp++=c;gc(c);}*cp='\0';return &str[0];} #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 void read1(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);} static void read2(int *x, int *y){read1(x);read1(y);} #define INPUT(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0) #define REP(a,b) for(int a=0;a<(int)(b);++a) #define lolong long long static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);} static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);} static long GETLINELONG(void) {char s[34];GETLINE(s);return atol(s);} static int cmpint123(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} static int cmpint321(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} #define ll long long #define ull unsigned ll #define ui unsigned int ll midl(ll a, ll b, ll c ) { if( a>b ) { if( b > c ) { return b; } else if( a > c ) { return c; } else { return a; } } else { if( c > b ) { return b; } else if( c > a ) { return c; } else { return a; } } } // ********************* // ********************* int main( void ) { ll N,A,B,C; ll md,mx,mn; char str[12*3+2]; // read N = GETLINELONG(); A = GETLINELONG(); { char c; char *cp; cp=&str[0]; gc(c); if( c == EOF ) { printf("\"assert\"\n"); return 0; } while(c!=EOF) { if((c==' ')||(c=='\n'))break; *cp++=c; gc(c); } *cp='\0'; } sscanf(str,"%lld",&B); C = GETLINELONG(); TRACE("N %ld\n",N); TRACE("A %ld\n",A); TRACE("B %ld\n",B); TRACE("C %ld\n",C); DEBUGSTART(); mx = MAX(A+B,MAX(A+C,B+C)); md = midl(A+B,A+C,B+C); mn = MIN(A+B,MIN(A+C,B+C)); TRACE("mx %ld\n",mx); TRACE("md %ld\n",md); TRACE("mn %ld\n",mn); if( mx == md ) { printf("%ld\n", mn ); } else { printf("%ld\n", md ); } DEBUGEND(); }