Submission #1865059
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(i=0;i<(n);i++) #define For(i,a,b) for(i=(a);i<(b);i++) #define all(x) (x).begin(),(x).end() typedef long long ll; const double PI=acos(-1.0); int main(){ int i,j,n,t; cin >> n >> t; vector<int> a(n+1,0); For(i,1,n+1) scanf("%d",&a[i]); vector<int> c(a[n]+1,0); For(i,1,n+1) c[a[i]]=t; /* rep(i,a[n]) cout << c[i] << " "; cout << endl; */ j=1; For(i,1,a[n]){ if(i==a[j] && j<=n) j++; else if(i!=a[j]) c[i]=max(c[i-1]-1,0); } int ans=0; rep(i,a[n]) if(c[i]>0) ans++; ans+=t; /* rep(i,a[n]) cout << c[i] << " "; cout << endl; */ cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 自動ドア |
User | kimitsu_emt |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 727 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 4608 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:14:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] For(i,1,n+1) scanf("%d",&a[i]); ^
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 50 | 0 / 50 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, sample_01.txt, sample_02.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_23.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, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.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, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_23.txt | AC | 5 ms | 3328 KB |
subtask1_01.txt | WA | 15 ms | 4480 KB |
subtask1_02.txt | WA | 9 ms | 4224 KB |
subtask1_03.txt | WA | 14 ms | 4480 KB |
subtask1_04.txt | WA | 10 ms | 4352 KB |
subtask1_05.txt | WA | 8 ms | 4224 KB |
subtask1_06.txt | WA | 8 ms | 4224 KB |
subtask1_07.txt | WA | 15 ms | 4480 KB |
subtask1_08.txt | WA | 14 ms | 4480 KB |
subtask1_09.txt | WA | 11 ms | 4352 KB |
subtask1_10.txt | WA | 7 ms | 4224 KB |
subtask1_11.txt | WA | 11 ms | 4352 KB |
subtask1_12.txt | WA | 15 ms | 4480 KB |
subtask1_13.txt | WA | 14 ms | 4480 KB |
subtask1_14.txt | WA | 13 ms | 4352 KB |
subtask1_15.txt | WA | 16 ms | 4608 KB |
subtask1_16.txt | WA | 17 ms | 4480 KB |
subtask1_17.txt | WA | 16 ms | 4480 KB |
subtask1_18.txt | WA | 16 ms | 4608 KB |
subtask1_19.txt | WA | 16 ms | 4480 KB |
subtask1_20.txt | WA | 16 ms | 4608 KB |
subtask1_21.txt | WA | 16 ms | 4480 KB |
subtask1_22.txt | WA | 16 ms | 4608 KB |
subtask1_23.txt | WA | 16 ms | 4608 KB |
subtask1_24.txt | WA | 16 ms | 4608 KB |
subtask1_25.txt | WA | 16 ms | 4480 KB |
subtask1_26.txt | AC | 11 ms | 768 KB |
subtask1_27.txt | AC | 16 ms | 3840 KB |
subtask1_28.txt | AC | 15 ms | 3712 KB |
subtask1_29.txt | AC | 12 ms | 1408 KB |
subtask2_01.txt | WA | 13 ms | 4352 KB |
subtask2_02.txt | WA | 11 ms | 4352 KB |
subtask2_03.txt | WA | 11 ms | 4480 KB |
subtask2_04.txt | WA | 7 ms | 4224 KB |
subtask2_05.txt | WA | 14 ms | 4480 KB |
subtask2_06.txt | WA | 9 ms | 4224 KB |
subtask2_07.txt | WA | 11 ms | 4352 KB |
subtask2_08.txt | WA | 8 ms | 4224 KB |
subtask2_09.txt | WA | 12 ms | 4352 KB |
subtask2_10.txt | WA | 16 ms | 4480 KB |
subtask2_11.txt | WA | 10 ms | 4352 KB |
subtask2_12.txt | WA | 12 ms | 4352 KB |
subtask2_13.txt | WA | 10 ms | 4224 KB |
subtask2_14.txt | WA | 8 ms | 4224 KB |
subtask2_15.txt | WA | 16 ms | 4480 KB |
subtask2_16.txt | WA | 16 ms | 4480 KB |
subtask2_17.txt | WA | 16 ms | 4608 KB |
subtask2_18.txt | WA | 16 ms | 4608 KB |
subtask2_19.txt | WA | 16 ms | 4608 KB |
subtask2_20.txt | WA | 16 ms | 4480 KB |
subtask2_21.txt | WA | 16 ms | 4608 KB |
subtask2_22.txt | WA | 16 ms | 4608 KB |
subtask2_23.txt | WA | 16 ms | 4480 KB |
subtask2_24.txt | WA | 16 ms | 4608 KB |
subtask2_25.txt | WA | 16 ms | 4480 KB |
subtask2_26.txt | AC | 12 ms | 1024 KB |
subtask2_27.txt | AC | 14 ms | 2304 KB |
subtask2_28.txt | AC | 11 ms | 896 KB |
subtask2_29.txt | AC | 14 ms | 2688 KB |