Submission #996070

#	Time	Username	Problem	Language	Result	Execution time	Memory
996070		anHiep	Xylophone (JOI18_xylophone)	C++17	0 / 100	2 ms	2392 KiB

xylophone

#include "xylophone.h"
#include<bits/stdc++.h>

using namespace std;

static int a[5005];
static int d[5005][5005]; 

void solve(int n) {
	int dis = query(1, 2);
    for(int i=3; i<=n; i++) {
        d[i - 2][i] = query(i - 2, i);
        d[i - 1][i] = query(i - 1, i);
    }
    for(int i=1; i<=n; i++) {
        a[1] = i;
        for(int k=-1; k<=1; k+=2) {
            set<int> s;
            a[2] = a[1] + k*dis;
            s.insert(a[1]);
            s.insert(a[2]);
            for(int j=3; j<=n; j++) {
                int cal = max(a[j - 1], a[j - 2]) - min(a[j - 1], a[j - 2]);
                if(d[j - 2][j] == cal) {
                    if(a[j - 1] > a[j - 2]) a[j] = a[j - 1] - d[j - 1][j];
                    else a[j] = a[j - 1] + d[j - 1][j];
                }
                else {
                    if(a[j - 1] + d[j - 1][j] - min(a[j - 2], a[j - 1]) == d[j - 2][j]) a[j] = a[j - 1] + d[j - 1][j];
                    if(max(a[j - 2], a[j - 1]) - (a[j - 1] - d[j - 1][j]) == d[j - 2][j]) a[j] = a[j - 1] - d[j - 1][j];
                }
                s.insert(a[j]);
            }
            if(s.size() == n && *s.begin() == 1 && *s.rbegin() == n) {
                for(int j=1; j<=n; j++) answer(j, a[j]);
                return;
            }
        }
    }
}

Compilation message (stderr)

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:34:25: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |             if(s.size() == n && *s.begin() == 1 && *s.rbegin() == n) {
      |                ~~~~~~~~~^~~~

• Subtask 1: 0 / 11
• Subtask 2: 0 / 36
• Subtask 3: 0 / 53