Submission #3452376
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;++i)
typedef long long ll;
char cch;
inline ll rd(){
ll x=0,fl=1;
cch=getchar();
while(cch>'9'||cch<'0'){
if(cch=='-') fl=-1;
cch=getchar();
}
while(cch>='0'&&cch<='9') x=(x<<3)+(x<<1)+cch-'0',cch=getchar();
return x*fl;
}
const int N=1e5+3;
struct abc{
int i;
ll d;
}a[N];
int fr[N],head[N],to[N],nxt[N],cnt,sz[N];
ll re,c[N];
inline bool cmp(const abc &a,const abc &b){
return a.d<b.d;
}
inline void adde(int u,int v){
to[++cnt]=v,fr[cnt]=u,nxt[cnt]=head[u],head[u]=cnt;
}
inline void dfs(int u,int fa,int dep){
re+=dep;
for(int i=head[u];i;i=nxt[i]){
dfs(to[i],u,dep+1);
}
}
int main(){
int n;
scanf("%d",&n);
rep(i,1,n) a[i].d=rd(),a[i].i=i,sz[i]=1;
sort(a+1,a+1+n,cmp);
rep(i,1,n) c[i]=a[i].d;
int pos;
ll tmp;
for(int i=n;i>1;--i){
tmp=a[i].d-(n-sz[a[i].i])+sz[a[i].i];
pos=lower_bound(c+1,c+n+1,tmp)-c;
if(c[pos]!=tmp){
puts("-1");return 0;
}
else sz[a[pos].i]+=sz[a[i].i],adde(a[pos].i,a[i].i);
}
dfs(a[1].i,0,0);
if(re!=a[1].d){
puts("-1");return 0;
}
for(int i=1;i<n;++i){
printf("%d %d\n",fr[i],to[i]);
}
}
Submission Info
Submission Time
2018-10-22 21:44:34+0900
Task
F - Distance Sums
User
Doingdong
Language
C++14 (GCC 5.4.1)
Score
900
Code Size
1205 Byte
Status
AC
Exec Time
41 ms
Memory
6784 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:37:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
900 / 900
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 4.txt, 40.txt, 41.txt, 42.txt, 5.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
1.txt
AC
2 ms
2304 KB
10.txt
AC
41 ms
6784 KB
11.txt
AC
23 ms
4224 KB
12.txt
AC
21 ms
3840 KB
13.txt
AC
24 ms
4352 KB
14.txt
AC
41 ms
6784 KB
15.txt
AC
41 ms
6784 KB
16.txt
AC
41 ms
6656 KB
17.txt
AC
41 ms
6528 KB
18.txt
AC
21 ms
3968 KB
19.txt
AC
41 ms
6784 KB
2.txt
AC
2 ms
2304 KB
20.txt
AC
41 ms
6784 KB
21.txt
AC
18 ms
3456 KB
22.txt
AC
41 ms
6784 KB
23.txt
AC
41 ms
6656 KB
24.txt
AC
37 ms
6144 KB
25.txt
AC
21 ms
3840 KB
26.txt
AC
21 ms
3840 KB
27.txt
AC
21 ms
3840 KB
28.txt
AC
20 ms
3712 KB
29.txt
AC
41 ms
6528 KB
3.txt
AC
5 ms
2688 KB
30.txt
AC
41 ms
6656 KB
31.txt
AC
41 ms
6400 KB
32.txt
AC
41 ms
6528 KB
33.txt
AC
28 ms
5248 KB
34.txt
AC
41 ms
6656 KB
35.txt
AC
28 ms
5504 KB
36.txt
AC
28 ms
5632 KB
37.txt
AC
41 ms
6656 KB
38.txt
AC
41 ms
6656 KB
39.txt
AC
41 ms
6784 KB
4.txt
AC
3 ms
2560 KB
40.txt
AC
41 ms
6528 KB
41.txt
AC
41 ms
6400 KB
42.txt
AC
33 ms
5632 KB
5.txt
AC
21 ms
4480 KB
6.txt
AC
41 ms
6784 KB
7.txt
AC
41 ms
6784 KB
8.txt
AC
41 ms
6784 KB
9.txt
AC
41 ms
6784 KB
sample1.txt
AC
2 ms
2304 KB
sample2.txt
AC
1 ms
2304 KB
sample3.txt
AC
1 ms
2304 KB