Submission #1867597
Source Code Expand
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=(a);i<=(b);i++) #define per(i,a,b) for(int i=(a);i>=(b);i--) #define forE(i,x) for(int i=head[x];i!=-1;i=ne[i]) using namespace std; typedef long long i64; typedef unsigned long long u64; typedef unsigned u32; typedef pair<int,int> pin; #define mk(a,b) make_pair(a,b) #define lowbit(x) ((x)&(-(x))) #define sqr(a) ((a)*(a)) #define clr(a) (memset((a),0,sizeof(a))) #define ls ((x)<<1) #define rs (((x)<<1)|1) #define mid (((l)+(r))>>1) #define pb push_back #define w1 first #define w2 second inline void read(int &x){ x=0;int f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} x*=f; } inline void judge(){ freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); } /*******************************head*******************************/ const int maxn=505; int n,a[maxn]; int res[maxn*maxn]; pin v[maxn]; int main(){ read(n); rep(i,1,n)read(a[i]); rep(i,1,n)v[i]=mk(a[i],i); sort(v+1,v+1+n); rep(i,1,n){ if(res[v[i].w1]){ puts("No"); return 0; } res[v[i].w1]=v[i].w2; int left=v[i].w2-1; rep(j,1,v[i].w1){ if(!left)break; if(!res[j]){ res[j]=v[i].w2; left--; } } if(left){ puts("No"); return 0; } } rep(i,1,n){ int left=n-i; rep(k,a[i]+1,n*n){ if(!left)break; if(!res[k]){ res[k]=i; left--; } }//assert(left); if(left){ puts("No"); return 0; } } puts("Yes"); // printf("%d\n",n); rep(i,1,n*n)printf("%d ",res[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - K-th K |
User | Scape |
Language | C++14 (GCC 5.4.1) |
Score | 800 |
Code Size | 1629 Byte |
Status | AC |
Exec Time | 102 ms |
Memory | 2176 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 800 / 800 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt |
All | 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 9 ms | 764 KB |
0_01.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 95 ms | 2176 KB |
1_02.txt | AC | 41 ms | 2176 KB |
1_03.txt | AC | 68 ms | 2176 KB |
1_04.txt | AC | 68 ms | 2176 KB |
1_05.txt | AC | 102 ms | 2176 KB |
1_06.txt | AC | 62 ms | 2176 KB |
1_07.txt | AC | 76 ms | 2176 KB |
1_08.txt | AC | 88 ms | 2176 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | AC | 22 ms | 768 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 42 ms | 768 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 52 ms | 1536 KB |
1_16.txt | AC | 5 ms | 384 KB |
1_17.txt | AC | 44 ms | 1024 KB |
1_18.txt | AC | 79 ms | 1920 KB |
1_19.txt | AC | 60 ms | 2048 KB |
1_20.txt | AC | 41 ms | 1664 KB |
1_21.txt | AC | 55 ms | 1920 KB |
1_22.txt | AC | 61 ms | 1792 KB |
1_23.txt | AC | 29 ms | 1024 KB |
1_24.txt | AC | 48 ms | 1920 KB |
1_25.txt | AC | 40 ms | 1536 KB |
1_26.txt | AC | 24 ms | 1024 KB |
1_27.txt | AC | 27 ms | 896 KB |
1_28.txt | AC | 2 ms | 384 KB |
1_29.txt | AC | 41 ms | 1280 KB |
1_30.txt | AC | 63 ms | 1920 KB |
1_31.txt | AC | 68 ms | 2048 KB |
1_32.txt | AC | 2 ms | 256 KB |
1_33.txt | AC | 86 ms | 2048 KB |
1_34.txt | AC | 1 ms | 256 KB |
1_35.txt | AC | 20 ms | 896 KB |
1_36.txt | AC | 73 ms | 1920 KB |
1_37.txt | AC | 60 ms | 1920 KB |
1_38.txt | AC | 84 ms | 2048 KB |
1_39.txt | AC | 2 ms | 384 KB |
1_40.txt | AC | 18 ms | 1024 KB |
1_41.txt | AC | 33 ms | 1280 KB |
1_42.txt | AC | 34 ms | 1408 KB |
1_43.txt | AC | 75 ms | 1920 KB |
1_44.txt | AC | 1 ms | 256 KB |
1_45.txt | AC | 1 ms | 256 KB |
1_46.txt | AC | 5 ms | 384 KB |