oj.uz

Submission #704234

# Submission time Handle Problem Language Result Execution time Memory
704234 2023-03-02T01:22:31 Z Hiennoob123 Xylophone (JOI18_xylophone) C++14
0 / 100
 2 ms 208 KB 
#include "xylophone.h"
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const ll maxn = 5005;
ll T[maxn];
ll n;
ll Min = 1, Max = 2;
void solve(int x)
{
    n = x;
    T[1] = 0;
    T[2] = query(1,2);
    ll ptr = 1;
    ll cur = T[2];
    for(int i = 3; i<= n; i++)
    {
        ll value = query(i-2, i);
        ll value2 = query(i-1, i);
        if(value==abs(T[i-1]-T[i-2]))
        {
            if(T[i-2]>T[i-1]) T[i] = T[i-1]+value2;
            else T[i] = T[i-1]-value2;
        }
        else
        {
            if(T[i-2]>T[i-1])
            {
                if(abs(T[i-1]-T[i-2])+value2==value) T[i] = T[i-1]-value2;
                else
                {
                    T[i] = T[i-1]+value2;
                }
            }
            else
            {
                if(abs(T[i-1]-T[i-2])+value2==value) T[i] = T[i-1]+value2;
                else
                {
                    T[i] = T[i-1]-value2;
                }
            }
        }
    }
    ll Minn = 0;
    for(int i = 1; i<= n; i++) Minn = min(Minn, T[i]);
    for(int i = 1; i<= n; i++) T[i] += abs(Minn)+1;
    ll xMin = 0, xMax = 0;
    for(int i = 1; i<= n; i++)
    {
        if(T[i]==n) xMax = i;
        if(T[i]==1) xMin = i;
    }
    if(xMin>xMax)
    {
        for(int i = 1; i<= n/2; i++) swap(T[i], T[n+1-i]);
    }
    //for(int i = 1; i<= n; i++) cout << T[i] << " ";
    for(int i = 1; i<= n; i++)
    {
        answer(i, T[i]);
    }
}

Compilation message

xylophone.cpp: In function 'void solve(int)':
xylophone.cpp:20:8: warning: unused variable 'ptr' [-Wunused-variable]
   20 |     ll ptr = 1;
      |        ^~~
xylophone.cpp:21:8: warning: unused variable 'cur' [-Wunused-variable]
   21 |     ll cur = T[2];
      |        ^~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 36.0

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

Subtask #3
0 / 53.0

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