oj.uz

답안 #102450

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
102450 2019-03-25T03:57:39 Z user202729 Xylophone (JOI18_xylophone) C++17
0 / 100
 5 ms 384 KB 
#include "xylophone.h"

#include<vector>
#include<algorithm>

void solve(int n){
	if(n<=2){
		answer(1,1);
		if(n==2)
			answer(2,2);
		return;
	}

	std::vector<int> ans(n);
	int lastdiff=ans[1]=query(1,2);
	int lastsign=1;
	for(int i=2;i<n;++i){
		int diff=query(i,i+1);
		int sign=lastsign;
		if(lastdiff+diff>=n||query(i-1,i+1)!=lastdiff+diff)
			sign=-sign;
		ans[i]=ans[i-1]+sign*diff;

		lastsign=sign;
		lastdiff=diff;
	}

	int offset=1-*std::min_element(begin(ans),end(ans));
	for(int& x:ans)x+=offset;

	if(ans[0]>ans.back())
		for(int& x:ans)x=n+1-x;

	for(int i=0;i<n;++i)
		answer(i+1,ans[i]);
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Incorrect 4 ms 256 KB Wrong Answer [7]
14 Halted 0 ms 0 KB -

Subtask #2
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Incorrect 4 ms 256 KB Wrong Answer [7]
14 Halted 0 ms 0 KB -

Subtask #3
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 4 ms 256 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 256 KB Output is correct
12 Correct 4 ms 256 KB Output is correct
13 Incorrect 4 ms 256 KB Wrong Answer [7]
14 Halted 0 ms 0 KB -