oj.uz

Submission #210299

# Submission time Handle Problem Language Result Execution time Memory
210299 2020-03-17T02:38:34 Z thomaswang Xylophone (JOI18_xylophone) C++14
100 / 100
 98 ms 504 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
#define ericxiao cin.tie(0); ios_base::sync_with_stdio(false);
#define endl '\n'
// #define int long long
using namespace std;
typedef pair<int,int> pii;
const int maxn=1e4+10;
int ans[maxn];
// int query(int s,int t){
// 	return (*max_element(ans+s,ans+t+1))-(*min_element(ans+s,ans+t+1));
// }
// void answer(int i,int a){
// 	cout<<i<<' '<<a<<endl;
// }
int two[maxn],three[maxn],a[maxn];
void solve(int n){
	for(int i=1;i<=n-1;i++) two[i]=query(i,i+1);
	for(int i=1;i<=n-2;i++) three[i]=query(i,i+2);
	a[2]=two[1];
	for(int i=3;i<=n;i++){
		a[i]=a[i-1]+two[i-1];
		if(max({a[i-2],a[i-1],a[i]})-min({a[i-2],a[i-1],a[i]})==three[i-2])
			continue;
		a[i]=a[i-1]-two[i-1];
	}
	int minn=*min_element(a+1,a+1+n);
	if(max_element(a+1,a+1+n)-min_element(a+1,a+1+n)>0)
		for(int i=1;i<=n;i++)
			answer(i,a[i]-minn+1);
	else
		for(int i=1;i<=n;i++)
			answer(i,n-a[i]+minn);
}
// signed main(){
// 	int n; cin>>n;
// 	for(int i=1;i<=n;i++) cin>>ans[i];
// 	solve(n);
// 	return 0;
// }

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 248 KB Output is correct
13 Correct 7 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 5 ms 324 KB Output is correct

Subtask #2
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 248 KB Output is correct
13 Correct 7 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 5 ms 324 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 16 ms 376 KB Output is correct
18 Correct 21 ms 376 KB Output is correct
19 Correct 26 ms 248 KB Output is correct
20 Correct 20 ms 376 KB Output is correct
21 Correct 26 ms 248 KB Output is correct
22 Correct 22 ms 376 KB Output is correct
23 Correct 19 ms 248 KB Output is correct
24 Correct 27 ms 376 KB Output is correct
25 Correct 28 ms 328 KB Output is correct
26 Correct 23 ms 404 KB Output is correct
27 Correct 23 ms 248 KB Output is correct
28 Correct 21 ms 248 KB Output is correct
29 Correct 25 ms 248 KB Output is correct
30 Correct 25 ms 248 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 4 ms 248 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 6 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 248 KB Output is correct
7 Correct 7 ms 248 KB Output is correct
8 Correct 6 ms 504 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 7 ms 248 KB Output is correct
12 Correct 6 ms 248 KB Output is correct
13 Correct 7 ms 248 KB Output is correct
14 Correct 6 ms 248 KB Output is correct
15 Correct 5 ms 324 KB Output is correct
16 Correct 8 ms 376 KB Output is correct
17 Correct 16 ms 376 KB Output is correct
18 Correct 21 ms 376 KB Output is correct
19 Correct 26 ms 248 KB Output is correct
20 Correct 20 ms 376 KB Output is correct
21 Correct 26 ms 248 KB Output is correct
22 Correct 22 ms 376 KB Output is correct
23 Correct 19 ms 248 KB Output is correct
24 Correct 27 ms 376 KB Output is correct
25 Correct 28 ms 328 KB Output is correct
26 Correct 23 ms 404 KB Output is correct
27 Correct 23 ms 248 KB Output is correct
28 Correct 21 ms 248 KB Output is correct
29 Correct 25 ms 248 KB Output is correct
30 Correct 25 ms 248 KB Output is correct
31 Correct 43 ms 376 KB Output is correct
32 Correct 58 ms 376 KB Output is correct
33 Correct 81 ms 376 KB Output is correct
34 Correct 84 ms 376 KB Output is correct
35 Correct 86 ms 380 KB Output is correct
36 Correct 98 ms 376 KB Output is correct
37 Correct 98 ms 340 KB Output is correct
38 Correct 52 ms 320 KB Output is correct
39 Correct 91 ms 376 KB Output is correct
40 Correct 89 ms 376 KB Output is correct
41 Correct 81 ms 376 KB Output is correct
42 Correct 90 ms 376 KB Output is correct
43 Correct 96 ms 376 KB Output is correct
44 Correct 85 ms 376 KB Output is correct
45 Correct 94 ms 376 KB Output is correct
46 Correct 88 ms 376 KB Output is correct
47 Correct 82 ms 328 KB Output is correct
48 Correct 86 ms 504 KB Output is correct
49 Correct 88 ms 376 KB Output is correct
50 Correct 95 ms 376 KB Output is correct
51 Correct 96 ms 376 KB Output is correct
52 Correct 92 ms 376 KB Output is correct
53 Correct 92 ms 376 KB Output is correct
54 Correct 91 ms 376 KB Output is correct
55 Correct 92 ms 376 KB Output is correct
56 Correct 91 ms 376 KB Output is correct
57 Correct 86 ms 332 KB Output is correct
58 Correct 93 ms 376 KB Output is correct
59 Correct 91 ms 376 KB Output is correct
60 Correct 96 ms 352 KB Output is correct