oj.uz

Submission #1070525

# Submission time Handle Problem Language Result Execution time Memory
1070525 2024-08-22T14:58:49 Z _8_8_ Xylophone (JOI18_xylophone) C++17
47 / 100
 85 ms 98640 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);
    }
    int n_;
    bool bad(int x) {
    	return (x < 1 || x > n_ || p[x]);
    }
    void make(int v,int val) {
    	a[v] = val;
    	p[val] = v;
    }
    void solve(int n) {
    	n_ = 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;
    	if(p[1] - 1 >= 1) {
    		make(p[1] - 1,1 + QQ(p[1] - 1,p[1]));
    	}
    	for(int i = p[1] - 2;i >= 1;i--) {
    		int t2, t1, val;
    		int t = QQ(i,i + 1);
    		if(bad(a[i + 1] + t))  {
    			val = a[i + 1] - t;
    		} else if(bad(a[i + 1] - t)) {
    			val = a[i + 1] + t;
    		}
    		else {
    			t2 = QQ(i,i + 2);
    			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;
    	if(p[1] + 1 < p[n]) {
    		make(p[1] + 1,1 + QQ(p[1],p[1]+1));
    	}
    	for(int i = p[1] + 2;i < p[n];i++) {
    		int val;
    		int t2, t1;
    		int t = QQ(i - 1,i);
    		if(bad(a[i - 1] + t))  {
    			val = a[i - 1] - t;
    		} else if(bad(a[i - 1] - t)) {
    			val = a[i - 1] + t;
    		} else{
    			t2 = QQ(i - 2,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;
    			int t = QQ(i - 1,i);
    			if(bad(a[i - 1] + t))  {
    				val = a[i - 1] - t;
    			} else if(bad(a[i - 1] - t)) {
    				val = a[i - 1] + t;
    			} else{
    				t2 = QQ(i - 2,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:52:15: warning: unused variable 't1' [-Wunused-variable]
   52 |       int t2, t1, val;
      |               ^~
xylophone.cpp:85:15: warning: unused variable 't1' [-Wunused-variable]
   85 |       int t2, t1;
      |               ^~
xylophone.cpp:117:16: warning: unused variable 't1' [-Wunused-variable]
  117 |        int t2, t1;
      |                ^~
xylophone.cpp:47:10: warning: variable 'mx' set but not used [-Wunused-but-set-variable]
   47 |      int mx = 1;
      |          ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 98392 KB Output is correct
2 Correct 25 ms 98352 KB Output is correct
3 Correct 28 ms 98392 KB Output is correct
4 Correct 29 ms 98300 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 29 ms 98392 KB Output is correct
7 Correct 33 ms 98392 KB Output is correct
8 Correct 24 ms 98128 KB Output is correct
9 Correct 26 ms 98392 KB Output is correct
10 Correct 26 ms 98392 KB Output is correct
11 Correct 29 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 29 ms 98392 KB Output is correct
14 Correct 27 ms 98132 KB Output is correct
15 Correct 29 ms 98392 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 98392 KB Output is correct
2 Correct 25 ms 98352 KB Output is correct
3 Correct 28 ms 98392 KB Output is correct
4 Correct 29 ms 98300 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 29 ms 98392 KB Output is correct
7 Correct 33 ms 98392 KB Output is correct
8 Correct 24 ms 98128 KB Output is correct
9 Correct 26 ms 98392 KB Output is correct
10 Correct 26 ms 98392 KB Output is correct
11 Correct 29 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 29 ms 98392 KB Output is correct
14 Correct 27 ms 98132 KB Output is correct
15 Correct 29 ms 98392 KB Output is correct
16 Correct 30 ms 98180 KB Output is correct
17 Correct 32 ms 98128 KB Output is correct
18 Correct 31 ms 98128 KB Output is correct
19 Correct 29 ms 98240 KB Output is correct
20 Correct 35 ms 98376 KB Output is correct
21 Correct 34 ms 98384 KB Output is correct
22 Correct 37 ms 98432 KB Output is correct
23 Correct 33 ms 98392 KB Output is correct
24 Correct 33 ms 98392 KB Output is correct
25 Correct 33 ms 98392 KB Output is correct
26 Correct 35 ms 98128 KB Output is correct
27 Correct 31 ms 98280 KB Output is correct
28 Correct 38 ms 98640 KB Output is correct
29 Correct 37 ms 98392 KB Output is correct
30 Correct 34 ms 98392 KB Output is correct

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 98392 KB Output is correct
2 Correct 25 ms 98352 KB Output is correct
3 Correct 28 ms 98392 KB Output is correct
4 Correct 29 ms 98300 KB Output is correct
5 Correct 27 ms 98392 KB Output is correct
6 Correct 29 ms 98392 KB Output is correct
7 Correct 33 ms 98392 KB Output is correct
8 Correct 24 ms 98128 KB Output is correct
9 Correct 26 ms 98392 KB Output is correct
10 Correct 26 ms 98392 KB Output is correct
11 Correct 29 ms 98392 KB Output is correct
12 Correct 27 ms 98392 KB Output is correct
13 Correct 29 ms 98392 KB Output is correct
14 Correct 27 ms 98132 KB Output is correct
15 Correct 29 ms 98392 KB Output is correct
16 Correct 30 ms 98180 KB Output is correct
17 Correct 32 ms 98128 KB Output is correct
18 Correct 31 ms 98128 KB Output is correct
19 Correct 29 ms 98240 KB Output is correct
20 Correct 35 ms 98376 KB Output is correct
21 Correct 34 ms 98384 KB Output is correct
22 Correct 37 ms 98432 KB Output is correct
23 Correct 33 ms 98392 KB Output is correct
24 Correct 33 ms 98392 KB Output is correct
25 Correct 33 ms 98392 KB Output is correct
26 Correct 35 ms 98128 KB Output is correct
27 Correct 31 ms 98280 KB Output is correct
28 Correct 38 ms 98640 KB Output is correct
29 Correct 37 ms 98392 KB Output is correct
30 Correct 34 ms 98392 KB Output is correct
31 Correct 40 ms 98384 KB Output is correct
32 Correct 58 ms 98392 KB Output is correct
33 Correct 74 ms 98376 KB Output is correct
34 Correct 81 ms 98376 KB Output is correct
35 Correct 60 ms 98384 KB Output is correct
36 Correct 59 ms 98384 KB Output is correct
37 Correct 53 ms 98392 KB Output is correct
38 Incorrect 85 ms 98352 KB Wrong Answer [2]
39 Halted 0 ms 0 KB -