Submission #14135

#TimeUsernameProblemLanguageResultExecution timeMemory
14135juchan1220정전 (OJUZ10_blackout)C++98
50 / 100
51 ms1668 KiB
#include <stdio.h> #include <algorithm> using namespace std; int lamp[150001],n,l; int main (void) { int i,cnt=0; scanf("%d %d",&n,&l); for(i=0;i<n;i++){ scanf("%d",&lamp[i]); } sort(lamp,lamp+n); for(i=1;i<n;i++){ if(lamp[i-1]+l>lamp[i]-l) cnt+=lamp[i-1]+l-(lamp[i]-l); if(i>=2 && lamp[i-2]+l>lamp[i]-l) cnt-=lamp[i-2]+l-(lamp[i]-l); //printf("%d\n",cnt); } printf("%d\n",cnt); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...