結果
問題 | No.139 交差点 |
ユーザー |
![]() |
提出日時 | 2021-02-26 17:10:04 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 1 ms / 5,000 ms |
コード長 | 2,192 bytes |
コンパイル時間 | 740 ms |
コンパイル使用メモリ | 31,872 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-02 09:07:35 |
合計ジャッジ時間 | 1,725 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 28 |
コンパイルメッセージ
main.c: In function 'GETWORD': main.c:31:21: warning: implicit declaration of function 'getchar_unlocked' [-Wimplicit-function-declaration] 31 | #define mygc(c) (c)=getchar_unlocked() | ^~~~~~~~~~~~~~~~ main.c:32:61: note: in expansion of macro 'mygc' 32 | static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];mygc(c);while(c!=EOF){if((c==' ')||(c=='\n'))break;*cp++=c;mygc(c);}*cp='\0';return &str[0];} | ^~~~
ソースコード
#include <stdio.h>#include <stdlib.h>#include <string.h>#include <math.h>// Yukicoder №139 交差点 ★★☆// https://yukicoder.me/problems/no/139// ***********************// for debug#define DEBUG// -----------#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 mypc(d) putchar_unlocked(d)#define PRINCR mypc('\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)// 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_unlocked()static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];mygc(c);while(c!=EOF){if((c==' ')||(c=='\n'))break;*cp++=c;mygc(c);}*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);}static long GETWORDLONG(void) {char s[34];GETWORD(s);return atol(s);}static int maxi(int a,int b){if((a)>(b)){return a;}return b;}static long maxl(long a,long b){if(a>b){return a;}return b;}#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<=(int)(b);++a)// *********************// *********************int main( void ) {int cross;int goal;int dist;int tim;int xx,ww,tt;int red;cross = GETWORDINT();goal = GETWORDINT();tim = 0;dist = 0;REP(i,cross) {xx = GETWORDINT();ww = GETWORDINT();tt = GETWORDINT();tim += xx - dist;dist = xx;red = ( tim / tt );if( red % 2 ) {// 青まで待つtim = (red+1) * tt;} else if( (tim + ww) > ((red+1) * tt) ) {// 途中で赤になるtim = (red+2) * tt;}tim += ww;dist += ww;}tim += goal - dist;printf("%d\n", tim );return 0;}