oj.uz

Submission #996097

# Submission time Handle Problem Language Result Execution time Memory
996097 2024-06-10T07:57:33 Z cnn008 Xylophone (JOI18_xylophone) C++17
0 / 100
 3 ms 2392 KB 
#include <bits/stdc++.h>
#include "xylophone.h"
using namespace std;

int a[5005],d[5005][5005];

void solve(int n){
	int _=query(1,2);
	for(int i=3; i<=n; i++) d[i-2][i]=query(i-2,i);
	for(int i=2; i<=n; i++) d[i-1][i]=query(i-1,i);
	for(int i=1; i<=n; i++){
		a[1]=i;
		for(int __=-1; __<=1; __+=2){
			set <int> s;
			a[2]=a[1]+__*_;
			s.insert(a[1]);
			s.insert(a[2]);
			for(int j=3; j<=n; j++){
				int v=d[j-2][j];
				int l=d[j-1][j];
				if(v==max(a[j-1],a[j-2])-min(a[j-1],a[j-2])){
					if(a[j-1]>a[j-2]) a[j]=a[j-1]-l;
					else a[j]=a[j-1]+l;
				}else{
					int ifmin=a[j-1]-l;
					int ifmax=a[j-1]+l;
					if(ifmin>0 and max({a[j-2],a[j-1]})-ifmin==v) a[j]=ifmin;
					else a[j]=ifmax;
				}
				s.insert(a[j]);
			}
			if((int)s.size()==n and *s.begin()==1 and *s.rbegin()==n){
				for(int i=1; i<=n; i++) answer(i,a[i]);
				return;
			}
		}
	}
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 3 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Incorrect 2 ms 2392 KB Wrong Answer [7]
8 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 3 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Incorrect 2 ms 2392 KB Wrong Answer [7]
8 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 3 ms 2392 KB Output is correct
5 Correct 2 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Incorrect 2 ms 2392 KB Wrong Answer [7]
8 Halted 0 ms 0 KB -