oj.uz

Submission #1070496

# Submission time Handle Problem Language Result Execution time Memory
1070496 2024-08-22T14:44:28 Z _8_8_ Xylophone (JOI18_xylophone) C++17
47 / 100
 95 ms 98392 KB 
#include "xylophone.h"
#include <bits/stdc++.h>
using namespace std;
int p[5002],a[5002],mem[5002][5002];
int QQ(int l,int r) {
	if(mem[l][r] != -1) {
		return mem[l][r];
	}
	return mem[l][r] = query(l,r);
}
void solve(int n) {
	memset(mem,-1,sizeof(mem));
	memset(p,0,sizeof(p));
	memset(a,0,sizeof(a));
	int nd = n - 1;
	int l = 1,r = n;
	while(r - l > 1) {
		int mid = (l + r) >> 1;
		if(QQ(1,mid) == nd) {
			r = mid;
		} else {
			l = mid;
		}
	}
	p[n] = r;
	l = 1,r = p[n];
	while(r - l > 1) {
		int mid = (l + r) >> 1;
		if(QQ(mid,p[n]) == nd) {
			l = mid;
		} else {
			r = mid;
		}
	}
	p[1] = l;
	a[p[1]] = 1;
	a[p[n]] = n;
	int mx = 1;
	for(int i = p[1] - 1;i >= 1;i--) {
		int val, T;
		T = QQ(i,p[1]);
		if(T != mx - 1) {
			val = mx = 1 + T;
		} else {
			int t2, t1;
			t2 = QQ(i,i + 2);
			t1 = QQ(i + 1,i + 2);
			int t = QQ(i,i + 1);
			if(a[i + 2] > a[i + 1]) {
				if(t2 == a[i + 2] - (a[i + 1] - t)) {
					val = a[i + 1] - t;
				} else {
					val = a[i + 1] + t;
				}
			} else {
				if(t2 == a[i + 1] + t - a[i + 2]) {
					val = a[i + 1] + t;
				} else {
					val = a[i + 1] - t;
				}
			}
		}
		// cout << i << ' ' << val << ' ' << (a[i + 2] > a[i + 1]) << '\n';
		p[val] = i;
		a[i] = val;
	}
	mx = 1;
	for(int i = p[1] + 1;i < p[n];i++) {
		int val, T;
		T = QQ(p[1],i);	
		if(T != mx - 1) {
			val = mx = 1 + T;
		} else {
			int t2, t1;
			t2 = QQ(i - 2,i);
			t1 = QQ(i - 2,i - 1);
			int t = QQ(i - 1,i);
			if(a[i - 2] > a[i - 1]) {
				if(t2 == a[i - 2] - (a[i - 1] - t)) {
					val = a[i - 1] - t;
				} else {
					val = a[i - 1] + t;
				}
			} else {
				if(t2 == a[i - 1] + t - a[i - 2]) {
					val = a[i - 1] + t;
				} else {
					val = a[i - 1] - t;
				}
			}
		}
		// cout << i << ' ' << val << '\n';
		p[val] = i;
		a[i] = val;
	}
	int mn = n;
	for(int i = p[n] + 1;i <= n;i++) {
		int val, T = QQ(p[n],i);
		if(T != n - mn) {
			mn = val = n - T;
		} else {
			int t2, t1;
			t2 = QQ(i - 2,i);
			t1 = QQ(i - 2,i - 1);
			int t = QQ(i - 1,i);
			if(a[i - 2] > a[i - 1]) {
				if(t2 == a[i - 2] - (a[i - 1] - t)) {
					val = a[i - 1] - t;
				} else {
					val = a[i - 1] + t;
				}
			} else {
				if(t2 == a[i - 1] + t - a[i - 2]) {
					val = a[i - 1] + t;
				} else {
					val = a[i - 1] - t;
				}
			}
		}
		p[val] = i;
		a[i] = val;
	}
	for(int i = 1;i <= n;i++) {
		answer(p[i],i);
	}
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:45:12: warning: variable 't1' set but not used [-Wunused-but-set-variable]
   45 |    int t2, t1;
      |            ^~
xylophone.cpp:74:12: warning: variable 't1' set but not used [-Wunused-but-set-variable]
   74 |    int t2, t1;
      |            ^~
xylophone.cpp:102:12: warning: variable 't1' set but not used [-Wunused-but-set-variable]
  102 |    int t2, t1;
      |            ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 98128 KB Output is correct
2 Correct 29 ms 98128 KB Output is correct
3 Correct 27 ms 98304 KB Output is correct
4 Correct 32 ms 98392 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 27 ms 98392 KB Output is correct
7 Correct 26 ms 98392 KB Output is correct
8 Correct 30 ms 98188 KB Output is correct
9 Correct 28 ms 98128 KB Output is correct
10 Correct 31 ms 98392 KB Output is correct
11 Correct 27 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 27 ms 98392 KB Output is correct
14 Correct 26 ms 98196 KB Output is correct
15 Correct 30 ms 98392 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 98128 KB Output is correct
2 Correct 29 ms 98128 KB Output is correct
3 Correct 27 ms 98304 KB Output is correct
4 Correct 32 ms 98392 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 27 ms 98392 KB Output is correct
7 Correct 26 ms 98392 KB Output is correct
8 Correct 30 ms 98188 KB Output is correct
9 Correct 28 ms 98128 KB Output is correct
10 Correct 31 ms 98392 KB Output is correct
11 Correct 27 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 27 ms 98392 KB Output is correct
14 Correct 26 ms 98196 KB Output is correct
15 Correct 30 ms 98392 KB Output is correct
16 Correct 26 ms 98392 KB Output is correct
17 Correct 39 ms 98132 KB Output is correct
18 Correct 44 ms 98384 KB Output is correct
19 Correct 46 ms 98392 KB Output is correct
20 Correct 37 ms 98268 KB Output is correct
21 Correct 35 ms 98392 KB Output is correct
22 Correct 37 ms 98128 KB Output is correct
23 Correct 33 ms 98128 KB Output is correct
24 Correct 42 ms 98376 KB Output is correct
25 Correct 39 ms 98380 KB Output is correct
26 Correct 53 ms 98392 KB Output is correct
27 Correct 57 ms 98392 KB Output is correct
28 Correct 43 ms 98384 KB Output is correct
29 Correct 42 ms 98392 KB Output is correct
30 Correct 44 ms 98392 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 98128 KB Output is correct
2 Correct 29 ms 98128 KB Output is correct
3 Correct 27 ms 98304 KB Output is correct
4 Correct 32 ms 98392 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 27 ms 98392 KB Output is correct
7 Correct 26 ms 98392 KB Output is correct
8 Correct 30 ms 98188 KB Output is correct
9 Correct 28 ms 98128 KB Output is correct
10 Correct 31 ms 98392 KB Output is correct
11 Correct 27 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 27 ms 98392 KB Output is correct
14 Correct 26 ms 98196 KB Output is correct
15 Correct 30 ms 98392 KB Output is correct
16 Correct 26 ms 98392 KB Output is correct
17 Correct 39 ms 98132 KB Output is correct
18 Correct 44 ms 98384 KB Output is correct
19 Correct 46 ms 98392 KB Output is correct
20 Correct 37 ms 98268 KB Output is correct
21 Correct 35 ms 98392 KB Output is correct
22 Correct 37 ms 98128 KB Output is correct
23 Correct 33 ms 98128 KB Output is correct
24 Correct 42 ms 98376 KB Output is correct
25 Correct 39 ms 98380 KB Output is correct
26 Correct 53 ms 98392 KB Output is correct
27 Correct 57 ms 98392 KB Output is correct
28 Correct 43 ms 98384 KB Output is correct
29 Correct 42 ms 98392 KB Output is correct
30 Correct 44 ms 98392 KB Output is correct
31 Correct 56 ms 98392 KB Output is correct
32 Correct 95 ms 98392 KB Output is correct
33 Incorrect 88 ms 98392 KB Wrong Answer [2]
34 Halted 0 ms 0 KB -