提出 #2188742
ソースコード 拡げる
#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define all(a) a.begin(),a.end()
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > >
#define pii pair<int,int>
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){x=x>y?y:x;}
template<class T> inline void gmax(T &x,const T &y){x=x<y?y:x;}
template<class T> inline bool Gmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T> inline bool Gmax(T &x,const T &y){return x<y?x=y,1:0;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
if(Bufferhead==Buffertail){
int l=fread(buffer,1,BufferSize,stdin);
if(!l){Terminal=1;return 0;}
Buffertail=(Bufferhead=buffer)+l;
}
return *Bufferhead++;
}
template<class T>inline bool read(T &x){
x=0;char c=Getchar(),rev=0;
while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
if(c=='.'){
c=Getchar();double t=0.1;
while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
}
x=rev?-x:x;
return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
char c=Getchar();
while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
while(c>=33&&c<=126) (*x++)=c,c=Getchar();
*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
if(!x){putchar('0');putchar(c);return;}
if(x<0) putchar('-'),x=-x;
int m=0,a[20];
while(x) a[m++]=x%10,x/=10;
while(m--) putchar(a[m]+'0');
putchar(c);
}
//--------------------------------head---------------------------------------------
const int inf=0x3f3f3f3f;
const int N=200005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
int ans=1;
while(y){
if(y&1) ans=(ll)ans*x%mod;
x=(ll)x*x%mod;y>>=1;
}return ans;
}
int n,A,B,dp[N],a[N];
int main(){
#ifdef rqgao2014
assert(freopen("input.txt","r",stdin));
#endif
scanf("%d%d%d",&n,&A,&B);
if((ll)A*B<n||A+B>n+1){puts("-1");return 0;}
if(B==1){
for(int i=1;i<=n;i++)
printf("%d ",i);puts("");
return 0;
}
a[1]=A;
for(int j=0;j<n-A;j++)
a[j%(B-1)+2]++;
for(int i=1,j=n;i<=B;i++){
assert(a[i]>0);
for(int k=1;k<=a[i];k++)
printf("%d ",j-a[i]+k);
j-=a[i];
}puts("");
return 0;
}
提出情報
提出日時
2018-03-11 21:50:27+0900
問題
E - LISDL
ユーザ
rqgao2014_a
言語
C++14 (GCC 5.4.1)
得点
700
コード長
3281 Byte
結果
AC
実行時間
27 ms
メモリ
2816 KiB
コンパイルエラー
./Main.cpp: In function ‘int main()’:
./Main.cpp:88:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&n,&A,&B);
^
ジャッジ結果
セット名
Sample
All
得点 / 配点
0 / 0
700 / 700
結果
セット名
テストケース
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
ケース名
結果
実行時間
メモリ
01.txt
AC
10 ms
1152 KiB
02.txt
AC
2 ms
384 KiB
03.txt
AC
13 ms
1152 KiB
04.txt
AC
1 ms
256 KiB
05.txt
AC
23 ms
1920 KiB
06.txt
AC
1 ms
256 KiB
07.txt
AC
1 ms
256 KiB
08.txt
AC
12 ms
1280 KiB
09.txt
AC
14 ms
1280 KiB
10.txt
AC
24 ms
2432 KiB
11.txt
AC
26 ms
2432 KiB
12.txt
AC
27 ms
2816 KiB
13.txt
AC
21 ms
2176 KiB
14.txt
AC
20 ms
2432 KiB
15.txt
AC
7 ms
640 KiB
16.txt
AC
25 ms
2432 KiB
17.txt
AC
1 ms
256 KiB
18.txt
AC
9 ms
768 KiB
19.txt
AC
18 ms
1536 KiB
20.txt
AC
1 ms
256 KiB
21.txt
AC
10 ms
1152 KiB
22.txt
AC
20 ms
1664 KiB
23.txt
AC
18 ms
1536 KiB
24.txt
AC
1 ms
256 KiB
25.txt
AC
22 ms
1920 KiB
26.txt
AC
1 ms
256 KiB
27.txt
AC
1 ms
256 KiB
28.txt
AC
10 ms
1152 KiB
29.txt
AC
20 ms
1664 KiB
30.txt
AC
23 ms
2304 KiB
31.txt
AC
16 ms
1664 KiB
32.txt
AC
27 ms
2816 KiB
33.txt
AC
25 ms
2432 KiB
34.txt
AC
24 ms
2688 KiB
35.txt
AC
9 ms
768 KiB
36.txt
AC
26 ms
2432 KiB
37.txt
AC
2 ms
256 KiB
38.txt
AC
10 ms
896 KiB
39.txt
AC
20 ms
1664 KiB
40.txt
AC
1 ms
256 KiB
41.txt
AC
1 ms
256 KiB
42.txt
AC
1 ms
256 KiB
43.txt
AC
1 ms
256 KiB
44.txt
AC
1 ms
256 KiB
45.txt
AC
24 ms
2304 KiB
46.txt
AC
12 ms
1408 KiB
47.txt
AC
1 ms
256 KiB
48.txt
AC
22 ms
1792 KiB
49.txt
AC
4 ms
384 KiB
50.txt
AC
1 ms
256 KiB
51.txt
AC
1 ms
256 KiB
52.txt
AC
1 ms
256 KiB
s1.txt
AC
1 ms
256 KiB
s2.txt
AC
1 ms
256 KiB
s3.txt
AC
1 ms
256 KiB