oj.uz

답안 #446757

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446757 2021-07-23T08:08:33 Z maomao90 Just Long Neckties (JOI20_ho_t1) C++17
100 / 100
 123 ms 13184 KB 
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifdef DEBUG
#define debug(args...) _debug(args)
void _debug(const char* format, ...) {
	va_list args;
	va_start(args, format);
	vprintf(format, args);
	va_end(args);
}
#else
#define debug(args...)
#endif

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 200005

int n;
ii a[MAXN];
int b[MAXN];
ll pre[MAXN], pst[MAXN], ans[MAXN];

int main() {
	scanf("%d", &n);
	REP (i, 1, n + 2) {
		scanf("%d", &a[i].FI);
		a[i].SE = i;
	}
	REP (i, 1, n + 1) {
		scanf("%d", &b[i]);
	}
	sort(a + 1, a + n + 2);
	sort(b + 1, b + n + 1);
	REP (i, 1, n + 1) {
		pre[i] = max(a[i].FI - b[i], 0);
		debug("%d: %d\n", i, pre[i]);
		mxto(pre[i], pre[i - 1]);
	}
	RREP (i, n + 1, 2) {
		pst[i] = max(a[i].FI - b[i - 1], 0);
		debug("%d: %d\n", i, pst[i]);
		mxto(pst[i], pst[i + 1]);
	}
	REP (i, 1, n + 2) {
		debug("%d: %d %d\n", a[i].SE, pre[i - 1], pst[i + 1]);
		ans[a[i].SE] = max(pre[i - 1], pst[i + 1]);
	}
	REP (i, 1, n + 2) {
		printf("%lld ", ans[i]);
	}
	printf("\n");
	return 0;
}

Compilation message

ho_t1.cpp: In function 'int main()':
ho_t1.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
ho_t1.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   50 |   scanf("%d", &a[i].FI);
      |   ~~~~~^~~~~~~~~~~~~~~~
ho_t1.cpp:54:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |   scanf("%d", &b[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct

Subtask #3
91.0 / 91.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 316 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 2 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 111 ms 12112 KB Output is correct
34 Correct 115 ms 12696 KB Output is correct
35 Correct 113 ms 12352 KB Output is correct
36 Correct 113 ms 12740 KB Output is correct
37 Correct 123 ms 13184 KB Output is correct
38 Correct 116 ms 12928 KB Output is correct
39 Correct 114 ms 12084 KB Output is correct
40 Correct 113 ms 11964 KB Output is correct
41 Correct 114 ms 12060 KB Output is correct
42 Correct 112 ms 12072 KB Output is correct
43 Correct 113 ms 11988 KB Output is correct
44 Correct 110 ms 11620 KB Output is correct
45 Correct 109 ms 11588 KB Output is correct
46 Correct 114 ms 11504 KB Output is correct
47 Correct 104 ms 11704 KB Output is correct
48 Correct 108 ms 11672 KB Output is correct
49 Correct 115 ms 12272 KB Output is correct
50 Correct 116 ms 12272 KB Output is correct
51 Correct 120 ms 12352 KB Output is correct
52 Correct 116 ms 12264 KB Output is correct
53 Correct 121 ms 12340 KB Output is correct