oj.uz

답안 #374888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
374888 2021-03-08T13:00:45 Z peijar Xylophone (JOI18_xylophone) C++17
100 / 100
 147 ms 40940 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;

static int A[5001];
static bool isLess[5001][5001];
static int queries[5001][5001];

// On a |a[i+1] - a[i]|, |a[i+2] - a[i+1]|, max(...)

// a[i] < a[i+2] < a[i+1] : z = x
// a[i+1] < a[i+2] < a[i] : z = x

// 
// a[i+1] < a[i] < a[i+2] : z = y
// a[i+2] < a[i] < a[i+1] : z = y

// a[i+2] < a[i+1] < a[i] : z > x,y
// a[i] < a[i+1] < a[i+2] : z > x,y

void solve(signed N) 
{
	isLess[1][2] = true;
	for (int i(1); i < N; ++i)
		queries[i][i+1] = query(i,i+1);
	for (int i(1); i < N-1; ++i)
		queries[i][i+2] = query(i, i+2);
	for (int i(1); i+2 <= N; ++i)
	{
		int x(queries[i][i+1]), y(queries[i+1][i+2]), z(queries[i][i+2]);
		if (x == z)
		{
			if (isLess[i][i+1])
				isLess[i][i+2] = true, isLess[i+2][i+1] = true;
			else
				isLess[i+2][i] = true, isLess[i+1][i+2] = true;
		}
		else if (z == y)
		{
			if (isLess[i][i+1])
				isLess[i+2][i] = isLess[i+2][i+1] = true;
			else
				isLess[i+1][i+2] = isLess[i][i+2] = true;
		}
		else
		{
			if (isLess[i][i+1])
				isLess[i][i+2] = isLess[i+1][i+2] = true;
			else
				isLess[i+2][i+1] = isLess[i+2][i] = true;
		}
	}
	for (int flip(0); flip < 2; ++flip)
	{
		vector<bool> seen(N+1, false);
		A[1] = 0;
		for (int i(2); i <= N; ++i)
		{
			if (isLess[i-1][i] ^ flip)
				A[i] = A[i-1] + queries[i-1][i];
			else
				A[i] = A[i-1] - queries[i-1][i];
		}
		int posMin(1);
		for (int i(2); i <= N; ++i)
			if (A[i] < A[posMin])
				posMin = i;
		int delta = A[posMin] - 1;
		for (int i(1); i <= N; ++i)
			A[i] -= delta;
		bool ok(true);
		for (int i(1); ok and i <= N; ++i)
		{
			if (A[i] < 1 or A[i] > N or seen[A[i]] or (i == posMin and seen[N]))
				ok = false;
			else
				seen[A[i]] = true;
		}
		if (ok)
		{
			for (int i(1); i <= N; ++i)
				answer(i, A[i]);
			return ;
		}
	}
	assert(false);
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct
6 Correct 3 ms 1132 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct
14 Correct 3 ms 1004 KB Output is correct
15 Correct 3 ms 1004 KB Output is correct

Subtask #2
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct
6 Correct 3 ms 1132 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct
14 Correct 3 ms 1004 KB Output is correct
15 Correct 3 ms 1004 KB Output is correct
16 Correct 7 ms 2028 KB Output is correct
17 Correct 11 ms 4076 KB Output is correct
18 Correct 19 ms 6380 KB Output is correct
19 Correct 23 ms 7660 KB Output is correct
20 Correct 23 ms 8172 KB Output is correct
21 Correct 24 ms 7660 KB Output is correct
22 Correct 25 ms 7660 KB Output is correct
23 Correct 23 ms 8428 KB Output is correct
24 Correct 25 ms 8428 KB Output is correct
25 Correct 23 ms 8468 KB Output is correct
26 Correct 22 ms 8172 KB Output is correct
27 Correct 22 ms 8192 KB Output is correct
28 Correct 25 ms 7660 KB Output is correct
29 Correct 25 ms 7788 KB Output is correct
30 Correct 30 ms 7660 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 620 KB Output is correct
4 Correct 2 ms 1004 KB Output is correct
5 Correct 3 ms 1132 KB Output is correct
6 Correct 3 ms 1132 KB Output is correct
7 Correct 3 ms 1004 KB Output is correct
8 Correct 3 ms 1004 KB Output is correct
9 Correct 3 ms 1132 KB Output is correct
10 Correct 3 ms 1132 KB Output is correct
11 Correct 3 ms 1132 KB Output is correct
12 Correct 2 ms 1132 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct
14 Correct 3 ms 1004 KB Output is correct
15 Correct 3 ms 1004 KB Output is correct
16 Correct 7 ms 2028 KB Output is correct
17 Correct 11 ms 4076 KB Output is correct
18 Correct 19 ms 6380 KB Output is correct
19 Correct 23 ms 7660 KB Output is correct
20 Correct 23 ms 8172 KB Output is correct
21 Correct 24 ms 7660 KB Output is correct
22 Correct 25 ms 7660 KB Output is correct
23 Correct 23 ms 8428 KB Output is correct
24 Correct 25 ms 8428 KB Output is correct
25 Correct 23 ms 8468 KB Output is correct
26 Correct 22 ms 8172 KB Output is correct
27 Correct 22 ms 8192 KB Output is correct
28 Correct 25 ms 7660 KB Output is correct
29 Correct 25 ms 7788 KB Output is correct
30 Correct 30 ms 7660 KB Output is correct
31 Correct 49 ms 16108 KB Output is correct
32 Correct 73 ms 22892 KB Output is correct
33 Correct 117 ms 32236 KB Output is correct
34 Correct 132 ms 36876 KB Output is correct
35 Correct 96 ms 36764 KB Output is correct
36 Correct 123 ms 40940 KB Output is correct
37 Correct 85 ms 40812 KB Output is correct
38 Correct 110 ms 40940 KB Output is correct
39 Correct 112 ms 40100 KB Output is correct
40 Correct 109 ms 36844 KB Output is correct
41 Correct 131 ms 36844 KB Output is correct
42 Correct 133 ms 40940 KB Output is correct
43 Correct 147 ms 40940 KB Output is correct
44 Correct 142 ms 40940 KB Output is correct
45 Correct 116 ms 39916 KB Output is correct
46 Correct 147 ms 39976 KB Output is correct
47 Correct 118 ms 39916 KB Output is correct
48 Correct 119 ms 40044 KB Output is correct
49 Correct 142 ms 39916 KB Output is correct
50 Correct 116 ms 40172 KB Output is correct
51 Correct 134 ms 36844 KB Output is correct
52 Correct 130 ms 36972 KB Output is correct
53 Correct 113 ms 36844 KB Output is correct
54 Correct 136 ms 36972 KB Output is correct
55 Correct 102 ms 36844 KB Output is correct
56 Correct 111 ms 36972 KB Output is correct
57 Correct 107 ms 37132 KB Output is correct
58 Correct 147 ms 37076 KB Output is correct
59 Correct 112 ms 36972 KB Output is correct
60 Correct 122 ms 36972 KB Output is correct