Submission #9802524

---

Source Code Expand

#include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
#define rg register
using namespace std;
const int Maxn = 1e5 + 5;
typedef long long ll;
typedef ll arr[Maxn];
ll min(ll x, ll y) { return x < y ? x : y; }
ll max(ll x, ll y) { return x > y ? x : y; }
inline ll read()
{
	rg ll res = 0, sign = 1;
	rg char ch = getchar();
	while (!isdigit(ch))
	{
		if (ch == '-')
			sign = -1;
		ch = getchar();
	}
	do
	{
		res = (res << 3) + (res << 1) + (ch ^ 48);
		ch = getchar();
	} while (isdigit(ch));
	return res * sign;
}
int n;
ll dist;
arr siz, fa, dis;
struct str
{
	ll d;
	int id;
	bool operator<(str A) const { return d < A.d; }
} p[Maxn];
vector<int>to[Maxn];
void DFS(int x)
{
    dist+=dis[x];
    for(rg int i=0,nx;i<to[x].size();i++)
    {
        nx=to[x][i];
        dis[nx]=dis[x]+1;
        DFS(nx);
    }
}
void Solve(int x)
{
    for(rg int i=0,nx;i<to[x].size();i++)
    {
        nx=to[x][i];
        dis[nx]=dis[x]+n-2*siz[nx];
        Solve(nx);
    }
}
int main()
{
	int tmp, now, s;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		p[i] = {read(), i};
		siz[i] = 1;
	}
	sort(p + 1, p + n + 1);
	for (int i = n; i > 1; i--)
	{
		now = p[i].id;
		tmp = p[i].d - n + 2 * siz[now];
		fa[now] = p[s = lower_bound(p + 1, p + n + 1, (str){tmp, 0}) - p].id;
        to[fa[now]].push_back(now);
		if (p[s].d != tmp || s >= i)
		{
			puts("-1");
			return 0;
		}
		siz[fa[now]] += siz[now];
	}
    DFS(p[1].id);
    dis[p[1].id]=dist;
    Solve(p[1].id);
    for(int i=1;i<=n;i++)
        if(dis[p[i].id]!=p[i].d)
        {
            puts("-1");
            return 0;
        }
	for (int i = 1; i <= n; i++)
		if (fa[i])
			printf("%d %d\n", fa[i], i);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:90:30: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘ll {aka long long int}’ [-Wformat=]
    printf("%d %d\n", fa[i], i);
                              ^

Judge Result