답안 #58356 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58356	2018-07-17T14:44:23 Z	Benq	Xylophone (JOI18_xylophone)	C++14	100 / 100	129 ms	840 KB

xylophone

#include "xylophone.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 5001;

int d1[MX], d2[MX], res[MX];

/*
vi A = {0,5,3,4,1,2};

void answer(int a, int b) {
    cout << a << " " << b << "\n";
}

int query(int l, int r) {
    int mx = l; FOR(i,l,r+1) if (A[i] > A[mx]) mx = i;
    int mn = l; FOR(i,l,r+1) if (A[i] < A[mn]) mn = i;
    return A[mx]-A[mn];
}*/

void solve(int N) {
	FOR(i,1,N) d1[i] = query(i,i+1);
	FOR(i,1,N-1) d2[i] = query(i,i+2);
	FOR(i,1,N-1) if (max(0,max(d1[i],d1[i]+d1[i+1]))-min(0,min(d1[i],d1[i]+d1[i+1])) != d2[i]) d1[i+1] *= -1;
    /*FOR(i,1,N) cout << d1[i] << " ";
    cout << "\n";
    FOR(i,1,N-1) cout << d2[i] << " ";
    cout << "\n";*/
    
	FOR(i,2,N+1) res[i] = res[i-1]+d1[i-1];
	int lo = 1, hi = 1;
	FOR(i,2,N+1) {
		if (res[i] < res[lo]) lo = i;
		if (res[i] > res[hi]) hi = i;
	}
	if (lo > hi) {
		FOR(i,1,N+1) res[i] *= -1;
		swap(lo,hi);
	}

	int t = 1-res[lo];
	FOR(i,1,N+1) res[i] += t;

	for(int i = 1; i <= N; i++) {
		answer(i, res[i]);
	}

}

Subtask #1
11.0 / 11.0

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

Subtask #2
36.0 / 36.0

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

Subtask #3
53.0 / 53.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	436 KB	Output is correct
3	Correct	4 ms	540 KB	Output is correct
4	Correct	5 ms	540 KB	Output is correct
5	Correct	5 ms	616 KB	Output is correct
6	Correct	4 ms	616 KB	Output is correct
7	Correct	4 ms	616 KB	Output is correct
8	Correct	5 ms	616 KB	Output is correct
9	Correct	4 ms	616 KB	Output is correct
10	Correct	4 ms	616 KB	Output is correct
11	Correct	5 ms	616 KB	Output is correct
12	Correct	5 ms	616 KB	Output is correct
13	Correct	6 ms	616 KB	Output is correct
14	Correct	4 ms	616 KB	Output is correct
15	Correct	4 ms	616 KB	Output is correct
16	Correct	6 ms	616 KB	Output is correct
17	Correct	8 ms	616 KB	Output is correct
18	Correct	12 ms	616 KB	Output is correct
19	Correct	23 ms	692 KB	Output is correct
20	Correct	17 ms	692 KB	Output is correct
21	Correct	20 ms	700 KB	Output is correct
22	Correct	17 ms	700 KB	Output is correct
23	Correct	20 ms	700 KB	Output is correct
24	Correct	24 ms	700 KB	Output is correct
25	Correct	25 ms	700 KB	Output is correct
26	Correct	12 ms	700 KB	Output is correct
27	Correct	21 ms	700 KB	Output is correct
28	Correct	24 ms	700 KB	Output is correct
29	Correct	17 ms	700 KB	Output is correct
30	Correct	16 ms	700 KB	Output is correct
31	Correct	35 ms	700 KB	Output is correct
32	Correct	77 ms	700 KB	Output is correct
33	Correct	102 ms	700 KB	Output is correct
34	Correct	96 ms	708 KB	Output is correct
35	Correct	81 ms	708 KB	Output is correct
36	Correct	85 ms	708 KB	Output is correct
37	Correct	85 ms	708 KB	Output is correct
38	Correct	95 ms	708 KB	Output is correct
39	Correct	83 ms	708 KB	Output is correct
40	Correct	87 ms	708 KB	Output is correct
41	Correct	103 ms	708 KB	Output is correct
42	Correct	108 ms	708 KB	Output is correct
43	Correct	97 ms	708 KB	Output is correct
44	Correct	102 ms	708 KB	Output is correct
45	Correct	88 ms	708 KB	Output is correct
46	Correct	119 ms	708 KB	Output is correct
47	Correct	117 ms	708 KB	Output is correct
48	Correct	95 ms	708 KB	Output is correct
49	Correct	84 ms	820 KB	Output is correct
50	Correct	118 ms	820 KB	Output is correct
51	Correct	117 ms	820 KB	Output is correct
52	Correct	87 ms	820 KB	Output is correct
53	Correct	107 ms	820 KB	Output is correct
54	Correct	95 ms	820 KB	Output is correct
55	Correct	90 ms	820 KB	Output is correct
56	Correct	51 ms	820 KB	Output is correct
57	Correct	91 ms	840 KB	Output is correct
58	Correct	91 ms	840 KB	Output is correct
59	Correct	90 ms	840 KB	Output is correct
60	Correct	129 ms	840 KB	Output is correct

답안 #58356

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 36.0 / 36.0

Subtask #3 53.0 / 53.0

Subtask #1
11.0 / 11.0

Subtask #2
36.0 / 36.0

Subtask #3
53.0 / 53.0