Submission #102448

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
102448	2019-03-25T03:34:37 Z	user202729	Xylophone (JOI18_xylophone)	C++17	0 / 100	5 ms	384 KB

xylophone

#include "xylophone.h"

#include<vector>
#include<algorithm>

void solve(int n){
	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

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 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	2 ms	384 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Incorrect	3 ms	256 KB	Wrong Answer [7]
14	Halted	0 ms	0 KB	-

Subtask #2

0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 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	2 ms	384 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Incorrect	3 ms	256 KB	Wrong Answer [7]
14	Halted	0 ms	0 KB	-

Subtask #3

0 / 53.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	384 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	2 ms	384 KB	Output is correct
6	Correct	3 ms	256 KB	Output is correct
7	Correct	4 ms	256 KB	Output is correct
8	Correct	4 ms	384 KB	Output is correct
9	Correct	4 ms	256 KB	Output is correct
10	Correct	4 ms	384 KB	Output is correct
11	Correct	3 ms	384 KB	Output is correct
12	Correct	5 ms	384 KB	Output is correct
13	Incorrect	3 ms	256 KB	Wrong Answer [7]
14	Halted	0 ms	0 KB	-