Submission #14166

#	Time	Username	Problem	Language	Result	Execution time	Memory
14166		pichulia	정전 (OJUZ10_blackout)	C++98	50 / 100	52 ms	4988 KiB

blackout

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
int n, m;
int a[1000000];
int res;
int main()
{
	int i, j, k, l;
	scanf("%d %d",&n,&m);
	for(i=0;i<n;i++){scanf("%d",&a[i]);a[i]-=m;}
	sort(a,a+n);
	m=2*m;
	int si=a[0];
	int ei=a[0]+m;
	for(i=1;i<n;i++)
	{
//		printf("%d %d %d\n",si,ei,a[i]);
		if(si<a[i])si=a[i];
		if(ei>si){res += ei-si; si=ei;}
		ei=a[i]+m;
	}
	printf("%d\n",res);
}

• Subtask 1: 0 / 10
• Subtask 2: 20 / 20
• Subtask 3: 30 / 30
• Subtask 4: 0 / 40