Submission #3229991


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define ll long long
#define ull unsigned long long

#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))

#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
#define INF ((1LL<<62)-(1LL<<31))

ll d[300010];
ll n,cnt;
void f(ll a,ll b,ll l,ll r,ll s){
//	printf("%lld %lld %lld %lld %lld %lld\n",a,b,l,r,s,cnt);fflush(0);
	//[l,r)をincがa,decがb以下になるようs+1からの数で埋める
	if(a==0||b==0){
		puts("-1");
		exit(0);
	}
	if(cnt+a<=n){
		rep(j,0,a)d[r-1-j]=s+a-j;
		cnt+=a;
		if(cnt+b-1<=n){
			rep(i,0,b-1)d[l+i]=s+a+b-1-i;
			cnt+=b-1;
		}else{
			for(ll i=r-1;i>=l;i--)d[i]=s+r-i;
			cnt=n;
		}
	}else{
		rep(j,0,n-cnt)d[l+j]=s+1+j;
		cnt=n;
	}
//	printf("%lld %lld %lld %lld %lld\n",a,b,l,r,s);
//	rep(i,0,16)printf("%lld ",d[i]);puts("");
	if(n!=cnt)f(a-1,b-1,l+b-1,r-a,s+a+b-1);
}

int main(){
	ll a,b;
	scanf("%lld%lld%lld",&n,&a,&b);
	if(a+b>n+1){
		puts("-1");
		return 0;
	}
	f(a,b,0,n,0);
	rep(i,0,n)printf("%lld ",d[i]);
	puts("");
	return 0;
}

Submission Info

Submission Time
Task E - LISDL
User kyopro_friends
Language C (GCC 5.4.1)
Score 0
Code Size 1156 Byte
Status WA
Exec Time 28 ms
Memory 4480 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:45:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&n,&a,&b);
  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 3
AC × 53
WA × 2
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 10 ms 1536 KB
02.txt AC 2 ms 256 KB
03.txt AC 14 ms 2176 KB
04.txt AC 1 ms 256 KB
05.txt AC 25 ms 3968 KB
06.txt AC 1 ms 128 KB
07.txt AC 1 ms 128 KB
08.txt AC 13 ms 1920 KB
09.txt AC 15 ms 2432 KB
10.txt AC 26 ms 4096 KB
11.txt AC 27 ms 4096 KB
12.txt AC 28 ms 4480 KB
13.txt AC 23 ms 3584 KB
14.txt AC 21 ms 3200 KB
15.txt AC 7 ms 1152 KB
16.txt AC 27 ms 4224 KB
17.txt AC 1 ms 256 KB
18.txt AC 10 ms 1536 KB
19.txt AC 20 ms 3072 KB
20.txt AC 1 ms 128 KB
21.txt AC 10 ms 1536 KB
22.txt WA 21 ms 3328 KB
23.txt AC 19 ms 3072 KB
24.txt AC 1 ms 128 KB
25.txt AC 26 ms 3968 KB
26.txt AC 1 ms 128 KB
27.txt AC 1 ms 128 KB
28.txt AC 10 ms 1664 KB
29.txt AC 22 ms 3328 KB
30.txt AC 24 ms 3712 KB
31.txt AC 17 ms 2688 KB
32.txt AC 28 ms 4480 KB
33.txt AC 27 ms 4224 KB
34.txt AC 24 ms 3840 KB
35.txt WA 10 ms 1536 KB
36.txt AC 28 ms 4352 KB
37.txt AC 1 ms 256 KB
38.txt AC 11 ms 1664 KB
39.txt AC 21 ms 3200 KB
40.txt AC 1 ms 128 KB
41.txt AC 1 ms 128 KB
42.txt AC 1 ms 128 KB
43.txt AC 1 ms 128 KB
44.txt AC 1 ms 128 KB
45.txt AC 25 ms 3968 KB
46.txt AC 12 ms 1920 KB
47.txt AC 1 ms 128 KB
48.txt AC 24 ms 3712 KB
49.txt AC 4 ms 640 KB
50.txt AC 2 ms 2304 KB
51.txt AC 2 ms 2304 KB
52.txt AC 1 ms 1280 KB
s1.txt AC 1 ms 128 KB
s2.txt AC 1 ms 128 KB
s3.txt AC 1 ms 128 KB