結果
問題 | No.649 ここでちょっとQK! |
ユーザー |
|
提出日時 | 2018-03-07 22:53:35 |
言語 | C++11 (gcc 13.3.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,150 bytes |
コンパイル時間 | 1,345 ms |
コンパイル使用メモリ | 159,528 KB |
実行使用メモリ | 10,496 KB |
最終ジャッジ日時 | 2024-10-04 17:13:26 |
合計ジャッジ時間 | 7,649 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | -- * 4 |
other | AC * 4 TLE * 1 -- * 27 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:98:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 98 | scanf("%d %d",&q,&k); | ~~~~~^~~~~~~~~~~~~~~ main.cpp:101:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 101 | scanf("%d",&sw); | ~~~~~^~~~~~~~~~ main.cpp:104:18: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 104 | scanf("%lld",&temp); | ~~~~~^~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>using namespace std;struct Node{unsigned long long value;Node *prev,*next;};int counter;Node *nil;void init(){nil = (Node*)malloc(sizeof(Node));nil->value = -1;nil->next = nil;nil->prev = nil;}void customInsert(Node* base,unsigned long long ins){Node* add = (Node*)malloc(sizeof(Node));add-> value = ins;add-> next = base->next;add->prev = base;base->next->prev = add;base->next = add;counter++;}void insert(int ins){customInsert(nil,ins);}void sortedInsert(unsigned long long key){Node* cur = nil->next;while(key < cur->value && cur!=nil)cur = cur->next;customInsert(cur->prev,key);}bool deleteNode(Node* del){if (del==nil) return false;del->next->prev = del->prev;del->prev->next = del->next;free(del);counter--;return true;}bool deleteFirst(){return deleteNode(nil->next);}void cleanup(){while(deleteFirst());}Node* searchNode(unsigned long long key){Node* cur = nil->next;while(cur!=nil && cur->value!=key){cur = cur->next;}return cur;}Node* bigger_from(int index){if (index>=counter) return nil;int count=1;Node* cur = nil->next;while(count<index){cur = cur->next;count++;}return cur;}Node* smaller_from(int index){if (index>=counter) return nil;int count=0;Node* cur = nil->prev;while(count<index){cur = cur->prev;count++;}return cur;}void traceNode(){Node* cur= nil->next;while(cur!=nil){cout << cur->value << endl;cur = cur->next;}}signed main(){init();int q,k;scanf("%d %d",&q,&k);for (int i=0;i<q;i++){int sw;scanf("%d",&sw);if (sw==1){unsigned long long temp;scanf("%lld",&temp);sortedInsert(temp);}else if(sw==2){Node* temp = smaller_from(k-1);printf("%lld\n",temp->value);deleteNode(temp);}}cleanup();return 0;}