結果

問題 No.126 2基のエレベータ
ユーザー tsuishitsuishi
提出日時 2021-04-26 13:14:07
言語 C
(gcc 13.3.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 3,862 bytes
コンパイル時間 323 ms
コンパイル使用メモリ 33,152 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-10 18:39:26
合計ジャッジ時間 1,099 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 26 WA * 1
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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 mygc(c) (c)=getchar()
#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 MID(a,b,c) ((a)>(b)?(b)>(c)?(b):(a)>(c)?(c):(a):(c)>(b)?(b):(c)>(a)?(c):(a))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define REP(a,b) for(int a=0;a<(int)(b);++a)
#define REP1(a,b) for(int a=1;a<=(int)(b);++a)
#define ll long long
#define INPUT GETLINE
#define ull unsigned ll
#define ui unsigned int
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 REP(a,b) for(int a=0;a<(int)(b);++a)
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 ll GETWORDLL(void) {char s[34];GETWORD(s);return atoll(s);}
static long GETLINELONG(void) {char s[34];GETLINE(s);return atol(s);}
static ll GETLINELL(void) {char s[34];GETLINE(s);return atoll(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;}
static ll midll(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;}}}
static int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} //
static ll gcdll(ll a,ll b){ll c;while(b!=0){c=a%b;a=b;b=c;}return a;} //
#define Yes(a) printf("%s\n",((a)?"Yes":"No"))
// ---------------------------
//
ll A,B,S;
// ---------------------------
void read(void)
{
A = GETWORDINT();
B = GETWORDINT();
S = GETWORDINT();
}
// *********************
int main( void )
{
int moved = 0;
read();
//TRACE("A %lld\nB %lld\n",A,B);
if( S == 1 ) {
TRACE("S==1\n");
moved = abs(A-1)+1;
} else {
if( abs(A-S) > abs(B-S) ) {
TRACE("abs(A-S)%d > abs(B-S)%d\n",abs(A-S), abs(B-S));
TRACE("A->S=%d, S->1=%d \n",abs(A-S), abs(S-1));
TRACE("B moved.\n");
moved = abs(B-S);
if( (abs(S-A)+abs(A-1)) > (abs(S-1)+abs(A-1)) ) {
TRACE("B goto 1.\n");
moved += abs(S-1) + abs(A-1) + 1;
} else {
TRACE("A norikae\n");
if( A > S && A != 31) {
TRACE("A goto S\n");
TRACE("%d + abs(A-S)%d + abs(S-1)%d +1\n",moved,abs(A-S),abs(S-1));
moved += +abs(A-S) + abs(S-1) +1 ;
} else {
TRACE("B goto A\n");
moved += +abs(S-A) + abs(A-1) +1 ;
}
}
} else {
TRACE("abs(A-S)%d <= abs(B-S)%d\n",abs(A-S), abs(B-S));
TRACE("abs(A-S)%d + abs(S-1)%d + 1\n",abs(A-S), abs(S-1));
moved = abs( A-S ) + abs(S-1) + 1;
}
}
printf("%d\n",moved);
DEBUGEND();
TRACE("test7.txt\n");
TRACE("5241\n");
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0