Submission #16535
Source Code Expand
#include"grader.h" #include<cstdio> #include<algorithm> #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; void schedule(int n_day,int n,int cen[],int d[]){ int cnt[1000]={}; rep(i,n){ int l=max(cen[i]-d[i]+1,0); int r=min(cen[i]+d[i]-1,n_day-1); for(int x=l;x<=r;x++) cnt[x]++; } for(int k=1;k<=n;k++){ int l_ans=0,r_ans=-1; int l=0,r=-1; rep(x,n_day+1){ if(x==n_day || cnt[x]<k){ if(r_ans-l_ans<r-l) l_ans=l, r_ans=r; l=x+1; } else{ r=x; } } if(r_ans==-1) l_ans=r_ans=0; answer(k,l_ans,r_ans); } }
Submission Info
Submission Time | |
---|---|
Task | B - 銀メダル (Silver Medal) |
User | fura2 |
Language | IOI-Style C++ (GCC 5.4.1) |
Score | 29 |
Code Size | 597 Byte |
Status | RE |
Exec Time | 301 ms |
Memory | 2308 KB |
Compile Error
./grader.cpp: In function ‘int main()’: ./grader.cpp:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result ./grader.cpp:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result
Judge Result
Set Name | Subtask1 | Subtask2 | Subtask3 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 10 / 10 | 19 / 19 | 0 / 71 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Subtask1 | subtask1/1, subtask1/10, subtask1/2, subtask1/3, subtask1/4, subtask1/5, subtask1/6, subtask1/7, subtask1/8, subtask1/9 |
Subtask2 | subtask2/1, subtask2/10, subtask2/2, subtask2/3, subtask2/4, subtask2/5, subtask2/6, subtask2/7, subtask2/8, subtask2/9 |
Subtask3 | subtask3/1, subtask3/10, subtask3/2, subtask3/3, subtask3/4, subtask3/5, subtask3/6, subtask3/7, subtask3/8, subtask3/9 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask1/1 | AC | 22 ms | 768 KB |
subtask1/10 | AC | 19 ms | 792 KB |
subtask1/2 | AC | 21 ms | 824 KB |
subtask1/3 | AC | 20 ms | 788 KB |
subtask1/4 | AC | 21 ms | 796 KB |
subtask1/5 | AC | 22 ms | 788 KB |
subtask1/6 | AC | 20 ms | 788 KB |
subtask1/7 | AC | 21 ms | 796 KB |
subtask1/8 | AC | 21 ms | 788 KB |
subtask1/9 | AC | 22 ms | 780 KB |
subtask2/1 | AC | 24 ms | 776 KB |
subtask2/10 | AC | 24 ms | 788 KB |
subtask2/2 | AC | 24 ms | 788 KB |
subtask2/3 | AC | 25 ms | 772 KB |
subtask2/4 | AC | 23 ms | 784 KB |
subtask2/5 | AC | 23 ms | 784 KB |
subtask2/6 | AC | 24 ms | 788 KB |
subtask2/7 | AC | 23 ms | 788 KB |
subtask2/8 | AC | 24 ms | 816 KB |
subtask2/9 | AC | 23 ms | 788 KB |
subtask3/1 | RE | 301 ms | 2280 KB |
subtask3/10 | RE | 297 ms | 2296 KB |
subtask3/2 | RE | 291 ms | 2292 KB |
subtask3/3 | RE | 285 ms | 2292 KB |
subtask3/4 | RE | 290 ms | 2300 KB |
subtask3/5 | RE | 283 ms | 2300 KB |
subtask3/6 | RE | 294 ms | 2296 KB |
subtask3/7 | RE | 292 ms | 2292 KB |
subtask3/8 | RE | 288 ms | 2304 KB |
subtask3/9 | RE | 296 ms | 2308 KB |