Submission #16597


Source Code Expand

#include"grader.h"
#include<cstdio>
#include<algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

struct interval{ int a,b; };

void schedule(int n_day,int n,int cen[],int d[]){
	static interval I[100000];
	int m=0;
	static int X[300001];
	X[m++]=n_day;
	rep(i,n){
		I[i].a=max(cen[i]-d[i]+1,0);
		I[i].b=min(cen[i]+d[i]-1,n_day-1);
		X[m++]=I[i].a;
		X[m++]=I[i].b;
		X[m++]=I[i].b+1;
	}
	sort(X,X+m);
	m=unique(X,X+m)-X;

	rep(i,n){
		I[i].a=lower_bound(X,X+m,I[i].a)-X;
		I[i].b=lower_bound(X,X+m,I[i].b)-X;
	}

	static int imos[300001];
	rep(i,n){
		imos[I[i].a]++;
		imos[I[i].b+1]--;
	}

	static int ans[100001][2];
	static int left[100001];
	int h=0;
	rep(p,m){
		if(imos[p]>0){
			rep(i,imos[p]){
				h++;
				left[h]=X[p];
			}
		}
		else if(imos[p]<0){
			rep(i,-imos[p]){
				int right=X[p-1];
				if(ans[h][1]==0 || ans[h][1]-ans[h][0]<right-left[h]){
					ans[h][0]=left[h];
					ans[h][1]=right;
				}
				h--;
			}
		}
	}

	for(int k=1;k<=n;k++) answer(k,ans[k][0],ans[k][1]);
}

Submission Info

Submission Time
Task B - 銀メダル (Silver Medal)
User fura2
Language IOI-Style C++ (GCC 5.4.1)
Score 100
Code Size 1076 Byte
Status AC
Exec Time 158 ms
Memory 6912 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 71 / 71
Status
AC × 10
AC × 10
AC × 10
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 21 ms 800 KB
subtask1/10 AC 22 ms 760 KB
subtask1/2 AC 21 ms 796 KB
subtask1/3 AC 20 ms 792 KB
subtask1/4 AC 21 ms 796 KB
subtask1/5 AC 21 ms 784 KB
subtask1/6 AC 20 ms 784 KB
subtask1/7 AC 21 ms 792 KB
subtask1/8 AC 21 ms 768 KB
subtask1/9 AC 21 ms 820 KB
subtask2/1 AC 21 ms 792 KB
subtask2/10 AC 22 ms 788 KB
subtask2/2 AC 21 ms 796 KB
subtask2/3 AC 21 ms 868 KB
subtask2/4 AC 22 ms 860 KB
subtask2/5 AC 21 ms 760 KB
subtask2/6 AC 22 ms 796 KB
subtask2/7 AC 22 ms 788 KB
subtask2/8 AC 22 ms 784 KB
subtask2/9 AC 20 ms 816 KB
subtask3/1 AC 147 ms 6912 KB
subtask3/10 AC 149 ms 6780 KB
subtask3/2 AC 146 ms 6900 KB
subtask3/3 AC 158 ms 5760 KB
subtask3/4 AC 158 ms 5760 KB
subtask3/5 AC 157 ms 5756 KB
subtask3/6 AC 147 ms 6784 KB
subtask3/7 AC 147 ms 6772 KB
subtask3/8 AC 149 ms 6776 KB
subtask3/9 AC 148 ms 6764 KB