結果
問題 | No.318 学学学学学 |
ユーザー |
![]() |
提出日時 | 2019-07-24 08:10:34 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 63 ms / 2,000 ms |
コード長 | 2,959 bytes |
コンパイル時間 | 1,123 ms |
コンパイル使用メモリ | 32,512 KB |
実行使用メモリ | 41,856 KB |
最終ジャッジ日時 | 2024-06-27 14:17:18 |
合計ジャッジ時間 | 6,041 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
コンパイルメッセージ
main.c: In function 'in': main.c:7:14: warning: implicit declaration of function 'getchar_unlocked' [-Wimplicit-function-declaration] 7 | #define gc() getchar_unlocked() | ^~~~~~~~~~~~~~~~ main.c:15:24: note: in expansion of macro 'gc' 15 | int n = 0, c = gc(); | ^~ main.c: In function 'out': main.c:8:15: warning: implicit declaration of function 'putchar_unlocked' [-Wimplicit-function-declaration] 8 | #define pc(c) putchar_unlocked(c) | ^~~~~~~~~~~~~~~~ main.c:23:21: note: in expansion of macro 'pc' 23 | while (i--) pc(b[i]); | ^~
ソースコード
// yukicoder: No.318 学学学学学// 2019.7.24 bal4u#include <stdio.h>#if 1#define gc() getchar_unlocked()#define pc(c) putchar_unlocked(c)#else#define gc() getchar()#define pc(c) putchar(c)#endifint in() { // 非負整数の入力int n = 0, c = gc();do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');return n;}void out(int n) { // 正整数の表示int i; char b[20];i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;while (i--) pc(b[i]);}void outs(int k, int v) { // 連続した正整数の表示int i, ii; char b[20];i = 0; while (v) b[i++] = v % 10 + '0', v /= 10;while (k--) { pc(' '); ii = i; while (ii--) pc(b[ii]); }}#define HASHSIZ 4999999typedef struct { int v, id; } HASH;HASH hash[HASHSIZ+5], *hashend = hash+HASHSIZ;int insert(int v, int id) {HASH *p = hash + v % HASHSIZ;while (p->v) {if (p->v == v) return p->id;if (++p == hashend) p = hash;}p->v = v, p->id = id;return -1;}// 優先度付きキュー#define QSIZE 110000#define PARENT(i) ((i)>>1)#define LEFT(i) ((i)<<1)#define RIGHT(i) (((i)<<1)+1)typedef struct { int v, b; } QUE;QUE que[QSIZE+5]; int qsize;void max_heapify(int i) {int l, r, max;QUE qt;l = LEFT(i), r = RIGHT(i);if (l < qsize && que[l].v > que[i].v) max = l; else max = i;if (r < qsize && que[r].v > que[max].v) max = r;if (max != i) {qt = que[i], que[i] = que[max], que[max] = qt;max_heapify(max);}}void deq() {que[0] = que[--qsize];max_heapify(0);}void enq(int v, int b) {int i, max; QUE qt;i = qsize++;que[i].v = v, que[i].b = b;while (i > 0 && que[max = PARENT(i)].v < que[i].v) {qt = que[i]; que[i] = que[max], que[max] = qt;i = max;}}typedef struct { int v, a, b; } T;T t[100005]; int w;int main(){int i, j, v, a, b, n;n = in(); for (i = 0; i < n; i++) {if ((j = insert(v = in(), w)) < 0) t[w].v = v, t[w].a = t[w].b = i, w++;else t[j].b = i;}//for (i = 0; i < w; i++) printf("(%d,%d,%d) ", t[i].v, t[i].a, t[i].b);//printf("\n");i = 0, v = t[0].v, a = 0, b = t[0].b;out(v);if (b > 0 && v > t[1].v) a++;else {if (t[++i].b < b) enq(v, b);v = t[i].v, a = t[i].a, b = t[i].b;}while (++i < w) {if (t[i].a <= b) {if (v < t[i].v) { // もっと強いやつが重ねてきたouts(t[i].a-a, v);if (t[i].b < b) enq(v, b);v = t[i].v, a = t[i].a, b = t[i].b;} else { // 弱いやつが重ねてきたif (b < t[i].b) enq(t[i].v, t[i].b);}} else { // (v,a,b)が終了する運命outs(b-a+1, v), a = b+1;// queかt[i]から候補を選ぶwhile (qsize) {v = que[0].v, b = que[0].b, deq();if (a <= b) {if (t[i].a <= b) { i--; break; }else outs(b-a+1, v), a = b+1;}}if (b < a) v = t[i].v, a = t[i].a, b = t[i].b;}}outs(b-a+1, v), a = b+1;while (qsize) {if (a <= que[0].b) outs(que[0].b-a+1, que[0].v), a = que[0].b+1;deq();}pc('\n');return 0;}