Submission #650484

#	Time	Username	Problem	Language	Result	Execution time	Memory
650484		Koful123	Xylophone (JOI18_xylophone)	C++17	Compilation error	0 ms	0 KiB

xylophone

#include <bits/stdc++.h>
using namespace std;

int query(int s,int t){};
void answer(int pos,int val){};

void solve(int n){
	int l = 1,r = n;
	vector<int> v(n+1),th(n+1),se(n+1);
	while(l < r){
		int m = (l + r) / 2;
		if(query(1,m) == n-1) r = m;
		else l = m + 1;
	}		
	v[l] = n;
	if(l != n){
		se[l+1] = query(l,l+1);
		v[l+1] = n - se[l+1];
	}
	for(int i=l+2;i<=n;i++){
		se[i] = query(i-1,i),th[i] = query(i-2,i);
		if(th[i] == se[i-1]){
			v[i] = v[i-1] + (v[i-2] > v[i-1] ? se[i] : -se[i]);
		}
		else{
			if(v[i-2] > v[i-1]){
				if(se[i] == th[i]) v[i] = v[i-1] + se[i];
				else v[i] = v[i-1] - se[i];
			}
			else{
				if(th[i] == se[i]) v[i] = v[i-1] - se[i];
				else v[i] = v[i-1] + se[i];;
			}
		}
	}

	if(l != 1){
		se[l-1] = query(l-1,l);
		v[l-1] = n - se[l-1];
	}	

	for(int i=l-2;i>=1;i--){
		se[i] = query(i,i+1),th[i] = query(i,i+2);
		if(th[i] == se[i+1]){
			v[i] = v[i+1] + (v[i+2] > v[i+1] ? se[i] : -se[i]);
		}
		else{
			if(v[i+2] > v[i+1]){
				if(se[i] == th[i]) v[i] = v[i+1] + se[i];
				else v[i] = v[i+1] - se[i];
			}
			else{
				if(th[i] == se[i]) v[i] = v[i+1] - se[i];
				else v[i] = v[i+1] + se[i];
			}
		}
	}
	for(int i=1;i<=n;i++){
		answer(i,v[i]);
	}
}

Compilation message (stderr)

xylophone.cpp: In function 'int query(int, int)':
xylophone.cpp:4:24: warning: no return statement in function returning non-void [-Wreturn-type]
    4 | int query(int s,int t){};
      |                        ^
/usr/bin/ld: /tmp/ccHOh7Wq.o: in function `query(int, int)':
grader.cpp:(.text+0x0): multiple definition of `query(int, int)'; /tmp/cc3D5ran.o:xylophone.cpp:(.text.unlikely+0x0): first defined here
/usr/bin/ld: /tmp/ccHOh7Wq.o: in function `answer(int, int)':
grader.cpp:(.text+0xa0): multiple definition of `answer(int, int)'; /tmp/cc3D5ran.o:xylophone.cpp:(.text+0x0): first defined here
collect2: error: ld returned 1 exit status