Submission #230428
Source Code Expand
#include <stdio.h> #include <stdlib.h> typedef struct data{ long c; int num; struct data *next; } cell; void addcell(cell* bp,long c){ cell* p; p=(cell*)malloc(sizeof(cell)); p->c=c; p->num=bp->num; p->next=bp->next; bp->next=p; } void delcell(cell* p){ cell* np=p->next->next; free((void*)p->next); p->next=np; } int main(int argc, const char * argv[]) { int n; scanf("%d",&n); cell *h; h=(cell*)malloc(sizeof(cell)); h->c=0; h->num=0; h->next=NULL; for (int i=0; i<n; i++) { long a,b; cell* p=h; scanf("%ld %ld",&a,&b); if (a!=0) { while (p!=NULL) { if (p->next==NULL) { addcell(p,a); if (p->num==p->next->num+1) { delcell(p); } break; }else if (p->next->c>a){ addcell(p,a); if (p->num==p->next->num+1) { delcell(p); } break; } else if (p->next->c==a){ break; } p=p->next; } } p=p->next; while (p!=NULL) { p->num++; if (p->next==NULL) { addcell(p,b+1); p->next->num--; if (p->num==p->next->num) { delcell(p); } break; }else if (p->next->c>b+1){ addcell(p,b+1); p->next->num--; if (p->num==p->next->num) { delcell(p); } break; } else if (p->next->c==b+1){ break; } p=p->next; } } cell* p=h; long count=0; while (p!=NULL) { if (p->num>count) { count=p->num; } p=p->next; } printf("%ld\n",count); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - AtColor |
User | NSTomoS |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 2250 Byte |
Status | WA |
Exec Time | 3046 ms |
Memory | 2340 KB |
Compile Error
./Main.cpp: In function ‘int main(int, const char**)’: ./Main.cpp:28:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ./Main.cpp:38:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 30 | 0 / 70 | ||||||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt |
Subtask1 | subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask0_sample01.txt, subtask0_sample02.txt |
Subtask2 | subtask0_sample01.txt, subtask0_sample02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | WA | 23 ms | 696 KB |
subtask0_sample02.txt | AC | 24 ms | 792 KB |
subtask1_01.txt | AC | 25 ms | 792 KB |
subtask1_02.txt | WA | 23 ms | 660 KB |
subtask1_03.txt | WA | 23 ms | 792 KB |
subtask1_04.txt | WA | 31 ms | 800 KB |
subtask1_05.txt | WA | 22 ms | 796 KB |
subtask1_06.txt | WA | 38 ms | 804 KB |
subtask1_07.txt | AC | 30 ms | 796 KB |
subtask1_08.txt | AC | 44 ms | 808 KB |
subtask1_09.txt | AC | 44 ms | 800 KB |
subtask1_10.txt | AC | 44 ms | 792 KB |
subtask1_11.txt | AC | 43 ms | 796 KB |
subtask1_12.txt | AC | 42 ms | 808 KB |
subtask1_13.txt | AC | 43 ms | 792 KB |
subtask1_14.txt | AC | 42 ms | 800 KB |
subtask1_15.txt | AC | 41 ms | 804 KB |
subtask2_01.txt | WA | 51 ms | 800 KB |
subtask2_02.txt | TLE | 3046 ms | 1956 KB |
subtask2_03.txt | WA | 50 ms | 672 KB |
subtask2_04.txt | TLE | 3033 ms | 2340 KB |
subtask2_05.txt | TLE | 3033 ms | 1956 KB |
subtask2_06.txt | TLE | 3033 ms | 1696 KB |
subtask2_07.txt | TLE | 3032 ms | 1692 KB |
subtask2_08.txt | TLE | 3033 ms | 1696 KB |
subtask2_09.txt | TLE | 3034 ms | 1692 KB |
subtask2_10.txt | TLE | 3032 ms | 1704 KB |
subtask2_11.txt | TLE | 3034 ms | 1692 KB |
subtask2_12.txt | TLE | 3033 ms | 1692 KB |
subtask2_13.txt | TLE | 3034 ms | 1700 KB |
subtask2_14.txt | TLE | 3035 ms | 1696 KB |
subtask2_15.txt | TLE | 3033 ms | 1720 KB |
subtask2_16.txt | TLE | 3033 ms | 1692 KB |
subtask2_17.txt | TLE | 3035 ms | 1696 KB |
subtask2_18.txt | TLE | 3032 ms | 1700 KB |
subtask2_19.txt | TLE | 3033 ms | 1696 KB |
subtask2_20.txt | TLE | 3034 ms | 1692 KB |
subtask2_21.txt | TLE | 3033 ms | 1688 KB |
subtask2_22.txt | TLE | 3035 ms | 1696 KB |
subtask2_23.txt | TLE | 3033 ms | 1704 KB |
subtask2_24.txt | TLE | 3033 ms | 1692 KB |
subtask2_25.txt | TLE | 3033 ms | 1700 KB |