Submission #1693257


Source Code Expand

#include <cstdio>
#include <algorithm>
template < int xn, int xe > struct flow
{
	int head[xn], next[xe], to[xe], fl[xe], N, E, q[xn + 1], dep[xn], cur[xn];
	inline void add(int u, int v, int f)
	{
		next[E] = head[u], to[E] = v, fl[E] = f, head[u] = E++;
		next[E] = head[v], to[E] = u, fl[E] = 0, head[v] = E++;
	}
	void clear(int n)
	{
		N = n, E = 0;
		for (int i = 0; i < N; i++)
			head[i] = -1;
	}
	bool BFS()
	{
		for (int i = 0; i < N; i++)
		{
			dep[i] = 0;
			cur[i] = head[i];
		}
		int H = 0, T = 1, u;
		q[1] = 0;
		dep[0] = 1;
		while (H < T)
			for (int e = head[u = q[++H]]; ~e; e = next[e])
				if (fl[e] && !dep[to[e]])
				{
					dep[q[++T] = to[e]] = dep[u] + 1;
					if (to[e] == N - 1)
						return true;
				}
		return false;
	}
	int DFS(int p, int f)
	{
		if (p == N - 1)
			return f;
		int u = 0, y;
		for (int &e = cur[p]; ~e; e = next[e])
			if (fl[e] && dep[to[e]] == dep[p] + 1)
				if (y = DFS(to[e], std::min(f, fl[e])))
				{
					fl[e] -= y;
					fl[e ^ 1] += y;
					u += y;
					f -= y;
					if (!f)
						return u;
				}
		if (!u)
			dep[p] = 0;
		return u;
	}
	int operator () ()
	{
		int r = 0;
		while (BFS())
			r += DFS(0, 1000000000);
		return r;
	}
};
flow < 100000, 1000000 > G;
int N;
std::pair < int, int > p[502];
int main()
{
	scanf("%d", &N);
	for (int i = 1; i <= N; i++)
	{
		scanf("%d", &p[i].first);
		p[i].second = i;
	}
	p[N + 1] = { N * N + 1, 0 };
	std::sort(p + 1, p + N + 1);
	G.clear(1 + (2 * N) + (N + 1) + 1);
	for (int i = 1; i <= N; i++)
	{
		G.add(0, i, p[i].second - 1);
		G.add(0, N + i, N - p[i].second);
		for (int j = 1; j <= i; j++)
			G.add(i, N + N + j, 1000000000);
		for (int j = i + 1; j <= N + 1; j++)
			G.add(N + i, N + N + j, 1000000000);
	}
	for (int i = 1; i <= N + 1; i++)
		G.add(N + N + i, G.N - 1, p[i].first - p[i - 1].first - 1);
	if (G() != N * (N - 1))
	{
		puts("No");
		return 0;
	}
	puts("Yes");
	for (int i = 1; i <= N + 1; i++)
	{
		for (int e = G.head[N + N + i]; ~e; e = G.next[e])
			if (1 <= G.to[e] && G.to[e] <= N + N)
			{
				int u = p[G.to[e] <= N ? G.to[e] : G.to[e] - N].second, f = G.fl[e];
				while (f--)
					printf("%d ", u);
			}
		if (i <= N)
			printf("%d ", p[i].second);
	}
	puts("");
}

Submission Info

Submission Time
Task D - K-th K
User NiroBC
Language C++14 (GCC 5.4.1)
Score 800
Code Size 2314 Byte
Status AC
Exec Time 40 ms
Memory 13056 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:70:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:73:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p[i].first);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 49
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 2 ms 6272 KB
0_01.txt AC 2 ms 6272 KB
1_00.txt AC 2 ms 6272 KB
1_01.txt AC 29 ms 12928 KB
1_02.txt AC 39 ms 12928 KB
1_03.txt AC 32 ms 13056 KB
1_04.txt AC 33 ms 12928 KB
1_05.txt AC 28 ms 13056 KB
1_06.txt AC 40 ms 13056 KB
1_07.txt AC 32 ms 13056 KB
1_08.txt AC 30 ms 12928 KB
1_09.txt AC 14 ms 12032 KB
1_10.txt AC 13 ms 12032 KB
1_11.txt AC 11 ms 12032 KB
1_12.txt AC 12 ms 12032 KB
1_13.txt AC 14 ms 12032 KB
1_14.txt AC 12 ms 12032 KB
1_15.txt AC 21 ms 8320 KB
1_16.txt AC 13 ms 12032 KB
1_17.txt AC 9 ms 9984 KB
1_18.txt AC 27 ms 10880 KB
1_19.txt AC 33 ms 12928 KB
1_20.txt AC 25 ms 8448 KB
1_21.txt AC 32 ms 10880 KB
1_22.txt AC 27 ms 8704 KB
1_23.txt AC 10 ms 7808 KB
1_24.txt AC 33 ms 10880 KB
1_25.txt AC 24 ms 8448 KB
1_26.txt AC 10 ms 7808 KB
1_27.txt AC 8 ms 7680 KB
1_28.txt AC 11 ms 12032 KB
1_29.txt AC 14 ms 12032 KB
1_30.txt AC 28 ms 10752 KB
1_31.txt AC 31 ms 12928 KB
1_32.txt AC 6 ms 7936 KB
1_33.txt AC 27 ms 10880 KB
1_34.txt AC 6 ms 12032 KB
1_35.txt AC 8 ms 7552 KB
1_36.txt AC 31 ms 10880 KB
1_37.txt AC 28 ms 10752 KB
1_38.txt AC 29 ms 12928 KB
1_39.txt AC 8 ms 9984 KB
1_40.txt AC 14 ms 7424 KB
1_41.txt AC 13 ms 12032 KB
1_42.txt AC 19 ms 8064 KB
1_43.txt AC 26 ms 10752 KB
1_44.txt AC 5 ms 7552 KB
1_45.txt AC 8 ms 9984 KB
1_46.txt AC 10 ms 12032 KB